HomeSort by relevance Sort by last modified time
    Searched refs:permutation (Results 1 - 25 of 40) sorted by null

1 2

  /external/libcxxabi/src/Unwind/
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 -= (permunreg[3] * 2)
357 uint32_t permutation = local
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++abi/libcxxabi/src/Unwind/
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 -= (permunreg[3] * 2)
357 uint32_t permutation = local
    [all...]
  /external/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/
Android.mk 17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/Android.mk
19 test_name := algorithms/alg.sorting/alg.permutation.generators/next_permutation
23 test_name := algorithms/alg.sorting/alg.permutation.generators/next_permutation_comp
27 test_name := algorithms/alg.sorting/alg.permutation.generators/prev_permutation_comp
31 test_name := algorithms/alg.sorting/alg.permutation.generators/prev_permutation
  /external/chromium_org/third_party/angle/tests/angle_tests/
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.swizzleBlue)
    [all...]
  /external/chromium_org/third_party/webrtc/voice_engine/
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/ui/file_manager/file_manager/foreground/js/
navigation_list_model.js 116 var permutation;
124 for (var i = 0; i < event.permutation.length; i++) {
125 if (event.permutation[i] >= 0)
126 newList[event.permutation[i]] = this.volumeList_[i];
138 permutation = event.permutation.slice();
140 // shortcutList part has not been changed, so the permutation should be
143 permutation.push(i + this.volumeList_.length);
148 // volumeList part has not been changed, so the permutation should be
151 permutation = []
    [all...]
folder_shortcuts_data_model.js 412 * Creates a permutation array for 'permuted' event, which is compatible with
413 * a permutation array used in cr/ui/array_data_model.js.
417 * @return {Array.<number>} Created permutation array.
425 var permutation = []; variable
429 permutation[oldIndex] = -1;
437 permutation[oldIndex] = newIndex;
444 permutation[oldIndex] = -1;
453 return permutation;
458 * @param {Array.<number>} Permutation array.
460 firePermutedEvent_: function(permutation) {
    [all...]
  /external/chromium_org/components/url_matcher/
substring_set_matcher_unittest.cc 48 for (int permutation = 0; permutation < 2; ++permutation) {
50 if (permutation == 0) {
  /external/eigen/unsupported/Eigen/src/NonLinearOptimization/
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.inverse() * wa1)
    [all...]
  /external/ceres-solver/internal/ceres/
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/flac/libFLAC/ppc/as/
lpc_asm.s 98 vsel v0,v1,v0,v2 ; v0: reversal permutation vector
101 lvsl v17,0,r5 ; v17: coefficient alignment permutation vector
102 vperm v17,v17,v17,v0 ; v17: reversal coefficient alignment permutation vector
105 lvsl v16,0,r11 ; v16: history alignment permutation vector
347 vsel v0,v1,v0,v2 ; v0: reversal permutation vector
350 lvsl v5,0,r5 ; v5: coefficient alignment permutation vector
351 vperm v5,v5,v5,v0 ; v5: reversal coefficient alignment permutation vector
354 lvsl v4,0,r11 ; v4: history alignment permutation vector
  /external/flac/libFLAC/ppc/gas/
lpc_asm.s 100 vsel v0,v1,v0,v2 # v0: reversal permutation vector
103 lvsl v17,0,r5 # v17: coefficient alignment permutation vector
104 vperm v17,v17,v17,v0 # v17: reversal coefficient alignment permutation vector
107 lvsl v16,0,r11 # v16: history alignment permutation vector
349 vsel v0,v1,v0,v2 # v0: reversal permutation vector
352 lvsl v5,0,r5 # v5: coefficient alignment permutation vector
353 vperm v5,v5,v5,v0 # v5: reversal coefficient alignment permutation vector
356 lvsl v4,0,r11 # v4: history alignment permutation vector
  /external/eigen/unsupported/Eigen/src/SVD/
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;
  /external/eigen/Eigen/src/Core/
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
33 * Permutation matrices are square and invertible.
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
    [all...]
  /external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ppc/
filter_bilinear_altivec.asm 48 ;# v14 permutation value for alignment
177 ;# Load up permutation constants
262 ;# Load up permutation constants
348 ;# Load up permutation constants
variance_subpixel_altivec.asm 48 ;# v14 permutation value for alignment
204 ;# Load up permutation constants
295 ;# Load up permutation constants
405 ;# Load up permutation constants
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/libvpx/libvpx/vp8/common/ppc/
filter_bilinear_altivec.asm 48 ;# v14 permutation value for alignment
177 ;# Load up permutation constants
262 ;# Load up permutation constants
348 ;# Load up permutation constants
variance_subpixel_altivec.asm 48 ;# v14 permutation value for alignment
204 ;# Load up permutation constants
295 ;# Load up permutation constants
405 ;# Load up permutation constants
filter_altivec.asm 221 ;# Load up permutation constants
411 ;# Load up permutation constants
583 ;# Load up permutation constants
800 ;# v14 permutation value for alignment
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/ppc/
filter_bilinear_altivec.asm 48 ;# v14 permutation value for alignment
177 ;# Load up permutation constants
262 ;# Load up permutation constants
348 ;# Load up permutation constants
variance_subpixel_altivec.asm 48 ;# v14 permutation value for alignment
204 ;# Load up permutation constants
295 ;# Load up permutation constants
405 ;# Load up permutation constants
  /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
LevenbergMarquardt.h 211 /** the permutation used in the QR factorization
213 PermutationType permutation() {return m_permutation; } function in class:Eigen::LevenbergMarquardt
  /external/owasp/sanitizer/empiricism/
html-containment.js 9 * calls it iteratively with every permutation of length element names.
54 // Advance to next permutation.
  /external/chromium_org/third_party/sqlite/src/test/
tester.tcl 72 # permutation
157 # --start=[$permutation:]$testfile
205 set ::G(start:permutation) ${s.perm}
1286 proc permutation {} { procedure
    [all...]

Completed in 1925 milliseconds

1 2