Lines Matching full:that
2 // Use of this source code is governed by a BSD-style license that can be
142 void VisitCharacterRange(CharacterRange that);
152 void* RegExpUnparser::VisitDisjunction(RegExpDisjunction* that, void* data) {
154 for (int i = 0; i < that->alternatives()->length(); i++) {
156 that->alternatives()->at(i)->Accept(this, data);
163 void* RegExpUnparser::VisitAlternative(RegExpAlternative* that, void* data) {
165 for (int i = 0; i < that->nodes()->length(); i++) {
167 that->nodes()->at(i)->Accept(this, data);
174 void RegExpUnparser::VisitCharacterRange(CharacterRange that) {
175 os_ << AsUC32(that.from());
176 if (!that.IsSingleton()) {
177 os_ << "-" << AsUC32(that.to());
182 void* RegExpUnparser::VisitCharacterClass(RegExpCharacterClass* that,
184 if (that->is_negated()) os_ << "^";
186 for (int i = 0; i < that->ranges(zone_)->length(); i++) {
188 VisitCharacterRange(that->ranges(zone_)->at(i));
195 void* RegExpUnparser::VisitAssertion(RegExpAssertion* that, void* data) {
196 switch (that->assertion_type()) {
220 void* RegExpUnparser::VisitAtom(RegExpAtom* that, void* data) {
222 Vector<const uc16> chardata = that->data();
231 void* RegExpUnparser::VisitText(RegExpText* that, void* data) {
232 if (that->elements()->length() == 1) {
233 that->elements()->at(0).tree()->Accept(this, data);
236 for (int i = 0; i < that->elements()->length(); i++) {
238 that->elements()->at(i).tree()->Accept(this, data);
246 void* RegExpUnparser::VisitQuantifier(RegExpQuantifier* that, void* data) {
247 os_ << "(# " << that->min() << " ";
248 if (that->max() == RegExpTree::kInfinity) {
251 os_ << that->max() << " ";
253 os_ << (that->is_greedy() ? "g " : that->is_possessive() ? "p " : "n ");
254 that->body()->Accept(this, data);
260 void* RegExpUnparser::VisitCapture(RegExpCapture* that, void* data) {
262 that->body()->Accept(this, data);
267 void* RegExpUnparser::VisitGroup(RegExpGroup* that, void* data) {
269 that->body()->Accept(this, data);
274 void* RegExpUnparser::VisitLookaround(RegExpLookaround* that, void* data) {
276 os_ << (that->type() == RegExpLookaround::LOOKAHEAD ? "->" : "<-");
277 os_ << (that->is_positive() ? " + " : " - ");
278 that->body()->Accept(this, data);
284 void* RegExpUnparser::VisitBackReference(RegExpBackReference* that,
286 os_ << "(<- " << that->index() << ")";
291 void* RegExpUnparser::VisitEmpty(RegExpEmpty* that, void* data) {
