Examples of com.sleepycat.je.tree.Key

com.sleepycat.je.tree.Key
Key represents a JE B-Tree Key. Keys are immutable. Within JE, keys are usually represented as byte arrays rather than as Key instances in order to reduce the in-memory footprint. The static methods of this class are used to operate on the byte arrays. One exception is when keys are held within a collection. In that case, Key objects are instantiated so that keys are hashed and compared by value.

                         * therefore no valid delete key. Don't compress.
                         */
                        if (deletedKey != null) {
                            db.getDbEnvironment().addToCompressorQueue
                                (location.bin, 
                                 new Key(deletedKey),
                                 false); // don't wakeup compressor
                        }
                    }


                } else {

View Full Code Here

                            byte[] deletedKey =
                                location.bin.containsDuplicates() ?
                                dupKey : mainKey;
          db.getDbEnvironment().addToCompressorQueue
        (location.bin,
                                 new Key(deletedKey),
                                 false); // don't wakeup compressor
                            
      } else {


          /*

View Full Code Here

            /* mainKey is only used for dups. */
            byte[] mainKey = binRef.getKey();
            boolean isDup = (binRef.getData() != null);


            while (iter.hasNext()) {
                Key key = (Key) iter.next();


                /*
                 * Lookup the BIN for each deleted key, and compress that BIN
                 * separately.
                 */
                BIN splitBin = isDup ?
                    searchForBIN(db, mainKey, key.getKey()) :
                    searchForBIN(db, key.getKey(), null);
                if (splitBin != null) {
                    BINReference splitBinRef = splitBin.createReference();
                    splitBinRef.addDeletedKey(key);
        compressBin(db, splitBin, splitBinRef, tracker);
                }

View Full Code Here

            long dupCountLsn =
                dcl.log(envImpl, database.getId(), dupKey, oldDclLsn, locker);
            dupRoot.updateDupCountLNRef(dupCountLsn);
            dupRoot.releaseLatch();


            locker.addDeleteInfo(dupBin, new Key(lnKey));
        } else {
            locker.addDeleteInfo(bin, new Key(lnKey));
        } 


        trace(Level.FINER, TRACE_DELETE, targetBin,
              ln, targetIndex, oldLsn, newLsn);

View Full Code Here

       * queue.
       */
      if (targetBin.isEntryPendingDeleted(targetIndex)) {
    EnvironmentImpl envImpl = database.getDbEnvironment();
    envImpl.addToCompressorQueue
        (targetBin, new Key(targetBin.getKey(targetIndex)), false);
      }


            /* If fetchTarget returns null, a deleted LN was cleaned. */
      try {
    n = targetBin.fetchTarget(targetIndex);

View Full Code Here

            /* mainKey is only used for dups. */
            byte[] mainKey = binRef.getKey();
            boolean isDup = (binRef.getData() != null);


            while (iter.hasNext()) {
                Key key = (Key) iter.next();


                /*
                 * Lookup the BIN for each deleted key, and compress that BIN
                 * separately.
                 */
                BIN splitBin = isDup ?
                    searchForBIN(db, mainKey, key.getKey()) :
                    searchForBIN(db, key.getKey(), null);
                if (splitBin != null) {
                    BINReference splitBinRef = splitBin.createReference();
                    splitBinRef.addDeletedKey(key);
        compressBin(db, splitBin, splitBinRef, tracker);
                }

View Full Code Here

                dupRoot.incrementDuplicateCount
                    (dclLockResult, dupKey, locker, false /*increment*/);
                dupRoot.releaseLatch();
                dupRoot = null;


                locker.addDeleteInfo(dupBin, new Key(lnKey));
            } else {
                locker.addDeleteInfo(bin, new Key(lnKey));
            } 


            trace(Level.FINER, TRACE_DELETE, targetBin,
                  ln, targetIndex, oldLsn, newLsn);
        } finally {

View Full Code Here

       * queue.
       */
      if (targetBin.isEntryPendingDeleted(targetIndex)) {
    EnvironmentImpl envImpl = database.getDbEnvironment();
    envImpl.addToCompressorQueue
        (targetBin, new Key(targetBin.getKey(targetIndex)), false);
      }


            /* If fetchTarget returns null, a deleted LN was cleaned. */
      try {
    n = targetBin.fetchTarget(targetIndex);

View Full Code Here

                         * therefore no valid delete key. Don't compress.
                         */
                        if (deletedKey != null) {
                            db.getDbEnvironment().addToCompressorQueue
                                (location.bin, 
                                 new Key(deletedKey),
                                 false); // don't wakeup compressor
                        }
                    }


                } else {

View Full Code Here

                            byte[] deletedKey =
                                location.bin.containsDuplicates() ?
                                dupKey : mainKey;
          db.getDbEnvironment().addToCompressorQueue
        (location.bin,
                                 new Key(deletedKey),
                                 false); // don't wakeup compressor
                            
      } else {


          /*

View Full Code Here

0 1

TOP

Related Classes of com.sleepycat.je.tree.Key

com.sleepycat.je.DatabaseEntry

com.sleepycat.je.dbi.CursorImpl

com.sleepycat.je.incomp.INCompressor

com.sleepycat.je.recovery.RecoveryManager

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.