Package org.exist.numbering

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

622
623
624
625
626
627
628
629
630
631
632
            mid = (low + high) / 2;
            id = nodes[mid].getNodeId();
            if (id.isDescendantOrSelfOf(ancestorId)) {
                break; // found a child node, break out.
            }
            cmp = id.compareTo(ancestorId);
            if (cmp > 0) {
                high = mid - 1;
            } else {
                low = mid + 1;
            }
View Full Code Here
344
345
346
347
348
349
350
351
352
353
354
                                    if( !nodeId.isChildOf( parent.elem.getNodeId() ) ) {
                                        return( new ErrorReport.ResourceError( ErrorReport.NODE_HIERARCHY, "Node " + nodeId + " is not a child of " + parent.elem.getNodeId() ) );
                                    }

                                    // test sibling relation
                                    if( ( parent.prevSibling != null ) && !( nodeId.isSiblingOf( parent.prevSibling ) && ( nodeId.compareTo( parent.prevSibling ) > 0 ) ) ) {
                                        return( new ErrorReport.ResourceError( ErrorReport.INCORRECT_NODE_ID, "Node " + nodeId + " is not a sibling of " + parent.prevSibling ) );
                                    }
                                    parent.prevSibling = nodeId;
                                }
View Full Code Here
880
881
882
883
884
885
886
887
888
889
890
            final NodeId refId = reference.getNodeId();
            for (int i = mid; i >= documentOffsets[docIdx]; i--) {
                final NodeId currentId = nodes[i].getNodeId();
                if (!currentId.isDescendantOf(parentId))
                    {break;}
                if (currentId.getTreeLevel() == refId.getTreeLevel() && currentId.compareTo(refId) < 0) {
                    if (Expression.IGNORE_CONTEXT != contextId) {
                        if (Expression.NO_CONTEXT_ID == contextId) {
                            nodes[i].copyContext(reference);
                        } else {
                            nodes[i].addContextNode(contextId, reference);
View Full Code Here
943
944
945
946
947
948
949
950
951
952
953
            final NodeId refId = reference.getNodeId();
            for (int i = mid; i < end; i++) {
                final NodeId currentId = nodes[i].getNodeId();
                if (!currentId.isDescendantOf(parentId))
                    {break;}
                if (currentId.getTreeLevel() == refId.getTreeLevel() && currentId.compareTo(refId) > 0) {
                    if (Expression.IGNORE_CONTEXT != contextId) {
                        if (Expression.NO_CONTEXT_ID == contextId) {
                            nodes[i].copyContext(reference);
                        } else {
                            nodes[i].addContextNode(contextId, reference);
View Full Code Here
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
                mid = (low + high) / 2;
                id = array[mid].getNodeId();
                if (id.isDescendantOrSelfOf(ancestorId)) {
                    break; // found a child node, break out.
                }
                cmp = id.compareTo(ancestorId);
                if (cmp > 0) {
                    high = mid - 1;
                } else {
                    low = mid + 1;
                }
View Full Code Here
352
353
354
355
356
357
358
359
360
361
362
                final int level = nodeId.getTreeLevel();
                while (reader.hasNext()) {
                    final int status = reader.next();
                    final NodeId currentId = (NodeId) reader.getProperty(ExtendedXMLStreamReader.PROPERTY_NODE_ID);
                    if (status != XMLStreamConstants.END_ELEMENT && currentId.getTreeLevel() == level) {
                        if (currentId.compareTo(nodeId) > 0)
                            {return reader.getNode();}
                    }
                }
            } catch (final IOException e) {
                LOG.error("Internal error while reading child nodes: " + e.getMessage(), e);
View Full Code Here
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
        {return true;}
      final NodeId refId = referenceNode.getNodeId();
      final NodeId currentId = (NodeId) reader
          .getProperty(EmbeddedXMLStreamReader.PROPERTY_NODE_ID);
      if (!isAfter)
        {isAfter = currentId.compareTo(refId) > 0
            && !currentId.isDescendantOf(refId);}
      if (isAfter && !refId.isDescendantOf(currentId)
          && test.matches(reader)) {
        final NodeProxy proxy = new NodeProxy(referenceNode.getDocument(),
            currentId, StaXUtil.streamType2DOM(reader
View Full Code Here
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
      if (reader.getEventType() == XMLStreamReader.END_ELEMENT)
        {return true;}
      final NodeId refId = referenceNode.getNodeId();
      final NodeId currentId = (NodeId) reader
          .getProperty(EmbeddedXMLStreamReader.PROPERTY_NODE_ID);
      if (currentId.compareTo(refId) >= 0)
        {return false;}
      if (!refId.isDescendantOf(currentId) && test.matches(reader)) {
        final NodeProxy proxy = new NodeProxy(referenceNode.getDocument(),
            currentId, StaXUtil.streamType2DOM(reader
                .getEventType()),
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.