| /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)
41 var candidates = [readableFile]
42 var found = configure.test.findAccessibleSync('test', dir, candidates)
49 var candidates = [readableFileInDir]
50 var found = configure.test.findAccessibleSync('test', dir, candidates)
57 var candidates = ['unreadable_file']
58 var found = configure.test.findAccessibleSync('test', dir, candidates)
65 var candidates = ['non_existent_file', 'unreadable_file']
66 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/mindspore/mindspore/ccsrc/backend/optimizer/graph_kernel/ |
| D | graph_kernel_cluster.cc | 198 void Merge(const std::vector<size_t> &candidates) { in Merge() argument
199 size_t min_id = *std::min_element(candidates.begin(), candidates.end()); in Merge()
200 for (auto id : candidates) { in Merge()
274 void RemoveCircle(std::vector<size_t> *candidates) { in RemoveCircle() argument
275 if (candidates->size() <= 1) { in RemoveCircle()
279 candidates_.insert(candidates->begin(), candidates->end()); in RemoveCircle()
280 for (auto iter = candidates->begin(); iter != candidates->end(); ++iter) { in RemoveCircle()
287 (void)candidates->erase(std::remove_if(candidates->begin(), candidates->end(), in RemoveCircle()
289 candidates->end()); in RemoveCircle()
362 std::vector<size_t> candidates; in FindCandidates() local
[all …]
|
| D | parallel_fusion.cc | 474 size_t origin_size, const AnfNodePtrList &candidates, std::map<AnfNodePtr, int> *origin_indices, in DoSearchInSortedCandidates() argument
486 std::vector<bool> sorted_candidates_used(candidates.size(), false); in DoSearchInSortedCandidates()
488 for (size_t i = 0; i < candidates.size(); ++i) { in DoSearchInSortedCandidates()
512 … GetAvaliableNodesByOffset(SizeToInt(i), tc, sorted_candidates_used, candidates, std::set<int>()); in DoSearchInSortedCandidates()
527 … GetAvaliableNodesByOffset(SizeToInt(i), tc, sorted_candidates_used, candidates, std::set<int>()); in DoSearchInSortedCandidates()
548 …origin_candidates_used[IntToSize(get_index(origin_indices, candidates[parallel_infos.size()]))] = … in DoSearchInSortedCandidates()
573 AnfNodePtrList candidates; in SearchFuseNodesInCandidates() local
575 candidates.push_back(cs[indices[i]]); in SearchFuseNodesInCandidates()
579 for (size_t i = 0; i < candidates.size(); ++i) { in SearchFuseNodesInCandidates()
580 (void)sorted_indices.emplace(candidates[i], i); in SearchFuseNodesInCandidates()
[all …]
|
| /third_party/parse5/packages/parse5/lib/parser/ |
| D | formatting-element-list.js | 19 const candidates = [];
42 candidates.push({ idx: i, attrs: elementAttrs });
47 return candidates.length < NOAH_ARK_CAPACITY ? [] : candidates;
51 const candidates = this._getNoahArkConditionCandidates(newElement);
52 let cLength = candidates.length;
68 const cAttr = candidates[j].attrs[i];
71 candidates.splice(j, 1);
75 if (candidates.length < NOAH_ARK_CAPACITY) {
83 this.entries.splice(candidates[i].idx, 1);
|
| /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/flutter/skia/third_party/externals/icu/source/common/ |
| D | dictbe.cpp | 108 int32_t candidates( UText *text, DictionaryMatcher *dict, int32_t rangeEnd );
129 int32_t PossibleWord::candidates( UText *text, DictionaryMatcher *dict, int32_t rangeEnd ) { in candidates() function in PossibleWord
247 … int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange() local
250 if (candidates == 1) { in divideUpDictionaryRange()
256 else if (candidates > 1) { in divideUpDictionaryRange()
263 … if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
278 … if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
305 if (words[wordsFound % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
328 …int32_t num_candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, ra… in divideUpDictionaryRange()
362 if (words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
[all …]
|
| /third_party/icu/icu4c/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/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 | 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()
|
| 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()
|
| /third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | ThaiBreakEngine.java | 123 … int candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange() local
126 if (candidates == 1) { in divideUpDictionaryRange()
132 else if (candidates > 1) { in divideUpDictionaryRange()
137 … if (words[(wordsFound+1)%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
149 … if (words[(wordsFound+2)%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
172 … if (words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
192 … int candidate = words[(wordsFound + 1) %THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
226 … if (words[wordsFound%THAI_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
|
| D | KhmerBreakEngine.java | 113 … int candidates = words[wordsFound % KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange() local
116 if (candidates == 1) { in divideUpDictionaryRange()
122 else if (candidates > 1) { in divideUpDictionaryRange()
127 … if (words[(wordsFound+1)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
139 … if (words[(wordsFound+2)%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
161 … if (words[wordsFound%KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
177 … int candidate = words[(wordsFound + 1) %KHMER_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
|
| D | BurmeseBreakEngine.java | 109 … int candidates = words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange() local
112 if (candidates == 1) { in divideUpDictionaryRange()
118 else if (candidates > 1) { in divideUpDictionaryRange()
123 … if (words[(wordsFound+1)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
135 … if (words[(wordsFound+2)%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
157 … if (words[wordsFound%BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
173 …int candidate = words[(wordsFound + 1) %BURMESE_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd… in divideUpDictionaryRange()
|
| D | LaoBreakEngine.java | 112 … int candidates = words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange() local
115 if (candidates == 1) { in divideUpDictionaryRange()
121 else if (candidates > 1) { in divideUpDictionaryRange()
126 … if (words[(wordsFound+1)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
138 … if (words[(wordsFound+2)%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
160 if (words[wordsFound%LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd) <= 0 && in divideUpDictionaryRange()
176 … int candidate = words[(wordsFound + 1) %LAO_LOOKAHEAD].candidates(fIter, fDictionary, rangeEnd); in divideUpDictionaryRange()
|
| /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 | 113 std::vector<uint32_t> candidates; in ChooseScalarOrCompositeType() local
122 candidates.push_back(inst.result_id()); in ChooseScalarOrCompositeType()
129 candidates.push_back(inst.result_id()); in ChooseScalarOrCompositeType()
136 assert(!candidates.empty() && in ChooseScalarOrCompositeType()
140 return candidates[GetFuzzerContext()->RandomIndex(candidates)]; in ChooseScalarOrCompositeType()
|
| D | fuzzer_pass_replace_opphi_ids_from_dead_predecessors.cpp | 80 const auto& candidates = FindAvailableInstructions( in Apply() local
93 if (candidates.empty()) { in Apply()
99 candidates[GetFuzzerContext()->RandomIndex(candidates)] in Apply()
|
| /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/node/deps/icu-small/source/common/ |
| D | dictbe.cpp | 113 int32_t candidates( UText *text, DictionaryMatcher *dict, int32_t rangeEnd );
134 int32_t PossibleWord::candidates( UText *text, DictionaryMatcher *dict, int32_t rangeEnd ) { in candidates() function in PossibleWord
256 … int32_t candidates = words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd); in divideUpDictionaryRange() local
259 if (candidates == 1) { in divideUpDictionaryRange()
265 else if (candidates > 1) { in divideUpDictionaryRange()
271 … if (words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) > 0) { in divideUpDictionaryRange()
283 … if (words[(wordsFound + 2) % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd)) { in divideUpDictionaryRange()
310 if (words[wordsFound % THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
333 …int32_t num_candidates = words[(wordsFound + 1) % THAI_LOOKAHEAD].candidates(text, fDictionary, ra… in divideUpDictionaryRange()
367 if (words[wordsFound%THAI_LOOKAHEAD].candidates(text, fDictionary, rangeEnd) <= 0 in divideUpDictionaryRange()
[all …]
|
| /third_party/mesa3d/src/gallium/drivers/r600/sfn/ |
| D | sfn_instruction_export.cpp | 41 void WriteoutInstruction::replace_values(const ValueSet& candidates, PValue new_value) in replace_values() argument
44 for (auto c: candidates) { in replace_values()
49 replace_values_child(candidates, new_value); in replace_values()
52 void WriteoutInstruction::replace_values_child(UNUSED const ValueSet& candidates, in replace_values_child() argument
171 void WriteScratchInstruction::replace_values_child(const ValueSet& candidates, PValue new_value) in replace_values_child() argument
176 for (auto c: candidates) { in replace_values_child()
307 void MemRingOutIntruction::replace_values_child(const ValueSet& candidates, in replace_values_child() argument
313 for (auto c: candidates) { in replace_values_child()
|
| /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 {})
|