Searched refs:FocusedTree (Results 1 - 1 of 1) sorted by relevance
| /third_party/node/deps/v8/src/compiler/ |
| H A D | persistent-map.h | 56 struct FocusedTree;
71 const FocusedTree* tree = FindHash(key_hash); in Get()
121 // Find the {FocusedTree} that contains a key-value pair with key hash {hash}.
122 const FocusedTree* FindHash(HashValue hash) const;
124 // Find the {FocusedTree} that contains a key-value pair with key hash {hash}.
125 // Output the path to this {FocusedTree} and its length. If no such
126 // {FocusedTree} exists, return {nullptr} and output the path to the last node
128 // path and may be less than the length of the found {FocusedTree}.
129 const FocusedTree* FindHash(HashValue hash,
130 std::array<const FocusedTree*, kHashBit
173 struct PersistentMap<Key, Value, Hasher>::FocusedTree { global() struct in v8::internal::compiler::PersistentMap::PersistentMap
341 DCHECK(old_first < first_); } if (second_current_) { ++second_; DCHECK(old_second < second_); } return *this = double_iterator(first_, second_); } double_iterator(iterator first, iterator second) : first_(first), second_(second) { if (first_ == second_) { first_current_ = second_current_ = true; } else if (first_ < second_) { first_current_ = true; second_current_ = false; } else { DCHECK(second_ < first_); first_current_ = false; second_current_ = true; } } bool operator!=(const double_iterator& other) { return first_ != other.first_ || second_ != other.second_; } bool is_end() const { return first_.is_end() && second_.is_end(); } private: iterator first_; iterator second_; bool first_current_; bool second_current_; }; template <class Key, class Value, class Hasher> void PersistentMap<Key, Value, Hasher>::Set(Key key, Value value) { HashValue key_hash = HashValue(Hasher()(key)); std::array<const FocusedTree*, kHashBits> path; int length = 0; const FocusedTree* old = FindHash(key_hash, &path, &length); ZoneMap<Key, Value>* more = nullptr; if (!(GetFocusedValue(old, key) != value)) return; if (old && !(old->more == nullptr && old->key_value.key() == key)) { more = zone_->New<ZoneMap<Key, Value>>(zone_); if (old->more) operator ++() argument
427 FindHash( HashValue hash, std::array<const FocusedTree*, kHashBits>* path, int* length) const FindHash() argument
488 FindLeftmost( const FocusedTree* start, int* level, std::array<const FocusedTree*, kHashBits>* path) FindLeftmost() argument
[all...] |
Completed in 1 milliseconds