| /external/syslinux/com32/cmenu/libmenu/ |
| des.c | 279 * initialise the inverted key permutation.
287 * Invert the key permutation and initialise the inverted key
288 * compression permutation.
296 * Invert the key compression permutation.
360 * Invert the P-box permutation, and convert into OR-masks for
617 * Do key permutation and split into two 28-bit subkeys.
659 * Rotate subkeys and do compression permutation.
744 * Do initial permutation (IP).
816 * and do the pbox permutation at the same time.
842 * Do final permutation (inverse of IP)
[all...] |
| /prebuilts/go/darwin-x86/src/runtime/ |
| hash_test.go | 231 // "permutation" is a bad name here, but it is what Smhasher uses.
236 permutation(t, []uint32{0, 1, 2, 3, 4, 5, 6, 7}, 8)
237 permutation(t, []uint32{0, 1 << 29, 2 << 29, 3 << 29, 4 << 29, 5 << 29, 6 << 29, 7 << 29}, 8)
238 permutation(t, []uint32{0, 1}, 20)
239 permutation(t, []uint32{0, 1 << 31}, 20)
240 permutation(t, []uint32{0, 1, 2, 3, 4, 5, 6, 7, 1 << 29, 2 << 29, 3 << 29, 4 << 29, 5 << 29, 6 << 29, 7 << 29}, 6)
242 func permutation(t *testing.T, s []uint32, n int) { func
|
| /prebuilts/go/linux-x86/src/runtime/ |
| hash_test.go | 231 // "permutation" is a bad name here, but it is what Smhasher uses.
236 permutation(t, []uint32{0, 1, 2, 3, 4, 5, 6, 7}, 8)
237 permutation(t, []uint32{0, 1 << 29, 2 << 29, 3 << 29, 4 << 29, 5 << 29, 6 << 29, 7 << 29}, 8)
238 permutation(t, []uint32{0, 1}, 20)
239 permutation(t, []uint32{0, 1 << 31}, 20)
240 permutation(t, []uint32{0, 1, 2, 3, 4, 5, 6, 7, 1 << 29, 2 << 29, 3 << 29, 4 << 29, 5 << 29, 6 << 29, 7 << 29}, 6)
242 func permutation(t *testing.T, s []uint32, n int) { func
|
| /device/google/contexthub/firmware/os/algos/common/math/ |
| mat.h | 137 // permutation matrix.
152 // The permutation matrix P can be reproduced from returned pivot vector as:
162 // row pivots for the permutation matrix (also from mat44DecomposeLup).
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/test/ |
| test_sort.py | 92 check("random permutation", x, s)
104 check("an insane function left some permutation", x, s)
117 check("exception during sort left some permutation", x, s)
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/random/ |
| RandomData.java | 242 * @param n domain of the permutation
243 * @param k size of the permutation
244 * @return random k-permutation of n
|
| /external/python/cpython2/Lib/test/ |
| test_sort.py | 92 check("random permutation", x, s)
104 check("an insane function left some permutation", x, s)
117 check("exception during sort left some permutation", x, s)
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/test/ |
| test_sort.py | 92 check("random permutation", x, s)
104 check("an insane function left some permutation", x, s)
117 check("exception during sort left some permutation", x, s)
|
| /prebuilts/gdb/linux-x86/lib/python2.7/test/ |
| test_sort.py | 92 check("random permutation", x, s)
104 check("an insane function left some permutation", x, s)
117 check("exception during sort left some permutation", x, s)
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_sort.py | 92 check("random permutation", x, s)
104 check("an insane function left some permutation", x, s)
117 check("exception during sort left some permutation", x, s)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_sort.py | 92 check("random permutation", x, s)
104 check("an insane function left some permutation", x, s)
117 check("exception during sort left some permutation", x, s)
|
| /art/test/957-methodhandle-transforms/src/ |
| Main.java | 827 final MethodHandle permutation = MethodHandles.permuteArguments( local
830 permutation.invoke((double) 97.0, (float) 98.0f, (long) 97, 78,
833 // The permutation array was not of the right length.
841 // The permutation array has an element that's out of bounds
850 // The permutation array maps to an incorrect type.
870 MethodHandle permutation = MethodHandles.permuteArguments(target, local
872 assertEquals("barfoo", (String) permutation.invoke("foo", "bar"));
874 permutation = MethodHandles.permuteArguments(target, newType, new int[] { 0, 0 });
875 assertEquals("foofoo", (String) permutation.invoke("foo", "bar"));
877 permutation = MethodHandles.permuteArguments(target, newType, new int[] { 1, 1 })
890 MethodHandle permutation = MethodHandles.permuteArguments(target, local
[all...] |
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_copy_to_ucol.h | 42 * \param perm_r Row permutation
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCScheduleG4.td | 20 def G4_VPU : FuncUnit; // vector permutation unit
|
| /external/v8/src/arm64/ |
| utils-arm64.h | 70 // Permutation tables for REV instructions.
|
| /prebuilts/go/darwin-x86/src/math/rand/ |
| example_test.go | 83 // Perm generates a random permutation of the numbers [0, n).
|
| /prebuilts/go/linux-x86/src/math/rand/ |
| example_test.go | 83 // Perm generates a random permutation of the numbers [0, n).
|
| /external/lmfit/lib/ |
| lmmin.c | 292 * where P is a permutation matrix and J is the final calculated
297 * Pivot is an integer array of length n. It defines a permutation
569 * where P is a permutation matrix, Q has orthogonal columns, and R is
572 * permutation matrix P, and the first n components of Q^T*b. On output
596 * permutation matrix P such that A*P = Q*R. Column j of P is column
771 * determines an orthogonal matrix Q, a permutation matrix P, and an
793 * permutation matrix P. Column j of P is column Pivot(j) of the
815 initialize Pivot with identity permutation. ***/
[all...] |
| /external/icu/icu4c/source/common/unicode/ |
| caniter.h | 25 /** Should permutation skip characters with combining class zero
123 * Dumb recursive implementation of permutation.
|
| /external/icu/icu4c/source/i18n/ |
| collationdata.h | 159 * Writes the permutation of primary-weight ranges
219 * Uses include building a reordering permutation table and
|
| /prebuilts/go/darwin-x86/src/crypto/des/ |
| const.go | 10 // Used to perform an initial permutation of a 64-bit input block.
22 // Used to perform a final permutation of a 4-bit preoutput block. This is the
|
| /prebuilts/go/linux-x86/src/crypto/des/ |
| const.go | 10 // Used to perform an initial permutation of a 64-bit input block.
22 // Used to perform a final permutation of a 4-bit preoutput block. This is the
|
| /external/eigen/Eigen/src/SVD/ |
| BDCSVD.h | 592 // To this end, let's compute a permutation skipping them:
[all...] |
| /bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
| getopt_long.c | 396 /* do permutation, if we have to */
428 * If no permutation wanted, stop parsing
433 /* do permutation */
|
| /external/icu/icu4c/source/common/ |
| caniter.cpp | 262 * Dumb recursive implementation of permutation.
388 //if (PROGRESS) printf("Adding Permutation: %s\n", UToS(Tr(*possible)));
392 //if (PROGRESS) printf("-Skipping Permutation: %s\n", UToS(Tr(*possible)));
|
