| /external/valgrind/massif/tests/ |
| ignoring.c | 22 // clustered much more closely than those in the first half.
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/clustering/ |
| Clusterable.java | 23 * Interface for points that can be clustered together.
24 * @param <T> the type of point that can be clustered
|
| Cluster.java | 26 * @param <T> the type of points that can be clustered
|
| /packages/apps/Messaging/tests/src/com/android/messaging/datamodel/data/ |
| ConversationMessageDataTest.java | 92 assertTrue(data.getCanClusterWithNextMessage()); // 2 and 3 can be clustered
96 assertTrue(data.getCanClusterWithPreviousMessage()); // 2 and 3 can be clustered
|
| /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ui/ |
| ClusteredSuggestionsView.java | 25 * Suggestions view that displays suggestions clustered by corpus type.
|
| /external/eigen/unsupported/test/ |
| matrix_function.cpp | 24 // Returns a matrix with eigenvalues clustered around 0, 1 and 2.
44 // Returns a matrix with eigenvalues clustered around 0 and +/- i.
172 // Matrices with clustered eigenvalue lead to different code paths
|
| /packages/providers/DownloadProvider/src/com/android/providers/downloads/ |
| DownloadNotifier.java | 129 final Multimap<String, DownloadInfo> clustered = ArrayListMultimap.create(); local
133 clustered.put(tag, info);
138 for (String tag : clustered.keySet()) {
140 final Collection<DownloadInfo> cluster = clustered.get(tag);
302 if (!clustered.containsKey(tag)) {
|
| /frameworks/ex/common/java/com/android/common/speech/ |
| LoggingEvents.java | 50 * {@link LoggingEvents#EXTRA_EVENT}, clustered with keys to additional
75 * {@link LoggingEvents#EXTRA_EVENT}, clustered with keys to additional
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/generators/ |
| random_clustered.py | 69 .. [1] J. C. Miller "Percolation and Epidemics on Random Clustered Graphs."
71 .. [2] M.E.J. Newman, "Random clustered networks".
|
| /external/llvm/lib/Target/R600/ |
| AMDGPUInstrInfo.cpp | 204 // be clustered as expected. It should really split into 2 16 store batches.
206 // Loads are clustered until this returns false, rather than trying to schedule
208 // address space loads should be clustered, and ones which might cause bank
|
| /packages/apps/Gallery2/src/com/android/gallery3d/app/ |
| FilterUtils.java | 30 // A clustered album (not including album set) and its base sets are fixed.
137 // if this is a clustered album, set underCluster to true.
|
| /external/ceres-solver/internal/ceres/ |
| visibility_based_preconditioner.cc | 591 // the few cameras that have not been clustered.
598 // If the view was not clustered, randomly assign it to one of the
601 // clustered, it may lead to some quality degradation though.
604 // been clustered and deal with it?
|
| /frameworks/native/include/input/ |
| VelocityTracker.h | 145 // Weight by time delta. Data points clustered together are weighted less.
|
| /external/e2fsprogs/misc/ |
| ext4.5.in | 43 This ext4 feature enables clustered block allocation, so that the unit of
|
| /external/llvm/test/CodeGen/X86/ |
| misched-matrix.ll | 59 ; scheduled independently, and that the imull/adds are clustered.
|
| /external/eigen/doc/ |
| SparseLinearSystems.dox | 121 For iterative solvers, the compute step is used to eventually setup a preconditioner. For instance, with the ILUT preconditioner, the incomplete factors L and U are computed in this step. Remember that, basically, the goal of the preconditioner is to speedup the convergence of an iterative method by solving a modified linear system where the coefficient matrix has more clustered eigenvalues. For real problems, an iterative solver should always be used with a preconditioner. In Eigen, a preconditioner is selected by simply adding it as a template parameter to the iterative solver object.
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 27 * matrix is divided in clustered of eigenvalues that lies close together. This class delegates the
|
| MatrixLogarithm.h | 80 /** \brief Compute logarithm of triangular matrix with clustered eigenvalues. */
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineModuleInfo.h | 14 // The organization of information is primarily clustered around the source
|
| ScheduleDAG.h | 70 Cluster ///< Weak DAG edge linking a chain of clustered instrs.
|
| /external/eigen/unsupported/Eigen/src/Eigenvalues/ |
| ArpackSelfAdjointEigenSolver.h | 393 eigen_assert(false && "Specifying clustered eigenvalues is not yet supported!");
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGSDNodes.cpp | 38 STATISTIC(LoadsClustered, "Number of loads clustered together");
[all...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64A57FPLoadBalancing.cpp | 351 // range of chains is quite small and they are clustered between loads
|
| /libcore/luni/src/main/java/java/sql/ |
| DatabaseMetaData.java | 223 * States that this table index is a clustered index.
233 * States this table's index is neither a clustered index, not a hashed
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineAddSub.cpp | 186 // Debugging stuff are clustered here.
[all...] |
