| /external/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| Android.mk | 17 test_makefile := external/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/Android.mk
19 test_name := algorithms/alg.sorting/alg.permutation.generators/next_permutation
23 test_name := algorithms/alg.sorting/alg.permutation.generators/next_permutation_comp
27 test_name := algorithms/alg.sorting/alg.permutation.generators/prev_permutation_comp
31 test_name := algorithms/alg.sorting/alg.permutation.generators/prev_permutation
|
| /external/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...] |
| /ndk/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/chromium_org/third_party/angle/tests/angle_tests/ |
| SwizzleTest.cpp | 36 swizzlePermutation permutation; local
37 permutation.swizzleRed = swizzles[r];
38 permutation.swizzleGreen = swizzles[g];
39 permutation.swizzleBlue = swizzles[b];
40 permutation.swizzleAlpha = swizzles[a];
41 mPermutations.push_back(permutation);
151 const swizzlePermutation& permutation = mPermutations[i]; local
153 glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_R, permutation.swizzleRed);
154 glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_G, permutation.swizzleGreen);
155 glTexParameteri(GL_TEXTURE_2D, GL_TEXTURE_SWIZZLE_B, permutation.swizzleBlue)
[all...] |
| /external/chromium_org/ui/file_manager/file_manager/foreground/js/ |
| navigation_list_model.js | 132 var permutation;
140 for (var i = 0; i < event.permutation.length; i++) {
141 if (event.permutation[i] >= 0)
142 newList[event.permutation[i]] = this.volumeList_[i];
154 permutation = event.permutation.slice();
156 // shortcutList part has not been changed, so the permutation should be
159 permutation.push(i + this.volumeList_.length);
164 // volumeList part has not been changed, so the permutation should be
167 permutation = []
[all...] |
| folder_shortcuts_data_model.js | 409 * Creates a permutation array for 'permuted' event, which is compatible with
410 * a permutation array used in cr/ui/array_data_model.js.
414 * @return {Array.<number>} Created permutation array.
422 var permutation = []; variable
426 permutation[oldIndex] = -1;
434 permutation[oldIndex] = newIndex;
441 permutation[oldIndex] = -1;
450 return permutation;
455 * @param {Array.<number>} permutation Permutation array
[all...] |
| /external/eigen/Eigen/src/Core/ |
| PermutationMatrix.h | 25 * This class is the base class for all expressions representing a permutation matrix,
27 * The convention followed here is that if \f$ \sigma \f$ is a permutation, the corresponding permutation matrix
33 * Permutation matrices are square and invertible.
36 * operator* to multiply any kind of permutation object with any kind of matrix expression (MatrixBase)
78 /** Copies the other permutation into *this */
126 /** \returns a Matrix object initialized from this permutation matrix. Notice that it
137 /** \returns a reference to the stored array representing the permutation. */
147 /** Sets *this to be the identity permutation matrix */
154 /** Sets *this to be the identity permutation matrix of given size
[all...] |
| /external/chromium_org/third_party/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/chromium_org/chrome/common/extensions/docs/examples/extensions/plugin_settings/domui/js/cr/ui/ |
| list_selection_model.js | 246 * @param {!Array.<number>} permutation The reordering permutation.
248 adjustToReordering: function(permutation) {
253 return permutation[oldIndex];
259 this.leadIndex = permutation[oldLeadIndex];
|
| list_single_selection_model.js | 196 * @param {!Array.<number>} permutation The reordering permutation.
198 adjustToReordering: function(permutation) {
200 this.leadIndex = permutation[this.leadIndex];
204 this.selectedIndex = permutation[oldSelectedIndex];
|
| /external/chromium_org/ui/webui/resources/js/cr/ui/ |
| list_single_selection_model.js | 224 * @param {!Array.<number>} permutation The reordering permutation.
226 adjustToReordering: function(permutation) {
228 this.leadIndex = permutation[this.leadIndex];
232 this.selectedIndex = permutation[oldSelectedIndex];
|
| list_selection_model.js | 322 * @param {!Array.<number>} permutation The reordering permutation.
324 adjustToReordering: function(permutation) {
331 return permutation[oldIndex];
338 this.leadIndex = permutation[oldLeadIndex];
340 this.anchorIndex = permutation[oldAnchorIndex];
|
| /external/eigen/Eigen/src/OrderingMethods/ |
| Ordering.h | 56 /** Compute the permutation vector from a sparse matrix
71 /** Compute the permutation with a selfadjoint matrix */
90 * \note Returns an empty permutation matrix
99 /** Compute the permutation vector from a column-major sparse matrix */
121 /** 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
108 /** \returns the matrix with the permutation applied to the columns
117 /** \returns the matrix with the permutation applied to the rows
128 /** \returns the matrix with the inverse permutation applied to the columns.
137 /** \returns the matrix with the inverse permutation applied to the rows.
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| fallocate.test | 62 if {[permutation] != "inmemory_journal"} {
76 [permutation]=="journaltest" || [permutation]=="inmemory_journal"
|
| pagerfault3.test | 18 if {[permutation] == "inmemory_journal"} {
|
| /external/chromium_org/components/variations/ |
| entropy_provider.h | 65 // permutation of a mapping array from an initial entropy value to a new value.
81 // Performs the permutation algorithm and returns the permuted value that
|
| /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/chromium_org/components/url_matcher/ |
| substring_set_matcher_unittest.cc | 48 for (int permutation = 0; permutation < 2; ++permutation) {
50 if (permutation == 0) {
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU.h | 49 * // Compute the ordering permutation vector from the structural pattern of A
150 * \returns a reference to the row matrix permutation \f$ P_r \f$ such that \f$P_r A P_c^T = L U\f$
158 * \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$
338 PermutationType m_perm_c; // Column permutation
339 PermutationType m_perm_r ; // Row permutation
361 * Compute the column permutation to minimize the fill-in
363 * - Apply this permutation to the input matrix -
367 * - Postorder the elimination tree and the column permutation
379 // Apply the permutation to the column of the input matrix
422 // Combine the two permutations : postorder the permutation for future us
[all...] |
| /frameworks/rs/api/ |
| gen_runtime.cpp | 38 * - Permutation: A concrete version of a specification, where all placeholders have
83 class Permutation;
283 class Permutation {
364 Permutation(Function* function, Specification* specification, int i1, int i2, int i3, int i4);
[all...] |
| /external/flac/libFLAC/ppc/as/ |
| lpc_asm.s | 98 vsel v0,v1,v0,v2 ; v0: reversal permutation vector
101 lvsl v17,0,r5 ; v17: coefficient alignment permutation vector
102 vperm v17,v17,v17,v0 ; v17: reversal coefficient alignment permutation vector
105 lvsl v16,0,r11 ; v16: history alignment permutation vector
347 vsel v0,v1,v0,v2 ; v0: reversal permutation vector
350 lvsl v5,0,r5 ; v5: coefficient alignment permutation vector
351 vperm v5,v5,v5,v0 ; v5: reversal coefficient alignment permutation vector
354 lvsl v4,0,r11 ; v4: history alignment permutation vector
|
| /external/flac/libFLAC/ppc/gas/ |
| lpc_asm.s | 100 vsel v0,v1,v0,v2 # v0: reversal permutation vector
103 lvsl v17,0,r5 # v17: coefficient alignment permutation vector
104 vperm v17,v17,v17,v0 # v17: reversal coefficient alignment permutation vector
107 lvsl v16,0,r11 # v16: history alignment permutation vector
349 vsel v0,v1,v0,v2 # v0: reversal permutation vector
352 lvsl v5,0,r5 # v5: coefficient alignment permutation vector
353 vperm v5,v5,v5,v0 # v5: reversal coefficient alignment permutation vector
356 lvsl v4,0,r11 # v4: history alignment permutation vector
|
| /external/eigen/Eigen/ |
| OrderingMethods | 16 * Precisely, in a preprocessing step, a permutation matrix P is computed using
|
| /external/ipsec-tools/src/racoon/samples/ |
| racoon.conf.sample | 53 # - permutation of the crypto/hash/compression algorithms presented below
|
