List of nextSibling() Examples

Examples of nextSibling()

jmathexpr.util.logging.ExpressionInfo.nextSibling()
Creates a new ExpressionInfo instance that will be the next sibling after this instance. @param expr the appropriate subexpression @return a new ExpressionInfo instance that represents the next sibling inthe subexpression list
org.exist.numbering.NodeId.nextSibling()
Returns a new NodeId representing the next following sibling of this node. The returned id can be used to create new sibling nodes. The actual id of the next sibling might be different, depending on the implementation. @return new sibling node id.
org.jsoup.nodes.Node.nextSibling()
Get this node's next sibling. @return next sibling, or null if this is the last sibling
org.w3c.dom.traversal.TreeWalker.nextSibling()
Moves the TreeWalker to the next sibling of the current node, and returns the new node. If the current node has no visible next sibling, returns null , and retains the current node. @return The new node, or null if the current node has no next sibling in the TreeWalker's logical view.
xbird.xquery.dm.dtm.IDocumentTable.nextSibling()
xbird.xquery.dm.instance.DocumentTableModel.DTMNodeBase.nextSibling()

Examples of jmathexpr.util.logging.ExpressionInfo.nextSibling()

        
        for (Expression c : children) {
            if (childInfo == null) {
                childInfo = info.firstChild(c);
            } else {
                childInfo = childInfo.nextSibling(c);
            }
            
            c.dump(dump, childInfo);
        }
    }

View Full Code Here

Examples of org.exist.numbering.NodeId.nextSibling()

        NodeId nextId = nodeFactory.createInstance();
        NodeImpl next = (NodeImpl)getFirstChild();
        while (next != null) {
            computeNodeIds(nextId, next.nodeNumber);
            next = (NodeImpl)next.getNextSibling();
            nextId = nextId.nextSibling();
        }
    }


    private void computeNodeIds(NodeId id, int nodeNum) {
        nodeId[nodeNum] = id;

View Full Code Here

Examples of org.exist.numbering.NodeId.nextSibling()

            NodeId nextId = id.newChild();
            int attr = document.alpha[nodeNum];
            if (-1 < attr) {
                while ((attr < document.nextAttr) && (document.attrParent[attr] == nodeNum)) {
                    attrNodeId[attr] = nextId;
                    nextId = nextId.nextSibling();
                    ++attr;
                }
            }
            int nextNode = getFirstChildFor(nodeNum);
            while (nextNode > nodeNum) {

View Full Code Here

Examples of org.exist.numbering.NodeId.nextSibling()

            int nextNode = getFirstChildFor(nodeNum);
            while (nextNode > nodeNum) {
                computeNodeIds(nextId, nextNode);
                nextNode = document.next[nextNode];
                if (nextNode > nodeNum) {
                    nextId = nextId.nextSibling();
                }
            }
        }
    }

View Full Code Here

Examples of org.exist.numbering.NodeId.nextSibling()

                if (ancestorId == NodeId.DOCUMENT_NODE) {
                    fromKey = computeKey(type, qname, doc.getDocId());
                    toKey = computeKey(type, qname, doc.getDocId() + 1);
                } else {
                    fromKey = computeKey(type, qname, doc.getDocId(), ancestorId);
                    toKey = computeKey(type, qname, doc.getDocId(), ancestorId.nextSibling());
                }
                final IndexQuery query = new IndexQuery(IndexQuery.RANGE, new Value(fromKey), new Value(toKey));
                try {
                    index.btree.query(query, callback);
                } catch (final Exception e) {

View Full Code Here

Examples of org.exist.numbering.NodeId.nextSibling()

                      if (ancestorId == NodeId.DOCUMENT_NODE) {
                          fromKey = computeKey(type, qname, doc.getDocId());
                          toKey = computeKey(type, qname, doc.getDocId() + 1);
                      } else {
                          fromKey = computeKey(type, qname, doc.getDocId(), ancestorId);
                          toKey = computeKey(type, qname, doc.getDocId(), ancestorId.nextSibling());
                      }
                      final IndexQuery query = new IndexQuery(IndexQuery.RANGE, new Value(fromKey), new Value(toKey));
                      try {
                          index.btree.query(query, callback);
                      } catch (final Exception e) {

View Full Code Here

Examples of org.exist.numbering.NodeId.nextSibling()

                oldNodeId = child.getNodeId();
                if(defragment) {
                    if(i == 0) {
                        nodeId = nodeId.newChild();
                    } else {
                        nodeId = nodeId.nextSibling();
                    }
                    child.setNodeId(nodeId);
                }
                copyNodes(transaction, iterator, child, currentPath, newDoc, defragment, index, listener, oldNodeId);
            }

View Full Code Here

Examples of org.jsoup.nodes.Node.nextSibling()

            visitor.head(node, depth);
            if (node.childNodes().size() > 0) {
                node = node.childNode(0);
                depth++;
            } else {
                while (node.nextSibling() == null && depth > 0) {
                    visitor.tail(node, depth);
                    node = node.parent();
                    depth--;
                }
                visitor.tail(node, depth);

View Full Code Here

Examples of org.jsoup.nodes.Node.nextSibling()

                    depth--;
                }
                visitor.tail(node, depth);
                if (node == root)
                    break;
                node = node.nextSibling();
            }
        }
    }
}

View Full Code Here

Examples of org.jsoup.nodes.Node.nextSibling()

            visitor.head(node, depth);
            if (node.childNodeSize() > 0) {
                node = node.childNode(0);
                depth++;
            } else {
                while (node.nextSibling() == null && depth > 0) {
                    visitor.tail(node, depth);
                    node = node.parent();
                    depth--;
                }
                visitor.tail(node, depth);

View Full Code Here

0 1 2 3

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.