| /external/ceres-solver/internal/ceres/ |
| H A D | covariance_impl.cc | 482 const SuiteSparse_long rank = local
494 if (rank < cholmod_jacobian.ncol) {
495 LOG(ERROR) << "Jacobian matrix is rank deficient. "
497 << " rank: " << rank;
686 if (qr_solver.rank() < jacobian.num_cols) {
687 LOG(ERROR) << "Jacobian matrix is rank deficient. "
689 << " rank: " << qr_solver.rank();
|
| /external/chromium_org/chrome/browser/history/ |
| H A D | history_backend.cc | 2703 int rank = kPageVisitStatsMaxTopSites; local
2706 rank = (*it).second;
2708 rank, kPageVisitStatsMaxTopSites + 1);
|
| H A D | top_sites_database.cc | 26 // with the highest rank will be the next one evicted. Forced
27 // thumbnails have a rank of -1.
491 int rank = GetURLRank(url); local
492 if (rank == kRankOfNonExistingURL) {
554 << "Thumbnail without a forced time stamp has a forced rank, or the "
560 // Update rank if this is not a forced thumbnail.
569 << "Thumbnail without a forced time stamp has a forced rank, or the "
582 << "Thumbnail without a forced time stamp has a forced rank, or the "
587 LOG(WARNING) << "Updating rank of an unknown URL: " << url.url.spec();
644 // Set the url's rank an
[all...] |
| H A D | top_sites_impl.cc | 407 int rank = -1; // Forced URLs have a rank of -1. local
409 // Increase the rank if we're going through forced URLs. This works because
412 rank++;
413 DCHECK(new_list[i].last_forced_time.is_null() == (rank != -1))
419 added.rank = rank;
426 if (old_rank != rank ||
431 moved.rank = rank;
[all...] |
| /external/chromium_org/components/history/core/browser/ |
| H A D | history_types.h | 422 int rank; member in struct:history::MostVisitedURLWithRank
|
| /external/chromium_org/components/precache/core/ |
| H A D | precache_fetcher.cc | 207 int64 rank = 0; local
209 it != starting_urls_.end() && rank < config.top_sites_count();
210 ++it, ++rank) {
|
| /external/chromium_org/extensions/common/ |
| H A D | manifest.cc | 28 // with the higher rank, as returned by this function. The actual
32 int rank = kInvalidRank; // Will CHECK that rank is not kInvalidRank. local
37 rank = 9;
41 rank = 8;
47 rank = 7;
51 rank = 6;
58 rank = 5;
62 rank = 4;
68 rank
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/ |
| H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/javascript/ com/google/javascript/jscomp/ ... |
| /external/chromium_org/third_party/checkstyle/ |
| H A D | checkstyle-5.7-all.jar | META-INF/MANIFEST.MF META-INF/ checkstyle_packages.xml checkstylecompilation.properties checkstyletask.properties com/ ... |
| /external/chromium_org/third_party/closure_compiler/compiler/ |
| H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/debugging/ com/google/debugging/sourcemap/ ... |
| /external/chromium_org/third_party/cython/src/Cython/Compiler/ |
| H A D | PyrexTypes.py | 1336 # rank integer Relative size
1347 def __init__(self, rank, signed = 1):
1348 self.rank = rank
1353 n = rank_to_type_name[self.rank]
1386 """Sort based on rank, preferring signed over unsigned"""
1388 return self.rank > other.rank and self.signed >= other.signed
1394 if self.rank <= 4:
1434 if self.rank < lis
3259 rank = -1 # Ranks below any integer type variable in class:CEnumType
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/ |
| H A D | lp_fence.c | 38 * The rank will be the number of bins in the scene. Whenever a rendering
40 * the counter == the rank, the fence is finished.
42 * \param rank the expected finished value of the fence counter.
45 lp_fence_create(unsigned rank) argument
59 fence->rank = rank;
83 * When the counter == the rank, the fence is finished.
94 assert(fence->count <= fence->rank);
97 debug_printf("%s count=%u rank=%u\n", __FUNCTION__,
98 fence->count, fence->rank);
[all...] |
| H A D | lp_fence.h | 50 unsigned rank; member in struct:lp_fence
56 lp_fence_create(unsigned rank);
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/ |
| H A D | bitvect.c | 1768 wordptr rank; member in struct:BitVector_from_Dec_static_data
1783 data->rank = BitVector_Create(bits,FALSE);
1789 data->rank = NULL;
1801 BitVector_Destroy(data->rank);
1820 wordptr rank; local
1833 rank = data->rank;
1849 BitVector_Empty(rank);
1875 BitVector_Copy(temp,rank);
1896 BitVector_Copy(temp,rank);
1931 wordptr rank; local
[all...] |
| /external/chromium_org/third_party/zlib/ |
| H A D | 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);
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| H A D | org.apache.jasper_5.5.17.v201004212143.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| H A D | org.eclipse.equinox.p2.artifact.repository_1.1.1.R36x_v20100901.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| H A D | org.eclipse.help_3.5.0.v20100524.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| H A D | org.eclipse.jdt.core_3.6.2.v_A76_R36x.jar | ... .String, int) String genericTypeKey
char boundKind
String boundTypeKey
int rank
String wildCardKey
String wildCardKey
String wildCardKey
String wildCardKey
public java ... |
| H A D | org.eclipse.osgi_3.6.1.R36x_v20100806.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| H A D | org.eclipse.osgi_3.6.2.R36x_v20101103.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| H A D | org.eclipse.ui.ide_3.6.2.M20101117-0800.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| H A D | org.eclipse.ui.workbench_3.6.1.M20101117-0800.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
| /external/eigen/Eigen/src/Geometry/ |
| H A D | Umeyama.h | 143 Index rank = 0; for (Index i=0; i<m; ++i) if (!internal::isMuchSmallerThan(d.coeff(i),d.coeff(0))) ++rank; local
144 if (rank == m-1) {
|
| /external/eigen/Eigen/src/LU/ |
| H A D | FullPivLU.h | 25 * upper-triangular, and P and Q are permutation matrices. This is a rank-revealing LU
30 * the rank, invertibility, inverse, kernel, and determinant.
115 * \sa rank()
238 /** Allows to prescribe a threshold to be used by certain methods, such as rank(),
276 /** Returns the threshold that will be used by certain methods such as rank().
289 /** \returns the rank of the matrix of which *this is the LU decomposition.
295 inline Index rank() const function in class:Eigen::FullPivLU
315 return cols() - rank();
328 return rank() == cols();
341 return rank()
[all...] |