HomeSort by relevance Sort by last modified time
    Searched refs:rhs (Results 276 - 300 of 848) sorted by null

<<11121314151617181920>>

  /frameworks/base/libs/hwui/
RenderBufferCache.cpp 81 const RenderBufferCache::RenderBufferEntry& rhs) {
82 int deltaInt = int(lhs.mWidth) - int(rhs.mWidth);
85 deltaInt = int(lhs.mHeight) - int(rhs.mHeight);
88 return int(lhs.mFormat) - int(rhs.mFormat);
  /frameworks/base/libs/hwui/utils/
SortedListImpl.cpp 29 SortedListImpl::SortedListImpl(const VectorImpl& rhs): VectorImpl(rhs) {
35 SortedListImpl& SortedListImpl::operator =(const SortedListImpl& rhs) {
37 (VectorImpl::operator =(static_cast<const VectorImpl&> (rhs)));
  /frameworks/compile/mclinker/include/mcld/Support/
FileSystem.h 68 inline bool operator==(const FileStatus& rhs, const FileStatus& lhs) {
69 return rhs.type() == lhs.type();
72 inline bool operator!=(const FileStatus& rhs, const FileStatus& lhs ) {
73 return !(rhs == lhs);
  /libcore/luni/src/main/java/libcore/icu/
RuleBasedCollatorICU.java 141 RuleBasedCollatorICU rhs = (RuleBasedCollatorICU) object; local
142 return getRules().equals(rhs.getRules()) &&
143 getStrength() == rhs.getStrength() &&
144 getDecomposition() == rhs.getDecomposition();
  /ndk/sources/cxx-stl/llvm-libc++/test/numerics/complex.number/complex.ops/
complex_divide_complex.pass.cpp 14 // operator/(const complex<T>& lhs, const complex<T>& rhs);
23 test(const std::complex<T>& lhs, const std::complex<T>& rhs, std::complex<T> x)
25 assert(lhs / rhs == x);
33 std::complex<T> rhs(1.5, 2.5);
35 test(lhs, rhs, x);
complex_times_complex.pass.cpp 14 // operator*(const complex<T>& lhs, const complex<T>& rhs);
23 test(const std::complex<T>& lhs, const std::complex<T>& rhs, std::complex<T> x)
25 assert(lhs * rhs == x);
33 std::complex<T> rhs(1.5, 2.5);
35 test(lhs, rhs, x);
  /system/core/libpixelflinger/codeflinger/tinyutils/
VectorImpl.cpp 51 VectorImpl::VectorImpl(const VectorImpl& rhs)
52 : mStorage(rhs.mStorage), mCount(rhs.mCount),
53 mFlags(rhs.mFlags), mItemSize(rhs.mItemSize)
70 VectorImpl& VectorImpl::operator = (const VectorImpl& rhs)
72 ALOG_ASSERT(mItemSize == rhs.mItemSize,
73 "Vector<> have different types (this=%p, rhs=%p)", this, &rhs);
74 if (this != &rhs) {
    [all...]
Vector.h 52 Vector(const Vector<TYPE>& rhs);
56 const Vector<TYPE>& operator = (const Vector<TYPE>& rhs) const;
57 Vector<TYPE>& operator = (const Vector<TYPE>& rhs);
156 typedef int (*compar_t)(const TYPE* lhs, const TYPE* rhs);
157 typedef int (*compar_r_t)(const TYPE* lhs, const TYPE* rhs, void* state);
188 Vector<TYPE>::Vector(const Vector<TYPE>& rhs)
189 : VectorImpl(rhs) {
198 Vector<TYPE>& Vector<TYPE>::operator = (const Vector<TYPE>& rhs) {
199 VectorImpl::operator = (rhs);
204 const Vector<TYPE>& Vector<TYPE>::operator = (const Vector<TYPE>& rhs) const
    [all...]
  /external/clang/lib/StaticAnalyzer/Core/
SimpleSValBuilder.cpp 37 NonLoc lhs, NonLoc rhs, QualType resultTy);
39 Loc lhs, Loc rhs, QualType resultTy);
41 Loc lhs, NonLoc rhs, QualType resultTy);
48 const llvm::APSInt &RHS, QualType resultTy);
212 const llvm::APSInt &RHS,
223 if (RHS == 0)
225 else if (RHS == 1)
230 if (RHS == 0)
233 else if (RHS == 1)
238 if (RHS == 0
    [all...]
  /external/bison/src/
gram.c 95 for (rhsp = r->rhs; *rhsp >= 0; ++rhsp)
103 if (*r->rhs >= 0)
106 for (rp = r->rhs; *rp >= 0; rp++)
119 if (*r->rhs >= 0)
122 xml_puts (out, level, "<rhs>");
123 for (rp = r->rhs; *rp >= 0; rp++)
126 xml_puts (out, level, "</rhs>");
130 xml_puts (out, level, "<rhs>");
132 xml_puts (out, level, "</rhs>");
180 /* rule # : LHS -> RHS */
    [all...]
parse-gram.y 38 #define YYLLOC_DEFAULT(Current, Rhs, N) (Current) = lloc_default (Rhs, N)
568 rhs { grammar_current_rule_end (@1); }
569 | rhses.1 "|" rhs { grammar_current_rule_end (@3); }
573 rhs: label
577 | rhs symbol named_ref.opt
579 | rhs "{...}" named_ref.opt
581 | rhs "%prec" symbol
583 | rhs "%dprec" INT
585 | rhs "%merge" TYP
    [all...]
  /external/ceres-solver/internal/ceres/
dense_normal_cholesky_solver.cc 68 // rhs = A'b
69 Vector rhs = Aref.transpose() * ConstVectorRef(b, num_rows); local
77 lhs.selfadjointView<Eigen::Upper>().ldlt().solve(rhs);
  /external/chromium/chrome/browser/
memory_details.h 52 ProcessData(const ProcessData& rhs);
54 ProcessData& operator=(const ProcessData& rhs);
  /external/chromium/chrome/browser/ui/views/autocomplete/
autocomplete_result_view.h 77 static bool SortRunsLogically(const RunData& lhs, const RunData& rhs);
78 static bool SortRunsVisually(const RunData& lhs, const RunData& rhs);
  /external/chromium/net/proxy/
proxy_bypass_rules.h 47 ProxyBypassRules(const ProxyBypassRules& rhs);
49 ProxyBypassRules& operator=(const ProxyBypassRules& rhs);
  /external/clang/test/SemaTemplate/
ms-lookup-template-base-classes.cpp 163 bool operator=(const Container<S>& rhs) {
164 return base_fun(rhs); // expected-warning {{use of identifier 'base_fun' found via unqualified lookup into dependent bases of class templates is a Microsoft extension}}
  /external/eigen/Eigen/src/SparseCore/
SparseDiagonalProduct.h 29 template<typename Lhs, typename Rhs>
30 struct traits<SparseDiagonalProduct<Lhs, Rhs> >
33 typedef typename remove_all<Rhs>::type _Rhs;
36 typename traits<Rhs>::Index>::type Index;
53 template<typename Lhs, typename Rhs, typename SparseDiagonalProductType, int RhsMode, int LhsMode>
58 template<typename Lhs, typename Rhs>
60 : public SparseMatrixBase<SparseDiagonalProduct<Lhs,Rhs> >,
64 typedef typename Rhs::Nested RhsNested;
83 EIGEN_STRONG_INLINE SparseDiagonalProduct(const Lhs& lhs, const Rhs& rhs)
93 EIGEN_STRONG_INLINE const _RhsNested& rhs() const { return m_rhs; } function in class:Eigen::SparseDiagonalProduct
    [all...]
  /external/kernel-headers/original/linux/
compat.h 208 struct compat_timeval *rhs)
210 if (lhs->tv_sec < rhs->tv_sec)
212 if (lhs->tv_sec > rhs->tv_sec)
214 return lhs->tv_usec - rhs->tv_usec;
218 struct compat_timespec *rhs)
220 if (lhs->tv_sec < rhs->tv_sec)
222 if (lhs->tv_sec > rhs->tv_sec)
224 return lhs->tv_nsec - rhs->tv_nsec;
  /external/marisa-trie/lib/marisa/
range.h 82 inline bool operator>(const WRange &lhs, const WRange &rhs) {
83 return lhs.weight() > rhs.weight();
  /external/marisa-trie/v0_1_5/lib/marisa_alpha/
range.h 82 inline bool operator>(const WRange &lhs, const WRange &rhs) {
83 return lhs.weight() > rhs.weight();
  /external/webkit/Source/WebKit/android/WebCoreSupport/
WebResponse.h 78 bool operator()(const std::string& lhs, const std::string& rhs) const {
79 return strcasecmp(lhs.c_str(), rhs.c_str()) < 0;
  /frameworks/base/cmds/bootanimation/
BootAnimation.h 64 bool operator < (const Frame& rhs) const {
65 return name < rhs.name;
  /frameworks/rs/
rsMatrix3x3.cpp 48 void Matrix3x3::loadMultiply(const rs_matrix3x3 *lhs, const rs_matrix3x3 *rhs) {
54 const float rhs_ij = ((const Matrix3x3 *)rhs)->get(i, j);
  /frameworks/volley/src/com/android/volley/toolbox/
ByteArrayPool.java 71 public int compare(byte[] lhs, byte[] rhs) {
72 return lhs.length - rhs.length;
  /libcore/luni/src/main/java/java/lang/
Boolean.java 129 * @return 0 if lhs = rhs, less than 0 if lhs &lt; rhs, and greater than 0 if lhs &gt; rhs.
134 public static int compare(boolean lhs, boolean rhs) {
135 return lhs == rhs ? 0 : lhs ? 1 : -1;

Completed in 1500 milliseconds

<<11121314151617181920>>