Home
last modified time | relevance | path

Searched refs:searching (Results 1 - 5 of 5) sorted by relevance

/third_party/libphonenumber/cpp/src/phonenumbers/utf/
H A Dunicodetext.cc320 // ----- substring searching -----
335 // Due to the magic of the UTF8 encoding, searching for a sequence of in UnsafeFind()
337 StringPiece searching(utf8_data(), utf8_length()); in UnsafeFind()
340 searching.find(look_piece, start_pos.utf8_data() - utf8_data()); in UnsafeFind()
350 StringPiece searching(utf8_data(), utf8_length()); in HasReplacementChar()
352 return searching.find(looking_for) != StringPiece::npos; in HasReplacementChar()
/third_party/jerryscript/jerry-core/ecma/builtin-objects/
H A Decma-builtin-helpers.c713 bool searching = true; in ecma_builtin_helper_string_find_index() local
715 while (searching) in ecma_builtin_helper_string_find_index()
751 if ((searching = (index <= original_len - search_len))) in ecma_builtin_helper_string_find_index()
759 if ((searching = (index > 0))) in ecma_builtin_helper_string_find_index()
/third_party/rust/crates/memchr/src/memmem/
H A Dmod.rs81 /// substring searching.
233 /// Note that if you're are searching for the same needle in many different
269 /// Note that if you're are searching for the same needle in many different
379 /// When searching with an empty needle, this gets set to `None` after
745 /// The actual needle we're searching for.
1026 /// in particular, it's not clear whether a prefilter on reverse searching is
1030 /// The actual needle we're searching for.
/third_party/rust/crates/memchr/src/memmem/prefilter/
H A Dmod.rs52 /// (Although, we don't currently implement prefilters for reverse searching.)
143 /// Prefilter controls whether heuristics are used to accelerate searching.
/third_party/rust/crates/aho-corasick/src/
H A Dnfa.rs53 /// information is useful for keeping correct buffer sizes when searching
294 // TODO: Strictly speaking, this isn't needed for searching. It's only
750 /// text we're searching (called the "subject" string), all we need to do
755 /// The trick comes when searching a subject string like 'abcef'. We'll
762 /// we wind up searching the subject string potentially many times. In
987 /// searching should stop.

Completed in 7 milliseconds