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

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

229
230
231
232
233
234
235
236
                // 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
141
142
143
144
145
146
147
148
149
150
151
            }

            try {
                JackrabbitNodeState child = new JackrabbitNodeState(
                        source, registry, source.load(entry.getId()));
                entries.add(new MemoryChildNodeEntry(name, child));
            } catch (ItemStateException e) {
                warn("Unable to access child entry " + name, e);
            }
        }
        return entries;
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
    @Override
    public NodeState getChildNode(@Nonnull String name) {
        NodeState child = state.getChildNode(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
211
212
213
214
215
216
217
218
                // 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
152
153
154
155
156
157
158
159
160
161
162
            }

            try {
                JackrabbitNodeState child = new JackrabbitNodeState(
                        source, registry, source.load(entry.getId()));
                entries.add(new MemoryChildNodeEntry(name, child));
            } catch (ItemStateException e) {
                warn("Unable to access child entry " + name, e);
            }
        }
        return entries;
View Full Code Here
212
213
214
215
216
217
218
219
220
            return map.getEntries();
        } else {
            segment = segment.getSegment(recordId);
            int offset = recordId.getOffset() + RECORD_ID_BYTES;
            RecordId childNodeId = segment.readRecordId(offset);
            return Collections.singletonList(new MemoryChildNodeEntry(
                    childName, new SegmentNodeState(segment, childNodeId)));
        }
    }
View Full Code Here
366
367
368
369
370
371
372
373
374
        } 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(segment, childNodeId)));
        }
    }
View Full Code Here
131
132
133
134
135
136
137
138
139
140
141
                    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
339
340
341
342
343
344
345
346
347
            return map.getEntries();
        } else {
            int offset = recordId.getOffset() + RECORD_ID_BYTES;
            Segment segment = store.readSegment(recordId.getSegmentId());
            RecordId childNodeId = segment.readRecordId(offset);
            return Collections.singletonList(new MemoryChildNodeEntry(
                    childName, new SegmentNodeState(store, childNodeId)));
        }
    }
View Full Code Here
158
159
160
161
162
163
164
165
166
167
168
                    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
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.