Lines Matching defs:value
19 // tree using the bits of a hash value as addresses). The map is a conceptually
20 // infinite: All keys are initially mapped to a default value, values are
21 // deleted by overwriting them with the default value. The iterators produce
22 // exactly the keys that are not the default value. The hash values should have
46 // their unsigned value. This way, the order in the hash tree is compatible
52 const Value& value() const { return this->second; }
75 // Add or overwrite an existing key-value pair.
76 void Set(Key key, Value value);
91 // The iterator produces key-value pairs in the lexicographical order of
92 // hash value and key. It produces exactly the key-value pairs where the value
93 // is not the default value.
102 // Iterator to traverse two maps in lockstep, producing matching value pairs
103 // for each key where at least one value is different from the respective
121 // Find the {FocusedTree} that contains a key-value pair with key hash {hash}.
124 // Find the {FocusedTree} that contains a key-value pair with key hash {hash}.
133 // Load value from the leaf node on the focused path of {tree}.
158 // leaf. For the focused leaf, it stores key, value and key hash. The path is
299 // Skip entries with default value. PersistentMap iterators must never point
300 // to a default value.
378 void PersistentMap<Key, Value, Hasher>::Set(Key key, Value value) {
384 if (!(GetFocusedValue(old, key) != value)) return;
391 more->emplace(old->key_value.key(), old->key_value.value());
394 more->emplace(key, value);
399 FocusedTree{KeyValue(std::move(key), std::move(value)),
466 return tree->key_value.value();