List of nodeCount() Examples

Examples of nodeCount()

com.couchbase.client.java.bucket.BucketInfo.nodeCount()
The number of nodes on the bucket. @return number of nodes.
org.dom4j.Branch.nodeCount()
Returns the number of Node instances that this branch contains. @return the number of nodes this branch contains
org.dom4j.Document.nodeCount()
org.dom4j.Element.nodeCount()
ptolemy.graph.DirectedGraph.nodeCount()

Examples of org.dom4j.Element.nodeCount()

      for (Iterator it = rootElement.iterator(); it.hasNext();) {
        Node node = (Node) it.next();
        if (node instanceof Element) {
          Element elem = (Element) node;
          Attribute attrKey = elem.attribute("name");
          for (int i = 0; i < elem.nodeCount(); i++) {
            Node childNode = elem.node(i);
            if (childNode instanceof Element) {


              Element elemChild = (Element) childNode;
              Attribute attrLocal = elemChild.attribute("local");

View Full Code Here

Examples of org.dom4j.Element.nodeCount()


        if (parent != null) {
            int index = parent.indexOf(node);


            if (index >= 0) {
                if (++index < parent.nodeCount()) {
                    Node next = parent.node(index);


                    return asDOMNode(next);
                }
            }

View Full Code Here

Examples of org.dom4j.Element.nodeCount()

/* 220 */     Mode mod = this.ruleManager.getMode(mode);
/*     */ 
/* 222 */     if ((input instanceof Element))
/*     */     {
/* 224 */       Element element = (Element)input;
/* 225 */       int i = 0; for (int size = element.nodeCount(); i < size; i++) {
/* 226 */         Node node = element.node(i);
/* 227 */         mod.fireRule(node);
/*     */       }
/* 229 */     } else if ((input instanceof Document))
/*     */     {

View Full Code Here

Examples of ptolemy.graph.DirectedGraph.nodeCount()

    protected Object _compute() {
        DirectedGraph graph = (DirectedGraph) graph();
        ArrayList queue = new ArrayList();


        //HashMap color = new HashMap();
        double[] distance = new double[graph.nodeCount()];
        _predecessor = new int[graph.nodeCount()];


        for (Iterator nodes = graph.nodes().iterator(); nodes.hasNext();) {
            Node node = (Node) nodes.next();

View Full Code Here

Examples of ptolemy.graph.DirectedGraph.nodeCount()

        DirectedGraph graph = (DirectedGraph) graph();
        ArrayList queue = new ArrayList();


        //HashMap color = new HashMap();
        double[] distance = new double[graph.nodeCount()];
        _predecessor = new int[graph.nodeCount()];


        for (Iterator nodes = graph.nodes().iterator(); nodes.hasNext();) {
            Node node = (Node) nodes.next();


            if (node != _startNode) {

View Full Code Here

0 1

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.