Examples of org.apache.jackrabbit.oak.core.ImmutableTree

org.apache.jackrabbit.oak.core.ImmutableTree
Immutable implementation of the {@code Tree} interface in order to providethe much feature rich API functionality for a given {@code NodeState}.
Tree hierarchy
Due to the nature of this {@code Tree} implementation creating a properhierarchical view of the tree structure is the responsibility of the caller. It is recommended to start with the state of the {@link #ImmutableTree(org.apache.jackrabbit.oak.spi.state.NodeState) root node}and build up the hierarchy by calling {@link #ImmutableTree(ImmutableTree,String,org.apache.jackrabbit.oak.spi.state.NodeState)}for every subsequent child state. Note, that this implementation will not perform any kind of validation of the passed state and methods like {@link #isRoot()}, {@link #getName()} or {@link #getPath()} will just make use of the hierarchy that has beencreate by that sequence. In order to create a disconnected individual tree in cases where the hierarchy information is not (yet) need or known it is suggested to use {@link #ImmutableTree(org.apache.jackrabbit.oak.core.ImmutableTree.ParentProvider,String,org.apache.jackrabbit.oak.spi.state.NodeState)}an specify an appropriate {@code ParentProvider} implementation.
ParentProvider
Apart from create the tree hierarchy in traversal mode this tree implementation allows to instantiate disconnected trees that depending on the use may never or on demand retrieve hierarchy information. The following default implementations of this internal interface are present:
- {@link DefaultParentProvider}: used with the default usage where the parent tree is passed to the constructor
- {@link ParentProvider#ROOT_PROVIDER}: the default parent provider for the root tree. All children will get {@link DefaultParentProvider}
- {@link ParentProvider#UNSUPPORTED}: throws {@code UnsupportedOperationException}upon hierarchy related methods like {@link #getParent()}, {@link #getPath()}
TreeTypeProvider
For optimization purpose an Immutable tree will be associated with a {@code TreeTypeProvider} that allows for fast detection of the following typesof Trees:
- {@link TreeTypeProvider#TYPE_HIDDEN}: a hidden tree whose name starts with ":". Please note that the whole subtree of a hidden node is considered hidden.
- {@link TreeTypeProvider#TYPE_AC}: A tree that stores access control content and requires special access {@link org.apache.jackrabbit.oak.spi.security.authorization.permission.Permissions#READ_ACCESS_CONTROL permissions}.
- {@link TreeTypeProvider#TYPE_VERSION}: if a given tree is located within any of the version related stores defined by JSR 283. Depending on the permission evaluation implementation those items require special treatment.
- {@link TreeTypeProvider#TYPE_DEFAULT}: the default type for trees that don't match any of the upper types.
Equality and hash code
In contrast to {@link MutableTree} the {@code ImmutableTree} implements{@link Object#equals(Object)} and {@link Object#hashCode()}: Two {@code ImmutableTree}s are consider equal if their name and the underlying {@code NodeState}s are equal. Note however, that according to the contract defined in {@code NodeState} theseobjects are not expected to be used as hash keys.

            userEntries = Collections.emptyMap();
            groupEntries = Collections.emptyMap();
        } else {
            EntriesBuilder builder = new EntriesBuilder();
            for (Principal principal : principals) {
                ImmutableTree t = getPrincipalRoot(permissionsTree, principal);
                if (t.exists()) {
                    trees.put(principal.getName(), t);
                    builder.addEntries(principal, t, restrictionProvider);
                }
            }
            repoEntries = builder.getRepoEntries();

View Full Code Here

            return null;
        }
    }


    private static Tree getTree(String name, NodeState nodeState) {
        return new ImmutableTree(ImmutableTree.ParentProvider.UNSUPPORTED, name, nodeState, TreeTypeProvider.EMPTY);
    }

View Full Code Here

        this.workspaceName = root.getContentSession().getWorkspaceName();
        acConfig = securityProvider.getConfiguration(AccessControlConfiguration.class);
        if (principals.contains(SystemPrincipal.INSTANCE) || isAdmin(principals)) {
            compiledPermissions = AllPermissions.getInstance();
        } else {
            ImmutableTree permissionsTree = getPermissionsRoot();
            if (!permissionsTree.exists() || principals.isEmpty()) {
                compiledPermissions = NoPermissions.getInstance();
            } else {
                compiledPermissions = new CompiledPermissionImpl(principals,
                        permissionsTree, getBitsProvider(),
                        acConfig.getRestrictionProvider(),

View Full Code Here


        assertFalse(cp.hasPrivileges(null, PrivilegeConstants.JCR_READ));
    }


    private CompiledPermissionImpl createPermissions(Set<Principal> principals) {
        ImmutableTree permissionsTree = new ImmutableRoot(root, TreeTypeProvider.EMPTY).getTree(PERMISSIONS_STORE_PATH);
        return new CompiledPermissionImpl(principals, permissionsTree, pbp, rp, DEFAULT_READ_PATHS);
    }

View Full Code Here

        NodeBuilder root = EMPTY_NODE.builder();
        createPath(root, "a/b/c/d");
        createPath(root, "q");
        createPath(root, "x/y/x/y/z");
        createPath(root, "r/s/t/u/v/r/s/t/u/v/r/s/t/u/v/w");
        tree = new ImmutableTree(root.getNodeState());
    }

View Full Code Here

     * ** should match every path
     */
    @Test
    public void all() {
        Filter filter = new GlobbingPathFilter(STAR_STAR);
        ImmutableTree t = tree;


        for(String name : elements("a/b/c/d")) {
            t = t.getChild(name);
            assertTrue(filter.includeAdd(name, t.getNodeState()));
            filter = filter.create(name, t.getNodeState(), t.getNodeState());
            assertNotNull(filter);
        }
    }

View Full Code Here

     * **&#47r/s/t/u/v should match r/s/t/u/v and r/s/t/u/v/r/s/t/u/v and r/s/t/u/v/r/s/t/u/v/r/s/t/u/v
     */
    @Test
    public void multipleMatches() {
        Filter filter = new GlobbingPathFilter("**/r/s/t/u/v");
        ImmutableTree t = tree;


        for(int c = 0; c < 2; c++) {
            for(String name : elements("r/s/t/u")) {
                t = t.getChild(name);
                assertFalse(filter.includeAdd(name, t.getNodeState()));
                filter = filter.create(name, t.getNodeState(), t.getNodeState());
                assertNotNull(filter);
            }


            t = t.getChild("v");
            assertTrue(filter.includeAdd("v", t.getNodeState()));
            filter = filter.create("v", t.getNodeState(), t.getNodeState());
            assertNotNull(filter);
        }
    }

View Full Code Here

     * **&#47r/s/t/u/v/w should match r/s/t/u/v/r/s/t/u/v/r/s/t/u/v/w
     */
    @Test
    public void matchAtEnd() {
        Filter filter = new GlobbingPathFilter("**/r/s/t/u/v/w");
        ImmutableTree t = tree;


        for(String name : elements("r/s/t/u/v/r/s/t/u/v/r/s/t/u/v")) {
            t = t.getChild(name);
            assertFalse(filter.includeAdd(name, t.getNodeState()));
            filter = filter.create(name, t.getNodeState(), t.getNodeState());
            assertNotNull(filter);
        }


        t = t.getChild("w");
        assertTrue(filter.includeAdd("w", t.getNodeState()));
        filter = filter.create("w", t.getNodeState(), t.getNodeState());
        assertNotNull(filter);
    }

View Full Code Here

     * r/s/t&#47** should match r/s/t and all its descendants
     */
    @Test
    public void matchSuffix() {
        Filter filter = new GlobbingPathFilter("r/s/t/**");
        ImmutableTree t = tree;


        for(String name : elements("r/s")) {
            t = t.getChild(name);
            assertFalse(filter.includeAdd(name, t.getNodeState()));
            filter = filter.create(name, t.getNodeState(), t.getNodeState());
            assertNotNull(filter);
        }


        for (String name: elements("t/u/v/r/s/t/u/v/r/s/t/u/v/w")) {
            t = t.getChild(name);
            assertTrue(filter.includeAdd(name, t.getNodeState()));
            filter = filter.create(name, t.getNodeState(), t.getNodeState());
            assertNotNull(filter);
        }
    }

View Full Code Here

    }


    private static TreePermission getTreePermission(PermissionProvider permissionProvider,
            NodeState root, String basePath) {
        TreePermission treePermission = permissionProvider.getTreePermission(
                new ImmutableTree(root), TreePermission.EMPTY);


        for (String name : PathUtils.elements(basePath)) {
            root = root.getChildNode(name);
            treePermission = treePermission.getChildPermission(name, root);
        }

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of org.apache.jackrabbit.oak.core.ImmutableTree

org.apache.jackrabbit.oak.api.PropertyState

org.apache.jackrabbit.oak.jcr.observation.ChangeProcessor

org.apache.jackrabbit.oak.plugins.commit.ConflictValidatorProvider

org.apache.jackrabbit.oak.plugins.name.NamespaceEditor

org.apache.jackrabbit.oak.plugins.name.Namespaces

org.apache.jackrabbit.oak.plugins.name.NamespaceValidator

org.apache.jackrabbit.oak.plugins.name.NamespaceValidatorProvider

org.apache.jackrabbit.oak.plugins.name.NameValidator

org.apache.jackrabbit.oak.plugins.name.NameValidatorProvider

org.apache.jackrabbit.oak.plugins.nodetype.ReadOnlyNodeTypeManager

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.oak.core.ImmutableTree

Tree hierarchy

ParentProvider

TreeTypeProvider

Equality and hash code

Related Classes of org.apache.jackrabbit.oak.core.ImmutableTree