| /third_party/node/deps/npm/node_modules/node-gyp/test/ |
| D | test-find-accessible-sync.js | 33 var candidates = []
34 var found = configure.test.findAccessibleSync('test', dir, candidates)
39 var candidates = [readableFile]
40 var found = configure.test.findAccessibleSync('test', dir, candidates)
45 var candidates = [readableFileInDir]
46 var found = configure.test.findAccessibleSync('test', dir, candidates)
51 var candidates = ['unreadable_file']
52 var found = configure.test.findAccessibleSync('test', dir, candidates)
57 var candidates = ['non_existent_file', 'unreadable_file']
58 var found = configure.test.findAccessibleSync('test', dir, candidates)
[all …]
|
| /third_party/skia/third_party/externals/brotli/research/ |
| D | durchschlag.cc | 80 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->size() > CANDIDATE_BUNDLE_SIZE && maxScore != minScore) { in buildCandidatesList()
143 while (candidates->at(0).score == minScore) { in buildCandidatesList()
144 std::pop_heap(candidates->begin(), candidates->end(), greaterScore()); in buildCandidatesList()
[all …]
|
| /third_party/node/test/fixtures/postject-copy/node_modules/commander/lib/ |
| D | suggestSimilar.js | 55 function suggestSimilar(word, candidates) { argument
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/skia/third_party/externals/icu/source/common/ |
| D | dictbe.cpp | 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(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
280 … if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
307 if (words[wordsFound % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
330 …int32_t num_candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, ra… in divideUpDictionaryRange()
364 if (words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
[all …]
|
| /third_party/icu/icu4c/source/common/ |
| D | dictbe.cpp | 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(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
288 … if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
315 if (words[wordsFound % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
338 …int32_t num_candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, ra… in divideUpDictionaryRange()
372 if (words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
[all …]
|
| /third_party/node/deps/icu-small/source/common/ |
| D | dictbe.cpp | 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(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
288 … if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
315 if (words[wordsFound % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
338 …int32_t num_candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, ra… in divideUpDictionaryRange()
372 if (words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
[all …]
|
| /third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
| D | ThaiBreakEngine.java | 124 … int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange() local
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()
|
| D | KhmerBreakEngine.java | 114 … int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange() local
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()
|
| D | BurmeseBreakEngine.java | 110 … int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange() local
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()
|
| D | LaoBreakEngine.java | 113 … int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange() local
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()
|
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/breakiter/ |
| D | ThaiBreakEngine.java | 118 … int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange() local
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()
|
| D | KhmerBreakEngine.java | 108 … int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange() local
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()
|
| D | BurmeseBreakEngine.java | 100 … int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange() local
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()
|
| D | LaoBreakEngine.java | 108 … int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange() local
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()
|
| /third_party/skia/third_party/externals/spirv-tools/source/fuzz/ |
| D | fuzzer_pass_add_composite_types.cpp | 114 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()
|
| D | fuzzer_pass_replace_opphi_ids_from_dead_predecessors.cpp | 81 const auto& candidates = FindAvailableInstructions( in Apply() local
94 if (candidates.empty()) { in Apply()
100 candidates[GetFuzzerContext()->RandomIndex(candidates)] in Apply()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/fuzz/ |
| D | fuzzer_pass_add_composite_types.cpp | 114 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()
|
| D | fuzzer_pass_replace_opphi_ids_from_dead_predecessors.cpp | 81 const auto& candidates = FindAvailableInstructions( in Apply() local
94 if (candidates.empty()) { in Apply()
100 candidates[GetFuzzerContext()->RandomIndex(candidates)] in Apply()
|
| /third_party/spirv-tools/source/fuzz/ |
| D | fuzzer_pass_add_composite_types.cpp | 114 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()
|
| D | fuzzer_pass_replace_opphi_ids_from_dead_predecessors.cpp | 81 const auto& candidates = FindAvailableInstructions( in Apply() local
94 if (candidates.empty()) { in Apply()
100 candidates[GetFuzzerContext()->RandomIndex(candidates)] in Apply()
|
| /third_party/parse5/packages/parse5/lib/parser/ |
| D | formatting-element-list.ts | 40 const candidates = [];
62 candidates.push({ idx: i, attrs: elementAttrs });
67 return candidates;
74 const candidates = this._getNoahArkConditionCandidates(newElement, neAttrs); constant
76 if (candidates.length < NOAH_ARK_CAPACITY) return;
83 for (let i = 0; i < candidates.length; i++) {
84 const candidate = candidates[i];
|
| /third_party/node/deps/npm/node_modules/node-gyp/lib/ |
| D | configure.js | 182 var candidates
185 candidates = [
194 candidates = [
206 nodeExpFile = findAccessibleSync(logprefix, nodeRootDir, candidates)
231 candidates = [
237 zoslibIncPath = findAccessibleSync(logprefix, nodeRootDir, candidates)
241 'that contains zos-base.h', candidates.toString(), nodeRootDir)
338 function findAccessibleSync (logprefix, dir, candidates) { argument
339 for (var next = 0; next < candidates.length; next++) {
340 var candidate = path.resolve(dir, candidates[next])
|
| /third_party/typescript/tests/baselines/reference/ |
| D | genericCallWithFunctionTypedArguments3.types | 26 var r = foo4(a); // T is {} (candidates boolean and string), U is any (candidates any and boolean)
42 var r2 = foo4(b); // T is {} (candidates boolean and {}), U is any (candidates any and {})
|
| /third_party/node/deps/v8/src/compiler/ |
| D | fast-api-calls.cc | 38 Zone* zone, const FastApiCallFunctionVector& candidates, in ResolveOverloads() argument
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()
|
| /third_party/mesa3d/src/compiler/nir/ |
| D | nir_opt_preamble.c | 421 def_state **candidates = malloc(sizeof(*candidates) * num_candidates); in nir_opt_preamble() local
470 candidates[candidate_idx++] = state; in nir_opt_preamble()
482 free(candidates); in nir_opt_preamble()
494 qsort(candidates, num_candidates, sizeof(*candidates), candidate_sort); in nir_opt_preamble()
499 def_state *state = candidates[i]; in nir_opt_preamble()
513 free(candidates); in nir_opt_preamble()
|