Home
last modified time | relevance | path

Searched refs:Compare (Results 1 – 25 of 82) sorted by relevance

1234

/rocksdb-6.9/db/
Drange_del_aggregator.cc75 icmp_->Compare(*smallest_, iter_->parsed_end_key()) < 0) && in Valid()
77 icmp_->Compare(iter_->parsed_start_key(), *largest_) < 0); in Valid()
95 icmp_->user_comparator()->Compare(target, smallest_->user_key) < 0) { in Seek()
105 icmp_->Compare(ParsedInternalKey(target, 0, kTypeRangeDeletion), in SeekForPrev()
111 icmp_->user_comparator()->Compare(largest_->user_key, target) < 0) { in SeekForPrev()
167 icmp_->Compare((*active_iters_.top())->end_key(), parsed) <= 0) { in ShouldDelete()
178 icmp_->Compare(inactive_iters_.top()->start_key(), parsed) <= 0) { in ShouldDelete()
221 icmp_->Compare(parsed, inactive_iters_.top()->end_key()) < 0) { in ShouldDelete()
294 if (icmp_->Compare(start_ikey, iter->end_key()) < 0 && in IsRangeOverlapped()
295 icmp_->Compare(iter->start_key(), end_ikey) <= 0) { in IsRangeOverlapped()
[all …]
Ddbformat.cc116 int InternalKeyComparator::Compare(const ParsedInternalKey& a, in Compare() function in ROCKSDB_NAMESPACE::InternalKeyComparator
122 int r = user_comparator_.Compare(a.user_key, b.user_key); in Compare()
145 user_comparator_.Compare(user_start, tmp) < 0) { in FindShortestSeparator()
150 assert(this->Compare(*start, tmp) < 0); in FindShortestSeparator()
151 assert(this->Compare(tmp, limit) < 0); in FindShortestSeparator()
161 user_comparator_.Compare(user_key, tmp) < 0) { in FindShortSuccessor()
166 assert(this->Compare(*key, tmp) < 0); in FindShortSuccessor()
Drange_del_aggregator.h61 icmp_->Compare(*smallest_, iter_->parsed_start_key()) <= 0) in start_key()
68 icmp_->Compare(iter_->parsed_end_key(), *largest_) <= 0) in end_key()
105 return icmp->Compare(a->start_key(), b->start_key()) > 0; in operator()
137 return icmp->Compare((*a)->end_key(), (*b)->end_key()) > 0; in operator()
150 int cmp = icmp_->Compare(parsed, iter->start_key()); in PushIter()
214 return icmp->Compare(a->end_key(), b->end_key()) < 0; in operator()
224 return icmp->Compare((*a)->start_key(), (*b)->start_key()) < 0; in operator()
235 } else if (icmp_->Compare(iter->end_key(), parsed) <= 0) { in PushIter()
Drange_tombstone_fragmenter.h191 return cmp->Compare(a.start_key, b.start_key) < 0; in operator()
195 return cmp->Compare(a.start_key, b) < 0; in operator()
199 return cmp->Compare(a, b.start_key) < 0; in operator()
210 return cmp->Compare(a.end_key, b.end_key) < 0; in operator()
214 return cmp->Compare(a.end_key, b) < 0; in operator()
218 return cmp->Compare(a, b.end_key) < 0; in operator()
Ddbformat.h209 virtual int Compare(const Slice& a, const Slice& b) const override;
220 int Compare(const InternalKey& a, const InternalKey& b) const;
221 int Compare(const ParsedInternalKey& a, const ParsedInternalKey& b) const;
290 inline int InternalKeyComparator::Compare(const InternalKey& a, in Compare() function
292 return Compare(a.Encode(), b.Encode()); in Compare()
640 inline int InternalKeyComparator::Compare(const Slice& akey, in Compare() function
646 int r = user_comparator_.Compare(ExtractUserKey(akey), ExtractUserKey(bkey)); in Compare()
664 int r = user_comparator_.Compare(ExtractUserKey(akey), ExtractUserKey(bkey)); in CompareKeySeq()
685 return cmp->Compare(a, b) < 0; in operator()
Drange_del_aggregator_test.cc89 EXPECT_EQ(0, icmp.Compare(iter->start_key(), expected_range_dels[i].start)); in VerifyIterator()
90 EXPECT_EQ(0, icmp.Compare(iter->end_key(), expected_range_dels[i].end)); in VerifyIterator()
102 EXPECT_EQ(0, icmp.Compare(iter->start_key(), in VerifyIterator()
105 0, icmp.Compare(iter->end_key(), reverse_expected_range_dels[i].end)); in VerifyIterator()
120 EXPECT_EQ(0, icmp.Compare(iter->start_key(), test_case.start)); in VerifySeek()
121 EXPECT_EQ(0, icmp.Compare(iter->end_key(), test_case.end)); in VerifySeek()
136 EXPECT_EQ(0, icmp.Compare(iter->start_key(), test_case.start)); in VerifySeekForPrev()
137 EXPECT_EQ(0, icmp.Compare(iter->end_key(), test_case.end)); in VerifySeekForPrev()
Drange_tombstone_fragmenter.cc35 icmp.Compare(last_start_key, unfragmented_tombstones->key()) > 0) { in FragmentedRangeTombstoneList()
90 if (icmp.user_comparator()->Compare(cur_start_key, cur_end_key) == 0) { in FragmentTombstones()
94 if (icmp.user_comparator()->Compare(next_start_key, cur_end_key) <= 0) { in FragmentTombstones()
112 icmp.user_comparator()->Compare(tombstones_.back().end_key, in FragmentTombstones()
190 if (!cur_end_keys.empty() && icmp.user_comparator()->Compare( in FragmentTombstones()
412 return ValidPos() && ucmp_->Compare(start_key(), target_user_key) <= 0 ? seq() in MaxCoveringTombstoneSeqnum()
Dforward_iterator.cc334 cfd_->internal_comparator().user_comparator()->Compare( in IsOverUpperBound()
370 cfd_->internal_comparator().InternalKeyComparator::Compare( in SeekInternal()
407 if (user_comparator_->Compare(target_user_key, in SeekInternal()
642 cfd_->internal_comparator().user_comparator()->Compare( in RebuildIterators()
768 (user_comparator_->Compare(*read_options_.iterate_upper_bound, in BuildLevelIterators()
825 int cmp = cfd_->internal_comparator().InternalKeyComparator::Compare( in UpdateCurrent()
863 if (cfd_->internal_comparator().InternalKeyComparator::Compare( in NeedToSeekImmutable()
872 if (cfd_->internal_comparator().InternalKeyComparator::Compare( in NeedToSeekImmutable()
949 return cfd_->internal_comparator().InternalKeyComparator::Compare( in FindFileInRange()
/rocksdb-6.9/db/compaction/
Dcompaction_picker.cc182 if (icmp_->Compare(f->smallest, *smallest) < 0) { in GetRange()
185 if (icmp_->Compare(f->largest, *largest) > 0) { in GetRange()
231 if (icmp_->Compare(current_smallest, *smallest) < 0) { in GetRange()
234 if (icmp_->Compare(current_largest, *largest) > 0) { in GetRange()
811 if (c->Compare(a.smallestkey, b.smallestkey) >= 0) { in HaveOverlappingKeyRanges()
812 if (c->Compare(a.smallestkey, b.largestkey) <= 0) { in HaveOverlappingKeyRanges()
816 } else if (c->Compare(a.largestkey, b.smallestkey) >= 0) { in HaveOverlappingKeyRanges()
820 if (c->Compare(a.largestkey, b.largestkey) <= 0) { in HaveOverlappingKeyRanges()
821 if (c->Compare(a.largestkey, b.smallestkey) >= 0) { in HaveOverlappingKeyRanges()
925 if (comparator->Compare(smallestkey, in SanitizeCompactionInputFilesForAllLevels()
[all …]
Dcompaction.cc26 auto c = user_cmp->Compare(a.user_key(), b.user_key()); in sstableKeyCompare()
90 ucmp->Compare(start_user_key, *smallest_user_key) < 0) { in GetBoundaryKeys()
95 ucmp->Compare(end_user_key, *largest_user_key) > 0) { in GetBoundaryKeys()
104 ucmp->Compare(start_user_key, *smallest_user_key) < 0) { in GetBoundaryKeys()
108 if (!initialized || ucmp->Compare(end_user_key, *largest_user_key) > 0) { in GetBoundaryKeys()
372 if (user_cmp->Compare(user_key, f->largest.user_key()) <= 0) { in KeyNotExistsBeyondOutputLevel()
374 if (user_cmp->Compare(user_key, f->smallest.user_key()) >= 0) { in KeyNotExistsBeyondOutputLevel()
Dcompaction_job.cc210 icmp->Compare(internal_key, in ShouldStopBefore()
217 icmp->Compare( in ShouldStopBefore()
485 return cfd_comparator->Compare(ExtractUserKey(a), in GenSubcompactionBoundaries()
492 return cfd_comparator->Compare(ExtractUserKey(a), in GenSubcompactionBoundaries()
920 cfd->user_comparator()->Compare(c_iter->user_key(), *end) >= 0) { in ProcessKeyValueCompaction()
1167 ucmp->Compare(upper_bound_guard, *sub_compact->end) >= 0) { in FinishCompactionOutputFile()
1184 ucmp->Compare(meta->largest.user_key(), *upper_bound) == 0; in FinishCompactionOutputFile()
1195 ucmp->Compare(*upper_bound , *sub_compact->end) <= 0); in FinishCompactionOutputFile()
1209 int cmp = ucmp->Compare(*upper_bound, tombstone.start_key_); in FinishCompactionOutputFile()
1232 ucmp->Compare(*lower_bound, kv.second) < 0); in FinishCompactionOutputFile()
[all …]
/rocksdb-6.9/table/block_based/
Dblock_based_table_iterator.cc38 if (user_comparator_.Compare(ExtractUserKey(*target), in SeekImpl()
40 user_comparator_.Compare(ExtractUserKey(*target), in SeekImpl()
66 (!target || icomp_.Compare(*target, v.first_internal_key) <= 0) && in SeekImpl()
99 assert(!Valid() || icomp_.Compare(*target, key()) <= 0); in SeekImpl()
160 icomp_.Compare(target, block_iter_.key()) >= 0); in SeekForPrev()
261 icomp_.Compare(block_iter_.key(), in MaterializeCurrentBlock()
Dblock.cc255 while (ParseNextDataKey<DecodeEntry>() && Compare(key_, seek_key) < 0) { in Seek()
333 if (!ParseNextDataKey<DecodeEntry>(limit) || Compare(key_, target) >= 0) { in SeekForGetImpl()
358 if (user_comparator_->Compare(key_.GetUserKey(), target_user_key) != 0) { in SeekForGetImpl()
414 while (ParseNextIndexKey() && Compare(key_, seek_key) < 0) { in Seek()
434 while (ParseNextDataKey<DecodeEntry>() && Compare(key_, seek_key) < 0) { in SeekForPrev()
439 while (Valid() && Compare(key_, seek_key) > 0) { in SeekForPrev()
682 int cmp = comp->Compare(mid_key, target); in BinarySeek()
716 return Compare(block_key, target); in CompareBlockKey()
Dblock.h475 inline int Compare(const IterKey& ikey, const Slice& b) const { in Compare() function
476 return comparator_->Compare(ikey.GetInternalKey(), b); in Compare()
611 inline int Compare(const Slice& a, const Slice& b) const { in Compare() function
612 return comparator_->Compare(a, b); in Compare()
615 inline int Compare(const IterKey& ikey, const Slice& b) const { in Compare() function
616 return comparator_->Compare(ikey.GetKey(), b); in Compare()
Dpartitioned_index_iterator.cc44 ? (icomp_.Compare(*target, key()) <= 0) in SeekImpl()
45 : (user_comparator_.Compare(ExtractUserKey(*target), in SeekImpl()
/rocksdb-6.9/include/rocksdb/
Dcomparator.h48 virtual int Compare(const Slice& a, const Slice& b) const = 0;
56 return Compare(a, b) == 0; in Equal()
121 return Compare(a, b); in CompareWithoutTimestamp()
/rocksdb-6.9/util/
Dvector_iterator.h79 return cmp->Compare((*keys)[a], (*keys)[b]) < 0; in operator()
83 return cmp->Compare((*keys)[a], b) < 0; in operator()
87 return cmp->Compare(a, (*keys)[b]) < 0; in operator()
Dheap.h40 template<typename T, typename Compare = std::less<T>>
44 explicit BinaryHeap(Compare cmp) : cmp_(std::move(cmp)) { } in BinaryHeap()
160 Compare cmp_;
Dcomparator.cc27 int Compare(const Slice& a, const Slice& b) const override { in Compare() function in ROCKSDB_NAMESPACE::__anondf8571150111::BytewiseComparatorImpl
80 assert(Compare(*start, limit) < 0); in FindShortestSeparator()
143 int Compare(const Slice& a, const Slice& b) const override { in Compare() function in ROCKSDB_NAMESPACE::__anondf8571150111::ReverseBytewiseComparatorImpl
Dkv_map.h22 return cmp->Compare(Slice(a), Slice(b)) < 0; in operator()
25 return cmp->Compare(a, b) < 0; in operator()
Duser_comparator_wrapper.h27 int Compare(const Slice& a, const Slice& b) const override { in Compare() function
29 return user_comparator_->Compare(a, b); in Compare()
/rocksdb-6.9/memtable/
Dstl_wrappers.h25 struct Compare : private Base { struct
26 explicit Compare(const MemTableRep::KeyComparator& compare) : Base(compare) {} in Compare() function
/rocksdb-6.9/table/
Diter_heap.h22 return comparator_->Compare(a->key(), b->key()) < 0; in operator()
36 return comparator_->Compare(a->key(), b->key()) > 0; in operator()
Dsst_file_writer.cc70 if (internal_comparator.user_comparator()->Compare( in Add()
119 if (internal_comparator.user_comparator()->Compare( in DeleteRange()
124 if (internal_comparator.user_comparator()->Compare( in DeleteRange()
/rocksdb-6.9/db/db_impl/
Ddb_impl_experimental.cc86 return icmp->Compare(f1->largest, f2->largest) < 0; in PromoteL0()
103 if (icmp->Compare(prev_f->largest, f->smallest) >= 0) { in PromoteL0()

1234