HomeSort by relevance Sort by last modified time
    Searched refs:rank (Results 26 - 50 of 152) sorted by null

12 3 4 5 6 7

  /frameworks/base/core/java/android/service/notification/
NotificationListenerService.java 731 * Returns the rank of the notification.
733 * @return the rank of the notification, that is the 0-based index in
771 private void populate(String key, int rank, boolean isAmbient,
774 mRank = rank;
817 int rank = getRank(key); local
829 Integer rank = mRanks.get(key); local
838 int rank = getRank(key); local
    [all...]
  /frameworks/base/core/java/android/provider/
SearchIndexableData.java 50 * The rank for the data. This is application specific.
52 public int rank; field in class:SearchIndexableData
150 sb.append("rank: ");
151 sb.append(rank);
  /packages/apps/Launcher3/src/com/android/launcher3/
Hotseat.java 90 int getCellXFromOrder(int rank) {
91 return hasVerticalHotseat() ? 0 : rank;
93 int getCellYFromOrder(int rank) {
94 return hasVerticalHotseat() ? (mContent.getCountY() - (rank + 1)) : 0;
96 public boolean isAllAppsButtonRank(int rank) {
100 return rank == mAllAppsButtonRank;
  /external/deqp/framework/platform/X11/
tcuX11GlxPlatform.cpp 451 class Rank
454 Rank (void) : m_value(0), m_bitsLeft(64) {}
464 void Rank::add (size_t bits, deUint32 value)
471 void Rank::sub (size_t bits, deUint32 value)
485 Rank rank;
496 rank.add(1, (caveat != GLX_NON_CONFORMANT_CONFIG));
499 rank.add(1, visual.getAttrib(GLX_TRANSPARENT_TYPE) == GLX_NONE);
502 rank.add(1, visual.getAttrib(GLX_STEREO) == False);
505 rank.add(1, visual.getAttrib(GLX_LEVEL) == 0)
    [all...]
  /external/eigen/test/
jacobisvd.cpp 119 // generate a full-rank m x n problem with m<n
127 Index rank = RankAtCompileTime2==Dynamic ? internal::random<Index>(1,cols) : Index(RankAtCompileTime2);
128 MatrixType2 m2(rank,cols);
132 } while(m2.jacobiSvd().setThreshold(test_precision<Scalar>()).rank()!=rank && (++guard)<10);
134 RhsType2 rhs2 = RhsType2::Random(rank);
137 Matrix<Scalar,Dynamic,1> tmp = qr.matrixQR().topLeftCorner(rank,rank).template triangularView<Upper>().adjoint().solve(rhs2);
139 tmp.tail(cols-rank).setZero();
148 // Now check with a rank deficient matri
    [all...]
qr_fullpivoting.cpp 19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1); local
24 createRandomPIMatrixOfRank(rank,rows,cols,m1);
26 VERIFY(rank == qr.rank());
27 VERIFY(cols - qr.rank() == qr.dimensionOfKernel());
  /external/eigen/unsupported/Eigen/src/NonLinearOptimization/
lmpar.h 39 /* jacobian is rank-deficient, obtain a least squares solution. */
70 /* if the jacobian is not rank deficient, the newton */
196 /* jacobian is rank-deficient, obtain a least squares solution. */
198 // const Index rank = qr.nonzeroPivots(); // exactly double(0.)
199 const Index rank = qr.rank(); // use a threshold local
201 wa1.tail(n-rank).setZero();
202 qr.matrixQR().topLeftCorner(rank, rank).template triangularView<Upper>().solveInPlace(wa1.head(rank));
    [all...]
  /external/eigen/Eigen/src/Geometry/
Umeyama.h 143 Index rank = 0; for (Index i=0; i<m; ++i) if (!internal::isMuchSmallerThan(d.coeff(i),d.coeff(0))) ++rank; local
144 if (rank == m-1) {
  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/
dot.stg 52 {rank=same; rankdir=TB; <states; separator="; ">}
  /developers/build/prebuilts/gradle/AppRestrictionSchema/Application/src/main/java/com/example/android/apprestrictionschema/
AppRestrictionSchemaFragment.java 50 private static final String KEY_RANK = "rank";
139 String rank; local
141 rank = entry.getSelectedString();
143 rank = restrictions.getString(KEY_RANK);
145 mTextRank.setText(getString(R.string.your_rank, rank));
  /developers/samples/android/admin/AppRestrictionSchema/Application/src/main/java/com/example/android/apprestrictionschema/
AppRestrictionSchemaFragment.java 50 private static final String KEY_RANK = "rank";
139 String rank; local
141 rank = entry.getSelectedString();
143 rank = restrictions.getString(KEY_RANK);
145 mTextRank.setText(getString(R.string.your_rank, rank));
  /developers/build/prebuilts/gradle/AppRestrictionEnforcer/Application/src/main/java/com/example/android/apprestrictionenforcer/
AppRestrictionEnforcerFragment.java 77 private static final String RESTRICTION_KEY_RANK = "rank";
110 mSpinnerRank = (Spinner) view.findViewById(R.id.rank);
162 case R.id.rank: {
292 * Saves the value for the "rank" restriction of AppRestrictionSchema.
295 * @param rank The value to be set for the restriction.
297 private void saveRank(Activity activity, String rank) {
298 mCurrentRestrictions.putString(RESTRICTION_KEY_RANK, rank);
300 editPreferences(activity).putString(RESTRICTION_KEY_RANK, rank).apply();
  /developers/samples/android/admin/AppRestrictionEnforcer/Application/src/main/java/com/example/android/apprestrictionenforcer/
AppRestrictionEnforcerFragment.java 77 private static final String RESTRICTION_KEY_RANK = "rank";
110 mSpinnerRank = (Spinner) view.findViewById(R.id.rank);
162 case R.id.rank: {
292 * Saves the value for the "rank" restriction of AppRestrictionSchema.
295 * @param rank The value to be set for the restriction.
297 private void saveRank(Activity activity, String rank) {
298 mCurrentRestrictions.putString(RESTRICTION_KEY_RANK, rank);
300 editPreferences(activity).putString(RESTRICTION_KEY_RANK, rank).apply();
  /external/chromium_org/chrome/browser/history/
top_sites_backend.cc 117 db_->SetPageThumbnail(delta.added[i].url, delta.added[i].rank, Images());
120 db_->UpdatePageRank(delta.moved[i].url, delta.moved[i].rank);
top_sites_impl.cc 407 int rank = -1; // Forced URLs have a rank of -1. local
409 // Increase the rank if we're going through forced URLs. This works because
412 rank++;
413 DCHECK(new_list[i].last_forced_time.is_null() == (rank != -1))
419 added.rank = rank;
426 if (old_rank != rank ||
431 moved.rank = rank;
    [all...]
  /external/eigen/Eigen/src/SparseQR/
SparseQR.h 40 * \brief Sparse left-looking rank-revealing QR factorization
42 * This class implements a left-looking rank-revealing QR decomposition
48 * rank-revealing permutations. Use colsPermutation() to get it.
54 * R is the sparse triangular or trapezoidal matrix. The later occurs when A is rank-deficient.
55 * matrixR().topLeftCorner(rank(), rank()) always returns a triangular factor of full rank.
122 Index rank() const function in class:Eigen::SparseQR
170 Index rank = this->rank(); local
    [all...]
  /packages/apps/Launcher3/protos/
backup.proto 95 optional int32 rank = 2;
  /packages/apps/Settings/src/com/android/settings/search/
Index.java 546 final int rank = (providerRank > 0) ? baseRank + providerRank : baseRank; local
560 sir.rank = rank;
593 final int rank = (providerRank > 0) ? baseRank + providerRank : baseRank; local
616 data.rank = rank;
721 raw.rank,
763 sir.xmlResId, sir.className, sir.iconResId, sir.rank,
789 sir.iconResId, sir.rank, sir.enabled, nonIndexableKeys);
    [all...]
SettingsSearchIndexablesProvider.java 52 ref[COLUMN_INDEX_XML_RES_RANK] = val.rank;
Ranking.java 167 Integer rank = sRankMap.get(className); local
168 return (rank != null) ? (int) rank: RANK_OTHERS;
  /packages/services/Telephony/src/com/android/phone/
PhoneSearchIndexablesProvider.java 56 ref[COLUMN_INDEX_XML_RES_RANK] = INDEXABLE_RES[n].rank;
  /external/chromium_org/components/precache/core/
precache_fetcher.cc 207 int64 rank = 0; local
209 it != starting_urls_.end() && rank < config.top_sites_count();
210 ++it, ++rank) {
  /cts/apps/CtsVerifier/src/com/android/cts/verifier/notifications/
MockListener.java 66 public static final String JSON_RANK = "rank";
198 Ranking rank = new Ranking(); local
202 rankingMap.getRanking(key, rank);
206 note.put(JSON_RANK, rank.getRank());
207 note.put(JSON_AMBIENT, rank.isAmbient());
208 note.put(JSON_MATCHES_ZEN_FILTER, rank.matchesInterruptionFilter());
  /external/valgrind/main/mpi/
mpiwrap_type_test.c 224 int rank, size; local
244 MPI_Comm_rank( MPI_COMM_WORLD, &rank );
246 if (rank == 0) {
  /external/eigen/Eigen/src/QR/
ColPivHouseholderQR.h 20 * \brief Householder rank-revealing QR decomposition of a matrix with column-pivoting
24 * This class performs a rank-revealing QR decomposition of a matrix \b A into matrices \b P, \b Q and \b R
32 * This decomposition performs column pivoting in order to be rank-revealing and improve
166 * For rank-deficient matrices, use
168 * matrixR().topLeftCorner(rank(), rank()).template triangularView<Upper>()
215 /** \returns the rank of the matrix of which *this is the QR decomposition.
221 inline Index rank() const function in class:Eigen::ColPivHouseholderQR
241 return cols() - rank();
254 return rank() == cols()
    [all...]

Completed in 1040 milliseconds

12 3 4 5 6 7