Searched defs:lhs (Results 1 - 25 of 196) sorted by relevance

12345678

/external/oprofile/libpp/
H A Dsymbol_functors.cpp14 bool less_symbol::operator()(symbol_entry const & lhs, argument
17 if (lhs.image_name != rhs.image_name)
18 return lhs.image_name < rhs.image_name;
20 if (lhs.app_name != rhs.app_name)
21 return lhs.app_name < rhs.app_name;
23 if (lhs.name != rhs.name)
24 return lhs.name < rhs.name;
26 if (lhs.sample.vma != rhs.sample.vma)
27 return lhs.sample.vma < rhs.sample.vma;
29 return lhs
[all...]
H A Dsymbol_functors.h19 bool operator()(sample_entry const * lhs, argument
21 return lhs->file_loc < rhs->file_loc;
24 bool operator()(symbol_entry const * lhs, argument
26 return lhs->sample.file_loc < rhs->sample.file_loc;
34 bool operator()(symbol_entry const & lhs,
/external/clang/test/CXX/expr/expr.post/expr.ref/
H A Dp3.cpp5 int lhs; member in struct:Node
9 (void)n->lhs;
/external/clang/test/CodeGen/
H A Darm-neon-fma.c11 float32x2_t test_fma_order(float32x2_t accum, float32x2_t lhs, float32x2_t rhs) { argument
12 return vfma_f32(accum, lhs, rhs);
13 // CHECK: call <2 x float> @llvm.fma.v2f32(<2 x float> %lhs, <2 x float> %rhs, <2 x float> %accum)
16 float32x4_t test_fmaq_order(float32x4_t accum, float32x4_t lhs, float32x4_t rhs) { argument
17 return vfmaq_f32(accum, lhs, rhs);
18 // CHECK: call <4 x float> @llvm.fma.v4f32(<4 x float> %lhs, <4 x float> %rhs, <4 x float> %accum)
/external/chromium/chrome/browser/history/
H A Dpage_usage_data.cc43 bool PageUsageData::Predicate(const PageUsageData* lhs, argument
45 return lhs->GetScore() > rhs->GetScore();
/external/arduino/hardware/arduino/cores/arduino/
H A DWString.h85 friend String operator + ( String lhs, const String &rhs );
106 inline String operator+( String lhs, const String &rhs ) argument
108 return lhs += rhs;
/external/bison/src/
H A Dderives.c80 symbol_number lhs = rules[r].lhs->number; local
83 p->next = dset[lhs - ntokens];
85 dset[lhs - ntokens] = p;
/external/ceres-solver/internal/ceres/
H A Dblock_structure.cc37 bool CellLessThan(const Cell& lhs, const Cell& rhs) { argument
38 return (lhs.block_id < rhs.block_id);
H A Dimplicit_schur_complement_test.cc72 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>().ldlt().solve(*rhs);
118 Matrix lhs; local
121 ReducedLinearSystemAndSolution(D, &lhs, &rhs, &reference_solution);
126 int num_sc_cols = lhs.cols();
134 y = lhs *
71 ReducedLinearSystemAndSolution(double* D, Matrix* lhs, Vector* rhs, Vector* solution) argument
[all...]
H A Dschur_complement_solver.h121 const BlockRandomAccessMatrix* lhs() const { return lhs_.get(); } function in class:ceres::internal::SchurComplementSolver
122 void set_lhs(BlockRandomAccessMatrix* lhs) { lhs_.reset(lhs); } argument
/external/chromium/base/
H A Dversion_unittest.cc54 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/clang/test/Sema/
H A Dparentheses.cpp37 friend S operator+(const S &lhs, bool) { return S(); } argument
/external/stlport/test/eh/
H A DSortClass.h58 inline bool operator>( const SortClass& lhs, const SortClass& rhs ) { argument
59 return rhs < lhs;
62 inline bool operator<=( const SortClass& lhs, const SortClass& rhs ) { argument
63 return !(rhs < lhs);
66 inline bool operator>=( const SortClass& lhs, const SortClass& rhs ) { argument
67 return !(lhs < rhs);
70 inline bool operator != ( const SortClass& lhs, const SortClass& rhs ) { argument
71 return !(lhs == rhs);
/external/webkit/Source/JavaScriptCore/wtf/unicode/
H A DCollatorDefault.cpp54 Collator::Result Collator::collate(const UChar* lhs, size_t lhsLength, const UChar* rhs, size_t rhsLength) const argument
58 while (l < lmin && *lhs == *rhs) {
59 lhs++;
65 return (*lhs > *rhs) ? Greater : Less;
/external/chromium/chrome/browser/password_manager/
H A Dpassword_form_data.cc40 bool operator==(const PasswordForm& lhs, const PasswordForm& rhs) { argument
41 return (lhs.scheme == rhs.scheme &&
42 lhs.signon_realm == rhs.signon_realm &&
43 lhs.origin == rhs.origin &&
44 lhs.action == rhs.action &&
45 lhs.submit_element == rhs.submit_element &&
46 lhs.username_element == rhs.username_element &&
47 lhs.password_element == rhs.password_element &&
48 lhs.username_value == rhs.username_value &&
49 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, typename ResultType::RealScalar tolerance) argument
22 // return sparse_sparse_product_with_pruning_impl2(lhs,rhs,res);
28 Index rows = lhs.innerSize();
30 //int size = lhs.outerSize();
31 eigen_assert(lhs.outerSize() == rhs.innerSize());
38 // of the lhs differs in average of one non zeros, thus the number of non zeros for
39 // the product of a rhs column with the lhs is X+Y where X is the average number of non zero
40 // per column of the lhs.
41 // Therefore, we have nnz(lhs*rhs) = nnz(lhs)
88 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, RealScalar tolerance) argument
100 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, RealScalar tolerance) argument
114 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, RealScalar tolerance) argument
127 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, RealScalar tolerance) argument
[all...]
H A DConservativeSparseSparseProduct.h18 static void conservative_sparse_sparse_product_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument
24 Index rows = lhs.innerSize();
26 eigen_assert(lhs.outerSize() == rhs.innerSize());
34 // of the lhs differs in average of one non zeros, thus the number of non zeros for
35 // the product of a rhs column with the lhs is X+Y where X is the average number of non zero
36 // per column of the lhs.
37 // Therefore, we have nnz(lhs*rhs) = nnz(lhs) + nnz(rhs)
38 Index estimated_nnz_prod = lhs.nonZeros() + rhs.nonZeros();
52 for (typename Lhs::InnerIterator lhsIt(lhs,
135 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument
150 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument
163 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument
176 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument
191 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument
203 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument
216 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument
229 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument
[all...]
/external/marisa-trie/lib/marisa/
H A Dkey.h45 inline bool operator<(const Key<T> &lhs, const T &rhs) { argument
46 return lhs.str() < rhs;
50 inline bool operator<(const T &lhs, const Key<T> &rhs) { argument
51 return lhs < rhs.str();
55 inline bool operator<(const Key<T> &lhs, const Key<T> &rhs) { argument
56 return lhs.str() < rhs.str();
60 inline bool operator==(const Key<T> &lhs, const Key<T> &rhs) { argument
61 return lhs.str() == rhs.str();
H A Dmarisa-string.h48 inline bool operator==(const String &lhs, const String &rhs) { argument
49 if (lhs.length() != rhs.length()) {
52 for (std::size_t i = 0; i < lhs.length(); ++i) {
53 if (lhs[i] != rhs[i]) {
60 inline bool operator!=(const String &lhs, const String &rhs) { argument
61 return !(lhs == rhs);
64 inline bool operator<(const String &lhs, const String &rhs) { argument
65 for (std::size_t i = 0; i < lhs.length(); ++i) {
69 if (lhs[i] != rhs[i]) {
70 return lhs[
76 operator >(const String &lhs, const String &rhs) argument
120 operator ==(const RString &lhs, const RString &rhs) argument
132 operator !=(const RString &lhs, const RString &rhs) argument
136 operator <(const RString &lhs, const RString &rhs) argument
148 operator >(const RString &lhs, const RString &rhs) argument
[all...]
/external/marisa-trie/v0_1_5/lib/marisa_alpha/
H A Dkey.h47 inline bool operator<(const Key<T> &lhs, const T &rhs) { argument
48 return lhs.str() < rhs;
52 inline bool operator<(const T &lhs, const Key<T> &rhs) { argument
53 return lhs < rhs.str();
57 inline bool operator<(const Key<T> &lhs, const Key<T> &rhs) { argument
58 return lhs.str() < rhs.str();
62 inline bool operator==(const Key<T> &lhs, const Key<T> &rhs) { argument
63 return lhs.str() == rhs.str();
H A Dmarisa-string.h48 inline bool operator==(const String &lhs, const String &rhs) { argument
49 if (lhs.length() != rhs.length()) {
52 for (std::size_t i = 0; i < lhs.length(); ++i) {
53 if (lhs[i] != rhs[i]) {
60 inline bool operator!=(const String &lhs, const String &rhs) { argument
61 return !(lhs == rhs);
64 inline bool operator<(const String &lhs, const String &rhs) { argument
65 for (std::size_t i = 0; i < lhs.length(); ++i) {
69 if (lhs[i] != rhs[i]) {
70 return lhs[
76 operator >(const String &lhs, const String &rhs) argument
120 operator ==(const RString &lhs, const RString &rhs) argument
132 operator !=(const RString &lhs, const RString &rhs) argument
136 operator <(const RString &lhs, const RString &rhs) argument
148 operator >(const RString &lhs, const RString &rhs) argument
[all...]
/external/webkit/Source/WebKit/android/WebCoreSupport/
H A DWebResponse.h78 bool operator()(const std::string& lhs, const std::string& rhs) const { argument
79 return strcasecmp(lhs.c_str(), rhs.c_str()) < 0;
/external/chromium/chrome/browser/prefs/
H A Dpref_service.h275 bool operator() (Preference* lhs, Preference* rhs) const { argument
276 return lhs->name() < rhs->name();
/external/eigen/Eigen/src/Geometry/
H A DOrthoMethods.h33 typename internal::nested<Derived,2>::type lhs(derived());
36 internal::conj(lhs.coeff(1) * rhs.coeff(2) - lhs.coeff(2) * rhs.coeff(1)),
37 internal::conj(lhs.coeff(2) * rhs.coeff(0) - lhs.coeff(0) * rhs.coeff(2)),
38 internal::conj(lhs.coeff(0) * rhs.coeff(1) - lhs.coeff(1) * rhs.coeff(0))
49 run(const VectorLhs& lhs, const VectorRhs& rhs) argument
52 internal::conj(lhs.coeff(1) * rhs.coeff(2) - lhs
[all...]
/external/eigen/Eigen/src/Geometry/arch/
H A DGeometry_SSE.h44 run(const VectorLhs& lhs, const VectorRhs& rhs) argument
46 __m128 a = lhs.template packet<VectorLhs::Flags&AlignedBit ? Aligned : Unaligned>(0);

Completed in 741 milliseconds

12345678