| /external/chromium/chrome/browser/resources/shared/js/cr/ui/table/ |
| table_selection_model.js | 30 * @param {!Array.<number>} permutation The reordering permutation.
32 adjustToReordering: function(permutation) {
37 return permutation[oldIndex];
43 this.leadIndex = permutation[oldLeadIndex];
|
| table_single_selection_model.js | 30 * @param {!Array.<number>} permutation The reordering permutation.
32 adjustToReordering: function(permutation) {
34 this.leadIndex = permutation[this.leadIndex];
38 this.selectedIndex = permutation[oldSelectedIndex];
|
| /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/chrome/browser/resources/file_manager/foreground/js/ |
| folder_shortcuts_data_model.js | 41 var permutation = this.calculatePermutation_(this.array_, list);
43 this.firePermutedEvent_(permutation);
72 var permutation = this.calculatePermutation_(this.array_, list);
74 this.firePermutedEvent_(permutation);
232 * Creates a permutation array for 'permuted' event, which is compatible with
233 * a permutation array used in cr/ui/array_data_model.js.
237 * @return {Array.<number>} Created permutation array.
245 var permutation = []; variable
249 permutation[oldIndex] = -1;
257 permutation[oldIndex] = newIndex
[all...] |
| navigation_list_model.js | 169 var permutation;
177 for (var i = 0; i < event.permutation.length; i++) {
178 if (event.permutation[i] >= 0)
179 newList[event.permutation[i]] = this.volumeList_[i];
191 permutation = event.permutation.slice();
193 // volumeList part has not been changed, so the permutation should be
195 permutation = [];
197 permutation[i] = i;
218 permutation.push(-1)
[all...] |
| /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];
|
| array_data_model.js | 111 * This implementation runs sort after splice and creates permutation for
292 dispatchPermutedEvent_: function(permutation) {
294 e.permutation = permutation;
|
| /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/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"} {
|
| rollback.test | 83 && [permutation] ne "onefile"
84 && [permutation] ne "inmemory_journal"
136 if {[lsearch {exclusive persistent_journal no_journal} [permutation]]<0} {
|
| attach4.test | 77 if {[permutation] == "journaltest"} {
|
| /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/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/ipsec-tools/src/racoon/samples/ |
| racoon.conf.sample | 53 # - permutation of the crypto/hash/compression algorithms presented below
|
| /external/chromium/chrome/browser/resources/shared/js/cr/ui/ |
| list_single_selection_model.js | 197 * @param {!Array.<number>} permutation The reordering permutation.
199 adjustToReordering: function(permutation) {
|
| list_selection_model.js | 247 * @param {!Array.<number>} permutation The reordering permutation.
249 adjustToReordering: function(permutation) {
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| LevenbergMarquardt.h | 103 PermutationMatrix<Dynamic,Dynamic> permutation; member in class:Eigen::LevenbergMarquardt
224 permutation = qrfac.colsPermutation();
251 if (wa2[permutation.indices()[j]] != 0.)
252 gnorm = (std::max)(gnorm, internal::abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
453 permutation.setIdentity(n);
462 permutation = qrfac.colsPermutation();
498 if (wa2[permutation.indices()[j]] != 0.)
499 gnorm = (std::max)(gnorm, internal::abs( fjac.col(j).head(j+1).dot(qtf.head(j+1)/fnorm) / wa2[permutation.indices()[j]]));
512 internal::lmpar<Scalar>(fjac, permutation.indices(), diag, qtf, delta, par, wa1);
536 wa3 = fjac.topLeftCorner(n,n).template triangularView<Upper>() * (permutation.inverse() * wa1)
[all...] |
| /bionic/libc/netbsd/resolv/ |
| res_random.c | 15 * permutation generator based on a Luby-Rackoff block cipher. This
136 * 15-bit permutation based on Luby-Rackoff block cipher
220 /* Initialise PRF for Luby-Rackoff permutation */
|
