Searched defs:Compute (Results 1 - 7 of 7) sorted by relevance

/external/ceres-solver/internal/ceres/
H A Dcovariance.cc48 bool Covariance::Compute( function in class:ceres::Covariance
51 return impl_->Compute(covariance_blocks, problem->problem_impl_.get());
H A Dcovariance_impl.cc89 bool CovarianceImpl::Compute(const CovarianceBlocks& covariance_blocks, function in class:ceres::internal::CovarianceImpl
104 << "Covariance::GetCovarianceBlock called before Covariance::Compute";
106 << "Covariance::GetCovarianceBlock called when Covariance::Compute "
266 // Compute the number of rows. Map each parameter block to the
279 // Compute the number of non-zeros in the covariance matrix. Along
469 // Compute a Q-less QR factorization of the Jacobian. Since we are
606 // Compute the squared inverse of the singular values. Truncate the
697 // Compute the inverse column permutation used by QR factorization.
/external/chromium_org/third_party/skia/src/core/
H A DSkChecksum.h56 * This should take 2-3x longer than SkChecksum::Compute, but is a considerably better hash.
91 * Compute a 32-bit checksum for a given data block
103 static uint32_t Compute(const uint32_t* data, size_t size) { function in class:SkChecksum
/external/chromium_org/v8/src/heap/
H A Dgc-idle-time-handler.cc111 GCIdleTimeAction GCIdleTimeHandler::Compute(size_t idle_time_in_ms, function in class:v8::internal::GCIdleTimeHandler
/external/skia/include/core/
H A DSkChecksum.h42 * This should take 2-3x longer than SkChecksum::Compute, but is a considerably better hash.
76 * Compute a 32-bit checksum for a given data block
88 static uint32_t Compute(const uint32_t* data, size_t size) { function in class:SkChecksum
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dminimize.h126 Compute(fst);
261 void Compute(const Fst<A>& fst) { function in class:fst::CyclicMinimizer
/external/openfst/src/include/fst/
H A Dminimize.h139 Compute(fst);
274 void Compute(const Fst<A>& fst) { function in class:fst::CyclicMinimizer

Completed in 9462 milliseconds