| /external/guava/guava-tests/test/com/google/common/collect/ |
| OrderingTest.java | 853 final int rank;
855 Composite(T value, int rank) {
857 this.rank = rank;
860 // natural order is by rank only; the test will compound() this with the
864 return rank < that.rank ? -1 : rank > that.rank ? 1 : 0;
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ |
| Logger.java | 50 * {@code suggestionCursor}, ordered by rank.
|
| /prebuilts/gcc/linux-x86/host/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.
|
| /prebuilts/gcc/linux-x86/host/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.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/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.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/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.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/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.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/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.
|
| /prebuilts/ndk/5/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.
|
| /prebuilts/ndk/5/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.
|
| /prebuilts/ndk/6/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.
|
| /prebuilts/ndk/6/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.
|
| /prebuilts/ndk/7/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.
|
| /prebuilts/ndk/7/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.
|
| /prebuilts/ndk/8/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.
|
| /prebuilts/ndk/8/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/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
52 unsigned Rank;
54 ValueEntry(unsigned R, Value *O) : Rank(R), Op(O) {}
57 return LHS.Rank > RHS.Rank; // Sort so that highest rank goes to start.
71 dbgs() << ", #" << Ops[i].Rank << "] ";
211 return 0; // Otherwise it's a global or constant, rank 0
[all...] |
| /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) {
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| stochastic_linear_ranker.cpp | 101 ALOGE("Unknown rank loss type: %d", rank_loss_type_);
|
| /prebuilts/gcc/linux-x86/host/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;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/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;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/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...] |
| /external/llvm/lib/CodeGen/ |
| StrongPHIElimination.cpp | 82 Node(unsigned v) : value(v), rank(0) { parent.setPointer(this); }
88 unsigned rank; member in struct:__anon10285::StrongPHIElimination::Node
442 if (Node1->rank > Node2->rank) {
444 } else if (Node1->rank < Node2->rank) {
448 Node1->rank++;
|
| /external/jmonkeyengine/engine/src/core/com/jme3/math/ |
| Eigen3f.java | 90 // Rank was 0 (or very close to 0), so just return.
272 * Check the rank of the given Matrix to determine if it is positive. While
284 * @return true if the given matrix has a non 0 rank.
|
