HomeSort by relevance Sort by last modified time
    Searched refs:RegexNode (Results 1 - 12 of 12) sorted by null

  /external/skia/src/sksl/lex/
RegexParser.cpp 12 RegexNode RegexParser::parse(std::string source) {
37 RegexNode RegexParser::pop() {
38 RegexNode result = fStack.top();
55 case '*': fStack.push(RegexNode(RegexNode::kStar_Kind, this->pop())); ++fIndex; break;
56 case '+': fStack.push(RegexNode(RegexNode::kPlus_Kind, this->pop())); ++fIndex; break;
57 case '?': fStack.push(RegexNode(RegexNode::kQuestion_Kind, this->pop())); ++fIndex; break;
71 RegexNode right = this->pop()
    [all...]
RegexParser.h 11 #include "RegexNode.h"
23 RegexNode parse(std::string source);
32 RegexNode pop();
53 RegexNode escapeSequence(char c);
86 std::stack<RegexNode> fStack;
RegexNode.h 19 struct RegexNode {
32 RegexNode(Kind kind)
35 RegexNode(Kind kind, char payload)
40 RegexNode(Kind kind, const char* children)
49 RegexNode(Kind kind, RegexNode child)
54 RegexNode(Kind kind, RegexNode child1, RegexNode child2)
75 std::vector<RegexNode> fChildren
    [all...]
NFA.h 12 #include "RegexNode.h"
23 int addRegex(const RegexNode& regex) {
Main.cpp 182 RegexNode node = RegexNode(RegexNode::kChar_Kind, pattern[1]);
184 node = RegexNode(RegexNode::kConcat_Kind, node,
185 RegexNode(RegexNode::kChar_Kind, pattern[i]));
RegexNode.cpp 8 #include "RegexNode.h"
12 std::vector<int> RegexNode::createStates(NFA* nfa, const std::vector<int>& accept) const {
20 for (const RegexNode& child : fChildren) {
85 std::string RegexNode::description() const {
94 for (const RegexNode& c : fChildren) {
  /external/skqp/src/sksl/lex/
RegexParser.cpp 12 RegexNode RegexParser::parse(std::string source) {
37 RegexNode RegexParser::pop() {
38 RegexNode result = fStack.top();
55 case '*': fStack.push(RegexNode(RegexNode::kStar_Kind, this->pop())); ++fIndex; break;
56 case '+': fStack.push(RegexNode(RegexNode::kPlus_Kind, this->pop())); ++fIndex; break;
57 case '?': fStack.push(RegexNode(RegexNode::kQuestion_Kind, this->pop())); ++fIndex; break;
71 RegexNode right = this->pop()
    [all...]
RegexParser.h 11 #include "RegexNode.h"
23 RegexNode parse(std::string source);
32 RegexNode pop();
53 RegexNode escapeSequence(char c);
86 std::stack<RegexNode> fStack;
RegexNode.h 19 struct RegexNode {
32 RegexNode(Kind kind)
35 RegexNode(Kind kind, char payload)
40 RegexNode(Kind kind, const char* children)
49 RegexNode(Kind kind, RegexNode child)
54 RegexNode(Kind kind, RegexNode child1, RegexNode child2)
75 std::vector<RegexNode> fChildren
    [all...]
NFA.h 12 #include "RegexNode.h"
23 int addRegex(const RegexNode& regex) {
Main.cpp 182 RegexNode node = RegexNode(RegexNode::kChar_Kind, pattern[1]);
184 node = RegexNode(RegexNode::kConcat_Kind, node,
185 RegexNode(RegexNode::kChar_Kind, pattern[i]));
RegexNode.cpp 8 #include "RegexNode.h"
12 std::vector<int> RegexNode::createStates(NFA* nfa, const std::vector<int>& accept) const {
20 for (const RegexNode& child : fChildren) {
85 std::string RegexNode::description() const {
94 for (const RegexNode& c : fChildren) {

Completed in 237 milliseconds