Java Code Examples for com.sun.org.apache.xml.internal.dtm.Axis#FOLLOWINGSIBLING

The following examples show how to use com.sun.org.apache.xml.internal.dtm.Axis#FOLLOWINGSIBLING . You can vote up the ones you like or vote down the ones you don't like, and go to the original project or source file by following the links above each example. You may check out the related API usage on the sidebar.
Example 1
Source File: SAXImpl.java    From jdk8u60 with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * This is a shortcut to the iterators that implement the
 * supported XPath axes (only namespace::) is not supported.
 * Returns a bare-bones iterator that must be initialized
 * with a start node (using iterator.setStartNode()).
 */
public DTMAxisIterator getAxisIterator(final int axis)
{
    switch (axis)
    {
        case Axis.SELF:
            return new SingletonIterator();
        case Axis.CHILD:
            return new ChildrenIterator();
        case Axis.PARENT:
            return new ParentIterator();
        case Axis.ANCESTOR:
            return new AncestorIterator();
        case Axis.ANCESTORORSELF:
            return (new AncestorIterator()).includeSelf();
        case Axis.ATTRIBUTE:
            return new AttributeIterator();
        case Axis.DESCENDANT:
            return new DescendantIterator();
        case Axis.DESCENDANTORSELF:
            return (new DescendantIterator()).includeSelf();
        case Axis.FOLLOWING:
            return new FollowingIterator();
        case Axis.PRECEDING:
            return new PrecedingIterator();
        case Axis.FOLLOWINGSIBLING:
            return new FollowingSiblingIterator();
        case Axis.PRECEDINGSIBLING:
            return new PrecedingSiblingIterator();
        case Axis.NAMESPACE:
            return new NamespaceIterator();
        case Axis.ROOT:
            return new RootIterator();
        default:
            BasisLibrary.runTimeError(BasisLibrary.AXIS_SUPPORT_ERR,
                    Axis.getNames(axis));
    }
    return null;
}
Example 2
Source File: SAXImpl.java    From hottub with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * This is a shortcut to the iterators that implement the
 * supported XPath axes (only namespace::) is not supported.
 * Returns a bare-bones iterator that must be initialized
 * with a start node (using iterator.setStartNode()).
 */
public DTMAxisIterator getAxisIterator(final int axis)
{
    switch (axis)
    {
        case Axis.SELF:
            return new SingletonIterator();
        case Axis.CHILD:
            return new ChildrenIterator();
        case Axis.PARENT:
            return new ParentIterator();
        case Axis.ANCESTOR:
            return new AncestorIterator();
        case Axis.ANCESTORORSELF:
            return (new AncestorIterator()).includeSelf();
        case Axis.ATTRIBUTE:
            return new AttributeIterator();
        case Axis.DESCENDANT:
            return new DescendantIterator();
        case Axis.DESCENDANTORSELF:
            return (new DescendantIterator()).includeSelf();
        case Axis.FOLLOWING:
            return new FollowingIterator();
        case Axis.PRECEDING:
            return new PrecedingIterator();
        case Axis.FOLLOWINGSIBLING:
            return new FollowingSiblingIterator();
        case Axis.PRECEDINGSIBLING:
            return new PrecedingSiblingIterator();
        case Axis.NAMESPACE:
            return new NamespaceIterator();
        case Axis.ROOT:
            return new RootIterator();
        default:
            BasisLibrary.runTimeError(BasisLibrary.AXIS_SUPPORT_ERR,
                    Axis.getNames(axis));
    }
    return null;
}
Example 3
Source File: SAXImpl.java    From JDKSourceCode1.8 with MIT License 5 votes vote down vote up 
/**
 * This is a shortcut to the iterators that implement the
 * supported XPath axes (only namespace::) is not supported.
 * Returns a bare-bones iterator that must be initialized
 * with a start node (using iterator.setStartNode()).
 */
public DTMAxisIterator getAxisIterator(final int axis)
{
    switch (axis)
    {
        case Axis.SELF:
            return new SingletonIterator();
        case Axis.CHILD:
            return new ChildrenIterator();
        case Axis.PARENT:
            return new ParentIterator();
        case Axis.ANCESTOR:
            return new AncestorIterator();
        case Axis.ANCESTORORSELF:
            return (new AncestorIterator()).includeSelf();
        case Axis.ATTRIBUTE:
            return new AttributeIterator();
        case Axis.DESCENDANT:
            return new DescendantIterator();
        case Axis.DESCENDANTORSELF:
            return (new DescendantIterator()).includeSelf();
        case Axis.FOLLOWING:
            return new FollowingIterator();
        case Axis.PRECEDING:
            return new PrecedingIterator();
        case Axis.FOLLOWINGSIBLING:
            return new FollowingSiblingIterator();
        case Axis.PRECEDINGSIBLING:
            return new PrecedingSiblingIterator();
        case Axis.NAMESPACE:
            return new NamespaceIterator();
        case Axis.ROOT:
            return new RootIterator();
        default:
            BasisLibrary.runTimeError(BasisLibrary.AXIS_SUPPORT_ERR,
                    Axis.getNames(axis));
    }
    return null;
}
Example 4
Source File: SAXImpl.java    From openjdk-8-source with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * This is a shortcut to the iterators that implement the
 * supported XPath axes (only namespace::) is not supported.
 * Returns a bare-bones iterator that must be initialized
 * with a start node (using iterator.setStartNode()).
 */
public DTMAxisIterator getAxisIterator(final int axis)
{
    switch (axis)
    {
        case Axis.SELF:
            return new SingletonIterator();
        case Axis.CHILD:
            return new ChildrenIterator();
        case Axis.PARENT:
            return new ParentIterator();
        case Axis.ANCESTOR:
            return new AncestorIterator();
        case Axis.ANCESTORORSELF:
            return (new AncestorIterator()).includeSelf();
        case Axis.ATTRIBUTE:
            return new AttributeIterator();
        case Axis.DESCENDANT:
            return new DescendantIterator();
        case Axis.DESCENDANTORSELF:
            return (new DescendantIterator()).includeSelf();
        case Axis.FOLLOWING:
            return new FollowingIterator();
        case Axis.PRECEDING:
            return new PrecedingIterator();
        case Axis.FOLLOWINGSIBLING:
            return new FollowingSiblingIterator();
        case Axis.PRECEDINGSIBLING:
            return new PrecedingSiblingIterator();
        case Axis.NAMESPACE:
            return new NamespaceIterator();
        case Axis.ROOT:
            return new RootIterator();
        default:
            BasisLibrary.runTimeError(BasisLibrary.AXIS_SUPPORT_ERR,
                    Axis.getNames(axis));
    }
    return null;
}
Example 5
Source File: SAXImpl.java    From TencentKona-8 with GNU General Public License v2.0 5 votes vote down vote up 
/**
 * This is a shortcut to the iterators that implement the
 * supported XPath axes (only namespace::) is not supported.
 * Returns a bare-bones iterator that must be initialized
 * with a start node (using iterator.setStartNode()).
 */
public DTMAxisIterator getAxisIterator(final int axis)
{
    switch (axis)
    {
        case Axis.SELF:
            return new SingletonIterator();
        case Axis.CHILD:
            return new ChildrenIterator();
        case Axis.PARENT:
            return new ParentIterator();
        case Axis.ANCESTOR:
            return new AncestorIterator();
        case Axis.ANCESTORORSELF:
            return (new AncestorIterator()).includeSelf();
        case Axis.ATTRIBUTE:
            return new AttributeIterator();
        case Axis.DESCENDANT:
            return new DescendantIterator();
        case Axis.DESCENDANTORSELF:
            return (new DescendantIterator()).includeSelf();
        case Axis.FOLLOWING:
            return new FollowingIterator();
        case Axis.PRECEDING:
            return new PrecedingIterator();
        case Axis.FOLLOWINGSIBLING:
            return new FollowingSiblingIterator();
        case Axis.PRECEDINGSIBLING:
            return new PrecedingSiblingIterator();
        case Axis.NAMESPACE:
            return new NamespaceIterator();
        case Axis.ROOT:
            return new RootIterator();
        default:
            BasisLibrary.runTimeError(BasisLibrary.AXIS_SUPPORT_ERR,
                    Axis.getNames(axis));
    }
    return null;
}
Example 6
Source File: WalkerFactory.java    From jdk1.8-source-analysis with Apache License 2.0 4 votes vote down vote up 
/**
 * Get a corresponding BIT_XXX from an axis.
 * @param axis One of Axis.ANCESTOR, etc.
 * @return One of BIT_ANCESTOR, etc.
 */
static public int getAnalysisBitFromAxes(int axis)
{
  switch (axis) // Generate new traverser
    {
    case Axis.ANCESTOR :
      return BIT_ANCESTOR;
    case Axis.ANCESTORORSELF :
      return BIT_ANCESTOR_OR_SELF;
    case Axis.ATTRIBUTE :
      return BIT_ATTRIBUTE;
    case Axis.CHILD :
      return BIT_CHILD;
    case Axis.DESCENDANT :
      return BIT_DESCENDANT;
    case Axis.DESCENDANTORSELF :
      return BIT_DESCENDANT_OR_SELF;
    case Axis.FOLLOWING :
      return BIT_FOLLOWING;
    case Axis.FOLLOWINGSIBLING :
      return BIT_FOLLOWING_SIBLING;
    case Axis.NAMESPACE :
    case Axis.NAMESPACEDECLS :
      return BIT_NAMESPACE;
    case Axis.PARENT :
      return BIT_PARENT;
    case Axis.PRECEDING :
      return BIT_PRECEDING;
    case Axis.PRECEDINGSIBLING :
      return BIT_PRECEDING_SIBLING;
    case Axis.SELF :
      return BIT_SELF;
    case Axis.ALLFROMNODE :
      return BIT_DESCENDANT_OR_SELF;
      // case Axis.PRECEDINGANDANCESTOR :
    case Axis.DESCENDANTSFROMROOT :
    case Axis.ALL :
    case Axis.DESCENDANTSORSELFFROMROOT :
      return BIT_ANY_DESCENDANT_FROM_ROOT;
    case Axis.ROOT :
      return BIT_ROOT;
    case Axis.FILTEREDLIST :
      return BIT_FILTER;
    default :
      return BIT_FILTER;
  }
}
Example 7
Source File: SAXImpl.java    From TencentKona-8 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Similar to getAxisIterator, but this one returns an iterator
 * containing nodes of a typed axis (ex.: child::foo)
 */
public DTMAxisIterator getTypedAxisIterator(int axis, int type)
{
    // Most common case handled first
    if (axis == Axis.CHILD) {
        return new TypedChildrenIterator(type);
    }

    if (type == NO_TYPE) {
        return(EMPTYITERATOR);
    }

    switch (axis)
    {
        case Axis.SELF:
            return new TypedSingletonIterator(type);
        case Axis.CHILD:
            return new TypedChildrenIterator(type);
        case Axis.PARENT:
            return new ParentIterator().setNodeType(type);
        case Axis.ANCESTOR:
            return new TypedAncestorIterator(type);
        case Axis.ANCESTORORSELF:
            return (new TypedAncestorIterator(type)).includeSelf();
        case Axis.ATTRIBUTE:
            return new TypedAttributeIterator(type);
        case Axis.DESCENDANT:
            return new TypedDescendantIterator(type);
        case Axis.DESCENDANTORSELF:
            return (new TypedDescendantIterator(type)).includeSelf();
        case Axis.FOLLOWING:
            return new TypedFollowingIterator(type);
        case Axis.PRECEDING:
            return new TypedPrecedingIterator(type);
        case Axis.FOLLOWINGSIBLING:
            return new TypedFollowingSiblingIterator(type);
        case Axis.PRECEDINGSIBLING:
            return new TypedPrecedingSiblingIterator(type);
        case Axis.NAMESPACE:
            return  new TypedNamespaceIterator(type);
        case Axis.ROOT:
            return new TypedRootIterator(type);
        default:
            BasisLibrary.runTimeError(BasisLibrary.TYPED_AXIS_SUPPORT_ERR,
                    Axis.getNames(axis));
    }
    return null;
}
Example 8
Source File: WalkerFactory.java    From openjdk-8 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Get a corresponding BIT_XXX from an axis.
 * @param axis One of Axis.ANCESTOR, etc.
 * @return One of BIT_ANCESTOR, etc.
 */
static public int getAnalysisBitFromAxes(int axis)
{
  switch (axis) // Generate new traverser
    {
    case Axis.ANCESTOR :
      return BIT_ANCESTOR;
    case Axis.ANCESTORORSELF :
      return BIT_ANCESTOR_OR_SELF;
    case Axis.ATTRIBUTE :
      return BIT_ATTRIBUTE;
    case Axis.CHILD :
      return BIT_CHILD;
    case Axis.DESCENDANT :
      return BIT_DESCENDANT;
    case Axis.DESCENDANTORSELF :
      return BIT_DESCENDANT_OR_SELF;
    case Axis.FOLLOWING :
      return BIT_FOLLOWING;
    case Axis.FOLLOWINGSIBLING :
      return BIT_FOLLOWING_SIBLING;
    case Axis.NAMESPACE :
    case Axis.NAMESPACEDECLS :
      return BIT_NAMESPACE;
    case Axis.PARENT :
      return BIT_PARENT;
    case Axis.PRECEDING :
      return BIT_PRECEDING;
    case Axis.PRECEDINGSIBLING :
      return BIT_PRECEDING_SIBLING;
    case Axis.SELF :
      return BIT_SELF;
    case Axis.ALLFROMNODE :
      return BIT_DESCENDANT_OR_SELF;
      // case Axis.PRECEDINGANDANCESTOR :
    case Axis.DESCENDANTSFROMROOT :
    case Axis.ALL :
    case Axis.DESCENDANTSORSELFFROMROOT :
      return BIT_ANY_DESCENDANT_FROM_ROOT;
    case Axis.ROOT :
      return BIT_ROOT;
    case Axis.FILTEREDLIST :
      return BIT_FILTER;
    default :
      return BIT_FILTER;
  }
}
Example 9
Source File: WalkerFactory.java    From TencentKona-8 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Special purpose function to see if we can optimize the pattern for
 * a DescendantIterator.
 *
 * @param compiler non-null reference to compiler object that has processed
 *                 the XPath operations into an opcode map.
 * @param stepOpCodePos The opcode position for the step.
 *
 * @return 32 bits as an integer that give information about the location
 * path as a whole.
 *
 * @throws javax.xml.transform.TransformerException
 */
public static int getAxisFromStep(
        Compiler compiler, int stepOpCodePos)
          throws javax.xml.transform.TransformerException
{

  int stepType = compiler.getOp(stepOpCodePos);

  switch (stepType)
  {
  case OpCodes.FROM_FOLLOWING :
    return Axis.FOLLOWING;
  case OpCodes.FROM_FOLLOWING_SIBLINGS :
    return Axis.FOLLOWINGSIBLING;
  case OpCodes.FROM_PRECEDING :
    return Axis.PRECEDING;
  case OpCodes.FROM_PRECEDING_SIBLINGS :
    return Axis.PRECEDINGSIBLING;
  case OpCodes.FROM_PARENT :
    return Axis.PARENT;
  case OpCodes.FROM_NAMESPACE :
    return Axis.NAMESPACE;
  case OpCodes.FROM_ANCESTORS :
    return Axis.ANCESTOR;
  case OpCodes.FROM_ANCESTORS_OR_SELF :
    return Axis.ANCESTORORSELF;
  case OpCodes.FROM_ATTRIBUTES :
    return Axis.ATTRIBUTE;
  case OpCodes.FROM_ROOT :
    return Axis.ROOT;
  case OpCodes.FROM_CHILDREN :
    return Axis.CHILD;
  case OpCodes.FROM_DESCENDANTS_OR_SELF :
    return Axis.DESCENDANTORSELF;
  case OpCodes.FROM_DESCENDANTS :
    return Axis.DESCENDANT;
  case OpCodes.FROM_SELF :
    return Axis.SELF;
  case OpCodes.OP_EXTFUNCTION :
  case OpCodes.OP_FUNCTION :
  case OpCodes.OP_GROUP :
  case OpCodes.OP_VARIABLE :
    return Axis.FILTEREDLIST;
  }

  throw new RuntimeException(XSLMessages.createXPATHMessage(XPATHErrorResources.ER_NULL_ERROR_HANDLER, new Object[]{Integer.toString(stepType)})); //"Programmer's assertion: unknown opcode: "
                             //+ stepType);
 }
Example 10
Source File: WalkerFactory.java    From hottub with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Special purpose function to see if we can optimize the pattern for
 * a DescendantIterator.
 *
 * @param compiler non-null reference to compiler object that has processed
 *                 the XPath operations into an opcode map.
 * @param stepOpCodePos The opcode position for the step.
 *
 * @return 32 bits as an integer that give information about the location
 * path as a whole.
 *
 * @throws javax.xml.transform.TransformerException
 */
public static int getAxisFromStep(
        Compiler compiler, int stepOpCodePos)
          throws javax.xml.transform.TransformerException
{

  int stepType = compiler.getOp(stepOpCodePos);

  switch (stepType)
  {
  case OpCodes.FROM_FOLLOWING :
    return Axis.FOLLOWING;
  case OpCodes.FROM_FOLLOWING_SIBLINGS :
    return Axis.FOLLOWINGSIBLING;
  case OpCodes.FROM_PRECEDING :
    return Axis.PRECEDING;
  case OpCodes.FROM_PRECEDING_SIBLINGS :
    return Axis.PRECEDINGSIBLING;
  case OpCodes.FROM_PARENT :
    return Axis.PARENT;
  case OpCodes.FROM_NAMESPACE :
    return Axis.NAMESPACE;
  case OpCodes.FROM_ANCESTORS :
    return Axis.ANCESTOR;
  case OpCodes.FROM_ANCESTORS_OR_SELF :
    return Axis.ANCESTORORSELF;
  case OpCodes.FROM_ATTRIBUTES :
    return Axis.ATTRIBUTE;
  case OpCodes.FROM_ROOT :
    return Axis.ROOT;
  case OpCodes.FROM_CHILDREN :
    return Axis.CHILD;
  case OpCodes.FROM_DESCENDANTS_OR_SELF :
    return Axis.DESCENDANTORSELF;
  case OpCodes.FROM_DESCENDANTS :
    return Axis.DESCENDANT;
  case OpCodes.FROM_SELF :
    return Axis.SELF;
  case OpCodes.OP_EXTFUNCTION :
  case OpCodes.OP_FUNCTION :
  case OpCodes.OP_GROUP :
  case OpCodes.OP_VARIABLE :
    return Axis.FILTEREDLIST;
  }

  throw new RuntimeException(XSLMessages.createXPATHMessage(XPATHErrorResources.ER_NULL_ERROR_HANDLER, new Object[]{Integer.toString(stepType)})); //"Programmer's assertion: unknown opcode: "
                             //+ stepType);
 }
Example 11
Source File: ParentLocationPath.java    From Bytecoder with Apache License 2.0 4 votes vote down vote up 
/**
 * This method is used to determine if this parent location path is a
 * combination of two step's with axes that will create duplicate or
 * unordered nodes.
 */
public boolean checkAxisMismatch() {

    int left = _path.getAxis();
    int right = ((Step)_step).getAxis();

    if (((left == Axis.ANCESTOR) || (left == Axis.ANCESTORORSELF)) &&
        ((right == Axis.CHILD) ||
         (right == Axis.DESCENDANT) ||
         (right == Axis.DESCENDANTORSELF) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if ((left == Axis.CHILD) &&
        (right == Axis.ANCESTOR) ||
        (right == Axis.ANCESTORORSELF) ||
        (right == Axis.PARENT) ||
        (right == Axis.PRECEDING))
        return true;

    if ((left == Axis.DESCENDANT) || (left == Axis.DESCENDANTORSELF))
        return true;

    if (((left == Axis.FOLLOWING) || (left == Axis.FOLLOWINGSIBLING)) &&
        ((right == Axis.FOLLOWING) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if (((left == Axis.PRECEDING) || (left == Axis.PRECEDINGSIBLING)) &&
        ((right == Axis.DESCENDANT) ||
         (right == Axis.DESCENDANTORSELF) ||
         (right == Axis.FOLLOWING) ||
         (right == Axis.FOLLOWINGSIBLING) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if ((right == Axis.FOLLOWING) && (left == Axis.CHILD)) {
        // Special case for '@*/following::*' expressions. The resulting
        // iterator is initialised with the parent's first child, and this
        // can cause duplicates in the output if the parent has more than
        // one attribute that matches the left step.
        if (_path instanceof Step) {
            int type = ((Step)_path).getNodeType();
            if (type == DTM.ATTRIBUTE_NODE) return true;
        }
    }

    return false;
}
Example 12
Source File: WalkerFactory.java    From openjdk-8-source with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Get a corresponding BIT_XXX from an axis.
 * @param axis One of Axis.ANCESTOR, etc.
 * @return One of BIT_ANCESTOR, etc.
 */
static public int getAnalysisBitFromAxes(int axis)
{
  switch (axis) // Generate new traverser
    {
    case Axis.ANCESTOR :
      return BIT_ANCESTOR;
    case Axis.ANCESTORORSELF :
      return BIT_ANCESTOR_OR_SELF;
    case Axis.ATTRIBUTE :
      return BIT_ATTRIBUTE;
    case Axis.CHILD :
      return BIT_CHILD;
    case Axis.DESCENDANT :
      return BIT_DESCENDANT;
    case Axis.DESCENDANTORSELF :
      return BIT_DESCENDANT_OR_SELF;
    case Axis.FOLLOWING :
      return BIT_FOLLOWING;
    case Axis.FOLLOWINGSIBLING :
      return BIT_FOLLOWING_SIBLING;
    case Axis.NAMESPACE :
    case Axis.NAMESPACEDECLS :
      return BIT_NAMESPACE;
    case Axis.PARENT :
      return BIT_PARENT;
    case Axis.PRECEDING :
      return BIT_PRECEDING;
    case Axis.PRECEDINGSIBLING :
      return BIT_PRECEDING_SIBLING;
    case Axis.SELF :
      return BIT_SELF;
    case Axis.ALLFROMNODE :
      return BIT_DESCENDANT_OR_SELF;
      // case Axis.PRECEDINGANDANCESTOR :
    case Axis.DESCENDANTSFROMROOT :
    case Axis.ALL :
    case Axis.DESCENDANTSORSELFFROMROOT :
      return BIT_ANY_DESCENDANT_FROM_ROOT;
    case Axis.ROOT :
      return BIT_ROOT;
    case Axis.FILTEREDLIST :
      return BIT_FILTER;
    default :
      return BIT_FILTER;
  }
}
Example 13
Source File: ParentLocationPath.java    From jdk8u60 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * This method is used to determine if this parent location path is a
 * combination of two step's with axes that will create duplicate or
 * unordered nodes.
 */
public boolean checkAxisMismatch() {

    int left = _path.getAxis();
    int right = ((Step)_step).getAxis();

    if (((left == Axis.ANCESTOR) || (left == Axis.ANCESTORORSELF)) &&
        ((right == Axis.CHILD) ||
         (right == Axis.DESCENDANT) ||
         (right == Axis.DESCENDANTORSELF) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if ((left == Axis.CHILD) &&
        (right == Axis.ANCESTOR) ||
        (right == Axis.ANCESTORORSELF) ||
        (right == Axis.PARENT) ||
        (right == Axis.PRECEDING))
        return true;

    if ((left == Axis.DESCENDANT) || (left == Axis.DESCENDANTORSELF))
        return true;

    if (((left == Axis.FOLLOWING) || (left == Axis.FOLLOWINGSIBLING)) &&
        ((right == Axis.FOLLOWING) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if (((left == Axis.PRECEDING) || (left == Axis.PRECEDINGSIBLING)) &&
        ((right == Axis.DESCENDANT) ||
         (right == Axis.DESCENDANTORSELF) ||
         (right == Axis.FOLLOWING) ||
         (right == Axis.FOLLOWINGSIBLING) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if ((right == Axis.FOLLOWING) && (left == Axis.CHILD)) {
        // Special case for '@*/following::*' expressions. The resulting
        // iterator is initialised with the parent's first child, and this
        // can cause duplicates in the output if the parent has more than
        // one attribute that matches the left step.
        if (_path instanceof Step) {
            int type = ((Step)_path).getNodeType();
            if (type == DTM.ATTRIBUTE_NODE) return true;
        }
    }

    return false;
}
Example 14
Source File: WalkerFactory.java    From openjdk-jdk8u with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Get a corresponding BIT_XXX from an axis.
 * @param axis One of Axis.ANCESTOR, etc.
 * @return One of BIT_ANCESTOR, etc.
 */
static public int getAnalysisBitFromAxes(int axis)
{
  switch (axis) // Generate new traverser
    {
    case Axis.ANCESTOR :
      return BIT_ANCESTOR;
    case Axis.ANCESTORORSELF :
      return BIT_ANCESTOR_OR_SELF;
    case Axis.ATTRIBUTE :
      return BIT_ATTRIBUTE;
    case Axis.CHILD :
      return BIT_CHILD;
    case Axis.DESCENDANT :
      return BIT_DESCENDANT;
    case Axis.DESCENDANTORSELF :
      return BIT_DESCENDANT_OR_SELF;
    case Axis.FOLLOWING :
      return BIT_FOLLOWING;
    case Axis.FOLLOWINGSIBLING :
      return BIT_FOLLOWING_SIBLING;
    case Axis.NAMESPACE :
    case Axis.NAMESPACEDECLS :
      return BIT_NAMESPACE;
    case Axis.PARENT :
      return BIT_PARENT;
    case Axis.PRECEDING :
      return BIT_PRECEDING;
    case Axis.PRECEDINGSIBLING :
      return BIT_PRECEDING_SIBLING;
    case Axis.SELF :
      return BIT_SELF;
    case Axis.ALLFROMNODE :
      return BIT_DESCENDANT_OR_SELF;
      // case Axis.PRECEDINGANDANCESTOR :
    case Axis.DESCENDANTSFROMROOT :
    case Axis.ALL :
    case Axis.DESCENDANTSORSELFFROMROOT :
      return BIT_ANY_DESCENDANT_FROM_ROOT;
    case Axis.ROOT :
      return BIT_ROOT;
    case Axis.FILTEREDLIST :
      return BIT_FILTER;
    default :
      return BIT_FILTER;
  }
}
Example 15
Source File: ParentLocationPath.java    From openjdk-jdk8u with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * This method is used to determine if this parent location path is a
 * combination of two step's with axes that will create duplicate or
 * unordered nodes.
 */
public boolean checkAxisMismatch() {

    int left = _path.getAxis();
    int right = ((Step)_step).getAxis();

    if (((left == Axis.ANCESTOR) || (left == Axis.ANCESTORORSELF)) &&
        ((right == Axis.CHILD) ||
         (right == Axis.DESCENDANT) ||
         (right == Axis.DESCENDANTORSELF) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if ((left == Axis.CHILD) &&
        (right == Axis.ANCESTOR) ||
        (right == Axis.ANCESTORORSELF) ||
        (right == Axis.PARENT) ||
        (right == Axis.PRECEDING))
        return true;

    if ((left == Axis.DESCENDANT) || (left == Axis.DESCENDANTORSELF))
        return true;

    if (((left == Axis.FOLLOWING) || (left == Axis.FOLLOWINGSIBLING)) &&
        ((right == Axis.FOLLOWING) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if (((left == Axis.PRECEDING) || (left == Axis.PRECEDINGSIBLING)) &&
        ((right == Axis.DESCENDANT) ||
         (right == Axis.DESCENDANTORSELF) ||
         (right == Axis.FOLLOWING) ||
         (right == Axis.FOLLOWINGSIBLING) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if ((right == Axis.FOLLOWING) && (left == Axis.CHILD)) {
        // Special case for '@*/following::*' expressions. The resulting
        // iterator is initialised with the parent's first child, and this
        // can cause duplicates in the output if the parent has more than
        // one attribute that matches the left step.
        if (_path instanceof Step) {
            int type = ((Step)_path).getNodeType();
            if (type == DTM.ATTRIBUTE_NODE) return true;
        }
    }

    return false;
}
Example 16
Source File: ParentLocationPath.java    From jdk1.8-source-analysis with Apache License 2.0 4 votes vote down vote up 
/**
 * This method is used to determine if this parent location path is a
 * combination of two step's with axes that will create duplicate or
 * unordered nodes.
 */
public boolean checkAxisMismatch() {

    int left = _path.getAxis();
    int right = ((Step)_step).getAxis();

    if (((left == Axis.ANCESTOR) || (left == Axis.ANCESTORORSELF)) &&
        ((right == Axis.CHILD) ||
         (right == Axis.DESCENDANT) ||
         (right == Axis.DESCENDANTORSELF) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if ((left == Axis.CHILD) &&
        (right == Axis.ANCESTOR) ||
        (right == Axis.ANCESTORORSELF) ||
        (right == Axis.PARENT) ||
        (right == Axis.PRECEDING))
        return true;

    if ((left == Axis.DESCENDANT) || (left == Axis.DESCENDANTORSELF))
        return true;

    if (((left == Axis.FOLLOWING) || (left == Axis.FOLLOWINGSIBLING)) &&
        ((right == Axis.FOLLOWING) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if (((left == Axis.PRECEDING) || (left == Axis.PRECEDINGSIBLING)) &&
        ((right == Axis.DESCENDANT) ||
         (right == Axis.DESCENDANTORSELF) ||
         (right == Axis.FOLLOWING) ||
         (right == Axis.FOLLOWINGSIBLING) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if ((right == Axis.FOLLOWING) && (left == Axis.CHILD)) {
        // Special case for '@*/following::*' expressions. The resulting
        // iterator is initialised with the parent's first child, and this
        // can cause duplicates in the output if the parent has more than
        // one attribute that matches the left step.
        if (_path instanceof Step) {
            int type = ((Step)_path).getNodeType();
            if (type == DTM.ATTRIBUTE_NODE) return true;
        }
    }

    return false;
}
Example 17
Source File: WalkerFactory.java    From openjdk-8-source with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * Special purpose function to see if we can optimize the pattern for
 * a DescendantIterator.
 *
 * @param compiler non-null reference to compiler object that has processed
 *                 the XPath operations into an opcode map.
 * @param stepOpCodePos The opcode position for the step.
 *
 * @return 32 bits as an integer that give information about the location
 * path as a whole.
 *
 * @throws javax.xml.transform.TransformerException
 */
public static int getAxisFromStep(
        Compiler compiler, int stepOpCodePos)
          throws javax.xml.transform.TransformerException
{

  int stepType = compiler.getOp(stepOpCodePos);

  switch (stepType)
  {
  case OpCodes.FROM_FOLLOWING :
    return Axis.FOLLOWING;
  case OpCodes.FROM_FOLLOWING_SIBLINGS :
    return Axis.FOLLOWINGSIBLING;
  case OpCodes.FROM_PRECEDING :
    return Axis.PRECEDING;
  case OpCodes.FROM_PRECEDING_SIBLINGS :
    return Axis.PRECEDINGSIBLING;
  case OpCodes.FROM_PARENT :
    return Axis.PARENT;
  case OpCodes.FROM_NAMESPACE :
    return Axis.NAMESPACE;
  case OpCodes.FROM_ANCESTORS :
    return Axis.ANCESTOR;
  case OpCodes.FROM_ANCESTORS_OR_SELF :
    return Axis.ANCESTORORSELF;
  case OpCodes.FROM_ATTRIBUTES :
    return Axis.ATTRIBUTE;
  case OpCodes.FROM_ROOT :
    return Axis.ROOT;
  case OpCodes.FROM_CHILDREN :
    return Axis.CHILD;
  case OpCodes.FROM_DESCENDANTS_OR_SELF :
    return Axis.DESCENDANTORSELF;
  case OpCodes.FROM_DESCENDANTS :
    return Axis.DESCENDANT;
  case OpCodes.FROM_SELF :
    return Axis.SELF;
  case OpCodes.OP_EXTFUNCTION :
  case OpCodes.OP_FUNCTION :
  case OpCodes.OP_GROUP :
  case OpCodes.OP_VARIABLE :
    return Axis.FILTEREDLIST;
  }

  throw new RuntimeException(XSLMessages.createXPATHMessage(XPATHErrorResources.ER_NULL_ERROR_HANDLER, new Object[]{Integer.toString(stepType)})); //"Programmer's assertion: unknown opcode: "
                             //+ stepType);
 }
Example 18
Source File: ParentLocationPath.java    From JDKSourceCode1.8 with MIT License 4 votes vote down vote up 
/**
 * This method is used to determine if this parent location path is a
 * combination of two step's with axes that will create duplicate or
 * unordered nodes.
 */
public boolean checkAxisMismatch() {

    int left = _path.getAxis();
    int right = ((Step)_step).getAxis();

    if (((left == Axis.ANCESTOR) || (left == Axis.ANCESTORORSELF)) &&
        ((right == Axis.CHILD) ||
         (right == Axis.DESCENDANT) ||
         (right == Axis.DESCENDANTORSELF) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if ((left == Axis.CHILD) &&
        (right == Axis.ANCESTOR) ||
        (right == Axis.ANCESTORORSELF) ||
        (right == Axis.PARENT) ||
        (right == Axis.PRECEDING))
        return true;

    if ((left == Axis.DESCENDANT) || (left == Axis.DESCENDANTORSELF))
        return true;

    if (((left == Axis.FOLLOWING) || (left == Axis.FOLLOWINGSIBLING)) &&
        ((right == Axis.FOLLOWING) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if (((left == Axis.PRECEDING) || (left == Axis.PRECEDINGSIBLING)) &&
        ((right == Axis.DESCENDANT) ||
         (right == Axis.DESCENDANTORSELF) ||
         (right == Axis.FOLLOWING) ||
         (right == Axis.FOLLOWINGSIBLING) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if ((right == Axis.FOLLOWING) && (left == Axis.CHILD)) {
        // Special case for '@*/following::*' expressions. The resulting
        // iterator is initialised with the parent's first child, and this
        // can cause duplicates in the output if the parent has more than
        // one attribute that matches the left step.
        if (_path instanceof Step) {
            int type = ((Step)_path).getNodeType();
            if (type == DTM.ATTRIBUTE_NODE) return true;
        }
    }

    return false;
}
Example 19
Source File: ParentLocationPath.java    From openjdk-jdk9 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 * This method is used to determine if this parent location path is a
 * combination of two step's with axes that will create duplicate or
 * unordered nodes.
 */
public boolean checkAxisMismatch() {

    int left = _path.getAxis();
    int right = ((Step)_step).getAxis();

    if (((left == Axis.ANCESTOR) || (left == Axis.ANCESTORORSELF)) &&
        ((right == Axis.CHILD) ||
         (right == Axis.DESCENDANT) ||
         (right == Axis.DESCENDANTORSELF) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if ((left == Axis.CHILD) &&
        (right == Axis.ANCESTOR) ||
        (right == Axis.ANCESTORORSELF) ||
        (right == Axis.PARENT) ||
        (right == Axis.PRECEDING))
        return true;

    if ((left == Axis.DESCENDANT) || (left == Axis.DESCENDANTORSELF))
        return true;

    if (((left == Axis.FOLLOWING) || (left == Axis.FOLLOWINGSIBLING)) &&
        ((right == Axis.FOLLOWING) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if (((left == Axis.PRECEDING) || (left == Axis.PRECEDINGSIBLING)) &&
        ((right == Axis.DESCENDANT) ||
         (right == Axis.DESCENDANTORSELF) ||
         (right == Axis.FOLLOWING) ||
         (right == Axis.FOLLOWINGSIBLING) ||
         (right == Axis.PARENT) ||
         (right == Axis.PRECEDING) ||
         (right == Axis.PRECEDINGSIBLING)))
        return true;

    if ((right == Axis.FOLLOWING) && (left == Axis.CHILD)) {
        // Special case for '@*/following::*' expressions. The resulting
        // iterator is initialised with the parent's first child, and this
        // can cause duplicates in the output if the parent has more than
        // one attribute that matches the left step.
        if (_path instanceof Step) {
            int type = ((Step)_path).getNodeType();
            if (type == DTM.ATTRIBUTE_NODE) return true;
        }
    }

    return false;
}
Example 20
Source File: SAXImpl.java    From jdk1.8-source-analysis with Apache License 2.0 4 votes vote down vote up 
/**
 * Similar to getAxisIterator, but this one returns an iterator
 * containing nodes of a typed axis (ex.: child::foo)
 */
public DTMAxisIterator getTypedAxisIterator(int axis, int type)
{
    // Most common case handled first
    if (axis == Axis.CHILD) {
        return new TypedChildrenIterator(type);
    }

    if (type == NO_TYPE) {
        return(EMPTYITERATOR);
    }

    switch (axis)
    {
        case Axis.SELF:
            return new TypedSingletonIterator(type);
        case Axis.CHILD:
            return new TypedChildrenIterator(type);
        case Axis.PARENT:
            return new ParentIterator().setNodeType(type);
        case Axis.ANCESTOR:
            return new TypedAncestorIterator(type);
        case Axis.ANCESTORORSELF:
            return (new TypedAncestorIterator(type)).includeSelf();
        case Axis.ATTRIBUTE:
            return new TypedAttributeIterator(type);
        case Axis.DESCENDANT:
            return new TypedDescendantIterator(type);
        case Axis.DESCENDANTORSELF:
            return (new TypedDescendantIterator(type)).includeSelf();
        case Axis.FOLLOWING:
            return new TypedFollowingIterator(type);
        case Axis.PRECEDING:
            return new TypedPrecedingIterator(type);
        case Axis.FOLLOWINGSIBLING:
            return new TypedFollowingSiblingIterator(type);
        case Axis.PRECEDINGSIBLING:
            return new TypedPrecedingSiblingIterator(type);
        case Axis.NAMESPACE:
            return  new TypedNamespaceIterator(type);
        case Axis.ROOT:
            return new TypedRootIterator(type);
        default:
            BasisLibrary.runTimeError(BasisLibrary.TYPED_AXIS_SUPPORT_ERR,
                    Axis.getNames(axis));
    }
    return null;
}