Searched refs:permutations (Results 1 – 21 of 21) sorted by relevance
84 Iterator<List<Integer>> permutations = permutationSet.iterator(); in testOrderedPermutationSetEmpty() local86 assertNextPermutation(Lists.<Integer>newArrayList(), permutations); in testOrderedPermutationSetEmpty() local87 assertNoMorePermutations(permutations); in testOrderedPermutationSetEmpty()92 Iterator<List<Integer>> permutations = in testOrderedPermutationSetOneElement() local95 assertNextPermutation(newArrayList(1), permutations); in testOrderedPermutationSetOneElement()96 assertNoMorePermutations(permutations); in testOrderedPermutationSetOneElement()101 Iterator<List<String>> permutations = in testOrderedPermutationSetThreeElements() local104 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 …]
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 …]
566 for (Collection<Integer> perm : Collections2.permutations(expected)) { in testRemoveAt_exhaustive()694 for (Collection<Integer> perm : Collections2.permutations(expected)) { in testExhaustive_pollAndPush()
132 Hashtable *permutations = new Hashtable(FALSE, status); in TestBasic() local133 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()
433 long permutations = 1; in calculateSize() local441 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
344 Hashtable permutations(status); in getEquivalents() local350 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()
38 OPJ_UINT32 * permutations, 106 OPJ_BOOL opj_lupDecompose(OPJ_FLOAT32 * matrix,OPJ_UINT32 * permutations, in opj_lupDecompose() argument110 OPJ_UINT32 * tmpPermutations = permutations; in opj_lupDecompose()129 tmpPermutations = permutations; in opj_lupDecompose()
251 Set<String> permutations = new HashSet<String>(); in getEquivalents() local259 permutations.clear(); in getEquivalents()260 permute(item, SKIP_ZEROS, permutations); in getEquivalents()261 Iterator<String> it2 = permutations.iterator(); in getEquivalents()
181 for p in itertools.permutations(f):188 for p in itertools.permutations(f):
202 for p in itertools.permutations(f):212 for p in itertools.permutations(f):
9 ; The DAG combiner at one point contained bugs that given enough permutations
34 Not all permutations of using multiple pointers/references will be rendered
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.
301 - \b permutations. Finally, permutations can be applied to sparse matrices too:330 - application of symmetric permutations:
781 for pair in itertools.permutations(types, 2):
270 ; test parameter permutations
32 ;# when we think of them as permutations of address bits: Concatenate a
343 // permutations of selection between i32/f32/f64 on ICC and FCC.
1188 ; trigger a mixture in several permutations as we resolve each alloca
META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF ...
13288 permutations in the output