/external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
H A D | GMRES.h | 56 bool gmres(const MatrixType & mat, const Rhs & rhs, Dest & x, const Preconditioner & precond, argument 74 VectorType p0 = rhs - mat*x; 174 // reset data for a restart r0 = rhs - mat * x; 177 r0 = rhs - p1; 371 dec()._solve(rhs(),dst);
|
/external/gtest/test/ |
H A D | gtest_filter_unittest.py | 230 def AssertSetEqual(self, lhs, rhs): 234 self.assert_(elem in rhs, '%s in %s' % (elem, rhs)) 236 for elem in rhs:
|
/external/libvpx/libvpx/third_party/googletest/src/test/ |
H A D | gtest_filter_unittest.py | 230 def AssertSetEqual(self, lhs, rhs): 234 self.assert_(elem in rhs, '%s in %s' % (elem, rhs)) 236 for elem in rhs:
|
/external/marisa-trie/lib/marisa/ |
H A D | bitvector.h | 81 void swap(BitVector *rhs);
|
/external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
H A D | bitvector.h | 81 void swap(BitVector *rhs);
|
/external/protobuf/gtest/test/ |
H A D | gtest_filter_unittest.py | 186 def AssertSetEqual(self, lhs, rhs): 190 self.assert_(elem in rhs, '%s in %s' % (elem, rhs)) 192 for elem in rhs:
|
/external/llvm/lib/Support/ |
H A D | APInt.cpp | 556 APInt rhs(RHS); 558 bool rhsNeg = rhs.isNegative(); 566 rhs.flipAllBits(); 567 rhs++; 574 return lhs.ugt(rhs); 580 return lhs.ult(rhs); 2490 APInt::tcAdd(integerPart *dst, const integerPart *rhs, 2502 dst[i] += rhs[i] + 1; 2505 dst[i] += rhs[i]; 2515 APInt::tcSubtract(integerPart *dst, const integerPart *rhs, [all...] |
/external/chromium/chrome/browser/content_settings/ |
H A D | content_settings_base_provider.cc | 35 const ExtendedContentSettings& rhs) 36 : content_settings(rhs.content_settings), 37 content_settings_for_resources(rhs.content_settings_for_resources) { 34 ExtendedContentSettings( const ExtendedContentSettings& rhs) argument
|
/external/chromium/sdch/open-vcdiff/src/gtest/internal/ |
H A D | gtest-internal.h | 408 // rhs. In particular, this function: 413 bool AlmostEquals(const FloatingPoint& rhs) const { 416 if (is_nan() || rhs.is_nan()) return false; 418 return DistanceBetweenSignAndMagnitudeNumbers(bits_, rhs.bits_) <= kMaxUlps;
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
H A D | BiCGSTAB.h | 20 * \param rhs The right hand side vector b 29 bool bicgstab(const MatrixType& mat, const Rhs& rhs, Dest& x, argument 42 VectorType r = rhs - mat * x; 246 dec()._solve(rhs(),dst);
|
/external/llvm/include/llvm/Support/ |
H A D | YAMLTraits.h | 769 StringRef const rhs) { return lhs.equals(rhs); } 892 _type &operator=(const _type &rhs) { value = rhs.value; return *this; }\ 893 _type &operator=(const _base &rhs) { value = rhs; return *this; } \ 895 bool operator==(const _type &rhs) const { return value == rhs.value; } \ 896 bool operator==(const _base &rhs) const { return value == rhs; } \ 768 isEqual(StringRef const lhs, StringRef const rhs) argument [all...] |
/external/stlport/test/eh/ |
H A D | test_algo.cpp | 61 SortBuffer( const SortBuffer& rhs ) 64 for ( const SortClass* p = rhs.begin() ; p != rhs.end(); p++,q++ )
|
/external/stlport/test/unit/ |
H A D | unordered_test.cpp | 537 bool operator () (Key lhs, Key rhs) const 538 { return lhs.m_data == rhs.m_data; } 540 bool operator () (Key lhs, int rhs) const 541 { return lhs.m_data == rhs; } 543 bool operator () (int lhs, Key rhs) const 544 { return lhs == rhs.m_data; } 558 bool operator () (Key const volatile *lhs, Key const volatile *rhs) const 559 { return lhs->m_data == rhs->m_data; } 561 bool operator () (Key const volatile *lhs, int rhs) const 562 { return lhs->m_data == rhs; } [all...] |
/external/valgrind/main/drd/ |
H A D | pub_drd_bitmap.h | 134 Bool DRD_(bm_equal)(struct bitmap* const lhs, struct bitmap* const rhs); 136 void DRD_(bm_merge2)(struct bitmap* const lhs, struct bitmap* const rhs); 141 void DRD_(bm_merge2_marked)(struct bitmap* const lhs, struct bitmap* const rhs);
|
/external/webrtc/src/system_wrappers/source/ |
H A D | map_unittest.cc | 138 bool CompareMaps(const MapWrapper& lhs, const MapWrapper& rhs) { argument 140 if (map_size != rhs.Size()) { 146 MapItem* rhs_item = rhs.Find(lhs_item->GetId());
|
/external/zlib/src/contrib/dotzlib/DotZLib/ |
H A D | UnitTests.cs | 30 public static bool byteArrEqual( byte[] lhs, byte[] rhs )
32 if (lhs.Length != rhs.Length)
35 if (lhs[i] != rhs[i])
|
/external/chromium/testing/gmock/test/ |
H A D | gmock-matchers_test.cc | 140 explicit GreaterThanMatcher(int rhs) : rhs_(rhs) {} argument 698 bool operator==(const Unprintable& /* rhs */) { return true; } 2813 AStruct(const AStruct& rhs) argument 2814 : x(rhs.x), y(rhs.y), z(rhs.z.value()), p(rhs.p) {} 3473 bool operator==(const NotCopyable& rhs) const { 3474 return value() == rhs 3927 vector<int> rhs; local 3942 list<signed char> rhs; local 3957 vector<int> rhs; local 3966 const int rhs[] = { 1, 2, 3 }; local 3977 const int rhs[1] = { 0 }; local 3988 const int rhs[3] = { 2, 6, 4 }; local 3997 const int rhs[3] = { 2, 4, 6 }; local 4004 const int rhs[3] = { 2, 4, 6 }; local [all...] |
/external/icu4c/i18n/ |
H A D | numfmt.cpp | 243 NumberFormat::operator=(const NumberFormat& rhs) argument 245 if (this != &rhs) 247 Format::operator=(rhs); 248 fGroupingUsed = rhs.fGroupingUsed; 249 fMaxIntegerDigits = rhs.fMaxIntegerDigits; 250 fMinIntegerDigits = rhs.fMinIntegerDigits; 251 fMaxFractionDigits = rhs.fMaxFractionDigits; 252 fMinFractionDigits = rhs.fMinFractionDigits; 253 fParseIntegerOnly = rhs.fParseIntegerOnly; 254 u_strncpy(fCurrency, rhs [all...] |
H A D | decimfmt.cpp | 719 DecimalFormat::operator=(const DecimalFormat& rhs) argument 721 if(this != &rhs) { 722 NumberFormat::operator=(rhs); 723 fPositivePrefix = rhs.fPositivePrefix; 724 fPositiveSuffix = rhs.fPositiveSuffix; 725 fNegativePrefix = rhs.fNegativePrefix; 726 fNegativeSuffix = rhs.fNegativeSuffix; 727 _copy_ptr(&fPosPrefixPattern, rhs.fPosPrefixPattern); 728 _copy_ptr(&fPosSuffixPattern, rhs.fPosSuffixPattern); 729 _copy_ptr(&fNegPrefixPattern, rhs [all...] |
/external/chromium/chrome/browser/sync/ |
H A D | profile_sync_service_typed_url_unittest.cc | 250 static bool URLsEqual(history::URLRow& lhs, history::URLRow& rhs) { argument 251 return (lhs.url().spec().compare(rhs.url().spec()) == 0) && 252 (lhs.title().compare(rhs.title()) == 0) && 253 (lhs.visit_count() == rhs.visit_count()) && 254 (lhs.typed_count() == rhs.typed_count()) && 255 (lhs.last_visit() == rhs.last_visit()) && 256 (lhs.hidden() == rhs.hidden());
|
/external/chromium/testing/gmock/include/gmock/ |
H A D | gmock-spec-builders.h | 495 // Returns true iff rhs references the same expectation as this object does. 496 bool operator==(const Expectation& rhs) const { 497 return expectation_base_ == rhs.expectation_base_; 500 bool operator!=(const Expectation& rhs) const { return !(*this == rhs); } 517 bool operator()(const Expectation& lhs, const Expectation& rhs) const { 518 return lhs.expectation_base_.get() < rhs.expectation_base_.get(); 578 // Returns true iff rhs contains the same set of Expectation objects 580 bool operator==(const ExpectationSet& rhs) const { 581 return expectations_ == rhs [all...] |
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | SymbolManager.cpp | 274 const SymExpr *rhs, 277 IntSymExpr::Profile(ID, lhs, op, rhs, t); 283 new (data) IntSymExpr(lhs, op, rhs, t); 292 const SymExpr *rhs, 295 SymSymExpr::Profile(ID, lhs, op, rhs, t); 301 new (data) SymSymExpr(lhs, op, rhs, t); 272 getIntSymExpr(const llvm::APSInt& lhs, BinaryOperator::Opcode op, const SymExpr *rhs, QualType t) argument 290 getSymSymExpr(const SymExpr *lhs, BinaryOperator::Opcode op, const SymExpr *rhs, QualType t) argument
|
/external/oprofile/pp/ |
H A D | opreport.cpp | 47 bool operator<(summary const & rhs) const { 49 ? counts[0] < rhs.counts[0] : rhs.counts[0] < counts[0]; 97 bool operator<(app_summary const & rhs) const { 99 ? counts[0] < rhs.counts[0] : rhs.counts[0] < counts[0];
|
/external/ceres-solver/internal/ceres/ |
H A D | schur_complement_solver.cc | 143 .solve(ConstVectorRef(rhs(), num_rows)); 291 ss_.CreateDenseVector(const_cast<double*>(rhs()), num_rows, num_rows); 331 << " rhs: " << (rhs_time - lhs_time) 365 VectorRef(solution, num_rows) = ConstVectorRef(rhs(), num_rows);
|
/external/bison/src/ |
H A D | print.c | 107 for (sp = rules[r].rhs; sp < sp1; sp++) 426 for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++) 450 for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++) 488 for (rhsp = rules[r].rhs; *rhsp >= 0; rhsp++)
|