Package org.apache.jackrabbit.spi

Examples of org.apache.jackrabbit.spi.ChildInfo

82
83
84
85
86
87
88
89
90
91
92
93
94
         this.parent = parent;
         this.factory = factory;

         if (childNodeInfos != null) {
             while (childNodeInfos.hasNext()) {
                 ChildInfo ci = childNodeInfos.next();
                 NodeEntry entry = factory.createNodeEntry(parent, ci.getName(), ci.getUniqueID());
                 add(entry, ci.getIndex());
             }
             complete = true;
         } else {
             complete = false;
         }
View Full Code Here
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
     */
    synchronized void update(Iterator<ChildInfo> childNodeInfos) {
        // insert missing entries and reorder all if necessary.
        LinkedEntries.LinkNode prevLN = null;
        while (childNodeInfos.hasNext()) {
            ChildInfo ci = childNodeInfos.next();
            LinkedEntries.LinkNode ln = entriesByName.getLinkNode(ci.getName(), ci.getIndex(), ci.getUniqueID());
            if (ln == null) {
                // add missing at the correct position.
                NodeEntry entry = factory.createNodeEntry(parent, ci.getName(), ci.getUniqueID());
                ln = internalAddAfter(entry, ci.getIndex(), prevLN);
            } else if (prevLN != null) {
                // assert correct order of existing
                if (prevLN != ln) {
                    reorderAfter(ln, prevLN);
                } else {
View Full Code Here
212
213
214
215
216
217
218
219
220
221
        rs.submit(b);

        Iterator it = rs.getChildInfos(si, nid);
        int i = 1;
        while (it.hasNext()) {
            ChildInfo ci = (ChildInfo) it.next();
            assertEquals(i, new Integer(ci.getName().getLocalName()).intValue());
            i++;
        }
    }
View Full Code Here
234
235
236
237
238
239
240
241
242
243
        rs.submit(b);

        Iterator it = rs.getChildInfos(si, nid);
        int i = 1;
        while (it.hasNext()) {
            ChildInfo ci = (ChildInfo) it.next();
            assertEquals(i, new Integer(ci.getName().getLocalName()).intValue());
            i++;
        }
    }
View Full Code Here
656
657
658
659
660
661
662
663
664
665
666
667
            ((ChildNodeEntriesImpl) childNodeEntries).update(childInfos);
        } else {
            // filter those entries that have been moved to the attic.
            List remaining = new ArrayList();
            while (childInfos.hasNext()) {
                ChildInfo ci = (ChildInfo) childInfos.next();
                if (!childNodeAttic.contains(ci.getName(), ci.getIndex(), ci.getUniqueID())) {
                    remaining.add(ci);
                }
            }
            ((ChildNodeEntriesImpl) childNodeEntries).update(remaining.iterator());
        }
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
                    new Iterator() {
                        public boolean hasNext() {
                            return childInfos.hasNext();
                        }
                        public Object next() {
                            ChildInfo cInfo = (ChildInfo) childInfos.next();
                            if (cInfo instanceof Serializable) {
                                return cInfo;
                            } else {
                                return new ChildInfoImpl(cInfo.getName(), cInfo.getUniqueID(), cInfo.getIndex());
                            }
                        }
                        public void remove() {
                            throw new UnsupportedOperationException();
                        }
View Full Code Here
657
658
659
660
661
662
663
664
665
666
667
668
            ((ChildNodeEntriesImpl) childNodeEntries).update(childInfos);
        } else {
            // filter those entries that have been moved to the attic.
            List remaining = new ArrayList();
            while (childInfos.hasNext()) {
                ChildInfo ci = (ChildInfo) childInfos.next();
                if (!childNodeAttic.contains(ci.getName(), ci.getIndex(), ci.getUniqueID())) {
                    remaining.add(ci);
                }
            }
            ((ChildNodeEntriesImpl) childNodeEntries).update(remaining.iterator());
        }
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
93
94
         this.parent = parent;
         this.factory = factory;

         if (childNodeInfos != null) {
             while (childNodeInfos.hasNext()) {
                 ChildInfo ci = (ChildInfo) childNodeInfos.next();
                 NodeEntry entry = factory.createNodeEntry(parent, ci.getName(), ci.getUniqueID());
                 add(entry, ci.getIndex());
             }
             complete = true;
         } else {
             complete = false;
         }
View Full Code Here
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
     */
    synchronized void update(Iterator childNodeInfos) {
        // insert missing entries and reorder all if necessary.
        LinkedEntries.LinkNode prevLN = null;
        while (childNodeInfos.hasNext()) {
            ChildInfo ci = (ChildInfo) childNodeInfos.next();
            LinkedEntries.LinkNode ln = entriesByName.getLinkNode(ci.getName(), ci.getIndex(), ci.getUniqueID());
            if (ln == null) {
                // add missing at the correct position.
                NodeEntry entry = factory.createNodeEntry(parent, ci.getName(), ci.getUniqueID());
                ln = internalAddAfter(entry, ci.getIndex(), prevLN);
            } else if (prevLN != null) {
                // assert correct order of existing
                if (prevLN != ln) {
                    reorderAfter(ln, prevLN);
                } else {
View Full Code Here
670
671
672
673
674
675
676
677
678
679
680
681
            ((ChildNodeEntriesImpl) childNodeEntries).update(childInfos);
        } else {
            // filter those entries that have been moved to the attic.
            List remaining = new ArrayList();
            while (childInfos.hasNext()) {
                ChildInfo ci = (ChildInfo) childInfos.next();
                if (!childNodeAttic.contains(ci.getName(), ci.getIndex(), ci.getUniqueID())) {
                    remaining.add(ci);
                }
            }
            ((ChildNodeEntriesImpl) childNodeEntries).update(remaining.iterator());
        }
View Full Code Here
TOP

Related Classes of org.apache.jackrabbit.spi.ChildInfo

  • org.apache.jackrabbit.jcr2spi.hierarchy.ChildNodeEntriesImpl
  • org.apache.jackrabbit.jcr2spi.hierarchy.NodeEntryImpl
  • org.apache.jackrabbit.spi.commons.NodeInfoImpl
  • org.apache.jackrabbit.spi2davex.BatchTest
  • org.apache.jackrabbit.spi2davex.ItemInfoJsonHandler
    • 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.