org.xmlpull.infoset.xpath.jaxen.pattern.UnionPattern Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of xpp5 Show documentation
Show all versions of xpp5 Show documentation
XML Pull parser library developed by Extreme Computing Lab, Indian University
/*
* $Header: /l/extreme/cvs/codes/xpp5/xis5/infoset_xpath_jaxen/org/xmlpull/infoset/xpath/jaxen/pattern/UnionPattern.java,v 1.1 2005/05/16 23:59:27 aslom Exp $
* $Revision: 1.1 $
* $Date: 2005/05/16 23:59:27 $
*
* ====================================================================
*
* Copyright (C) 2000-2002 bob mcwhirter & James Strachan.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions, and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions, and the disclaimer that follows
* these conditions in the documentation and/or other materials
* provided with the distribution.
*
* 3. The name "Jaxen" must not be used to endorse or promote products
* derived from this software without prior written permission. For
* written permission, please contact [email protected].
*
* 4. Products derived from this software may not be called "Jaxen", nor
* may "Jaxen" appear in their name, without prior written permission
* from the Jaxen Project Management ([email protected]).
*
* In addition, we request (but do not require) that you include in the
* end-user documentation provided with the redistribution and/or in the
* software itself an acknowledgement equivalent to the following:
* "This product includes software developed by the
* Jaxen Project (http://www.jaxen.org/)."
* Alternatively, the acknowledgment may be graphical using the logos
* available at http://www.jaxen.org/
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
* WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE Jaxen AUTHORS OR THE PROJECT
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* ====================================================================
* This software consists of voluntary contributions made by many
* individuals on behalf of the Jaxen Project and was originally
* created by bob mcwhirter and
* James Strachan . For more information on the
* Jaxen Project, please see UnionPattern represents a union pattern.
*
* @author James Strachan
* @version $Revision: 1.1 $
*/
public class UnionPattern extends Pattern {
private Pattern lhs;
private Pattern rhs;
private short nodeType = ANY_NODE;
private String matchesNodeName = null;
public UnionPattern()
{
}
public UnionPattern(Pattern lhs, Pattern rhs)
{
this.lhs = lhs;
this.rhs = rhs;
init();
}
public Pattern getLHS()
{
return lhs;
}
public void setLHS(Pattern lhs)
{
this.lhs = lhs;
init();
}
public Pattern getRHS()
{
return rhs;
}
public void setRHS(Pattern rhs)
{
this.rhs = rhs;
init();
}
// Pattern interface
//-------------------------------------------------------------------------
/** @return true if the pattern matches the given node
*/
public boolean matches( Object node, Context context ) throws JaxenException
{
return lhs.matches( node, context ) || rhs.matches( node, context );
}
public Pattern[] getUnionPatterns()
{
return new Pattern[] { lhs, rhs };
}
public short getMatchType()
{
return nodeType;
}
public String getMatchesNodeName()
{
return matchesNodeName;
}
public Pattern simplify()
{
this.lhs = lhs.simplify();
this.rhs = rhs.simplify();
init();
return this;
}
public String getText()
{
return lhs.getText() + " | " + rhs.getText();
}
public String toString()
{
return super.toString() + "[ lhs: " + lhs + " rhs: " + rhs + " ]";
}
// Implementation methods
//-------------------------------------------------------------------------
private void init()
{
short type1 = lhs.getMatchType();
short type2 = rhs.getMatchType();
this.nodeType = ( type1 == type2 ) ? type1 : ANY_NODE;
String name1 = lhs.getMatchesNodeName();
String name2 = rhs.getMatchesNodeName();
this.matchesNodeName = null;
if ( name1 != null && name2 != null && name1.equals( name2 ) )
{
this.matchesNodeName = name1;
}
}
}