Home
last modified time | relevance | path

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

123

/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/eigen/unsupported/Eigen/src/MatrixFunctions/
DMatrixFunction.h206 …tion(const DynVectorType& blockStart, const DynVectorType& eivalToCluster, VectorType& permutation) in matrix_function_compute_permutation() argument
210 permutation.resize(eivalToCluster.rows()); in matrix_function_compute_permutation()
213 permutation[i] = indexNextEntry[cluster]; in matrix_function_compute_permutation()
220 void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, MatrixType& T) in matrix_function_permute_schur() argument
223 for (Index i = 0; i < permutation.rows() - 1; i++) { in matrix_function_permute_schur()
225 for (j = i; j < permutation.rows(); j++) { in matrix_function_permute_schur()
226 if (permutation(j) == i) break; in matrix_function_permute_schur()
228 eigen_assert(permutation(j) == i); in matrix_function_permute_schur()
235 std::swap(permutation.coeffRef(k), permutation.coeffRef(k+1)); in matrix_function_permute_schur()
452 Matrix<Index, Traits::RowsAtCompileTime, 1> permutation;
[all …]
/external/toolchain-utils/bestflags/
Dgeneration_test.py54 permutation = [(t * STRIDE) % NUM_TASKS for t in range(NUM_TASKS)]
55 permuted_tasks = [testing_tasks[index] for index in permutation]
/external/eigen/unsupported/Eigen/src/NonLinearOptimization/
DLevenbergMarquardt.h109 PermutationMatrix<Dynamic,Dynamic> permutation; variable
234 permutation = qrfac.colsPermutation(); in minimizeOneStep()
261 if (wa2[permutation.indices()[j]] != 0.) in minimizeOneStep()
262 …:max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]])); in minimizeOneStep()
466 permutation.setIdentity(n); in minimizeOptimumStorageOneStep()
475 permutation = qrfac.colsPermutation(); in minimizeOptimumStorageOneStep()
511 if (wa2[permutation.indices()[j]] != 0.) in minimizeOptimumStorageOneStep()
512 …:max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]])); in minimizeOptimumStorageOneStep()
525 internal::lmpar<Scalar>(fjac, permutation.indices(), diag, qtf, delta, par, wa1); in minimizeOptimumStorageOneStep()
549 … 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/toolchain-utils/go/patch/
Dgo7.patch113 // "permutation" is a bad name here, but it is what Smhasher uses.
119 permutation(t, []uint32{0, 1, 2, 3, 4, 5, 6, 7}, 8)
120 permutation(t, []uint32{0, 1 << 29, 2 << 29, 3 << 29, 4 << 29, 5 << 29, 6 << 29, 7 << 29}, 8)
121 permutation(t, []uint32{0, 1}, 20)
/external/eigen/Eigen/src/SVD/
DBDCSVD.h1113 Index *permutation = m_workspaceI.data();
1115 permutation[0] = 0;
1121 permutation[p++] = i;
1126 if (i > k) permutation[p] = j++;
1127 else if (j >= length) permutation[p] = i++;
1128 else if (diag(i) < diag(j)) permutation[p] = j++;
1129 else permutation[p] = i++;
1138 Index pi = permutation[i];
1140 permutation[i-1] = permutation[i];
1143 permutation[i-1] = 0;
[all …]
/external/eigen/Eigen/src/Core/
DPermutationMatrix.h544 const PermutationBase<PermutationDerived>& permutation)
547 (matrix.derived(), permutation.derived());
555 operator*(const PermutationBase<PermutationDerived> &permutation,
559 (permutation.derived(), matrix.derived());
/external/deqp/external/vulkancts/modules/vulkan/spirv_assembly/
DvktSpvAsmInstructionTests.cpp5226 ShaderPermutation permutation = in getShaderPermutation() local
5234 return permutation; in getShaderPermutation()
5265 ShaderPermutation permutation = getShaderPermutation(idx); in createModuleTests() local
5266 …permutation.vertexPermutation] + "_geom" + numbers[permutation.geometryPermutation] + "_tessc" + n… in createModuleTests()
5269 …ShaderElement("vert", string("vert") + numbers[permutation.vertexPermutation], VK_SHADER_STAGE_VE… in createModuleTests()
5270 …ShaderElement("geom", string("geom") + numbers[permutation.geometryPermutation], VK_SHADER_STAGE_G… in createModuleTests()
5271 …ShaderElement("tessc", string("tessc") + numbers[permutation.tesscPermutation], VK_SHADER_STAGE_T… in createModuleTests()
5272 …ShaderElement("tesse", string("tesse") + numbers[permutation.tessePermutation], VK_SHADER_STAGE_T… in createModuleTests()
5273 …ShaderElement("frag", string("frag") + numbers[permutation.fragmentPermutation], VK_SHADER_STAGE_F… in createModuleTests()
5278 …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/
DOrderingMethods23 * 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/eigen/unsupported/Eigen/src/LevenbergMarquardt/
DLevenbergMarquardt.h232 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.cpp124 internal::covar(lm.matrixR(), lm.permutation().indices()); // TODO : move this as a function of lm in testLmder()
227 internal::covar(lm.matrixR(), lm.permutation().indices()); // TODO : move this as a function of lm in testLmdif()
DNonLinearOptimization.cpp226 internal::covar(lm.fjac, lm.permutation.indices()); // TODO : move this as a function of lm in testLmder()
617 internal::covar(lm.fjac, lm.permutation.indices()); // TODO : move this as a function of lm in testLmdif()
/external/swiftshader/third_party/LLVM/lib/Target/PowerPC/
DPPCSchedule.td20 def VPU : FuncUnit; // vector permutation unit
/external/llvm/include/llvm/IR/
DIntrinsicsPowerPC.td796 /// and returns a v4f64 permutation.
918 // Logical and permutation formation
/external/python/cpython2/Doc/library/
Drandom.rst15 of a random element, a function to generate a random permutation of a list
Ditertools.rst495 input *iterable* is sorted, the permutation tuples will be produced
500 values in each permutation.

123