Home
last modified time | relevance | path

Searched refs:longest_ (Results 1 – 25 of 43) sorted by relevance

12

/dports/textproc/regex2dfa/regex2dfa-0.1.6/third_party/re2/re2/testing/
H A Dbacktrack.cc67 bool longest_; // whether search wants leftmost-longest match member in re2::Backtracker
81 longest_(false), in Backtracker()
106 longest_ = longest | prog_->anchor_end(); in Search()
175 if (longest_) in Visit()
213 (longest_ && p > submatch_[0].end())) { // ... or better match in Visit()
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/re2/re2/testing/
H A Dbacktrack.cc67 bool longest_; // whether search wants leftmost-longest match member in re2::Backtracker
81 longest_(false), in Backtracker()
106 longest_ = longest | prog_->anchor_end(); in Search()
175 if (longest_) in Visit()
213 (longest_ && p > submatch_[0].end())) { // ... or better match in Visit()
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/re2/re2/testing/
H A Dbacktrack.cc67 bool longest_; // whether search wants leftmost-longest match member in re2::Backtracker
81 longest_(false), in Backtracker()
106 longest_ = longest | prog_->anchor_end(); in Search()
175 if (longest_) in Visit()
213 (longest_ && p > submatch_[0].end())) { // ... or better match in Visit()
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/re2/src/re2/testing/
H A Dbacktrack.cc76 bool longest_; // whether search wants leftmost-longest match member in re2::Backtracker
90 longest_(false), in Backtracker()
115 longest_ = longest | prog_->anchor_end(); in Search()
174 if (longest_ && !ip->last()) in Visit()
235 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in Try()
/dports/games/warzone2100/warzone2100/3rdparty/re2/re2/testing/
H A Dbacktrack.cc76 bool longest_; // whether search wants leftmost-longest match member in re2::Backtracker
92 longest_(false), in Backtracker()
111 longest_ = longest | prog_->anchor_end(); in Search()
171 if (longest_ && !ip->last()) in Visit()
232 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in Try()
/dports/devel/re2/re2-2021-11-01/re2/testing/
H A Dbacktrack.cc76 bool longest_; // whether search wants leftmost-longest match member in re2::Backtracker
92 longest_(false), in Backtracker()
111 longest_ = longest | prog_->anchor_end(); in Search()
171 if (longest_ && !ip->last()) in Visit()
232 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in Try()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/re2/src/re2/testing/
H A Dbacktrack.cc76 bool longest_; // whether search wants leftmost-longest match member in re2::Backtracker
92 longest_(false), in Backtracker()
111 longest_ = longest | prog_->anchor_end(); in Search()
171 if (longest_ && !ip->last()) in Visit()
232 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in Try()
/dports/textproc/kibana6/kibana-6.8.16-darwin-x86_64/node_modules/re2/vendor/re2/testing/
H A Dbacktrack.cc76 bool longest_; // whether search wants leftmost-longest match member in re2::Backtracker
93 longest_(false), in Backtracker()
118 longest_ = longest | prog_->anchor_end(); in Search()
177 if (longest_ && !ip->last()) in Visit()
238 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in Try()
/dports/textproc/kibana7/kibana-7.16.2-darwin-x86_64/node_modules/re2/vendor/re2/testing/
H A Dbacktrack.cc76 bool longest_; // whether search wants leftmost-longest match member in re2::Backtracker
92 longest_(false), in Backtracker()
111 longest_ = longest | prog_->anchor_end(); in Search()
171 if (longest_ && !ip->last()) in Visit()
232 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in Try()
/dports/textproc/opensearch-dashboards/opensearch-dashboards-1.2.0-linux-x64/node_modules/re2/vendor/re2/testing/
H A Dbacktrack.cc76 bool longest_; // whether search wants leftmost-longest match member in re2::Backtracker
92 longest_(false), in Backtracker()
111 longest_ = longest | prog_->anchor_end(); in Search()
171 if (longest_ && !ip->last()) in Visit()
232 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in Try()
/dports/devel/py-grpcio/grpcio-1.43.0/third_party/re2/re2/testing/
H A Dbacktrack.cc76 bool longest_; // whether search wants leftmost-longest match member in re2::Backtracker
92 longest_(false), in Backtracker()
111 longest_ = longest | prog_->anchor_end(); in Search()
171 if (longest_ && !ip->last()) in Visit()
232 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in Try()
/dports/games/warzone2100/warzone2100/3rdparty/re2/re2/
H A Dbitstate.cc60 bool longest_; // whether search wants leftmost-longest match member in re2::BitState
79 longest_(false), in BitState()
184 if (longest_) { in TrySearch()
257 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in TrySearch()
265 if (!longest_) in TrySearch()
301 longest_ = longest || prog_->anchor_end(); in Search()
/dports/devel/re2/re2-2021-11-01/re2/
H A Dbitstate.cc60 bool longest_; // whether search wants leftmost-longest match member in re2::BitState
79 longest_(false), in BitState()
184 if (longest_) { in TrySearch()
257 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in TrySearch()
265 if (!longest_) in TrySearch()
301 longest_ = longest || prog_->anchor_end(); in Search()
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/re2/src/re2/
H A Dbitstate.cc60 bool longest_; // whether search wants leftmost-longest match member in re2::BitState
79 longest_(false), in BitState()
184 if (longest_) { in TrySearch()
257 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in TrySearch()
265 if (!longest_) in TrySearch()
301 longest_ = longest || prog_->anchor_end(); in Search()
H A Dnfa.cc118 bool longest_; // whether searching for longest match member in re2::NFA
137 longest_ = false; in NFA()
340 if (longest_) { in Step()
365 if (ip->greedy(prog_) || longest_) { in Step()
395 if (longest_) { in Step()
481 longest_ = longest; in Search()
/dports/textproc/kibana7/kibana-7.16.2-darwin-x86_64/node_modules/re2/vendor/re2/
H A Dbitstate.cc60 bool longest_; // whether search wants leftmost-longest match member in re2::BitState
79 longest_(false), in BitState()
184 if (longest_) { in TrySearch()
257 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in TrySearch()
265 if (!longest_) in TrySearch()
301 longest_ = longest || prog_->anchor_end(); in Search()
/dports/textproc/opensearch-dashboards/opensearch-dashboards-1.2.0-linux-x64/node_modules/re2/vendor/re2/
H A Dbitstate.cc60 bool longest_; // whether search wants leftmost-longest match member in re2::BitState
79 longest_(false), in BitState()
184 if (longest_) { in TrySearch()
257 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in TrySearch()
265 if (!longest_) in TrySearch()
301 longest_ = longest || prog_->anchor_end(); in Search()
/dports/devel/pecl-grpc/grpc-1.42.0/third_party/re2/re2/
H A Dbitstate.cc60 bool longest_; // whether search wants leftmost-longest match member in re2::BitState
79 longest_(false), in BitState()
184 if (longest_) { in TrySearch()
257 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in TrySearch()
265 if (!longest_) in TrySearch()
301 longest_ = longest || prog_->anchor_end(); in Search()
/dports/devel/py-grpcio/grpcio-1.43.0/third_party/re2/re2/
H A Dbitstate.cc60 bool longest_; // whether search wants leftmost-longest match member in re2::BitState
79 longest_(false), in BitState()
184 if (longest_) { in TrySearch()
257 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in TrySearch()
265 if (!longest_) in TrySearch()
301 longest_ = longest || prog_->anchor_end(); in Search()
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/re2/src/re2/
H A Dbitstate.cc60 bool longest_; // whether search wants leftmost-longest match member in re2::BitState
76 longest_(false), in BitState()
181 if (longest_) { in TrySearch()
254 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in TrySearch()
262 if (!longest_) in TrySearch()
298 longest_ = longest || prog_->anchor_end(); in Search()
/dports/textproc/kibana6/kibana-6.8.16-darwin-x86_64/node_modules/re2/vendor/re2/
H A Dbitstate.cc60 bool longest_; // whether search wants leftmost-longest match member in re2::BitState
79 longest_(false), in BitState()
184 if (longest_) { in TrySearch()
257 (longest_ && p > submatch_[0].data() + submatch_[0].size())) { in TrySearch()
265 if (!longest_) in TrySearch()
301 longest_ = longest || prog_->anchor_end(); in Search()
/dports/textproc/regex2dfa/regex2dfa-0.1.6/third_party/re2/re2/
H A Dbitstate.cc53 bool longest_; // whether search wants leftmost-longest match member in re2::BitState
74 longest_(false), in BitState()
271 (longest_ && p > submatch_[0].end())) { in TrySearch()
277 if (!longest_) in TrySearch()
306 longest_ = longest || prog_->anchor_end(); in Search()
H A Dnfa.cc112 bool longest_; // whether searching for longest match member in re2::NFA
132 longest_ = false; in NFA()
300 if (longest_) { in Step()
326 if (ip->greedy(prog_) || longest_) { in Step()
345 if (longest_) { in Step()
437 longest_ = longest; in Search()
/dports/net/ooni-mini/probe-engine-0.23.0/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/re2/re2/
H A Dbitstate.cc53 bool longest_; // whether search wants leftmost-longest match member in re2::BitState
74 longest_(false), in BitState()
271 (longest_ && p > submatch_[0].end())) { in TrySearch()
277 if (!longest_) in TrySearch()
306 longest_ = longest || prog_->anchor_end(); in Search()
/dports/net/ooni-probe-cli/probe-cli-3.10.1/vendor/github.com/ooni/psiphon/oopsi/github.com/redjack/marionette/third_party/re2/re2/
H A Dbitstate.cc53 bool longest_; // whether search wants leftmost-longest match member in re2::BitState
74 longest_(false), in BitState()
271 (longest_ && p > submatch_[0].end())) { in TrySearch()
277 if (!longest_) in TrySearch()
306 longest_ = longest || prog_->anchor_end(); in Search()

12