Searched refs:sorted (Results 1 – 13 of 13) sorted by relevance
| /rocksdb-6.9/table/block_based/ |
| D | block_based_table_factory.cc | 42 std::vector<size_t> sorted; in GetSuggestedPrefetchSize() local
49 sorted.assign(records_, records_ + num_records_); in GetSuggestedPrefetchSize()
54 std::sort(sorted.begin(), sorted.end()); in GetSuggestedPrefetchSize()
144 assert(!sorted.empty()); in GetSuggestedPrefetchSize()
145 size_t prev_size = sorted[0]; in GetSuggestedPrefetchSize()
146 size_t max_qualified_size = sorted[0]; in GetSuggestedPrefetchSize()
148 for (size_t i = 1; i < sorted.size(); i++) { in GetSuggestedPrefetchSize()
149 size_t read = sorted[i] * sorted.size(); in GetSuggestedPrefetchSize()
150 wasted += (sorted[i] - prev_size) * i; in GetSuggestedPrefetchSize()
152 max_qualified_size = sorted[i]; in GetSuggestedPrefetchSize()
[all …]
|
| /rocksdb-6.9/db/ |
| D | prefix_test.cc | 63 uint64_t sorted; member
66 : prefix(_prefix), sorted(_sorted) {} in TestKey()
73 PutFixed64(&s, test_key.sorted); in TestKeyToSlice()
113 if (key_a->sorted < key_b->sorted) return -1; in Compare()
114 if (key_a->sorted > key_b->sorted) return 1; in Compare()
115 if (key_a->sorted == key_b->sorted) return 0; in Compare()
597 for (uint64_t sorted = 0; sorted < FLAGS_items_per_prefix; sorted++) { in TEST_F() local
598 TestKey test_key(prefix, sorted); in TEST_F()
746 << SliceToTestKey(iter->key()).sorted in TEST_F()
776 << SliceToTestKey(iter->key()).sorted in TEST_F()
[all …]
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2014-04-21-indexing-sst-files-for-better-lookup-performance.markdown | 12 On level 0, files are sorted based on the time they are flushed. Their key range (as defined by Fil…
16 …/values and split them into files. From level 1 and below, SST files are sorted based on key. Thei…
|
| D | 2019-03-08-format-version-4.markdown | 8 The data blocks in RocksDB consist of a sequence of key/values pairs sorted by key, where the pairs…
|
| D | 2015-07-23-dynamic-level.markdown | 17 In level-based compaction, we organize data to different sorted runs, called levels. Each level has…
|
| /rocksdb-6.9/buckifier/ |
| D | targets_builder.py | 22 res = separator.join(sorted(lst))
|
| D | buckify_rocksdb.py | 181 for test in sorted(tests):
|
| /rocksdb-6.9/tools/block_cache_analyzer/ |
| D | block_cache_pysim.py | 344 miss_bytes = sorted(miss_bytes)
525 return sorted(
537 return sorted(
549 return sorted(samples, cmp=lambda e1, e2: e1.value.num_hits - e2.value.num_hits)
591 return sorted(samples, cmp=lambda e1, e2: self.compare(e1, e2, now))
646 return sorted(
|
| /rocksdb-6.9/tools/advisor/advisor/ |
| D | db_timeseries_parser.py | 74 timestamps = sorted(list(self.keys_ts[entity][statistic].keys()))
|
| D | db_stats_fetcher.py | 144 timeseries = sorted(
|
| /rocksdb-6.9/tools/ |
| D | check_format_compatible.sh | 47 echo == Generating file with sorted keys ${sorted_input_data}
|
| D | db_crashtest.py | 279 for k, v in [(k, finalzied_params[k]) for k in sorted(finalzied_params)]
|
| /rocksdb-6.9/db/db_impl/ |
| D | db_impl.h | 1700 const size_t num_keys, bool sorted,
|