| /external/guava/src/com/google/common/collect/ |
| ExplicitOrdering.java | 40 return rank(left) - rank(right); // safe because both are nonnegative
43 private int rank(T value) { method in class:ExplicitOrdering
44 Integer rank = rankMap.get(value); local
45 if (rank == null) {
48 return rank;
54 int rank = 0; local
56 builder.put(value, rank++);
|
| /packages/apps/Launcher2/src/com/android/launcher2/ |
| Hotseat.java | 74 int getCellXFromOrder(int rank) {
75 return mIsLandscape ? 0 : rank;
77 int getCellYFromOrder(int rank) {
78 return mIsLandscape ? (mContent.getCountY() - (rank + 1)) : 0;
80 public static boolean isAllAppsButtonRank(int rank) {
81 return rank == sAllAppsButtonRank;
|
| /external/chromium/chrome/browser/history/ |
| top_sites_database.h | 53 // thumbnail and rank. Shift the ranks of other URLs if necessary.
58 // Sets the rank for a given URL. The URL must be in the database.
78 // Sets the page rank. Should be called within an open transaction.
85 // Returns the URL's current rank or -1 if it is not present.
|
| top_sites_backend.cc | 125 db_->SetPageThumbnail(delta.added[i].url, delta.added[i].rank, Images());
128 db_->UpdatePageRank(delta.moved[i].url, delta.moved[i].rank);
|
| top_sites_database.cc | 149 int rank = GetURLRank(url); local
150 if (rank == -1) {
233 LOG(WARNING) << "Updating rank of an unknown URL: " << url.url.spec();
262 // Set the url's rank.
|
| /libcore/dalvik/src/main/java/dalvik/system/profiler/ |
| AsciiHprofWriter.java | 73 out.printf("rank self accum count trace method\n");
74 int rank = 0; local
77 rank++;
85 rank, self*100, accum*100, count, stackTrace.stackTraceId,
|
| /external/llvm/lib/Transforms/Scalar/ |
| Reassociate.cpp | 15 // In the implementation of this algorithm, constants are assigned rank = 0,
16 // function arguments are rank = 1, and other values are assigned ranks
18 // (starting at 2), which effectively gives values in deep loops higher rank
50 unsigned Rank;
52 ValueEntry(unsigned R, Value *O) : Rank(R), Op(O) {}
55 return LHS.Rank > RHS.Rank; // Sort so that highest rank goes to start.
69 dbgs() << ", #" << Ops[i].Rank << "] ";
174 return 0; // Otherwise it's a global or constant, rank 0
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| multiseq_selection.h | 26 * @brief Functions to find elements of a certain global rank in
105 * @brief Splits several sorted sequences at a certain global rank,
113 * @param rank The global rank to partition at.
124 RankType rank,
154 if (rank == N)
164 _GLIBCXX_PARALLEL_ASSERT(rank >= 0);
165 _GLIBCXX_PARALLEL_ASSERT(rank < N);
210 difference_type localrank = rank / l;
262 difference_type skew = rank / (n + 1) - leftsize
[all...] |
| /frameworks/base/tests/GridLayoutTest/res/layout/ |
| grid6.xml | 31 <TextView android:text="Rank:"/>
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
| type_traits | 353 /// rank
355 struct rank
359 struct rank<_Tp[_Size]>
360 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
363 struct rank<_Tp[]>
364 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
|
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| type_traits | 353 /// rank
355 struct rank
359 struct rank<_Tp[_Size]>
360 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
363 struct rank<_Tp[]>
364 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
|
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/tr1_impl/ |
| type_traits | 353 /// rank
355 struct rank
359 struct rank<_Tp[_Size]>
360 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
363 struct rank<_Tp[]>
364 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| union-find.h | 17 // integers. Implemented using disjoint tree forests with rank
85 vector<int> rank_; // Rank of an element = min. depth in tree.
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ |
| DefaultCorpusRanker.java | 33 * A corpus ranker that uses corpus scores from the shortcut repository to rank
51 * @param corpora Corpora to rank.
|
| Logger.java | 50 * {@code suggestionCursor}, ordered by rank.
|
| /dalvik/vm/compiler/ |
| InlineTransformation.cpp | 27 int rank = calleeRegId - local
29 assert(rank >= 0);
31 return invoke->arg[rank];
33 return invoke->vC + rank;
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/tree_policy/ |
| sample_tree_node_update.hpp | 66 // Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator.
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/trie_policy/ |
| sample_trie_node_update.hpp | 66 // Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator.
|
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/tree_policy/ |
| sample_tree_node_update.hpp | 66 // Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator.
|
| /prebuilt/ndk/android-ndk-r5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/ |
| sample_trie_node_update.hpp | 66 // Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator.
|
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/tree_policy/ |
| sample_tree_node_update.hpp | 66 // Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator.
|
| /prebuilt/ndk/android-ndk-r6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/trie_policy/ |
| sample_trie_node_update.hpp | 66 // Updates the rank of a node through a node_iterator node_it; end_nd_it is the end node iterator.
|
| /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) {
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/rpcsvc/ |
| nis.x | 257 int rank;
268 int min_rank; /* minimum rank of bound endpoints */
269 int optimal_rank; /* best possible rank of all endpoints */
280 int rank;
|
| /packages/apps/QuickSearchBox/tests/src/com/android/quicksearchbox/ |
| ShortcutRepositoryTest.java | 393 assertShortcuts("expecting more recently clicked app to rank higher",
402 assertShortcuts("expecting more recently clicked app to rank higher",
453 assertShortcuts("hits for 'foo' and 'bar' on app2 should have combined to rank it " +
468 assertShortcuts("hits for '' on app2 should have combined to rank it " +
621 assertCorpusRanking("expecting apps to rank ahead of contacts (more clicks)",
628 assertCorpusRanking("expecting contacts to rank ahead of apps (more clicks)",
[all...] |
