Searched defs:lhs (Results 151 - 175 of 505) sorted by relevance

1234567891011>>

/external/conscrypt/platform/src/main/java/org/conscrypt/
H A DCertificatePriorityComparator.java78 public int compare(X509Certificate lhs, X509Certificate rhs) { argument
80 boolean lhsSelfSigned = lhs.getSubjectDN().equals(lhs.getIssuerDN());
87 result = compareStrength(rhs, lhs);
92 Date lhsNotAfter = lhs.getNotAfter();
99 Date lhsNotBefore = lhs.getNotBefore();
104 private int compareStrength(X509Certificate lhs, X509Certificate rhs) { argument
106 PublicKey lhsPublicKey = lhs.getPublicKey();
116 return compareSignatureAlgorithm(lhs, rhs);
119 private int compareKeyAlgorithm(PublicKey lhs, PublicKe argument
135 compareKeySize(PublicKey lhs, PublicKey rhs) argument
157 compareSignatureAlgorithm(X509Certificate lhs, X509Certificate rhs) argument
[all...]
/external/libchrome/base/trace_event/
H A Dheap_profiler_allocation_context.cc15 bool operator < (const StackFrame& lhs, const StackFrame& rhs) { argument
16 return lhs.value < rhs.value;
19 bool operator == (const StackFrame& lhs, const StackFrame& rhs) { argument
20 return lhs.value == rhs.value;
23 bool operator != (const StackFrame& lhs, const StackFrame& rhs) { argument
24 return !(lhs.value == rhs.value);
29 bool operator==(const Backtrace& lhs, const Backtrace& rhs) { argument
30 if (lhs.frame_count != rhs.frame_count) return false;
31 return std::equal(lhs.frames, lhs
34 operator !=(const Backtrace& lhs, const Backtrace& rhs) argument
44 operator ==(const AllocationContext& lhs, const AllocationContext& rhs) argument
48 operator !=(const AllocationContext& lhs, const AllocationContext& rhs) argument
[all...]
/external/libcxx/test/std/algorithms/alg.sorting/alg.clamp/
H A Dclamp.pass.cpp29 bool eq(const Tag& rhs, const Tag& lhs) { return rhs.val == lhs.val && rhs.tag == lhs.tag; } argument
30 // bool operator==(const Tag& rhs, const Tag& lhs) { return rhs.val == lhs.val; }
31 bool operator< (const Tag& rhs, const Tag& lhs) { return rhs.val < lhs.val; } argument
/external/libcxx/test/std/containers/sequences/deque/deque.modifiers/
H A Dpush_back_exception_safety.pass.cpp66 bool operator==(const CMyClass &lhs, const CMyClass &rhs) { return lhs.equal(rhs); } argument
H A Dpush_front_exception_safety.pass.cpp66 bool operator==(const CMyClass &lhs, const CMyClass &rhs) { return lhs.equal(rhs); } argument
/external/libcxx/test/std/containers/sequences/vector/vector.modifiers/
H A Dpush_back_exception_safety.pass.cpp66 bool operator==(const CMyClass &lhs, const CMyClass &rhs) { return lhs.equal(rhs); } argument
/external/libcxx/test/std/experimental/optional/optional.object/optional.object.ctor/
H A Dcopy.pass.cpp35 optional<T> lhs = rhs; local
37 assert(static_cast<bool>(lhs) == rhs_engaged);
39 assert(*lhs == *rhs);
/external/libcxx/test/std/utilities/memory/unique.ptr/unique.ptr.single/unique.ptr.single.asgn/
H A Dmove_convert.pass.cpp56 void checkDeleter(LHS& lhs, RHS& rhs, int LHSState, int RHSState) { argument
57 assert(lhs.get_deleter().state() == LHSState);
/external/libcxx/test/std/utilities/optional/optional.object/optional.object.ctor/
H A Dconst_optional_U.pass.cpp32 optional<T> lhs = rhs; local
34 assert(static_cast<bool>(lhs) == rhs_engaged);
36 assert(*lhs == *rhs);
44 optional<T> lhs = rhs;
45 assert(static_cast<bool>(lhs) == rhs_engaged);
47 assert(*lhs == *rhs);
H A Dmove.pass.cpp30 optional<T> lhs = std::move(rhs); local
31 assert(static_cast<bool>(lhs) == rhs_engaged);
33 assert(*lhs == *orig);
48 optional<Z> lhs(std::move(rhs));
64 optional<T> lhs = std::move(rhs); local
65 assert(static_cast<bool>(lhs) == rhs_engaged);
67 assert(&(*lhs) == &(*rhs));
149 const optional<T> lhs(std::move(rhs));
150 assert(lhs.has_value() == false);
162 const optional<T> lhs(st
[all...]
H A Doptional_U.pass.cpp33 optional<T> lhs = std::move(rhs); local
35 assert(static_cast<bool>(lhs) == rhs_engaged);
43 optional<T> lhs = std::move(rhs);
44 assert(static_cast<bool>(lhs) == rhs_engaged);
/external/v8/src/base/
H A Dbits.cc28 int32_t SignedMulHigh32(int32_t lhs, int32_t rhs) { argument
29 int64_t const value = static_cast<int64_t>(lhs) * static_cast<int64_t>(rhs);
34 int32_t SignedMulHighAndAdd32(int32_t lhs, int32_t rhs, int32_t acc) { argument
36 bit_cast<uint32_t>(SignedMulHigh32(lhs, rhs)));
40 int32_t SignedDiv32(int32_t lhs, int32_t rhs) { argument
42 if (rhs == -1) return -lhs;
43 return lhs / rhs;
47 int32_t SignedMod32(int32_t lhs, int32_t rhs) { argument
49 return lhs % rhs;
68 int64_t SignedSaturatedAdd64(int64_t lhs, int64_ argument
75 SignedSaturatedSub64(int64_t lhs, int64_t rhs) argument
81 SignedMulOverflow32(int32_t lhs, int32_t rhs, int32_t* val) argument
89 SignedMulOverflow64(int64_t lhs, int64_t rhs, int64_t* val) argument
[all...]
/external/clang/include/clang/Basic/
H A DSourceManagerInternals.h63 inline bool operator<(const LineEntry &lhs, const LineEntry &rhs) { argument
65 return lhs.FileOffset < rhs.FileOffset;
/external/clang/test/Sema/
H A Dparentheses.cpp69 friend S operator+(const S &lhs, bool) { return S(); } argument
/external/eigen/Eigen/src/Geometry/
H A DOrthoMethods.h41 typename internal::nested_eval<Derived,2>::type lhs(derived());
44 numext::conj(lhs.coeff(1) * rhs.coeff(2) - lhs.coeff(2) * rhs.coeff(1)),
45 numext::conj(lhs.coeff(2) * rhs.coeff(0) - lhs.coeff(0) * rhs.coeff(2)),
46 numext::conj(lhs.coeff(0) * rhs.coeff(1) - lhs.coeff(1) * rhs.coeff(0))
57 run(const VectorLhs& lhs, const VectorRhs& rhs) argument
60 numext::conj(lhs.coeff(1) * rhs.coeff(2) - lhs
[all...]
/external/eigen/Eigen/src/SparseCore/
H A DSparseSparseProductWithPruning.h20 static void sparse_sparse_product_with_pruning_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res, const typename ResultType::RealScalar& tolerance) argument
22 // return sparse_sparse_product_with_pruning_impl2(lhs,rhs,res);
28 Index rows = lhs.innerSize();
30 //Index size = lhs.outerSize();
31 eigen_assert(lhs.outerSize() == rhs.innerSize());
42 evaluator<Lhs> lhsEval(lhs);
47 // of the lhs differs in average of one non zeros, thus the number of non zeros for
48 // the product of a rhs column with the lhs is X+Y where X is the average number of non zero
49 // per column of the lhs.
50 // Therefore, we have nnz(lhs*rh
91 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) argument
103 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) argument
117 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) argument
130 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) argument
150 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) argument
162 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) argument
174 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) argument
186 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) argument
[all...]
H A DTriangularSolver.h33 static void run(const Lhs& lhs, Rhs& other) argument
35 LhsEval lhsEval(lhs);
38 for(Index i=0; i<lhs.rows(); ++i)
70 static void run(const Lhs& lhs, Rhs& other) argument
72 LhsEval lhsEval(lhs);
75 for(Index i=lhs.rows()-1 ; i>=0 ; --i)
109 static void run(const Lhs& lhs, Rhs& other) argument
111 LhsEval lhsEval(lhs);
114 for(Index i=0; i<lhs.cols(); ++i)
144 static void run(const Lhs& lhs, Rh argument
216 run(const Lhs& lhs, Rhs& other) argument
[all...]
/external/eigen/blas/
H A DPackedTriangularMatrixVector.h27 static void run(Index size, const LhsScalar* lhs, const RhsScalar* rhs, ResScalar* res, ResScalar alpha) argument
39 ResMap(res+(IsLower ? s+i : 0),r) += alpha * cj(rhs[i]) * ConjLhsType(LhsMap(lhs+s,r));
42 lhs += IsLower ? size-i: i+1;
56 static void run(Index size, const LhsScalar* lhs, const RhsScalar* rhs, ResScalar* res, ResScalar alpha) argument
69 res[i] += alpha * (ConjLhsType(LhsMap(lhs+s,r)).cwiseProduct(ConjRhsType(RhsMap(rhs+(IsLower ? 0 : s+i),r)))).sum();
72 lhs += IsLower ? i+1 : size-i;
/external/gemmlowp/internal/
H A Dkernel_neon.h1013 uint16x8_t lhs[Cells]; variable
1015 lhs[cell] = vmovl_u8(vld1_u8(lhs_ptr));
1024 acc[cell] = vmlal_n_u16(acc[cell], vget_low_u16(lhs[cell]), rhs0);
1028 acc[cell] = vmlal_n_u16(acc[cell], vget_high_u16(lhs[cell]), rhs1);
H A Dsingle_thread_gemm.h52 const MatrixMap<const InputScalar, LhsOrder>& lhs,
59 assert(lhs.cols() == rhs.rows());
63 int depth = lhs.cols();
92 PackLhs<BitDepthParams>(&packed_lhs, lhs.block(r, 0, rs, depth));
50 SingleThreadGemm(SingleThreadGemmContext* context, const KernelBase& kernel, const MatrixMap<const InputScalar, LhsOrder>& lhs, const MatrixMap<const InputScalar, RhsOrder>& rhs, MatrixMap<OutputScalar, ResultOrder>* result, const LhsOffset& lhs_offset, const RhsOffset& rhs_offset, const OutputPipelineType& output_pipeline) argument
/external/gemmlowp/public/
H A Dgemmlowp.h43 const MatrixMap<const InputScalar, LhsOrder>& lhs,
49 assert(lhs.cols() == rhs.rows());
53 int depth = lhs.cols();
65 BitDepthParams>(context, Kernel(), lhs, rhs, result,
71 DefaultL8R8BitDepthParams>(context, Kernel(), lhs, rhs,
79 BitDepthParams>(context, Kernel(), lhs, rhs, result,
85 DefaultL8R8BitDepthParams>(context, Kernel(), lhs, rhs,
101 const MatrixMap<const InputScalar, LhsOrder>& lhs,
106 const OffsetColDup lhs_offset_vector(lhs_offset, lhs.rows());
109 context, lhs, rh
42 GemmWithOutputPipelinePC(GemmContext* context, const MatrixMap<const InputScalar, LhsOrder>& lhs, const MatrixMap<const InputScalar, RhsOrder>& rhs, MatrixMap<OutputScalar, ResultOrder>* result, const LhsOffset& lhs_offset, const RhsOffset& rhs_offset, const OutputPipelineType& output_pipeline) argument
100 GemmWithOutputPipeline(GemmContext* context, const MatrixMap<const InputScalar, LhsOrder>& lhs, const MatrixMap<const InputScalar, RhsOrder>& rhs, MatrixMap<OutputScalar, ResultOrder>* result, int lhs_offset, int rhs_offset, const OutputPipelineType& output_pipeline) argument
119 Gemm(GemmContext* context, const MatrixMap<const Scalar, LhsOrder>& lhs, const MatrixMap<const Scalar, RhsOrder>& rhs, MatrixMap<Scalar, ResultOrder>* result, int lhs_offset, int rhs_offset, int result_offset, int result_mult_int, int result_shift) argument
[all...]
/external/icu/icu4c/source/test/intltest/
H A Dpluralmaptest.cpp24 static UBool strEqual(const UnicodeString &lhs, const UnicodeString &rhs) { argument
25 return lhs == rhs;
179 PluralMapForPluralMapTest lhs(*rhs);
181 assertTrue("", lhs == control);
192 PluralMapForPluralMapTest lhs; local
193 addVariant(PluralMapBase::OTHER, "pickles", lhs);
194 addVariant(PluralMapBase::TWO, "pickletwo", lhs);
195 addVariant(PluralMapBase::MANY, "picklemany", lhs);
196 addVariant(PluralMapBase::FEW, "picklefew", lhs);
197 lhs
[all...]
/external/icu/icu4j/eclipse-build/plugins.template/com.ibm.icu.base.tests/src/com/ibm/icu/tests/
H A DICUTestCase.java66 * @param lhs an object to test, may be null
69 public static void assertNotEqual(Object lhs, Object rhs) { argument
70 if (lhs == null) {
73 if (lhs.equals(rhs)) {
74 fail(lhs.toString() + " equals " + rhs);
79 public static void assertNotEqual(long lhs, long rhs) { argument
80 if (lhs == rhs) {
81 fail("values are equal: " + lhs);
185 * @param lhs the left array
188 public static void assertArraysEqual(Object lhs, Objec argument
206 assertArraysNotEqual(Object lhs, Object rhs) argument
[all...]
/external/libbrillo/brillo/
H A Dany.h208 inline void swap(brillo::Any& lhs, brillo::Any& rhs) { argument
209 lhs.Swap(rhs);
/external/libchrome/sandbox/linux/bpf_dsl/
H A Dcons.h121 friend bool operator==(const ListIterator& lhs, const ListIterator& rhs) { argument
122 return lhs.list_ == rhs.list_;
130 bool operator!=(const ListIterator<T>& lhs, const ListIterator<T>& rhs) { argument
131 return !(lhs == rhs);

Completed in 576 milliseconds

1234567891011>>