Searched defs:rank (Results 1 - 25 of 55) sorted by relevance

123

/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
H A Dlp_fence.c38 * 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) argument
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...]
H A Dlp_fence.h50 unsigned rank; member in struct:lp_fence
56 lp_fence_create(unsigned rank);
/external/mesa3d/src/gallium/drivers/llvmpipe/
H A Dlp_fence.c38 * 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) argument
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...]
H A Dlp_fence.h50 unsigned rank; member in struct:lp_fence
56 lp_fence_create(unsigned rank);
/external/eigen/Eigen/src/misc/
H A DKernel.h46 m_rank(dec.rank()),
52 inline Index rank() const { return m_rank; } function in struct:Eigen::internal::kernel_retval_base
74 using Base::rank; \
H A DImage.h28 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/eigen2/
H A Deigen2_lu.cpp42 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()
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DExplicitOrdering.java40 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);
45 if (rank == null) {
48 return rank;
54 int rank = 0;
56 builder.put(value, rank++);
/external/eigen/test/
H A Dlu.cpp51 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...]
H A Dqr_colpivoting.cpp19 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()
[all...]
H A Dqr_fullpivoting.cpp19 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/unsupported/Eigen/src/LevenbergMarquardt/
H A DLMpar.h58 /* 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 deficien
[all...]
/external/chromium_org/components/precache/core/
H A Dprecache_fetcher.cc207 int64 rank = 0; local
209 it != starting_urls_.end() && rank < config.top_sites_count();
210 ++it, ++rank) {
/external/chromium_org/extensions/common/
H A Dmanifest.cc28 // 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;
68 rank
[all...]
/external/eigen/Eigen/src/Geometry/
H A DUmeyama.h143 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/eigen/unsupported/Eigen/src/NonLinearOptimization/
H A Dlmpar.h39 /* 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/QR/
H A DHouseholderQR.h34 * 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)
[all...]
H A DColPivHouseholderQR.h20 * \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
166 * For rank-deficient matrices, use
168 * matrixR().topLeftCorner(rank(), rank()).template triangularView<Upper>()
215 /** \returns the rank of the matrix of which *this is the QR decomposition.
221 inline Index rank() const function in class:Eigen::ColPivHouseholderQR
241 return cols() - rank();
254 return rank()
[all...]
H A DFullPivHouseholderQR.h32 * \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/openssl/crypto/des/
H A Ddes_opts.c427 int rank[16]; local
437 rank[i]=0;
/external/valgrind/main/mpi/
H A Dmpiwrap_type_test.c224 int rank, size; local
244 MPI_Comm_rank( MPI_COMM_WORLD, &rank );
246 if (rank == 0) {
/external/chromium_org/chrome/browser/history/
H A Dtop_sites_database.cc26 // with the highest rank will be the next one evicted. Forced
27 // thumbnails have a rank of -1.
491 int rank = GetURLRank(url); local
492 if (rank == kRankOfNonExistingURL) {
554 << "Thumbnail without a forced time stamp has a forced rank, or the "
560 // Update rank if this is not a forced thumbnail.
569 << "Thumbnail without a forced time stamp has a forced rank, or the "
582 << "Thumbnail without a forced time stamp has a forced rank, or the "
587 LOG(WARNING) << "Updating rank of an unknown URL: " << url.url.spec();
644 // Set the url's rank an
[all...]
/external/eigen/Eigen/src/LU/
H A DFullPivLU.h25 * 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()
[all...]
/external/eigen/Eigen/src/SPQRSupport/
H A DSuiteSparseQRSupport.h39 * This class is used to perform a multithreaded and multifrontal rank-revealing QR decomposition
153 Index rk = this->rank();
189 * Gets the rank of the matrix.
190 * It should be equal to matrixQR().cols if the matrix is full-rank
192 Index rank() const function in class:Eigen::SPQR
231 mutable Index m_rank; // The rank of the matrix
/external/ceres-solver/internal/ceres/
H A Dcovariance_impl.cc482 const SuiteSparse_long rank = local
494 if (rank < cholmod_jacobian.ncol) {
495 LOG(ERROR) << "Jacobian matrix is rank deficient. "
497 << " rank: " << rank;
686 if (qr_solver.rank() < jacobian.num_cols) {
687 LOG(ERROR) << "Jacobian matrix is rank deficient. "
689 << " rank: " << qr_solver.rank();

Completed in 433 milliseconds

123