| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/tree_policy/ |
| sample_tree_node_update.hpp | 56 /// Updates the rank of a node through a node_iterator node_it;
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/trie_policy/ |
| sample_trie_node_update.hpp | 58 /// Updates the rank of a node through a node_iterator node_it;
|
| /external/llvm/lib/Transforms/Scalar/ |
| Reassociate.cpp | 15 // In the implementation of this algorithm, constants are assigned rank = 0,
16 // function arguments are rank = 1, and other values are assigned ranks
18 // (starting at 2), which effectively gives values in deep loops higher rank
52 unsigned Rank;
54 ValueEntry(unsigned R, Value *O) : Rank(R), Op(O) {}
57 return LHS.Rank > RHS.Rank; // Sort so that highest rank goes to start.
71 dbgs() << ", #" << Ops[i].Rank << "] ";
211 return 0; // Otherwise it's a global or constant, rank 0
[all...] |
| /external/ceres-solver/internal/ceres/ |
| dogleg_strategy.h | 48 // because the Jacobian is often rank-deficient and in such cases
103 // Gauss-Newton solve full rank. In each solve, the strategy starts
|
| /external/eigen/Eigen/src/Cholesky/ |
| LDLT.h | 37 * zeros in the bottom right rank(A) - n submatrix. Avoiding the square root
40 * Remember that Cholesky decompositions are not rank-revealing. Also, do not use a Cholesky
285 // Finish early if the matrix is not full rank.
334 // Reference for the algorithm: Davis and Hager, "Multiple Rank
337 // allow their algorithm to work for rank-1 updates even if the
338 // original matrix is not of full rank.
339 // Here only rank-1 updates are implemented, to reduce the
357 // Check for termination due to an original decomposition of low-rank
|
| LLT.h | 37 * Remember that Cholesky decompositions are not rank-revealing. This LLT decomposition is only stable on positive definite matrices,
397 /** Performs a rank one update (or dowdate) of the current decomposition.
398 * If A = LL^* before the rank one update,
|
| /external/valgrind/main/mpi/ |
| mpiwrap_type_test.c | 224 int rank, size; local
244 MPI_Comm_rank( MPI_COMM_WORLD, &rank );
246 if (rank == 0) {
|
| /frameworks/base/docs/html/reference/com/google/android/gms/games/leaderboard/ |
| LeaderboardVariant.html | 761 <td class="jd-descrcol" width="100%">Constant returned when a player's rank for this variant is unknown.</td>
847 <div class="jd-descrdiv">Retrieves the viewing player's formatted rank for this variant, if any.</div>
901 <div class="jd-descrdiv">Retrieves the viewing player's rank for this variant, if any.</div>
1173 <div class="jd-tagdata jd-tagdescr"><p>Constant returned when a player's rank for this variant is unknown.
[all...] |
| /external/ceres-solver/include/ceres/ |
| normal_prior.h | 56 // which would be the case if the covariance matrix S is rank
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| LU.h | 40 Dynamic, // we don't know at compile time the dimension of the image (the rank)
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 36 * This is \b not a rank-revealing LU decomposition. Many features are intentionally absent from this class,
37 * such as rank computation. If you need these features, use class FullPivLU.
87 * \warning The matrix should have full rank (e.g. if it's square, it should be invertible).
88 * If you need to deal with non-full rank, use class FullPivLU instead.
|
| /external/eigen/test/eigen2/ |
| eigen2_cholesky.cpp | 89 #if 0 // cholesky is not rank-revealing anyway
|
| /external/eigen/test/ |
| inverse.cpp | 61 //Second: a rank one matrix (not invertible, except for 1x1 matrices)
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| r1updt.h | 59 /* add the spike from the rank 1 update to w. */
|
| /frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/ |
| stochastic_linear_ranker.cpp | 101 ALOGE("Unknown rank loss type: %d", rank_loss_type_);
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/rpcsvc/ |
| nis.x | 257 int rank;
268 int min_rank; /* minimum rank of bound endpoints */
269 int optimal_rank; /* best possible rank of all endpoints */
280 int rank;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/rpcsvc/ |
| nis.x | 257 int rank;
268 int min_rank; /* minimum rank of bound endpoints */
269 int optimal_rank; /* best possible rank of all endpoints */
280 int rank;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/rpcsvc/ |
| nis.x | 257 int rank;
268 int min_rank; /* minimum rank of bound endpoints */
269 int optimal_rank; /* best possible rank of all endpoints */
280 int rank;
|
| /external/eigen/blas/ |
| level2_real_impl.h | 187 /** DSPR performs the symmetric rank 1 operation
199 /** DSPR2 performs the symmetric rank 2 operation
|
| /packages/apps/QuickSearchBox/tests/src/com/android/quicksearchbox/ |
| ShortcutRepositoryTest.java | 393 assertShortcuts("expecting more recently clicked app to rank higher",
402 assertShortcuts("expecting more recently clicked app to rank higher",
453 assertShortcuts("hits for 'foo' and 'bar' on app2 should have combined to rank it " +
468 assertShortcuts("hits for '' on app2 should have combined to rank it " +
621 assertCorpusRanking("expecting apps to rank ahead of contacts (more clicks)",
628 assertCorpusRanking("expecting contacts to rank ahead of apps (more clicks)",
[all...] |
| /external/llvm/lib/CodeGen/ |
| StrongPHIElimination.cpp | 82 Node(unsigned v) : value(v), rank(0) { parent.setPointer(this); }
88 unsigned rank; member in struct:__anon11501::StrongPHIElimination::Node
442 if (Node1->rank > Node2->rank) {
444 } else if (Node1->rank < Node2->rank) {
448 Node1->rank++;
|
| /external/jmonkeyengine/engine/src/core/com/jme3/math/ |
| Eigen3f.java | 90 // Rank was 0 (or very close to 0), so just return.
272 * Check the rank of the given Matrix to determine if it is positive. While
284 * @return true if the given matrix has a non 0 rank.
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ |
| type_traits | 370 /// rank
372 struct rank
376 struct rank<_Tp[_Size]>
377 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
380 struct rank<_Tp[]>
381 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ |
| type_traits | 370 /// rank
372 struct rank
376 struct rank<_Tp[_Size]>
377 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
380 struct rank<_Tp[]>
381 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ |
| type_traits | 370 /// rank
372 struct rank
376 struct rank<_Tp[_Size]>
377 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
380 struct rank<_Tp[]>
381 : public integral_constant<std::size_t, 1 + rank<_Tp>::value> { };
[all...] |
