| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| D | Collections2Test.java | 84 Iterator<List<Integer>> permutations = permutationSet.iterator(); in testOrderedPermutationSetEmpty() local
86 assertNextPermutation(Lists.<Integer>newArrayList(), permutations); in testOrderedPermutationSetEmpty() local
87 assertNoMorePermutations(permutations); in testOrderedPermutationSetEmpty()
92 Iterator<List<Integer>> permutations = in testOrderedPermutationSetOneElement() local
95 assertNextPermutation(newArrayList(1), permutations); in testOrderedPermutationSetOneElement()
96 assertNoMorePermutations(permutations); in testOrderedPermutationSetOneElement()
101 Iterator<List<String>> permutations = in testOrderedPermutationSetThreeElements() local
104 assertNextPermutation(newArrayList("a", "b", "c"), permutations); in testOrderedPermutationSetThreeElements()
105 assertNextPermutation(newArrayList("a", "c", "b"), permutations); in testOrderedPermutationSetThreeElements()
106 assertNextPermutation(newArrayList("b", "a", "c"), permutations); in testOrderedPermutationSetThreeElements()
[all …]
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | Collections2Test.java | 242 Iterator<List<Integer>> permutations = permutationSet.iterator();
244 assertNextPermutation(Lists.<Integer>newArrayList(), permutations);
245 assertNoMorePermutations(permutations);
250 Iterator<List<Integer>> permutations =
253 assertNextPermutation(newArrayList(1), permutations);
254 assertNoMorePermutations(permutations);
259 Iterator<List<String>> permutations =
262 assertNextPermutation(newArrayList("a", "b", "c"), permutations);
263 assertNextPermutation(newArrayList("a", "c", "b"), permutations);
264 assertNextPermutation(newArrayList("b", "a", "c"), permutations);
[all …]
|
| D | MinMaxPriorityQueueTest.java | 566 for (Collection<Integer> perm : Collections2.permutations(expected)) { in testRemoveAt_exhaustive()
694 for (Collection<Integer> perm : Collections2.permutations(expected)) { in testExhaustive_pollAndPush()
|
| /external/icu/icu4c/source/test/intltest/ |
| D | canittst.cpp | 132 Hashtable *permutations = new Hashtable(FALSE, status); in TestBasic() local
133 permutations->setValueDeleter(uprv_deleteUObject); in TestBasic()
136 CanonicalIterator::permute(toPermute, FALSE, permutations, status); in TestBasic()
140 …expectEqual("Simple permutation ", "", collectionToString(permutations), "ABC, ACB, BAC, BCA, CAB,… in TestBasic()
142 delete permutations; in TestBasic()
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | Collections2.java | 433 long permutations = 1; in calculateSize() local
441 permutations *= binomial(n, r); in calculateSize()
443 if (!isPositiveInt(permutations)) { in calculateSize()
450 permutations *= binomial(n, r); in calculateSize()
451 if (!isPositiveInt(permutations)) { in calculateSize()
454 return (int) permutations; in calculateSize()
557 @Beta public static <E> Collection<List<E>> permutations( in permutations() method in Collections2
|
| /external/pdfium/third_party/libopenjpeg20/ |
| D | invert.c | 38 OPJ_UINT32 * permutations,
106 static OPJ_BOOL opj_lupDecompose(OPJ_FLOAT32 * matrix,OPJ_UINT32 * permutations, in opj_lupDecompose() argument
110 OPJ_UINT32 * tmpPermutations = permutations; in opj_lupDecompose()
129 tmpPermutations = permutations; in opj_lupDecompose()
|
| /external/icu/icu4c/source/common/ |
| D | caniter.cpp | 344 Hashtable permutations(status); in getEquivalents() local
350 permutations.setValueDeleter(uprv_deleteUObject); in getEquivalents()
370 permutations.removeAll(); in getEquivalents()
371 permute(item, CANITER_SKIP_ZEROES, &permutations, status); in getEquivalents()
375 ne2 = permutations.nextElement(el2); in getEquivalents()
393 ne2 = permutations.nextElement(el2); in getEquivalents()
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | CanonicalIterator.java | 247 Set<String> permutations = new HashSet<String>(); in getEquivalents() local
255 permutations.clear(); in getEquivalents()
256 permute(item, SKIP_ZEROS, permutations); in getEquivalents()
257 Iterator<String> it2 = permutations.iterator(); in getEquivalents()
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | CanonicalIterator.java | 251 Set<String> permutations = new HashSet<String>(); in getEquivalents() local
259 permutations.clear(); in getEquivalents()
260 permute(item, SKIP_ZEROS, permutations); in getEquivalents()
261 Iterator<String> it2 = permutations.iterator(); in getEquivalents()
|
| /external/skia/experimental/SkPerlinNoiseShader2/ |
| D | SkPerlinNoiseShader2.cpp | 522 uint8_t* permutations = improved_noise_permutations; in calculateImprovedNoiseValueForPoint() local
523 int A = permutations[X] + Y; in calculateImprovedNoiseValueForPoint()
524 int AA = permutations[A] + Z; in calculateImprovedNoiseValueForPoint()
525 int AB = permutations[A + 1] + Z; in calculateImprovedNoiseValueForPoint()
526 int B = permutations[X + 1] + Y; in calculateImprovedNoiseValueForPoint()
527 int BA = permutations[B] + Z; in calculateImprovedNoiseValueForPoint()
528 int BB = permutations[B + 1] + Z; in calculateImprovedNoiseValueForPoint()
529 result += lerp(w, lerp(v, lerp(u, grad(permutations[AA ], px , py , pz ), in calculateImprovedNoiseValueForPoint()
530 grad(permutations[BA ], px - 1, py , pz )), in calculateImprovedNoiseValueForPoint()
531 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/llvm/test/CodeGen/X86/ |
| D | constant-combines.ll | 9 ; The DAG combiner at one point contained bugs that given enough permutations
|
| /external/google-breakpad/src/testing/scripts/generator/ |
| D | README | 34 Not all permutations of using multiple pointers/references will be rendered
|
| /external/libvpx/libvpx/third_party/libyuv/source/ |
| D | x86inc.asm | 706 ; I would like to not have to manually keep track of the permutations:
709 ; implementations, e.g. the SSE2 and SSSE3 versions may have different permutations.
|
| /external/eigen/doc/ |
| D | TutorialSparse.dox | 301 - \b permutations. Finally, permutations can be applied to sparse matrices too:
330 - application of symmetric permutations:
|
| /external/selinux/secilc/docs/ |
| D | cil_access_vector_rules.md | 43 These examples show a selection of possible permutations of [`allow`](cil_access_vector_rules.md#al…
275 These examples show a selection of possible permutations of [`allowx`](cil_access_vector_rules.md#a…
|
| D | cil_reference_guide.md | 4 1. Not all possible alternate statement permutations are shown, however there should be enough var…
|
| /external/deqp/modules/gles31/scripts/ |
| D | gen-implicit-conversions.py | 803 for pair in itertools.permutations(types, 2):
|
| /external/llvm/test/Transforms/InstCombine/ |
| D | bit-checks.ll | 270 ; test parameter permutations
|
| D | x86-pshufb.ll | 180 ; Vector permutations using byte shuffles.
|
| /external/llvm/lib/Target/Sparc/ |
| D | SparcInstrInfo.td | 377 // permutations of selection between i32/f32/f64 on ICC and FCC.
|
| /external/llvm/test/Transforms/SROA/ |
| D | basictest.ll | 1188 ; trigger a mixture in several permutations as we resolve each alloca
|
| /external/libxml2/ |
| D | ChangeLog | 13288 permutations in the output
|