| /rocksdb-6.9/memory/ |
| D | arena_test.cc | 33 const int N = 17; in MemoryAllocatedBytesTest() local
43 for (int i = 0; i < N; i++) { in MemoryAllocatedBytesTest()
46 expected_memory_allocated = req_sz * N + Arena::kInlineSize; in MemoryAllocatedBytesTest()
57 for (int i = 0; i < N; i++) { in MemoryAllocatedBytesTest()
76 for (int i = 0; i < N; i++) { in MemoryAllocatedBytesTest()
79 expected_memory_allocated += req_sz * N; in MemoryAllocatedBytesTest()
140 const int N = 100000; in SimpleTest() local
143 for (int i = 0; i < N; i++) { in SimpleTest()
145 if (i % (N / 10) == 0) { in SimpleTest()
170 if (i > N / 10) { in SimpleTest()
|
| /rocksdb-6.9/memtable/ |
| D | inlineskiplist_test.cc | 127 const int N = 2000; in TEST_F() local
134 for (int i = 0; i < N; i++) { in TEST_F()
216 const int N = 100000; in TEST_F() local
221 for (int i = 0; i < N; i++) { in TEST_F()
229 const int N = 100000; in TEST_F() local
241 for (int i = 0; i < N; i++) { in TEST_F()
250 const int N = 100000; in TEST_F() local
260 for (int i = 0; i < N; i++) { in TEST_F()
269 const int N = 100000; in TEST_F() local
592 const int N = 1000; in RunConcurrentRead() local
[all …]
|
| D | skiplist_test.cc | 55 const int N = 2000; in TEST_F() local
62 for (int i = 0; i < N; i++) { in TEST_F()
359 const int N = 1000; in RunConcurrent() local
361 for (int i = 0; i < N; i++) { in RunConcurrent()
363 fprintf(stderr, "Run %d of %d\n", i, N); in RunConcurrent()
|
| /rocksdb-6.9/java/src/main/java/org/rocksdb/ |
| D | AbstractMutableOptions.java | 191 protected <N extends Enum<N>> U setEnum( in setEnum()
192 final K key, final N value) { in setEnum()
202 protected <N extends Enum<N>> N getEnum(final K key) in getEnum()
213 return ((MutableOptionValue.MutableOptionEnumValue<N>) value).asObject(); in getEnum()
|
| D | MutableOptionValue.java | 53 static <N extends Enum<N>> MutableOptionValue<N> fromEnum(final N value) { in fromEnum()
|
| /rocksdb-6.9/tools/ |
| D | pflag | 24 N=
68 No. of times run : ${N}
113 : ${N:=999999}
153 N=$OPTARG;
172 verbose "Trying ${N} times, Waiting ${WAIT} seconds each iteration";
|
| D | sst_dump_test.cc | 120 template <std::size_t N>
122 char* (&usage)[N]) const { in PopulateCommandArgs()
123 for (int i = 0; i < static_cast<int>(N); ++i) { in PopulateCommandArgs()
|
| /rocksdb-6.9/db/ |
| D | db_bloom_filter_test.cc | 456 const int N = 10000; in TEST_P() local
457 for (int i = 0; i < N; i++) { in TEST_P()
461 for (int i = 0; i < N; i += 100) { in TEST_P()
471 for (int i = 0; i < N; i++) { in TEST_P()
475 fprintf(stderr, "%d present => %d reads\n", N, reads); in TEST_P()
476 ASSERT_GE(reads, N); in TEST_P()
480 ASSERT_LE(reads, 4 * N + 2 * N / 100); in TEST_P()
482 ASSERT_LE(reads, N + 2 * N / 100); in TEST_P()
487 for (int i = 0; i < N; i++) { in TEST_P()
495 ASSERT_LE(reads, 2 * N + 3 * N / 100); in TEST_P()
[all …]
|
| D | db_test.cc | 1370 const int N = 128; in TEST_F() local
1372 for (int i = 0; i < N; i++) { in TEST_F()
1396 for (int i = 0; i < N; i++) { in TEST_F()
1418 int keys[N * 3]; in TEST_F()
1481 end = Key(1000 + N - 2); in TEST_F()
1500 const int N = 64000; in TEST_F() local
1511 for (int i = N; i < (N + N / 4); i++) { in TEST_F()
1550 const int N = 128; in TEST_F() local
1564 ASSERT_LE(count, N); in TEST_F()
1611 const int N = 80; in TEST_F() local
[all …]
|
| D | log_test.cc | 365 const int N = 500; in TEST_P() local
367 for (int i = 0; i < N; i++) { in TEST_P()
371 for (int i = 0; i < N; i++) { in TEST_P()
|
| D | db_compaction_test.cc | 892 const int N = 500; in TEST_F() local
895 for (int i = 0; i < N; i++) { in TEST_F()
901 for (int i = 0; i < N; i++) { in TEST_F()
907 for (int i = 0; i < N; i++) { in TEST_F()
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2014-04-21-indexing-sst-files-for-better-lookup-performance.markdown | 16 …ially contain the target key. This reduces complexity from O(N) to O(log(N)). However, log(N) can …
|
| D | 2017-09-28-rocksdb-5-8-released.markdown | 16 …rs can enable this feature via `Env::SetBackgroundThreads(N, Env::Priority::BOTTOM)`, where `N > 0…
|
| D | 2014-03-27-how-to-backup-rocksdb.markdown | 75 …d backups, just call `PurgeOldBackups(N)`, where N is how many backups you'd like to keep. All bac…
|
| D | 2016-01-29-compaction_pri.markdown | 20 …xt level, because the range covers N times of files in that level so one hole only impacts write a…
|
| /rocksdb-6.9/ |
| D | CMakeLists.txt | 18 # 4. Then build the project in debug mode (you may want to add /m[:<N>] flag to run msbuild in <N> …
25 # 5. And release mode (/m[:<N>] is also supported)
|
| D | HISTORY.md | 71 … performed during compaction: any valid blobs located in the oldest N files (where N is the number…
588 …rs can enable this feature via `Env::SetBackgroundThreads(N, Env::Priority::BOTTOM)`, where `N > 0…
859 …et column family, or the aggregated table properties of the specified level N if the "at-level" ve…
872 …file as need-compaction when it observes at least D deletion entries in any N consecutive entries …
1154 * Implemented autovector, which allocates first N elements on stack. Most of vectors in RocksDB are…
|
| /rocksdb-6.9/third-party/gtest-1.8.1/fused-src/gtest/ |
| D | gtest.h | 8725 template <typename T, size_t N>
8734 template <typename T, size_t N>
8735 struct RemoveConst<T[N]> {
8944 inline bool ArrayEq(const T(&lhs)[N], const U(&rhs)[N]) {
8984 inline void CopyArray(const T(&from)[N], U(*to)[N]) {
11157 template <typename T, size_t N>
11158 class UniversalPrinter<T[N]> {
11205 template <typename T, size_t N>
11331 template <size_t N>
11338 if (N > 1) {
[all …]
|