HomeSort by relevance Sort by last modified time
    Searched full:scratch_count (Results 1 - 1 of 1) sorted by null

  /external/ceres-solver/internal/ceres/
incomplete_lq_factorization.cc 133 int scratch_count = 0; local
136 pair<int, double>& entry = (*scratch)[scratch_count];
139 ++scratch_count;
143 if (scratch_count > level_of_fill) {
146 scratch->begin() + scratch_count,
148 scratch_count = level_of_fill;
149 sort(scratch->begin(), scratch->begin() + scratch_count);
152 for (int i = 0; i < scratch_count; ++i) {

Completed in 53 milliseconds