| /external/mesa3d/src/getopt/ |
| getopt_long.c | 316 /* do permutation, if we have to */
344 * If no permutation wanted, stop parsing
349 /* do permutation */
|
| /external/openssh/openbsd-compat/ |
| getopt_long.c | 333 /* do permutation, if we have to */
361 * If no permutation wanted, stop parsing
366 /* do permutation */
|
| /external/tcpdump/missing/ |
| getopt_long.c | 396 /* do permutation, if we have to */
428 * If no permutation wanted, stop parsing
433 /* do permutation */
|
| /system/core/logcat/ |
| getopt_long.cpp | 267 // do permutation, if we have to
285 // If no permutation wanted, stop parsing at first non-option.
288 // do permutation
|
| /external/swiftshader/third_party/subzero/src/ |
| IceTargetLoweringX8632Traits.h | 575 Cfg *Func, llvm::SmallVectorImpl<RegNumT> &Permutation,
577 // TODO(stichnot): Declaring Permutation this way loses type/size
579 assert(Permutation.size() >= RegisterSet::Reg_NUM);
596 /* val stays the same in the resulting permutation. */ \
597 Permutation[RegisterSet::val] = RegisterSet::val; \
631 Permutation[List[SI]] = Shuffled[SI];
[all...] |
| /external/webrtc/webrtc/modules/audio_coding/codecs/isac/main/source/ |
| fft.c | 754 /* permutation for square factors of n */
775 /* permutation for multivariate transform */
808 /* permutation for single-variate transform (optional code) */
838 /* permutation for square-free factors of n */
868 /* determine the permutation cycles of length greater than 1 */
889 /* reorder a and b, following the permutation cycles */
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LevenbergMarquardt.h | 230 /** the permutation used in the QR factorization
232 PermutationType permutation() {return m_permutation; } function in class:Eigen::LevenbergMarquardt
|
| LMonestep.h | 48 // Make a copy of the first factor with the associated permutation
|
| /external/icu/icu4c/source/test/intltest/ |
| canittst.cpp | 139 logln("testing permutation");
141 expectEqual("Simple permutation ", "", collectionToString(permutations), "ABC, ACB, BAC, BCA, CAB, CBA");
|
| /external/owasp/sanitizer/empiricism/ |
| html-containment.js | 9 * calls it iteratively with every permutation of length element names.
54 // Advance to next permutation.
|
| /external/pdfium/third_party/libopenjpeg20/ |
| invert.c | 136 /* make permutation with the biggest value in the column */
201 /* next permutation element */
|
| /frameworks/wilhelm/tools/permute/ |
| permute.c | 38 // mean length of each segment of the permutation, in seconds
40 // minimum length of each segment of the permutation, in seconds
|
| /external/bison/lib/ |
| getopt_int.h | 100 /* Handle permutation of arguments. */
|
| /external/eigen/Eigen/src/QR/ |
| CompleteOrthogonalDecomposition.h | 39 * by using Householder transformations. Here, \b P is a permutation matrix,
191 /** \returns a const reference to the column permutation matrix */
414 // the column permutation is stored as int indices, so just to be sure:
523 // Undo permutation to get x = P^{-1} * y.
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseColEtree.h | 58 * \param perm The permutation to apply to the column of \b mat
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_column_dfs.h | 77 * \param perm_r Row permutation
|
| SparseLU_pruneL.h | 43 * \param[in] perm_r Row permutation
|
| /external/iproute2/man/man8/ |
| tc-flow.8 | 159 In mapping mode, a single key is used (after optional permutation) to build a
|
| /external/llvm/lib/Target/PowerPC/ |
| PPCScheduleG4Plus.td | 22 def G4P_VPU : FuncUnit; // vector permutation unit
|
| PPCScheduleG5.td | 21 def G5_VPU : FuncUnit; // vector permutation unit
|
| PPCTargetTransformInfo.cpp | 375 // If we can use the permutation-based load sequence, then this is also
380 // than using the permutation-based load sequence. On the P8, that's no
388 // P7, unaligned vector loads are more expensive than the permutation-based
401 // stores, loads are expanded using the vector-load + permutation sequence,
|
| /external/protobuf/java/core/src/test/java/com/google/protobuf/ |
| IsValidUtf8Test.java | 47 * brute force tests that actually test every permutation of one byte, two byte,
|
| /external/protobuf/ruby/lib/google/protobuf/ |
| repeated_field.rb | 75 :pack, :permutation, :product, :pretty_print, :pretty_print_cycle,
|
| /external/toolchain-utils/bestflags/ |
| steering_test.py | 28 # The stride of permutation used to shuffle the input list of tasks. Should be
|
| /external/valgrind/auxprogs/ |
| gsl16test | 67 TESTS6="multiroots/test ntuple/test ode-initval/test permutation/test"
|
