Home
last modified time | relevance | path

Searched refs:keys_ (Results 1 – 15 of 15) sorted by relevance

/rocksdb-6.9/db/
Dmerge_helper.cc41 keys_(), in MergeHelper()
123 keys_.clear(); in MergeUntil()
195 if (keys_.empty()) { in MergeUntil()
222 original_key = std::move(keys_.back()); in MergeUntil()
225 keys_.clear(); in MergeUntil()
266 keys_.push_front(iter->key().ToString()); in MergeUntil()
268 if (keys_.size() == 1) { in MergeUntil()
284 keys_.clear(); in MergeUntil()
329 original_key = std::move(keys_.back()); in MergeUntil()
332 keys_.clear(); in MergeUntil()
[all …]
Dcolumn_family_test.cc324 keys_.resize(cf + 1); in PutRandomData()
333 keys_[cf].insert(key); in PutRandomData()
1484 while (key_iter != keys_[1].end()) { in TEST_P()
1581 while (key_iter != keys_[1].end()) { in TEST_P()
1680 while (key_iter != keys_[1].end()) { in TEST_P()
1782 while (key_iter != keys_[1].end()) { in TEST_P()
1875 while (key_iter != keys_[1].end()) { in TEST_P()
1968 while (key_iter != keys_[1].end()) { in TEST_P()
2060 while (key_iter != keys_[1].end()) { in TEST_P()
3362 ASSERT_NE(keys_[cf].end(), keys_[cf].find(key.ToString())); in TEST_P()
[all …]
Dmerge_helper.h117 const std::deque<std::string>& keys() const { return keys_; } in keys()
155 std::deque<std::string> keys_; variable
/rocksdb-6.9/util/
Dduplicate_detector.h23 keys_.clear(); in IsDuplicateKeySeq()
26 CFKeys& cf_keys = keys_[cf]; in IsDuplicateKeySeq()
32 keys_.clear(); in IsDuplicateKeySeq()
34 keys_[cf].insert(key); in IsDuplicateKeySeq()
44 std::map<uint32_t, CFKeys> keys_; variable
65 keys_[cf] = CFKeys(SetComparator(cmp)); in InitWithComp()
Dvector_iterator.h20 : keys_(std::move(keys)), in VectorIterator()
22 indexed_cmp_(icmp, &keys_), in VectorIterator()
24 assert(keys_.size() == values_.size()); in VectorIterator()
26 indices_.reserve(keys_.size()); in VectorIterator()
27 for (size_t i = 0; i < keys_.size(); i++) { in VectorIterator()
61 return Slice(keys_[indices_[current_]]); in key()
94 std::vector<std::string> keys_; variable
Dbloom_test.cc63 std::vector<std::string> keys_; member in ROCKSDB_NAMESPACE::BlockBasedBloomTest
69 keys_.clear(); in Reset()
82 keys_.push_back(s.ToString()); in Add()
87 for (size_t i = 0; i < keys_.size(); i++) { in Build()
88 key_slices.push_back(Slice(keys_[i])); in Build()
93 keys_.clear(); in Build()
115 if (!keys_.empty()) { in Matches()
/rocksdb-6.9/test_util/
Dtestutil.h141 : keys_(keys), current_(keys.size()) { in VectorIterator()
142 std::sort(keys_.begin(), keys_.end()); in VectorIterator()
148 : keys_(keys), values_(values), current_(keys.size()) { in VectorIterator()
149 assert(keys_.size() == values_.size()); in VectorIterator()
155 virtual void SeekToLast() override { current_ = keys_.size() - 1; } in SeekToLast()
158 current_ = std::lower_bound(keys_.begin(), keys_.end(), target.ToString()) - in Seek()
159 keys_.begin(); in Seek()
163 current_ = std::upper_bound(keys_.begin(), keys_.end(), target.ToString()) - in SeekForPrev()
164 keys_.begin(); in SeekForPrev()
175 virtual Slice key() const override { return Slice(keys_[current_]); } in key()
[all …]
/rocksdb-6.9/db/compaction/
Dcompaction_iterator_test.cc111 : keys_(keys), values_(values), current_(keys.size()) { in LoggingForwardVectorIterator()
112 assert(keys_.size() == values_.size()); in LoggingForwardVectorIterator()
115 bool Valid() const override { return current_ < keys_.size(); } in Valid()
125 current_ = std::lower_bound(keys_.begin(), keys_.end(), target.ToString()) - in Seek()
126 keys_.begin(); in Seek()
140 return Slice(keys_[current_]); in key()
152 std::vector<std::string> keys_; member in ROCKSDB_NAMESPACE::LoggingForwardVectorIterator
/rocksdb-6.9/memtable/
Dinlineskiplist_test.cc70 keys_.insert(key); in Insert()
77 keys_.insert(key); in InsertWithHint()
83 for (Key key : keys_) { in Validate()
92 for (Key key : keys_) { in Validate()
103 std::set<Key> keys_; member in ROCKSDB_NAMESPACE::InlineSkipTest
/rocksdb-6.9/utilities/transactions/
Dwrite_unprepared_txn_db.cc72 std::map<uint32_t, CFKeys> keys_; in RollbackRecoveredTransaction() member
89 CFKeys& cf_keys = keys_[cf]; in RollbackRecoveredTransaction()
92 keys_[cf] = CFKeys(SetComparator(cmp)); in RollbackRecoveredTransaction()
Dwrite_prepared_txn.cc260 std::map<uint32_t, CFKeys> keys_; in RollbackInternal() member
279 CFKeys& cf_keys = keys_[cf]; in RollbackInternal()
282 keys_[cf] = CFKeys(SetComparator(cmp)); in RollbackInternal()
Dpessimistic_transaction.cc469 std::map<uint32_t, std::set<std::string>> keys_; in LockBatch() member in ROCKSDB_NAMESPACE::PessimisticTransaction::LockBatch::Handler
476 auto& cfh_keys = keys_[column_family_id]; in LockBatch()
507 for (const auto& cf_iter : handler.keys_) { in LockBatch()
Dwrite_prepared_txn_db.cc980 keys_[cf] = CFKeys(SetComparator(cmp)); in InitWithComp()
984 CFKeys& cf_keys = keys_[cf]; in AddKey()
991 keys_.clear(); in AddKey()
993 keys_[cf].insert(key); in AddKey()
Dwrite_prepared_txn_db.h1048 std::map<uint32_t, CFKeys> keys_; member
/rocksdb-6.9/tools/
Ddb_bench_tool.cc2319 std::vector<std::string> keys_; member in ROCKSDB_NAMESPACE::Benchmark
2754 if (!keys_.empty()) { in GenerateKeyFromInt()
2756 assert(keys_.size() == static_cast<size_t>(num_keys)); in GenerateKeyFromInt()
2758 *key = keys_[v]; in GenerateKeyFromInt()
4091 keys_.emplace_back(iter->key().ToString()); in InitializeOptionsGeneral()
4094 FLAGS_num = keys_.size(); in InitializeOptionsGeneral()