| /external/chromium_org/third_party/sqlite/src/test/ |
| tester.tcl | 72 # permutation
157 # --start=[$permutation:]$testfile
205 set ::G(start:permutation) ${s.perm}
[all...] |
| jrnlmode.test | 459 # These tests are not run as part of the "journaltest" permutation,
461 if {[permutation] ne "journaltest"} {
|
| journal2.test | 21 if {[permutation] == "inmemory_journal"} {
|
| savepoint6.test | 233 if {[permutation] eq "journaltest"} {
|
| incrblob.test | 424 # Permutation memsubsys1 configures a very small static allocation
430 if {[permutation] != "memsubsys1"} {
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| ucol_res.cpp | [all...] |
| /external/chromium_org/third_party/smhasher/src/ |
| KeysetTest.h | 81 // Keyset 'Permutation' - given a set of 32-bit blocks, generate keys
111 printf("Keyset 'Permutation' - %d blocks - ",blockcount);
|
| /external/ceres-solver/internal/ceres/ |
| visibility_based_preconditioner.h | 108 // correspond to tri-diagonal matrices. Thus there exist a permutation
|
| sparse_normal_cholesky_solver.cc | 186 // permutation pattern, so we cannot use a block analysis of the
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ppc/ |
| filter_altivec.asm | 221 ;# Load up permutation constants
411 ;# Load up permutation constants
583 ;# Load up permutation constants
800 ;# v14 permutation value for alignment
|
| /external/chromium_org/third_party/openmax_dl/dl/sp/src/x86/ |
| omxSP_FFTFwd_RToCCS_F32_Sfs.c | 55 * This function is the last permutation of two-for-one FFT algorithm.
|
| omxSP_FFTInv_CCSToR_F32_Sfs.c | 52 * This function is the first permutation of two-for-one IFFT algorithm.
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_Memory.h | 149 * \note Unlike SuperLU, this routine does not support successive factorization with the same pattern and the same row permutation
|
| SparseLU_panel_dfs.h | 204 * \param[in] perm_r Row permutation
|
| /external/eigen/doc/ |
| SparseQuickReference.dox | 152 <td> Permutation </td>
|
| /external/icu/icu4c/source/i18n/ |
| collationdatareader.h | 155 * Primary-weight lead byte permutation table.
|
| /external/libvpx/libvpx/vp8/common/ppc/ |
| filter_altivec.asm | 221 ;# Load up permutation constants
411 ;# Load up permutation constants
583 ;# Load up permutation constants
800 ;# v14 permutation value for alignment
|
| /external/llvm/test/Transforms/BBVectorize/X86/ |
| simple.ll | 79 ; Basic depth-4 chain (internal permutation)
|
| /external/openssl/crypto/rsa/ |
| rsa_oaep.c | 16 * underlying permutation: "partial-one-wayness" instead
|
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/ppc/ |
| filter_altivec.asm | 221 ;# Load up permutation constants
411 ;# Load up permutation constants
583 ;# Load up permutation constants
800 ;# v14 permutation value for alignment
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 36 * matrix \f$ A \f$ such that \f$ A = P^TLDL^*P \f$, where P is a permutation matrix, L
133 /** \returns the permutation matrix P as a transposition sequence.
390 // Apply the permutation to the input w
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 26 * is a permutation matrix.
106 /** \returns the permutation matrix P.
389 // the row permutation is stored as int indices, so just to be sure:
|
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 29 * by using Householder transformations. Here, \b P is a permutation matrix, \b Q a unitary matrix and \b R an
179 /** \returns a const reference to the column permutation matrix */
430 // the column permutation is stored as int indices, so just to be sure:
|
| /external/chromium_org/ui/webui/resources/js/cr/ui/ |
| list.js | 635 if (e.permutation[index] != -1) {
636 var newIndex = e.permutation[index];
646 if (e.permutation[index] != -1) {
647 newCachedItemHeights[e.permutation[index]] =
657 sm.adjustToReordering(e.permutation);
[all...] |
| /external/chromium_org/chrome/common/extensions/docs/examples/extensions/plugin_settings/domui/js/cr/ui/ |
| list.js | 569 if (e.permutation[index] != -1)
570 newCachedItems[e.permutation[index]] = this.cachedItems_[index];
580 sm.adjustToReordering(e.permutation);
|
