| /external/libunwind_llvm/src/ |
| 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)
359 uint32_t permutation = local
[all...] |
| /prebuilts/ndk/r11/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/apache-commons-math/src/main/java/org/apache/commons/math/genetics/ |
| PermutationChromosome.java | 22 * Interface indicating that the chromosome represents a permutation of objects.
33 * permutation this chromosome represents. For example, if this chromosome
34 * represents a permutation (3,0,1,2), and the unpermuted sequence is
39 * @return permutation of <code>sequence</code> represented by this
40 * permutation
|
| RandomKey.java | 27 * Random Key chromosome is used for permutation representation. It is a vector
29 * smallest value in the vector represents an i-th member of the permutation.
34 * permutation of indices (3,0,1,2). If the original (unpermuted) sequence would
40 * used, because any such chromosome represents a valid permutation.
79 * @param representation list of [0,1] values representing the permutation
87 // store the permutation of [0,1,...,n-1] list for toString() and isSame() methods
96 * @param representation array of [0,1] values representing the permutation
110 * Decodes a permutation represented by <code>representation</code> and
115 * @param representation representation of the permutation ([0,1] vector)
143 * encodes the same permutation
[all...] |
| /external/eigen/Eigen/src/Core/ |
| PermutationMatrix.h | 29 * This class is the base class for all expressions representing a permutation matrix,
31 * The convention followed here is that if \f$ \sigma \f$ is a permutation, the corresponding permutation matrix
37 * Permutation matrices are square and invertible.
40 * operator* to multiply any kind of permutation object with any kind of matrix expression (MatrixBase)
72 /** Copies the other permutation into *this */
120 /** \returns a Matrix object initialized from this permutation matrix. Notice that it
131 /** \returns a reference to the stored array representing the permutation. */
141 /** Sets *this to be the identity permutation matrix */
149 /** Sets *this to be the identity permutation matrix of given size
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| FieldLUDecomposition.java | 26 * such that P×A = L×U. P is a rows permutation matrix that is used
65 * Returns the P rows permutation matrix.
69 * pivot permutation vector}.</p>
70 * @return the P rows permutation matrix (or null if decomposed matrix is singular)
76 * Returns the pivot permutation vector.
77 * @return the pivot permutation vector
|
| LUDecomposition.java | 25 * such that P×A = L×U. P is a rows permutation matrix that is used
63 * Returns the P rows permutation matrix.
67 * pivot permutation vector}.</p>
68 * @return the P rows permutation matrix (or null if decomposed matrix is singular)
74 * Returns the pivot permutation vector.
75 * @return the pivot permutation vector
|
| LUDecompositionImpl.java | 28 * upper triangular and P is a permutation matrix. All matrices are
44 /** Pivot permutation associated with LU decomposition */
47 /** Parity of the permutation associated with the LU decomposition */
93 // Initialize permutation array and parity
116 int max = col; // permutation row
126 // maintain best permutation choice
237 /** Pivot permutation associated with LU decomposition. */
246 * @param pivot pivot permutation associated with LU decomposition
|
| FieldLUDecompositionImpl.java | 31 * upper triangular and P is a permutation matrix. All matrices are
34 * operator, the permutation matrix is computed here only in order to avoid
49 /** Pivot permutation associated with LU decomposition */
52 /** Parity of the permutation associated with the LU decomposition */
87 // Initialize permutation array and parity
110 int nonZero = col; // permutation row
120 // try to select a better permutation choice
234 /** Pivot permutation associated with LU decomposition. */
244 * @param pivot pivot permutation associated with LU decomposition
|
| /prebuilts/go/darwin-x86/src/crypto/des/ |
| block.go | 26 // switch left & right and perform final permutation
62 func permuteBlock(src uint64, permutation []uint8) (block uint64) {
63 for position, n := range permutation {
65 block |= bit << uint((len(permutation)-1)-position)
97 // permuteInitialBlock is equivalent to the permutation defined
110 // block is now b1 b3 b5 b7 b0 b2 b4 b7, the permutation:
125 // block is the permutation:
139 // block is the permutation:
153 // block is the permutation:
165 // permuteInitialBlock is equivalent to the permutation define
[all...] |
| /prebuilts/go/linux-x86/src/crypto/des/ |
| block.go | 26 // switch left & right and perform final permutation
62 func permuteBlock(src uint64, permutation []uint8) (block uint64) {
63 for position, n := range permutation {
65 block |= bit << uint((len(permutation)-1)-position)
97 // permuteInitialBlock is equivalent to the permutation defined
110 // block is now b1 b3 b5 b7 b0 b2 b4 b7, the permutation:
125 // block is the permutation:
139 // block is the permutation:
153 // block is the permutation:
165 // permuteInitialBlock is equivalent to the permutation define
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
| LevenbergMarquardtOptimizer.java | 121 /** Columns permutation array. */
122 private int[] permutation; field in class:LevenbergMarquardtOptimizer
251 permutation = new int[cols];
289 int pk = permutation[k];
318 int pj = permutation[j];
346 int pj = permutation[j];
363 int pj = permutation[j];
388 int pj = permutation[j];
445 int pj = permutation[j];
510 lmDir[permutation[j]] = qy[j]
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/ |
| LevenbergMarquardtEstimator.java | 124 /** Columns permutation array. */
125 private int[] permutation; field in class:LevenbergMarquardtEstimator
258 permutation = new int[cols];
289 int pk = permutation[k];
318 int pj = permutation[j];
345 int pj = permutation[j];
359 int pj = permutation[j];
385 int pj = permutation[j];
435 int pj = permutation[j];
503 lmDir[permutation[j]] = qy[j]
[all...] |
| /external/toolchain-utils/bestflags/ |
| generation_test.py | 23 # The stride of permutation used to shuffle the input list of tasks. Should be
54 permutation = [(t * STRIDE) % NUM_TASKS for t in range(NUM_TASKS)]
55 permuted_tasks = [testing_tasks[index] for index in permutation]
|
| /external/webrtc/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/eigen/Eigen/src/OrderingMethods/ |
| Ordering.h | 57 /** Compute the permutation vector from a sparse matrix
72 /** Compute the permutation with a selfadjoint matrix */
91 * \note Returns an empty permutation matrix
100 /** Compute the permutation vector from a column-major sparse matrix */
124 /** Compute the permutation vector \a perm form the sparse matrix \a mat
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparsePermutation.h | 13 // This file implements sparse * permutation products
143 /** \returns the matrix with the permutation applied to the columns
150 /** \returns the matrix with the permutation applied to the rows
158 /** \returns the matrix with the inverse permutation applied to the columns.
167 /** \returns the matrix with the inverse permutation applied to the rows.
|
| /frameworks/rs/script_api/ |
| GenerateHeaderFiles.cpp | 202 const FunctionPermutation& permutation) {
207 const auto inlineCodeLines = permutation.getInline();
215 auto ret = permutation.getReturn();
227 *file << " " << permutation.getName() << "(";
228 const int offset = 4 + permutation.getName().size() + 1; // Size of above
233 for (auto p : permutation.getParams()) {
311 for (auto permutation : spec.getPermutations()) {
312 writeFunctionPermutation(file, spec, *permutation);
|
| GenerateStubsWhiteList.cpp | 322 /* Add the mangling for this permutation of the function. apiLevel and intSize is used
326 const FunctionPermutation& permutation, bool overloadable,
328 const string& functionName = permutation.getName();
333 if (!writeParameters(&stream, permutation.getParams(), apiLevel, intSize)) {
370 for (auto permutation : spec.getPermutations()) {
372 if (!addFunctionManglingToSet(function, *permutation, overloadable, apiLevel, 32,
378 if (!addFunctionManglingToSet(function, *permutation, overloadable, apiLevel, 64,
436 /* Write to the file the globals needed to make the call for this permutation. The actual
442 const FunctionPermutation& permutation) {
446 const auto ret = permutation.getReturn()
[all...] |
| /development/samples/ApiDemos/src/com/example/android/apis/graphics/kube/ |
| Kube.java | 124 // initialize our permutation to solved position
296 // permutation for UP layer
298 // permutation for DOWN layer
300 // permutation for LEFT layer
302 // permutation for RIGHT layer
304 // permutation for FRONT layer
306 // permutation for BACK layer
308 // permutation for MIDDLE layer
310 // permutation for EQUATOR layer
312 // permutation for SIDE laye
[all...] |
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU.h | 49 * // Compute the ordering permutation vector from the structural pattern of A
162 * \returns a reference to the row matrix permutation \f$ P_r \f$ such that \f$P_r A P_c^T = L U\f$
170 * \returns a reference to the column matrix permutation\f$ P_c^T \f$ such that \f$P_r A P_c^T = L U\f$
378 PermutationType m_perm_c; // Column permutation
379 PermutationType m_perm_r ; // Row permutation
390 Index m_detPermR, m_detPermC; // Determinants of the permutation matrices
401 * Compute the column permutation to minimize the fill-in
403 * - Apply this permutation to the input matrix -
407 * - Postorder the elimination tree and the column permutation
423 // Apply the permutation to the column of the input matri
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 204 /** \brief Compute permutation which groups ei'vals in same cluster together */
206 void matrix_function_compute_permutation(const DynVectorType& blockStart, const DynVectorType& eivalToCluster, VectorType& permutation)
210 permutation.resize(eivalToCluster.rows());
213 permutation[i] = indexNextEntry[cluster];
218 /** \brief Permute Schur decomposition in U and T according to permutation */
220 void matrix_function_permute_schur(VectorType& permutation, MatrixType& U, MatrixType& T)
223 for (Index i = 0; i < permutation.rows() - 1; i++) {
225 for (j = i; j < permutation.rows(); j++) {
226 if (permutation(j) == i) break;
228 eigen_assert(permutation(j) == i)
452 Matrix<Index, Traits::RowsAtCompileTime, 1> permutation; local
[all...] |
| /external/toolchain-utils/go/patch/ |
| go7.patch | 113 // "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/SPQRSupport/ |
| SuiteSparseQRSupport.h | 44 * P is the column permutation. Use colsPermutation() to get it.
165 // Apply the column permutation
166 // colsPermutation() performs a copy of the permutation,
193 /// Get the permutation that was applied to columns of A
241 mutable StorageIndex *m_E; // The permutation applied to columns
243 mutable StorageIndex *m_HPinv; // The row permutation of H
|
| /platform_testing/libraries/aupt-lib/src/android/support/test/aupt/ |
| Scheduler.java | 134 * the elements are permuted by (a x + b % n), will produce a permutation of the elements of n
137 * The reason to do this is that it also produces a permutation each cases.size() rounds, which
|
