| /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++);
|
| /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/ |
| Logger.java | 45 * {@code suggestionCursor}, ordered by rank.
|
| Config.java | 163 * The minimum number of clicks needed to rank a source.
|
| /packages/apps/QuickSearchBox/tests/src/com/android/quicksearchbox/ |
| ShortcutRepositoryTest.java | 350 assertShortcuts("expecting more recently clicked app to rank higher",
401 assertShortcuts("hits for 'foo' and 'bar' on app2 should have combined to rank it " +
416 assertShortcuts("hits for '' on app2 should have combined to rank it " +
579 assertCorpusRanking("expecting apps to rank ahead of contacts (more clicks)",
586 assertCorpusRanking("expecting contacts to rank ahead of apps (more clicks)",
|
| /sdk/traceview/src/com/android/traceview/ |
| MethodData.java | 113 public void setRank(int rank) {
114 mRank = rank;
|
| ProfileProvider.java | 112 int rank = Integer.valueOf(numstr); local
114 if (md.getRank() == rank)
|
| DmTraceReader.java | 486 // Update all the calls to include the method rank in
|
| TimeLineView.java | [all...] |
| /external/quake/quake/src/QW/progs/ |
| client.qc | 401 local float rank, rankmin, rankmax;
421 // the users rank must be between those two values
423 s = masterinfo (e, "rank");
424 rank = stof (s);
430 if (rank < rankmin)
437 if (rankmax < rank)
[all...] |
| /external/openssl/crypto/des/ |
| des_opts.c | 427 int rank[16]; local
437 rank[i]=0;
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| Dominators.java | 41 * rank to keep the union-find tree balanced.
|
| /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 | 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/bison/src/ |
| vcg.h | 183 /* vertical order is the level position (rank) of the node. We can also
546 (rank) of the summary node of an inner subgraph, if this subgraph is
562 /* Vertical order is the level position (rank) of the summary node of an
802 level (rank) where nodes are spread. Nodes of levels upper than
[all...] |
| /sdk/sdkmanager/libs/sdkuilib/src/com/android/sdkuilib/internal/repository/ |
| UpdaterLogic.java | 114 // This allows previews to rank above a non-preview and
115 // allows revisions to rank appropriately.
|
| /development/samples/ApiDemos/src/com/example/android/apis/view/ |
| List4.java | 205 "To rank our chosen truth with such a show" +
|
| List6.java | 219 "To rank our chosen truth with such a show" +
|
| /external/stlport/stlport/ |
| type_traits | 575 // rank
|
| /ndk/build/platforms/android-3/arch-arm/usr/lib/ |
| libz.so | |
| /ndk/build/platforms/android-4/arch-arm/usr/lib/ |
| libz.so | |
| /ndk/build/platforms/android-5/arch-arm/usr/lib/ |
| libz.so | |
| /ndk/build/platforms/android-8/arch-arm/usr/lib/ |
| libz.so | |
| /frameworks/base/core/java/android/provider/ |
| Settings.java | [all...] |
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
| ContactsProvider2.java | [all...] |
