| /external/apache-commons-math/src/main/java/org/apache/commons/math/random/ |
| D | CorrelatedRandomVectorGenerator.java | 79 private int rank; field in CorrelatedRandomVectorGenerator
111 normalized = new double[rank]; in CorrelatedRandomVectorGenerator()
139 normalized = new double[rank]; in CorrelatedRandomVectorGenerator()
168 return rank; in getRank()
201 rank = 0; in decompose()
205 swap[rank] = rank; in decompose()
206 for (int i = rank + 1; i < order; ++i) { in decompose()
210 swap[rank] = i; in decompose()
216 if (swap[rank] != rank) { in decompose()
217 int tmp = index[rank]; in decompose()
[all …]
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| D | bitvector.cc | 344 const Rank &rank = ranks_[i / 512]; in rank1() local
345 UInt32 offset = rank.abs(); in rank1()
348 offset += rank.rel1(); in rank1()
352 offset += rank.rel2(); in rank1()
356 offset += rank.rel3(); in rank1()
360 offset += rank.rel4(); in rank1()
364 offset += rank.rel5(); in rank1()
368 offset += rank.rel6(); in rank1()
372 offset += rank.rel7(); in rank1()
414 const Rank &rank = ranks_[rank_id]; in select0() local
[all …]
|
| /external/marisa-trie/lib/marisa/ |
| D | bitvector.cc | 344 const Rank &rank = ranks_[i / 512]; in rank1() local
345 UInt32 offset = rank.abs(); in rank1()
348 offset += rank.rel1(); in rank1()
352 offset += rank.rel2(); in rank1()
356 offset += rank.rel3(); in rank1()
360 offset += rank.rel4(); in rank1()
364 offset += rank.rel5(); in rank1()
368 offset += rank.rel6(); in rank1()
372 offset += rank.rel7(); in rank1()
413 const Rank &rank = ranks_[rank_id]; in select0() local
[all …]
|
| /external/marisa-trie/v0_1_5/tests/ |
| D | unit-test.cc | 87 marisa_alpha::Rank rank; in TestRank() local
89 ASSERT(rank.abs() == 0); in TestRank()
90 ASSERT(rank.rel1() == 0); in TestRank()
91 ASSERT(rank.rel2() == 0); in TestRank()
92 ASSERT(rank.rel3() == 0); in TestRank()
93 ASSERT(rank.rel4() == 0); in TestRank()
94 ASSERT(rank.rel5() == 0); in TestRank()
95 ASSERT(rank.rel6() == 0); in TestRank()
96 ASSERT(rank.rel7() == 0); in TestRank()
98 rank.set_abs(0xFFFFFFFFU); in TestRank()
[all …]
|
| /external/marisa-trie/tests/ |
| D | unit-test.cc | 85 marisa::Rank rank; in TestRank() local
87 ASSERT(rank.abs() == 0); in TestRank()
88 ASSERT(rank.rel1() == 0); in TestRank()
89 ASSERT(rank.rel2() == 0); in TestRank()
90 ASSERT(rank.rel3() == 0); in TestRank()
91 ASSERT(rank.rel4() == 0); in TestRank()
92 ASSERT(rank.rel5() == 0); in TestRank()
93 ASSERT(rank.rel6() == 0); in TestRank()
94 ASSERT(rank.rel7() == 0); in TestRank()
96 rank.set_abs(0xFFFFFFFFU); in TestRank()
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | ExplicitOrdering.java | 40 return rank(left) - rank(right); // safe because both are nonnegative in compare()
43 private int rank(T value) { in rank() method in ExplicitOrdering
44 Integer rank = rankMap.get(value); in rank() local
45 if (rank == null) { in rank()
48 return rank; in rank()
54 int rank = 0; in buildRankMap() local
56 builder.put(value, rank++); in buildRankMap()
|
| /external/eigen/test/eigen2/ |
| D | eigen2_lu.cpp | 42 int rank = ei_random<int>(1, std::min(rows, cols)-1); in lu_non_invertible() local
47 for(int i = rank; i < rows; i++) m1.row(i).setZero(); in lu_non_invertible()
49 for(int i = rank; i < cols; i++) m1.col(i).setZero(); in lu_non_invertible()
56 VERIFY(rank == lu.rank()); in lu_non_invertible()
57 VERIFY(cols - lu.rank() == lu.dimensionOfKernel()); in lu_non_invertible()
60 VERIFY(lu.isSurjective() == (lu.rank() == rows)); in lu_non_invertible()
62 VERIFY(m1image.lu().rank() == rank); in lu_non_invertible()
65 VERIFY(sidebyside.lu().rank() == rank); in lu_non_invertible()
97 VERIFY(size == lu.rank()); in lu_invertible()
|
| /external/eigen/Eigen/src/LU/ |
| D | FullPivLU.h | 295 inline Index rank() const in rank() function
315 return cols() - rank(); in dimensionOfKernel()
328 return rank() == cols(); in isInjective()
341 return rank() == rows(); in isSurjective()
556 const Index cols = dec().matrixLU().cols(), dimker = cols - rank();
582 Matrix<Index, Dynamic, 1, 0, MaxSmallDimAtCompileTime, 1> pivots(rank());
588 eigen_internal_assert(p == rank());
596 m(dec().matrixLU().block(0, 0, rank(), cols));
597 for(Index i = 0; i < rank(); ++i)
602 m.block(0, 0, rank(), rank());
[all …]
|
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| D | lp_fence.c | 45 lp_fence_create(unsigned rank) in lp_fence_create() argument
59 fence->rank = rank; in lp_fence_create()
94 assert(fence->count <= fence->rank); in lp_fence_signal()
98 fence->count, fence->rank); in lp_fence_signal()
110 return f->count == f->rank; in lp_fence_signalled()
121 while (f->count < f->rank) { in lp_fence_wait()
|
| /external/eigen/test/ |
| D | qr_colpivoting.cpp | 19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1); in qr() local
24 createRandomPIMatrixOfRank(rank,rows,cols,m1); in qr()
26 VERIFY(rank == qr.rank()); in qr()
27 VERIFY(cols - qr.rank() == qr.dimensionOfKernel()); in qr()
50 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols))-1); in qr_fixedsize() local
52 createRandomPIMatrixOfRank(rank,Rows,Cols,m1); in qr_fixedsize()
54 VERIFY(rank == qr.rank()); in qr_fixedsize()
55 VERIFY(Cols - qr.rank() == qr.dimensionOfKernel()); in qr_fixedsize()
56 VERIFY(qr.isInjective() == (rank == Rows)); in qr_fixedsize()
57 VERIFY(qr.isSurjective() == (rank == Cols)); in qr_fixedsize()
|
| D | lu.cpp | 51 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1); in lu_non_invertible() local
58 createRandomPIMatrixOfRank(rank, rows, cols, m1); in lu_non_invertible()
80 VERIFY(rank == lu.rank()); in lu_non_invertible()
81 VERIFY(cols - lu.rank() == lu.dimensionOfKernel()); in lu_non_invertible()
86 VERIFY(m1image.fullPivLu().rank() == rank); in lu_non_invertible()
116 VERIFY(size == lu.rank()); in lu_invertible()
155 VERIFY_RAISES_ASSERT(lu.rank()) in lu_verify_assert()
|
| D | jacobisvd.cpp | 127 …Index rank = RankAtCompileTime2==Dynamic ? internal::random<Index>(1,cols) : Index(RankAtCompileTi… in jacobisvd_solve() local
128 MatrixType2 m2(rank,cols); in jacobisvd_solve()
132 } while(m2.jacobiSvd().setThreshold(test_precision<Scalar>()).rank()!=rank && (++guard)<10); in jacobisvd_solve()
134 RhsType2 rhs2 = RhsType2::Random(rank); in jacobisvd_solve()
137 …Matrix<Scalar,Dynamic,1> tmp = qr.matrixQR().topLeftCorner(rank,rank).template triangularView<Uppe… in jacobisvd_solve()
139 tmp.tail(cols-rank).setZero(); in jacobisvd_solve()
151 …Index rows3 = RowsAtCompileTime3==Dynamic ? internal::random<Index>(rank+1,2*cols) : Index(RowsAtC… in jacobisvd_solve()
152 …alar,RowsAtCompileTime3,Dynamic> C = Matrix<Scalar,RowsAtCompileTime3,Dynamic>::Random(rows3,rank); in jacobisvd_solve()
157 if(svd3.rank()!=rank) { in jacobisvd_solve()
160 std::cout << svd3.rank() << " == " << rank << "\n"; in jacobisvd_solve()
|
| D | qr_fullpivoting.cpp | 19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1); in qr() local
24 createRandomPIMatrixOfRank(rank,rows,cols,m1); in qr()
26 VERIFY(rank == qr.rank()); in qr()
27 VERIFY(cols - qr.rank() == qr.dimensionOfKernel()); in qr()
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| D | LMpar.h | 61 const Index rank = qr.rank(); // use a threshold in lmpar2() local
63 wa1.tail(n-rank).setZero(); in lmpar2()
65 …wa1.head(rank) = s.topLeftCorner(rank,rank).template triangularView<Upper>().solve(qtb.head(rank)); in lmpar2()
85 if (rank==n) { in lmpar2()
|
| /external/libcxx/test/std/utilities/meta/meta.unary.prop.query/ |
| D | rank.pass.cpp | 19 static_assert( std::rank<T>::value == A, ""); in test_rank()
20 static_assert( std::rank<const T>::value == A, ""); in test_rank()
21 static_assert( std::rank<volatile T>::value == A, ""); in test_rank()
22 static_assert( std::rank<const volatile T>::value == A, ""); in test_rank()
|
| /external/deqp/framework/platform/X11/ |
| D | tcuX11GlxPlatform.cpp | 484 Rank rank; in configRank() local
495 rank.add(1, (caveat != GLX_NON_CONFORMANT_CONFIG)); in configRank()
498 rank.add(1, visual.getAttrib(GLX_TRANSPARENT_TYPE) == GLX_NONE); in configRank()
501 rank.add(1, visual.getAttrib(GLX_STEREO) == False); in configRank()
504 rank.add(1, visual.getAttrib(GLX_LEVEL) == 0); in configRank()
507 rank.add(1, alphaSize > 0); in configRank()
510 rank.add(1, depthSize > 0); in configRank()
513 rank.add(1, stencilSize > 0); in configRank()
516 rank.add(1, (caveat != GLX_SLOW_CONFIG)); in configRank()
519 rank.add(4, de::min(minRGB, alphaSize)); in configRank()
[all …]
|
| /external/eigen/Eigen/src/QR/ |
| D | HouseholderQR.h | 314 const Index rank = (std::min)(rows, cols);
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();
|
| D | FullPivHouseholderQR.h | 218 inline Index rank() const
238 return cols() - rank();
251 return rank() == cols();
264 return rank() == rows();
503 if(dec().rank()==0)
512 for (Index k = 0; k < dec().rank(); ++k)
522 .topLeftCorner(dec().rank(), dec().rank())
524 .solveInPlace(c.topRows(dec().rank()));
526 …for(Index i = 0; i < dec().rank(); ++i) dst.row(dec().colsPermutation().indices().coeff(i)) = c.ro…
527 …for(Index i = dec().rank(); i < cols; ++i) dst.row(dec().colsPermutation().indices().coeff(i)).set…
|
| /external/parameter-framework/tools/xmlGenerator/ |
| D | EddParser.py | 824 rank, rest = self.__getRank__(line)
829 self.__checkIndentation__(rank)
831 return rank, element
839 rank = self.rankPattern.match(line)
840 if rank :
841 rank, rest = rank.group(1, 2)
850 if rank.find(" ") > -1 :
853 rank = len (rank) + 1 # rank starts at 1
856 return rank, rest
859 def __checkIndentation__(self, rank): argument
[all …]
|
| /external/eigen/debug/msvc/ |
| D | eigen_autoexp_part.dat | 132 rank: 2,
139 rank: 2,
176 rank: 2,
183 rank: 2,
220 rank: 2,
227 rank: 2,
264 rank: 2,
271 rank: 2,
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| D | lmpar.h | 199 const Index rank = qr.rank(); // use a threshold in lmpar2() local
201 wa1.tail(n-rank).setZero(); in lmpar2()
202 …qr.matrixQR().topLeftCorner(rank, rank).template triangularView<Upper>().solveInPlace(wa1.head(ran… in lmpar2()
222 if (rank==n) { in lmpar2()
|
| /external/eigen/Eigen/src/misc/ |
| D | Kernel.h | 46 m_rank(dec.rank()),
52 inline Index rank() const { return m_rank; }
74 using Base::rank; \
|
| D | Image.h | 44 : m_dec(dec), m_rank(dec.rank()),
51 inline Index rank() const { return m_rank; }
76 using Base::rank; \
|
| /external/eigen/doc/examples/ |
| D | TutorialLinAlgSetThreshold.cpp | 13 cout << "By default, the rank of A is found to be " << lu.rank() << endl; in main()
15 cout << "With threshold 1e-5, the rank of A is found to be " << lu.rank() << endl; in main()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/correlation/ |
| D | SpearmansCorrelation.java | 156 return new PearsonsCorrelation().correlation(rankingAlgorithm.rank(xArray), in correlation()
157 rankingAlgorithm.rank(yArray)); in correlation()
169 matrix.setColumn(i, rankingAlgorithm.rank(matrix.getColumn(i))); in rankTransform()
|