Searched refs:CHECK_NOTNULL (Results 1 - 25 of 54) sorted by last modified time

123

/external/chromium_org/third_party/libphonenumber/src/phonenumbers/base/
H A Dlogging.h36 template <typename T> T* CHECK_NOTNULL(T* ptr) { function
/external/chromium_org/third_party/cld/base/
H A Dlogging.h567 #define CHECK_NOTNULL(val) \ macro
1070 // Helpers for CHECK_NOTNULL(). Two are necessary to support both raw pointers
/external/ceres-solver/include/ceres/
H A Dcost_function_to_functor.h109 CHECK_NOTNULL(cost_function);
H A Dgradient_checker.h108 CHECK_NOTNULL(probe_point);
109 CHECK_NOTNULL(term);
H A Dloss_function.h379 CHECK_NOTNULL(rho_.get());
/external/ceres-solver/internal/ceres/
H A Dblock_jacobian_writer.cc207 CHECK_NOTNULL(jacobian);
H A Dblock_sparse_matrix.cc54 CHECK_NOTNULL(block_structure_.get());
81 CHECK_NOTNULL(values_.get());
89 CHECK_NOTNULL(x);
90 CHECK_NOTNULL(y);
109 CHECK_NOTNULL(x);
110 CHECK_NOTNULL(y);
129 CHECK_NOTNULL(x);
146 CHECK_NOTNULL(scale);
163 CHECK_NOTNULL(dense_matrix);
186 CHECK_NOTNULL(matri
[all...]
H A Dblock_sparse_matrix_test.cc50 CHECK_NOTNULL(problem.get());
54 CHECK_NOTNULL(problem.get());
H A Dcanonical_views_clustering.cc105 CHECK_NOTNULL(centers)->clear();
106 CHECK_NOTNULL(membership)->clear();
217 CHECK_NOTNULL(membership)->clear();
H A Dcompressed_col_sparse_matrix_utils.cc47 CHECK_NOTNULL(block_rows)->clear();
48 CHECK_NOTNULL(block_cols)->clear();
H A Dcompressed_row_sparse_matrix.cc136 CHECK_NOTNULL(diagonal);
163 CHECK_NOTNULL(x);
164 CHECK_NOTNULL(y);
174 CHECK_NOTNULL(x);
175 CHECK_NOTNULL(y);
185 CHECK_NOTNULL(x);
194 CHECK_NOTNULL(scale);
202 CHECK_NOTNULL(dense_matrix);
264 CHECK_NOTNULL(file);
441 CHECK_NOTNULL(progra
[all...]
H A Dcompressed_row_sparse_matrix_test.cc75 CHECK_NOTNULL(problem.get());
H A Dconjugate_gradients_solver.cc71 CHECK_NOTNULL(A);
72 CHECK_NOTNULL(x);
73 CHECK_NOTNULL(b);
H A Dcoordinate_descent_minimizer.cc215 CHECK_NOTNULL(evaluator.get());
218 CHECK_NOTNULL(jacobian.get());
224 CHECK_NOTNULL(TrustRegionStrategy::Create(trs_options)));
H A Dcovariance_impl.cc491 CHECK_NOTNULL(permutation);
492 CHECK_NOTNULL(R);
H A Ddense_sparse_matrix.cc169 CHECK_NOTNULL(file);
H A Ddense_sparse_matrix_test.cc75 CHECK_NOTNULL(problem.get());
H A Ddogleg_strategy.cc67 CHECK_NOTNULL(linear_solver_);
82 CHECK_NOTNULL(jacobian);
83 CHECK_NOTNULL(residuals);
84 CHECK_NOTNULL(step);
471 CHECK_NOTNULL(minimum);
H A Dgradient_checking_cost_function_test.cc331 CHECK_NOTNULL(left);
332 CHECK_NOTNULL(right);
H A Dgraph_algorithms.h101 CHECK_NOTNULL(ordering);
174 CHECK_NOTNULL(ordering);
H A Dimplicit_schur_complement_test.cc61 CHECK_NOTNULL(problem.get());
91 CHECK_NOTNULL(eliminator.get());
H A Diterative_schur_complement_solver.cc72 CHECK_NOTNULL(A->block_structure());
H A Diterative_schur_complement_solver_test.cc65 CHECK_NOTNULL(problem.get());
H A Dlevenberg_marquardt_strategy.cc56 CHECK_NOTNULL(linear_solver_);
70 CHECK_NOTNULL(jacobian);
71 CHECK_NOTNULL(residuals);
72 CHECK_NOTNULL(step);
H A Dlevenberg_marquardt_strategy_test.cc69 CHECK_NOTNULL(per_solve_options.D);

Completed in 241 milliseconds

123