import com.sun.org.apache.xpath.internal.patterns.NodeTest; //导入依赖的package包/类
/**
 * Initialize the context values for this expression
 * after it is cloned.
 *
 * @param context The XPath runtime context for this
 * transformation.
 */
public void setRoot(int context, Object environment)
{
  super.setRoot(context, environment);
  m_traverser = m_cdtm.getAxisTraverser(m_axis);

  String localName = getLocalName();
  String namespace = getNamespace();
  int what = m_whatToShow;
  // System.out.println("what: ");
  // NodeTest.debugWhatToShow(what);
  if(DTMFilter.SHOW_ALL == what
     || NodeTest.WILD.equals(localName)
     || NodeTest.WILD.equals(namespace))
  {
    m_extendedTypeID = 0;
  }
  else
  {
    int type = getNodeTypeTest(what);
    m_extendedTypeID = m_cdtm.getExpandedTypeID(namespace, localName, type);
  }

}
 

import com.sun.org.apache.xpath.internal.patterns.NodeTest; //导入依赖的package包/类
/**
 * Get the namespace of the step.
 *
 * @param opPosOfStep The position of the FROM_XXX step.
 *
 * @return The step's namespace, NodeTest.WILD, or null for null namespace.
 */
public String getStepNS(int opPosOfStep)
{

  int argLenOfStep = getArgLengthOfStep(opPosOfStep);

  // System.out.println("getStepNS.argLenOfStep: "+argLenOfStep);
  if (argLenOfStep == 3)
  {
    int index = m_opMap.elementAt(opPosOfStep + 4);

    if (index >= 0)
      return (String) m_tokenQueue.elementAt(index);
    else if (OpCodes.ELEMWILDCARD == index)
      return NodeTest.WILD;
    else
      return null;
  }
  else
    return null;
}
 

import com.sun.org.apache.xpath.internal.patterns.NodeTest; //导入依赖的package包/类
/**
 * Test whether a specified node is visible in the logical view of a
 * TreeWalker or NodeIterator. This function will be called by the
 * implementation of TreeWalker and NodeIterator; it is not intended to
 * be called directly from user code.
 * @param n  The node to check to see if it passes the filter or not.
 * @return  a constant to determine whether the node is accepted,
 *   rejected, or skipped, as defined  above .
 */
public short acceptNode(int n)
{
  XPathContext xctxt = getXPathContext();
  try
  {
    xctxt.pushCurrentNode(n);
    for (int i = 0; i < m_nodeTests.length; i++)
    {
      PredicatedNodeTest pnt = m_nodeTests[i];
      XObject score = pnt.execute(xctxt, n);
      if (score != NodeTest.SCORE_NONE)
      {
        // Note that we are assuming there are no positional predicates!
        if (pnt.getPredicateCount() > 0)
        {
          if (pnt.executePredicates(n, xctxt))
            return DTMIterator.FILTER_ACCEPT;
        }
        else
          return DTMIterator.FILTER_ACCEPT;

      }
    }
  }
  catch (javax.xml.transform.TransformerException se)
  {

    // TODO: Fix this.
    throw new RuntimeException(se.getMessage());
  }
  finally
  {
    xctxt.popCurrentNode();
  }
  return DTMIterator.FILTER_SKIP;
}
 

import com.sun.org.apache.xpath.internal.patterns.NodeTest; //导入依赖的package包/类
/**
 *  Test whether a specified node is visible in the logical view of a
 * TreeWalker or NodeIterator. This function will be called by the
 * implementation of TreeWalker and NodeIterator; it is not intended to
 * be called directly from user code.
 * @param n  The node to check to see if it passes the filter or not.
 * @return  a constant to determine whether the node is accepted,
 *   rejected, or skipped, as defined  above .
 */
public short acceptNode(int n)
{

  XPathContext xctxt = m_lpi.getXPathContext();

  try
  {
    xctxt.pushCurrentNode(n);

    XObject score = execute(xctxt, n);

    // System.out.println("\n::acceptNode - score: "+score.num()+"::");
    if (score != NodeTest.SCORE_NONE)
    {
      if (getPredicateCount() > 0)
      {
        countProximityPosition(0);

        if (!executePredicates(n, xctxt))
          return DTMIterator.FILTER_SKIP;
      }

      return DTMIterator.FILTER_ACCEPT;
    }
  }
  catch (javax.xml.transform.TransformerException se)
  {

    // TODO: Fix this.
    throw new RuntimeException(se.getMessage());
  }
  finally
  {
    xctxt.popCurrentNode();
  }

  return DTMIterator.FILTER_SKIP;
}
 

import com.sun.org.apache.xpath.internal.patterns.NodeTest; //导入依赖的package包/类
/**
 * Return the first node out of the nodeset, if this expression is
 * a nodeset expression.  This is the default implementation for
 * nodesets.
 * <p>WARNING: Do not mutate this class from this function!</p>
 * @param xctxt The XPath runtime context.
 * @return the first node out of the nodeset, or DTM.NULL.
 */
public int asNode(XPathContext xctxt)
  throws javax.xml.transform.TransformerException
{
  if(getPredicateCount() > 0)
    return super.asNode(xctxt);

  int current = xctxt.getCurrentNode();

  DTM dtm = xctxt.getDTM(current);
  DTMAxisTraverser traverser = dtm.getAxisTraverser(m_axis);

  String localName = getLocalName();
  String namespace = getNamespace();
  int what = m_whatToShow;

  // System.out.print(" (DescendantIterator) ");

  // System.out.println("what: ");
  // NodeTest.debugWhatToShow(what);
  if(DTMFilter.SHOW_ALL == what
     || localName == NodeTest.WILD
     || namespace == NodeTest.WILD)
  {
    return traverser.first(current);
  }
  else
  {
    int type = getNodeTypeTest(what);
    int extendedType = dtm.getExpandedTypeID(namespace, localName, type);
    return traverser.first(current, extendedType);
  }
}
 

import com.sun.org.apache.xpath.internal.patterns.NodeTest; //导入依赖的package包/类
/**
 * Get the local name of the step.
 * @param opPosOfStep The position of the FROM_XXX step.
 *
 * @return OpCodes.EMPTY, OpCodes.ELEMWILDCARD, or the local name.
 */
public String getStepLocalName(int opPosOfStep)
{

  int argLenOfStep = getArgLengthOfStep(opPosOfStep);

  // System.out.println("getStepLocalName.argLenOfStep: "+argLenOfStep);
  int index;

  switch (argLenOfStep)
  {
  case 0 :
    index = OpCodes.EMPTY;
    break;
  case 1 :
    index = OpCodes.ELEMWILDCARD;
    break;
  case 2 :
    index = m_opMap.elementAt(opPosOfStep + 4);
    break;
  case 3 :
    index = m_opMap.elementAt(opPosOfStep + 5);
    break;
  default :
    index = OpCodes.EMPTY;
    break;  // Should assert error
  }

  // int index = (argLenOfStep == 3) ? m_opMap[opPosOfStep+5]
  //                                  : ((argLenOfStep == 1) ? -3 : -2);
  if (index >= 0)
    return (String) m_tokenQueue.elementAt(index).toString();
  else if (OpCodes.ELEMWILDCARD == index)
    return NodeTest.WILD;
  else
    return null;
}