Package org.modeshape.jcr.query.NodeSequence

Examples of org.modeshape.jcr.query.NodeSequence.Batch

326
327
328
329
330
331
332
333
334
335
336
337
338
            QueryResults result = query.execute();
            if (result.isEmpty()) return false;
            if (result.getRowCount() < 0) {
                // Try to get the first row ...
                NodeSequence seq = result.getRows();
                Batch batch = seq.nextBatch();
                while (batch != null) {
                    if (batch.hasNext()) return true;
                    // It's not common for the first batch may be empty, but it's possible. So try the next batch ...
                    batch = seq.nextBatch();
                }
                return false;
            }
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
    protected void assertNoDuplicates( NodeSequence sequence ) {
        Set<NodeKey> keys = new HashSet<NodeKey>();
        // Iterate over the batches ...
        try {
            Batch batch = null;
            while ((batch = sequence.nextBatch()) != null) {
                while (batch.hasNext()) {
                    batch.nextRow();
                    CachedNode node = batch.getNode();
                    NodeKey key = node != null ? node.getKey() : null;
                    boolean added = keys.add(key);
                    print("Adding " + key);
                    assertTrue("Failed to add " + key, added);
                }
View Full Code Here
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
    protected List<NodeKey> nodesFrom( NodeSequence sequence,
                                       boolean closeRestartable ) {
        List<NodeKey> keys = new ArrayList<NodeKey>();
        // Iterate over the batches ...
        try {
            Batch batch = null;
            while ((batch = sequence.nextBatch()) != null) {
                while (batch.hasNext()) {
                    batch.nextRow();
                    CachedNode node = batch.getNode();
                    NodeKey key = node != null ? node.getKey() : null;
                    boolean added = keys.add(key);
                    print("Adding " + key);
                    assertTrue("Failed to add " + key, added);
                }
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
137
138
139
    protected void assertSorted( NodeSequence sequence,
                                 ExtractFromRow extractor ) {
        List<Object> values = new ArrayList<Object>();
        // Iterate over the batches ...
        try {
            Batch batch = null;
            while ((batch = sequence.nextBatch()) != null) {
                while (batch.hasNext()) {
                    batch.nextRow();
                    Object value = extractor.getValueInRow(batch);
                    values.add(value);
                    print("Found " + value);
                }
            }
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
92
93
94
    }

    protected long countRows( NodeSequence sequence ) {
        try {
            long count = 0;
            Batch batch = null;
            while ((batch = sequence.nextBatch()) != null) {
                while (batch.hasNext()) {
                    batch.nextRow();
                    ++count;
                }
            }
            return count;
        } finally {
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
112
113
114
                          ExtractFromRow firstExtractor,
                          ExtractFromRow... extractors ) {
        if (!print()) return;
        System.out.println(msg);
        try {
            Batch batch = null;
            while ((batch = sequence.nextBatch()) != null) {
                while (batch.hasNext()) {
                    batch.nextRow();
                    System.out.print(" ");
                    System.out.print(firstExtractor.getValueInRow(batch));
                    for (ExtractFromRow extractor : extractors) {
                        System.out.print(" ");
                        System.out.print(extractor.getValueInRow(batch));
View Full Code Here
125
126
127
128
129
130
131
132
133
134
135
136
137
138
                                  NodeSequence sequence,
                                  ExtractFromRow... extractors ) {
        if (!print()) return;
        System.out.println(msg);
        try {
            Batch batch = null;
            while ((batch = sequence.nextBatch()) != null) {
                while (batch.hasNext()) {
                    batch.nextRow();
                    System.out.print(rowAsString(batch, " "));
                    for (ExtractFromRow extractor : extractors) {
                        System.out.print(" ");
                        System.out.print(extractor.getValueInRow(batch));
                    }
View Full Code Here
189
190
191
192
193
194
195
196
197
198
199
200
201
202
    protected void assertRowsSatisfy( NodeSequence nodeSequence,
                                      Verifier verifier ) {
        // Iterate over the batches ...
        try {
            Batch batch = null;
            while ((batch = nodeSequence.nextBatch()) != null) {
                while (batch.hasNext()) {
                    batch.nextRow();
                    verifier.verify(batch);
                }
            }
            verifier.complete();
        } finally {
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
        NodeSequence seq = allNodes();
        // The sequence should not have any duplicates, since the iterator doesn't ...
        Set<NodeKey> keys = new HashSet<NodeKey>();
        try {
            // Iterate over the batches ...
            Batch batch = null;
            while ((batch = seq.nextBatch()) != null) {
                while (batch.hasNext()) {
                    batch.nextRow();
                    CachedNode node = batch.getNode();
                    NodeKey key = node != null ? node.getKey() : null;
                    boolean added = keys.add(key);
                    print("Adding " + key);
                    assertTrue("Failed to add " + key, added);
                }
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
        NodeSequence seq = NodeSequence.append(allNodes(), allNodes());
        // The sequence should not have two duplicates of every node ...
        Set<NodeKey> keys = new HashSet<NodeKey>();
        try {
            // Iterate over the batches ...
            Batch batch = null;
            boolean shouldAdd = true;
            while ((batch = seq.nextBatch()) != null) {
                while (batch.hasNext()) {
                    batch.nextRow();
                    CachedNode node = batch.getNode();
                    NodeKey key = node != null ? node.getKey() : null;
                    if (keys.contains(key) && shouldAdd) shouldAdd = false;
                    if (shouldAdd) {
                        boolean added = keys.add(key);
                        print("Adding " + key);
View Full Code Here
TOP

Related Classes of org.modeshape.jcr.query.NodeSequence.Batch

  • org.modeshape.jcr.query.AbstractNodeSequenceTest
  • org.modeshape.jcr.query.engine.process.DistinctSequenceTest
  • org.modeshape.jcr.query.engine.process.RestartableSequenceTest
  • org.modeshape.jcr.query.engine.process.SortingSequenceTest
  • org.modeshape.jcr.query.engine.QuerySources
  • org.modeshape.jcr.query.engine.QuerySources$BatchWriter
  • org.modeshape.jcr.query.NodeSequenceTest
  • org.modeshape.jcr.RepositoryNodeTypeManager
    • 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.