| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/ranking/ |
| RankingAlgorithm.java | 21 * 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
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/random/ |
| CorrelatedRandomVectorGenerator.java | 54 * the rank of the covariance matrix, and it is the dimension of the
78 /** Rank of the covariance matrix. */
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
[all...] |
| /external/libcxx/test/std/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, "");
|
| /ndk/sources/cxx-stl/llvm-libc++/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, "");
|
| /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/v8/tools/ |
| eval_gc_time.sh | 7 # Convenience Script used to rank GC NVP output.
13 echo " -r|--rank new-gen-rank|old-gen-rank GC mode to profile"
14 echo " (default: old-gen-rank)"
24 OP=old-gen-rank
35 -r|--rank)
37 new-gen-rank|old-gen-rank)
147 new-gen-rank)
[all...] |
| /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);
|
| /frameworks/base/core/java/android/provider/ |
| SearchIndexableResource.java | 46 * @param rank the rank of the data.
52 public SearchIndexableResource(int rank, int xmlResId, String className, int iconResId) {
54 this.rank = rank;
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/rank/ |
| Median.java | 17 package org.apache.commons.math.stat.descriptive.rank;
|
| /frameworks/base/core/java/com/android/internal/statusbar/ |
| NotificationVisibility.java | 34 public int rank; field in class:NotificationVisibility
42 private NotificationVisibility(String key, int rank, boolean visibile) {
45 this.rank = rank;
53 + " rank=" + rank
60 return obtain(this.key, this.rank, this.visible);
87 out.writeInt(this.rank);
93 this.rank = in.readInt();
101 public static NotificationVisibility obtain(String key, int rank, boolean visible)
[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...] |
| /packages/apps/Launcher3/tests/src/com/android/launcher3/shortcuts/ |
| ShortcutFilterTest.java | 84 int rank = shortcut.getRank(); local
88 assertTrue(rank > lastStaticRank);
89 lastStaticRank = rank;
93 assertTrue(rank > lastDynamicRank);
94 lastDynamicRank = rank;
118 public Shortcut(boolean isStatic, int rank) {
121 mRank = rank;
|
| /packages/apps/UnifiedEmail/tests/src/com/android/mail/utils/ |
| RankedComparatorTest.java | 51 assertTrue("Different objects with same rank should be equal.",
64 assertTrue("Known rank should be smaller than unknown rank.",
66 assertTrue("Unknown rank should be larger than known rank.",
77 assertTrue("Known rank should be smaller than null rank.",
79 assertTrue("null rank should be larger than known rank.",
81 assertTrue("Unknown and null rank should be equal."
94 private final String rank; field in class:RankedComparatorTest.DummyObject
[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; \
|
| /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...] |
| /external/chromium-trace/catapult/tracing/third_party/mannwhitneyu/ |
| mannwhitneyu.js | 5 var rank = {
20 array[i - 1]['rank'] = i;
37 sum += array[pos + i]['rank'];
39 sum += array[pos + i]['rank'];
42 array[pos]['rank'] = sum / (i + 1);
48 rank: function(x, y) {
115 var ranked = rank.rank(x, y),
136 ranksums[ranked[i].set] += ranked[i].rank
47 rank: function(x, y) { method
|
| /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/v8/tools/turbolizer/ |
| graph-layout.js | 158 if (output.rank > n.rank) {
257 // basis for bottom-up DFS to determine rank and node placement.
273 var rank = [];
282 rank[n.id] = -1;
283 n.rank = 0;
298 if (n.rank == MAX_RANK_SENTINEL) {
299 n.rank = 1;
312 if (input.visible && input.rank >= n.rank) {
[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;
|
| /packages/apps/Launcher3/src/com/android/launcher3/ |
| ItemInfo.java | 99 public int rank = 0; field in class:ItemInfo
129 rank = info.rank;
153 values.put(LauncherSettings.Favorites.RANK, rank);
164 rank = values.getAsInteger(LauncherSettings.Favorites.RANK);
207 + " rank=" + rank
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/correlation/ |
| SpearmansCorrelation.java | 28 * <p>Spearman's rank correlation. This implementation performs a rank
48 /** Rank correlation */
86 * Calculate the Spearman Rank Correlation Matrix.
88 * @return Spearman Rank Correlation Matrix
111 * Computes the Spearman's rank correlation matrix for the columns of the
124 * Computes the Spearman's rank correlation matrix for the columns of the
136 * Computes the Spearman's rank correlation coefficient between the two arrays.
143 * @return Returns Spearman's rank correlation coefficient for the two arrays
156 return new PearsonsCorrelation().correlation(rankingAlgorithm.rank(xArray)
[all...] |
