| /external/clang/test/CXX/expr/expr.post/expr.ref/ |
| p3.cpp | 5 int lhs; member in struct:Node
9 (void)n->lhs;
|
| /external/conscrypt/src/main/java/org/conscrypt/ |
| ByteArray.java | 43 ByteArray lhs = (ByteArray) o; local
44 return Arrays.equals(bytes, lhs.bytes);
|
| ClientSessionContext.java | 143 HostAndPort lhs = (HostAndPort) o; local
144 return host.equals(lhs.host) && port == lhs.port;
|
| /external/libcxx/test/std/experimental/any/any.class/any.assign/ |
| value.pass.cpp | 28 template <class LHS, class RHS>
30 assert(LHS::count == 0);
32 LHS::reset();
35 any lhs(LHS(1));
38 assert(LHS::count == 1);
42 lhs = rhs;
45 assert(LHS::count == 0);
48 assertContains<RHS>(lhs, 2);
51 assert(LHS::count == 0)
82 any lhs; local
97 any lhs; local
131 any lhs; local
[all...] |
| copy.pass.cpp | 28 template <class LHS, class RHS>
30 assert(LHS::count == 0);
32 LHS::reset();
35 any lhs(LHS(1));
38 assert(LHS::count == 1);
42 lhs = rhs;
45 assert(LHS::count == 0);
48 assertContains<RHS>(lhs, 2);
51 assert(LHS::count == 0)
60 any lhs; local
148 any lhs; local
[all...] |
| /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:__anon6627
219 /* Print this rule's number and lhs on OUT. If a PREVIOUS_LHS was
|
| /external/eigen/blas/ |
| PackedTriangularSolverVector.h | 25 static void run(Index size, const LhsScalar* lhs, RhsScalar* rhs)
31 lhs += IsLower ? 0 : (size*(size+1)>>1)-1;
37 rhs[i] -= (ConjLhsType(LhsMap(lhs+s,pi))
40 rhs[i] /= cj(lhs[IsLower ? i : 0]);
41 IsLower ? lhs += pi+1 : lhs -= pi+2; local
53 static void run(Index size, const LhsScalar* lhs, RhsScalar* rhs)
59 lhs += IsLower ? 0 : size*(size-1)>>1;
65 rhs[i] /= cj(lhs[IsLower ? 0 : i]);
68 rhs[i] * ConjLhsType(LhsMap(lhs+(IsLower? 1 : 0),r))
69 IsLower ? lhs += size-pi : lhs -= r; local
[all...] |
| /external/libcxx/test/std/experimental/optional/optional.object/optional.object.ctor/ |
| copy.pass.cpp | 29 optional<T> lhs = rhs; local
31 assert(static_cast<bool>(lhs) == rhs_engaged);
33 assert(*lhs == *rhs);
|
| move.pass.cpp | 31 optional<T> lhs = std::move(rhs); local
33 assert(static_cast<bool>(lhs) == rhs_engaged);
|
| /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",
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/optional/optional.object/optional.object.ctor/ |
| copy.pass.cpp | 29 optional<T> lhs = rhs; local
31 assert(static_cast<bool>(lhs) == rhs_engaged);
33 assert(*lhs == *rhs);
|
| move.pass.cpp | 31 optional<T> lhs = std::move(rhs); local
33 assert(static_cast<bool>(lhs) == rhs_engaged);
|
| /build/kati/ |
| rule.h | 56 StringPiece lhs; member in struct:RuleVarAssignment
|
| main.cc | 111 Symbol lhs = Intern(l.substr(0, found)); local
113 lhs.SetGlobalVar(
|
| /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));
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| LinkedHashSetTest.java | 237 LinkedHashSet<Integer> lhs = new LinkedHashSet<Integer>(); local
240 lhs.add(new Integer(1));
241 assertEquals(1, lhs.size());
242 lhs.retainAll(v);
243 assertEquals(0, lhs.size());
251 lhs.add(new Integer(1));
252 lhs.add(new Integer(6));
253 lhs.add(new Integer(7));
254 lhs.add(new Integer(8));
255 lhs.add(new Integer(9))
282 LinkedHashSet<Integer> lhs = new LinkedHashSet<Integer>(); local
301 LinkedHashSet<Integer> lhs = new LinkedHashSet<Integer>(); local
[all...] |
| /external/ceres-solver/internal/ceres/ |
| 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);
129 int num_sc_cols = lhs.cols();
137 y = lhs * x
[all...] |
| schur_complement_solver.h | 128 const BlockRandomAccessMatrix* lhs() const { return lhs_.get(); } function in class:ceres::internal::SchurComplementSolver
129 void set_lhs(BlockRandomAccessMatrix* lhs) { lhs_.reset(lhs); }
|
| /external/gemmlowp/internal/ |
| kernel_neon.h | 79 // A 12x2 block of 3 4x2 cells Lhs is stored in 16bit in d2--d7
91 // Lhs | | | | |
115 // Load 3 Lhs cells of size 4x2 each
120 // Expand Lhs/Rhs cells to 16 bit.
413 // A 12x2 block of 3 4x2 cells Lhs is stored in 8bit in d1--d3.
423 // Lhs | | | | |
446 /* Load 3 Lhs cells of size 4x2 */ \
700 // A 12x2 block of 3 4x2 cells Lhs is stored in 16bit in v2--v4.
711 // Lhs | | | | | |
736 // Load 3 Lhs cells of size 4x2 eac
1013 uint16x8_t lhs[Cells]; variable
[all...] |
| /external/icu/icu4c/source/test/intltest/ |
| pluralmaptest.cpp | 22 static UBool strEqual(const UnicodeString &lhs, const UnicodeString &rhs) {
23 return lhs == rhs;
177 PluralMapForPluralMapTest lhs(*rhs);
179 assertTrue("", lhs == control);
190 PluralMapForPluralMapTest lhs; local
191 addVariant(PluralMapBase::OTHER, "pickles", lhs);
192 addVariant(PluralMapBase::TWO, "pickletwo", lhs);
193 addVariant(PluralMapBase::MANY, "picklemany", lhs);
194 addVariant(PluralMapBase::FEW, "picklefew", lhs);
195 lhs = *rhs
[all...] |
| /external/ltrace/ |
| expr.h | 43 struct expr_node *lhs; member in struct:expr_node
60 struct value *lhs,
64 struct value *lhs,
95 /* Expression LHS[RHS]. LHS and RHS are owned if, respectively,
98 struct expr_node *lhs, int own_lhs,
101 /* This expression returns the containing value of LHS (^LHS). LHS is
103 void expr_init_up(struct expr_node *node, struct expr_node *lhs, int own_lhs)
[all...] |
