68   Data* data;  member
86       : data(_data), rnd(_rnd), cmp(_cmp) {}  in StressTestIterator()
89     if (iter >= 0 && iter < (int)data->entries.size()) {  in Valid()
123           data->hidden.size() > data->entries.size() * target_hidden_fraction  in MaybeMutate()
126       if (data->hidden.empty()) {  in MaybeMutate()
133         size_t idx = rnd->Next() % data->entries.size();  in MaybeMutate()
134         Entry& e = data->entries[idx];  in MaybeMutate()
140           data->hidden.push_back(idx);  in MaybeMutate()
141           data->recently_touched_keys.insert(e.key);  in MaybeMutate()
150         size_t hi = rnd->Next() % data->hidden.size();  in MaybeMutate()
151         size_t idx = data->hidden[hi];  in MaybeMutate()
155         Entry& e = data->entries[idx];  in MaybeMutate()
158         data->hidden[hi] = data->hidden.back();  in MaybeMutate()
159         data->hidden.pop_back();  in MaybeMutate()
160         data->recently_touched_keys.insert(e.key);  in MaybeMutate()
166     while (iter < (int)data->entries.size() && !data->entries[iter].visible) {  in SkipForward()
171     while (iter >= 0 && !data->entries[iter].visible) {  in SkipBackward()
189     iter = (int)data->entries.size() - 1;  in SeekToLast()
200         data->entries.begin(), data->entries.end(),  in Seek()
202     iter = (int)(it - data->entries.begin());  in Seek()
212         data->entries.begin(), data->entries.end(),  in SeekForPrev()
214     iter = (int)(it - data->entries.begin());  in SeekForPrev()
236     return data->entries[iter].ikey;  in key()
240     return data->entries[iter].value;  in value()
251   Data* data;  member
259       : data(_data), sequence(_sequence) {}  in ReferenceIterator()
271     auto it = std::partition_point(data->entries.begin(), data->entries.end(),  in FindNextKey()
280       if (it != data->entries.end()) {  in FindNextKey()
285       if (it != data->entries.begin()) {  in FindNextKey()
295     if (data->recently_touched_keys.count(key)) {  in FindValueForCurrentKey()
300     auto it = std::partition_point(data->entries.begin(), data->entries.end(),  in FindValueForCurrentKey()
310       if (it == data->entries.end()) {  in FindValueForCurrentKey()
333     for (; it != data->entries.end(); ++it) {  in FindValueForCurrentKey()
353       value.append(operands[i].data(), operands[i].size());  in FindValueForCurrentKey()
379     key = data->entries.back().key;  in SeekToLast()
456               Data data;  in TEST_F()  local
474                 data.entries.push_back(e);  in TEST_F()
476               std::sort(data.entries.begin(), data.entries.end());  in TEST_F()
479                 for (size_t i = 0; i < data.entries.size(); ++i) {  in TEST_F()
480                   Entry& e = data.entries[i];  in TEST_F()
497                   uint64_t sequence = rnd.Next() % (data.entries.size() + 2);  in TEST_F()
498                   ref_iter.reset(new ReferenceIterator(&data, sequence));  in TEST_F()
504                       new StressTestIterator(&data, &rnd, BytewiseComparator());  in TEST_F()
544                   data.recently_touched_keys.clear();  in TEST_F()
557                       old_key = data.entries.back().key;  in TEST_F()
580                   if (data.recently_touched_keys.count(  in TEST_F()