/external/ceres-solver/internal/ceres/ |
linear_solver.h | 170 // Here A is a matrix of size m x n, with full column rank. If A 171 // does not have full column rank, the results returned by the
|
block_jacobi_preconditioner.cc | 91 // than doing the full rank update. The issue is that for smaller sizes,
|
dogleg_strategy.cc | 599 // was causing the rank deficiency has gone away and we can return 626 switch (basis_qr.rank()) { 631 LOG(ERROR) << "Rank of subspace basis is 0. " 649 LOG(ERROR) << "Rank of the subspace basis matrix is reported to be "
|
levenberg_marquardt_strategy.cc | 99 // the Jacobin is severly rank deficient and mu is too small.
|
trust_region_strategy.h | 75 // that the Gauss-Newton step computation is of full rank.
|
/external/eigen/Eigen/src/Core/ |
SelfAdjointView.h | 124 /** Perform a symmetric rank 2 update of the selfadjoint matrix \c *this: 137 /** Perform a symmetric rank K update of the selfadjoint matrix \c *this:
|
/external/openfst/src/include/fst/ |
random-weight.h | 262 // of rank n of the weights for the generator G. 322 // of rank n of the weights for the generator G.
|
power-weight.h | 35 // the free semimodule of rank n over W
|
sparse-power-weight.h | 75 // the free semimodule of rank n over W
|
/frameworks/base/docs/html/reference/com/google/android/gms/games/leaderboard/ |
LeaderboardScore.html | 789 <div class="jd-descrdiv">Load the formatted display rank into the given <code><a href="/reference/android/database/CharArrayBuffer.html">CharArrayBuffer</a></code>.</div> 807 <div class="jd-descrdiv">Retrieves a formatted string to display for this rank.</div> 861 <div class="jd-descrdiv">Retrieves the rank returned from the server for this score.</div> 1116 <div class="jd-tagdata jd-tagdescr"><p>Load the formatted display rank into the given <code><a href="/reference/android/database/CharArrayBuffer.html">CharArrayBuffer</a></code>.</p></div> 1155 <div class="jd-tagdata jd-tagdescr"><p>Retrieves a formatted string to display for this rank. This handles appropriate localization [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
set_operations.h | 401 const difference_type rank = borders[iam + 1]; local 403 multiseq_partition(sequence, sequence + 2, rank, offset, op.comp);
|
quicksort.h | 44 * @param pivot_rank Desired rank of the pivot.
|
/external/chromium/net/http/ |
http_auth_handler.h | 93 // Numeric rank based on the challenge's security level. Higher
|
/external/libvpx/libvpx/examples/includes/geshi/geshi/ |
dot.php | 57 'pagedir', 'peripheries', 'port_label_distance', 'quantum', 'rank', 'rankdir',
|
oracle11.php | 359 'RANK',
|
oracle8.php | 302 'RANK',
|
/external/marisa-trie/v0_1_5/vs2008/libmarisa_alpha/ |
libmarisa_alpha.vcproj | 258 RelativePath="..\..\lib\marisa_alpha\rank.h"
|
/frameworks/base/docs/html/google/play-services/ |
games.jd | 39 <p>Let players compare scores with friends using leaderboards and see how they rank
|
/packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ |
RankAwarePromoter.java | 116 * rank of the corpus the result is part of.
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/ |
tree_policy.hpp | 145 // Updates the rank of a node through a node_iterator node_it;
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/ |
tree_policy.hpp | 146 // Updates the rank of a node through a node_iterator node_it;
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/ |
tree_policy.hpp | 146 // Updates the rank of a node through a node_iterator node_it;
|
/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;
|