| /rocksdb-6.9/java/src/main/java/org/rocksdb/ |
| D | AbstractMutableOptions.java | 59 K extends MutableOptionKey> {
97 final K key, final double value) { in setDouble()
106 protected double getDouble(final K key) in getDouble()
116 final K key, final long value) { in setLong()
125 protected long getLong(final K key) in getLong()
135 final K key, final int value) { in setInt()
144 protected int getInt(final K key) in getInt()
154 final K key, final boolean value) { in setBoolean()
173 final K key, final int[] value) { in setIntArray()
192 final K key, final N value) { in setEnum()
[all …]
|
| /rocksdb-6.9/util/ |
| D | hash_map.h | 26 template <typename K, typename V, size_t size = 128>
28 std::array<autovector<std::pair<K, V>, 1>, size> table_;
31 bool Contains(K key) { in Contains()
35 [key](const std::pair<K, V>& p) { return p.first == key; }); in Contains()
39 void Insert(K key, const V& value) { in Insert()
44 void Delete(K key) { in Delete()
48 [key](const std::pair<K, V>& p) { return p.first == key; }); in Delete()
58 V& Get(K key) { in Get()
62 [key](const std::pair<K, V>& p) { return p.first == key; }); in Get()
|
| /rocksdb-6.9/memtable/ |
| D | skiplist_test.cc | 165 static const uint32_t K = 4; member in ROCKSDB_NAMESPACE::ConcurrentTest
178 assert(k <= K); // We sometimes pass K to seek to the end of the skiplist in MakeKey()
194 return MakeKey(K, 0); in RandomTarget()
197 return MakeKey(rnd->Next() % K, 0); in RandomTarget()
203 std::atomic<int> generation[K];
210 for (unsigned int k = 0; k < K; k++) { in State()
230 const uint32_t k = rnd->Next() % K; in WriteStep()
240 for (unsigned int k = 0; k < K; k++) { in ReadStep()
250 current = MakeKey(K, 0); in ReadStep()
260 ASSERT_LT(key(pos), K) << pos; in ReadStep()
[all …]
|
| D | inlineskiplist_test.cc | 339 static const uint32_t K = 8; member in ROCKSDB_NAMESPACE::ConcurrentTest
369 return MakeKey(K, 0); in RandomTarget()
372 return MakeKey(rnd->Next() % K, 0); in RandomTarget()
378 std::atomic<int> generation[K];
385 for (unsigned int k = 0; k < K; k++) { in State()
405 const uint32_t k = rnd->Next() % K; in WriteStep()
434 for (unsigned int k = 0; k < K; k++) { in ReadStep()
444 current = MakeKey(K, 0); in ReadStep()
454 ASSERT_LT(key(pos), K) << pos; in ReadStep()
489 const uint32_t ConcurrentTest::K; member in ROCKSDB_NAMESPACE::ConcurrentTest
[all …]
|
| /rocksdb-6.9/java/src/test/java/org/rocksdb/util/ |
| D | BytewiseComparatorTest.java | 390 private static class KVIter<K, V> implements RocksIteratorInterface {
392 private final List<Map.Entry<K, V>> entries;
393 private final java.util.Comparator<? super K> comparator;
399 public KVIter(final TreeMap<K, V> map) {
426 (K)new String(target, UTF_8)) >= 0) {
437 (K)new String(target, UTF_8)) <= 0) {
484 public K key() {
487 return (K)"";
493 return (K)"";
|
| /rocksdb-6.9/ |
| D | WINDOWS_PORT.md | 179 80K writes/sec
189 *10K writes/sec*
206 80K writes/sec
217 10K writes/sec
|
| D | HISTORY.md | 451 …ler of block size or page size boundary, to reduce flash reads by avoiding reads spanning 4K pages.
|
| /rocksdb-6.9/tools/ |
| D | benchmark_leveldb.sh | 16 K=1024
|
| D | run_leveldb.sh | 48 K=1024
|
| D | regression_test.sh | 154 K=1024
|
| D | benchmark.sh | 21 K=1024
|
| D | run_flash_bench.sh | 65 K=1024
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2015-11-16-analysis-file-read-latency-by-level.markdown | 166 > In this example, you can see we only issued 696 reads from level 0 while issued 256K reads from l…
168 Isn’t it 2.5 M of reads instead of 256K ? .
|
| D | 2017-05-14-core-local-stats.markdown | 64 To measure statistics query latency, we ran sysbench with 4K OLTP clients concurrently with one cli…
|
| /rocksdb-6.9/java/rocksjni/ |
| D | portal.h | 2434 template <typename K, typename V, typename JK, typename JV>
2435 using FnMapKV = std::function<std::unique_ptr<std::pair<JK, JV>> (const std::pair<K, V>&)>;
2442 template<class iterator_type, typename K, typename V>
2443 …jobject jhash_map, iterator_type iterator, iterator_type end, const FnMapKV<K, V, jobject, jobject… in putAll() argument
|