Package org.exist.memtree

Examples of org.exist.memtree.NodeImpl

578
579
580
581
582
583
584
585
586
587
    public Sequence getAncestors(boolean includeSelf, NodeTest test) throws XPathException {
        sortInDocumentOrder();
        final ValueSequence nodes = new ValueSequence(true);
        nodes.keepUnOrdered(keepUnOrdered);
        for (int i = 0; i <= size; i++) {
            final NodeImpl node = (NodeImpl) values[i];
            node.selectAncestors(includeSelf, test, nodes);
        }
        return nodes;
    }
View Full Code Here
589
590
591
592
593
594
595
596
597
598
599
600
    public Sequence getParents(NodeTest test) throws XPathException {
        sortInDocumentOrder();
        final ValueSequence nodes = new ValueSequence(true);
        nodes.keepUnOrdered(keepUnOrdered);
        for (int i = 0; i <= size; i++) {
            final NodeImpl node = (NodeImpl) values[i];
            final NodeImpl parent = (NodeImpl) node.selectParentNode();
            if (parent != null && test.matches(parent))
                {nodes.add(parent);}
        }
        return nodes;
    }
View Full Code Here
602
603
604
605
606
607
608
609
610
611
612
613
    public Sequence getSelf(NodeTest test) throws XPathException {
        sortInDocumentOrder();
        final ValueSequence nodes = new ValueSequence(true);
        nodes.keepUnOrdered(keepUnOrdered);
        for (int i = 0; i <= size; i++) {
            final NodeImpl node = (NodeImpl) values[i];
            if ((test.getType() == Type.NODE && node.getNodeType() == Node.ATTRIBUTE_NODE) ||
                    test.matches(node))
                {nodes.add(node);}
        }
        return nodes;
    }
View Full Code Here
615
616
617
618
619
620
621
622
623
624
    public Sequence getPrecedingSiblings(NodeTest test) throws XPathException {
        sortInDocumentOrder();
        final ValueSequence nodes = new ValueSequence(true);
        nodes.keepUnOrdered(keepUnOrdered);
        for (int i = 0; i <= size; i++) {
            final NodeImpl node = (NodeImpl) values[i];
            node.selectPrecedingSiblings(test, nodes);
        }
        return nodes;
    }
View Full Code Here
626
627
628
629
630
631
632
633
634
635
    public Sequence getPreceding(NodeTest test, int position) throws XPathException {
        sortInDocumentOrder();
        final ValueSequence nodes = new ValueSequence(true);
        nodes.keepUnOrdered(keepUnOrdered);
        for (int i = 0; i <= size; i++) {
            final NodeImpl node = (NodeImpl) values[i];
            node.selectPreceding(test, nodes, position);
        }
        return nodes;
    }
View Full Code Here
637
638
639
640
641
642
643
644
645
646
    public Sequence getFollowingSiblings(NodeTest test) throws XPathException {
        sortInDocumentOrder();
        final ValueSequence nodes = new ValueSequence(true);
        nodes.keepUnOrdered(keepUnOrdered);
        for (int i = 0; i <= size; i++) {
            final NodeImpl node = (NodeImpl) values[i];
            node.selectFollowingSiblings(test, nodes);
        }
        return nodes;
    }
View Full Code Here
648
649
650
651
652
653
654
655
656
657
    public Sequence getFollowing(NodeTest test, int position) throws XPathException {
        sortInDocumentOrder();
        final ValueSequence nodes = new ValueSequence(true);
        nodes.keepUnOrdered(keepUnOrdered);
        for (int i = 0; i <= size; i++) {
            final NodeImpl node = (NodeImpl) values[i];
            node.selectFollowing(test, nodes, position);
        }
        return nodes;
    }
View Full Code Here
659
660
661
662
663
664
665
666
667
668
669
670
671
672
    public Sequence selectDescendants(MemoryNodeSet descendants) {
        sortInDocumentOrder();
        final ValueSequence nodes = new ValueSequence(true);
        nodes.keepUnOrdered(keepUnOrdered);
        for (int i = 0; i <= size; i++) {
            final NodeImpl node = (NodeImpl) values[i];
            for (int j = 0; j < descendants.size(); j++) {
                final NodeImpl descendant = descendants.get(j);
                if (descendant.getNodeId().isDescendantOrSelfOf(node.getNodeId()))
                    {nodes.add(node);}
            }
        }
        return nodes;
    }
View Full Code Here
674
675
676
677
678
679
680
681
682
683
684
685
686
687
    public Sequence selectChildren(MemoryNodeSet children) {
        sortInDocumentOrder();
        final ValueSequence nodes = new ValueSequence(true);
        nodes.keepUnOrdered(keepUnOrdered);
        for (int i = 0; i <= size; i++) {
            final NodeImpl node = (NodeImpl) values[i];
            for (int j = 0; j < children.size(); j++) {
                final NodeImpl descendant = children.get(j);
                if (descendant.getNodeId().isChildOf(node.getNodeId()))
                    {nodes.add(node);}
            }
        }
        return nodes;
    }
View Full Code Here
822
823
824
825
826
827
828
829
830
831
832
833
  public boolean matchSelf(NodeTest test) throws XPathException {
    //UNDERSTAND: is it required? -shabanovd
    sortInDocumentOrder();
    for (int i = 0; i <= size; i++) {
      final NodeImpl node = (NodeImpl) values[i];
      if ((test.getType() == Type.NODE && node.getNodeType() == Node.ATTRIBUTE_NODE) ||
          test.matches(node))
        {return true;}
      }
    return false;
  }
View Full Code Here
TOP

Related Classes of org.exist.memtree.NodeImpl

  • org.exist.contentextraction.ContentReceiver
  • org.exist.dom.QName
  • org.exist.http.RESTServer
  • org.exist.indexing.lucene.LuceneIndexWorker
  • org.exist.numbering.NodeId
  • org.exist.storage.md.xquery.Search
  • org.exist.storage.serializers.Serializer
  • org.exist.versioning.xquery.PatchFunction
  • org.exist.xqj.Marshaller
  • org.exist.xquery.CDATAConstructor
    • Copyright © 2018 www.massapicom. 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.