HomeSort by relevance Sort by last modified time
    Searched defs:match_ (Results 1 - 4 of 4) sorted by null

  /external/regex-re2/re2/testing/
dfa_test.cc 239 : prog_(prog), match_(match), no_match_(no_match) {}
244 matched = prog_->SearchDFA(match_, NULL,
259 StringPiece match_; member in class:re2::SearchThread
  /external/regex-re2/re2/
nfa.cc 93 // Updates matched_ and match_ as new, better matches are found.
117 const char** match_; // best match so far member in class:re2::NFA
140 match_ = NULL;
147 delete[] match_;
302 if (matched_ && match_[0] < t->capture[0]) {
327 CopyCapture((const char**)match_, t->capture);
349 if (!matched_ || t->capture[0] < match_[0] ||
350 (t->capture[0] == match_[0] && t->capture[1] > match_[1]))
351 CopyCapture((const char**)match_, t->capture)
    [all...]
prefilter.cc 237 // is false and the match_ contains the required match
243 Prefilter* match_; member in class:re2::Prefilter::Info
249 match_(NULL) {
253 delete match_;
258 match_ = Prefilter::OrStrings(&exact_);
261 Prefilter* m = match_;
262 match_ = NULL;
287 if (match_)
288 return match_->DebugString();
337 ab->match_ = Prefilter::And(a->TakeMatch(), b->TakeMatch())
    [all...]
  /external/v8/src/base/
hashmap.h 98 MatchFun match_; member in class:v8::base::TemplateHashMapImpl
113 : match_(match) {
270 while (map_[i].exists() && !match_(hash, map_[i].hash, key, map_[i].key)) {
339 explicit HashEqualityThenKeyMatcher(MatchFun match) : match_(match) {}
343 return hash1 == hash2 && match_(key1, key2);
347 MatchFun match_; member in struct:HashEqualityThenKeyMatcher

Completed in 516 milliseconds