| /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++/4.4.3/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/ceres-solver/internal/ceres/ |
| low_rank_inverse_hessian.h | 63 // max_num_corrections is the rank of the Hessian approximation.
76 // Update the low rank approximation. delta_x is the change in the
|
| corrector.cc | 61 // Hessian gets both the scaling and the rank-1 curvature
75 // newton hessian goes from being a full rank correction to a rank
|
| /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.
|
| /external/chromium_org/chrome/browser/history/ |
| top_sites_backend.cc | 121 db_->SetPageThumbnail(delta.added[i].url, delta.added[i].rank, Images());
124 db_->UpdatePageRank(delta.moved[i].url, delta.moved[i].rank);
|
| top_sites_database.cc | 179 int rank = GetURLRank(url); local
180 if (rank == -1) {
260 LOG(WARNING) << "Updating rank of an unknown URL: " << url.url.spec();
287 // Set the url's rank.
|
| /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
|
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 20 * \brief Householder rank-revealing QR decomposition of a matrix with column-pivoting
24 * This class performs a rank-revealing QR decomposition of a matrix \b A into matrices \b P, \b Q and \b R
32 * This decomposition performs column pivoting in order to be rank-revealing and improve
176 /** \returns the rank of the matrix of which *this is the QR decomposition.
182 inline Index rank() const function in class:Eigen::ColPivHouseholderQR
201 return cols() - rank();
214 return rank() == cols();
227 return rank() == rows();
260 /** Allows to prescribe a threshold to be used by certain methods, such as rank(),
298 /** Returns the threshold that will be used by certain methods such as rank()
[all...] |
| /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 << "] ";
136 // Sort the XorOpnd-Pointer in ascending order of symbolic-value-rank
[all...] |
| /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> { };
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/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/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
| type_traits | 354 /// rank
356 struct rank
360 struct rank<_Tp[_Size]>
361 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
364 struct rank<_Tp[]>
365 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/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/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/tr1/ |
| type_traits | 354 /// rank
356 struct rank
360 struct rank<_Tp[_Size]>
361 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
364 struct rank<_Tp[]>
365 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/tr1/ |
| 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/eigen/Eigen/src/Geometry/ |
| Umeyama.h | 143 Index rank = 0; for (Index i=0; i<m; ++i) if (!internal::isMuchSmallerThan(d.coeff(i),d.coeff(0))) ++rank; local
144 if (rank == m-1) {
|
| /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/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
| dot.stg | 52 {rank=same; rankdir=TB; <states; separator="; ">}
|
| /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;
|
