/external/clang/test/CXX/expr/expr.post/expr.ref/ |
p3.cpp | 5 int lhs; member in struct:Node 9 (void)n->lhs;
|
/libcore/crypto/src/main/java/org/conscrypt/ |
ByteArray.java | 41 ByteArray lhs = (ByteArray) o; local 42 return Arrays.equals(bytes, lhs.bytes);
|
ClientSessionContext.java | 141 HostAndPort lhs = (HostAndPort) o; local 142 return host.equals(lhs.host) && port == lhs.port;
|
/external/bison/src/ |
derives.c | 70 whose LHS is NTERM. */ 80 symbol_number lhs = rules[r].lhs->number; local 82 /* A new LHS is found. */ 83 p->next = dset[lhs - ntokens]; 85 dset[lhs - ntokens] = p;
|
gram.h | 56 RULES[R].lhs -- the symbol of the left hand side of rule R. 183 symbol *lhs; member in struct:__anon2778 219 /* Print this rule's number and lhs on OUT. If a PREVIOUS_LHS was
|
/external/chromium/base/ |
version_unittest.cc | 54 const char* lhs; member in struct:version_compare 70 scoped_ptr<Version> lhs(Version::GetVersionFromString(cases[i].lhs)); 72 EXPECT_EQ(lhs->CompareTo(*rhs), cases[i].expected) << 73 cases[i].lhs << " ? " << cases[i].rhs;
|
/external/chromium_org/base/ |
version_unittest.cc | 66 const char* lhs; member in struct:__anon6412::version_compare 82 Version lhs(cases[i].lhs); 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)); 93 const char* lhs; member in struct:__anon6412::version_compare 112 const Version version(cases[i].lhs); 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 | 88 ir_dereference *lhs = new(mem_ctx) ir_dereference_variable(discarded); local 90 ir_assignment *assign = new(mem_ctx) ir_assignment(lhs, rhs); 110 ir_dereference *lhs = new(mem_ctx) ir_dereference_variable(discarded); 112 ir_assignment *assign = new(mem_ctx) ir_assignment(lhs, rhs);
|
lower_output_reads.cpp | 114 ir_dereference_variable *lhs = new(ctx) ir_dereference_variable(output); local 116 return new(ctx) ir_assignment(lhs, rhs);
|
lower_vector.cpp | 188 ir_dereference *const lhs = new(mem_ctx) ir_dereference_variable(temp); local 190 new(mem_ctx) ir_assignment(lhs, c, NULL, write_mask); 201 ir_dereference *const lhs = new(mem_ctx) ir_dereference_variable(temp); local 203 new(mem_ctx) ir_assignment(lhs, expr->operands[i], NULL, (1U << i));
|
ir_validate.cpp | 539 const ir_dereference *const lhs = ir->lhs; local 540 if (lhs->type->is_scalar() || lhs->type->is_vector()) { 542 printf("Assignment LHS is %s, but write mask is 0:\n", 543 lhs->type->is_scalar() ? "scalar" : "vector"); 555 printf("Assignment count of LHS write mask channels enabled not\n" 556 "matching RHS vector size (%d LHS, %d RHS).\n",
|
/external/mesa3d/src/glsl/ |
lower_discard_flow.cpp | 88 ir_dereference *lhs = new(mem_ctx) ir_dereference_variable(discarded); local 90 ir_assignment *assign = new(mem_ctx) ir_assignment(lhs, rhs); 110 ir_dereference *lhs = new(mem_ctx) ir_dereference_variable(discarded); 112 ir_assignment *assign = new(mem_ctx) ir_assignment(lhs, rhs);
|
lower_output_reads.cpp | 114 ir_dereference_variable *lhs = new(ctx) ir_dereference_variable(output); local 116 return new(ctx) ir_assignment(lhs, rhs);
|
lower_vector.cpp | 188 ir_dereference *const lhs = new(mem_ctx) ir_dereference_variable(temp); local 190 new(mem_ctx) ir_assignment(lhs, c, NULL, write_mask); 201 ir_dereference *const lhs = new(mem_ctx) ir_dereference_variable(temp); local 203 new(mem_ctx) ir_assignment(lhs, expr->operands[i], NULL, (1U << i));
|
ir_validate.cpp | 539 const ir_dereference *const lhs = ir->lhs; local 540 if (lhs->type->is_scalar() || lhs->type->is_vector()) { 542 printf("Assignment LHS is %s, but write mask is 0:\n", 543 lhs->type->is_scalar() ? "scalar" : "vector"); 555 printf("Assignment count of LHS write mask channels enabled not\n" 556 "matching RHS vector size (%d LHS, %d RHS).\n",
|
/libcore/luni/src/test/java/tests/api/java/util/ |
LinkedHashSetTest.java | 231 LinkedHashSet<Integer> lhs = new LinkedHashSet<Integer>(); local 234 lhs.add(new Integer(1)); 235 assertEquals(1, lhs.size()); 236 lhs.retainAll(v); 237 assertEquals(0, lhs.size()); 245 lhs.add(new Integer(1)); 246 lhs.add(new Integer(6)); 247 lhs.add(new Integer(7)); 248 lhs.add(new Integer(8)); 249 lhs.add(new Integer(9)) 276 LinkedHashSet<Integer> lhs = new LinkedHashSet<Integer>(); local 295 LinkedHashSet<Integer> lhs = new LinkedHashSet<Integer>(); local [all...] |
/external/ceres-solver/internal/ceres/ |
sparse_normal_cholesky_solver.cc | 197 cholmod_sparse lhs = ss_.CreateSparseMatrixTransposeView(A); local 204 CHECK_NOTNULL(ss_.BlockAnalyzeCholesky(&lhs, 209 CHECK_NOTNULL(ss_.AnalyzeCholeskyWithNaturalOrdering(&lhs)); 215 cholmod_dense* sol = ss_.SolveCholesky(&lhs, factor_, rhs);
|
implicit_schur_complement_test.cc | 72 Matrix* lhs, 94 lhs->resize(num_schur_rows, num_schur_rows); 102 // of lhs_ref in lhs by transposing lhs_ref, choosing the strictly 104 *lhs = lhs_ref; 105 lhs->triangularView<Eigen::StrictlyLower>() = 112 schur_solution = lhs->selfadjointView<Eigen::Upper>().llt().solve(*rhs); 118 Matrix lhs; local 121 ReducedLinearSystemAndSolution(D, &lhs, &rhs, &reference_solution); 126 int num_sc_cols = lhs.cols(); 134 y = lhs * x [all...] |
schur_complement_solver.h | 122 const BlockRandomAccessMatrix* lhs() const { return lhs_.get(); } function in class:ceres::internal::SchurComplementSolver 123 void set_lhs(BlockRandomAccessMatrix* lhs) { lhs_.reset(lhs); }
|
polynomial.cc | 271 Matrix lhs = Matrix::Zero(num_constraints, num_constraints); local 279 lhs(row, j) = pow(sample.x, degree - j); 287 lhs(row, j) = (degree - j) * pow(sample.x, degree - j - 1); 294 return lhs.fullPivLu().solve(rhs);
|
schur_complement_solver.cc | 114 set_rhs(new double[lhs()->num_rows()]); 122 down_cast<const BlockRandomAccessDenseMatrix*>(lhs()); 242 set_rhs(new double[lhs()->num_rows()]); 269 down_cast<const BlockRandomAccessSparseMatrix*>(lhs())->matrix()); 343 down_cast<const BlockRandomAccessSparseMatrix*>(lhs())->matrix()); 353 cs_di* lhs = CHECK_NOTNULL(cxsparse_.CreateSparseMatrix(tsm)); local 359 CHECK_NOTNULL(cxsparse_.BlockAnalyzeCholesky(lhs, blocks_, blocks_)); 363 bool ok = cxsparse_.SolveCholesky(lhs, cxsparse_factor_, solution); 365 cxsparse_.Free(lhs);
|
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
TypeResolver.java | 80 PExpression lhs = node.getLeft(); local 82 if (isNumeric(lhs) || isNumeric(rhs)) { 83 node.replaceBy(new ANumericAddExpression(lhs, rhs)); 90 PExpression lhs = node.getLeft(); local 92 if (isNumeric(lhs) || isNumeric(rhs)) { 93 node.replaceBy(new ANumericEqExpression(lhs, rhs)); 100 PExpression lhs = node.getLeft(); local 102 if (isNumeric(lhs) || isNumeric(rhs)) { 103 node.replaceBy(new ANumericNeExpression(lhs, rhs));
|
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
brw_fs_channel_expressions.cpp | 118 ir_dereference *lhs = ir->lhs->clone(mem_ctx, NULL); local 126 assert(ir->write_mask == (1 << ir->lhs->type->components()) - 1); 128 assign = new(mem_ctx) ir_assignment(lhs, val, NULL, (1 << elem)); 177 const glsl_type *element_type = glsl_type::get_instance(ir->lhs->type->base_type,
|
/external/mesa3d/src/mesa/drivers/dri/i965/ |
brw_fs_channel_expressions.cpp | 118 ir_dereference *lhs = ir->lhs->clone(mem_ctx, NULL); local 126 assert(ir->write_mask == (1 << ir->lhs->type->components()) - 1); 128 assign = new(mem_ctx) ir_assignment(lhs, val, NULL, (1 << elem)); 177 const glsl_type *element_type = glsl_type::get_instance(ir->lhs->type->base_type,
|
/external/srec/srec/Semproc/include/ |
SR_ExpressionParser.h | 99 * buffer for holding the token on the lhs of equal sign 101 LCHAR lhs[MAX_STRING_LEN]; member in struct:ExpressionParser_t
|