Home
last modified time | relevance | path

Searched refs:N_KEY_BYTES (Results 1 – 7 of 7) sorted by relevance

/dports/java/berkeley-db/je-6.2.31/test/com/sleepycat/je/tree/
H A DTreeTest.java74 byte[] key = new byte[N_KEY_BYTES]; in testMultipleInsertRetrieve0()
107 byte[] key = new byte[N_KEY_BYTES]; in doMultipleInsertRetrieve1()
166 byte[] key = new byte[N_KEY_BYTES]; in doCountAndValidateKeys()
201 byte[] key = new byte[N_KEY_BYTES]; in doCountAndValidateKeysBackwards()
365 byte[] key = new byte[N_KEY_BYTES]; in testVerify()
H A DTreeTestBase.java36 static protected int N_KEY_BYTES = 10; field in TreeTestBase
/dports/java/berkeley-db/je-6.2.31/test/com/sleepycat/je/util/
H A DMiniPerf.java105 final int N_KEY_BYTES = 10; in testIterationPerformance() local
114 byte[] key = new byte[N_KEY_BYTES]; in testIterationPerformance()
H A DDbDumpTest.java46 private static final int N_KEY_BYTES = 1000; field in DbDumpTest
258 byte[] key = new byte[N_KEY_BYTES]; in doLargePut()
/dports/java/berkeley-db/je-6.2.31/test/com/sleepycat/je/dbi/
H A DDbCursorTestBase.java66 protected static final int N_KEY_BYTES = 10; field in DbCursorTestBase
502 byte[] key = new byte[N_KEY_BYTES]; in doLargePut()
602 byte[] key = new byte[N_KEY_BYTES]; in createRandomDuplicateData()
615 byte[] data = new byte[N_KEY_BYTES]; in createRandomDuplicateData()
H A DDbCursorTest.java1032 byte[] key = new byte[N_KEY_BYTES]; in doLargeGetPutRandomKeyForwardTraverse()
1106 byte[] key = new byte[N_KEY_BYTES]; in doLargeGetPutRandomKeyBackwardsTraverse()
/dports/java/berkeley-db/je-6.2.31/test/com/sleepycat/je/cleaner/
H A DCleanerTest.java71 private static final int N_KEY_BYTES = 10; field in CleanerTest
683 byte[] key = new byte[N_KEY_BYTES]; in doLargePut()