Searched defs:rhs (Results 1 - 25 of 642) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ...
/external/bison/src/
H A Dgram.h58 RULES[R].rhs -- the index in RITEM of the beginning of the portion
184 item_number *rhs; member in struct:__anon375
H A Doutput.c213 | Prepare the muscles related to the rules: rhs, prhs, r1, r2, |
222 item_number *rhs = xnmalloc (nritems, sizeof *rhs); local
236 for (rhsp = rules[r].rhs; *rhsp >= 0; ++rhsp)
237 rhs[i++] = *rhsp;
243 rhs[i++] = -1;
253 muscle_insert_item_number_table ("rhs", rhs, ritem[0], 1, nritems);
264 free (rhs);
H A Dparse-gram.c737 "rules_or_grammar_declaration", "rules", "$@3", "rhses.1", "rhs",
3156 lloc_default (YYLTYPE const *rhs, int n) argument
3161 /* SGI MIPSpro 7.4.1m miscompiles "loc.start = loc.end = rhs[n].end;".
3163 loc.start = rhs[n].end;
3164 loc.end = rhs[n].end;
3170 if (! equal_boundaries (rhs[i].start, rhs[i].end))
3172 loc.start = rhs[i].start;
H A Dparse-gram.y568 rhs { grammar_current_rule_end (@1); }
569 | rhses.1 "|" rhs { grammar_current_rule_end (@3); }
573 rhs: label
577 | rhs symbol named_ref.opt
579 | rhs "{...}" named_ref.opt
581 | rhs "%prec" symbol
583 | rhs "%dprec" INT
585 | rhs "%merge" TYPE
691 lloc_default (YYLTYPE const *rhs, int n)
696 /* SGI MIPSpro 7.4.1m miscompiles "loc.start = loc.end = rhs[
[all...]
/external/ceres-solver/internal/ceres/
H A Dblock_structure.cc36 bool CellLessThan(const Cell& lhs, const Cell& rhs) { argument
37 if (lhs.block_id == rhs.block_id) {
38 return (lhs.position < rhs.position);
40 return (lhs.block_id < rhs.block_id);
H A Ddense_normal_cholesky_solver.cc87 // rhs = A'b
88 Vector rhs = Aref.transpose() * ConstVectorRef(b, num_rows); local
110 VectorRef(x, num_cols) = llt.solve(rhs);
150 // rhs = A'b
H A Dimplicit_schur_complement.h132 const Vector& rhs() const { return rhs_; } function in class:ceres::internal::ImplicitSchurComplement
H A Dimplicit_schur_complement_test.cc73 Vector* rhs,
95 rhs->resize(num_schur_rows);
97 eliminator->Eliminate(A_.get(), b_.get(), D, &blhs, rhs->data());
112 schur_solution = lhs->selfadjointView<Eigen::Upper>().llt().solve(*rhs);
119 Vector rhs; local
121 ReducedLinearSystemAndSolution(D, &lhs, &rhs, &reference_solution);
152 // Compare the rhs of the reduced linear system
153 if ((isc.rhs() - rhs).norm() > kEpsilon) {
156 << "rhs
71 ReducedLinearSystemAndSolution(double* D, Matrix* lhs, Vector* rhs, Vector* solution) argument
[all...]
H A Dpolynomial.cc347 Vector rhs = Vector::Zero(num_constraints); local
356 rhs(row) = sample.value;
364 rhs(row) = sample.gradient;
369 return lhs.fullPivLu().solve(rhs);
H A Dschur_complement_solver.h130 const double* rhs() const { return rhs_.get(); } function in class:ceres::internal::SchurComplementSolver
131 void set_rhs(double* rhs) { rhs_.reset(rhs); } argument
H A Dschur_eliminator_impl.h177 double* rhs) {
180 VectorRef(rhs, lhs->num_rows()).setZero();
216 // gaussian elimination to the rhs of the normal equations,
217 // updating the rhs of the reduced linear system by modifying rhs
277 // For the current chunk compute and update the rhs of the reduced
280 // rhs = F'b - F'E(E'E)^(-1) E'b
290 UpdateRhs(chunk, A, b, chunk.start, inverse_ete_g.get(), rhs);
298 NoEBlockRowsUpdate(A, b, uneliminated_row_begins_, lhs, rhs);
368 // Update the rhs o
173 Eliminate(const BlockSparseMatrix* A, const double* b, const double* D, BlockRandomAccessMatrix* lhs, double* rhs) argument
374 UpdateRhs(const Chunk& chunk, const BlockSparseMatrix* A, const double* b, int row_block_counter, const double* inverse_ete_g, double* rhs) argument
556 NoEBlockRowsUpdate(const BlockSparseMatrix* A, const double* b, int row_block_counter, BlockRandomAccessMatrix* lhs, double* rhs) argument
[all...]
H A Dschur_jacobi_preconditioner.cc89 // We need a dummy rhs vector and a dummy b vector since the Schur
95 // SchurEliminator::Eliminate function to allow NULL for the rhs. As
97 Vector rhs = Vector::Zero(m_->num_rows()); local
101 eliminator_->Eliminate(&A, b.data(), D, m_.get(), rhs.data());
H A Dtriplet_sparse_matrix.cc86 const TripletSparseMatrix& rhs) {
87 num_rows_ = rhs.num_rows_;
88 num_cols_ = rhs.num_cols_;
89 num_nonzeros_ = rhs.num_nonzeros_;
90 max_num_nonzeros_ = rhs.max_num_nonzeros_;
92 CopyData(rhs);
85 operator =( const TripletSparseMatrix& rhs) argument
H A Dvisibility_based_preconditioner.cc348 // We need a dummy rhs vector and a dummy b vector since the Schur
354 // SchurEliminator::Eliminate function to allow NULL for the rhs. As
356 Vector rhs = Vector::Zero(m_->num_rows()); local
360 eliminator_->Eliminate(&A, b.data(), D, m_.get(), rhs.data());
/external/chromium_org/ash/accelerators/
H A Daccelerator_table_unittest.cc17 const AcceleratorData& rhs) {
18 if (lhs.trigger_on_press != rhs.trigger_on_press)
19 return lhs.trigger_on_press < rhs.trigger_on_press;
20 if (lhs.keycode != rhs.keycode)
21 return lhs.keycode < rhs.keycode;
22 return lhs.modifiers < rhs.modifiers;
16 operator ()(const AcceleratorData& lhs, const AcceleratorData& rhs) argument
/external/chromium_org/ash/keyboard_overlay/
H A Dkeyboard_overlay_view_unittest.cc22 const KeyboardOverlayView::KeyEventData& rhs) {
23 return (lhs.key_code == rhs.key_code) && (lhs.flags == rhs.flags);
21 operator ==(const KeyboardOverlayView::KeyEventData& lhs, const KeyboardOverlayView::KeyEventData& rhs) argument
/external/chromium_org/base/android/
H A Djni_weak_ref.cc31 void JavaObjectWeakGlobalRef::operator=(const JavaObjectWeakGlobalRef& rhs) { argument
32 Assign(rhs);
/external/chromium_org/base/
H A Dbind_unittest.cc115 const CopyCounter& operator=(const CopyCounter& rhs) { argument
116 copies_ = rhs.copies_;
117 assigns_ = rhs.assigns_;
/external/chromium_org/base/containers/
H A Dstack_container.h75 StackAllocator(const StackAllocator<T, stack_capacity>& rhs) argument
76 : std::allocator<T>(), source_(rhs.source_) {
/external/chromium_org/base/debug/
H A Dtrace_event_impl.cc2399 CategoryFilter& CategoryFilter::operator=(const CategoryFilter& rhs) { argument
2400 if (this == &rhs)
2403 included_ = rhs.included_;
2404 disabled_ = rhs.disabled_;
2405 excluded_ = rhs.excluded_;
2406 delays_ = rhs.delays_;
H A Dtrace_event_unittest.cc195 const std::string& rhs,
199 return lhs == rhs;
201 return lhs != rhs;
194 CompareJsonValues(const std::string& lhs, const std::string& rhs, CompareOp op) argument
/external/chromium_org/base/i18n/
H A Dstring_compare.cc17 const string16& rhs) {
22 static_cast<const UChar*>(rhs.c_str()), static_cast<int>(rhs.length()),
15 CompareString16WithCollator(const icu::Collator* collator, const string16& lhs, const string16& rhs) argument
/external/chromium_org/base/memory/
H A Dref_counted.h348 bool operator==(const scoped_refptr<U>& rhs) const {
349 return ptr_ == rhs.get();
353 bool operator!=(const scoped_refptr<U>& rhs) const {
354 return !operator==(rhs);
358 bool operator<(const scoped_refptr<U>& rhs) const {
359 return ptr_ < rhs.get();
377 bool operator==(const scoped_refptr<T>& lhs, const U* rhs) { argument
378 return lhs.get() == rhs;
382 bool operator==(const T* lhs, const scoped_refptr<U>& rhs) { argument
383 return lhs == rhs
387 operator !=(const scoped_refptr<T>& lhs, const U* rhs) argument
392 operator !=(const T* lhs, const scoped_refptr<U>& rhs) argument
[all...]

Completed in 484 milliseconds

1234567891011>>