Home
last modified time | relevance | path

Searched refs:comparator (Results 1 – 18 of 18) sorted by relevance

/leveldb-1.20/db/
H A Dmemtable.h24 explicit MemTable(const InternalKeyComparator& comparator);
67 const InternalKeyComparator comparator; member
68 explicit KeyComparator(const InternalKeyComparator& c) : comparator(c) { } in KeyComparator()
H A Dmemtable.cc38 return comparator.Compare(a, b); in operator ()()
125 if (comparator_.comparator.user_comparator()->Compare( in Get()
H A Drepair.cc50 icmp_(options.comparator), in Repairer()
H A Dc.cc397 opt->rep.comparator = cmp; in leveldb_options_set_comparator()
H A Ddb_test.cc356 if (last_options_.comparator->Compare(ikey.user_key, user_key) != 0) { in AllEntriesFor()
1413 new_options.comparator = &cmp; in TEST()
1449 new_options.comparator = &cmp; in TEST()
H A Ddb_impl.cc95 result.comparator = icmp; in SanitizeOptions()
119 internal_comparator_(raw_options.comparator), in DBImpl()
/leveldb-1.20/table/
H A Dtable_builder.cc80 if (options.comparator != rep_->options.comparator) { in ChangeOptions()
97 assert(r->options.comparator->Compare(key, Slice(r->last_key)) > 0); in Add()
102 r->options.comparator->FindShortestSeparator(&r->last_key, key); in Add()
232 r->options.comparator->FindShortSuccessor(&r->last_key); in Finish()
H A Dmerger.h22 const Comparator* comparator, Iterator** children, int n);
H A Dblock.h25 Iterator* NewIterator(const Comparator* comparator);
H A Dtable.cc208 iter = block->NewIterator(table->rep_->options.comparator); in BlockReader()
222 rep_->index_block->NewIterator(rep_->options.comparator), in NewIterator()
230 Iterator* iiter = rep_->index_block->NewIterator(rep_->options.comparator); in InternalGet()
260 rep_->index_block->NewIterator(rep_->options.comparator); in ApproximateOffsetOf()
H A Dmerger.cc16 MergingIterator(const Comparator* comparator, Iterator** children, int n) in MergingIterator() argument
17 : comparator_(comparator), in MergingIterator()
H A Dtable_test.cc249 table_options.comparator = options.comparator; in FinishImpl()
384 options.comparator = comparator_; in NewDB()
451 options_.comparator = &reverse_key_comparator; in Init()
455 constructor_ = new TableConstructor(options_.comparator); in Init()
458 constructor_ = new BlockConstructor(options_.comparator); in Init()
461 constructor_ = new MemTableConstructor(options_.comparator); in Init()
464 constructor_ = new DBConstructor(options_.comparator); in Init()
631 Increment(options_.comparator, &result); in PickRandomKey()
H A Dblock.cc115 Iter(const Comparator* comparator, in Iter() argument
119 : comparator_(comparator), in Iter()
H A Dblock_builder.cc78 || options_->comparator->Compare(key, last_key_piece) > 0); in Add()
/leveldb-1.20/util/
H A Doptions.cc13 : comparator(BytewiseComparator()), in Options()
/leveldb-1.20/include/leveldb/
H A Doptions.h41 const Comparator* comparator; member
/leveldb-1.20/doc/
H A Dindex.md8 according to a user-specified comparator function.
248 bytes lexicographically. You can however supply a custom comparator when opening
278 Now create a database using this custom comparator:
285 options.comparator = &cmp;
292 The result of the comparator's Name method is attached to the database when it
303 `TwoPartComparator`), (a) keep the same comparator name (b) increment the
304 version number for new keys (c) change the comparator function so it uses the
417 If you are using a custom comparator, you should ensure that the filter policy
418 you are using is compatible with your comparator. For example, consider a
419 comparator that ignores trailing spaces when comparing keys.
[all …]
/leveldb-1.20/
H A DREADME.md152 * **include/comparator.h**: Abstraction for user-specified comparison function.
154 comparator, but clients can write their own comparator implementations if they