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

1 2 3 4 5 6 7 8 910

  /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/
decision-rank.st 0 {rank=same; rankdir=TB; <states; separator="; ">}
dot.stg 52 {rank=same; rankdir=TB; <states; separator="; ">}
  /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++);
  /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,
  /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/java/android/bordeaux/learning/
StochasticLinearRanker.java 30 * Stochastic Linear Ranker, learns how to rank a sample. The learned rank score
34 * one having higher rank than the second one.
35 * To get the rank score of the sample call scoreSample.
64 * keys and values. The first sample should have higher rank than the second
77 * Get the rank score of the sample, a sample is a list of key, value pairs.
  /packages/apps/Launcher2/src/com/android/launcher2/
Hotseat.java 86 int getCellXFromOrder(int rank) {
87 return hasVerticalHotseat() ? 0 : rank;
89 int getCellYFromOrder(int rank) {
90 return hasVerticalHotseat() ? (mContent.getCountY() - (rank + 1)) : 0;
92 public boolean isAllAppsButtonRank(int rank) {
93 return rank == mAllAppsButtonRank;
  /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...]
  /external/clang/test/SemaObjC/
default-synthesize-2.m 6 @property(strong) id name, rank, serialNumber;
12 if (self.name && self.rank && self.serialNumber)
16 // @synthesize name, rank, serialNumber;
  /frameworks/base/tests/GridLayoutTest/res/layout/
grid6.xml 31 <TextView android:text="Rank:"/>
  /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/
common_defs.h 33 enum MulticlassUpdateType { MAX, RANK };
  /prebuilts/gcc/linux-x86/host/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> { };
  /prebuilts/ndk/5/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> { };
  /prebuilts/ndk/6/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> { };
  /prebuilts/ndk/7/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> { };
  /prebuilts/ndk/8/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/openfst/src/include/fst/
union-find.h 18 // integers. Implemented using disjoint tree forests with rank
88 vector<int> rank_; // Rank of an element = min. depth in tree.
  /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.
  /frameworks/ml/bordeaux/service/src/android/bordeaux/services/
BordeauxRanker.java 32 * For ranking: call scoreSample to the score of the rank
79 // Update the ranker with two samples, sample1 has higher rank than
  /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.
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/tr1/
type_traits 357 /// rank
359 struct rank
363 struct rank<_Tp[_Size]>
364 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
367 struct rank<_Tp[]>
368 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/tr1/
type_traits 357 /// rank
359 struct rank
363 struct rank<_Tp[_Size]>
364 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
367 struct rank<_Tp[]>
368 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
  /dalvik/vm/compiler/
InlineTransformation.cpp 27 int rank = calleeRegId - local
29 assert(rank >= 0);
31 return invoke->arg[rank];
33 return invoke->vC + rank;

Completed in 456 milliseconds

1 2 3 4 5 6 7 8 910