Lines Matching refs:that
2 // Use of this source code is governed by a BSD-style license that can be
145 void VisitCharacterRange(CharacterRange that);
156 void* RegExpUnparser::VisitDisjunction(RegExpDisjunction* that, void* data) {
158 for (int i = 0; i < that->alternatives()->length(); i++) {
160 that->alternatives()->at(i)->Accept(this, data);
167 void* RegExpUnparser::VisitAlternative(RegExpAlternative* that, void* data) {
169 for (int i = 0; i < that->nodes()->length(); i++) {
171 that->nodes()->at(i)->Accept(this, data);
178 void RegExpUnparser::VisitCharacterRange(CharacterRange that) {
179 os_ << AsUC32(that.from());
180 if (!that.IsSingleton()) {
181 os_ << "-" << AsUC32(that.to());
186 void* RegExpUnparser::VisitCharacterClass(RegExpCharacterClass* that,
188 if (that->is_negated()) os_ << "^";
190 for (int i = 0; i < that->ranges(zone_)->length(); i++) {
192 VisitCharacterRange(that->ranges(zone_)->at(i));
199 void* RegExpUnparser::VisitAssertion(RegExpAssertion* that, void* data) {
200 switch (that->assertion_type()) {
224 void* RegExpUnparser::VisitAtom(RegExpAtom* that, void* data) {
226 base::Vector<const base::uc16> chardata = that->data();
235 void* RegExpUnparser::VisitText(RegExpText* that, void* data) {
236 if (that->elements()->length() == 1) {
237 that->elements()->at(0).tree()->Accept(this, data);
240 for (int i = 0; i < that->elements()->length(); i++) {
242 that->elements()->at(i).tree()->Accept(this, data);
250 void* RegExpUnparser::VisitQuantifier(RegExpQuantifier* that, void* data) {
251 os_ << "(# " << that->min() << " ";
252 if (that->max() == RegExpTree::kInfinity) {
255 os_ << that->max() << " ";
257 os_ << (that->is_greedy() ? "g " : that->is_possessive() ? "p " : "n ");
258 that->body()->Accept(this, data);
264 void* RegExpUnparser::VisitCapture(RegExpCapture* that, void* data) {
266 that->body()->Accept(this, data);
271 void* RegExpUnparser::VisitGroup(RegExpGroup* that, void* data) {
273 that->body()->Accept(this, data);
278 void* RegExpUnparser::VisitLookaround(RegExpLookaround* that, void* data) {
280 os_ << (that->type() == RegExpLookaround::LOOKAHEAD ? "->" : "<-");
281 os_ << (that->is_positive() ? " + " : " - ");
282 that->body()->Accept(this, data);
288 void* RegExpUnparser::VisitBackReference(RegExpBackReference* that,
290 os_ << "(<- " << that->index() << ")";
295 void* RegExpUnparser::VisitEmpty(RegExpEmpty* that, void* data) {