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

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.

        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

            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

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

View Full Code Here

                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

                      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

                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

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.