Searched defs:program (Results 1 - 25 of 378) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/
H A DSimpleCParser.java70 // $ANTLR start "program"
71 // SimpleC.g:16:1: program : ( declaration )+ ;
72 public final SimpleCParser.program_return program() throws RecognitionException { method in class:SimpleCParser
142 // $ANTLR end "program"
H A DSimpleCTP.java55 // $ANTLR start "program"
56 // SimpleCTP.g:8:1: program : ( declaration )+ ;
57 public final void program() throws RecognitionException { method in class:SimpleCTP
108 // $ANTLR end "program"
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/
H A DSimpleCParser.java70 // $ANTLR start "program"
71 // /usr/local/ANTLR3-ObjC2.0-Runtime/Framework/examples/simplecTreeParser/SimpleC.g:16:1: program : ( declaration )+ ;
72 public final SimpleCParser.program_return program() throws RecognitionException { method in class:SimpleCParser
142 // $ANTLR end "program"
H A DSimpleCTP.java55 // $ANTLR start "program"
56 // /usr/local/ANTLR3-ObjC2.0-Runtime/Framework/examples/simplecTreeParser/SimpleCTP.g:8:1: program : ( declaration )+ ;
57 public final void program() throws RecognitionException { method in class:SimpleCTP
108 // $ANTLR end "program"
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/streams/
H A Drewrite.rb59 a rewrite program list.
378 program = @programs[ program_name ]
380 yield( program )
381 program.execute( range )
382 else program
386 def program( name = 'default' ) method
/external/bison/djgpp/
H A Dsubpipe.c5 This program is free software: you can redistribute it and/or modify
10 This program is distributed in the hope that it will be useful,
16 along with this program. If not, see <http://www.gnu.org/licenses/>. */
180 char *program; local
187 program = strrchr(arguments[0], '/');
188 if (program)
189 program++;
191 program = arguments[0];
228 status = spawnvp(P_WAIT, program, arguments);
234 error(EXIT_FAILURE, 0, _("subsidiary program '
277 reap_subpipe(pid_t pid, char const *program) argument
[all...]
/external/ceres-solver/internal/ceres/
H A Dblock_jacobian_writer.cc36 #include "ceres/program.h"
47 // per-parameter jacobian goes where in the overall program jacobian.
56 void BuildJacobianLayout(const Program& program, argument
60 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks();
90 jacobian_layout->resize(program.NumResidualBlocks());
124 Program* program)
125 : program_(program) {
129 BuildJacobianLayout(*program,
123 BlockJacobianWriter(const Evaluator::Options& options, Program* program) argument
H A Dcallbacks.cc33 #include "ceres/program.h"
40 StateUpdatingCallback::StateUpdatingCallback(Program* program, argument
42 : program_(program), parameters_(parameters) {}
H A Dcompressed_row_jacobian_writer.cc36 #include "ceres/program.h"
44 const Program* program, CompressedRowSparseMatrix* jacobian) {
46 program->parameter_blocks();
54 program->residual_blocks();
63 const Program* program,
67 program->residual_blocks()[residual_id];
43 PopulateJacobianRowAndColumnBlockVectors( const Program* program, CompressedRowSparseMatrix* jacobian) argument
62 GetOrderedParameterBlocks( const Program* program, int residual_id, vector<pair<int, int> >* evaluated_jacobian_blocks) argument
H A Dcompressed_row_jacobian_writer.h49 Program* program)
50 : program_(program) {
56 // program. This is useful when Solver::Options::use_block_amd =
64 const Program* program,
81 const Program* program,
48 CompressedRowJacobianWriter(Evaluator::Options , Program* program) argument
H A Dcompressed_row_sparse_matrix.cc420 vector<int>* program) {
441 CHECK_NOTNULL(program)->clear();
442 program->resize(product.size());
454 (*program)[product[0].index] = nnz;
467 (*program)[current.index] = nnz;
482 vector<int>* program) {
483 CHECK_NOTNULL(program)->clear();
505 return CompressAndFillProgram(m.num_cols(), m.num_cols(), product, program);
510 const vector<int>& program,
525 // Reuse the program segmen
417 CompressAndFillProgram(const int num_rows, const int num_cols, const vector<ProductTerm>& product, vector<int>* program) argument
480 CreateOuterProductMatrixAndProgram( const CompressedRowSparseMatrix& m, vector<int>* program) argument
508 ComputeOuterProduct( const CompressedRowSparseMatrix& m, const vector<int>& program, CompressedRowSparseMatrix* result) argument
[all...]
H A Dcompressed_row_sparse_matrix_test.cc536 vector<int> program; local
539 *matrix, &program));
541 program,
H A Dcoordinate_descent_minimizer.cc46 #include "ceres/program.h"
60 const Program& program,
89 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks();
100 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks();
203 void CoordinateDescentMinimizer::Solve(Program* program, argument
214 Evaluator::Create(evaluator_options_, program, &error));
237 const Program& program,
246 if (!program.IsParameterBlockSetIndependent(it->second)) {
262 const Program& program) {
264 ComputeRecursiveIndependentSetOrdering(program, orderin
59 Init( const Program& program, const ProblemImpl::ParameterMap& parameter_map, const ParameterBlockOrdering& ordering, string* error) argument
236 IsOrderingValid( const Program& program, const ParameterBlockOrdering& ordering, string* message) argument
261 CreateOrdering( const Program& program) argument
[all...]
H A Ddense_jacobian_writer.h39 #include "ceres/program.h"
50 Program* program)
51 : program_(program) {
49 DenseJacobianWriter(Evaluator::Options , Program* program) argument
H A Ddynamic_compressed_row_jacobian_writer.h49 Program* program)
50 : program_(program) {
48 DynamicCompressedRowJacobianWriter(Evaluator::Options , Program* program) argument
H A Devaluator.cc52 Program* program,
59 program);
66 program);
72 options, program);
76 program);
51 Create(const Evaluator::Options& options, Program* program, string* error) argument
H A Devaluator_test.cc44 #include "ceres/program.h"
110 Evaluator* CreateEvaluator(Program* program) { argument
111 // This program is straight from the ProblemImpl, and so has no index/offset
113 program->SetParameterOffsetsAndIndex();
132 return Evaluator::Create(options, program, &error);
242 // Add the parameters in explicit order to force the ordering in the program.
327 // Add the parameters in explicit order to force the ordering in the program.
382 // Add the parameters in explicit order to force the ordering in the program.
450 // Add the parameters in explicit order to force the ordering in the program.
473 // Create the reduced program whic
598 Program* program = problem.mutable_program(); local
[all...]
H A Dgradient_checking_cost_function.cc45 #include "ceres/program.h"
258 Program* program = problem_impl->mutable_program(); local
262 const vector<ParameterBlock*>& parameter_blocks = program->parameter_blocks();
279 const vector<ResidualBlock*>& residual_blocks = program->residual_blocks();
H A Dgradient_checking_cost_function_test.cc41 #include "ceres/program.h"
378 const Program& program = problem_impl.program(); local
380 gradient_checking_problem_impl->program();
388 for (int i = 0; i < program.parameter_blocks().size(); ++i) {
390 program.parameter_blocks()[i],
394 for (int i = 0; i < program.residual_blocks().size(); ++i) {
397 program.residual_blocks()[i];
H A Dparameter_block_ordering.cc38 #include "ceres/program.h"
45 int ComputeStableSchurOrdering(const Program& program, argument
49 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program));
50 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks();
71 int ComputeSchurOrdering(const Program& program, argument
75 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program));
77 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks();
90 void ComputeRecursiveIndependentSetOrdering(const Program& program, argument
93 const vector<ParameterBlock*> parameter_blocks = program.parameter_blocks();
94 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program));
113 CreateHessianGraph(const Program& program) argument
[all...]
H A Dparameter_block_ordering_test.cc39 #include "ceres/program.h"
84 const Program& program = problem_.program(); local
85 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks();
86 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program));
130 const Program& program = problem_.program(); local
131 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program));
138 const Program& program = problem_.program(); local
[all...]
H A Dproblem_impl.cc49 #include "ceres/program.h"
139 // sync with the position of the parameter in the program's parameter vector.
613 // take the residual blocks from the underlying program.
614 Program program; local
615 *program.mutable_residual_blocks() =
624 *program.mutable_parameter_blocks();
629 // the underlying program object.
654 program.parameter_blocks());
677 program.SetParameterOffsetsAndIndex();
691 Evaluator::Create(evaluator_options, &program,
[all...]
H A Dproblem_impl.h164 const Program& program() const { return *program_; } function in class:ceres::internal::ProblemImpl
178 bool InternalEvaluate(Program* program,
H A Dprogram.cc31 #include "ceres/program.h"
55 Program::Program(const Program& program) argument
56 : parameter_blocks_(program.parameter_blocks_),
57 residual_blocks_(program.residual_blocks_) {
133 // For parameters that appear in the program, set their position and offset.
H A Dprogram_evaluator.h96 #include "ceres/program.h"
112 ProgramEvaluator(const Evaluator::Options &options, Program* program) argument
114 program_(program),
115 jacobian_writer_(options, program),
124 BuildResidualLayout(*program, &residual_layout_);
125 evaluate_scratch_.reset(CreateEvaluatorScratch(*program,
334 static void BuildResidualLayout(const Program& program, argument
336 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks();
337 residual_layout->resize(program.NumResidualBlocks());
346 // Create scratch space for each thread evaluating the program
347 CreateEvaluatorScratch(const Program& program, int num_threads) argument
[all...]

Completed in 4406 milliseconds

1234567891011>>