Examples of org.apache.jackrabbit.spi.Path

org.apache.jackrabbit.spi.Path
The Path interface defines the qualified representation of a JCR path. It consists of an ordered list of {@link Path.Element} objectsand is immutable.
A {@link Path.Element} is either {@link Path.Element#denotesName() named}or one of the following special elements:
- the {@link Element#denotesCurrent() current} element (Notation: "."),
- the {@link Element#denotesParent() parent} element (Notation: ".."),
- the {@link Element#denotesRoot() root} element (Notation: {}), which canonly occur as the first element in a path.
A Path is defined to have the following characteristics:
Equality:
Two paths are equal if they consist of the same elements.
Length:
The {@link Path#getLength() length} of a path is the number of its elements.
Depth:
The {@link Path#getDepth() depth} of a path is
- 0 for the root path,
- 0 for the path consisting of the current element only,
- -1 for the path consisting of the parent element only,
- 1 for the path consisting of any other single element,
- depth(P) + depth(Q) for the path P/Q.
The depth of a valid absolute path equals the length of its normalization minus 1.
Absolute vs. Relative
A path can be absolute or relative:
A path {@link #isAbsolute() is absolute} if its first element is the rootelement. A path is relative if it is not absolute.
- An absolute path is valid if its depth is greater or equals 0. A relative path is always valid.
- Two absolute paths are equivalent if "they refer to the same item in the hierarchy".
- Two relative paths P and Q are equivalent if for every absolute path R such that R/P and R/Q are valid, R/P and R/Q are equivalent.
Normalization:
A path P {@link Path#isNormalized() is normalized} if P has minimal lengthamongst the set of all paths Q which are equivalent to P.
This means that '.' and '..' elements are resolved as much as possible. An absolute path it is normalized if it contains no current nor parent element. The normalization of a path is unique.

Equalivalence:
Path P is {@link Path#isEquivalentTo(Path) equivalent} to path Q (in the above sense)if the normalization of P is equal to the normalization of Q. This is an equivalence relation (i.e. reflexive, transitive, and symmetric).
Canonical Paths:
A path {@link Path#isCanonical() is canonical} if its absolute and normalized.
Hierarchical Relationship:
The ancestor relationship is a strict partial order (i.e. irreflexive, transitive, and asymmetric). Path P is a direct ancestor of path Q if P is equivalent to Q/..
Path P is an {@link Path#isAncestorOf(Path) ancestor} of path Q if
- P is a direct ancestor of Q or
- P is a direct ancestor of some path S which is an ancestor of Q.
Path P is an {@link Path#isDescendantOf(Path) descendant} of path Q if
- Path P is a descendant of path Q if Q is an ancestor of P.

                return m2.getPath();
            }


            String relPath;
            try {
                Path p = m1.getPrimaryPath().computeRelativePath(getPrimaryPath());
                // use prefix mappings of srcSession
                relPath = session.getJCRPath(p);
            } catch (NameException be) {
                // should never get here...
                String msg = "internal error: failed to determine relative path";

View Full Code Here

            return super.getPrimaryPath();
        }


        NodeId parentId = getParentId();
        NodeImpl parentNode = (NodeImpl) getParent();
        Path parentPath = parentNode.getPrimaryPath();
        PathBuilder builder = new PathBuilder(parentPath);


        ChildNodeEntry entry =
            parentNode.getNodeState().getChildNodeEntry(getNodeId());
        if (entry == null) {

View Full Code Here

        }
    }


    public Object visit(TextsearchQueryNode node, Object data) {
        try {
            Path relPath = node.getRelativePath();
            String fieldname;
            if (relPath == null || !node.getReferencesProperty()) {
                // fulltext on node
                fieldname = FieldNames.FULLTEXT;
            } else {
                // final path element is a property name
                Name propName = relPath.getName();
                StringBuffer tmp = new StringBuffer();
                tmp.append(nsMappings.getPrefix(propName.getNamespaceURI()));
                tmp.append(":").append(FieldNames.FULLTEXT_PREFIX);
                tmp.append(propName.getLocalName());
                fieldname = tmp.toString();
            }
            QueryParser parser = new JackrabbitQueryParser(
                    fieldname, analyzer, synonymProvider, cache);
            Query context = parser.parse(node.getQuery());
            if (relPath != null && (!node.getReferencesProperty() || relPath.getLength() > 1)) {
                // text search on some child axis
                Path.Element[] elements = relPath.getElements();
                for (int i = elements.length - 1; i >= 0; i--) {
                    Name name = null;
                    if (!elements[i].getName().equals(RelationQueryNode.STAR_NAME_TEST)) {
                        name = elements[i].getName();
                    }

View Full Code Here

                    }
                    break;
                case PropertyType.PATH:
                    // try to translate path
                    try {
                        Path p = session.getQPath(literal);
                        values.add(resolver.getJCRPath(p));
                        log.debug("Coerced " + literal + " into PATH.");
                    } catch (NameException e) {
                        log.debug("Unable to coerce '" + literal + "' into a PATH: " + e.toString());
                    } catch (NamespaceException e) {

View Full Code Here

        if (count % 10 == 0) {
            checkIndexingQueue(true);
        }
        checkVolatileCommit();
        for (ChildNodeEntry child : node.getChildNodeEntries()) {
            Path childPath = PATH_FACTORY.create(path, child.getName(),
                    child.getIndex(), false);
            NodeState childState = null;
            try {
                childState = (NodeState) stateMgr.getItemState(child.getId());
            } catch (NoSuchItemStateException e) {

View Full Code Here


        // 1. check paths & retrieve state
        NodeState srcState = getNodeState(srcPath);


        Path.Element destName = destPath.getNameElement();
        Path destParentPath = destPath.getAncestor(1);
        NodeState destParentState = getNodeState(destParentPath);
        int ind = destName.getIndex();
        if (ind > 0) {
            // subscript in name element
            String msg =

View Full Code Here

        // 1. check paths & retrieve state


        NodeState srcState = getNodeState(srcStateMgr, srcHierMgr, srcPath);


        Path.Element destName = destPath.getNameElement();
        Path destParentPath = destPath.getAncestor(1);
        NodeState destParentState = getNodeState(destParentPath);
        int ind = destName.getIndex();
        if (ind > 0) {
            // subscript in name element
            String msg =

View Full Code Here

            log.debug(msg);
            throw new RepositoryException(msg, mpe);
        }


        Path.Element srcName = srcPath.getNameElement();
        Path srcParentPath = srcPath.getAncestor(1);
        NodeState target = getNodeState(srcPath);
        NodeState srcParent = getNodeState(srcParentPath);


        Path.Element destName = destPath.getNameElement();
        Path destParentPath = destPath.getAncestor(1);
        NodeState destParent = getNodeState(destParentPath);


        int ind = destName.getIndex();
        if (ind > 0) {
            // subscript in name element

View Full Code Here

                             Name nodeTypeName, int options)
            throws ConstraintViolationException, AccessDeniedException,
            VersionException, LockException, ItemNotFoundException,
            ItemExistsException, RepositoryException {


        Path parentPath = hierMgr.getPath(parentState.getNodeId());


        // 1. locking status


        if ((options & CHECK_LOCK) == CHECK_LOCK) {
            // make sure there's no foreign lock on parent node

View Full Code Here


        if (targetState.getParentId() == null) {
            // root or orphaned node
            throw new ConstraintViolationException("cannot remove root node");
        }
        Path targetPath = hierMgr.getPath(targetState.getNodeId());
        NodeState parentState = getNodeState(parentId);
        Path parentPath = hierMgr.getPath(parentId);


        // 1. locking status


        if ((options & CHECK_LOCK) == CHECK_LOCK) {
            // make sure there's no foreign lock on parent node

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

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

org.apache.jackrabbit.core.BatchedItemOperations

org.apache.jackrabbit.core.CachingHierarchyManager

org.apache.jackrabbit.core.CachingHierarchyManagerTest

org.apache.jackrabbit.core.cluster.ClusterNode

org.apache.jackrabbit.core.cluster.UpdateEventFactory

org.apache.jackrabbit.core.ItemImpl

org.apache.jackrabbit.core.ItemSaveOperation

org.apache.jackrabbit.core.ItemValidator

org.apache.jackrabbit.core.lock.LockManagerImpl

org.apache.jackrabbit.core.NodeImpl

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.