| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
| tree_policy.hpp | 145 // Updates the rank of a node through a node_iterator node_it;
|
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
| tree_policy.hpp | 145 // Updates the rank of a node through a node_iterator node_it;
|
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/ |
| tree_policy.hpp | 145 // Updates the rank of a node through a node_iterator node_it;
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/ |
| tree_policy.hpp | 145 // Updates the rank of a node through a node_iterator node_it;
|
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/ |
| tree_policy.hpp | 146 // 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/ |
| tree_policy.hpp | 140 /// Updates the rank of a node through a node_iterator node_it;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/ |
| tree_policy.hpp | 146 // Updates the rank of a node through a node_iterator node_it;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/ |
| tree_policy.hpp | 140 /// Updates the rank of a node through a node_iterator node_it;
|
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/ |
| tree_policy.hpp | 140 /// Updates the rank of a node through a node_iterator node_it;
|
| /external/ceres-solver/include/ceres/ |
| solver.h | 161 // The LBFGS hessian approximation is a low rank approximation to
162 // the inverse of the Hessian matrix. The rank of the
164 // complexity of using the approximation. Higher the rank, the
174 // So increasing this rank to a large number will cost time and
177 // maximum rank. The best choice usually requires some problem
[all...] |
| types.h | 179 // an initial estimate with rank-one updates using the gradient at each
205 // Broyden, C.G., "The Convergence of a Class of Double-rank Minimization
|
| /external/chromium/chrome/common/extensions/ |
| extension.cc | 178 // Rank extension locations in a way that allows
181 // with the higher rank, as returned by this function. The actual
185 int rank = kInvalidRank; // Will CHECK that rank is not kInvalidRank. local
190 rank = 6;
196 rank = 5;
202 rank = 4;
208 rank = 3;
212 rank = 2;
216 rank = 1
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ |
| type_traits | [all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ |
| type_traits | [all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ |
| type_traits | [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/chromium_org/third_party/openssl/openssl/crypto/des/ |
| des_opts.c | 427 int rank[16]; local
437 rank[i]=0;
|
| /external/eigen/test/ |
| main.h | 305 /** Creates a random Partial Isometry matrix of given rank.
308 * This is very useful to test rank-revealing algorithms.
|
| /external/openssl/crypto/des/ |
| des_opts.c | 427 int rank[16]; local
437 rank[i]=0;
|
| /packages/inputmethods/LatinIME/native/jni/src/ |
| defines.h | 102 static inline void dumpWordInfo(const int *word, const int length, const int rank,
107 AKLOGI("%2d [ %s ] (%d)", rank, charBuf, probability);
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| Dominators.java | 41 * rank to keep the union-find tree balanced.
|
| /external/chromium/chrome/browser/autocomplete/ |
| autocomplete_match.h | 134 // returned by various providers. This is used to rank matches among all
|
| /external/chromium_org/chromeos/dbus/ibus/ |
| ibus_component.cc | 99 ibus_object_writer.AppendUint32(0); // The engine rank is not used.
|
| /external/chromium_org/net/http/ |
| http_auth_handler.h | 93 // Numeric rank based on the challenge's security level. Higher
|
| /external/chromium_org/net/third_party/nss/ssl/ |
| notes.txt | 60 Rank (order) of locks
|
