| /external/clang/test/CodeGen/ |
| conditional-gnu-ext.c | 33 _Complex int rhs; local
35 return getComplex(1+2i) ? : rhs;
|
| /external/ceres-solver/internal/ceres/ |
| dense_normal_cholesky_solver.cc | 87 // rhs = A'b
88 Vector rhs = Aref.transpose() * ConstVectorRef(b, num_rows); local
100 lhs.selfadjointView<Eigen::Upper>().llt().solve(rhs);
140 // rhs = A'b
|
| schur_jacobi_preconditioner.cc | 99 // We need a dummy rhs vector and a dummy b vector since the Schur
105 // SchurEliminator::Eliminate function to allow NULL for the rhs. As
107 Vector rhs = Vector::Zero(m_->num_rows()); local
111 eliminator_->Eliminate(&A, b.data(), D, m_.get(), rhs.data());
|
| sparse_normal_cholesky_solver.cc | 198 cholmod_dense* rhs = ss_.CreateDenseVector(Atb.data(), num_cols, num_cols); local
215 cholmod_dense* sol = ss_.SolveCholesky(&lhs, factor_, rhs);
218 ss_.Free(rhs);
219 rhs = NULL;
|
| implicit_schur_complement.h | 131 const Vector& rhs() const { return rhs_; } function in class:ceres::internal::ImplicitSchurComplement
|
| implicit_schur_complement_test.cc | 73 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);
149 // Compare the rhs of the reduced linear system
150 if ((isc.rhs() - rhs).norm() > kEpsilon) {
153 << "rhs. explicit: " << rhs.transpose(
[all...] |
| schur_complement_solver.h | 124 const double* rhs() const { return rhs_.get(); } function in class:ceres::internal::SchurComplementSolver
125 void set_rhs(double* rhs) { rhs_.reset(rhs); }
|
| polynomial.cc | 272 Vector rhs = Vector::Zero(num_constraints); local
281 rhs(row) = sample.value;
289 rhs(row) = sample.gradient;
294 return lhs.fullPivLu().solve(rhs);
|
| /external/chromium/base/ |
| version_unittest.cc | 55 const char* rhs; member in struct:version_compare
71 scoped_ptr<Version> rhs(Version::GetVersionFromString(cases[i].rhs));
72 EXPECT_EQ(lhs->CompareTo(*rhs), cases[i].expected) <<
73 cases[i].lhs << " ? " << cases[i].rhs;
|
| /external/chromium_org/base/ |
| version_unittest.cc | 67 const char* rhs; member in struct:__anon6412::version_compare
83 Version rhs(cases[i].rhs);
84 EXPECT_EQ(lhs.CompareTo(rhs), cases[i].expected) <<
85 cases[i].lhs << " ? " << cases[i].rhs;
87 EXPECT_EQ(lhs.IsOlderThan(cases[i].rhs), (cases[i].expected == -1));
94 const char* rhs; member in struct:__anon6412::version_compare
113 const int result = version.CompareToWildcardString(cases[i].rhs);
114 EXPECT_EQ(result, cases[i].expected) << cases[i].lhs << "?" << cases[i].rhs;
|
| /external/chromium_org/third_party/mesa/src/src/glsl/ |
| lower_discard_flow.cpp | 89 ir_rvalue *rhs = new(mem_ctx) ir_constant(true); local
90 ir_assignment *assign = new(mem_ctx) ir_assignment(lhs, rhs);
111 ir_rvalue *rhs = new(mem_ctx) ir_constant(false); local
112 ir_assignment *assign = new(mem_ctx) ir_assignment(lhs, rhs);
|
| lower_output_reads.cpp | 115 ir_dereference_variable *rhs = new(ctx) ir_dereference_variable(temp); local
116 return new(ctx) ir_assignment(lhs, rhs);
|
| loop_analysis.cpp | 205 /* This catches the case where the variable is used in the RHS of an
276 * - All operands on the RHS of the assignment are also loop constants.
292 /* Process the RHS of the assignment. If all of the variables
295 ir_rvalue *const rhs = lv->first_assignment->rhs; local
296 if (all_expression_operands_are_loop_constant(rhs, ls->var_hash)) {
445 /* The RHS must be a binary expression.
447 ir_expression *const rhs = ir->rhs->as_expression(); local
448 if ((rhs == NULL
[all...] |
| /external/mesa3d/src/glsl/ |
| lower_discard_flow.cpp | 89 ir_rvalue *rhs = new(mem_ctx) ir_constant(true); local
90 ir_assignment *assign = new(mem_ctx) ir_assignment(lhs, rhs);
111 ir_rvalue *rhs = new(mem_ctx) ir_constant(false); local
112 ir_assignment *assign = new(mem_ctx) ir_assignment(lhs, rhs);
|
| lower_output_reads.cpp | 115 ir_dereference_variable *rhs = new(ctx) ir_dereference_variable(temp); local
116 return new(ctx) ir_assignment(lhs, rhs);
|
| /libcore/luni/src/main/java/java/net/ |
| InterfaceAddress.java | 84 InterfaceAddress rhs = (InterfaceAddress) obj; local
85 return ((address == null) ? rhs.address == null : address.equals(rhs.address)) &&
86 (rhs.prefixLength == prefixLength) &&
87 ((broadcastAddress == null) ? rhs.broadcastAddress == null : broadcastAddress.equals(rhs.broadcastAddress));
|
| /external/eigen/Eigen/src/misc/ |
| Solve.h | 20 template<typename DecompositionType, typename Rhs>
21 struct traits<solve_retval_base<DecompositionType, Rhs> >
24 typedef Matrix<typename Rhs::Scalar,
26 Rhs::ColsAtCompileTime,
27 Rhs::PlainObject::Options,
29 Rhs::MaxColsAtCompileTime> ReturnType;
32 template<typename _DecompositionType, typename Rhs> struct solve_retval_base
33 : public ReturnByValue<solve_retval_base<_DecompositionType, Rhs> >
35 typedef typename remove_all<typename Rhs::Nested>::type RhsNestedCleaned;
40 solve_retval_base(const DecompositionType& dec, const Rhs& rhs
47 inline const RhsNestedCleaned& rhs() const { return m_rhs; } function in struct:Eigen::internal::solve_retval_base
[all...] |
| SparseSolve.h | 17 template<typename _DecompositionType, typename Rhs> struct sparse_solve_retval_base;
18 template<typename _DecompositionType, typename Rhs> struct sparse_solve_retval;
20 template<typename DecompositionType, typename Rhs>
21 struct traits<sparse_solve_retval_base<DecompositionType, Rhs> >
24 typedef SparseMatrix<typename Rhs::Scalar, Rhs::Options, typename Rhs::Index> ReturnType;
27 template<typename _DecompositionType, typename Rhs> struct sparse_solve_retval_base
28 : public ReturnByValue<sparse_solve_retval_base<_DecompositionType, Rhs> >
30 typedef typename remove_all<typename Rhs::Nested>::type RhsNestedCleaned
42 inline const RhsNestedCleaned& rhs() const { return m_rhs; } function in struct:Eigen::internal::sparse_solve_retval_base
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
| TypeResolver.java | 81 PExpression rhs = node.getRight(); local
82 if (isNumeric(lhs) || isNumeric(rhs)) {
83 node.replaceBy(new ANumericAddExpression(lhs, rhs));
91 PExpression rhs = node.getRight(); local
92 if (isNumeric(lhs) || isNumeric(rhs)) {
93 node.replaceBy(new ANumericEqExpression(lhs, rhs));
101 PExpression rhs = node.getRight(); local
102 if (isNumeric(lhs) || isNumeric(rhs)) {
103 node.replaceBy(new ANumericNeExpression(lhs, rhs));
|
| /external/bison/src/ |
| gram.h | 44 instance RITEM stores both symbol (the RHS) and rule numbers: the
58 RULES[R].rhs -- the index in RITEM of the beginning of the portion
184 item_number *rhs; member in struct:__anon2778
225 /* Return the length of the RHS. */
228 /* Print this rule's RHS on OUT. */
251 /* Return the size of the longest rule RHS. */
|
| parse-gram.y | 38 #define YYLLOC_DEFAULT(Current, Rhs, N) (Current) = lloc_default (Rhs, N)
568 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" TYP
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/css/ |
| CSSBasicShapes.cpp | 237 const CSSBasicShapePolygon& rhs = static_cast<const CSSBasicShapePolygon&>(shape); local
238 return compareCSSValueVector<CSSPrimitiveValue>(m_values, rhs.m_values);
|
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathPredicate.cpp | 66 NumericOp::NumericOp(Opcode opcode, Expression* lhs, Expression* rhs)
70 addSubExpression(rhs);
76 Value rhs(subExpr(1)->evaluate());
79 double rightVal = rhs.toNumber();
97 EqTestOp::EqTestOp(Opcode opcode, Expression* lhs, Expression* rhs)
101 addSubExpression(rhs);
104 bool EqTestOp::compare(const Value& lhs, const Value& rhs) const
108 if (rhs.isNodeSet()) {
112 const NodeSet& rhsSet = rhs.toNodeSet();
119 if (rhs.isNumber())
231 Value rhs = subExpr(1)->evaluate(); local
[all...] |
| /external/clang/test/CodeGenCXX/ |
| conditional-gnu-ext.cpp | 36 _Complex int rhs; local
38 return getComplex(1+2i) ? : rhs;
58 int rhs = 10; local
59 foo (cond()? : rhs);
|
| /system/core/libpixelflinger/codeflinger/ |
| CodeCache.h | 45 AssemblyKey(const T& rhs) : mKey(rhs) { }
47 const T& rhs = static_cast<const AssemblyKey&>(key).mKey; local
48 return android::compare_type(mKey, rhs);
126 const key_value_pair_t<CodeCache::key_t, CodeCache::cache_entry_t>& rhs)
128 return lhs.key.mKey->compare_type(*(rhs.key.mKey));
|
