Lines Matching full:that
2 // Use of this source code is governed by a BSD-style license that can be
39 // Abstract state to approximate the current state of checks that are
54 AbstractChecks* that = new (zone) AbstractChecks(*this);
55 that->nodes_[that->next_index_] = node;
56 that->next_index_ = (that->next_index_ + 1) % arraysize(nodes_);
57 return that;
60 bool Equals(AbstractChecks const* that) const;
61 AbstractChecks const* Merge(AbstractChecks const* that, Zone* zone) const;
88 AbstractElements* that = new (zone) AbstractElements(*this);
89 that->elements_[that->next_index_] = Element(object, index, value);
90 that->next_index_ = (that->next_index_ + 1) % arraysize(elements_);
91 return that;
95 bool Equals(AbstractElements const* that) const;
96 AbstractElements const* Merge(AbstractElements const* that,
127 AbstractField* that = new (zone) AbstractField(zone);
128 that->info_for_node_ = this->info_for_node_;
129 that->info_for_node_.insert(std::make_pair(object, value));
130 return that;
134 bool Equals(AbstractField const* that) const {
135 return this == that || this->info_for_node_ == that->info_for_node_;
137 AbstractField const* Merge(AbstractField const* that, Zone* zone) const {
138 if (this->Equals(that)) return this;
143 auto that_it = that->info_for_node_.find(this_object);
144 if (that_it != that->info_for_node_.end() &&
172 AbstractMaps* that = new (zone) AbstractMaps(zone);
173 that->info_for_node_ = this->info_for_node_;
174 that->info_for_node_.insert(std::make_pair(object, maps));
175 return that;
179 bool Equals(AbstractMaps const* that) const {
180 return this == that || this->info_for_node_ == that->info_for_node_;
182 AbstractMaps const* Merge(AbstractMaps const* that, Zone* zone) const {
183 if (this->Equals(that)) return this;
188 auto that_it = that->info_for_node_.find(this_object);
189 if (that_it != that->info_for_node_.end() &&
211 bool Equals(AbstractState const* that) const;
212 void Merge(AbstractState const* that, Zone* zone);
