Examples of org.apache.jackrabbit.mk.model.NodeState

org.apache.jackrabbit.mk.model.NodeState
A content tree consists of nodes and properties, each of which evolves through different states during its lifecycle. This interface represents a specific, immutable state of a node in a content tree. A node consists of an unordered set of name -> item mappings, where each item is either a property or a child node.
Depending on context, a NodeState instance can be interpreted as representing the state of just that node, of the subtree starting at that node, or of an entire tree in case it's a root node.
The crucial difference between this interface and the similarly named class in Jackrabbit 2.x is that this interface represents a specific, immutable state of a node, whereas the Jackrabbit 2.x class represented the current state of a node.
Immutability and thread-safety

As mentioned above, all node and property states are always immutable. Thus repeating a method call is always guaranteed to produce the same result as before unless some internal error occurs (see below). This immutability only applies to a specific state instance. Different states of a node can obviously be different, and in some cases even different instances of the same state may behave slightly differently. For example due to performance optimization or other similar changes the iteration order of properties or child nodes may be different for two instances of the same state.
In addition to being immutable, a specific state instance guaranteed to be fully thread-safe. Possible caching or other internal changes need to be properly synchronized so that any number of concurrent clients can safely access a state instance.
Persistence and error-handling

A node state can be (and often is) backed by local files or network resources. All IO operations or related concerns like caching should be handled transparently below this interface. Potential IO problems and recovery attempts like retrying a timed-out network access need to be handled below this interface, and only hard errors should be thrown up as {@link RuntimeException unchecked exceptions} that higher level codeis not expected to be able to recover from.
Since this interface exposes no higher level constructs like access controls, locking, node types or even path parsing, there's no way for content access to fail because of such concerns. Such functionality and related checked exceptions or other control flow constructs should be implemented on a higher level above this interface.
Decoration and virtual content

Not all content exposed by this interface needs to be backed by actual persisted data. An implementation may want to provide derived data, like for example the aggregate size of the entire subtree as an extra virtual property. A virtualization, sharding or caching layer could provide a composite view over multiple underlying content trees. Or a basic access control layer could decide to hide certain content based on specific rules. All such features need to be implemented according to the API contract of this interface. A separate higher level interface needs to be used if an implementation can't for example guarantee immutability of exposed content as discussed above.
Equality and hash codes

Two node states are considered equal if and only if their properties and child nodes match, regardless of ordering. The {@link Object#equals(Object)} method needs to be implemented so that itcomplies with this definition. And while node states are not meant for use as hash keys, the {@link Object#hashCode()} method should still beimplemented according to this equality contract.

            throw new IllegalStateException("not initialized");
        } else if (!PathUtils.isAbsolute(path)) {
            throw new IllegalArgumentException("illegal path");
        }


        NodeState node = rs.getNodeState(rs.getRootNode(revId));
        for (String name : PathUtils.split(path)) {
            node = node.getChildNode(name);
            if (node == null) {
                break;
            }
        }
        return node;

View Full Code Here

            throw new IllegalStateException("not initialized");
        } else if (!PathUtils.isAbsolute(path)) {
            throw new IllegalArgumentException("illegal path");
        }


        NodeState node = rs.getNodeState(rs.getRootNode(revId));
        for (String name : PathUtils.split(path)) {
            node = node.getChildNode(name);
            if (node == null) {
                return false;
            }
        }
        return true;

View Full Code Here

            NodeState before, NodeState after, NodeStateDiff diff) {
        Set<String> beforeChildNodes = new HashSet<String>();


        for (ChildNodeEntry beforeCNE : before.getChildNodeEntries(0, -1)) {
            String name = beforeCNE.getName();
            NodeState beforeChild = beforeCNE.getNode();
            NodeState afterChild = after.getChildNode(name);
            if (afterChild == null) {
                diff.childNodeDeleted(name, beforeChild);
            } else {
                beforeChildNodes.add(name);
                if (!beforeChild.equals(afterChild)) {
                    diff.childNodeChanged(name, beforeChild, afterChild);
                }
            }
        }


        for (ChildNodeEntry afterChild : after.getChildNodeEntries(0, -1)) {
            String name = afterChild.getName();
            if (!beforeChildNodes.contains(name)) {
                diff.childNodeAdded(name, afterChild.getNode());
            }
        }
    }

View Full Code Here

        if (fromRevisionId.equals(toRevisionId)) {
            return "";
        }


        try {
            NodeState before = rep.getNodeState(fromRevisionId, path);
            NodeState after = rep.getNodeState(toRevisionId, path);


            return new DiffBuilder(before, after, path, rep.getRevisionStore(), filter).build();
        } catch (Exception e) {
            throw new MicroKernelException(e);
        }

View Full Code Here

            throw new IllegalStateException("this instance has already been disposed");
        }


        Id revId = revisionId == null ? getHeadRevisionId() : Id.fromString(revisionId);


        NodeState nodeState;
        try {
            nodeState = rep.getNodeState(revId, path);
        } catch (Exception e) {
            throw new MicroKernelException(e);
        }
        if (nodeState != null) {
            return nodeState.getChildNodeCount();
        } else {
            throw new MicroKernelException("Path " + path + " not found in revision " + revisionId);
        }
    }

View Full Code Here

        Id revId = revisionId == null ? getHeadRevisionId() : Id.fromString(revisionId);


        // TODO extract and evaluate filter criteria (such as e.g. ':hash') specified in 'filter' parameter


        try {
            NodeState nodeState = rep.getNodeState(revId, path);
            if (nodeState == null) {
                return null;
            }
            JsopBuilder buf = new JsopBuilder().object();
            toJson(buf, nodeState, depth, (int) offset, count, true);

View Full Code Here

                    // specified range spans a single commit:
                    // use diff stored in commit instead of building it dynamically
                    return toCommit.getChanges();
                }
            }
            NodeState before = rep.getNodeState(fromRevisionId, path);
            NodeState after = rep.getNodeState(toRevisionId, path);


            return new DiffBuilder(before, after, path, rep.getRevisionStore(), path).build();
        } catch (Exception e) {
            throw new MicroKernelException(e);
        }

View Full Code Here

            throw new IllegalStateException("this instance has already been disposed");
        }


        Id revId = revisionId == null ? getHeadRevisionId() : Id.fromString(revisionId);


        NodeState nodeState;
        try {
            nodeState = rep.getNodeState(revId, path);
        } catch (Exception e) {
            throw new MicroKernelException(e);
        }
        if (nodeState != null) {
            return nodeState.getChildNodeCount();
        } else {
            throw new MicroKernelException("Path " + path + " not found in revision " + revisionId);
        }
    }

View Full Code Here

            // both an offset > 0 and a filter on node names have been specified...
            throw new IllegalArgumentException("offset > 0 with child node filter");
        }


        try {
            NodeState nodeState = rep.getNodeState(revId, path);
            if (nodeState == null) {
                return null;
            }


            JsopBuilder buf = new JsopBuilder().object();

View Full Code Here

                    // optimization for large child node lists:
                    // no need to iterate over the entire child node list if the filter
                    // does not include wildcards
                    int count = maxChildNodes == -1 ? Integer.MAX_VALUE : maxChildNodes;
                    for (String name : childFilter.getInclusionPatterns()) {
                        NodeState child = node.getChildNode(name);
                        if (child != null) {
                            boolean incl = true;
                            for (String exclName : childFilter.getExclusionPatterns()) {
                                if (name.equals(exclName)) {
                                    incl = false;

View Full Code Here

0 1

TOP

Related Classes of org.apache.jackrabbit.mk.model.NodeState

org.apache.jackrabbit.mk.core.MicroKernelImpl

org.apache.jackrabbit.mk.core.Repository

org.apache.jackrabbit.mk.store.AbstractRevisionStore

org.apache.jackrabbit.oak.core.ConnectionImpl

org.apache.jackrabbit.oak.jcr.state.TransientNodeState

org.apache.jackrabbit.oak.kernel.KernelNodeState

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.

Examples of org.apache.jackrabbit.mk.model.NodeState

Immutability and thread-safety

Persistence and error-handling

Decoration and virtual content

Equality and hash codes

Related Classes of org.apache.jackrabbit.mk.model.NodeState