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

123

/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/rank/
H A DMedian.java17 package org.apache.commons.math.stat.descriptive.rank;
H A DMax.java17 package org.apache.commons.math.stat.descriptive.rank;
H A DMin.java17 package org.apache.commons.math.stat.descriptive.rank;
H A DPercentile.java17 package org.apache.commons.math.stat.descriptive.rank;
/external/apache-commons-math/src/main/java/org/apache/commons/math/stat/ranking/
H A DRankingAlgorithm.java21 * Interface representing a rank transformation.
28 * <p>Performs a rank transformation on the input data, returning an array
40 double[] rank (double[] data); method in interface:RankingAlgorithm
H A DNaturalRanking.java46 * <th><code>rank(data)</code></th>
190 public double[] rank(double[] data) { method in class:NaturalRanking
/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/apache-commons-math/src/main/java/org/apache/commons/math/random/
H A DCorrelatedRandomVectorGenerator.java54 * the rank of the covariance matrix, and it is the dimension of the
79 private int rank; field in class:CorrelatedRandomVectorGenerator
111 normalized = new double[rank];
139 normalized = new double[rank];
160 /** Get the rank of the covariance matrix.
161 * The rank is the number of independent rows in the covariance
164 * @return rank of the square matrix.
168 return rank;
201 rank = 0;
205 swap[rank]
[all...]
/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/apache-commons-math/src/main/java/org/apache/commons/math/estimation/
H A DLevenbergMarquardtEstimator.java32 * to their jacobian column norm. Only the rank of the matrix and some loop bounds
128 private int rank; field in class:LevenbergMarquardtEstimator
501 // jacobian is rank-deficient, obtain a least squares solution
502 for (int j = 0; j < rank; ++j) {
505 for (int j = rank; j < cols; ++j) {
508 for (int k = rank - 1; k >= 0; --k) {
535 // if the jacobian is not rank deficient, the Newton step provides
540 if (rank == solvedCols) {
793 * <p>This decomposition handles rank deficient cases since the tranformations
836 rank
[all...]
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/
H A DLevenbergMarquardtOptimizer.java35 * to their jacobian column norm. Only the rank of the matrix and some loop bounds
125 private int rank; field in class:LevenbergMarquardtOptimizer
232 * rank of the matrix is reduced.
508 // jacobian is rank-deficient, obtain a least squares solution
509 for (int j = 0; j < rank; ++j) {
512 for (int j = rank; j < cols; ++j) {
515 for (int k = rank - 1; k >= 0; --k) {
540 // if the jacobian is not rank deficient, the Newton step provides
545 if (rank == solvedCols) {
793 * <p>This decomposition handles rank deficien
[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/marisa-trie/tests/
H A Dunit-test.cc6 #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);
94 ASSERT(rank
[all...]
/external/marisa-trie/v0_1_5/tests/
H A Dunit-test.cc6 #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);
96 ASSERT(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...]
/external/marisa-trie/lib/marisa/
H A Dbitvector.cc344 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();
372 offset += rank.rel7();
413 const Rank &rank local
497 const Rank &rank = ranks_[rank_id]; local
[all...]

Completed in 506 milliseconds

123