/external/eigen/Eigen/src/SPQRSupport/ |
SuiteSparseQRSupport.h | 40 * This class is used to perform a multithreaded and multifrontal rank-revealing QR decomposition 110 * Tim Davis, "Algorithm 915, SuiteSparseQR: Multifrontal Multithreaded Rank-Revealing 160 Index rk = this->rank(); 200 * Gets the rank of the matrix. 201 * It should be equal to matrixQR().cols if the matrix is full-rank 203 Index rank() const function in class:Eigen::SPQR 245 mutable Index m_rank; // The rank of the matrix
|
/frameworks/base/tools/apilint/ |
apilint.py | 650 def rank(p): function in function:verify_layering 658 cr = rank(clazz.pkg.name) 662 ir = rank(f.typ) 667 ir = rank(m.typ) 671 ir = rank(arg) [all...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
trees.c | 840 int rank; /* index in bl_order */
local 849 for (rank = 0; rank < blcodes; rank++) {
850 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
851 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
[all...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
trees.c | 842 int rank; /* index in bl_order */
local 851 for (rank = 0; rank < blcodes; rank++) {
852 Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
853 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
[all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/estimation/ |
LevenbergMarquardtEstimator.java | 32 * to their jacobian column norm. Only the rank of the matrix and some loop bounds 127 /** Rank of the jacobian matrix. */ 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 tranformation [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/ |
LevenbergMarquardtOptimizer.java | 35 * to their jacobian column norm. Only the rank of the matrix and some loop bounds 124 /** Rank of the jacobian matrix. */ 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) [all...] |
/external/eigen/Eigen/src/SparseQR/ |
SparseQR.h | 44 * \brief Sparse left-looking rank-revealing QR factorization 46 * This class implements a left-looking rank-revealing QR decomposition 52 * rank-revealing permutations. Use colsPermutation() to get it. 58 * R is the sparse triangular or trapezoidal matrix. The later occurs when A is rank-deficient. 59 * matrixR().topLeftCorner(rank(), rank()) always returns a triangular factor of full rank. 149 Index rank() const function in class:Eigen::SparseQR 197 Index rank = this->rank(); local [all...] |
/external/pdfium/third_party/zlib_v128/ |
trees.c | 840 int rank; /* index in bl_order */ local 849 for (rank = 0; rank < blcodes; rank++) { 850 Tracev((stderr, "\nbl code %2d ", bl_order[rank])); 851 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); [all...] |
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
StrongPHIElimination.cpp | 82 Node(unsigned v) : value(v), rank(0) { parent.setPointer(this); } 88 unsigned rank; member in struct:__anon31205::StrongPHIElimination::Node 445 if (Node1->rank > Node2->rank) { 447 } else if (Node1->rank < Node2->rank) { 451 Node1->rank++; [all...] |
/external/syslinux/com32/lib/zlib/ |
trees.c | 846 int rank; /* index in bl_order */ local 855 for (rank = 0; rank < blcodes; rank++) { 856 Tracev((stderr, "\nbl code %2d ", bl_order[rank])); 857 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); [all...] |
/external/zlib/src/ |
trees.c | 840 int rank; /* index in bl_order */ local 849 for (rank = 0; rank < blcodes; rank++) { 850 Tracev((stderr, "\nbl code %2d ", bl_order[rank])); 851 send_bits(s, s->bl_tree[bl_order[rank]].Len, 3); [all...] |
/frameworks/base/core/java/com/android/internal/inputmethod/ |
InputMethodSubtypeSwitchingController.java | 339 final int rank = i; local 341 pw.println(prefix + "rank=" + rank + " item=" + item); 363 * <p>We call the index of {@link #mUsageHistoryOfSubtypeListItemIndex} as "Usage Rank" 436 final int rank = mUsageHistoryOfSubtypeListItemIndex[i]; local 438 pw.println(prefix + "rank=" + rank + " item=" + item);
|
/hardware/qcom/gps/msm8909/utils/ |
LocTimer.cpp | 506 int rank = -1; local 511 rank = timer->mFutureTime.tv_sec - mFutureTime.tv_sec; 513 return rank;
|
/hardware/qcom/gps/msm8996/utils/ |
LocTimer.cpp | 504 int rank = -1; local 509 rank = timer->mFutureTime.tv_sec - mFutureTime.tv_sec; 511 return rank;
|
/hardware/qcom/gps/msm8998/utils/ |
LocTimer.cpp | 504 int rank = -1; local 509 rank = timer->mFutureTime.tv_sec - mFutureTime.tv_sec; 510 if(0 == rank) 512 //rank against tv_nsec for msec accuracy 513 rank = (int)(timer->mFutureTime.tv_nsec - mFutureTime.tv_nsec); 516 return rank;
|
/packages/apps/Settings/src/com/android/settings/notification/ |
NotificationStation.java | 317 final Ranking rank = new Ranking(); local 397 if (mRanking != null && mRanking.getRanking(sbn.getKey(), rank)) { 402 .append(Ranking.importanceToString(rank.getImportance())); 403 if (rank.getImportanceExplanation() != null) { 408 .append(rank.getImportanceExplanation()); 414 .append(Boolean.toString(rank.canShowBadge()));
|
/toolchain/binutils/binutils-2.25/gas/ |
expr.c | 1767 operator_rankT rank = (operator_rankT) rankarg; local [all...] |
/cts/apps/CtsVerifier/src/com/android/cts/verifier/notifications/ |
MockListener.java | 78 public static final String JSON_RANK = "rank"; 247 Ranking rank = new Ranking(); local 251 rankingMap.getRanking(key, rank); 255 note.put(JSON_RANK, rank.getRank()); 256 note.put(JSON_AMBIENT, rank.isAmbient()); 257 note.put(JSON_MATCHES_ZEN_FILTER, rank.matchesInterruptionFilter());
|
/frameworks/base/services/core/java/com/android/server/notification/ |
NotificationRecord.java | 695 public void setVisibility(boolean visible, int rank) { 702 .addTaggedData(MetricsEvent.NOTIFICATION_SHADE_INDEX, rank)); 710 rank); local [all...] |
/packages/apps/Launcher3/src/com/android/launcher3/ |
AutoInstallsLayout.java | 123 private static final String ATTR_RANK = "rank"; 233 long rank = Long.parseLong(getAttributeValue(parser, ATTR_RANK)); local 234 out[1] = (FeatureFlags.NO_ALL_APPS_ICON || rank < mIdp.getAllAppsButtonRank()) 235 ? rank : (rank + 1); 568 int rank = 0; local 576 mValues.put(Favorites.RANK, rank); 583 rank++;
|
LauncherProvider.java | 1155 int rank = 0; local [all...] |
/packages/apps/Launcher3/src/com/android/launcher3/folder/ |
FolderPagedView.java | 189 * Create space for a new item at the end, and returns the rank for that item. 193 int rank = getItemCount(); local 195 views.add(rank, null); 197 setCurrentPage(rank / mMaxItemsPerPage); 198 return rank; 201 public View createAndAddViewForRank(ShortcutInfo item, int rank) { 203 addViewForRank(icon, item, rank); 208 * Adds the {@param view} to the layout based on {@param rank} and updated the position 211 public void addViewForRank(View view, ShortcutInfo item, int rank) { 212 int pagePos = rank % mMaxItemsPerPage 315 int newX, newY, rank; local [all...] |
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
CanvasViewInfo.java | 1064 Integer rank = rankMap.get(node); local 1071 Integer rank = usedIndexes.get(i); local [all...] |
/external/opencv/cxcore/src/ |
cxdatastructs.cpp | 2586 int rank; member in struct:CvPTreeNode [all...] |
/frameworks/base/core/java/android/service/notification/ |
NotificationListenerService.java | 1568 Integer rank = mRanks.get(key); local [all...] |