| /packages/apps/Launcher3/tests/src/com/android/launcher3/popup/ |
| PopupPopulatorTest.java | 75 private String generateId(boolean isStatic, int rank) {
76 return (isStatic ? "static" : "dynamic") + rank;
110 int rank = shortcut.getRank(); local
114 assertTrue(rank > lastStaticRank);
115 lastStaticRank = rank;
119 assertTrue(rank > lastDynamicRank);
120 lastDynamicRank = rank;
145 public Shortcut(boolean isStatic, int rank) {
148 mRank = rank;
149 mId = generateId(isStatic, rank);
[all...] |
| /packages/apps/Settings/src/com/android/settings/search2/ |
| SearchResult.java | 30 * Defines the lowest rank for a search result to be considered as ranked. Results with ranks
36 * Defines the highest rank for a search result. Used for special search results only.
60 * Based on Settings Rank:
65 public final int rank; field in class:SearchResult
92 rank = builder.mRank;
96 stableId = Objects.hash(title, summary, breadcrumbs, rank, viewType);
104 return this.rank - searchResult.rank;
146 public Builder addRank(int rank) {
147 if (rank >= 0 && rank <= 9)
[all...] |
| CursorToSearchResultConverter.java | 67 * - int rank
155 final int rank = getRank(title, breadcrumbs, baseRank, key); local
161 .addRank(rank)
244 /** Uses the breadcrumbs to determine the offset to the base rank.
|
| SearchResultsAdapter.java | 137 int rank = TOP_RANK; local
139 while (rank <= BOTTOM_RANK) {
140 while ((dbIndex < dbSize) && (databaseResults.get(dbIndex).rank == rank)) {
143 while ((appIndex < appSize) && (installedAppResults.get(appIndex).rank == rank)) {
146 rank++;
|
| /packages/apps/UnifiedEmail/tests/src/com/android/mail/utils/ |
| RankedComparatorTest.java | 51 assertTrue("Different objects with same rank should be equal.",
64 assertTrue("Known rank should be smaller than unknown rank.",
66 assertTrue("Unknown rank should be larger than known rank.",
77 assertTrue("Known rank should be smaller than null rank.",
79 assertTrue("null rank should be larger than known rank.",
81 assertTrue("Unknown and null rank should be equal."
94 private final String rank; field in class:RankedComparatorTest.DummyObject
[all...] |
| /developers/build/prebuilts/gradle/AppRestrictionSchema/Application/src/main/java/com/example/android/apprestrictionschema/ |
| AppRestrictionSchemaFragment.java | 55 private static final String KEY_RANK = "rank";
184 String rank; local
186 rank = entry.getSelectedString();
188 rank = restrictions.getString(KEY_RANK);
190 mTextRank.setText(getString(R.string.your_rank, rank));
|
| /developers/samples/android/admin/AppRestrictionSchema/Application/src/main/java/com/example/android/apprestrictionschema/ |
| AppRestrictionSchemaFragment.java | 55 private static final String KEY_RANK = "rank";
184 String rank; local
186 rank = entry.getSelectedString();
188 rank = restrictions.getString(KEY_RANK);
190 mTextRank.setText(getString(R.string.your_rank, rank));
|
| /development/samples/browseable/AppRestrictionSchema/src/com.example.android.apprestrictionschema/ |
| AppRestrictionSchemaFragment.java | 52 private static final String KEY_RANK = "rank";
156 String rank; local
158 rank = entry.getSelectedString();
160 rank = restrictions.getString(KEY_RANK);
162 mTextRank.setText(getString(R.string.your_rank, rank));
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/rank/ |
| Percentile.java | 17 package org.apache.commons.math.stat.descriptive.rank;
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/ranking/ |
| NaturalRanking.java | 46 * <th><code>rank(data)</code></th>
183 * Rank <code>data</code> using the natural ordering on Doubles, with
190 public double[] rank(double[] data) { method in class:NaturalRanking
|
| /external/eigen/Eigen/src/QR/ |
| CompleteOrthogonalDecomposition.h | 32 * This class performs a rank-revealing complete orthogonal decomposition of a
41 * size rank-by-rank. \b A may be rank deficient.
101 * threshold for rank determination will be used. It is a short cut for:
172 * \warning The strict lower part and \code cols() - rank() \endcode right
176 * For rank-deficient matrices, use
178 * matrixR().topLeftCorner(rank(), rank()).template triangularView<Upper>()
226 /** \returns the rank of the matrix of which *this is the complete orthogona
233 inline Index rank() const { return m_cpqr.rank(); } function in class:Eigen::CompleteOrthogonalDecomposition
417 const Index rank = m_cpqr.rank(); local
473 const Index rank = this->rank(); local
496 const Index rank = this->rank(); local
[all...] |
| HouseholderQR.h | 34 * Note that no pivoting is performed. This is \b not a rank-revealing decomposition.
352 const Index rank = (std::min)(rows(), cols()); local
359 m_qr.leftCols(rank),
360 m_hCoeffs.head(rank)).transpose()
363 m_qr.topLeftCorner(rank, rank)
365 .solveInPlace(c.topRows(rank));
367 dst.topRows(rank) = c.topRows(rank);
368 dst.bottomRows(cols()-rank).setZero()
[all...] |
| ColPivHouseholderQR.h | 29 * \brief Householder rank-revealing QR decomposition of a matrix with column-pivoting
33 * This class performs a rank-revealing QR decomposition of a matrix \b A into matrices \b P, \b Q and \b R
41 * This decomposition performs column pivoting in order to be rank-revealing and improve
199 * For rank-deficient matrices, use
201 * matrixR().topLeftCorner(rank(), rank()).template triangularView<Upper>()
249 /** \returns the rank of the matrix of which *this is the QR decomposition.
255 inline Index rank() const function in class:Eigen::ColPivHouseholderQR
275 return cols() - rank();
288 return rank() == cols()
[all...] |
| FullPivHouseholderQR.h | 38 * \brief Householder rank-revealing QR decomposition of a matrix with full pivoting
42 * This class performs a rank-revealing QR decomposition of a matrix \b A into matrices \b P, \b P', \b Q and \b R
50 * This decomposition performs a very prudent full pivoting in order to be rank-revealing and achieve optimal
164 * \returns the exact or least-square solution if the rank is greater or equal to the number of columns of A,
240 /** \returns the rank of the matrix of which *this is the QR decomposition.
246 inline Index rank() const function in class:Eigen::FullPivHouseholderQR
266 return cols() - rank();
279 return rank() == cols();
292 return rank() == rows();
327 /** Allows to prescribe a threshold to be used by certain methods, such as rank(),
[all...] |
| /external/eigen/Eigen/src/SVD/ |
| SVDBase.h | 124 /** \returns the rank of the matrix of which \c *this is the SVD.
130 inline Index rank() const function in class:Eigen::SVDBase
141 /** Allows to prescribe a threshold to be used by certain methods, such as rank() and solve(),
176 /** Returns the threshold that will be used by certain methods such as rank().
267 Index l_rank = rank();
|
| /external/eigen/test/ |
| qr_colpivoting.cpp | 22 Index rank = internal::random<Index>(1, (std::min)(rows, cols) - 1); local
29 createRandomPIMatrixOfRank(rank, rows, cols, matrix);
31 VERIFY(rank == cod.rank());
32 VERIFY(cols - cod.rank() == cod.dimensionOfKernel());
45 t.topLeftCorner(rank, rank) =
46 cod.matrixT().topLeftCorner(rank, rank).template triangularView<Upper>();
72 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols)) - 1) local
100 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1); local
165 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols))-1); local
[all...] |
| /external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
| Tensor.h | 28 * \tparam NumIndices_ Number of indices (i.e. rank of the tensor)
53 * by providing .asMatrix() and .asVector() (or similar) methods for rank 2 and 1 tensors. However, currently, the %Tensor
100 EIGEN_DEVICE_FUNC EIGEN_STRONG_INLINE Index rank() const { return NumIndices; } function in class:Eigen::Tensor
117 // The number of indices used to access a tensor coefficient must be equal to the rank of the tensor.
157 // The number of indices used to access a tensor coefficient must be equal to the rank of the tensor.
197 // The number of indices used to access a tensor coefficient must be equal to the rank of the tensor.
264 // The number of indices used to access a tensor coefficient must be equal to the rank of the tensor.
344 // The number of dimensions used to construct a tensor must be equal to the rank of the tensor.
425 // The number of dimensions used to resize a tensor must be equal to the rank of the tensor.
462 // Nothing to do: rank 0 tensors have fixed siz
[all...] |
| TensorRef.h | 180 EIGEN_STRONG_INLINE Index rank() const { return m_evaluator->dimensions().size(); } function in class:Eigen::TensorRef
|
| /external/jemalloc/include/jemalloc/internal/ |
| witness.h | 10 * Lock ranks. Witnesses with rank WITNESS_RANK_OMIT are completely ignored by
42 #define WITNESS_INITIALIZER(rank) {"initializer", rank, NULL, {NULL, NULL}}
53 * Witness rank, where 0 is lowest and UINT_MAX is highest. Witnesses
54 * must be acquired in order of increasing rank.
56 witness_rank_t rank; member in struct:witness_s
59 * If two witnesses are of equal rank and they have the samp comp
61 * between witnesses of equal rank.
73 void witness_init(witness_t *witness, const char *name, witness_rank_t rank,
147 if (witness->rank == WITNESS_RANK_OMIT
[all...] |
| /external/libdivsufsort/lib/ |
| trsort.c | 294 saidx_t rank, lastrank, newrank = -1; local
301 rank = ISA[s + depth];
302 if(lastrank != rank) { lastrank = rank; newrank = d - SA; }
309 rank = ISA[*e];
310 if(lastrank != rank) { lastrank = rank; newrank = e - SA; }
311 if(newrank != rank) { ISA[*e] = newrank; }
318 rank = ISA[s + depth];
319 if(lastrank != rank) { lastrank = rank; newrank = d - SA;
[all...] |
| /external/syslinux/com32/lib/ |
| vsnprintf.c | 175 int rank = rank_int; /* Default rank */ local
198 rank = rank_int;
268 rank--; /* Shorter rank */
271 rank++; /* Longer rank */
274 rank = INTMAX_RANK;
277 rank = SIZE_T_RANK;
280 rank = PTRDIFF_T_RANK
[all...] |
| vsscanf.c | 56 int rank = rank_int; /* Default rank */ local
82 rank = rank_int;
124 rank--; /* Shorter rank */
127 rank++; /* Longer rank */
130 rank = INTMAX_RANK;
133 rank = SIZE_T_RANK;
136 rank = PTRDIFF_T_RANK
[all...] |
| /frameworks/base/services/core/java/com/android/server/pm/ |
| ShortcutParser.java | 121 int rank = 0; local
190 rank++;
207 service, attrs, packageName, activity, userId, rank);
289 @UserIdInt int userId, int rank) {
323 rank,
334 int rank, int iconResId, boolean enabled) {
360 rank,
|
| /packages/apps/Dialer/java/com/android/dialer/shortcuts/ |
| DynamicShortcuts.java | 117 int rank = 0; local
128 .setRank(rank++)
|
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 36 * upper-triangular, and P and Q are permutation matrices. This is a rank-revealing LU
41 * the rank, invertibility, inverse, kernel, and determinant.
142 * \sa rank()
275 /** Allows to prescribe a threshold to be used by certain methods, such as rank(),
313 /** Returns the threshold that will be used by certain methods such as rank().
326 /** \returns the rank of the matrix of which *this is the LU decomposition.
332 inline Index rank() const function in class:Eigen::FullPivLU
352 return cols() - rank();
365 return rank() == cols();
378 return rank() == rows()
[all...] |
