Lines Matching refs:tree
145 // Parse-tree is a single atom that is equal to the pattern.
147 } else if (parse_result.tree->IsAtom() &&
150 RegExpAtom* atom = parse_result.tree->AsAtom();
579 // 1) The parser generates an abstract syntax tree. See ast.cc.
1994 RegExpCharacterClass* tree = elm.data.u_char_class;
1995 ZoneList<CharacterRange>* ranges = tree->ranges();
1996 if (tree->is_negated()) {
3564 tree()->ForEach(&dumper);
3581 // Tree to graph conversion
4720 // Splay tree
4771 if (tree()->is_empty()) {
4774 ASSERT_RESULT(tree()->Insert(current.from(), &loc));
4781 if (tree()->FindGreatestLessThan(current.from(), &loc)) {
4799 ASSERT_RESULT(tree()->Insert(right.from(), &loc));
4806 if (tree()->FindLeastGreaterThan(current.from(), &loc) &&
4815 ASSERT_RESULT(tree()->Insert(current.from(), &ins));
4826 ASSERT_RESULT(tree()->Insert(current.to() + 1, &ins));
4846 ASSERT_RESULT(tree()->Insert(current.from(), &ins));
4858 if (!tree()->FindGreatestLessThan(value, &loc))
5270 RegExpCharacterClass* tree = elm.data.u_char_class;
5271 ZoneList<CharacterRange>* ranges = tree->ranges();
5272 if (tree->is_negated()) {
5303 RegExpNode* captured_body = RegExpCapture::ToNode(data->tree,
5308 bool is_end_anchored = data->tree->IsAnchoredAtEnd();
5309 bool is_start_anchored = data->tree->IsAnchoredAtStart();
5310 int max_length = data->tree->max_match();
