Home
last modified time | relevance | path

Searched refs:permutations (Results 1 - 25 of 32) sorted by relevance

12

/third_party/rust/crates/env_logger/ci/src/
H A Dpermute.rs7 let mut permutations = BTreeSet::new(); in all() variables
10 return permutations; in all()
13 permutations.insert(input.iter().cloned().collect()); in all()
24 permutations.insert(pt); in all()
29 permutations in all()
/third_party/skia/third_party/externals/tint/tools/src/cmd/intrinsic-gen/gen/
H A Dpermutate.go27 // Permuter generates permutations of intrinsic overloads
58 // Permute generates a set of permutations for the given intrinsic overload
73 // permutate may be chained to generate N-dimensional permutations.
122 permutations, err := state.permutateFQN(param.Type)
126 if len(permutations) == 0 {
127 return fmt.Errorf("parameter %v has no permutations", i)
129 for _, fqn := range permutations {
151 return nil, fmt.Errorf("open type %v has no permutations", t.Name)
163 var permutations []sem.FullyQualifiedName var
166 permutations, er
[all...]
/third_party/icu/icu4c/source/test/intltest/
H A Dcanittst.cpp133 Hashtable *permutations = new Hashtable(false, status); in TestBasic() local
134 permutations->setValueDeleter(uprv_deleteUObject); in TestBasic()
137 CanonicalIterator::permute(toPermute, false, permutations, status); in TestBasic()
141 expectEqual("Simple permutation ", "", collectionToString(permutations), "ABC, ACB, BAC, BCA, CAB, CBA"); in TestBasic()
143 delete permutations; in TestBasic()
/third_party/icu/icu4c/source/common/
H A Dcaniter.cpp264 * @param source the string to find permutations for
312 // see what the permutations of the characters before and after this one are in permute()
346 Hashtable permutations(status); in getEquivalents()
352 permutations.setValueDeleter(uprv_deleteUObject); in getEquivalents()
359 // now get all the permutations in getEquivalents()
372 permutations.removeAll(); in getEquivalents()
373 permute(item, CANITER_SKIP_ZEROES, &permutations, status); in getEquivalents()
376 //Iterator it2 = permutations.iterator(); in getEquivalents()
377 ne2 = permutations.nextElement(el2); in getEquivalents()
395 ne2 = permutations in getEquivalents()
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dcaniter.cpp264 * @param source the string to find permutations for
312 // see what the permutations of the characters before and after this one are in permute()
346 Hashtable permutations(status); in getEquivalents()
352 permutations.setValueDeleter(uprv_deleteUObject); in getEquivalents()
359 // now get all the permutations in getEquivalents()
372 permutations.removeAll(); in getEquivalents()
373 permute(item, CANITER_SKIP_ZEROES, &permutations, status); in getEquivalents()
376 //Iterator it2 = permutations.iterator(); in getEquivalents()
377 ne2 = permutations.nextElement(el2); in getEquivalents()
395 ne2 = permutations in getEquivalents()
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Dcaniter.cpp264 * @param source the string to find permutations for
312 // see what the permutations of the characters before and after this one are in permute()
346 Hashtable permutations(status); in getEquivalents()
352 permutations.setValueDeleter(uprv_deleteUObject); in getEquivalents()
359 // now get all the permutations in getEquivalents()
372 permutations.removeAll(); in getEquivalents()
373 permute(item, CANITER_SKIP_ZEROES, &permutations, status); in getEquivalents()
376 //Iterator it2 = permutations.iterator(); in getEquivalents()
377 ne2 = permutations.nextElement(el2); in getEquivalents()
395 ne2 = permutations in getEquivalents()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DCanonicalIterator.java160 * @param source the string to find permutations for
193 // see what the permutations of the characters before and after this one are in permute()
253 Set<String> permutations = new HashSet<String>(); in getEquivalents()
255 // now get all the permutations in getEquivalents()
261 permutations.clear(); in getEquivalents()
262 permute(item, SKIP_ZEROS, permutations); in getEquivalents()
263 Iterator<String> it2 = permutations.iterator(); in getEquivalents()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DCanonicalIterator.java156 * @param source the string to find permutations for
189 // see what the permutations of the characters before and after this one are in permute()
249 Set<String> permutations = new HashSet<String>(); in getEquivalents()
251 // now get all the permutations in getEquivalents()
257 permutations.clear(); in getEquivalents()
258 permute(item, SKIP_ZEROS, permutations); in getEquivalents()
259 Iterator<String> it2 = permutations.iterator(); in getEquivalents()
/third_party/node/test/pummel/
H A Dtest-policy-integrity-worker-commonjs.js236 function permutations(configurations, path = {}) { function
244 return permutations(otherConfigs, { ...path, [config]: value });
258 for (const permutation of permutations({
370 debug(`spawning ${tests.size} policy integrity permutations`);
H A Dtest-policy-integrity-worker-module.js236 function permutations(configurations, path = {}) { function
244 return permutations(otherConfigs, { ...path, [config]: value });
258 for (const permutation of permutations({
368 debug(`spawning ${tests.size} policy integrity permutations`);
H A Dtest-policy-integrity-dep.js219 function permutations(configurations, path = {}) { function
227 return permutations(otherConfigs, { ...path, [config]: value });
241 for (const permutation of permutations({
360 debug(`spawning ${tests.size} policy integrity permutations`);
H A Dtest-policy-integrity-parent-commonjs.js219 function permutations(configurations, path = {}) { function
227 return permutations(otherConfigs, { ...path, [config]: value });
241 for (const permutation of permutations({
347 debug(`spawning ${tests.size} policy integrity permutations`);
H A Dtest-policy-integrity-parent-module.js219 function permutations(configurations, path = {}) { function
227 return permutations(otherConfigs, { ...path, [config]: value });
241 for (const permutation of permutations({
347 debug(`spawning ${tests.size} policy integrity permutations`);
H A Dtest-policy-integrity-parent-no-package-json.js219 function permutations(configurations, path = {}) { function
227 return permutations(otherConfigs, { ...path, [config]: value });
241 for (const permutation of permutations({
319 debug(`spawning ${tests.size} policy integrity permutations`);
H A Dtest-policy-integrity-worker-no-package-json.js236 function permutations(configurations, path = {}) { function
244 return permutations(otherConfigs, { ...path, [config]: value });
258 for (const permutation of permutations({
340 debug(`spawning ${tests.size} policy integrity permutations`);
/third_party/littlefs/runners/
H A Dtest_runner.c277 // clear cache between permutations in test_define_flush()
296 size_t permutations; member
328 // first figure out the total size of override permutations in test_define_suite()
330 size_t permutations = 1; in test_define_suite() local
341 permutations *= test_overrides[i].permutations; in test_define_suite()
347 test_override_define_permutations = permutations; in test_define_suite()
350 if (count * permutations > test_override_define_capacity) { in test_define_suite()
352 size_t ncapacity = 1 << lfs_npw2(count * permutations); in test_define_suite()
361 sizeof(test_define_t) * count * permutations); in test_define_suite()
[all...]
H A Dbench_runner.c264 // clear cache between permutations in bench_define_flush()
283 size_t permutations; member
315 // first figure out the total size of override permutations in bench_define_suite()
317 size_t permutations = 1; in bench_define_suite() local
328 permutations *= bench_overrides[i].permutations; in bench_define_suite()
334 bench_override_define_permutations = permutations; in bench_define_suite()
337 if (count * permutations > bench_override_define_capacity) { in bench_define_suite()
339 size_t ncapacity = 1 << lfs_npw2(count * permutations); in bench_define_suite()
348 sizeof(bench_define_t) * count * permutations); in bench_define_suite()
[all...]
H A Dbench_runner.h56 size_t permutations; member
H A Dtest_runner.h49 size_t permutations; member
/third_party/vk-gl-cts/modules/gles2/scripts/
H A Dgen-qualification_order.py203 for p in itertools.permutations(f):
210 for p in itertools.permutations(f):
/third_party/python/Lib/test/
H A Dtest_itertools.py257 for indices in permutations(range(n), r):
390 self.assertRaises(TypeError, permutations) # too few arguments
391 self.assertRaises(TypeError, permutations, 'abc', 2, 1) # too many arguments
392 self.assertRaises(TypeError, permutations, None) # pool is not iterable
393 self.assertRaises(ValueError, permutations, 'abc', -2) # r is negative
394 self.assertEqual(list(permutations('abc', 32)), []) # r > n
395 self.assertRaises(TypeError, permutations, 'abc', 's') # r is not an int or None
396 self.assertEqual(list(permutations(range(3), 2)),
435 result = list(permutations(values, r))
440 self.assertEqual(len(p), r) # r-length permutations
[all...]
H A Dtest_functools.py6 from itertools import permutations namespace
1978 for haystack in permutations(bases):
1984 for haystack in permutations(bases):
1995 for haystack in permutations(bases):
2007 for haystack in permutations(bases):
2021 for haystack in permutations(bases):
2138 for abcs in permutations([c.Sized, c.Callable, c.Container]):
/third_party/vk-gl-cts/modules/gles3/scripts/
H A Dgen-qualification_order.py224 for p in itertools.permutations(f):
234 for p in itertools.permutations(f):
/third_party/littlefs/scripts/
H A Dbench.py63 # figure out defines and build possible permutations
65 self.permutations = []
126 # build possible permutations
131 self.permutations.extend(dict(perm) for perm in it.product(*(
315 for i, defines in enumerate(case.permutations):
331 for defines in case.permutations:
435 f.writeln(12*' '+'.permutations = %d,'
436 % len(case.permutations))
1009 print('found %d suites, %d cases, %d/%d permutations' % (
H A Dtest.py66 # figure out defines and build possible permutations
68 self.permutations = []
129 # build possible permutations
134 self.permutations.extend(dict(perm) for perm in it.product(*(
323 for i, defines in enumerate(case.permutations):
339 for defines in case.permutations:
449 f.writeln(12*' '+'.permutations = %d,'
450 % len(case.permutations))
1015 print('found %d suites, %d cases, %d/%d permutations' % (

Completed in 21 milliseconds

12