HomeSort by relevance Sort by last modified time
    Searched refs:rank (Results 1 - 25 of 41) sorted by null

1 2

  /external/guava/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 76 int getCellXFromOrder(int rank) {
77 return mIsLandscape ? 0 : rank;
79 int getCellYFromOrder(int rank) {
80 return mIsLandscape ? (mContent.getCountY() - (rank + 1)) : 0;
82 public boolean isAllAppsButtonRank(int rank) {
83 return rank == mAllAppsButtonRank;
  /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/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/
dot.stg 52 {rank=same; rankdir=TB; <states; separator="; ">}
  /prebuilts/gcc/linux-x86/host/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...]
set_operations.h 401 const difference_type rank = borders[iam + 1]; local
403 multiseq_partition(sequence, sequence + 2, rank, offset, op.comp);
  /external/chromium/chrome/browser/history/
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.
history_types.h 617 int rank; member in struct:history::MostVisitedURLWithRank
top_sites_unittest.cc 462 ASSERT_EQ(1, delta.added[0].rank);
464 ASSERT_EQ(2, delta.added[1].rank);
471 ASSERT_EQ(3, delta.moved[0].rank);
655 // Add new thumbnail at rank 0 and shift the other result to 1.
    [all...]
  /dalvik/vm/compiler/
InlineTransformation.cpp 27 int rank = calleeRegId - local
29 assert(rank >= 0);
31 return invoke->arg[rank];
33 return invoke->vC + rank;
  /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) {
libmpiwrap.c     [all...]
  /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;
  /external/llvm/lib/CodeGen/
StrongPHIElimination.cpp 82 Node(unsigned v) : value(v), rank(0) { parent.setPointer(this); }
88 unsigned rank; member in struct:__anon8986::StrongPHIElimination::Node
442 if (Node1->rank > Node2->rank) {
444 } else if (Node1->rank < Node2->rank) {
448 Node1->rank++;
  /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;
  /external/qemu/distrib/zlib-1.2.3/
trees.c 842 int rank; /* index in bl_order */ local
851 for (rank = 0; rank < blcodes; rank++) {
852 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
853 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
    [all...]
  /external/zlib/
trees.c 840 int rank; /* index in bl_order */ local
849 for (rank = 0; rank < blcodes; rank++) {
850 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
851 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
CanvasViewInfo.java 1064 Integer rank = rankMap.get(node); local
1071 Integer rank = usedIndexes.get(i); local
    [all...]
  /external/openssl/crypto/des/
des_opts.c 427 int rank[16]; local
437 rank[i]=0;
  /sdk/traceview/src/com/android/traceview/
MethodData.java 106 public void setRank(int rank) {
107 mRank = rank;
ProfileProvider.java 126 int rank = Integer.valueOf(numstr); local
128 if (md.getRank() == rank)
  /external/chromium/chrome/common/extensions/
extension.cc 178 // Rank extension locations in a way that allows
181 // with the higher rank, as returned by this function. The actual
185 int rank = kInvalidRank; // Will CHECK that rank is not kInvalidRank. local
190 rank = 6;
196 rank = 5;
202 rank = 4;
208 rank = 3;
212 rank = 2;
216 rank = 1
    [all...]

Completed in 526 milliseconds

1 2