Package org.apache.jackrabbit.jcr2spi.hierarchy

Examples of org.apache.jackrabbit.jcr2spi.hierarchy.HierarchyEntry

215
216
217
218
219
220
221
222
223
224
225
226
227
               checkIncludesMixReferenceable(nodeInfo);

               // potential uuid conflict
               try {
                   NodeId conflictingId = session.getIdFactory().createNodeId(nodeInfo.getUUID());
                   HierarchyEntry conflicting = session.getHierarchyManager().getHierarchyEntry(conflictingId);
                   // assert that the entry is available
                   conflicting.getItemState();

                   nodeState = resolveUUIDConflict(parent, (NodeEntry) conflicting, nodeInfo);
               } catch (ItemNotFoundException e) {
                   // no conflict: create new with given uuid
                   nodeState = importNode(nodeInfo, parent);
View Full Code Here
122
123
124
125
126
127
128
129
130
131
132
     * <code>null</code> in case there are no more items.
     */
    private Item prefetchNext() {
        Item nextItem = null;
        while (nextItem == null && iter.hasNext()) {
            HierarchyEntry entry = (HierarchyEntry) iter.next();
            try {
                nextItem = itemMgr.getItem(entry);
            } catch (ItemNotFoundException e) {
                log.debug("Ignoring nonexistent item " + entry);
                // reduce the size ... and try the next one
View Full Code Here
210
211
212
213
214
215
216
217
218
219
220
        }

        // skip the first (skipNum - 1) items without actually retrieving them
        while (--skipNum > 0) {
            pos++;
            HierarchyEntry entry = (HierarchyEntry) iter.next();
            // check if item exists but don't build Item instance.
            while (!itemMgr.itemExists(entry)) {
                log.debug("Ignoring nonexistent item " + entry);
                entry = (HierarchyEntry) iter.next();
            }
View Full Code Here
140
141
142
143
144
145
146
147
148
149
150
    /**
     * @see ItemManager#getItem(Path)
     */
    public synchronized Item getItem(Path path)
            throws PathNotFoundException, AccessDeniedException, RepositoryException {
        HierarchyEntry itemEntry = hierMgr.getHierarchyEntry(path);
        try {
            return getItem(itemEntry);
        } catch (ItemNotFoundException infe) {
            throw new PathNotFoundException(LogUtil.safeGetJCRPath(path, session.getPathResolver()));
        }
View Full Code Here
255
256
257
258
259
260
261
262
263
264
265
     */
    private Node getNodeById(NodeId id) throws ItemNotFoundException, RepositoryException {
        // check sanity of this session
        checkIsAlive();
        try {
            HierarchyEntry hierarchyEntry = getHierarchyManager().getHierarchyEntry(id);
            Item item = getItemManager().getItem(hierarchyEntry);
            if (item.isNode()) {
                return (Node) item;
            } else {
                log.error("NodeId '" + id + " does not point to a Node");
View Full Code Here
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
     *
     * @param state
     * @throws RepositoryException
     */
    private static void updateId(ItemState state) throws RepositoryException {
        HierarchyEntry he = state.getHierarchyEntry();
        while (he.getStatus() != Status.INVALIDATED) {
            he = he.getParent();
            if (he == null) {
                // root reached without intermediate invalidated entry
                return;
            }
        }
        // he is INVALIDATED -> force reloading in order to be aware of id changes
        he.getItemState();
    }
View Full Code Here
747
748
749
750
751
752
753
754
755
756
757
758
759
760
        if (version.getSession() == this) {
            nodeState = (NodeState) ((NodeImpl) version).getItemState();
        } else {
            Path p = getQPath(version.getPath());
            Path parentPath = p.getAncestor(1);
            HierarchyEntry parentEntry = getHierarchyManager().lookup(parentPath);
            if (parentEntry != null) {
                // make sure the parent entry is up to date
                parentEntry.invalidate(false);
            }
            nodeState = getHierarchyManager().getNodeState(p);
        }
        return nodeState;
    }
View Full Code Here
880
881
882
883
884
885
886
887
888
889
890
891
892
893
        if (version.getSession() == this) {
            nodeState = (NodeState) ((NodeImpl) version).getItemState();
        } else {
            Path p = getQPath(version.getPath());
            Path parentPath = p.getAncestor(1);
            HierarchyEntry parentEntry = getHierarchyManager().lookup(parentPath);
            if (parentEntry != null) {
                // make sure the parent entry is up to date
                parentEntry.invalidate(false);
            }
            nodeState = getHierarchyManager().getNodeState(p);
        }
        return nodeState;
    }
View Full Code Here
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
     *
     * @param state
     * @throws RepositoryException
     */
    private static void updateId(ItemState state) throws RepositoryException {
        HierarchyEntry he = state.getHierarchyEntry();
        while (he.getStatus() != Status.INVALIDATED) {
            he = he.getParent();
            if (he == null) {
                // root reached without intermediate invalidated entry
                return;
            }
        }
        // he is INVALIDATED -> force reloading in order to be aware of id changes
        he.getItemState();
    }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
        assert status == STATUS_PENDING;
        status = STATUS_PERSISTED;
        if (isActivityMerge()) {
            // TODO be more specific about what needs to be invalidated
            // look for the root entry and invalidate the complete tree
            HierarchyEntry entry = nodeState.getNodeEntry();
            while (entry.getParent() != null) {
                entry = entry.getParent();
            }
            entry.invalidate(true);
        } else {
            try {
                NodeEntry vhe = mgr.getVersionHistoryEntry(nodeState);
                if (vhe != null) {
                    vhe.invalidate(true);
View Full Code Here
TOP

Related Classes of org.apache.jackrabbit.jcr2spi.hierarchy.HierarchyEntry

  • org.apache.jackrabbit.jcr2spi.ItemImpl
  • org.apache.jackrabbit.jcr2spi.ItemManagerImpl
  • org.apache.jackrabbit.jcr2spi.LazyItemIterator
  • org.apache.jackrabbit.jcr2spi.lock.LockManagerImpl
  • org.apache.jackrabbit.jcr2spi.NodeImpl
  • org.apache.jackrabbit.jcr2spi.operation.Clone
  • org.apache.jackrabbit.jcr2spi.operation.Merge
  • org.apache.jackrabbit.jcr2spi.operation.RemoveActivity
  • org.apache.jackrabbit.jcr2spi.SessionImpl
  • org.apache.jackrabbit.jcr2spi.state.ChangeLog
    • 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.