Home
last modified time | relevance | path

Searched refs:cmp (Results 1 – 25 of 570) sorted by relevance

12345678910>>...23

/rocksdb-6.9/db/
Drange_tombstone_fragmenter.h187 explicit RangeTombstoneStackStartComparator(const Comparator* c) : cmp(c) {} in RangeTombstoneStackStartComparator()
191 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()
202 const Comparator* cmp; member
206 explicit RangeTombstoneStackEndComparator(const Comparator* c) : cmp(c) {} in RangeTombstoneStackEndComparator()
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()
221 const Comparator* cmp; member
Ddb_memtable_test.cc70 MemTableRep* CreateMemTableRep(const MemTableRep::KeyComparator& cmp, in CreateMemTableRep() argument
76 factory.CreateMemTableRep(cmp, allocator, transform, logger); in CreateMemTableRep()
81 MemTableRep* CreateMemTableRep(const MemTableRep::KeyComparator& cmp, in CreateMemTableRep() argument
87 return CreateMemTableRep(cmp, allocator, transform, logger); in CreateMemTableRep()
140 InternalKeyComparator cmp(BytewiseComparator()); in TEST_F() local
145 MemTable* mem = new MemTable(cmp, ioptions, MutableCFOptions(options), &wb, in TEST_F()
185 mem = new MemTable(cmp, ioptions, MutableCFOptions(options), &wb, in TEST_F()
197 mem = new MemTable(cmp, ioptions, MutableCFOptions(options), &wb, in TEST_F()
219 InternalKeyComparator cmp(BytewiseComparator()); in TEST_F() local
225 MemTable* mem = new MemTable(cmp, ioptions, MutableCFOptions(options), &wb, in TEST_F()
Dfile_indexer.cc155 int cmp = cmp_op(upper_files[upper_idx], lower_files[lower_idx]); in CalculateLB() local
157 if (cmp == 0) { in CalculateLB()
160 } else if (cmp > 0) { in CalculateLB()
192 int cmp = cmp_op(upper_files[upper_idx], lower_files[lower_idx]); in CalculateRB() local
194 if (cmp == 0) { in CalculateRB()
197 } else if (cmp < 0) { in CalculateRB()
Dmemtable_list_test.cc229 InternalKeyComparator cmp(BytewiseComparator()); in TEST_F() local
235 MemTable* mem = new MemTable(cmp, ioptions, MutableCFOptions(options), &wb, in TEST_F()
277 MemTable* mem2 = new MemTable(cmp, ioptions, MutableCFOptions(options), &wb2, in TEST_F()
346 InternalKeyComparator cmp(BytewiseComparator()); in TEST_F() local
352 MemTable* mem = new MemTable(cmp, ioptions, MutableCFOptions(options), &wb, in TEST_F()
437 MemTable* mem2 = new MemTable(cmp, ioptions, MutableCFOptions(options), &wb2, in TEST_F()
462 MemTable* mem3 = new MemTable(cmp, ioptions, MutableCFOptions(options), &wb3, in TEST_F()
526 InternalKeyComparator cmp(BytewiseComparator()); in TEST_F() local
544 MemTable* mem = new MemTable(cmp, ioptions, mutable_cf_options, &wb, in TEST_F()
790 InternalKeyComparator cmp(BytewiseComparator()); in TEST_F() local
[all …]
Drange_del_aggregator_bench.cc133 explicit TombstoneStartKeyComparator(const Comparator* c) : cmp(c) {} in TombstoneStartKeyComparator()
136 return cmp->Compare(a.start_key_, b.start_key_) < 0; in operator ()()
139 const Comparator* cmp; member
Dversion_builder.cc50 const InternalKeyComparator* cmp) { in BySmallestKey() argument
51 int r = cmp->Compare(a->smallest, b->smallest); in BySmallestKey()
592 const auto& cmp = (level == 0) ? level_zero_cmp_ : level_nonzero_cmp_; in SaveTo() local
606 std::sort(added_files.begin(), added_files.end(), cmp); in SaveTo()
625 (added_iter != added_end && cmp(*added_iter, *base_iter))) { in SaveTo()
Ddb_iter_stress_test.cc70 InternalKeyComparator cmp; member
86 : data(_data), rnd(_rnd), cmp(_cmp) {} in StressTestIterator()
201 [&](const Entry& e) { return cmp.Compare(e.ikey, target) < 0; }); in Seek()
213 [&](const Entry& e) { return cmp.Compare(e.ikey, target) <= 0; }); in SeekForPrev()
Dforward_iterator.cc825 int cmp = cfd_->internal_comparator().InternalKeyComparator::Compare( in UpdateCurrent() local
827 assert(cmp != 0); in UpdateCurrent()
828 if (cmp > 0) { in UpdateCurrent()
948 auto cmp = [&](const FileMetaData* f, const Slice& key) -> bool { in FindFileInRange() local
954 b + right, internal_key, cmp) - b); in FindFileInRange()
Dcomparator_db_test.cc283 void SetOwnedComparator(const Comparator* cmp, bool owner = true) { in SetOwnedComparator() argument
285 comparator_guard.reset(cmp); in SetOwnedComparator()
289 kTestComparator = cmp; in SetOwnedComparator()
290 last_options_.comparator = cmp; in SetOwnedComparator()
Dcompacted_db_impl.cc29 auto cmp = [&](const FdWithKeyRange& f, const Slice& k) -> bool { in FindFile() local
33 files_.files + right, key, cmp) - files_.files); in FindFile()
/rocksdb-6.9/util/
Dkv_map.h19 : cmp(c) {} in cmp() function
22 return cmp->Compare(Slice(a), Slice(b)) < 0; in operator()
25 return cmp->Compare(a, b) < 0; in operator()
28 const Comparator* cmp; member
Dvector_iterator.h76 : cmp(c), keys(ks) {} in IndexedKeyComparator()
79 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()
90 const InternalKeyComparator* cmp; member
Dduplicate_detector.h64 auto cmp = h->GetComparator(); in InitWithComp() local
65 keys_[cf] = CFKeys(SetComparator(cmp)); in InitWithComp()
Dheap.h44 explicit BinaryHeap(Compare cmp) : cmp_(std::move(cmp)) { } in BinaryHeap() argument
/rocksdb-6.9/memtable/
Dinlineskiplist_test.cc108 TestComparator cmp; in TEST_F() local
109 InlineSkipList<TestComparator> list(cmp, &arena); in TEST_F()
132 TestComparator cmp; in TEST_F() local
218 TestComparator cmp; in TEST_F() local
219 TestInlineSkipList list(cmp, &arena); in TEST_F()
233 TestComparator cmp; in TEST_F() local
234 TestInlineSkipList list(cmp, &arena); in TEST_F()
254 TestComparator cmp; in TEST_F() local
255 TestInlineSkipList list(cmp, &arena); in TEST_F()
274 TestComparator cmp; in TEST_F() local
[all …]
Dskiplist.h52 explicit SkipList(Comparator cmp, Allocator* allocator,
318 int cmp = (next == nullptr || next == last_bigger)
320 if (cmp == 0 || (cmp > 0 && level == 0)) {
322 } else if (cmp < 0) {
408 SkipList<Key, Comparator>::SkipList(const Comparator cmp, Allocator* allocator,
414 compare_(cmp),
Dinlineskiplist.h74 explicit InlineSkipList(Comparator cmp, Allocator* allocator,
481 int cmp = (next == nullptr || next == last_bigger)
484 if (cmp == 0 || (cmp > 0 && level == 0)) {
486 } else if (cmp < 0) {
590 InlineSkipList<Comparator>::InlineSkipList(const Comparator cmp,
598 compare_(cmp),
981 auto cmp = compare_(nodes[0]->Key(), next->Key());
982 assert(cmp <= 0);
983 if (cmp == 0) {
Dskiplist_test.cc38 TestComparator cmp; in TEST_F() local
39 SkipList<Key, TestComparator> list(cmp, &arena); in TEST_F()
60 TestComparator cmp; in TEST_F() local
61 SkipList<Key, TestComparator> list(cmp, &arena); in TEST_F()
/rocksdb-6.9/utilities/write_batch_with_index/
Dwrite_batch_with_index_internal.cc132 int cmp = CompareKey(entry1->column_family, key1, key2); in operator ()() local
133 if (cmp != 0) { in operator ()()
134 return cmp; in operator ()()
157 MergeContext* merge_context, WriteBatchEntryComparator* cmp, in GetFromBatch() argument
173 if (cmp->CompareKey(cf_id, entry.key, key) != 0) { in GetFromBatch()
194 if (cmp->CompareKey(cf_id, entry.key, key) != 0) { in GetFromBatch()
/rocksdb-6.9/table/block_based/
Dblock.cc682 int cmp = comp->Compare(mid_key, target); in BinarySeek() local
683 if (cmp < 0) { in BinarySeek()
687 } else if (cmp > 0) { in BinarySeek()
734 int cmp = CompareBlockKey(block_ids[mid], target); in BinaryBlockIndexSeek() local
738 if (cmp < 0) { in BinaryBlockIndexSeek()
925 DataBlockIter* Block::NewDataIterator(const Comparator* cmp, in NewDataIterator() argument
946 cmp, ucmp, data_, restart_offset_, num_restarts_, global_seqno, in NewDataIterator()
961 const Comparator* cmp, const Comparator* ucmp, SequenceNumber global_seqno, in NewIndexIterator() argument
982 ret_iter->Initialize(cmp, ucmp, data_, restart_offset_, num_restarts_, in NewIndexIterator()
/rocksdb-6.9/table/
Dinternal_iterator.h154 void SeekForPrevImpl(const Slice& target, const Comparator* cmp) { in SeekForPrevImpl() argument
159 while (Valid() && cmp->Compare(target, key()) < 0) { in SeekForPrevImpl()
Dmerging_iterator.cc408 InternalIterator* NewMergingIterator(const InternalKeyComparator* cmp, in NewMergingIterator() argument
418 return new MergingIterator(cmp, list, n, false, prefix_seek_mode); in NewMergingIterator()
421 return new (mem) MergingIterator(cmp, list, n, true, prefix_seek_mode); in NewMergingIterator()
/rocksdb-6.9/db/compaction/
Dcompaction_iterator.h63 InternalIterator* input, const Comparator* cmp, MergeHelper* merge_helper,
78 InternalIterator* input, const Comparator* cmp, MergeHelper* merge_helper,
Dcompaction_iterator.cc34 InternalIterator* input, const Comparator* cmp, MergeHelper* merge_helper, in CompactionIterator() argument
46 input, cmp, merge_helper, last_sequence, snapshots, in CompactionIterator()
55 InternalIterator* input, const Comparator* cmp, MergeHelper* merge_helper, in CompactionIterator() argument
68 cmp_(cmp), in CompactionIterator()
/rocksdb-6.9/java/rocksjni/
Dwrite_batch_test.cc43 ROCKSDB_NAMESPACE::InternalKeyComparator cmp( in Java_org_rocksdb_WriteBatchTest_getContents() local
50 cmp, ROCKSDB_NAMESPACE::ImmutableCFOptions(options), in Java_org_rocksdb_WriteBatchTest_getContents()

12345678910>>...23