Examples of org.apache.xpath.NodeSet

org.apache.xpath.NodeSet

The NodeSet class can act as either a NodeVector, NodeList, or NodeIterator. However, in order for it to act as a NodeVector or NodeList, it's required that setShouldCacheNodes(true) be called before the first nextNode() is called, in order that nodes can be added as they are fetched. Derived classes that implement iterators must override runTo(int index), in order that they may run the iteration to the given index.

Note that we directly implement the DOM's NodeIterator interface. We do not emulate all the behavior of the standard NodeIterator. In particular, we do not guarantee to present a "live view" of the document ... but in XSLT, the source document should never be mutated, so this should never be an issue.

Thought: Should NodeSet really implement NodeList and NodeIterator, or should there be specific subclasses of it which do so? The advantage of doing it all here is that all NodeSets will respond to the same calls; the disadvantage is that some of them may return less-than-enlightening results when you do so.
@xsl.usage advanced

   * in ni2
   */  
  public static NodeSet intersection(NodeIterator ni1, NodeIterator ni2)
      throws javax.xml.transform.TransformerException
  {
    NodeSet ns1 = new NodeSet(ni1);
    NodeSet ns2 = new NodeSet(ni2);
    NodeSet inter= new NodeSet();
    inter.setShouldCacheNodes(true);
    for (int i=0; i < ns1.getLength(); i++)
    {
      Node n = ns1.elementAt(i);
      if(ns2.contains(n))
        inter.addElement(n);
    }
    return inter;
  }

View Full Code Here

   * in ni2
   */  
  public static NodeSet difference(NodeIterator ni1, NodeIterator ni2)
      throws javax.xml.transform.TransformerException  
  {
    NodeSet ns1 = new NodeSet(ni1);
    NodeSet ns2 = new NodeSet(ni2);
    // NodeSet inter= new NodeSet();
    NodeSet diff = new NodeSet();
    diff.setShouldCacheNodes(true);    
    for (int i = 0; i < ns1.getLength(); i++)
    {
      Node n = ns1.elementAt(i);
      if(!ns2.contains(n))
        diff.addElement(n);
    }
    return diff;
  }

View Full Code Here

   * only include the first such node found.
   */  
  public static NodeSet distinct(NodeIterator ni)
      throws javax.xml.transform.TransformerException  
  {
    NodeSet ns = new NodeSet(ni);
    NodeSet dist = new NodeSet();
    dist.setShouldCacheNodes(true);    
    Hashtable stringTable = new Hashtable();
    for (int i = 0; i < ns.getLength(); i++)
    {
      Node n = ns.elementAt(i);
      String key = DOMHelper.getNodeData(n);
      if (!stringTable.containsKey(key))
      {
        stringTable.put(key, n);
        dist.addElement(n);
      }
    }
    return dist;
  }

View Full Code Here

   * @param ni2 NodeIterator for second node-set
   * @return true if ni1 and ni2 contain exactly the same set of nodes.
   */  
  public static boolean hasSameNodes(NodeIterator ni1, NodeIterator ni2)
  {
    NodeSet ns1 = new NodeSet(ni1);
    NodeSet ns2 = new NodeSet(ni2);    
    if (ns1.getLength() != ns2.getLength())
      return false;
    for (int i = 0; i < ns1.getLength(); i++)
    {
      Node n = ns1.elementAt(i);
      if(!ns2.contains(n))
        return false;
    }
    return true;
  }

View Full Code Here

   */  
  public static NodeSet tokenize(ExpressionContext myContext, String toTokenize, String delims)
  {
    Document lDoc = myContext.getContextNode().getOwnerDocument();
    StringTokenizer lTokenizer = new StringTokenizer(toTokenize, delims);
    NodeSet resultSet = new NodeSet();
    while (lTokenizer.hasMoreTokens())
    {
      resultSet.addNode(lDoc.createTextNode(lTokenizer.nextToken()));
    }
    return resultSet;
}

View Full Code Here


    String textNodeValue;


    if (rtf instanceof NodeIterator)
    {
      return new NodeSet((NodeIterator) rtf);
    }
    else
    {
      if (rtf instanceof String)
      {
        textNodeValue = (String) rtf;
      }
      else if (rtf instanceof Boolean)
      {
        textNodeValue = new XBoolean(((Boolean) rtf).booleanValue()).str();
      }
      else if (rtf instanceof Double)
      {
        textNodeValue = new XNumber(((Double) rtf).doubleValue()).str();
      }
      else
      {
        textNodeValue = rtf.toString();
      }


      // This no longer will work right since the DTM.
      // Document myDoc = myProcessor.getContextNode().getOwnerDocument();
      try
      {
        DocumentBuilderFactory dbf = DocumentBuilderFactory.newInstance();
        DocumentBuilder db = dbf.newDocumentBuilder();
        Document myDoc = db.newDocument();
        
        Text textNode = myDoc.createTextNode(textNodeValue);
        DocumentFragment docFrag = myDoc.createDocumentFragment();
  
        docFrag.appendChild(textNode);
  
        return new NodeSet(docFrag);
      }
      catch(ParserConfigurationException pce)
      {
        throw new org.apache.xml.utils.WrappedRuntimeException(pce);
      }

View Full Code Here

   */
  public static NodeSet intersection(NodeIterator ni1, NodeIterator ni2)
          throws javax.xml.transform.TransformerException
  {


    NodeSet ns1 = new NodeSet(ni1);
    NodeSet ns2 = new NodeSet(ni2);
    NodeSet inter = new NodeSet();


    inter.setShouldCacheNodes(true);


    for (int i = 0; i < ns1.getLength(); i++)
    {
      Node n = ns1.elementAt(i);


      if (ns2.contains(n))
        inter.addElement(n);
    }


    return inter;
  }

View Full Code Here

   */
  public static NodeSet difference(NodeIterator ni1, NodeIterator ni2)
          throws javax.xml.transform.TransformerException
  {


    NodeSet ns1 = new NodeSet(ni1);
    NodeSet ns2 = new NodeSet(ni2);


    // NodeSet inter= new NodeSet();
    NodeSet diff = new NodeSet();


    diff.setShouldCacheNodes(true);


    for (int i = 0; i < ns1.getLength(); i++)
    {
      Node n = ns1.elementAt(i);


      if (!ns2.contains(n))
        diff.addElement(n);
    }


    return diff;
  }

View Full Code Here

  {


    // Set up our resulting NodeSet and the hashtable we use to keep track of duplicate
    // strings.


    NodeSet dist = new NodeSet();
    dist.setShouldCacheNodes(true);


    Hashtable stringTable = new Hashtable();


    Node currNode = ni.nextNode();


    while (currNode != null)
    {
      String key = myContext.toString(currNode);


      if (!stringTable.containsKey(key))
      {
        stringTable.put(key, currNode);
        dist.addElement(currNode);
      }
      currNode = ni.nextNode();
    }


    return dist;

View Full Code Here

   * @return true if ni1 and ni2 contain exactly the same set of nodes.
   */
  public static boolean hasSameNodes(NodeIterator ni1, NodeIterator ni2)
  {


    NodeSet ns1 = new NodeSet(ni1);
    NodeSet ns2 = new NodeSet(ni2);


    if (ns1.getLength() != ns2.getLength())
      return false;


    for (int i = 0; i < ns1.getLength(); i++)
    {
      Node n = ns1.elementAt(i);


      if (!ns2.contains(n))
        return false;
    }


    return true;
  }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.apache.xpath.NodeSet

com.nwalsh.xalan.Text

com.sun.msv.schmit.XalanExtension

org.apache.xalan.lib.ExsltDynamic

org.apache.xalan.lib.ExsltMath

org.apache.xalan.lib.ExsltSets

org.apache.xalan.lib.ExsltStrings

org.apache.xalan.lib.Extensions

org.apache.xalan.templates.FuncDocument

org.apache.xalan.transformer.KeyRefIterator

org.apache.xml.dtm.ref.DTMNodeProxy

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.