Home
last modified time | relevance | path

Searched refs:candidates (Results 1 - 25 of 165) sorted by relevance

1234567

/third_party/skia/third_party/externals/brotli/research/
H A Ddurchschlag.cc80 static Score buildCandidatesList(std::vector<Candidate>* candidates, in buildCandidatesList() argument
83 candidates->resize(0); in buildCandidatesList()
117 candidates->push_back({score, i}); in buildCandidatesList()
126 std::make_heap(candidates->begin(), candidates->end(), greaterScore()); in buildCandidatesList()
127 Score minScore = candidates->at(0).score; in buildCandidatesList()
140 candidates->push_back({score, i}); in buildCandidatesList()
141 std::push_heap(candidates->begin(), candidates->end(), greaterScore()); in buildCandidatesList()
142 if (candidates in buildCandidatesList()
168 rebuildCandidatesList(std::vector<TextIdx>* candidates, std::vector<MetaSlot>* map, TextIdx span, const TextIdx* shortcut, TextIdx end, TextIdx* next) rebuildCandidatesList() argument
477 std::vector<TextIdx> candidates; durchschlagGenerateExclusive() local
583 std::vector<Candidate> candidates; durchschlagGenerateCollaborative() local
[all...]
/third_party/node/test/fixtures/postject-copy/node_modules/commander/lib/
H A DsuggestSimilar.js51 * @param {string[]} candidates
55 function suggestSimilar(word, candidates) {
56 if (!candidates || candidates.length === 0) return '';
58 candidates = Array.from(new Set(candidates));
63 candidates = candidates.map(candidate => candidate.slice(2));
69 candidates.forEach((candidate) => {
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/breakiter/
H A DBurmeseBreakEngine.java100 int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
103 if (candidates == 1) { in divideUpDictionaryRange()
109 else if (candidates > 1) { in divideUpDictionaryRange()
114 if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
126 if (words[(wordsFound+2)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
148 if (words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
164 int candidate = words[(wordsFound + 1) %BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
H A DKhmerBreakEngine.java108 int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
111 if (candidates == 1) { in divideUpDictionaryRange()
117 else if (candidates > 1) { in divideUpDictionaryRange()
122 if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
134 if (words[(wordsFound+2)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
156 if (words[wordsFound%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
172 int candidate = words[(wordsFound + 1) %KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
H A DLaoBreakEngine.java108 int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
111 if (candidates == 1) { in divideUpDictionaryRange()
117 else if (candidates > 1) { in divideUpDictionaryRange()
122 if (words[(wordsFound+1)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
134 if (words[(wordsFound+2)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
156 if (words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
172 int candidate = words[(wordsFound + 1) %LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
H A DThaiBreakEngine.java118 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
121 if (candidates == 1) { in divideUpDictionaryRange()
127 else if (candidates > 1) { in divideUpDictionaryRange()
132 if (words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
144 if (words[(wordsFound+2)%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
167 if (words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
187 int candidate = words[(wordsFound + 1) %THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
221 if (words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DBurmeseBreakEngine.java110 int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
113 if (candidates == 1) { in divideUpDictionaryRange()
119 else if (candidates > 1) { in divideUpDictionaryRange()
125 if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
140 if (words[(wordsFound+2)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
162 if (words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
178 int candidate = words[(wordsFound + 1) %BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
H A DKhmerBreakEngine.java114 int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
117 if (candidates == 1) { in divideUpDictionaryRange()
123 else if (candidates > 1) { in divideUpDictionaryRange()
129 if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
144 if (words[(wordsFound+2)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
166 if (words[wordsFound%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
182 int candidate = words[(wordsFound + 1) %KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
H A DLaoBreakEngine.java113 int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
116 if (candidates == 1) { in divideUpDictionaryRange()
122 else if (candidates > 1) { in divideUpDictionaryRange()
128 if (words[(wordsFound+1)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
143 if (words[(wordsFound+2)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
165 if (words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
181 int candidate = words[(wordsFound + 1) %LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
H A DThaiBreakEngine.java124 int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
127 if (candidates == 1) { in divideUpDictionaryRange()
133 else if (candidates > 1) { in divideUpDictionaryRange()
139 if (words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
154 if (words[(wordsFound+2)%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
177 if (words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
197 int candidate = words[(wordsFound + 1) %THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
231 if (words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
/third_party/icu/icu4c/source/common/
H A Ddictbe.cpp104 int32_t count; // Count of candidates
106 int32_t offset; // Offset in the text of these candidates
116 // Fill the list of candidates if needed, select the longest, and return the number found
117 int32_t candidates( UText *text, DictionaryMatcher *dict, int32_t rangeEnd );
138 int32_t PossibleWord::candidates( UText *text, DictionaryMatcher *dict, int32_t rangeEnd ) { in candidates() function in PossibleWord
261 int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange() local
264 if (candidates == 1) { in divideUpDictionaryRange()
270 else if (candidates > 1) { in divideUpDictionaryRange()
276 if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(tex in divideUpDictionaryRange()
497 int32_t candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); divideUpDictionaryRange() local
690 int32_t candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); divideUpDictionaryRange() local
896 int32_t candidates = words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); divideUpDictionaryRange() local
[all...]
/third_party/node/deps/icu-small/source/common/
H A Ddictbe.cpp104 int32_t count; // Count of candidates
106 int32_t offset; // Offset in the text of these candidates
116 // Fill the list of candidates if needed, select the longest, and return the number found
117 int32_t candidates( UText *text, DictionaryMatcher *dict, int32_t rangeEnd );
138 int32_t PossibleWord::candidates( UText *text, DictionaryMatcher *dict, int32_t rangeEnd ) { in candidates() function in PossibleWord
261 int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange() local
264 if (candidates == 1) { in divideUpDictionaryRange()
270 else if (candidates > 1) { in divideUpDictionaryRange()
276 if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(tex in divideUpDictionaryRange()
497 int32_t candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); divideUpDictionaryRange() local
690 int32_t candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); divideUpDictionaryRange() local
896 int32_t candidates = words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); divideUpDictionaryRange() local
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Ddictbe.cpp98 int32_t count; // Count of candidates
100 int32_t offset; // Offset in the text of these candidates
110 // Fill the list of candidates if needed, select the longest, and return the number found
111 int32_t candidates( UText *text, DictionaryMatcher *dict, int32_t rangeEnd );
132 int32_t PossibleWord::candidates( UText *text, DictionaryMatcher *dict, int32_t rangeEnd ) { in candidates() function in PossibleWord
253 int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange() local
256 if (candidates == 1) { in divideUpDictionaryRange()
262 else if (candidates > 1) { in divideUpDictionaryRange()
268 if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(tex in divideUpDictionaryRange()
487 int32_t candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); divideUpDictionaryRange() local
679 int32_t candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); divideUpDictionaryRange() local
883 int32_t candidates = words[wordsFound%KHMER_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); divideUpDictionaryRange() local
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/fuzz/
H A Dfuzzer_pass_add_composite_types.cpp114 std::vector<uint32_t> candidates; in ChooseScalarOrCompositeType() local
123 candidates.push_back(inst.result_id()); in ChooseScalarOrCompositeType()
130 candidates.push_back(inst.result_id()); in ChooseScalarOrCompositeType()
137 assert(!candidates.empty() && in ChooseScalarOrCompositeType()
141 return candidates[GetFuzzerContext()->RandomIndex(candidates)]; in ChooseScalarOrCompositeType()
H A Dfuzzer_pass_replace_opphi_ids_from_dead_predecessors.cpp81 const auto& candidates = FindAvailableInstructions( in Apply()
94 if (candidates.empty()) { in Apply()
98 // Choose one of the candidates. in Apply()
100 candidates[GetFuzzerContext()->RandomIndex(candidates)] in Apply()
H A Dfuzzer_pass_merge_function_returns.cpp193 const auto& candidates = in Apply() local
196 candidates[GetFuzzerContext()->RandomIndex(candidates)]; in Apply()
301 auto& candidates = in GetInfoNeededForMergeBlocks()
304 candidates[this->GetFuzzerContext()->RandomIndex(candidates)]); in GetInfoNeededForMergeBlocks()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/
H A Dfuzzer_pass_add_composite_types.cpp114 std::vector<uint32_t> candidates; in ChooseScalarOrCompositeType() local
123 candidates.push_back(inst.result_id()); in ChooseScalarOrCompositeType()
130 candidates.push_back(inst.result_id()); in ChooseScalarOrCompositeType()
137 assert(!candidates.empty() && in ChooseScalarOrCompositeType()
141 return candidates[GetFuzzerContext()->RandomIndex(candidates)]; in ChooseScalarOrCompositeType()
H A Dfuzzer_pass_replace_opphi_ids_from_dead_predecessors.cpp81 const auto& candidates = FindAvailableInstructions( in Apply()
94 if (candidates.empty()) { in Apply()
98 // Choose one of the candidates. in Apply()
100 candidates[GetFuzzerContext()->RandomIndex(candidates)] in Apply()
H A Dfuzzer_pass_merge_function_returns.cpp193 const auto& candidates = in Apply() local
196 candidates[GetFuzzerContext()->RandomIndex(candidates)]; in Apply()
301 auto& candidates = in GetInfoNeededForMergeBlocks()
304 candidates[this->GetFuzzerContext()->RandomIndex(candidates)]); in GetInfoNeededForMergeBlocks()
/third_party/spirv-tools/source/fuzz/
H A Dfuzzer_pass_add_composite_types.cpp114 std::vector<uint32_t> candidates; in ChooseScalarOrCompositeType() local
123 candidates.push_back(inst.result_id()); in ChooseScalarOrCompositeType()
130 candidates.push_back(inst.result_id()); in ChooseScalarOrCompositeType()
137 assert(!candidates.empty() && in ChooseScalarOrCompositeType()
141 return candidates[GetFuzzerContext()->RandomIndex(candidates)]; in ChooseScalarOrCompositeType()
H A Dfuzzer_pass_replace_opphi_ids_from_dead_predecessors.cpp81 const auto& candidates = FindAvailableInstructions( in Apply()
94 if (candidates.empty()) { in Apply()
98 // Choose one of the candidates. in Apply()
100 candidates[GetFuzzerContext()->RandomIndex(candidates)] in Apply()
H A Dfuzzer_pass_merge_function_returns.cpp193 const auto& candidates = in Apply() local
196 candidates[GetFuzzerContext()->RandomIndex(candidates)]; in Apply()
301 auto& candidates = in GetInfoNeededForMergeBlocks()
304 candidates[this->GetFuzzerContext()->RandomIndex(candidates)]); in GetInfoNeededForMergeBlocks()
/third_party/node/deps/v8/src/compiler/
H A Dfast-api-calls.cc38 Zone* zone, const FastApiCallFunctionVector& candidates, in ResolveOverloads()
47 DCHECK_EQ(candidates.size(), 2); in ResolveOverloads()
55 for (size_t i = 0; i < candidates.size(); i++) { in ResolveOverloads()
57 candidates[i].signature->ArgumentInfo(arg_index + kReceiver); in ResolveOverloads()
37 ResolveOverloads( Zone* zone, const FastApiCallFunctionVector& candidates, unsigned int arg_count) ResolveOverloads() argument
/third_party/rust/crates/clap/src/parser/features/
H A Dsuggestions.rs16 let mut candidates: Vec<(f64, String)> = possible_values variables
24 candidates.sort_by(|a, b| a.0.partial_cmp(&b.0).unwrap_or(Ordering::Equal));
25 candidates.into_iter().map(|(_, pv)| pv).collect()
/third_party/python/Tools/c-analyzer/c_analyzer/
H A Danalyze.py164 candidates = []
177 candidates.append(typedecl)
178 if not candidates:
180 elif len(candidates) == 1:
181 winner, = candidates
191 raise NotImplementedError((decl, candidates))

Completed in 14 milliseconds

1234567