| /rocksdb-6.9/tools/rdb/ |
| D | db_wrapper.cc | 91 for (uint i = 0; i < array->Length(); i++) { in Open()
92 if (!array->Get(i)->IsString()) { in Open()
291 Handle<Array> array) { in AddToBatch() argument
293 for (uint i = 0; i < array->Length(); i++) { in AddToBatch()
295 if (!array->Get(i)->IsString()) { in AddToBatch()
303 if (!array->Get(i)->IsArray()) { in AddToBatch()
307 put_pair = Handle<Array>::Cast(array->Get(i)); in AddToBatch()
325 for (uint i = 0; i < array->Length(); i++) { in AddToBatch()
327 if (!array->Get(i)->IsString()) { in AddToBatch()
337 if (!array->Get(i)->IsArray()) { in AddToBatch()
[all …]
|
| D | db_wrapper.h | 30 Handle<Array> array);
32 Handle<Array> array, DBWrapper* db_wrapper,
|
| D | API.md | 89 # Returns true if the argument array was well-formed and was
|
| /rocksdb-6.9/table/block_based/ |
| D | filter_policy.cc | 114 std::array<uint32_t, kBufferMask + 1> hashes; in AddAllEntries()
115 std::array<uint32_t, kBufferMask + 1> byte_offsets; in AddAllEntries()
178 std::array<uint32_t, MultiGetContext::MAX_BATCH_SIZE> hashes; in MayMatch()
179 std::array<uint32_t, MultiGetContext::MAX_BATCH_SIZE> byte_offsets; in MayMatch()
412 std::array<uint32_t, MultiGetContext::MAX_BATCH_SIZE> hashes; in MayMatch()
413 std::array<uint32_t, MultiGetContext::MAX_BATCH_SIZE> byte_offsets; in MayMatch()
507 char* array = &(*dst)[init_size]; in CreateFilter() local
510 array); in CreateFilter()
521 const char* array = bloom_filter.data(); in KeyMayMatch() local
526 const int k = static_cast<uint8_t>(array[len - 1]); in KeyMayMatch()
[all …]
|
| D | full_filter_block.cc | 240 std::array<Slice*, MultiGetContext::MAX_BATCH_SIZE> keys; in MayMatch()
241 std::array<bool, MultiGetContext::MAX_BATCH_SIZE> may_match = {{true}}; in MayMatch()
|
| /rocksdb-6.9/java/src/test/java/org/rocksdb/util/ |
| D | JNIComparatorTest.java | 86 db.put(buf.array(), buf.array()); in storeWithJavaComparator()
106 db.put(buf.array(), buf.array()); in storeWithCppComparator()
|
| D | BytewiseComparatorIntTest.java | 49 final byte[] key = buf.array(); in prepareKeys()
|
| D | ReverseBytewiseComparatorIntTest.java | 50 final byte[] key = buf.array(); in prepareKeys()
|
| D | IntComparatorTest.java | 48 final byte[] key = buf.array(); in prepareKeys()
|
| /rocksdb-6.9/third-party/folly/folly/container/ |
| D | Array.h | 41 array<typename return_type_helper<D, TList...>::type, sizeof...(TList)>;
56 -> std::array<decltype(make(0)), sizeof...(Index)> {
57 return std::array<decltype(make(0)), sizeof...(Index)>{{make(Index)...}};
|
| /rocksdb-6.9/util/ |
| D | dynamic_bloom.h | 125 std::array<uint32_t, MultiGetContext::MAX_BATCH_SIZE> hashes; in MayContain()
126 std::array<size_t, MultiGetContext::MAX_BATCH_SIZE> byte_offsets; in MayContain()
|
| D | hash_map.h | 28 std::array<autovector<std::pair<K, V>, 1>, size> table_;
|
| /rocksdb-6.9/java/rocksjni/ |
| D | comparatorjnicallback.cc | 377 jbyteArray jarray = ByteBufferJni::array(env, j_start_buf, in FindShortestSeparator()
501 jbyteArray jarray = ByteBufferJni::array(env, j_key_buf, in FindShortSuccessor()
605 const jbyteArray jarray = ByteBufferJni::array(env, jreuse_buffer, in ReuseBuffer()
|
| /rocksdb-6.9/third-party/folly/folly/synchronization/ |
| D | ParkingLot.cpp | 19 static Indestructible<std::array<Bucket, kNumBuckets>> gBuckets; in bucketFor()
|
| /rocksdb-6.9/third-party/folly/folly/synchronization/test/ |
| D | DistributedMutexTest.cpp | 1062 std::array<std::uint64_t, 8> makeMonotonicArray(int start) { in makeMonotonicArray()
1063 auto array = std::array<std::uint64_t, 8>{}; in makeMonotonicArray()
1064 for (auto& element : array) { element = start++; } in makeMonotonicArray()
1065 return array; in makeMonotonicArray()
|
| /rocksdb-6.9/third-party/gtest-1.8.1/fused-src/gtest/ |
| D | gtest.h | 2425 #define GTEST_ARRAY_SIZE_(array) (sizeof(array) / sizeof(array[0]))
9023 InitRef(array, count);
9028 InitCopy(array, count);
9067 array_ = array;
12210 return ValuesIn(array);
12230 return ValuesIn(array);
12252 return ValuesIn(array);
12277 return ValuesIn(array);
12303 return ValuesIn(array);
12332 return ValuesIn(array);
[all …]
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2018-08-23-data-block-hash-index.markdown | 41 …beginning of each restart interval, i.e. a restart point, is stored in an array called restart int…
47 …o reduce the CPU overhead of the binary search. The hash index is just an array of pointers pointi…
52 Each array element is considered as a hash bucket when storing the location of a key (or more preci…
|
| D | 2015-07-15-rocksdb-2015-h2-roadmap.markdown | 56 1. Hard drive storage array.
|
| D | 2014-09-12-new-bloom-filter-format.markdown | 19 …(https://github.com/facebook/rocksdb/wiki/RocksDB-Bloom-Filter) is a bits array generated for a se…
|
| /rocksdb-6.9/java/src/test/java/org/rocksdb/ |
| D | WriteBatchThreadedTest.java | 65 wb.put(ByteBuffer.allocate(4).putInt(i).array(), "parallel rocks test".getBytes()); in threadedWrites()
|
| D | MergeTest.java | 51 return buf.array(); in longToByteArray()
|
| /rocksdb-6.9/table/plain/ |
| D | plain_table_key_coding.h | 128 std::array<std::unique_ptr<Buffer>, 2> buffers_;
|
| /rocksdb-6.9/table/ |
| D | multiget_context.h | 125 std::array<KeyContext*, MAX_BATCH_SIZE> sorted_keys_;
|
| /rocksdb-6.9/java/ |
| D | HISTORY-JAVA.md | 81 * Avoid a potential byte-array-copy between c++ and Java in RocksDB.get.
|
| /rocksdb-6.9/db_stress_tool/ |
| D | batched_ops_stress.cc | 178 std::array<std::string, 10> keys = {{"0", "1", "2", "3", "4", in TestMultiGet()
|