Searched defs:permutation (Results 1 - 6 of 6) sorted by relevance

/external/chromium_org/chrome/browser/resources/file_manager/js/
H A Dfolder_shortcuts_data_model.js38 var permutation = this.calculatePermitation_(this.array_, list);
40 this.firePermutedEvent_(permutation);
69 var permutation = this.calculatePermitation_(this.array_, list);
71 this.firePermutedEvent_(permutation);
215 * Creates a permutation array for 'permuted' event, which is compatible with
220 * @return {Array.<number>} Created permutation array.
228 var permutation = []; variable
232 permutation[oldIndex] = -1;
240 permutation[oldIndex] = newIndex;
247 permutation[oldInde
[all...]
/external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/noise/basis/
H A DImprovedNoise.java101 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, field in class:ImprovedNoise
118 ImprovedNoise.p[256 + i] = ImprovedNoise.p[i] = ImprovedNoise.permutation[i];
/external/chromium_org/third_party/sqlite/src/test/
H A Dtester.tcl72 # 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 DPermutationMatrix.h25 * 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 DLevenbergMarquardt.h103 PermutationMatrix<Dynamic,Dynamic> permutation; member in class:Eigen::LevenbergMarquardt
224 permutation = qrfac.colsPermutation();
251 if (wa2[permutation.indices()[j]] != 0.)
252 gnorm = (std::max)(gnorm, internal::abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
453 permutation.setIdentity(n);
462 permutation = qrfac.colsPermutation();
498 if (wa2[permutation.indices()[j]] != 0.)
499 gnorm = (std::max)(gnorm, internal::abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
512 internal::lmpar<Scalar>(fjac, permutation.indices(), diag, qtf, delta, par, wa1);
536 wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation
[all...]
/external/ceres-solver/internal/ceres/
H A Dcovariance_impl.cc656 SuiteSparse_long* permutation = NULL; local
677 &permutation,
680 CHECK_NOTNULL(permutation);
687 delete []permutation;
695 inverse_permutation[permutation[i]] = i;
742 delete []permutation;

Completed in 236 milliseconds