Method search

code/strings/aho_corasick.cpp:37–48

            while (out->next) out = out->next;
            out->next = s->fail->out; } } } } }
  vector<string> search(string s) {
    vector<string> res;
    go_node *cur = go;
    iter(c, s) {
      while (cur && cur->next.find(*c) == cur->next.end())
        cur = cur->fail;
      if (!cur) cur = go;
      cur = cur->next[*c];
      if (!cur) cur = go;
      for (out_node *out = cur->out; out; out = out->next)
        res.push_back(out->keyword); }
    return res; } };
// vim: cc=60 ts=2 sts=2 sw=2: