Home
last modified time | relevance | path

Searched refs:permutations (Results 1 – 25 of 62) sorted by relevance

123

/third_party/rust/crates/env_logger/ci/src/
Dpermute.rs7 let mut permutations = BTreeSet::new(); in all() localVariable
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/
Dpermutate.go122 permutations, err := state.permutateFQN(param.Type)
126 if len(permutations) == 0 {
129 for _, fqn := range permutations {
163 var permutations []sem.FullyQualifiedName
166 permutations, err = state.permutateFQN(sem.FullyQualifiedName{Target: t.Matcher})
168 permutations, err = state.permutateFQN(sem.FullyQualifiedName{Target: t.Enum})
173 if len(permutations) == 0 {
177 for _, n := range permutations {
187 permutations := []int{2, 3, 4}
189 for _, n := range permutations {
/third_party/node/deps/npm/node_modules/tough-cookie/lib/
DpermuteDomain.js48 var permutations = [cur];
51 permutations.push(cur);
53 return permutations;
Dcookie.js661 var permutations = [path];
668 permutations.push(path);
670 permutations.push('/');
671 return permutations;
/third_party/mesa3d/docs/_extra/specs/
DEGL_MESA_drm_image_formats.txt83 1. Should we expose the full set of channel permutations for the formats,
90 of the possible permutations of 8-bit channel formats. It is also not
91 clear where the additional permutations would be used. For example,
93 doesn't allow for the other permutations.
/third_party/icu/icu4c/source/test/intltest/
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,… in TestBasic()
143 delete permutations; in TestBasic()
/third_party/icu/icu4c/source/common/
Dcaniter.cpp346 Hashtable permutations(status); in getEquivalents() local
352 permutations.setValueDeleter(uprv_deleteUObject); in getEquivalents()
372 permutations.removeAll(); in getEquivalents()
373 permute(item, CANITER_SKIP_ZEROES, &permutations, status); in getEquivalents()
377 ne2 = permutations.nextElement(el2); in getEquivalents()
395 ne2 = permutations.nextElement(el2); in getEquivalents()
/third_party/flutter/skia/third_party/externals/icu/source/common/
Dcaniter.cpp346 Hashtable permutations(status); in getEquivalents() local
352 permutations.setValueDeleter(uprv_deleteUObject); in getEquivalents()
372 permutations.removeAll(); in getEquivalents()
373 permute(item, CANITER_SKIP_ZEROES, &permutations, status); in getEquivalents()
377 ne2 = permutations.nextElement(el2); in getEquivalents()
395 ne2 = permutations.nextElement(el2); in getEquivalents()
/third_party/node/deps/icu-small/source/common/
Dcaniter.cpp346 Hashtable permutations(status); in getEquivalents() local
352 permutations.setValueDeleter(uprv_deleteUObject); in getEquivalents()
372 permutations.removeAll(); in getEquivalents()
373 permute(item, CANITER_SKIP_ZEROES, &permutations, status); in getEquivalents()
377 ne2 = permutations.nextElement(el2); in getEquivalents()
395 ne2 = permutations.nextElement(el2); in getEquivalents()
/third_party/skia/third_party/externals/icu/source/common/
Dcaniter.cpp346 Hashtable permutations(status); in getEquivalents() local
352 permutations.setValueDeleter(uprv_deleteUObject); in getEquivalents()
372 permutations.removeAll(); in getEquivalents()
373 permute(item, CANITER_SKIP_ZEROES, &permutations, status); in getEquivalents()
377 ne2 = permutations.nextElement(el2); in getEquivalents()
395 ne2 = permutations.nextElement(el2); in getEquivalents()
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
DCanonicalIterator.java253 Set<String> permutations = new HashSet<String>(); in getEquivalents() local
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/
DCanonicalIterator.java249 Set<String> permutations = new HashSet<String>(); in getEquivalents() local
257 permutations.clear(); in getEquivalents()
258 permute(item, SKIP_ZEROS, permutations); in getEquivalents()
259 Iterator<String> it2 = permutations.iterator(); in getEquivalents()
/third_party/flutter/skia/src/shaders/
DSkPerlinNoiseShader.cpp607 uint8_t* permutations = improved_noise_permutations; in calculateImprovedNoiseValueForPoint() local
608 int A = permutations[X] + Y; in calculateImprovedNoiseValueForPoint()
609 int AA = permutations[A] + Z; in calculateImprovedNoiseValueForPoint()
610 int AB = permutations[A + 1] + Z; in calculateImprovedNoiseValueForPoint()
611 int B = permutations[X + 1] + Y; in calculateImprovedNoiseValueForPoint()
612 int BA = permutations[B] + Z; in calculateImprovedNoiseValueForPoint()
613 int BB = permutations[B + 1] + Z; in calculateImprovedNoiseValueForPoint()
614 result += lerp(w, lerp(v, lerp(u, grad(permutations[AA ], px , py , pz ), in calculateImprovedNoiseValueForPoint()
615 grad(permutations[BA ], px - 1, py , pz )), in calculateImprovedNoiseValueForPoint()
616 lerp(u, grad(permutations[AB ], px , py - 1, pz ), in calculateImprovedNoiseValueForPoint()
[all …]
/third_party/node/test/pummel/
Dtest-policy-integrity.js236 function permutations(configurations, path = {}) { function
244 return permutations(otherConfigs, { ...path, [config]: value });
258 for (const permutation of permutations({
/third_party/vk-gl-cts/modules/gles2/scripts/
Dgen-qualification_order.py203 for p in itertools.permutations(f):
210 for p in itertools.permutations(f):
/third_party/python/Lib/test/
Dtest_itertools.py255 for indices in permutations(range(n), r):
388 self.assertRaises(TypeError, permutations) # too few arguments
389 self.assertRaises(TypeError, permutations, 'abc', 2, 1) # too many arguments
390 self.assertRaises(TypeError, permutations, None) # pool is not iterable
391 self.assertRaises(ValueError, permutations, 'abc', -2) # r is negative
392 self.assertEqual(list(permutations('abc', 32)), []) # r > n
393 self.assertRaises(TypeError, permutations, 'abc', 's') # r is not an int or None
394 self.assertEqual(list(permutations(range(3), 2)),
433 result = list(permutations(values, r))
444 self.assertEqual(result, list(permutations(values, None))) # test r as None
[all …]
Dtest_functools.py6 from itertools import permutations
1881 for haystack in permutations(bases):
1887 for haystack in permutations(bases):
1898 for haystack in permutations(bases):
1910 for haystack in permutations(bases):
1924 for haystack in permutations(bases):
2041 for abcs in permutations([c.Sized, c.Callable, c.Container]):
/third_party/vk-gl-cts/modules/gles3/scripts/
Dgen-qualification_order.py224 for p in itertools.permutations(f):
234 for p in itertools.permutations(f):
/third_party/python/Doc/library/
Ditertools.rst71 :func:`permutations` p[, r] r-length tuples, all po…
80 ``permutations('ABCD', 2)`` ``AB AC AD BA BC BD CA CB CD DA DB DC``
234 of :func:`permutations` after filtering entries where the elements are not
240 for indices in permutations(range(n), r):
498 .. function:: permutations(iterable, r=None)
500 Return successive *r* length permutations of elements in the *iterable*.
503 of the *iterable* and all possible full-length permutations
516 def permutations(iterable, r=None):
517 # permutations('ABCD', 2) --> AB AC AD BA BC BD CA CB CD DA DB DC
518 # permutations(range(3)) --> 012 021 102 120 201 210
[all …]
/third_party/googletest/googlemock/scripts/generator/
DREADME33 Not all permutations of using multiple pointers/references will be rendered
/third_party/typescript/tests/baselines/reference/
DmethodContainingLocalFunction.types2 // The first case here (BugExhibition<T>) caused a crash. Try with different permutations of featur…
DmethodContainingLocalFunction.symbols2 // The first case here (BugExhibition<T>) caused a crash. Try with different permutations of featur…
/third_party/skia/third_party/externals/opengl-registry/extensions/AMD/
DAMD_interleaved_elements.txt49 To render this cube, we must compute the 24 unique permutations of
52 permutations is equal to the final vertex count required to draw the
/third_party/openGLES/extensions/AMD/
DAMD_interleaved_elements.txt49 To render this cube, we must compute the 24 unique permutations of
52 permutations is equal to the final vertex count required to draw the
/third_party/selinux/secilc/docs/
Dcil_access_vector_rules.md45 These examples show a selection of possible permutations of [`allow`](cil_access_vector_rules.md#al…
294 These examples show a selection of possible permutations of [`allowx`](cil_access_vector_rules.md#a…

123