Lines Matching refs:this
2 // Use of this source code is governed by a BSD-style license that can be
51 const Key& key() const { return this->first; }
52 const Value& value() const { return this->second; }
88 return !(*this == other);
115 ZipIterable Zip(const PersistentMap& other) const { return {*this, other}; }
125 // Output the path to this {FocusedTree} and its length. If no such
161 // the pointers outside of this path. Instead of storing all of these nodes,
166 // this structure also represents all the nodes on its path. The intended node
176 // this structure.
183 // over-allocate memory for this structure and access memory beyond
190 reinterpret_cast<byte*>(this) + offsetof(FocusedTree, path_array))[i];
195 reinterpret_cast<const byte*>(this) +
239 return *this;
244 if (more_iter_ != current_->more->end()) return *this;
247 *this = end(def_value_);
248 return *this;
253 *this = end(def_value_);
254 return *this;
264 } while (!((**this).second != def_value()));
265 return *this;
274 return (**this).first == (*other).first;
277 bool operator!=(const iterator& other) const { return !(*this == other); }
283 return (**this).first < (*other).first;
347 return *this = double_iterator(first_, second_);
407 *this = PersistentMap(tree, zone_, def_value_);