Package org.apache.jackrabbit.oak.plugins.memory

Examples of org.apache.jackrabbit.oak.plugins.memory.MemoryChildNodeEntry

106
107
108
109
110
111
112
113
114
115
116
    @Override
    public NodeState getChildNode(@Nonnull String name) {
        NodeState child = state.getChildNode(checkNotNull(name));
        if (child.exists() && !context.canReadAll()) {
            ChildNodeEntry entry = new MemoryChildNodeEntry(name, child);
            return new WrapChildEntryFunction().apply(entry).getNodeState();
        } else {
            return child;
        }
    }
View Full Code Here
215
216
217
218
219
220
221
222
                // tell in advance that the full subtree is readable. Then
                // we also wouldn't need the above getChildNodeCount() call
                // that's somewhat expensive on the MongoMK.
                return input;
            } else {
                return new MemoryChildNodeEntry(name, secureChild);
            }
        }
View Full Code Here
367
368
369
370
371
372
373
374
375
        } else if (childName == Template.MANY_CHILD_NODES) {
            return getChildNodeMap().getEntries();
        } else {
            Segment segment = getSegment();
            RecordId childNodeId = segment.readRecordId(getOffset(0, 1));
            return Collections.singletonList(new MemoryChildNodeEntry(
                    childName, new SegmentNodeState(childNodeId)));
        }
    }
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
                    for (String p : values) {
                        NodeState property = index.getChildNode(p);
                        if (property.exists()) {
                            // we have an entry for this value, so use it
                            it.enqueue(Iterators.singletonIterator(
                                    new MemoryChildNodeEntry("", property)));
                        }
                    }
                }
                return it;
            }
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
    @Override
    public NodeState getChildNode(@Nonnull String name) {
        NodeState child = state.getChildNode(checkNotNull(name));
        if (child.exists() && !treePermission.canReadAll()) {
            ChildNodeEntry entry = new MemoryChildNodeEntry(name, child);
            return new WrapChildEntryFunction().apply(entry).getNodeState();
        } else {
            return child;
        }
    }
View Full Code Here
199
200
201
202
203
204
205
206
                // tell in advance that the full subtree is readable. Then
                // we also wouldn't need the above getChildNodeCount() call
                // that's somewhat expensive on the DocumentMK.
                return input;
            } else {
                return new MemoryChildNodeEntry(name, secureChild);
            }
        }
View Full Code Here
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
            while (offset > 0) {
                iterator.next();
                offset--;
            }
            while (count > 0 && iterator.hasNext()) {
                entries.add(new MemoryChildNodeEntry(iterator.next()));
                count--;
            }
            offset = childNodes.size();
        }

        if (count > 0 && childNodeCount > MAX_CHILD_NODE_NAMES) {
            String json = kernel.getNodes(
                    path, revision, 0, offset, all ? -1 : count, null);

            JsopReader reader = new JsopTokenizer(json);
            reader.read('{');
            do {
                String name = reader.readString();
                reader.read(':');
                if (reader.matches('{')) {
                    reader.read('}');
                    String childPath = getChildPath(name);
                    NodeState child = new KernelNodeState(
                            kernel, valueFactory, childPath, revision);
                    entries.add(new MemoryChildNodeEntry(name, child));
                } else {
                    reader.read();
                }
            } while (reader.matches(','));
            reader.read('}');
View Full Code Here
278
279
280
281
282
283
284
285
286
287
288
                    if (reader.matches('{')) {
                        reader.read('}');
                        String childPath = getChildPath(name);
                        NodeState child =
                                new KernelNodeState(kernel, childPath, revision);
                        entries.add(new MemoryChildNodeEntry(name, child));
                    } else {
                        reader.read();
                    }
                } while (reader.matches(','));
                reader.read('}');
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
        PathRestriction restriciton = filter.getPathRestriction();
        switch (restriciton) {
        case EXACT:
        case ALL_CHILDREN:
            nodeIterators.add(Iterators.singletonIterator(
                    new MemoryChildNodeEntry(currentPath, node)));
            parentPath = "";
            break;
        case PARENT:
            if (parent != null) {
                nodeIterators.add(Iterators.singletonIterator(
                        new MemoryChildNodeEntry(parentPath, parent)));
                parentPath = "";
            }
            break;
        case DIRECT_CHILDREN:
            nodeIterators.add(node.getChildNodeEntries().iterator());
View Full Code Here
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
            switch (restriction) {
            case NO_RESTRICTION:
            case EXACT:
            case ALL_CHILDREN:
                nodeIterators.add(Iterators.singletonIterator(
                        new MemoryChildNodeEntry(currentPath, node)));
                parentPath = "";
                break;
            case PARENT:
                if (parent != null) {
                    nodeIterators.add(Iterators.singletonIterator(
                            new MemoryChildNodeEntry(parentPath, parent)));
                    parentPath = "";
                }
                break;
            case DIRECT_CHILDREN:
                nodeIterators.add(node.getChildNodeEntries().iterator());
View Full Code Here
TOP

Related Classes of org.apache.jackrabbit.oak.plugins.memory.MemoryChildNodeEntry

  • org.apache.jackrabbit.oak.core.SecureNodeState
  • org.apache.jackrabbit.oak.core.SecureNodeState$WrapChildEntryFunction
  • org.apache.jackrabbit.oak.kernel.KernelNodeState
  • org.apache.jackrabbit.oak.plugins.index.p2.strategy.ContentMirrorStoreStrategy
  • org.apache.jackrabbit.oak.plugins.index.property.strategy.ContentMirrorStoreStrategy
  • org.apache.jackrabbit.oak.plugins.index.property.strategy.OrderedContentMirrorStoreStrategy
  • org.apache.jackrabbit.oak.plugins.segment.SegmentNodeState
  • org.apache.jackrabbit.oak.plugins.segment.Template
  • org.apache.jackrabbit.oak.query.index.TraversingCursor
  • org.apache.jackrabbit.oak.spi.query.Cursors$TraversingCursor
    • 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.