Examples of com.sleepycat.je.tree.BIN.compress()

com.sleepycat.je.tree.BIN.compress()
Compress this BIN by removing any entries that are deleted. No cursors may be present on the BIN. Caller is responsible for latching and unlatching this node. @param localTracker is used only for temporary DBs, and may be specifiedto consolidate multiple tracking operations. If null, the tracking is performed immediately in this method. @return true if all deleted slots were compressed, or false if one ormore slots could not be compressed because we were unable to obtain a lock.

        if (bin.nCursors() > 0) {
            return;
        }


        /* Compress. Then if empty, queue for pruning. */
        if (bin.compress(null /*localTracker*/)) {
            if (bin.getNEntries() == 0) {
                addBinToQueue(bin, false);
            }
        }

View Full Code Here

    bin = null;
    dupRoot.latch();
    bin = (BIN) DbInternal.dbGetDatabaseImpl(exampleDb)
        .getTree()
        .getFirstNode(dupRoot);
    bin.compress(null, true);
    bin.releaseLatch();
    bin = null;


    Cursor cursor = exampleDb.openCursor(null, null);
    DatabaseEntry foundKey = new DatabaseEntry();

View Full Code Here

                removeCompressibleBinReference(bin.getNodeId());
            if ((binRef == null) || (!binRef.deletedKeysExist())) {
                return;
            } else {


                boolean requeued = bin.compress(binRef, false /* canFetch */);
                lazyProcessed++;


                /* 
                 * If this wasn't requeued, but there were deleted keys
                 * remaining, requeue, so the daemon can handle this.  Either

View Full Code Here

                removeCompressibleBinReference(bin.getNodeId());
            if ((binRef == null) || (!binRef.deletedKeysExist())) {
                return;
            } else {


                boolean requeued = bin.compress(binRef, false /* canFetch */);
                lazyProcessed++;


                /* 
                 * If this wasn't requeued, but there were deleted keys
                 * remaining, requeue, so the daemon can handle this.  Either

View Full Code Here

            if ((binRef == null) || (!binRef.deletedKeysExist())) {
                return;
            } else {


                boolean requeued =
                    bin.compress(binRef, false /* canFetch */, localTracker);
                lazyProcessed++;


                /*
                 * If this wasn't requeued, but there were deleted keys
                 * remaining, requeue, so the daemon can handle this.  Either

View Full Code Here

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.