Home
last modified time | relevance | path

Searched refs:upper_bound (Results 1 – 25 of 544) sorted by relevance

12345678910>>...22

/rocksdb-6.9/db/
Drange_tombstone_fragmenter_test.cc123 ASSERT_EQ(kMaxSequenceNumber, iter.upper_bound()); in TEST_F()
137 ASSERT_EQ(kMaxSequenceNumber, iter.upper_bound()); in TEST_F()
266 ASSERT_EQ(9, iter2.upper_bound()); in TEST_F()
276 ASSERT_EQ(7, iter3.upper_bound()); in TEST_F()
286 ASSERT_EQ(5, iter4.upper_bound()); in TEST_F()
292 ASSERT_EQ(3, iter5.upper_bound()); in TEST_F()
310 ASSERT_EQ(9, iter.upper_bound()); in TEST_F()
410 ASSERT_EQ(3, split_iter1->upper_bound()); in TEST_F()
415 ASSERT_EQ(5, split_iter2->upper_bound()); in TEST_F()
420 ASSERT_EQ(7, split_iter3->upper_bound()); in TEST_F()
[all …]
Drange_del_aggregator.cc343 assert(input_iter->upper_bound() == kMaxSequenceNumber); in AddTombstones()
352 SequenceNumber upper_bound = split_iter.second->upper_bound(); in AddTombstones() local
355 split_iter.first, StripeRep(icmp_, upper_bound, lower_bound)); in AddTombstones()
378 const Slice* upper_bound, bool upper_bound_inclusive, in TruncatedRangeDelMergingIter() argument
382 upper_bound_(upper_bound), in TruncatedRangeDelMergingIter()
388 assert(child->upper_bound() == kMaxSequenceNumber); in TruncatedRangeDelMergingIter()
466 const Slice* upper_bound, in NewIterator() argument
470 new TruncatedRangeDelMergingIter(icmp_, lower_bound, upper_bound, in NewIterator()
Drange_del_aggregator.h78 SequenceNumber upper_bound() const { return iter_->upper_bound(); } in upper_bound() function
305 StripeRep(const InternalKeyComparator* icmp, SequenceNumber upper_bound, in StripeRep() argument
310 upper_bound_(upper_bound), in StripeRep()
357 SequenceNumber upper_bound) in ReadRangeDelAggregator() argument
359 rep_(icmp, upper_bound, 0 /* lower_bound */) {} in ReadRangeDelAggregator()
431 const Slice* lower_bound = nullptr, const Slice* upper_bound = nullptr,
Ddb_bloom_filter_test.cc1538 Slice upper_bound("abce"); in TEST_F() local
1541 read_options.iterate_upper_bound = &upper_bound; in TEST_F()
1546 Slice upper_bound("abcdzzzz"); in TEST_F() local
1560 Slice upper_bound("abce"); in TEST_F() local
1574 Slice upper_bound("abcey"); in TEST_F() local
1587 Slice upper_bound("abcdy"); in TEST_F() local
1602 Slice upper_bound("abce"); in TEST_F() local
1617 Slice upper_bound("abd"); in TEST_F() local
1630 Slice upper_bound("abd"); in TEST_F() local
1660 Slice upper_bound("foz90000"); in TEST_F() local
[all …]
Ddb_tailing_iter_test.cc392 const Slice upper_bound("20", 3); in TEST_F() local
395 read_options.iterate_upper_bound = &upper_bound; in TEST_F()
485 const Slice upper_bound("cc", 3); in TEST_F() local
486 read_options.iterate_upper_bound = &upper_bound; in TEST_F()
507 const Slice upper_bound("cc", 3); in TEST_F() local
508 read_options.iterate_upper_bound = &upper_bound; in TEST_F()
Drange_tombstone_fragmenter.h100 const InternalKeyComparator& icmp, SequenceNumber upper_bound,
104 const InternalKeyComparator& icmp, SequenceNumber upper_bound,
180 SequenceNumber upper_bound() const { return upper_bound_; } in upper_bound() function
Dforward_iterator_bench.cc84 Key upper_bound; member
124 state.upper_bound = Key(shard, std::numeric_limits<uint64_t>::max()); in readOnceFromShard()
126 (const char*)&state.upper_bound, sizeof(state.upper_bound)); in readOnceFromShard()
Drange_tombstone_fragmenter.cc302 pos_ = std::upper_bound(tombstones_->begin(), tombstones_->end(), target, in SeekToCoveringTombstone()
320 pos_ = std::upper_bound(tombstones_->begin(), tombstones_->end(), target, in SeekForPrevToCoveringTombstone()
Ddb_iterator_test.cc948 Slice upper_bound("g"); in TEST_P() local
949 ro.iterate_upper_bound = &upper_bound; in TEST_P()
1410 ASSERT_EQ(true_data.upper_bound(k), true_data.begin()); in PinnedDataIteratorRandomized()
1418 true_keys.push_back((--true_data.upper_bound(k))->first); in PinnedDataIteratorRandomized()
2355 std::string upper_bound = "x"; in TEST_P() local
2356 Slice ub_slice(upper_bound); in TEST_P()
2462 std::string upper_bound = "x"; in TEST_P() local
2463 Slice ub_slice(upper_bound); in TEST_P()
Dprefix_test.cc831 Slice upper_bound = TestKeyToSlice(s, upper_bound_key); in TEST_F() local
838 read_options.iterate_upper_bound = &upper_bound; in TEST_F()
858 read_options.iterate_upper_bound = &upper_bound; in TEST_F()
Dexternal_sst_file_basic_test.cc73 start_key_it = true_data->upper_bound(start_key); in GenerateAndAddExternalFile()
77 end_key_it = true_data->upper_bound(end_key); in GenerateAndAddExternalFile()
Dcomparator_db_test.cc43 iter_ = map_->upper_bound(k.ToString()); in SeekForPrev()
/rocksdb-6.9/db/compaction/
Dcompaction_job.cc1141 const Slice *lower_bound, *upper_bound; in FinishCompactionOutputFile() local
1168 upper_bound = sub_compact->end; in FinishCompactionOutputFile()
1170 upper_bound = &upper_bound_guard; in FinishCompactionOutputFile()
1175 upper_bound = sub_compact->end; in FinishCompactionOutputFile()
1182 if (upper_bound != nullptr && meta->largest.size() > 0) { in FinishCompactionOutputFile()
1194 upper_bound == nullptr || in FinishCompactionOutputFile()
1195 ucmp->Compare(*upper_bound , *sub_compact->end) <= 0); in FinishCompactionOutputFile()
1196 auto it = range_del_agg->NewIterator(lower_bound, upper_bound, in FinishCompactionOutputFile()
1208 if (upper_bound != nullptr) { in FinishCompactionOutputFile()
1209 int cmp = ucmp->Compare(*upper_bound, tombstone.start_key_); in FinishCompactionOutputFile()
[all …]
/rocksdb-6.9/table/plain/
Dplain_table_index.h100 uint32_t* upper_bound) const { in GetSubIndexBasePtrAndUpperBound() argument
102 return GetVarint32Ptr(index_ptr, index_ptr + 4, upper_bound); in GetSubIndexBasePtrAndUpperBound()
Dplain_table_reader.cc449 uint32_t upper_bound; in GetOffset() local
451 index_.GetSubIndexBasePtrAndUpperBound(prefix_index_offset, &upper_bound); in GetOffset()
453 uint32_t high = upper_bound; in GetOffset()
498 } else if (low + 1 < upper_bound) { in GetOffset()
/rocksdb-6.9/db_stress_tool/
Dcf_consistency_stress.cc247 std::string upper_bound; in TestPrefixScan() local
252 if (GetNextPrefix(prefix, &upper_bound) && thread->rand.OneIn(2)) { in TestPrefixScan()
253 ub_slice = Slice(upper_bound); in TestPrefixScan()
266 count <= GetPrefixKeyCount(prefix.ToString(), upper_bound)); in TestPrefixScan()
Dno_batched_ops_stress.cc271 std::string upper_bound; in TestPrefixScan() local
276 if (GetNextPrefix(prefix, &upper_bound) && thread->rand.OneIn(2)) { in TestPrefixScan()
278 ub_slice = Slice(upper_bound); in TestPrefixScan()
289 assert(count <= GetPrefixKeyCount(prefix.ToString(), upper_bound)); in TestPrefixScan()
Ddb_stress_test_base.cc837 Slice upper_bound; in TestIterate() local
842 upper_bound = Slice(upper_bound_str); in TestIterate()
845 readoptionscopy.iterate_upper_bound = &upper_bound; in TestIterate()
893 upper_bound = Slice(upper_bound_str); in TestIterate()
910 op_logs += "ub: " + upper_bound.ToString(true) + " "; in TestIterate()
/rocksdb-6.9/tools/block_cache_analyzer/
Dblock_cache_trace_analyzer.cc833 .upper_bound(percent_referenced_for_existing_keys) in WriteGetSpatialLocality()
836 .upper_bound(percent_accesses_for_existing_keys) in WriteGetSpatialLocality()
839 .upper_bound(percent_referenced_data_size) in WriteGetSpatialLocality()
971 .upper_bound(reuse_distance.first) in WriteReuseDistance()
1023 (*label_time_num_reuses)[label].upper_bound(0)->second += prev_num - 1; in UpdateReuseIntervalStats()
1030 (*label_time_num_reuses)[label].upper_bound(reuse_interval)->second += 1; in UpdateReuseIntervalStats()
1032 (*label_time_num_reuses)[label].upper_bound(0)->second += num - 1; in UpdateReuseIntervalStats()
1124 label_avg_reuse_naccesses[label].upper_bound(avg_reuse_interval)->second += in WriteReuseInterval()
1166 label_lifetime_nblocks[label].upper_bound(lifetime)->second += 1; in WriteReuseLifetime()
1423 bt_access_nblocks[type_str].upper_bound(naccesses)->second += 1; in WriteAccessCountSummaryStats()
[all …]
/rocksdb-6.9/table/
Dmock_table.h97 itr_ = table_.upper_bound(str_target); in SeekForPrev()
/rocksdb-6.9/memtable/
Dskiplist_test.cc125 std::set<Key>::iterator model_iter = keys.upper_bound(i); in TEST_F()
Dinlineskiplist_test.cc201 std::set<Key>::iterator model_iter = keys.upper_bound(i); in TEST_F()
/rocksdb-6.9/CMakeFiles/rocksdb-shared.dir/util/
Dcompaction_job_stats_impl.cc.o.d156 /usr/include/c++/v1/__algorithm/upper_bound.h \
/rocksdb-6.9/CMakeFiles/rocksdb.dir/util/
Dcompaction_job_stats_impl.cc.o.d156 /usr/include/c++/v1/__algorithm/upper_bound.h \
/rocksdb-6.9/CMakeFiles/rocksdb-shared.dir/db/blob/
Dblob_file_meta.cc.o.d160 /usr/include/c++/v1/__algorithm/upper_bound.h \

12345678910>>...22