HomeSort by relevance Sort by last modified time
    Searched full:permutation (Results 126 - 150 of 374) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/boringssl/src/crypto/evp/
scrypt.c 103 /* This implements the permutation in step 3. */
  /external/eigen/Eigen/src/Core/arch/AVX512/
PacketMath.h 465 // mimic an "inplace" permutation of the lower 128bits using a blend
470 // then we can perform a consistent permutation on the global register to get
475 // mimic an "inplace" permutation of the lower 128bits using a blend
480 // then we can perform a consistent permutation on the global register to get
    [all...]
  /external/eigen/doc/
SparseQuickReference.dox 151 <td> Permutation </td>
FunctionsTakingEigenTypes.dox 20 \li EigenBase: The base class unifying all types of objects that can be evaluated into dense matrices or arrays, for example special matrix classes such as diagonal matrices, permutation matrices, etc. It can be used in functions that are meant to work on any such general type.
  /external/eigen/unsupported/Eigen/CXX11/src/ThreadPool/
NonBlockingThreadPool.h 39 // repetitions (effectively getting a presudo-random permutation of thread
  /external/eigen/unsupported/Eigen/src/EulerAngles/
EulerSystem.h 170 // I, J, K are the pivot indexes permutation for the rotation matrix, that match this Euler system.
  /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
Collections2Test.java 310 assertTrue("Expected another permutation, but there was none.",
  /external/icu/icu4c/source/i18n/
collationdatareader.h 169 * Primary-weight lead byte permutation table.
  /external/mesa3d/docs/relnotes/
11.0.8.html 113 <li>nv50/ir: fix instruction permutation logic</li>
  /external/swiftshader/third_party/LLVM/lib/Target/PowerPC/
PPCSchedule.td 20 def VPU : FuncUnit; // vector permutation unit
  /external/swiftshader/third_party/subzero/src/
IceRegAlloc.cpp 786 llvm::SmallVector<RegNumT, REGS_SIZE> Permutation(NumRegisters);
796 Permutation, PreDefinedRegisters | ~RegMaskFull, Salt);
799 // Finish up by setting RegNum = RegNumTmp (or a random permutation thereof)
806 AssignedRegNum = Permutation[RegNum];
    [all...]
  /frameworks/rs/script_api/
Generator.cpp 41 * - Permutation: A concrete version of a specification, where all placeholders have
  /external/eigen/Eigen/src/Core/arch/AVX/
PacketMath.h 231 // mimic an "inplace" permutation of the lower 128bits using a blend
233 // then we can perform a consistent permutation on the global register to get everything in shape:
  /external/eigen/Eigen/src/Core/util/
Constants.h 499 /** The type used to identify a permutation storage. */
502 /** The type used to identify a permutation storage. */
  /external/eigen/Eigen/src/PaStiXSupport/
PaStiXSupport.h 249 mutable Matrix<StorageIndex,Dynamic,1> m_perm; // Permutation vector
250 mutable Matrix<StorageIndex,Dynamic,1> m_invp; // Inverse permutation vector
  /external/eigen/Eigen/src/PardisoSupport/
PardisoSupport.h 200 m_iparm[4] = 0; // No user fill-in reducing permutation
206 m_iparm[10] = symmetric ? 0 : 1; // Use nonsymmetric permutation and scaling MPS
  /external/eigen/Eigen/src/QR/
FullPivHouseholderQR.h 47 * by using Householder transformations. Here, \b P and \b P' are permutation matrices, \b Q a unitary matrix
197 /** \returns a const reference to the column permutation matrix */
  /external/icu/android_icu4j/src/main/java/android/icu/impl/coll/
CollationData.java 287 * Writes the permutation of primary-weight ranges
532 * Uses include building a reordering permutation table and
  /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
CollationData.java 285 * Writes the permutation of primary-weight ranges
530 * Uses include building a reordering permutation table and
  /packages/apps/Launcher3/src/com/android/launcher3/util/
FocusLogic.java 324 // TODO: add unit tests to verify all permutation.
407 // TODO: add unit tests to verify all permutation.
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
fset2.c 1019 /* see if e exists in s as a possible input permutation (e is always a chain) */
1047 /* see if e exists in s as a possible input permutation (e is always a chain);
1117 /* remove the permutation p from t if present */
1161 /* add the permutation 'perm' to the LL_k sets in 'fset' */
1192 if ( t==NULL&&k<max_k ) /* no permutation left below for k+1 tokens? */
    [all...]
  /external/deqp/external/vulkancts/modules/vulkan/spirv_assembly/
vktSpvAsmInstructionTests.cpp 5226 ShaderPermutation permutation = local
5265 ShaderPermutation permutation = getShaderPermutation(idx); local
    [all...]
  /external/icu/icu4c/source/test/perf/collperf2/
collperf2.cpp 89 // call strcoll for permutation
201 // call strcollUTF8 for permutation
500 // call compare for permutation of test data
    [all...]
  /external/eigen/test/
cholesky.cpp 196 // note : each inplace permutation requires a small temporary vector (mask)
  /external/guava/guava-tests/test/com/google/common/collect/
Collections2Test.java 468 assertTrue("Expected another permutation, but there was none.",

Completed in 2391 milliseconds

1 2 3 4 56 7 8 91011>>