| /external/libcxx/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, "");
|
| Android.mk | 23 test_name := utilities/meta/meta.unary.prop.query/rank
24 test_src := rank.pass.cpp
|
| /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/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/ |
| lp_fence.c | 38 * The rank will be the number of bins in the scene. Whenever a rendering
40 * the counter == the rank, the fence is finished.
42 * \param rank the expected finished value of the fence counter.
45 lp_fence_create(unsigned rank)
59 fence->rank = rank;
83 * When the counter == the rank, the fence is finished.
94 assert(fence->count <= fence->rank);
97 debug_printf("%s count=%u rank=%u\n", __FUNCTION__,
98 fence->count, fence->rank);
[all...] |
| lp_fence.h | 50 unsigned rank; member in struct:lp_fence
56 lp_fence_create(unsigned rank);
|
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_fence.c | 38 * The rank will be the number of bins in the scene. Whenever a rendering
40 * the counter == the rank, the fence is finished.
42 * \param rank the expected finished value of the fence counter.
45 lp_fence_create(unsigned rank)
59 fence->rank = rank;
83 * When the counter == the rank, the fence is finished.
94 assert(fence->count <= fence->rank);
97 debug_printf("%s count=%u rank=%u\n", __FUNCTION__,
98 fence->count, fence->rank);
[all...] |
| lp_fence.h | 50 unsigned rank; member in struct:lp_fence
56 lp_fence_create(unsigned rank);
|
| /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/chromium_org/extensions/common/ |
| manifest.cc | 25 // Rank extension locations in a way that allows
28 // with the higher rank, as returned by this function. The actual
32 int rank = kInvalidRank; // Will CHECK that rank is not kInvalidRank. local
37 rank = 9;
41 rank = 8;
47 rank = 7;
51 rank = 6;
58 rank = 5;
62 rank = 4
[all...] |
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMpar.h | 58 /* jacobian is rank-deficient, obtain a least squares solution. */
60 // const Index rank = qr.nonzeroPivots(); // exactly double(0.)
61 const Index rank = qr.rank(); // use a threshold local
63 wa1.tail(n-rank).setZero();
65 wa1.head(rank) = s.topLeftCorner(rank,rank).template triangularView<Upper>().solve(qtb.head(rank));
81 /* if the jacobian is not rank deficient, the newton *
[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
24 createRandomPIMatrixOfRank(rank,rows,cols,m1);
26 VERIFY(rank == qr.rank());
27 VERIFY(cols - qr.rank() == qr.dimensionOfKernel());
50 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols))-1); local
52 createRandomPIMatrixOfRank(rank,Rows,Cols,m1);
54 VERIFY(rank == qr.rank());
55 VERIFY(Cols - qr.rank() == qr.dimensionOfKernel())
[all...] |
| lu.cpp | 51 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1); local
58 createRandomPIMatrixOfRank(rank, rows, cols, m1);
62 // The special value 0.01 below works well in tests. Keep in mind that we're only computing the rank
80 VERIFY(rank == lu.rank());
81 VERIFY(cols - lu.rank() == lu.dimensionOfKernel());
86 VERIFY(m1image.fullPivLu().rank() == rank);
116 VERIFY(size == lu.rank());
155 VERIFY_RAISES_ASSERT(lu.rank())
[all...] |
| sparseqr.cpp | 77 VERIFY_IS_EQUAL(dqr.rank(), solver.rank());
78 if(solver.rank()==A.cols()) // full rank
|
| jacobisvd.cpp | 119 // generate a full-rank m x n problem with m<n
127 Index rank = RankAtCompileTime2==Dynamic ? internal::random<Index>(1,cols) : Index(RankAtCompileTime2);
128 MatrixType2 m2(rank,cols);
132 } while(m2.jacobiSvd().setThreshold(test_precision<Scalar>()).rank()!=rank && (++guard)<10);
134 RhsType2 rhs2 = RhsType2::Random(rank);
137 Matrix<Scalar,Dynamic,1> tmp = qr.matrixQR().topLeftCorner(rank,rank).template triangularView<Upper>().adjoint().solve(rhs2);
139 tmp.tail(cols-rank).setZero();
148 // Now check with a rank deficient matri
[all...] |
| qr_fullpivoting.cpp | 19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1); local
24 createRandomPIMatrixOfRank(rank,rows,cols,m1);
26 VERIFY(rank == qr.rank());
27 VERIFY(cols - qr.rank() == qr.dimensionOfKernel());
|
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 25 * upper-triangular, and P and Q are permutation matrices. This is a rank-revealing LU
30 * the rank, invertibility, inverse, kernel, and determinant.
115 * \sa rank()
238 /** Allows to prescribe a threshold to be used by certain methods, such as rank(),
276 /** Returns the threshold that will be used by certain methods such as rank().
289 /** \returns the rank of the matrix of which *this is the LU decomposition.
295 inline Index rank() const function in class:Eigen::FullPivLU
315 return cols() - rank();
328 return rank() == cols();
341 return rank() == rows()
[all...] |
| /external/eigen/Eigen/src/QR/ |
| HouseholderQR.h | 34 * Note that no pivoting is performed. This is \b not a rank-revealing decomposition.
314 const Index rank = (std::min)(rows, cols); local
321 dec().matrixQR().leftCols(rank),
322 dec().hCoeffs().head(rank)).transpose()
326 .topLeftCorner(rank, rank)
328 .solveInPlace(c.topRows(rank));
330 dst.topRows(rank) = c.topRows(rank);
331 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
134 * \returns the exact or least-square solution if the rank is greater or equal to the number of columns of A,
212 /** \returns the rank of the matrix of which *this is the QR decomposition.
218 inline Index rank() const function in class:Eigen::FullPivHouseholderQR
238 return cols() - rank();
251 return rank() == cols();
264 return rank() == rows();
301 /** Allows to prescribe a threshold to be used by certain methods, such as rank(),
[all...] |
| /external/deqp/framework/platform/X11/ |
| tcuX11GlxPlatform.cpp | 451 class Rank
454 Rank (void) : m_value(0), m_bitsLeft(64) {}
464 void Rank::add (size_t bits, deUint32 value)
471 void Rank::sub (size_t bits, deUint32 value)
485 Rank rank;
496 rank.add(1, (caveat != GLX_NON_CONFORMANT_CONFIG));
499 rank.add(1, visual.getAttrib(GLX_TRANSPARENT_TYPE) == GLX_NONE);
502 rank.add(1, visual.getAttrib(GLX_STEREO) == False);
505 rank.add(1, visual.getAttrib(GLX_LEVEL) == 0)
[all...] |
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| lmpar.h | 39 /* jacobian is rank-deficient, obtain a least squares solution. */
70 /* if the jacobian is not rank deficient, the newton */
196 /* jacobian is rank-deficient, obtain a least squares solution. */
198 // const Index rank = qr.nonzeroPivots(); // exactly double(0.)
199 const Index rank = qr.rank(); // use a threshold local
201 wa1.tail(n-rank).setZero();
202 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) {
|
