Examples of TreeLocation

com.sleepycat.je.tree.TreeLocation
org.apache.jackrabbit.oak.api.TreeLocation
A {@code TreeLocation} denotes a location inside a tree.It can either refer to a inner node (that is a {@link org.apache.jackrabbit.oak.api.Tree}) or to a leaf (that is a {@link org.apache.jackrabbit.oak.api.PropertyState}). {@code TreeLocation} instances provide methods for navigating trees. {@code TreeLocation}instances are immutable and navigating a tree always results in new {@code TreeLocation}instances. Navigation never fails. Errors are deferred until the underlying item itself is accessed. That is, if a {@code TreeLocation} points to an item which does not exist oris unavailable otherwise (i.e. due to access control restrictions) accessing the tree will return {@code null} at this point.
org.apache.jackrabbit.oak.plugins.tree.TreeLocation
A {@code TreeLocation} denotes a location inside a tree.
It can either refer to a inner node (that is a {@link Tree}), to a leaf (that is a {@link PropertyState}) or to an invalid location which refers to neither of the former. {@code TreeLocation} instances provide methods for navigating trees such that navigationalways results in new {@code TreeLocation} instances. Navigation never fails. Errors aredeferred until the underlying item itself is accessed. That is, if a {@code TreeLocation}points to an item which does not exist or is unavailable otherwise (i.e. due to access control restrictions) accessing the tree will return {@code null} at this point.
org.apache.jackrabbit.oak.util.TreeLocation
A {@code TreeLocation} denotes a location inside a tree.
It can either refer to a inner node (that is a {@link Tree}), to a leaf (that is a {@link PropertyState}) or to an invalid location which refers to neither of the former. {@code TreeLocation} instances provide methods for navigating trees such that navigationalways results in new {@code TreeLocation} instances. Navigation never fails. Errors aredeferred until the underlying item itself is accessed. That is, if a {@code TreeLocation}points to an item which does not exist or is unavailable otherwise (i.e. due to access control restrictions) accessing the tree will return {@code null} at this point.

Examples of com.sleepycat.je.tree.TreeLocation


        /*
         * Generate a map of node->List of intermediate LSNs for this node.
         * to re-create the transaction chain.
         */
        TreeLocation location = new TreeLocation();
        Long undoLsn = lastLoggedLsn;
        TxnChain chain = 
            new TxnChain(undoLsn, id, matchpointLsn, undoDatabases, envImpl);


        try {

View Full Code Here

Examples of com.sleepycat.je.tree.TreeLocation

         * the in-memory btree. We also need to make the latest version of any
         * record modified by the transaction obsolete.
         */
        Set<Long> alreadyUndoneLsns = new HashSet<Long>();
        Set<CompareSlot> alreadyUndoneSlots = new TreeSet<CompareSlot>();
        TreeLocation location = new TreeLocation();
        long undoLsn = lastLoggedLsn;
        try {
            while (undoLsn != NULL_LSN) {
                UndoReader undo = new UndoReader(envImpl,
                                                 undoLsn,

View Full Code Here

Examples of com.sleepycat.je.tree.TreeLocation

            (env, readBufferSize, DbLsn.makeLsn(fileNum, 0), fileNum,
             fileSummary);
        /* Validate all entries before ever deleting a file. */
        reader.setAlwaysValidateChecksum(true);
        try {
            final TreeLocation location = new TreeLocation();


            int nProcessedLNs = 0;
            while (reader.readNextEntryAllowExceptions()) {
                cleaner.nEntriesRead.increment();
                long logLsn = reader.getLastLsn();

View Full Code Here

Examples of com.sleepycat.je.tree.TreeLocation


        lookAheadCache.add
            (Long.valueOf(DbLsn.getFileOffset(logLsn)),
             new LNInfo(targetLN, dbId, key));


        processLN(DbLsn.getFileNumber(logLsn), new TreeLocation(),
                  lookAheadCache, dbCache);
    }

View Full Code Here

Examples of com.sleepycat.je.tree.TreeLocation


        DbTree dbMapTree = env.getDbTree();


        Map<Long, LNInfo> pendingLNs = fileSelector.getPendingLNs();
        if (pendingLNs != null) {
            TreeLocation location = new TreeLocation();


            for (Map.Entry<Long, LNInfo> entry : pendingLNs.entrySet()) {
                long originalLsn = entry.getKey();
                LNInfo info = entry.getValue();
                DatabaseId dbId = info.getDbId();

View Full Code Here

Examples of com.sleepycat.je.tree.TreeLocation

            return;
        }
        LNLogEntry lnEntry = reader.getLNLogEntry();
        lnEntry.postFetchInit(db);
        LN ln = lnEntry.getLN();
        TreeLocation location = new TreeLocation();
        long logLsn = reader.getLastLsn();
        long abortLsn = reader.getAbortLsn();
        boolean abortKnownDeleted = reader.getAbortKnownDeleted();


        try {

View Full Code Here

Examples of com.sleepycat.je.tree.TreeLocation

        for (LogEntryType lt : lnTypes) {
            reader.addTargetType(lt);
        }


        DbTree dbMapTree = envImpl.getDbTree();
        TreeLocation location = new TreeLocation();


        try {


            /*
             * Iterate over the target LNs and construct in-memory tree.

View Full Code Here

Examples of com.sleepycat.je.tree.TreeLocation

            }


            entry.postFetchInit(db);


            Tree tree = db.getTree();
            TreeLocation location = new TreeLocation();
            boolean parentFound = tree.getParentBINForChildLN
                (location, entry.getKey(), false /*splitsAllowed*/,
                 true /*findDeletedEntries*/, CacheMode.UNCHANGED);
            bin = location.bin;
            int index = location.index;

View Full Code Here

Examples of com.sleepycat.je.tree.TreeLocation

                return;
            }


            long undoLsn = reader.getLastLsn();


            TreeLocation location = new TreeLocation();
        
            /* Get the TxnChain for this log entry. */
            TxnChain chain = target.getChain(txnId, undoLsn, envImpl);
            UndoReader undo = new UndoReader(reader, envImpl.getDbTree());

View Full Code Here

Examples of com.sleepycat.je.tree.TreeLocation

            /* Create the file reader. */
            CleanerFileReader reader = new CleanerFileReader
                (env, readBufferSize, DbLsn.NULL_LSN, fileNum);


            DbTree dbMapTree = env.getDbMapTree();
            TreeLocation location = new TreeLocation();


            while (reader.readNextEntry()) {


                nEntriesRead += 1;
                long lsn = reader.getLastLsn();

View Full Code Here

0 1 2 3 4 5

TOP

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.