| /ndk/sources/cxx-stl/llvm-libc++/test/utilities/meta/meta.unary.prop.query/ |
| rank.pass.cpp | 12 // rank
19 static_assert( std::rank<T>::value == A, "");
20 static_assert( std::rank<const T>::value == A, "");
21 static_assert( std::rank<volatile T>::value == A, "");
22 static_assert( std::rank<const volatile T>::value == A, "");
|
| /external/eigen/doc/examples/ |
| TutorialLinAlgSetThreshold.cpp | 13 cout << "By default, the rank of A is found to be " << lu.rank() << endl;
15 cout << "With threshold 1e-5, the rank of A is found to be " << lu.rank() << endl;
|
| TutorialLinAlgRankRevealing.cpp | 15 cout << "The rank of A is " << lu_decomp.rank() << endl;
|
| /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/marisa-trie/lib/marisa/ |
| bitvector.cc | 160 Vector<Rank> ranks;
344 const Rank &rank = ranks_[i / 512]; local
345 UInt32 offset = rank.abs();
348 offset += rank.rel1();
352 offset += rank.rel2();
356 offset += rank.rel3();
360 offset += rank.rel4();
364 offset += rank.rel5();
368 offset += rank.rel6()
413 const Rank &rank = ranks_[rank_id]; local
497 const Rank &rank = ranks_[rank_id]; local
[all...] |
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| bitvector.cc | 160 Vector<Rank> ranks;
344 const Rank &rank = ranks_[i / 512]; local
345 UInt32 offset = rank.abs();
348 offset += rank.rel1();
352 offset += rank.rel2();
356 offset += rank.rel3();
360 offset += rank.rel4();
364 offset += rank.rel5();
368 offset += rank.rel6()
414 const Rank &rank = ranks_[rank_id]; local
499 const Rank &rank = ranks_[rank_id]; local
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_lu.cpp | 42 int rank = ei_random<int>(1, std::min(rows, cols)-1); local
47 for(int i = rank; i < rows; i++) m1.row(i).setZero();
49 for(int i = rank; i < cols; i++) m1.col(i).setZero();
56 VERIFY(rank == lu.rank());
57 VERIFY(cols - lu.rank() == lu.dimensionOfKernel());
60 VERIFY(lu.isSurjective() == (lu.rank() == rows));
62 VERIFY(m1image.lu().rank() == rank);
65 VERIFY(sidebyside.lu().rank() == rank)
[all...] |
| /external/eigen/Eigen/src/misc/ |
| Kernel.h | 46 m_rank(dec.rank()),
52 inline Index rank() const { return m_rank; } function in struct:Eigen::internal::kernel_retval_base
74 using Base::rank; \
|
| Image.h | 28 Dynamic, // we don't know at compile time the dimension of the image (the rank)
44 : m_dec(dec), m_rank(dec.rank()),
51 inline Index rank() const { return m_rank; } function in struct:Eigen::internal::image_retval_base
76 using Base::rank; \
|
| /external/eigen/test/ |
| qr_colpivoting.cpp | 19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1); local
26 createRandomPIMatrixOfRank(rank,rows,cols,m1);
28 VERIFY(rank == qr.rank());
29 VERIFY(cols - qr.rank() == qr.dimensionOfKernel());
52 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols))-1); local
54 createRandomPIMatrixOfRank(rank,Rows,Cols,m1);
56 VERIFY(rank == qr.rank());
57 VERIFY(Cols - qr.rank() == qr.dimensionOfKernel())
[all...] |
| lu.cpp | 52 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1); local
59 createRandomPIMatrixOfRank(rank, rows, cols, m1);
63 // The special value 0.01 below works well in tests. Keep in mind that we're only computing the rank
81 VERIFY(rank == lu.rank());
82 VERIFY(cols - lu.rank() == lu.dimensionOfKernel());
87 VERIFY(m1image.fullPivLu().rank() == rank);
118 VERIFY(size == lu.rank());
159 VERIFY_RAISES_ASSERT(lu.rank())
[all...] |
| qr_fullpivoting.cpp | 19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1); local
25 createRandomPIMatrixOfRank(rank,rows,cols,m1);
27 VERIFY(rank == qr.rank());
28 VERIFY(cols - qr.rank() == qr.dimensionOfKernel());
|
| /external/marisa-trie/tests/ |
| unit-test.cc | 6 #include <marisa/rank.h>
85 marisa::Rank rank; local
87 ASSERT(rank.abs() == 0);
88 ASSERT(rank.rel1() == 0);
89 ASSERT(rank.rel2() == 0);
90 ASSERT(rank.rel3() == 0);
91 ASSERT(rank.rel4() == 0);
92 ASSERT(rank.rel5() == 0);
93 ASSERT(rank.rel6() == 0)
[all...] |
| /external/marisa-trie/v0_1_5/tests/ |
| unit-test.cc | 6 #include <marisa_alpha/rank.h>
87 marisa_alpha::Rank rank; local
89 ASSERT(rank.abs() == 0);
90 ASSERT(rank.rel1() == 0);
91 ASSERT(rank.rel2() == 0);
92 ASSERT(rank.rel3() == 0);
93 ASSERT(rank.rel4() == 0);
94 ASSERT(rank.rel5() == 0);
95 ASSERT(rank.rel6() == 0)
[all...] |
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 25 * are permutation matrices. This is a rank-revealing LU decomposition. The eigenvalues (diagonal
29 * the rank, invertibility, inverse, kernel, and determinant.
114 * \sa rank()
237 /** Allows to prescribe a threshold to be used by certain methods, such as rank(),
275 /** Returns the threshold that will be used by certain methods such as rank().
288 /** \returns the rank of the matrix of which *this is the LU decomposition.
294 inline Index rank() const function in class:Eigen::FullPivLU
313 return cols() - rank();
326 return rank() == cols();
339 return rank() == rows()
[all...] |
| /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;
|
| /external/eigen/Eigen/src/QR/ |
| HouseholderQR.h | 34 * Note that no pivoting is performed. This is \b not a rank-revealing decomposition.
289 const Index rank = (std::min)(rows, cols); local
296 dec().matrixQR().leftCols(rank),
297 dec().hCoeffs().head(rank)).transpose()
301 .topLeftCorner(rank, rank)
303 .solveInPlace(c.topRows(rank));
305 dst.topRows(rank) = c.topRows(rank);
306 dst.bottomRows(cols-rank).setZero()
[all...] |
| FullPivHouseholderQR.h | 32 * \brief Householder rank-revealing QR decomposition of a matrix with full pivoting
36 * This class performs a rank-revealing QR decomposition of a matrix \b A into matrices \b P, \b Q and \b R
44 * This decomposition performs a very prudent full pivoting in order to be rank-revealing and achieve optimal
196 /** \returns the rank of the matrix of which *this is the QR decomposition.
202 inline Index rank() const function in class:Eigen::FullPivHouseholderQR
221 return cols() - rank();
234 return rank() == cols();
247 return rank() == rows();
279 /** Allows to prescribe a threshold to be used by certain methods, such as rank(),
317 /** Returns the threshold that will be used by certain methods such as rank()
[all...] |
| /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/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| lmpar.h | 37 /* jacobian is rank-deficient, obtain a least squares solution. */
68 /* if the jacobian is not rank deficient, the newton */
192 /* jacobian is rank-deficient, obtain a least squares solution. */
194 // const Index rank = qr.nonzeroPivots(); // exactly double(0.)
195 const Index rank = qr.rank(); // use a threshold local
197 wa1.tail(n-rank).setZero();
198 qr.matrixQR().topLeftCorner(rank, rank).template triangularView<Upper>().solveInPlace(wa1.head(rank));
[all...] |
| /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) {
|
| /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...] |
| /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);
|
| /dalvik/vm/compiler/ |
| InlineTransformation.cpp | 27 int rank = calleeRegId - local
29 assert(rank >= 0);
31 return invoke->arg[rank];
33 return invoke->vC + rank;
|
