| /external/chromium_org/third_party/sqlite/src/test/ |
| pagerfault2.test | 25 if {[permutation] == "inmemory_journal"} {
|
| tempdb.test | 61 set jrnl_in_memory [expr {[permutation] eq "inmemory_journal"}]
|
| tkt-f3e5abed55.test | 66 if {[permutation]!="inmemory_journal"} {
|
| exclusive2.test | 107 # For similar reasons, this test does not work with the memsubsys1 permutation.
108 # Permutation memsubsys1 configures the pcache subsystem to use a static
159 if {[permutation] != "memsubsys1"} {
|
| memsubsys1.test | 21 # will not work with the "memsubsys1" permutation.
23 if {[permutation] == "memsubsys1"} {
|
| /external/eigen/doc/ |
| SparseQuickReference.dox | 173 perm.inverse(n); // Compute eventually the inverse permutation
174 sm1.twistedBy(perm) //Apply the permutation on rows and columns
175 sm2 = sm1 * perm; // ??? Apply the permutation on columns ???;
176 sm2 = perm * sm1; // ??? Apply the permutation on rows ???;
|
| /external/openfst/src/include/fst/ |
| statesort.h | 35 // sorting. ORDER must be a permutation of FST's states ID sequence:
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| statesort.h | 30 // sorting. ORDER must be a permutation of FST's states ID sequence:
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteLUT.h | 150 PermutationMatrix<Dynamic,Dynamic,Index> m_P; // Fill-reducing permutation
151 PermutationMatrix<Dynamic,Dynamic,Index> m_Pinv; // Inverse permutation
223 // Compute the Fill-reducing permutation
233 m_Pinv = m_P.inverse(); // ... and the inverse permutation
254 // Apply the fill-reducing permutation
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 67 * In order to reduce the fill-in, a symmetric permutation P is applied prior to the factorization
149 /** \returns the permutation P
154 /** \returns the inverse P^-1 of the permutation P
297 PermutationMatrix<Dynamic,Dynamic,Index> m_P; // the permutation
298 PermutationMatrix<Dynamic,Dynamic,Index> m_Pinv; // the inverse permutation
352 * In order to reduce the fill-in, a symmetric permutation P is applied prior to the factorization
440 * In order to reduce the fill-in, a symmetric permutation P is applied prior to the factorization
676 // TODO allows to configure the permutation
677 // Note that amd compute the inverse permutation
|
| /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)
|
| /external/chromium/chrome/browser/ui/cocoa/ |
| task_manager_mac.h | 36 // These contain a permutation of [0..|model_->ResourceCount() - 1|]. Used to
|
| /external/chromium_org/chrome/browser/ui/cocoa/ |
| task_manager_mac.h | 36 // These contain a permutation of [0..|model_->ResourceCount() - 1|]. Used to
|
| /external/chromium_org/ui/webui/resources/js/cr/ui/ |
| array_data_model.js | 126 * This implementation runs sort after splice and creates permutation for
340 dispatchPermutedEvent_: function(permutation) {
342 e.permutation = permutation;
|
| /external/chromium_org/third_party/icu/source/common/unicode/ |
| caniter.h | 23 /** Should permutation skip characters with combining class zero
120 * Dumb recursive implementation of permutation.
|
| /external/icu4c/common/unicode/ |
| caniter.h | 23 /** Should permutation skip characters with combining class zero
121 * Dumb recursive implementation of permutation.
|
| /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/noise/basis/ |
| ImprovedNoise.java | 101 static final int p[] = new int[512], permutation[] = { 151, 160, 137, 91, 90, 15, 131, 13, 201, 95, 96, 53, 194, 233, 7, 225, 140, 36,
118 ImprovedNoise.p[256 + i] = ImprovedNoise.p[i] = ImprovedNoise.permutation[i];
|
| /external/ceres-solver/internal/ceres/ |
| covariance_impl.cc | 656 SuiteSparse_long* permutation = NULL; local
677 &permutation,
680 CHECK_NOTNULL(permutation);
687 delete []permutation;
695 inverse_permutation[permutation[i]] = i;
742 delete []permutation;
|
| /bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
| getopt_long.c | 402 /* do permutation, if we have to */
434 * If no permutation wanted, stop parsing
439 /* do permutation */
|
| /external/chromium_org/third_party/icu/source/common/ |
| caniter.cpp | 259 * Dumb recursive implementation of permutation.
385 //if (PROGRESS) printf("Adding Permutation: %s\n", UToS(Tr(*possible)));
389 //if (PROGRESS) printf("-Skipping Permutation: %s\n", UToS(Tr(*possible)));
|
| /external/chromium_org/third_party/mesa/src/src/getopt/ |
| getopt_long.c | 316 /* do permutation, if we have to */
344 * If no permutation wanted, stop parsing
349 /* do permutation */
|
| /external/chromium_org/third_party/openssl/openssl/crypto/des/asm/ |
| des_enc.m4 | 133 ! After the the original LibDES initial permutation, the resulting left
280 ! into 32 bits according to the P permutation.
553 ! The final permutation logic switches the halfes, meaning that
561 ! initially undo the rotate 3 left done after initial permutation
635 ! Does initial permutation for next block mixed with
636 ! final permutation for current block.
1234 ! encrypts/decrypts without initial/final permutation
1512 ! we combine final permutation for this block with initial
1513 ! permutation for next block. Load next block:
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Transpositions.h | 23 * This class represents a permutation transformation as a sequence of \em n transpositions
30 * computed during a decomposition with pivoting, and it is faster when applying the permutation in-place.
201 /** Constructs an uninitialized permutation matrix of given size.
|
| /external/icu4c/common/ |
| caniter.cpp | 260 * Dumb recursive implementation of permutation.
386 //if (PROGRESS) printf("Adding Permutation: %s\n", UToS(Tr(*possible)));
390 //if (PROGRESS) printf("-Skipping Permutation: %s\n", UToS(Tr(*possible)));
|
