Home
last modified time | relevance | path

Searched refs:permutation (Results 1 – 25 of 47) sorted by relevance

12

/external/libunwind_llvm/src/
DCompactUnwinder.hpp128 uint32_t permutation = in stepWithCompactEncodingFrameless() local
140 permunreg[0] = permutation / 120; in stepWithCompactEncodingFrameless()
141 permutation -= (permunreg[0] * 120); in stepWithCompactEncodingFrameless()
142 permunreg[1] = permutation / 24; in stepWithCompactEncodingFrameless()
143 permutation -= (permunreg[1] * 24); in stepWithCompactEncodingFrameless()
144 permunreg[2] = permutation / 6; in stepWithCompactEncodingFrameless()
145 permutation -= (permunreg[2] * 6); in stepWithCompactEncodingFrameless()
146 permunreg[3] = permutation / 2; in stepWithCompactEncodingFrameless()
147 permutation -= (permunreg[3] * 2); in stepWithCompactEncodingFrameless()
148 permunreg[4] = permutation; in stepWithCompactEncodingFrameless()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/
DLevenbergMarquardtEstimator.java125 private int[] permutation; field in LevenbergMarquardtEstimator
258 permutation = new int[cols]; in estimate()
289 int pk = permutation[k]; in estimate()
318 int pj = permutation[j]; in estimate()
345 int pj = permutation[j]; in estimate()
359 int pj = permutation[j]; in estimate()
385 int pj = permutation[j]; in estimate()
435 int pj = permutation[j]; in estimate()
503 lmDir[permutation[j]] = qy[j]; in determineLMParameter()
506 lmDir[permutation[j]] = 0; in determineLMParameter()
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/
DLevenbergMarquardtOptimizer.java122 private int[] permutation; field in LevenbergMarquardtOptimizer
251 permutation = new int[cols]; in doOptimize()
289 int pk = permutation[k]; in doOptimize()
318 int pj = permutation[j]; in doOptimize()
346 int pj = permutation[j]; in doOptimize()
363 int pj = permutation[j]; in doOptimize()
388 int pj = permutation[j]; in doOptimize()
445 int pj = permutation[j]; in doOptimize()
510 lmDir[permutation[j]] = qy[j]; in determineLMParameter()
513 lmDir[permutation[j]] = 0; in determineLMParameter()
[all …]
/external/v8/test/cctest/compiler/
Dtest-jump-threading.cc512 int permutation[kSize]; in RunPermutationsRecursive() local
514 for (int i = 0; i < kSize; i++) permutation[i] = outer[i]; in RunPermutationsRecursive()
517 if (count == 0) return run(permutation, kSize); in RunPermutationsRecursive()
519 permutation[start] = outer[i]; in RunPermutationsRecursive()
520 permutation[i] = outer[start]; in RunPermutationsRecursive()
521 RunPermutationsRecursive<kSize>(permutation, start + 1, run); in RunPermutationsRecursive()
522 permutation[i] = outer[i]; in RunPermutationsRecursive()
523 permutation[start] = outer[start]; in RunPermutationsRecursive()
530 int permutation[kSize]; in RunAllPermutations() local
531 for (int i = 0; i < kSize; i++) permutation[i] = i; in RunAllPermutations()
[all …]
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/
DLevenbergMarquardt.h103 PermutationMatrix<Dynamic,Dynamic> permutation; variable
227 permutation = qrfac.colsPermutation(); in minimizeOneStep()
254 if (wa2[permutation.indices()[j]] != 0.) in minimizeOneStep()
255 …:max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]])); in minimizeOneStep()
459 permutation.setIdentity(n); in minimizeOptimumStorageOneStep()
468 permutation = qrfac.colsPermutation(); in minimizeOptimumStorageOneStep()
504 if (wa2[permutation.indices()[j]] != 0.) in minimizeOptimumStorageOneStep()
505 …:max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]])); in minimizeOptimumStorageOneStep()
518 internal::lmpar<Scalar>(fjac, permutation.indices(), diag, qtf, delta, par, wa1); in minimizeOptimumStorageOneStep()
542 … wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation.inverse() * wa1); in minimizeOptimumStorageOneStep()
/external/webrtc/webrtc/voice_engine/
Dlevel_indicator.cc23 const int8_t permutation[33] = variable
82 _currentLevel = permutation[position]; in ComputeLevel()
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
DBigMatrixImpl.java79 protected int[] permutation = null; field in BigMatrixImpl
1165 bpRow[col] = b.getEntry(permutation[row], col); in solve()
1228 permutation = new int[nRows]; in luDecompose()
1230 permutation[row] = row; in luDecompose()
1281 int temp = permutation[max]; in luDecompose()
1282 permutation[max] = permutation[col]; in luDecompose()
1283 permutation[col] = temp; in luDecompose()
1430 final int[] out = new int[permutation.length]; in getPermutation()
1431 System.arraycopy(permutation, 0, out, 0, permutation.length); in getPermutation()
/external/ceres-solver/internal/ceres/
Dcovariance_impl.cc467 SuiteSparse_long* permutation = NULL; in ComputeCovarianceValuesUsingSuiteSparseQR() local
488 &permutation, in ComputeCovarianceValuesUsingSuiteSparseQR()
491 CHECK_NOTNULL(permutation); in ComputeCovarianceValuesUsingSuiteSparseQR()
498 free(permutation); in ComputeCovarianceValuesUsingSuiteSparseQR()
506 inverse_permutation[permutation[i]] = i; in ComputeCovarianceValuesUsingSuiteSparseQR()
553 free(permutation); in ComputeCovarianceValuesUsingSuiteSparseQR()
/external/eigen/unsupported/Eigen/src/SVD/
DBDCSVD.h602 Index *permutation = new Index[length]; in deflation() local
606 permutation[p] = j; in deflation()
610 permutation[p] = i; in deflation()
616 permutation[p] = j; in deflation()
621 permutation[p] = i; in deflation()
641 const Index j = permutation[length - i] - Zero; in deflation()
693 delete [] permutation; in deflation()
/external/eigen/Eigen/src/Core/
DPermutationMatrix.h540 const PermutationBase<PermutationDerived> &permutation)
544 (permutation.derived(), matrix.derived());
552 operator*(const PermutationBase<PermutationDerived> &permutation,
557 (permutation.derived(), matrix.derived());
/external/deqp/external/vulkancts/modules/vulkan/spirv_assembly/
DvktSpvAsmInstructionTests.cpp7137 ShaderPermutation permutation = in getShaderPermutation() local
7145 return permutation; in getShaderPermutation()
7174 ShaderPermutation permutation = getShaderPermutation(idx); in createModuleTests() local
7175 …permutation.vertexPermutation] + "_geom" + numbers[permutation.geometryPermutation] + "_tessc" + n… in createModuleTests()
7178 …ShaderElement("vert", string("vert") + numbers[permutation.vertexPermutation], VK_SHADER_STAGE_VE… in createModuleTests()
7179 …ShaderElement("geom", string("geom") + numbers[permutation.geometryPermutation], VK_SHADER_STAGE_G… in createModuleTests()
7180 …ShaderElement("tessc", string("tessc") + numbers[permutation.tesscPermutation], VK_SHADER_STAGE_T… in createModuleTests()
7181 …ShaderElement("tesse", string("tesse") + numbers[permutation.tessePermutation], VK_SHADER_STAGE_T… in createModuleTests()
7182 …ShaderElement("frag", string("frag") + numbers[permutation.fragmentPermutation], VK_SHADER_STAGE_F… in createModuleTests()
7187 …if ((permutation.vertexPermutation + permutation.geometryPermutation + permutation.tesscPermutatio… in createModuleTests()
/external/ipsec-tools/src/racoon/samples/
Dracoon.conf.sample53 # - permutation of the crypto/hash/compression algorithms presented below
/external/eigen/Eigen/
DOrderingMethods16 * Precisely, in a preprocessing step, a permutation matrix P is computed using
/external/llvm/lib/Target/PowerPC/
DPPCScheduleG4.td20 def G4_VPU : FuncUnit; // vector permutation unit
DPPCScheduleG4Plus.td22 def G4P_VPU : FuncUnit; // vector permutation unit
DPPCScheduleG5.td21 def G5_VPU : FuncUnit; // vector permutation unit
/external/opencv3/samples/python2/
Ddigits_adjust.py78 shuffle = np.random.permutation(len(digits))
Ddigits.py157 shuffle = rand.permutation(len(digits))
/external/eigen/unsupported/Eigen/src/LevenbergMarquardt/
DLevenbergMarquardt.h213 PermutationType permutation() {return m_permutation; } in permutation() function
/external/llvm/test/Transforms/BBVectorize/X86/
Dsimple.ll79 ; Basic depth-4 chain (internal permutation)
/external/eigen/unsupported/test/
Dlevenberg_marquardt.cpp118 internal::covar(lm.matrixR(), lm.permutation().indices()); // TODO : move this as a function of lm in testLmder()
221 internal::covar(lm.matrixR(), lm.permutation().indices()); // TODO : move this as a function of lm in testLmdif()
DNonLinearOptimization.cpp225 internal::covar(lm.fjac, lm.permutation.indices()); // TODO : move this as a function of lm in testLmder()
616 internal::covar(lm.fjac, lm.permutation.indices()); // TODO : move this as a function of lm in testLmdif()
/external/llvm/include/llvm/IR/
DIntrinsicsPowerPC.td796 /// and returns a v4f64 permutation.
918 // Logical and permutation formation
/external/libvpx/libvpx/third_party/libyuv/source/
Dx86inc.asm707 ; If I insert a permutation in the middle of a function, it should automatically
/external/libvorbis/doc/
D07-floor1.tex351 \varname{[floor1_X_list]} and then apply the same permutation to

12