| /leveldb-1.20/util/ |
| H A D | random.h | 25 uint32_t Next() { in Next() function
48 uint32_t Uniform(int n) { return Next() % n; } in Uniform()
52 bool OneIn(int n) { return (Next() % n) == 0; } in OneIn()
|
| /leveldb-1.20/db/ |
| H A D | skiplist.h | 74 void Next();
154 Node* Next(int n) {
208 inline void SkipList<Key,Comparator>::Iterator::Next() {
210 node_ = node_->Next(0);
231 node_ = list_->head_->Next(0);
247 while (height < kMaxHeight && ((rnd_.Next() % kBranching) == 0)) {
267 Node* next = x->Next(level);
290 Node* next = x->Next(level);
310 Node* next = x->Next(level);
|
| H A D | skiplist_test.cc | 56 Key key = rnd.Next() % R; in TEST()
103 iter.Next(); in TEST()
174 switch (rnd->Next() % 10) { in RandomTarget()
183 return MakeKey(rnd->Next() % K, 0); in RandomTarget()
218 const uint32_t k = rnd->Next() % K; in WriteStep()
271 if (rnd->Next() % 2) { in ReadStep()
272 iter.Next(); in ReadStep()
|
| H A D | db_iter.cc | 21 for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
82 virtual void Next();
146 void DBIter::Next() { in Next() function in leveldb::__anon9603b1580111::DBIter
157 iter_->Next(); in Next()
199 iter_->Next(); in FindNextUserEntry()
|
| H A D | db_test.cc | 697 iter->Next(); in TEST()
706 iter->Next(); in TEST()
715 iter->Next(); in TEST()
720 iter->Next(); in TEST()
737 iter->Next(); in TEST()
739 iter->Next(); in TEST()
741 iter->Next(); in TEST()
758 iter->Next(); in TEST()
776 iter->Next(); in TEST()
781 iter->Next(); in TEST()
[all …]
|
| H A D | memtable.cc | 59 virtual void Next() { iter_.Next(); } in Next() function in leveldb::MemTableIterator
|
| H A D | db_bench.cc | 758 const int k = seq ? i+j : (thread->rand.Next() % FLAGS_num); in DoWrite()
778 for (iter->SeekToFirst(); i < reads_ && iter->Valid(); iter->Next()) { in ReadSequential()
806 const int k = thread->rand.Next() % FLAGS_num; in ReadRandom()
823 const int k = thread->rand.Next() % FLAGS_num; in ReadMissing()
836 const int k = thread->rand.Next() % range; in ReadHot()
849 const int k = thread->rand.Next() % FLAGS_num; in SeekRandom()
868 const int k = seq ? i+j : (thread->rand.Next() % FLAGS_num); in DoDelete()
905 const int k = thread->rand.Next() % FLAGS_num; in ReadWhileWriting()
|
| H A D | builder.cc | 37 for (; iter->Valid(); iter->Next()) { in BuildTable()
|
| H A D | autocompact_test.cc | 85 iter->Next()) { in DoReads()
|
| H A D | write_batch_test.cc | 23 for (iter->SeekToFirst(); iter->Valid(); iter->Next()) { in PrintContents()
|
| H A D | repair.cc | 286 for (iter->SeekToFirst(); iter->Valid(); iter->Next()) { in ScanTable()
337 for (iter->SeekToFirst(); iter->Valid(); iter->Next()) { in RepairTable()
|
| H A D | dumpfile.cc | 168 for (iter->SeekToFirst(); iter->Valid(); iter->Next()) { in DumpTable()
|
| H A D | corruption_test.cc | 96 for (iter->SeekToFirst(); iter->Valid(); iter->Next()) { in Check()
|
| /leveldb-1.20/table/ |
| H A D | two_level_iterator.cc | 31 virtual void Next();
112 void TwoLevelIterator::Next() { in Next() function in leveldb::__anon627440db0111::TwoLevelIterator
114 data_iter_.Next(); in Next()
132 index_iter_.Next(); in SkipEmptyDataBlocksForward()
|
| H A D | iterator_wrapper.h | 45 void Next() { assert(iter_); iter_->Next(); Update(); } in Next() function
|
| H A D | merger.cc | 59 virtual void Next() { in Next() function in leveldb::__anon119e0de30111::MergingIterator
74 child->Next(); in Next()
81 current_->Next(); in Next()
|
| H A D | iterator.cc | 49 virtual void Next() { assert(false); } in Next() function in leveldb::__anon2a68238b0111::EmptyIterator
|
| H A D | table_test.cc | 289 virtual void Next() { iter_->Next(); } in Next() function in leveldb::KeyConvertingIterator
496 iter->Next(); in TestForwardScan()
531 iter->Next(); in TestRandomAccess()
780 iter->Next(); in TEST()
|
| H A D | block.cc | 139 virtual void Next() { in Next() function in leveldb::Block::Iter
|
| /leveldb-1.20/issues/ |
| H A D | issue200_test.cc | 45 iter->Next(); in TEST()
47 iter->Next(); in TEST()
|
| H A D | issue178_test.cc | 77 for (iter->SeekToFirst(); iter->Valid(); iter->Next()) { in TEST()
|
| /leveldb-1.20/include/leveldb/ |
| H A D | iterator.h | 48 virtual void Next() = 0;
|
| /leveldb-1.20/doc/bench/ |
| H A D | db_bench_tree_db.cc | 447 const int k = (order == SEQUENTIAL) ? i : (rand_.Next() % num_entries); in Write()
474 const int k = rand_.Next() % reads_; in ReadRandom()
|
| H A D | db_bench_sqlite3.cc | 539 (rand_.Next() % num_entries); in Write()
613 int k = (order == SEQUENTIAL) ? i + j : (rand_.Next() % reads_); in Read()
|
| /leveldb-1.20/helpers/memenv/ |
| H A D | memenv_test.cc | 220 iterator->Next(); in TEST()
|