Lines Matching refs:e
52 bool operator<(const Entry& e) const { in operator <()
53 if (key != e.key) return key < e.key; in operator <()
54 return std::tie(sequence, type) > std::tie(e.sequence, e.type); in operator <()
134 Entry& e = data->entries[idx]; in MaybeMutate() local
135 if (e.visible) { in MaybeMutate()
139 e.visible = false; in MaybeMutate()
141 data->recently_touched_keys.insert(e.key); in MaybeMutate()
155 Entry& e = data->entries[idx]; in MaybeMutate() local
156 assert(!e.visible); in MaybeMutate()
157 e.visible = true; in MaybeMutate()
160 data->recently_touched_keys.insert(e.key); in MaybeMutate()
201 [&](const Entry& e) { return cmp.Compare(e.ikey, target) < 0; }); in Seek() argument
213 [&](const Entry& e) { return cmp.Compare(e.ikey, target) <= 0; }); in SeekForPrev() argument
272 [&](const Entry& e) { in FindNextKey() argument
274 return e.key < key; in FindNextKey()
276 return e.key <= key; in FindNextKey()
301 [&](const Entry& e) { in FindValueForCurrentKey() argument
302 if (e.key != key) { in FindValueForCurrentKey()
303 return e.key < key; in FindValueForCurrentKey()
305 return e.sequence > sequence; in FindValueForCurrentKey()
313 Entry& e = *it; in FindValueForCurrentKey() local
314 if (e.key != key) { in FindValueForCurrentKey()
317 assert(e.sequence <= sequence); in FindValueForCurrentKey()
318 if (!e.visible) continue; in FindValueForCurrentKey()
319 if (e.type == kTypeDeletion) { in FindValueForCurrentKey()
322 if (e.type == kTypeValue) { in FindValueForCurrentKey()
323 value = e.value; in FindValueForCurrentKey()
327 assert(e.type == kTypeMerge); in FindValueForCurrentKey()
334 Entry& e = *it; in FindValueForCurrentKey() local
335 if (e.key != key) { in FindValueForCurrentKey()
338 assert(e.sequence <= sequence); in FindValueForCurrentKey()
339 if (!e.visible) continue; in FindValueForCurrentKey()
340 if (e.type == kTypeDeletion) { in FindValueForCurrentKey()
343 operands.push_back(e.value); in FindValueForCurrentKey()
344 if (e.type == kTypeValue) { in FindValueForCurrentKey()
459 Entry e; in TEST_F() local
460 e.key = gen_key(max_key); in TEST_F()
462 e.type = prevalent_entry_type; in TEST_F()
466 e.type = in TEST_F()
469 e.sequence = i; in TEST_F()
470 e.value = "v" + ToString(i); in TEST_F()
471 ParsedInternalKey internal_key(e.key, e.sequence, e.type); in TEST_F()
472 AppendInternalKey(&e.ikey, internal_key); in TEST_F()
474 data.entries.push_back(e); in TEST_F()
480 Entry& e = data.entries[i]; in TEST_F() local
482 << "\n idx " << i << ": \"" << e.key << "\": \"" in TEST_F()
483 << e.value << "\" seq: " << e.sequence << " type: " in TEST_F()
484 << (e.type == kTypeValue in TEST_F()
486 : e.type == kTypeDeletion ? "del" : "merge"); in TEST_F()