Examples of ChildInfo

Examples of net.sourceforge.cruisecontrol.gendoc.ChildInfo

129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
    // allowing us to make sure that the right plugin info gets associated with each
    // project.
    AttributeInfo[] noAttrs = {};
    ChildInfo[] noChildren = {};
    PluginInfo rootInfo = new PluginInfo(null, "cruisecontrol", "", "", noAttrs, new ChildInfo[] {
        new ChildInfo("", "", 0, -1, "", new PluginInfo[] {
          new PluginInfo(null, "project", "", "", noAttrs, new ChildInfo[] {
            new ChildInfo("", "", 0, -1, "", new PluginInfo[] {
              new PluginInfo(null, "schedule", "root version of schedule", "", noAttrs, noChildren)
            })})})});
    PluginInfo proj1Info = new PluginInfo(null, "cruisecontrol", "", "", noAttrs, new ChildInfo[] {
        new ChildInfo("", "", 0, -1, "", new PluginInfo[] {
          new PluginInfo(null, "project", "", "", noAttrs, new ChildInfo[] {
            new ChildInfo("", "", 0, -1, "", new PluginInfo[] {
              schedule1Info = new PluginInfo(null, "schedule", "proj1 version of schedule", "", new AttributeInfo[] {
                new AttributeInfo("interval", AttributeType.NUMBER, "", "", "", new int[] {0, 1}, "")
              }, noChildren)
            })})})});
    PluginInfo proj2Info = new PluginInfo(null, "cruisecontrol", "", "", noAttrs, new ChildInfo[] {
        new ChildInfo("", "", 0, -1, "", new PluginInfo[] {
          new PluginInfo(null, "project", "", "", noAttrs, new ChildInfo[] {
            new ChildInfo("", "", 0, -1, "", new PluginInfo[] {
              schedule2Info = new PluginInfo(null, "schedule", "proj2 version of schedule", "", new AttributeInfo[] {
                new AttributeInfo("interval", AttributeType.NUMBER, "", "", "", new int[] {0, 1}, "")
              }, noChildren)
            })})})});
   
View Full Code Here

Examples of org.apache.jackrabbit.spi.ChildInfo

115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
                    new Iterator<ChildInfo>() {
                        public boolean hasNext() {
                            return childInfos.hasNext();
                        }
                        public ChildInfo next() {
                            ChildInfo cInfo = 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

Examples of org.apache.jackrabbit.spi.ChildInfo

653
654
655
656
657
658
659
660
661
662
663
664
            ((ChildNodeEntriesImpl) childNodeEntries).update(childInfos);
        } else {
            // filter those entries that have been moved to the attic.
            List<ChildInfo> remaining = new ArrayList<ChildInfo>();
            while (childInfos.hasNext()) {
                ChildInfo ci = childInfos.next();
                if (!childNodeAttic.contains(ci.getName(), ci.getIndex(), ci.getUniqueID())) {
                    remaining.add(ci);
                }
            }
            ((ChildNodeEntriesImpl) childNodeEntries).update(remaining.iterator());
        }
View Full Code Here

Examples of org.apache.jackrabbit.spi.ChildInfo

79
80
81
82
83
84
85
86
87
88
89
90
91
         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

Examples of org.apache.jackrabbit.spi.ChildInfo

157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
     */
    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

Examples of org.apache.jackrabbit.spi.ChildInfo

105
106
107
108
109
110
111
112
113
114
115
            NodeInfoImpl nInfo = (NodeInfoImpl) nodeInfos.pop();
            nInfo.resolveUUID(idFactory);
            NodeInfo parent = getCurrentNodeInfo();
            if (parent != null) {
                if (nInfo.getPath().getAncestor(1).equals(parent.getPath())) {
                    ChildInfo ci = new ChildInfoImpl(nInfo.getName(), nInfo.getUniqueID(), nInfo.getIndex());
                    ((NodeInfoImpl) parent).addChildInfo(ci);
                } else {
                    log.debug("NodeInfo '"+ nInfo.getPath() + "' out of hierarchy. Parent path = " + parent.getPath());
                }
            }
View Full Code Here

Examples of org.apache.jackrabbit.spi.ChildInfo

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

Examples of org.apache.jackrabbit.spi.ChildInfo

79
80
81
82
83
84
85
86
87
88
89
90
91
         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

Examples of org.apache.jackrabbit.spi.ChildInfo

157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
     */
    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

Examples of org.apache.jackrabbit.spi.ChildInfo

655
656
657
658
659
660
661
662
663
664
665
666
            ((ChildNodeEntriesImpl) childNodeEntries).update(childInfos);
        } else {
            // filter those entries that have been moved to the attic.
            List<ChildInfo> remaining = new ArrayList<ChildInfo>();
            while (childInfos.hasNext()) {
                ChildInfo ci = childInfos.next();
                if (!childNodeAttic.contains(ci.getName(), ci.getIndex(), ci.getUniqueID())) {
                    remaining.add(ci);
                }
            }
            ((ChildNodeEntriesImpl) childNodeEntries).update(remaining.iterator());
        }
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.