Java Code Examples for com.sun.org.apache.xpath.internal.XPathContext#popIteratorRoot()

The following examples show how to use com.sun.org.apache.xpath.internal.XPathContext#popIteratorRoot() . 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: MatchPatternIterator.java    From jdk1.8-source-analysis with Apache License 2.0 4 votes vote down vote up 
/**
 *  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)
{

  try
  {
    xctxt.pushCurrentNode(n);
    xctxt.pushIteratorRoot(m_context);
    if(DEBUG)
    {
      System.out.println("traverser: "+m_traverser);
      System.out.print("node: "+n);
      System.out.println(", "+m_cdtm.getNodeName(n));
      // if(m_cdtm.getNodeName(n).equals("near-east"))
      System.out.println("pattern: "+m_pattern.toString());
      m_pattern.debugWhatToShow(m_pattern.getWhatToShow());
    }

    XObject score = m_pattern.execute(xctxt);

    if(DEBUG)
    {
      // System.out.println("analysis: "+Integer.toBinaryString(m_analysis));
      System.out.println("score: "+score);
      System.out.println("skip: "+(score == NodeTest.SCORE_NONE));
    }

    // System.out.println("\n::acceptNode - score: "+score.num()+"::");
    return (score == NodeTest.SCORE_NONE) ? DTMIterator.FILTER_SKIP
                  : DTMIterator.FILTER_ACCEPT;
  }
  catch (javax.xml.transform.TransformerException se)
  {

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

}
Example 2
Source File: MatchPatternIterator.java    From TencentKona-8 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 *  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)
{

  try
  {
    xctxt.pushCurrentNode(n);
    xctxt.pushIteratorRoot(m_context);
    if(DEBUG)
    {
      System.out.println("traverser: "+m_traverser);
      System.out.print("node: "+n);
      System.out.println(", "+m_cdtm.getNodeName(n));
      // if(m_cdtm.getNodeName(n).equals("near-east"))
      System.out.println("pattern: "+m_pattern.toString());
      m_pattern.debugWhatToShow(m_pattern.getWhatToShow());
    }

    XObject score = m_pattern.execute(xctxt);

    if(DEBUG)
    {
      // System.out.println("analysis: "+Integer.toBinaryString(m_analysis));
      System.out.println("score: "+score);
      System.out.println("skip: "+(score == NodeTest.SCORE_NONE));
    }

    // System.out.println("\n::acceptNode - score: "+score.num()+"::");
    return (score == NodeTest.SCORE_NONE) ? DTMIterator.FILTER_SKIP
                  : DTMIterator.FILTER_ACCEPT;
  }
  catch (javax.xml.transform.TransformerException se)
  {

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

}
Example 3
Source File: MatchPatternIterator.java    From jdk8u60 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 *  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)
{

  try
  {
    xctxt.pushCurrentNode(n);
    xctxt.pushIteratorRoot(m_context);
    if(DEBUG)
    {
      System.out.println("traverser: "+m_traverser);
      System.out.print("node: "+n);
      System.out.println(", "+m_cdtm.getNodeName(n));
      // if(m_cdtm.getNodeName(n).equals("near-east"))
      System.out.println("pattern: "+m_pattern.toString());
      m_pattern.debugWhatToShow(m_pattern.getWhatToShow());
    }

    XObject score = m_pattern.execute(xctxt);

    if(DEBUG)
    {
      // System.out.println("analysis: "+Integer.toBinaryString(m_analysis));
      System.out.println("score: "+score);
      System.out.println("skip: "+(score == NodeTest.SCORE_NONE));
    }

    // System.out.println("\n::acceptNode - score: "+score.num()+"::");
    return (score == NodeTest.SCORE_NONE) ? DTMIterator.FILTER_SKIP
                  : DTMIterator.FILTER_ACCEPT;
  }
  catch (javax.xml.transform.TransformerException se)
  {

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

}
Example 4
Source File: MatchPatternIterator.java    From JDKSourceCode1.8 with MIT License 4 votes vote down vote up 
/**
 *  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)
{

  try
  {
    xctxt.pushCurrentNode(n);
    xctxt.pushIteratorRoot(m_context);
    if(DEBUG)
    {
      System.out.println("traverser: "+m_traverser);
      System.out.print("node: "+n);
      System.out.println(", "+m_cdtm.getNodeName(n));
      // if(m_cdtm.getNodeName(n).equals("near-east"))
      System.out.println("pattern: "+m_pattern.toString());
      m_pattern.debugWhatToShow(m_pattern.getWhatToShow());
    }

    XObject score = m_pattern.execute(xctxt);

    if(DEBUG)
    {
      // System.out.println("analysis: "+Integer.toBinaryString(m_analysis));
      System.out.println("score: "+score);
      System.out.println("skip: "+(score == NodeTest.SCORE_NONE));
    }

    // System.out.println("\n::acceptNode - score: "+score.num()+"::");
    return (score == NodeTest.SCORE_NONE) ? DTMIterator.FILTER_SKIP
                  : DTMIterator.FILTER_ACCEPT;
  }
  catch (javax.xml.transform.TransformerException se)
  {

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

}
Example 5
Source File: MatchPatternIterator.java    From openjdk-jdk8u with GNU General Public License v2.0 4 votes vote down vote up 
/**
 *  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)
{

  try
  {
    xctxt.pushCurrentNode(n);
    xctxt.pushIteratorRoot(m_context);
    if(DEBUG)
    {
      System.out.println("traverser: "+m_traverser);
      System.out.print("node: "+n);
      System.out.println(", "+m_cdtm.getNodeName(n));
      // if(m_cdtm.getNodeName(n).equals("near-east"))
      System.out.println("pattern: "+m_pattern.toString());
      m_pattern.debugWhatToShow(m_pattern.getWhatToShow());
    }

    XObject score = m_pattern.execute(xctxt);

    if(DEBUG)
    {
      // System.out.println("analysis: "+Integer.toBinaryString(m_analysis));
      System.out.println("score: "+score);
      System.out.println("skip: "+(score == NodeTest.SCORE_NONE));
    }

    // System.out.println("\n::acceptNode - score: "+score.num()+"::");
    return (score == NodeTest.SCORE_NONE) ? DTMIterator.FILTER_SKIP
                  : DTMIterator.FILTER_ACCEPT;
  }
  catch (javax.xml.transform.TransformerException se)
  {

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

}
Example 6
Source File: MatchPatternIterator.java    From openjdk-jdk8u-backup with GNU General Public License v2.0 4 votes vote down vote up 
/**
 *  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)
{

  try
  {
    xctxt.pushCurrentNode(n);
    xctxt.pushIteratorRoot(m_context);
    if(DEBUG)
    {
      System.out.println("traverser: "+m_traverser);
      System.out.print("node: "+n);
      System.out.println(", "+m_cdtm.getNodeName(n));
      // if(m_cdtm.getNodeName(n).equals("near-east"))
      System.out.println("pattern: "+m_pattern.toString());
      m_pattern.debugWhatToShow(m_pattern.getWhatToShow());
    }

    XObject score = m_pattern.execute(xctxt);

    if(DEBUG)
    {
      // System.out.println("analysis: "+Integer.toBinaryString(m_analysis));
      System.out.println("score: "+score);
      System.out.println("skip: "+(score == NodeTest.SCORE_NONE));
    }

    // System.out.println("\n::acceptNode - score: "+score.num()+"::");
    return (score == NodeTest.SCORE_NONE) ? DTMIterator.FILTER_SKIP
                  : DTMIterator.FILTER_ACCEPT;
  }
  catch (javax.xml.transform.TransformerException se)
  {

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

}
Example 7
Source File: MatchPatternIterator.java    From Bytecoder with Apache License 2.0 4 votes vote down vote up 
/**
 *  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)
{

  try
  {
    xctxt.pushCurrentNode(n);
    xctxt.pushIteratorRoot(m_context);
    if(DEBUG)
    {
      System.out.println("traverser: "+m_traverser);
      System.out.print("node: "+n);
      System.out.println(", "+m_cdtm.getNodeName(n));
      // if(m_cdtm.getNodeName(n).equals("near-east"))
      System.out.println("pattern: "+m_pattern.toString());
      NodeTest.debugWhatToShow(m_pattern.getWhatToShow());
    }

    XObject score = m_pattern.execute(xctxt);

    if(DEBUG)
    {
      // System.out.println("analysis: "+Integer.toBinaryString(m_analysis));
      System.out.println("score: "+score);
      System.out.println("skip: "+(score == NodeTest.SCORE_NONE));
    }

    // System.out.println("\n::acceptNode - score: "+score.num()+"::");
    return (score == NodeTest.SCORE_NONE) ? DTMIterator.FILTER_SKIP
                  : DTMIterator.FILTER_ACCEPT;
  }
  catch (javax.xml.transform.TransformerException se)
  {

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

}
Example 8
Source File: MatchPatternIterator.java    From openjdk-jdk9 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 *  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)
{

  try
  {
    xctxt.pushCurrentNode(n);
    xctxt.pushIteratorRoot(m_context);
    if(DEBUG)
    {
      System.out.println("traverser: "+m_traverser);
      System.out.print("node: "+n);
      System.out.println(", "+m_cdtm.getNodeName(n));
      // if(m_cdtm.getNodeName(n).equals("near-east"))
      System.out.println("pattern: "+m_pattern.toString());
      m_pattern.debugWhatToShow(m_pattern.getWhatToShow());
    }

    XObject score = m_pattern.execute(xctxt);

    if(DEBUG)
    {
      // System.out.println("analysis: "+Integer.toBinaryString(m_analysis));
      System.out.println("score: "+score);
      System.out.println("skip: "+(score == NodeTest.SCORE_NONE));
    }

    // System.out.println("\n::acceptNode - score: "+score.num()+"::");
    return (score == NodeTest.SCORE_NONE) ? DTMIterator.FILTER_SKIP
                  : DTMIterator.FILTER_ACCEPT;
  }
  catch (javax.xml.transform.TransformerException se)
  {

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

}
Example 9
Source File: MatchPatternIterator.java    From hottub with GNU General Public License v2.0 4 votes vote down vote up 
/**
 *  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)
{

  try
  {
    xctxt.pushCurrentNode(n);
    xctxt.pushIteratorRoot(m_context);
    if(DEBUG)
    {
      System.out.println("traverser: "+m_traverser);
      System.out.print("node: "+n);
      System.out.println(", "+m_cdtm.getNodeName(n));
      // if(m_cdtm.getNodeName(n).equals("near-east"))
      System.out.println("pattern: "+m_pattern.toString());
      m_pattern.debugWhatToShow(m_pattern.getWhatToShow());
    }

    XObject score = m_pattern.execute(xctxt);

    if(DEBUG)
    {
      // System.out.println("analysis: "+Integer.toBinaryString(m_analysis));
      System.out.println("score: "+score);
      System.out.println("skip: "+(score == NodeTest.SCORE_NONE));
    }

    // System.out.println("\n::acceptNode - score: "+score.num()+"::");
    return (score == NodeTest.SCORE_NONE) ? DTMIterator.FILTER_SKIP
                  : DTMIterator.FILTER_ACCEPT;
  }
  catch (javax.xml.transform.TransformerException se)
  {

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

}
Example 10
Source File: MatchPatternIterator.java    From openjdk-8-source with GNU General Public License v2.0 4 votes vote down vote up 
/**
 *  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)
{

  try
  {
    xctxt.pushCurrentNode(n);
    xctxt.pushIteratorRoot(m_context);
    if(DEBUG)
    {
      System.out.println("traverser: "+m_traverser);
      System.out.print("node: "+n);
      System.out.println(", "+m_cdtm.getNodeName(n));
      // if(m_cdtm.getNodeName(n).equals("near-east"))
      System.out.println("pattern: "+m_pattern.toString());
      m_pattern.debugWhatToShow(m_pattern.getWhatToShow());
    }

    XObject score = m_pattern.execute(xctxt);

    if(DEBUG)
    {
      // System.out.println("analysis: "+Integer.toBinaryString(m_analysis));
      System.out.println("score: "+score);
      System.out.println("skip: "+(score == NodeTest.SCORE_NONE));
    }

    // System.out.println("\n::acceptNode - score: "+score.num()+"::");
    return (score == NodeTest.SCORE_NONE) ? DTMIterator.FILTER_SKIP
                  : DTMIterator.FILTER_ACCEPT;
  }
  catch (javax.xml.transform.TransformerException se)
  {

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

}
Example 11
Source File: MatchPatternIterator.java    From openjdk-8 with GNU General Public License v2.0 4 votes vote down vote up 
/**
 *  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)
{

  try
  {
    xctxt.pushCurrentNode(n);
    xctxt.pushIteratorRoot(m_context);
    if(DEBUG)
    {
      System.out.println("traverser: "+m_traverser);
      System.out.print("node: "+n);
      System.out.println(", "+m_cdtm.getNodeName(n));
      // if(m_cdtm.getNodeName(n).equals("near-east"))
      System.out.println("pattern: "+m_pattern.toString());
      m_pattern.debugWhatToShow(m_pattern.getWhatToShow());
    }

    XObject score = m_pattern.execute(xctxt);

    if(DEBUG)
    {
      // System.out.println("analysis: "+Integer.toBinaryString(m_analysis));
      System.out.println("score: "+score);
      System.out.println("skip: "+(score == NodeTest.SCORE_NONE));
    }

    // System.out.println("\n::acceptNode - score: "+score.num()+"::");
    return (score == NodeTest.SCORE_NONE) ? DTMIterator.FILTER_SKIP
                  : DTMIterator.FILTER_ACCEPT;
  }
  catch (javax.xml.transform.TransformerException se)
  {

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

}