| /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/chromium_org/third_party/sqlite/src/test/ |
| 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"} {
|
| ioerr.test | 139 # It cannot be run under the "exclusive" permutation. In that case, the
144 if {![catch {sqlite3 -has-codec} r] && !$r && [permutation]!="exclusive"} {
|
| walfault.test | 53 if {[permutation] != "inmemory_journal"} {
129 if {[permutation] != "inmemory_journal"} {
|
| main.test | 301 if {[permutation] == ""} {
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 26 * is a permutation matrix.
106 /** \returns the permutation matrix P.
|
| /external/ceres-solver/internal/ceres/ |
| solver_impl.h | 174 // columns to reduce the fill-in. Compute this permutation and
|
| visibility_based_preconditioner.h | 107 // correspond to tri-diagonal matrices. Thus there exist a permutation
|
| suitesparse.h | 162 // that the symbolic factor does not introduce an extra permutation
|
| /external/chromium/chrome/browser/resources/shared/js/cr/ui/table/ |
| table_data_model.js | 89 * This implementation runs sort after splice and creates permutation for
|
| /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/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 33 * matrix \f$ A \f$ such that \f$ A = P^TLDL^*P \f$, where P is a permutation matrix, L
123 /** \returns the permutation matrix P as a transposition sequence.
383 // Apply the permutation to the input w
|
| /external/chromium_org/ui/webui/resources/js/cr/ui/ |
| list.js | 627 if (e.permutation[index] != -1) {
628 var newIndex = e.permutation[index];
637 if (e.permutation[index] != -1) {
638 newCachedItemHeights[e.permutation[index]] =
648 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);
|
| /external/eigen/test/ |
| cholesky.cpp | 152 // note : each inplace permutation requires a small temporary vector (mask)
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCSchedule.td | 20 def VPU : FuncUnit; // vector permutation unit
|
| /external/eigen/Eigen/src/PaStiXSupport/ |
| PaStiXSupport.h | 290 mutable Matrix<Index,Dynamic,1> m_perm; // Permutation vector
291 mutable Matrix<Index,Dynamic,1> m_invp; // Inverse permutation vector
|
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 249 m_iparm[4] = 0; // No user fill-in reducing permutation
255 m_iparm[10] = symmetric ? 0 : 1; // Use nonsymmetric permutation and scaling MPS
|
| /external/chromium_org/components/variations/ |
| entropy_provider_unittest.cc | 54 // Generates permutation-based entropy for the given |trial_name| based on
|
| /external/chromium_org/third_party/openssl/openssl/apps/ |
| passwd.c | 381 /* silly output permutation */
|
| /external/chromium_org/third_party/opus/src/celt/ |
| modes.c | 262 /* The good thing here is that permutation of the arguments will automatically be invalid */
|
