Home
last modified time | relevance | path

Searched refs:candidate (Results 1 - 25 of 179) sorted by relevance

12345678

/third_party/libphonenumber/java/libphonenumber/src/com/google/i18n/phonenumbers/
H A DPhoneNumberMatcher.java227 * @param leniency the leniency to use when evaluating candidate phone numbers
259 CharSequence candidate = text.subSequence(start, matcher.end()); in find()
264 candidate = trimAfterFirstMatch(PhoneNumberUtil.SECOND_NUMBER_START_PATTERN, candidate); in find()
266 PhoneNumberMatch match = extractMatch(candidate, start); in find()
271 index = start + candidate.length(); in find()
279 * Trims away any characters after the first match of {@code pattern} in {@code candidate},
282 private static CharSequence trimAfterFirstMatch(Pattern pattern, CharSequence candidate) { in trimAfterFirstMatch() argument
283 Matcher trailingCharsMatcher = pattern.matcher(candidate); in trimAfterFirstMatch()
285 candidate in trimAfterFirstMatch()
321 extractMatch(CharSequence candidate, int offset) extractMatch() argument
354 extractInnerMatch(CharSequence candidate, int offset) extractInnerMatch() argument
392 parseAndVerify(CharSequence candidate, int offset) parseAndVerify() argument
568 checkNumberGroupingIsValid( PhoneNumber number, CharSequence candidate, PhoneNumberUtil util, NumberGroupingChecker checker) checkNumberGroupingIsValid() argument
603 containsMoreThanOneSlashInNationalNumber(PhoneNumber number, String candidate) containsMoreThanOneSlashInNationalNumber() argument
629 containsOnlyValidXChars( PhoneNumber number, String candidate, PhoneNumberUtil util) containsOnlyValidXChars() argument
[all...]
/third_party/libphonenumber/cpp/src/phonenumbers/
H A Dphonenumbermatcher.cc84 bool ContainsOnlyValidXChars(const PhoneNumber& number, const string& candidate, in ContainsOnlyValidXChars() argument
93 found = candidate.find_first_of("xX"); in ContainsOnlyValidXChars()
96 while (found != string::npos && found < candidate.length() - 1) { in ContainsOnlyValidXChars()
98 char next_char = candidate[found + 1]; in ContainsOnlyValidXChars()
104 number, candidate.substr(found, candidate.length() - found)) in ContainsOnlyValidXChars()
109 string normalized_extension(candidate.substr(found, in ContainsOnlyValidXChars()
110 candidate.length() - found)); in ContainsOnlyValidXChars()
116 found = candidate.find_first_of("xX", found + 1); in ContainsOnlyValidXChars()
128 // First skip the country code if the normalized candidate containe in AllNumberGroupsRemainGrouped()
464 ParseAndVerify(const string& candidate, int offset, PhoneNumberMatch* match) ParseAndVerify() argument
583 ExtractInnerMatch(const string& candidate, int offset, PhoneNumberMatch* match) ExtractInnerMatch() argument
619 ExtractMatch(const string& candidate, int offset, PhoneNumberMatch* match) ExtractMatch() argument
685 string candidate; Find() local
702 CheckNumberGroupingIsValid( const PhoneNumber& phone_number, const string& candidate, ResultCallback4<bool, const PhoneNumberUtil&, const PhoneNumber&, const string&, const std::vector<string>&>* checker) const CheckNumberGroupingIsValid() argument
886 ContainsMoreThanOneSlashInNationalNumber( const PhoneNumber& number, const string& candidate, const PhoneNumberUtil& util) ContainsMoreThanOneSlashInNationalNumber() argument
[all...]
H A Dphonenumbermatcher.h108 // Attempts to extract a match from a candidate string. Returns true if a
110 // start index of the candidate string within the overall text.
119 // Attempts to extract a match from candidate. Returns true if the match was
121 bool ExtractMatch(const string& candidate, int offset,
124 // Attempts to extract a match from a candidate string if the whole candidate
127 bool ExtractInnerMatch(const string& candidate, int offset,
130 // Parses a phone number from the candidate using PhoneNumberUtil::Parse() and
133 bool ParseAndVerify(const string& candidate, int offset,
138 const string& candidate,
[all...]
/third_party/node/deps/v8/src/compiler/
H A Djs-inlining-heuristic.cc174 // Check if the {node} is an appropriate candidate for inlining. in Reduce()
175 Candidate candidate = CollectFunctions(node, kMaxCallPolymorphism); in Reduce()
176 if (candidate.num_functions == 0) { in Reduce()
178 } else if (candidate.num_functions > 1 && !FLAG_polymorphic_inlining) { in Reduce()
186 candidate.total_size = 0; in Reduce()
190 for (int i = 0; i < candidate.num_functions; ++i) { in Reduce()
191 if (!candidate.bytecode[i].has_value()) { in Reduce()
192 candidate.can_inline_function[i] = false; in Reduce()
196 SharedFunctionInfoRef shared = candidate.functions[i].has_value() in Reduce()
197 ? candidate in Reduce()
288 Candidate candidate = *i; Finalize() local
648 CreateOrReuseDispatch(Node* node, Node* callee, Candidate const& candidate, Node** if_successes, Node** calls, Node** inputs, int input_count) CreateOrReuseDispatch() argument
701 InlineCandidate(Candidate const& candidate, bool small_function) InlineCandidate() argument
[all...]
H A Dwasm-inlining.cc119 CandidateInfo candidate{call, inlinee_index, call_count, in ReduceCall()
122 inlining_candidates_.push(candidate); in ReduceCall()
135 void WasmInliner::Trace(const CandidateInfo& candidate, const char* decision) { in Trace() argument
137 " [function %d: considering candidate {@%d, index=%d, count=%d, " in Trace()
139 function_index_, candidate.node->id(), candidate.inlinee_index, in Trace()
140 candidate.call_count, candidate.wire_byte_size, decision); in Trace()
148 CandidateInfo candidate = inlining_candidates_.top(); in Finalize() local
150 Node* call = candidate in Finalize()
[all...]
/third_party/glslang/glslang/MachineIndependent/
H A DLiveTraverser.h75 TIntermAggregate* candidate = globals[f]->getAsAggregate(); in pushFunction() local
76 if (candidate && candidate->getOp() == EOpFunction && candidate->getName() == name) { in pushFunction()
77 destinations.push_back(candidate); in pushFunction()
87 TIntermAggregate* candidate = globals[f]->getAsAggregate(); in pushGlobalReference() local
88 if (candidate && candidate->getOp() == EOpSequence && in pushGlobalReference()
89 candidate->getSequence().size() == 1 && in pushGlobalReference()
90 candidate in pushGlobalReference()
[all...]
H A DParseContextBase.cpp354 // * list of candidate signatures to select from
367 // * best matching candidate (or none, if no viable candidates found)
382 // where each viable candidate has in selectFunction()
392 // 3. If there is only one viable candidate, it is the best match. in selectFunction()
394 // 4. If there are multiple viable candidates, select the first viable candidate in selectFunction()
395 // as the incumbent. Compare the incumbent to the next viable candidate, and if in selectFunction()
396 // that candidate is better (bullets below), make it the incumbent. Repeat, with in selectFunction()
397 // a linear walk through the viable candidate list. The final incumbent will be in selectFunction()
398 // returned as the best match. A viable candidate is better than the incumbent if in selectFunction()
403 // candidate, fo in selectFunction()
416 const TFunction& candidate = *(*it); selectFunction() local
481 const TFunction& candidate = *(*it); selectFunction() local
490 const TFunction& candidate = *(*it); selectFunction() local
[all...]
H A DSymbolTable.cpp291 tLevel::const_iterator candidate = level.lower_bound(name); in relateToOperator() local
292 while (candidate != level.end()) { in relateToOperator()
293 const TString& candidateName = (*candidate).first; in relateToOperator()
296 TFunction* function = (*candidate).second->getAsFunction(); in relateToOperator()
300 ++candidate; in relateToOperator()
308 tLevel::const_iterator candidate = level.lower_bound(name); in setFunctionExtensions() local
309 while (candidate != level.end()) { in setFunctionExtensions()
310 const TString& candidateName = (*candidate).first; in setFunctionExtensions()
313 TSymbol* symbol = candidate->second; in setFunctionExtensions()
317 ++candidate; in setFunctionExtensions()
[all...]
/third_party/node/test/fixtures/postject-copy/node_modules/commander/lib/
H A DsuggestSimilar.js63 candidates = candidates.map(candidate => candidate.slice(2));
69 candidates.forEach((candidate) => {
70 if (candidate.length <= 1) return; // no one character guesses
72 const distance = editDistance(word, candidate);
73 const length = Math.max(word.length, candidate.length);
79 similar = [candidate];
81 similar.push(candidate);
88 similar = similar.map(candidate => `--${candidate}`);
[all...]
/third_party/astc-encoder/Test/
H A Dastc_trace_analysis.py133 def add_candidate(self, candidate):
134 self.candidates.append(candidate)
204 for candidate in pas:
205 yield (block, pas, candidate)
240 for candidate in pas:
241 errorval = candidate.refinement_errors[-1]
245 best_candidate = candidate
247 # Every other return type must have both best pass and best candidate
305 for candidate in get_node(pas, "candidate", Tru
[all...]
/third_party/mesa3d/src/amd/compiler/
H A Daco_scheduler.cpp216 /* check if one of candidate's operands is killed by depending instruction */
254 /* move the candidate below the memory load */
363 /* check if candidate uses/kills an operand which is used by a dependency */
381 /* move the candidate above the insert_idx */
667 aco_ptr<Instruction>& candidate = block->instructions[candidate_idx];
676 if (candidate->opcode == aco_opcode::p_logical_start)
680 if ((candidate->isVMEM() || candidate->isFlatLike()) &&
685 if (candidate->format == Format::SMEM && current->operands[0].size() == 4 &&
686 candidate
[all...]
/third_party/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_program_pair.c42 int candidate = -1; in rc_pair_alloc_source() local
88 candidate = i; in rc_pair_alloc_source()
93 candidate = RC_PAIR_PRESUB_SRC; in rc_pair_alloc_source()
94 } else if (candidate < 0 || (rgb && rgb_used > 2) in rc_pair_alloc_source()
99 /* candidate >= 0 */ in rc_pair_alloc_source()
102 pair->RGB.Src[candidate].Used = 1; in rc_pair_alloc_source()
103 pair->RGB.Src[candidate].File = file; in rc_pair_alloc_source()
104 pair->RGB.Src[candidate].Index = index; in rc_pair_alloc_source()
105 if (candidate == RC_PAIR_PRESUB_SRC) { in rc_pair_alloc_source()
115 pair->Alpha.Src[candidate] in rc_pair_alloc_source()
[all...]
/third_party/node/deps/v8/src/utils/
H A Dversion.cc31 const char* candidate = IsCandidate() ? " (candidate)" : ""; in GetString() local
34 GetPatch(), GetEmbedder(), candidate); in GetString()
37 GetEmbedder(), candidate); in GetString()
45 const char* candidate = IsCandidate() ? "-candidate" : ""; in GetSONAME() local
48 GetBuild(), GetPatch(), GetEmbedder(), candidate); in GetSONAME()
51 GetEmbedder(), candidate); in GetSONAME()
/third_party/node/deps/v8/src/compiler/backend/
H A Dinstruction-scheduler.cc18 // the next best candidate to schedule. in AddNode()
30 auto candidate = nodes_.end(); in PopBestCandidate() local
34 candidate = iterator; in PopBestCandidate()
39 if (candidate != nodes_.end()) { in PopBestCandidate()
40 ScheduleGraphNode* result = *candidate; in PopBestCandidate()
41 nodes_.erase(candidate); in PopBestCandidate()
52 auto candidate = nodes_.begin(); in PopBestCandidate() local
53 std::advance(candidate, random_number_generator()->NextInt( in PopBestCandidate()
55 ScheduleGraphNode* result = *candidate; in PopBestCandidate()
56 nodes_.erase(candidate); in PopBestCandidate()
228 ScheduleGraphNode* candidate = ready_list.PopBestCandidate(cycle); Schedule() local
[all...]
/third_party/rust/crates/aho-corasick/src/packed/teddy/
H A Druntime.rs14 // let candidate = find_candidate_in_chunk(haystack, at)
15 // if not all zeroes(candidate):
16 // if match = verify(haystack, at, candidate):
20 // verification routine (for slim vs fat Teddy) and the candidate extraction
23 // In the code below, a "candidate" corresponds to a single vector with 8-bit
36 // When the mask length is 1, then finding the candidate is pretty straight
41 // bytes of the candidate for use when searching the next window. This is for
198 /// The candidate given should be a collection of 8-bit bitsets (one bitset
216 // Convert the candidate into 64-bit chunks, and then verify each of in verify128()
230 /// The candidate give
468 unsafe fn candidate(&self, haystack: &[u8], at: usize) -> __m128i { candidate() functions
518 unsafe fn candidate(&self, haystack: &[u8], at: usize) -> __m256i { candidate() functions
568 unsafe fn candidate(&self, haystack: &[u8], at: usize) -> __m256i { candidate() functions
623 unsafe fn candidate( candidate() functions
685 unsafe fn candidate( candidate() functions
751 unsafe fn candidate( candidate() functions
817 unsafe fn candidate( candidate() functions
887 unsafe fn candidate( candidate() functions
960 unsafe fn candidate( candidate() functions
[all...]
/third_party/node/lib/internal/crypto/
H A Drandom.js539 function checkPrime(candidate, options = kEmptyObject, callback) {
540 if (typeof candidate === 'bigint')
541 candidate = unsignedBigIntToBuffer(candidate, 'candidate');
542 if (!isAnyArrayBuffer(candidate) && !isArrayBufferView(candidate)) {
544 'candidate',
552 candidate,
568 const job = new CheckPrimeJob(kCryptoJobAsync, candidate, check
[all...]
/third_party/elfutils/lib/
H A Dnext_prime.c35 is_prime (size_t candidate) in is_prime() argument
41 while (sq < candidate && candidate % divn != 0) in is_prime()
51 return candidate % divn != 0; in is_prime()
/third_party/mesa3d/src/amd/vulkan/
H A Dradv_nir_lower_ray_queries.c161 struct ray_query_intersection_vars candidate; member
249 dst->candidate = in init_ray_query_vars()
281 rq_copy_var(b, index, vars->closest.barycentrics, vars->candidate.barycentrics, 0x3); in copy_candidate_to_closest()
283 vars->candidate.custom_instance_and_mask, 0x1); in copy_candidate_to_closest()
284 rq_copy_var(b, index, vars->closest.geometry_id_and_flags, vars->candidate.geometry_id_and_flags, in copy_candidate_to_closest()
286 rq_copy_var(b, index, vars->closest.instance_addr, vars->candidate.instance_addr, 0x1); in copy_candidate_to_closest()
287 rq_copy_var(b, index, vars->closest.instance_id, vars->candidate.instance_id, 0x1); in copy_candidate_to_closest()
288 rq_copy_var(b, index, vars->closest.intersection_type, vars->candidate.intersection_type, 0x1); in copy_candidate_to_closest()
289 rq_copy_var(b, index, vars->closest.opaque, vars->candidate.opaque, 0x1); in copy_candidate_to_closest()
290 rq_copy_var(b, index, vars->closest.frontface, vars->candidate in copy_candidate_to_closest()
[all...]
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/rsn_supp/
H A Dpreauth.c34 * pmksa_candidate_free - Free all entries in PMKSA candidate list
312 * Go through the PMKSA candidates and start pre-authentication if a candidate
318 struct rsn_pmksa_candidate *candidate, *n; in rsn_preauth_candidate_process() local
323 /* TODO: drop priority for old candidate entries */ in rsn_preauth_candidate_process()
325 wpa_msg(sm->ctx->msg_ctx, MSG_DEBUG, "RSN: processing PMKSA candidate " in rsn_preauth_candidate_process()
336 dl_list_for_each_safe(candidate, n, &sm->pmksa_candidates, in rsn_preauth_candidate_process()
339 p = pmksa_cache_get(sm->pmksa, candidate->bssid, NULL, NULL, 0); in rsn_preauth_candidate_process()
340 if (os_memcmp(sm->bssid, candidate->bssid, ETH_ALEN) != 0 && in rsn_preauth_candidate_process()
343 "candidate " MACSTR in rsn_preauth_candidate_process()
345 MAC2STR(candidate in rsn_preauth_candidate_process()
[all...]
/third_party/node/deps/v8/src/heap/
H A Dobjects-visiting.cc35 // Check whether to keep the candidate in the list. in VisitWeakList()
36 T candidate = T::cast(list); in VisitWeakList() local
41 list = WeakListVisitor<T>::WeakNext(candidate); in VisitWeakList()
61 candidate = T::cast(retained); in VisitWeakList()
62 tail = candidate; in VisitWeakList()
68 WeakListVisitor<T>::VisitPhantomObject(heap, candidate); in VisitWeakList()
81 T candidate = T::cast(list); in ClearWeakList() local
82 list = WeakListVisitor<T>::WeakNext(candidate); in ClearWeakList()
83 WeakListVisitor<T>::SetWeakNext(candidate, undefined); in ClearWeakList()
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/rsn_supp/
H A Dpreauth.c34 * pmksa_candidate_free - Free all entries in PMKSA candidate list
296 * Go through the PMKSA candidates and start pre-authentication if a candidate
302 struct rsn_pmksa_candidate *candidate, *n; in rsn_preauth_candidate_process() local
307 /* TODO: drop priority for old candidate entries */ in rsn_preauth_candidate_process()
309 wpa_msg(sm->ctx->msg_ctx, MSG_DEBUG, "RSN: processing PMKSA candidate " in rsn_preauth_candidate_process()
323 dl_list_for_each_safe(candidate, n, &sm->pmksa_candidates, in rsn_preauth_candidate_process()
326 p = pmksa_cache_get(sm->pmksa, candidate->bssid, NULL, NULL, 0); in rsn_preauth_candidate_process()
327 if (os_memcmp(sm->bssid, candidate->bssid, ETH_ALEN) != 0 && in rsn_preauth_candidate_process()
330 "candidate " MACSTR in rsn_preauth_candidate_process()
332 MAC2STR(candidate in rsn_preauth_candidate_process()
[all...]
/third_party/node/deps/brotli/c/enc/
H A Dcompress_fragment.c523 const uint8_t* candidate; in BrotliCompressFragmentFastImpl() local
536 candidate = ip - last_distance; in BrotliCompressFragmentFastImpl()
537 if (IsMatch(ip, candidate)) { in BrotliCompressFragmentFastImpl()
538 if (BROTLI_PREDICT_TRUE(candidate < ip)) { in BrotliCompressFragmentFastImpl()
543 candidate = base_ip + table[hash]; in BrotliCompressFragmentFastImpl()
544 BROTLI_DCHECK(candidate >= base_ip); in BrotliCompressFragmentFastImpl()
545 BROTLI_DCHECK(candidate < ip); in BrotliCompressFragmentFastImpl()
548 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate))); in BrotliCompressFragmentFastImpl()
550 /* Check copy distance. If candidate is not feasible, continue search. in BrotliCompressFragmentFastImpl()
552 if (ip - candidate > MAX_DISTANC in BrotliCompressFragmentFastImpl()
[all...]
H A Dcompress_fragment_two_pass.c284 const uint8_t* candidate; in CreateCommands() local
298 candidate = ip - last_distance; in CreateCommands()
299 if (IsMatch(ip, candidate, min_match)) { in CreateCommands()
300 if (BROTLI_PREDICT_TRUE(candidate < ip)) { in CreateCommands()
305 candidate = base_ip + table[hash]; in CreateCommands()
306 BROTLI_DCHECK(candidate >= base_ip); in CreateCommands()
307 BROTLI_DCHECK(candidate < ip); in CreateCommands()
310 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate, min_match))); in CreateCommands()
312 /* Check copy distance. If candidate is not feasible, continue search. in CreateCommands()
314 if (ip - candidate > MAX_DISTANC in CreateCommands()
[all...]
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dcompress_fragment.c523 const uint8_t* candidate; in BrotliCompressFragmentFastImpl() local
536 candidate = ip - last_distance; in BrotliCompressFragmentFastImpl()
537 if (IsMatch(ip, candidate)) { in BrotliCompressFragmentFastImpl()
538 if (BROTLI_PREDICT_TRUE(candidate < ip)) { in BrotliCompressFragmentFastImpl()
543 candidate = base_ip + table[hash]; in BrotliCompressFragmentFastImpl()
544 BROTLI_DCHECK(candidate >= base_ip); in BrotliCompressFragmentFastImpl()
545 BROTLI_DCHECK(candidate < ip); in BrotliCompressFragmentFastImpl()
548 } while (BROTLI_PREDICT_TRUE(!IsMatch(ip, candidate))); in BrotliCompressFragmentFastImpl()
550 /* Check copy distance. If candidate is not feasible, continue search. in BrotliCompressFragmentFastImpl()
552 if (ip - candidate > MAX_DISTANC in BrotliCompressFragmentFastImpl()
[all...]
/third_party/skia/third_party/externals/brotli/research/
H A Ddurchschlag.cc498 TextIdx candidate = 0; in durchschlagGenerateExclusive() local
501 candidate = candidates[maxScore]; in durchschlagGenerateExclusive()
502 candidates[maxScore] = next[candidate]; in durchschlagGenerateExclusive()
514 for (size_t j = candidate; j < candidate + span; ++j) { in durchschlagGenerateExclusive()
523 next[candidate] = candidates[score]; in durchschlagGenerateExclusive()
524 candidates[score] = candidate; in durchschlagGenerateExclusive()
537 for (TextIdx j = candidate; j < candidate + span; ++j) { in durchschlagGenerateExclusive()
541 addRange(&ranges, candidate, candidat in durchschlagGenerateExclusive()
603 TextIdx candidate = candidates[0].position; durchschlagGenerateCollaborative() local
[all...]

Completed in 16 milliseconds

12345678