/external/guava/guava-tests/test/com/google/common/collect/ |
D | Collections2Test.java | 246 Iterator<List<Integer>> permutations = permutationSet.iterator(); 248 assertNextPermutation(Lists.<Integer>newArrayList(), permutations); 249 assertNoMorePermutations(permutations); 254 Iterator<List<Integer>> permutations = Collections2.orderedPermutations(list).iterator(); 256 assertNextPermutation(newArrayList(1), permutations); 257 assertNoMorePermutations(permutations); 262 Iterator<List<String>> permutations = Collections2.orderedPermutations(list).iterator(); 264 assertNextPermutation(newArrayList("a", "b", "c"), permutations); 265 assertNextPermutation(newArrayList("a", "c", "b"), permutations); 266 assertNextPermutation(newArrayList("b", "a", "c"), permutations); [all …]
|
D | TopKSelectorTest.java | 81 for (List<Integer> list : Collections2.permutations(Ints.asList(1, 2, 3, 4, 5))) { in testOfferedKPlusOne() 89 for (List<Integer> list : Collections2.permutations(Ints.asList(1, 2, 3, 4, 5, 6))) { in testOfferedThreeK()
|
/external/guava/android/guava-tests/test/com/google/common/collect/ |
D | Collections2Test.java | 246 Iterator<List<Integer>> permutations = permutationSet.iterator(); 248 assertNextPermutation(Lists.<Integer>newArrayList(), permutations); 249 assertNoMorePermutations(permutations); 254 Iterator<List<Integer>> permutations = Collections2.orderedPermutations(list).iterator(); 256 assertNextPermutation(newArrayList(1), permutations); 257 assertNoMorePermutations(permutations); 262 Iterator<List<String>> permutations = Collections2.orderedPermutations(list).iterator(); 264 assertNextPermutation(newArrayList("a", "b", "c"), permutations); 265 assertNextPermutation(newArrayList("a", "c", "b"), permutations); 266 assertNextPermutation(newArrayList("b", "a", "c"), permutations); [all …]
|
D | TopKSelectorTest.java | 81 for (List<Integer> list : Collections2.permutations(Ints.asList(1, 2, 3, 4, 5))) { in testOfferedKPlusOne() 89 for (List<Integer> list : Collections2.permutations(Ints.asList(1, 2, 3, 4, 5, 6))) { in testOfferedThreeK()
|
/external/mesa3d/docs/_extra/specs/ |
D | EGL_MESA_drm_image_formats.txt | 83 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.
|
/external/icu/icu4c/source/test/intltest/ |
D | canittst.cpp | 133 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()
|
/external/OpenCL-CTS/test_conformance/api/ |
D | test_kernel_attributes.cpp | 265 const AttributePermutations& permutations) in run_test() argument 268 for (auto attribute_permutation : permutations) in run_test() 334 for (auto permutations : all_tests) in test_kernel_attributes() local 336 success = success && run_test(context, deviceID, *permutations); in test_kernel_attributes()
|
/external/pdfium/third_party/libopenjpeg20/ |
D | invert.c | 38 OPJ_UINT32 * permutations, 108 OPJ_UINT32 * permutations, in opj_lupDecompose() argument 112 OPJ_UINT32 * tmpPermutations = permutations; in opj_lupDecompose() 130 tmpPermutations = permutations; in opj_lupDecompose()
|
/external/icu/icu4c/source/common/ |
D | caniter.cpp | 346 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()
|
/external/guava/guava/src/com/google/common/collect/ |
D | Collections2.java | 457 int permutations = 1; in calculateSize() local 464 permutations = IntMath.saturatedMultiply(permutations, IntMath.binomial(n, r)); in calculateSize() 466 if (permutations == Integer.MAX_VALUE) { in calculateSize() 473 return IntMath.saturatedMultiply(permutations, IntMath.binomial(n, r)); in calculateSize() 576 public static <E> Collection<List<E>> permutations(Collection<E> elements) { in permutations() method in Collections2
|
/external/guava/android/guava/src/com/google/common/collect/ |
D | Collections2.java | 434 int permutations = 1; in calculateSize() local 441 permutations = IntMath.saturatedMultiply(permutations, IntMath.binomial(n, r)); in calculateSize() 443 if (permutations == Integer.MAX_VALUE) { in calculateSize() 450 return IntMath.saturatedMultiply(permutations, IntMath.binomial(n, r)); in calculateSize() 553 public static <E> Collection<List<E>> permutations(Collection<E> elements) { in permutations() method in Collections2
|
/external/llvm-project/lld/test/MachO/tools/ |
D | generate-cfi-funcs.py | 12 from itertools import permutations 19 saved_regs_combined = list(list(permutations(saved_regs, i))
|
/external/fonttools/Lib/fontTools/varLib/ |
D | interpolatable.py | 98 permutations = itertools.permutations(range(n)) 99 best = list(next(permutations)) 101 for p in permutations:
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
D | CanonicalIterator.java | 253 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()
|
/external/icu/android_icu4j/src/main/java/android/icu/text/ |
D | CanonicalIterator.java | 249 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()
|
/external/skqp/src/shaders/ |
D | SkPerlinNoiseShader.cpp | 607 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 …]
|
/external/deqp/modules/gles2/scripts/ |
D | gen-qualification_order.py | 203 for p in itertools.permutations(f): 210 for p in itertools.permutations(f):
|
/external/deqp/modules/gles3/scripts/ |
D | gen-qualification_order.py | 224 for p in itertools.permutations(f): 234 for p in itertools.permutations(f):
|
/external/python/cpython2/Lib/test/ |
D | test_itertools.py | 110 for indices in permutations(range(n), r): 228 self.assertRaises(TypeError, permutations) # too few arguments 229 self.assertRaises(TypeError, permutations, 'abc', 2, 1) # too many arguments 230 self.assertRaises(TypeError, permutations, None) # pool is not iterable 231 self.assertRaises(ValueError, permutations, 'abc', -2) # r is negative 232 self.assertEqual(list(permutations('abc', 32)), []) # r > n 233 self.assertRaises(TypeError, permutations, 'abc', 's') # r is not an int or None 234 self.assertEqual(list(permutations(range(3), 2)), 273 result = list(permutations(values, r)) 284 self.assertEqual(result, list(permutations(values, None))) # test r as None [all …]
|
/external/llvm-project/clang/test/Parser/ |
D | asm-qualifiers.c | 27 void permutations(void) { in permutations() function
|
/external/rust/crates/itertools/tests/ |
D | adaptors_no_collect.rs | 36 no_collect_test(|iter| iter.permutations(5)) in permutations_no_collect()
|
/external/python/cpython3/Lib/test/ |
D | test_itertools.py | 253 for indices in permutations(range(n), r): 386 self.assertRaises(TypeError, permutations) # too few arguments 387 self.assertRaises(TypeError, permutations, 'abc', 2, 1) # too many arguments 388 self.assertRaises(TypeError, permutations, None) # pool is not iterable 389 self.assertRaises(ValueError, permutations, 'abc', -2) # r is negative 390 self.assertEqual(list(permutations('abc', 32)), []) # r > n 391 self.assertRaises(TypeError, permutations, 'abc', 's') # r is not an int or None 392 self.assertEqual(list(permutations(range(3), 2)), 431 result = list(permutations(values, r)) 442 self.assertEqual(result, list(permutations(values, None))) # test r as None [all …]
|
/external/python/cpython2/Doc/library/ |
D | itertools.rst | 72 :func:`permutations` p[, r] r-length tuples, all po… 76 ``permutations('ABCD', 2)`` ``AB AC AD BA BC BD CA … 155 of :func:`permutations` after filtering entries where the elements are not 161 for indices in permutations(range(n), r): 498 .. function:: permutations(iterable[, r]) 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 …]
|
/external/python/cpython3/Doc/library/ |
D | itertools.rst | 70 :func:`permutations` p[, r] r-length tuples, all po… 79 ``permutations('ABCD', 2)`` ``AB AC AD BA BC BD CA CB CD DA DB DC`` 233 of :func:`permutations` after filtering entries where the elements are not 239 for indices in permutations(range(n), r): 479 .. function:: permutations(iterable, r=None) 481 Return successive *r* length permutations of elements in the *iterable*. 484 of the *iterable* and all possible full-length permutations 497 def permutations(iterable, r=None): 498 # permutations('ABCD', 2) --> AB AC AD BA BC BD CA CB CD DA DB DC 499 # permutations(range(3)) --> 012 021 102 120 201 210 [all …]
|
/external/rust/crates/grpcio-sys/grpc/src/proto/grpc/testing/ |
D | report_qps_scenario_service.proto | 15 // An integration test service that covers all the method signature permutations
|