| /external/chromium_org/ui/file_manager/file_manager/foreground/js/ |
| H A D | folder_shortcuts_data_model.js | 409 * Creates a permutation array for 'permuted' event, which is compatible with
410 * a permutation array used in cr/ui/array_data_model.js.
414 * @return {Array.<number>} Created permutation array.
422 var permutation = []; variable
426 permutation[oldIndex] = -1;
434 permutation[oldIndex] = newIndex;
441 permutation[oldIndex] = -1;
450 return permutation;
455 * @param {Array.<number>} permutation Permutation array.
457 firePermutedEvent_: function(permutation) {
[all...] |
| /external/chromium_org/third_party/webrtc/voice_engine/ |
| H A D | level_indicator.cc | 23 const int8_t permutation[33] = member in namespace:webrtc::voe
73 // the permutation vector
82 _currentLevel = permutation[position];
|
| /external/chromium_org/third_party/angle/tests/angle_tests/ |
| H A D | SwizzleTest.cpp | 36 swizzlePermutation permutation; local
37 permutation.swizzleRed = swizzles[r];
38 permutation.swizzleGreen = swizzles[g];
39 permutation.swizzleBlue = swizzles[b];
40 permutation.swizzleAlpha = swizzles[a];
41 mPermutations.push_back(permutation);
151 const swizzlePermutation& permutation = mPermutations[i]; local
153 glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_R, permutation.swizzleRed);
154 glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_G, permutation.swizzleGreen);
155 glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_B, permutation
[all...] |
| /external/libcxxabi/src/Unwind/ |
| H A D | CompactUnwinder.hpp | 128 uint32_t permutation = local
136 // decompress permutation
140 permunreg[0] = permutation / 120;
141 permutation -= (permunreg[0] * 120);
142 permunreg[1] = permutation / 24;
143 permutation -= (permunreg[1] * 24);
144 permunreg[2] = permutation / 6;
145 permutation -= (permunreg[2] * 6);
146 permunreg[3] = permutation / 2;
147 permutation
357 uint32_t permutation = local
[all...] |
| /external/chromium_org/third_party/sqlite/src/test/ |
| H A D | tester.tcl | 72 # permutation
157 # --start=[$permutation:]$testfile
205 set ::G(start:permutation) ${s.perm}
1265 # Otherwise (if not running a WAL permutation) this is a no-op.
1272 expr {[permutation] eq "wal"}
1286 proc permutation {} { procedure
1340 if {[info exists ::G(start:permutation)]} {
1341 if {[permutation] != $::G(start:permutation)} return
1342 unset ::G(start:permutation)
[all...] |
| /external/eigen/Eigen/src/Core/ |
| H A D | PermutationMatrix.h | 25 * This class is the base class for all expressions representing a permutation matrix,
27 * The convention followed here is that if \f$ \sigma \f$ is a permutation, the corresponding permutation matrix
36 * operator* to multiply any kind of permutation object with any kind of matrix expression (MatrixBase)
78 /** Copies the other permutation into *this */
126 /** \returns a Matrix object initialized from this permutation matrix. Notice that it
137 /** \returns a reference to the stored array representing the permutation. */
147 /** Sets *this to be the identity permutation matrix */
154 /** Sets *this to be the identity permutation matrix of given size.
197 /** \returns the inverse permutation matri
510 operator *(const MatrixBase<Derived>& matrix, const PermutationBase<PermutationDerived> &permutation) argument
523 operator *(const PermutationBase<PermutationDerived> &permutation, const MatrixBase<Derived>& matrix) argument
[all...] |
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| H A D | LevenbergMarquardt.h | 103 PermutationMatrix<Dynamic,Dynamic> permutation; member in class:Eigen::LevenbergMarquardt
227 permutation = qrfac.colsPermutation();
254 if (wa2[permutation.indices()[j]] != 0.)
255 gnorm = (std::max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
459 permutation.setIdentity(n);
468 permutation = qrfac.colsPermutation();
504 if (wa2[permutation.indices()[j]] != 0.)
505 gnorm = (std::max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
518 internal::lmpar<Scalar>(fjac, permutation.indices(), diag, qtf, delta, par, wa1);
542 wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation
[all...] |
| /external/ceres-solver/internal/ceres/ |
| H A D | covariance_impl.cc | 467 SuiteSparse_long* permutation = NULL; local
488 &permutation,
491 CHECK_NOTNULL(permutation);
498 free(permutation);
506 inverse_permutation[permutation[i]] = i;
553 free(permutation);
697 // Compute the inverse column permutation used by QR factorization.
738 // inverse permutation used in the QR factorization.
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| H A D | LevenbergMarquardt.h | 211 /** the permutation used in the QR factorization
213 PermutationType permutation() {return m_permutation; } function in class:Eigen::LevenbergMarquardt
|
| /external/eigen/unsupported/Eigen/src/SVD/ |
| H A D | BDCSVD.h | 602 Index *permutation = new Index[length]; local
606 permutation[p] = j;
610 permutation[p] = i;
616 permutation[p] = j;
621 permutation[p] = i;
626 //we do the permutation
641 const Index j = permutation[length - i] - Zero;
693 delete [] permutation;
|