| /external/ipsec-tools/src/racoon/samples/ |
| racoon.conf.sample | 53 # - permutation of the crypto/hash/compression algorithms presented below
|
| /frameworks/rs/script_api/ |
| GenerateTestFiles.cpp | 48 // Returns true if any permutation of the function have tests to b
58 /* One instance of this class is generated for each permutation of a function for which
60 * section of the test files for this permutation. The class is mostly used to keep track
94 * for this test file, as more than one permutation may use the same argument class.
164 /* NOTE: We keep pointers to the permutation and the files. This object should not
167 PermutationWriter(FunctionPermutation& permutation, GeneratedFile* rsFile,
171 // Write the script test function for this permutation.
177 PermutationWriter::PermutationWriter(FunctionPermutation& permutation, GeneratedFile* rsFile,
179 : mPermutation(permutation),
184 mRsKernelName = "test" + capitalize(permutation.getName())
[all...] |
| /prebuilts/go/darwin-x86/test/bench/go1/ |
| fannkuch_test.go | 23 perm1[i] = i // initial (trivial) permutation
|
| /prebuilts/go/linux-x86/test/bench/go1/ |
| fannkuch_test.go | 23 perm1[i] = i // initial (trivial) permutation
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| BigMatrixImpl.java | 78 /** Permutation associated with LU decomposition */
79 protected int[] permutation = null; field in class:BigMatrixImpl
81 /** Parity of the permutation associated with the LU decomposition */
[all...] |
| /external/eigen/Eigen/src/Core/ |
| Transpositions.h | 50 /** \returns the number of rows of the equivalent permutation matrix */
52 /** \returns the number of columns of the equivalent permutation matrix */
136 * This class represents a permutation transformation as a sequence of \em n transpositions
143 * computed during a decomposition with pivoting, and it is faster when applying the permutation in-place.
203 /** Constructs an uninitialized permutation matrix of given size.
|
| /external/eigen/Eigen/src/SparseQR/ |
| SparseQR.h | 51 * P is the column permutation which is the product of the fill-reducing and the
176 /** \returns a const reference to the column permutation P that was applied to A such that A*P = Q*R
177 * It is the combination of the fill-in reducing permutation and numerical column pivoting.
209 // Apply the column permutation
282 PermutationType m_perm_c; // Fill-reducing Column permutation
283 PermutationType m_pivotperm; // The permutation for rank revealing
284 PermutationType m_outputPerm_c; // The final column permutation
301 * In this step, the fill-reducing permutation is computed and applied to the columns of A
374 // Apply the fill-in reducing permutation lazily:
408 // Initialize the numerical permutation
[all...] |
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| LevenbergMarquardt.h | 109 PermutationMatrix<Dynamic,Dynamic> permutation; member in class:Eigen::LevenbergMarquardt
234 permutation = qrfac.colsPermutation();
261 if (wa2[permutation.indices()[j]] != 0.)
262 gnorm = (std::max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
466 permutation.setIdentity(n);
475 permutation = qrfac.colsPermutation();
511 if (wa2[permutation.indices()[j]] != 0.)
512 gnorm = (std::max)(gnorm, abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
525 internal::lmpar<Scalar>(fjac, permutation.indices(), diag, qtf, delta, par, wa1);
549 wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation.inverse() * wa1)
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
| CollationSettings.java | 129 // When we turn off reordering, we want to set a null permutation
130 // rather than a no-op permutation.
203 // Write the lead byte permutation table.
230 // The lead byte permutation table alone suffices for reordering.
448 * 256-byte table for reordering permutation of primary lead bytes; null if no reordering.
479 // the ranges, and the permutation table,
|
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
| CollationSettings.java | 127 // When we turn off reordering, we want to set a null permutation
128 // rather than a no-op permutation.
201 // Write the lead byte permutation table.
228 // The lead byte permutation table alone suffices for reordering.
446 * 256-byte table for reordering permutation of primary lead bytes; null if no reordering.
477 // the ranges, and the permutation table,
|
| /external/libunwind_llvm/include/mach-o/ |
| compact_unwind_encoding.h | 63 // 15-bits (5*3-bits per reg) register permutation
69 // 10-bits register permutation
136 // The permutation encoding is a Lehmer code sequence encoded into a
140 // The following is the algorithm used to create the permutation encoding used
198 // 15-bits (5*3-bits per reg) register permutation
204 // 10-bits register permutation
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++abi/libcxxabi/include/mach-o/ |
| compact_unwind_encoding.h | 63 // 15-bits (5*3-bits per reg) register permutation
69 // 10-bits register permutation
136 // The permutation encoding is a Lehmer code sequence encoded into a
140 // The following is the algorithm used to create the permutation encoding used
198 // 15-bits (5*3-bits per reg) register permutation
204 // 10-bits register permutation
|
| /bionic/libc/upstream-openbsd/lib/libc/net/ |
| res_random.c | 14 * permutation generator based on a Luby-Rackoff block cipher. This
132 * 15-bit permutation based on Luby-Rackoff block cipher
216 /* Initialise PRF for Luby-Rackoff permutation */
|
| /external/eigen/Eigen/ |
| OrderingMethods | 23 * Precisely, in a preprocessing step, a permutation matrix P is computed using
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_Utils.h | 48 * and applies permutation to the remaining subscripts
|
| SparseLU_pivotL.h | 52 * \param[in,out] perm_r Row permutation (threshold pivoting)
53 * \param[in] iperm_c column permutation - used to finf diagonal of Pc*A*Pc'
|
| /external/icu/icu4c/source/i18n/ |
| collationsettings.cpp | 75 // When we turn off reordering, we want to set a NULL permutation
76 // rather than a no-op permutation.
154 // Write the lead byte permutation table.
180 // The lead byte permutation table alone suffices for reordering.
|
| /system/update_engine/payload_generator/ |
| delta_diff_utils_unittest.cc | 669 vector<uint64_t> permutation = {0, 1, 5, 6, 7, 2, 3, 4, 9, 10, 11, 12, 8}; local
671 for (uint64_t x : permutation)
675 old_part_.size = block_size_ * permutation.size();
676 new_part_.size = block_size_ * permutation.size();
680 // |permutation| order. Block i in the old_part_ will contain the same data
681 // as block permutation[i] in the new_part_.
690 EXPECT_EQ(permutation.size(), old_visited_blocks_.blocks());
691 EXPECT_EQ(permutation.size(), new_visited_blocks_.blocks());
702 EXPECT_EQ(ExtentForRange(0, permutation.size()), aop.op.dst_extents(0));
|
| /external/eigen/Eigen/src/MetisSupport/ |
| MetisSupport.h | 17 * the fill-reducing permutation is defined as follows :
121 // Get the fill-reducing permutation
|
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 48 * In order to reduce the fill-in, a symmetric permutation P is applied prior to the factorization
113 /** \returns the permutation P
118 /** \returns the inverse P^-1 of the permutation P
259 PermutationMatrix<Dynamic,Dynamic,StorageIndex> m_P; // the permutation
260 PermutationMatrix<Dynamic,Dynamic,StorageIndex> m_Pinv; // the inverse permutation
317 * In order to reduce the fill-in, a symmetric permutation P is applied prior to the factorization
408 * In order to reduce the fill-in, a symmetric permutation P is applied prior to the factorization
655 // Note that ordering methods compute the inverse permutation
|
| /external/guava/guava/src/com/google/common/collect/ |
| Collections2.java | 333 * the first permutation will be in ascending order, and the last will be in
337 * will have only one permutation, instead of two. This is why the elements
340 * <p>An empty iterable has only one permutation, which is an empty list.
388 * the first permutation will be in ascending order, and the last will be in
394 * <p>An empty iterable has only one permutation, which is an empty list.
548 * <p>An empty collection has only one permutation, which is an empty list.
626 // next permutation.
659 * Returns {@code true} if the second list is a permutation of the first.
|
| /cts/tests/camera/src/android/hardware/camera2/cts/rs/ |
| raw_converter.rs | 97 int permutation = 0;
104 permutation |= 1;
110 permutation |= 2;
116 permutation |= 4;
138 switch (permutation) {
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| IncompleteCholesky.h | 34 * fill-in reducing permutation as computed by the ordering method.
114 /** \brief Computes the fill reducing permutation vector using the sparsity pattern of \a mat
174 /** \returns the fill-in reducing permutation P (can be empty for a natural ordering) */
203 // Apply the fill-reducing permutation computed in analyzePattern()
204 if (m_perm.rows() == mat.rows() ) // To detect the null permutation
|
| IncompleteLUT.h | 197 PermutationMatrix<Dynamic,Dynamic,StorageIndex> m_P; // Fill-reducing permutation
198 PermutationMatrix<Dynamic,Dynamic,StorageIndex> m_Pinv; // Inverse permutation
225 // Compute the Fill-reducing permutation
237 m_Pinv = m_P.inverse(); // cache the inverse permutation
268 // Apply the fill-reducing permutation
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/random/ |
| RandomDataImpl.java | 823 * Uses a 2-cycle permutation shuffle. The shuffling process is described <a
829 * domain of the permutation (must be positive)
[all...] |
