HomeSort by relevance Sort by last modified time
    Searched defs:Evaluate (Results 1 - 25 of 47) sorted by null

1 2

  /external/ceres-solver/internal/ceres/
normal_prior.cc 51 bool NormalPrior::Evaluate(double const* const* parameters,
numeric_diff_cost_function_test.cc 155 virtual bool Evaluate(double const* const* parameters,
numeric_diff_test_utils.h 54 virtual bool Evaluate(double const* const* parameters,
79 virtual bool Evaluate(double const* const* parameters,
conditioned_cost_function.cc 77 bool ConditionedCostFunction::Evaluate(double const* const* parameters,
80 bool success = wrapped_cost_function_->Evaluate(parameters, residuals,
105 success = conditioners_[r]->Evaluate(&parameter_pointer,
evaluator.h 93 static bool Evaluate(Program* program,
119 // Options struct to control Evaluator::Evaluate;
130 // Evaluate the cost function for the given state. Returns the cost,
139 virtual bool Evaluate(const EvaluateOptions& evaluate_options,
146 // Variant of Evaluator::Evaluate where the user wishes to use the
149 bool Evaluate(const double* state,
154 return Evaluate(EvaluateOptions(),
gradient_checker_test.cc 72 bool Evaluate(double const* const* parameters,
125 bool Evaluate(double const* const* parameters,
loss_function.cc 40 void TrivialLoss::Evaluate(double s, double rho[3]) const {
46 void HuberLoss::Evaluate(double s, double rho[3]) const {
62 void SoftLOneLoss::Evaluate(double s, double rho[3]) const {
71 void CauchyLoss::Evaluate(double s, double rho[3]) const {
80 void ArctanLoss::Evaluate(double s, double rho[3]) const {
97 void TolerantLoss::Evaluate(double s, double rho[3]) const {
133 void ComposedLoss::Evaluate(double s, double rho[3]) const {
135 g_->Evaluate(s, rho_g);
136 f_->Evaluate(rho_g[0], rho_f);
144 void ScaledLoss::Evaluate(double s, double rho[3]) const
    [all...]
residual_block.cc 67 bool ResidualBlock::Evaluate(const bool apply_loss_function,
104 // the CostFunction::Evaluate call, to see if all the return values
110 if (!cost_function_->Evaluate(parameters.get(), residuals, eval_jacobians)) {
122 "There are two possible reasons. Either the CostFunction did not evaluate and fill all \n" // NOLINT
164 loss_function_->Evaluate(squared_norm, rho);
conditioned_cost_function_test.cc 54 virtual bool Evaluate(double const* const* parameters,
108 conditioned_cost_function.Evaluate(parameters, result, jacs);
parameter_block_ordering_test.cc 53 virtual bool Evaluate(double const* const* parameters,
problem.cc 181 bool Problem::Evaluate(const EvaluateOptions& evaluate_options,
186 return problem_impl_->Evaluate(evaluate_options,
residual_block_test.cc 55 virtual bool Evaluate(double const* const* parameters,
108 residual_block.Evaluate(true, &cost, NULL, NULL, scratch);
113 residual_block.Evaluate(true, &cost, residuals, NULL, scratch);
137 residual_block.Evaluate(true, &cost, residuals, jacobian_ptrs, scratch);
156 residual_block.Evaluate(true, &cost, residuals, jacobian_ptrs, scratch);
170 virtual bool Evaluate(double const* const* parameters,
247 residual_block.Evaluate(true, &cost, NULL, NULL, scratch);
252 residual_block.Evaluate(true, &cost, residuals, NULL, scratch);
276 residual_block.Evaluate(true, &cost, residuals, jacobian_ptrs, scratch);
314 residual_block.Evaluate(true, &cost, residuals, jacobian_ptrs, scratch)
    [all...]
schur_ordering_test.cc 53 virtual bool Evaluate(double const* const* parameters,
c_api.cc 83 virtual bool Evaluate(double const* const* parameters,
104 virtual void Evaluate(double sq_norm, double* rho) const {
138 ->Evaluate(squared_norm, out);
line_search_minimizer.cc 72 bool Evaluate(Evaluator* evaluator,
75 const bool status = evaluator->Evaluate(x.data(),
123 if (!Evaluate(evaluator, x, &current_state)) {
314 !Evaluate(evaluator, x_plus_delta, &current_state)) {
residual_block_utils_test.cc 44 // Routine to check if ResidualBlock::Evaluate for unary CostFunction
65 EXPECT_EQ(residual_block.Evaluate(true,
76 virtual bool Evaluate(double const* const* parameters,
88 // which user code can cause ResidualBlock::Evaluate to fail.
91 virtual bool Evaluate(double const* const* parameters,
105 virtual bool Evaluate(double const* const* parameters,
119 virtual bool Evaluate(double const* const* parameters,
132 virtual bool Evaluate(double const* const* parameters,
  /external/ceres-solver/include/ceres/
autodiff_cost_function.h 197 virtual bool Evaluate(double const* const* parameters,
numeric_diff_cost_function.h 127 // subclass of CostFunction such that the Evaluate() function ignores
130 // the Evaluate() function with small changes to the appropriate
198 virtual bool Evaluate(double const* const* parameters,
209 // Get the function value (residuals) at the the point to evaluate.
dynamic_autodiff_cost_function.h 93 virtual bool Evaluate(double const* const* parameters,
98 << "before DynamicAutoDiffCostFunction::Evaluate().";
113 // To work around this issue, the solution here is to evaluate the
171 // Evaluate all of the strides. Each stride is a chunk of the derivative to
172 // evaluate, typically some size proportional to the size of the SIMD
  /external/chromium_org/tools/telemetry/telemetry/core/chrome/
inspector_runtime.py 23 If the expression failed to evaluate, EvaluateException will be raised.
25 self.Evaluate(expr + '; 0;', timeout)
27 def Evaluate(self, expr, timeout=60):
40 'method': 'Runtime.evaluate',
  /external/ceres-solver/examples/
quadratic.cc 50 virtual bool Evaluate(double const* const* parameters,
helloworld_analytic_diff.cc 53 virtual bool Evaluate(double const* const* parameters,
65 // Since the Evaluate function can be called with the jacobians
66 // pointer equal to NULL, the Evaluate function must check to see
fields_of_experts.cc 54 bool FieldsOfExpertsCost::Evaluate(double const* const* parameters,
78 void FieldsOfExpertsLoss::Evaluate(double sq_norm, double rho[3]) const {
denoising.cc 74 virtual bool Evaluate(double const* const* parameters,
  /external/chromium_org/sandbox/win/src/
policy_engine_processor.cc 35 PolicyResult PolicyProcessor::Evaluate(uint32 options,
72 EvalResult result = opcode.Evaluate(parameters, param_count, &context);

Completed in 285 milliseconds

1 2