Examples of NodeSet

com.dtolabs.rundeck.core.utils.NodeSet
NodeSet provides filtering logic for Node criteria
com.sun.org.apache.xpath.internal.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
com.sun.tools.txw2.model.NodeSet
Root of the model. @author Kohsuke Kawaguchi
net.fortytwo.twitlogic.proof.NodeSet
two.net).
org.apache.commons.jxpath.NodeSet
NodeSet interface can be used as the type of an argument of an extension function. Alternatively, the function can declare the argument as a Collection (or List or Set), in which case it will be given a collection of values matching the path. @author Dmitri Plotnikov @version $Id: NodeSet.java,v 1.1 2003/02/07 00:51:40 dmitri Exp $
org.apache.jetspeed.page.document.NodeSet

NodeSet

@author Scott T. Weaver @version $Id: NodeSet.java 516448 2007-03-09 16:25:47Z ate $
org.apache.lenya.cms.site.NodeSet
A set containing nodes.
org.apache.xindice.core.data.NodeSet
NodeSet is an interface for iterating over a set of Nodes. NodeSets are generally returned by the QueryEngine. @version CVS $Revision: 1.4 $, $Date: 2003/08/09 02:33:30 $
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
org.eclipse.jst.jsf.common.sets.NodeSet
org.exist.dom.NodeSet
@author wolf
org.restlet.util.NodeSet

Examples of com.dtolabs.rundeck.core.utils.NodeSet


    public void testMultipleNodes() throws Exception{


        {
            //test jobref item
            final NodeSet nodeset = new NodeSet();
            nodeset.createInclude().setName(".*");
            final ArrayList<StepExecutionItem> commands = new ArrayList<StepExecutionItem>();
            final testWorkflowCmdItem item = new testWorkflowCmdItem();
            item.type = "my-type";
            commands.add(item);
            final WorkflowImpl workflow = new WorkflowImpl(commands, 1, false,

View Full Code Here

Examples of com.sun.org.apache.xpath.internal.NodeSet

           traverseChildren(listVector, dtm.getNode(node), tagname,
                            isTagNameWildCard);
         }
       }
       int size = listVector.size();
       NodeSet nodeSet = new NodeSet(size);
       for (int i = 0; i < size; i++) 
       {
         nodeSet.addNode((Node) listVector.elementAt(i));
       }
       return (NodeList) nodeSet;
  }

View Full Code Here

Examples of com.sun.org.apache.xpath.internal.NodeSet

      {
        traverseChildren(listVector, dtm.getNode(node), namespaceURI, localName, isNamespaceURIWildCard, isLocalNameWildCard);
      }
    }
    int size = listVector.size();
    NodeSet nodeSet = new NodeSet(size);
    for (int i = 0; i < size; i++)
    {
      nodeSet.addNode((Node)listVector.elementAt(i));
    }
    return (NodeList) nodeSet;
  }

View Full Code Here

Examples of com.sun.org.apache.xpath.internal.NodeSet

   * 
   * @see <a href="http://www.exslt.org/">EXSLT</a>
   */
  public static NodeList intersection(NodeList nl1, NodeList nl2)
  {
    NodeSet ns1 = new NodeSet(nl1);
    NodeSet ns2 = new NodeSet(nl2);
    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

Examples of com.sun.org.apache.xpath.internal.NodeSet

   * 
   * @see <a href="http://www.exslt.org/">EXSLT</a>
   */
  public static NodeList difference(NodeList nl1, NodeList nl2)
  {
    NodeSet ns1 = new NodeSet(nl1);
    NodeSet ns2 = new NodeSet(nl2);


    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

Examples of com.sun.org.apache.xpath.internal.NodeSet

   * 
   * @see <a href="http://www.exslt.org/">EXSLT</a>
   */
  public static NodeList distinct(NodeList nl)
  {
    NodeSet dist = new NodeSet();
    dist.setShouldCacheNodes(true);


    Hashtable stringTable = new Hashtable();
    
    for (int i = 0; i < nl.getLength(); i++)
    {
      Node currNode = nl.item(i);
      String key = toString(currNode);
      
      if (key == null)
        dist.addElement(currNode);
      else if (!stringTable.containsKey(key))
      {
        stringTable.put(key, currNode);
        dist.addElement(currNode);        
      }
    }


    return dist;
  }

View Full Code Here

Examples of com.sun.org.apache.xpath.internal.NodeSet

   * @see <a href="http://www.exslt.org/">EXSLT</a>
   */
  public static boolean hasSameNode(NodeList nl1, NodeList nl2)
  {
    
    NodeSet ns1 = new NodeSet(nl1);
    NodeSet ns2 = new NodeSet(nl2);


    for (int i = 0; i < ns1.getLength(); i++)
    {
      if (ns2.contains(ns1.elementAt(i)))
        return true;
    }
    return false;
  }

View Full Code Here

Examples of com.sun.org.apache.xpath.internal.NodeSet

   */
  public static NodeList highest (NodeList nl)
  {        
    double maxValue = max(nl);


    NodeSet highNodes = new NodeSet();
    highNodes.setShouldCacheNodes(true);    
    
    if (Double.isNaN(maxValue))
      return highNodes;  // empty Nodeset
    
    for (int i = 0; i < nl.getLength(); i++)
    {
      Node n = nl.item(i);
      double d = toNumber(n); 
      if (d == maxValue)
        highNodes.addElement(n);
    }
    return highNodes;
  }

View Full Code Here

Examples of com.sun.org.apache.xpath.internal.NodeSet

   */
  public static NodeList lowest (NodeList nl)
  {
    double minValue = min(nl);


    NodeSet lowNodes = new NodeSet();
    lowNodes.setShouldCacheNodes(true);
    
    if (Double.isNaN(minValue))
      return lowNodes;  // empty Nodeset
    
    for (int i = 0; i < nl.getLength(); i++)
    {
      Node n = nl.item(i);
      double d = toNumber(n); 
      if (d == minValue)
        lowNodes.addElement(n);
    }
    return lowNodes;
  }

View Full Code Here

Examples of com.sun.org.apache.xpath.internal.NodeSet

   */
  public static NodeList split(String str, String pattern)
  {


    
    NodeSet resultSet = new NodeSet();
    resultSet.setShouldCacheNodes(true);
    
    boolean done = false;
    int fromIndex = 0;
    int matchIndex = 0;
    String token = null;
    
    while (!done && fromIndex < str.length())
    {
      matchIndex = str.indexOf(pattern, fromIndex);
      if (matchIndex >= 0)
      {
  token = str.substring(fromIndex, matchIndex);
  fromIndex = matchIndex + pattern.length();
      }
      else
      {
        done = true;
        token = str.substring(fromIndex);
      }


      Document doc = DocumentHolder.m_doc;
      synchronized (doc)
      {
        Element element = doc.createElement("token");
        Text text = doc.createTextNode(token);
        element.appendChild(text);
        resultSet.addNode(element);      
      }
    }
    
    return resultSet;
  }

View Full Code Here

0 1 2 3 4 5

TOP

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.