/external/swiftshader/src/Shader/ |
H A D | ShaderCore.hpp | 29 Vector4s(const Vector4s &rhs); 32 Vector4s &operator=(const Vector4s &rhs); 45 Vector4i(const Vector4i &rhs); 48 Vector4i &operator=(const Vector4i &rhs); 61 Vector4u(const Vector4u &rhs); 64 Vector4u &operator=(const Vector4u &rhs); 77 Vector4f(const Vector4f &rhs); 80 Vector4f &operator=(const Vector4f &rhs); 144 Register &operator=(const Register &rhs) argument 146 x = rhs 154 operator =(const Vector4f &rhs) argument [all...] |
/external/swiftshader/third_party/LLVM/test/CodeGen/CellSPU/useful-harnesses/ |
H A D | i64operations.h | 12 int64_t *rhs; member in struct:harness_int64_pred 22 uint64_t *rhs; member in struct:harness_uint64_pred
|
/external/swiftshader/third_party/LLVM/utils/unittest/googletest/include/gtest/internal/ |
H A D | gtest-string.h | 134 static bool CStringEquals(const char* lhs, const char* rhs); 152 static bool WideCStringEquals(const wchar_t* lhs, const wchar_t* rhs); 161 const char* rhs); 176 const wchar_t* rhs); 244 // Returns < 0 if this is less than rhs, 0 if this is equal to rhs, or > 0 245 // if this is greater than rhs. 246 int Compare(const String& rhs) const; 254 bool operator<(const String& rhs) const { return Compare(rhs) < 283 operator =(const String& rhs) argument [all...] |
/external/v8/src/base/ |
H A D | safe_math.h | 56 CheckedNumeric(const CheckedNumeric<Src>& rhs) argument 57 : state_(rhs.ValueUnsafe(), rhs.validity()) {} 117 template <typename Src> CheckedNumeric& operator+=(Src rhs); 118 template <typename Src> CheckedNumeric& operator-=(Src rhs); 119 template <typename Src> CheckedNumeric& operator*=(Src rhs); 120 template <typename Src> CheckedNumeric& operator/=(Src rhs); 121 template <typename Src> CheckedNumeric& operator%=(Src rhs); 202 const CheckedNumeric<T>& lhs, const CheckedNumeric<T>& rhs) { \ 206 return CheckedNumeric<T>(lhs.ValueUnsafe() OP rhs [all...] |
/external/v8/src/compiler/ |
H A D | machine-operator-reducer.h | 43 Node* Float64Mul(Node* lhs, Node* rhs); 45 Node* Word32And(Node* lhs, Node* rhs); 46 Node* Word32And(Node* lhs, uint32_t rhs) { argument 47 return Word32And(lhs, Uint32Constant(rhs)); 49 Node* Word32Sar(Node* lhs, uint32_t rhs); 50 Node* Word32Shr(Node* lhs, uint32_t rhs); 51 Node* Word32Equal(Node* lhs, Node* rhs); 52 Node* Int32Add(Node* lhs, Node* rhs); 53 Node* Int32Sub(Node* lhs, Node* rhs); 54 Node* Int32Mul(Node* lhs, Node* rhs); [all...] |
/external/webrtc/webrtc/system_wrappers/include/ |
H A D | tick_util.h | 65 // Returns a TickInterval that is the difference in ticks beween rhs and lhs. 66 friend TickInterval operator-(const TickTime& lhs, const TickTime& rhs); 85 const TickInterval& rhs); 86 TickInterval& operator+=(const TickInterval& rhs); 88 // Returns a TickInterval corresponding to rhs - lhs. 90 const TickInterval& rhs); 91 TickInterval& operator-=(const TickInterval& rhs); 93 friend bool operator>(const TickInterval& lhs, const TickInterval& rhs); 94 friend bool operator<=(const TickInterval& lhs, const TickInterval& rhs); 95 friend bool operator<(const TickInterval& lhs, const TickInterval& rhs); 114 operator +(const TickInterval& lhs, const TickInterval& rhs) argument 119 operator -(const TickInterval& lhs, const TickInterval& rhs) argument 124 operator -(const TickTime& lhs, const TickTime& rhs) argument 134 operator >(const TickInterval& lhs, const TickInterval& rhs) argument 138 operator <=(const TickInterval& lhs, const TickInterval& rhs) argument 142 operator <(const TickInterval& lhs, const TickInterval& rhs) argument 146 operator >=(const TickInterval& lhs, const TickInterval& rhs) argument 178 operator +=(const TickInterval& rhs) argument 183 operator -=(const TickInterval& rhs) argument [all...] |
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/util/ |
H A D | PixelUtils.java | 52 public static PointF add(PointF lhs, PointF rhs) {
argument 53 return new PointF(lhs.x + rhs.x, lhs.y + rhs.y);
56 public static PointF sub(PointF lhs, PointF rhs) {
argument 57 return new PointF(lhs.x - rhs.x, lhs.y - rhs.y);
|
/external/bison/src/ |
H A D | gram.h | 58 RULES[R].rhs -- the index in RITEM of the beginning of the portion 184 item_number *rhs; member in struct:__anon595
|
/external/clang/test/SemaCXX/ |
H A D | warn-unused-value.cpp | 27 bool operator==(const Foo& rhs) { argument 28 return i == rhs.i;
|
/external/dng_sdk/source/ |
H A D | dng_hue_sat_map.cpp | 58 dng_hue_sat_map &dng_hue_sat_map::operator= (const dng_hue_sat_map &rhs) argument 61 if (this != &rhs) 64 if (!rhs.IsValid ()) 74 fHueDivisions = rhs.fHueDivisions; 75 fSatDivisions = rhs.fSatDivisions; 76 fValDivisions = rhs.fValDivisions; 78 fHueStep = rhs.fHueStep; 79 fValStep = rhs.fValStep; 81 fDeltas = rhs.fDeltas; 242 bool dng_hue_sat_map::operator== (const dng_hue_sat_map &rhs) cons [all...] |
/external/eigen/Eigen/src/Core/ |
H A D | CwiseBinaryOp.h | 135 const _RhsNested& rhs() const { return m_rhs; } function in class:Eigen::CwiseBinaryOp
|
H A D | Solve.h | 68 Solve(const Decomposition &dec, const RhsType &rhs) argument 69 : m_dec(dec), m_rhs(rhs) 76 EIGEN_DEVICE_FUNC const RhsType& rhs() const { return m_rhs; } function in class:Eigen::Solve 127 solve.dec()._solve_impl(solve.rhs(), m_result); 134 // Specialization for "dst = dec.solve(rhs)" 147 src.dec()._solve_impl(src.rhs(), dst); 151 // Specialization for "dst = dec.transpose().solve(rhs)" 163 src.dec().nestedExpression().template _solve_impl_transposed<false>(src.rhs(), dst); 167 // Specialization for "dst = dec.adjoint().solve(rhs)" 180 src.dec().nestedExpression().nestedExpression().template _solve_impl_transposed<true>(src.rhs(), ds [all...] |
/external/eigen/Eigen/src/Geometry/arch/ |
H A D | Geometry_SSE.h | 56 run(const VectorLhs& lhs, const VectorRhs& rhs) argument 59 __m128 b = rhs.template packet<traits<VectorRhs>::Alignment>(0);
|
/external/eigen/Eigen/src/IterativeLinearSolvers/ |
H A D | SolveWithGuess.h | 49 SolveWithGuess(const Decomposition &dec, const RhsType &rhs, const GuessType &guess) argument 50 : m_dec(dec), m_rhs(rhs), m_guess(guess) 57 EIGEN_DEVICE_FUNC const RhsType& rhs() const { return m_rhs; } function in class:Eigen::SolveWithGuess 86 solve.dec()._solve_with_guess_impl(solve.rhs(), m_result); 93 // Specialization for "dst = dec.solveWithGuess(rhs)" 107 src.dec()._solve_with_guess_impl(src.rhs(), dst/*, src.guess()*/);
|
/external/eigen/Eigen/src/SparseCore/ |
H A D | ConservativeSparseSparseProduct.h | 18 static void conservative_sparse_sparse_product_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res, bool sortedInsertion = false) argument 24 Index cols = rhs.outerSize(); 25 eigen_assert(lhs.outerSize() == rhs.innerSize()); 34 evaluator<Rhs> rhsEval(rhs); 37 // given a rhs column containing Y non zeros, we assume that the respective Y columns 39 // the product of a rhs column with the lhs is X+Y where X is the average number of non zero 41 // Therefore, we have nnz(lhs*rhs) = nnz(lhs) + nnz(rhs) 137 static void run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument 146 if(lhs.rows()>rhs 167 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument 180 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument 193 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument 208 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument 220 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument 233 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument 246 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument 264 sparse_sparse_to_dense_product_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument 302 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument 311 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument 322 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument 333 run(const Lhs& lhs, const Rhs& rhs, ResultType& res) argument [all...] |
H A D | SparseProduct.h | 41 static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs) argument 43 evalTo(dst, lhs, rhs, typename evaluator_traits<Dest>::Shape()); 48 static void addTo(Dest& dst, const ActualLhs& lhs, const Rhs& rhs, typename enable_if<is_same<typename evaluator_traits<Dest>::Shape,DenseShape>::value,int*>::type* = 0) argument 53 RhsNested rhsNested(rhs); 60 static void subTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, typename enable_if<is_same<typename evaluator_traits<Dest>::Shape,DenseShape>::value,int*>::type* = 0) argument 62 addTo(dst, -lhs, rhs); 69 static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, SparseShape) argument 74 RhsNested rhsNested(rhs); 81 static void evalTo(Dest& dst, const Lhs& lhs, const Rhs& rhs, DenseShape) argument 84 addTo(dst, lhs, rhs); [all...] |
H A D | SparseTriangularView.h | 52 EIGEN_STRONG_INLINE void _solve_impl(const RhsType &rhs, DstType &dst) const { argument 53 if(!(internal::is_same<RhsType,DstType>::value && internal::extract_data(dst) == internal::extract_data(rhs))) 54 dst = rhs;
|
/external/eigen/doc/examples/ |
H A D | matrixfree_cg.cpp | 65 static void scaleAndAddTo(Dest& dst, const MatrixReplacement& lhs, const Rhs& rhs, const Scalar& alpha) argument 67 // This method should implement "dst += alpha * lhs * rhs" inplace, 71 // Here we could simply call dst.noalias() += lhs.my_matrix() * rhs, 74 dst += rhs(i) * lhs.my_matrix().col(i);
|
/external/eigen/test/ |
H A D | svd_common.h | 116 RhsType rhs = RhsType::Random(rows, internal::random<Index>(1, cols)); local 122 SolutionType x = svd.solve(rhs); 124 RealScalar residual = (m*x-rhs).norm(); 125 RealScalar rhs_norm = rhs.norm(); 126 if(!test_isMuchSmallerThan(residual,rhs.norm())) 138 VERIFY_IS_APPROX(m.adjoint()*(m*x),m.adjoint()*rhs); 150 RealScalar residual_y = (m*y-rhs).norm(); 157 residual_y = (m*y-rhs).norm(); 450 RhsType rhs(rows); 455 VERIFY_RAISES_ASSERT(svd.solve(rhs)) [all...] |
/external/eigen/unsupported/Eigen/CXX11/src/util/ |
H A D | EmulateArray.h | 183 EIGEN_DEVICE_FUNC bool operator==(const array<T,N>& lhs, const array<T,N>& rhs) { argument 185 if (lhs[i] != rhs[i]) {
|
/external/emma/core/java12/com/vladium/emma/data/ |
H A D | ClassDescriptor.java | 72 public final boolean equals (final Object rhs) argument 74 if (! (rhs instanceof ClassDescriptor)) return false; 76 final ClassDescriptor _rhs = (ClassDescriptor) rhs;
|
H A D | MetaData.java | 164 * note: rhs entries must override current entries 166 public IMergeable merge (final IMergeable rhs) argument 168 if ((rhs == null) || rhs.isEmpty () || (rhs == this)) 172 final MetaData rhsmdata = (MetaData) rhs; // TODO: redesign to avoid this cast? 175 // rhs entries always override existing content:
|
/external/emma/core/java12/com/vladium/emma/report/html/doc/ |
H A D | Attribute.java | 42 public abstract boolean equals (final Object rhs); argument 59 public boolean equals (final Object rhs) argument 61 if (this == rhs) return true; 62 if (! (rhs instanceof AttributeImpl)) return false; 64 return m_name.equals (((AttributeImpl) rhs).m_name);
|
/external/icu/android_icu4j/src/main/java/android/icu/impl/duration/ |
H A D | Period.java | 242 * Returns true if rhs extends Period and 244 * @param rhs the object to compare to 245 * @return true if rhs is a Period and is equal to this 248 public boolean equals(Object rhs) { argument 250 return equals((Period)rhs); 264 * @param rhs the period to compare to 267 public boolean equals(Period rhs) { argument 268 if (rhs != null && 269 this.timeLimit == rhs.timeLimit && 270 this.inFuture == rhs [all...] |
/external/icu/icu4c/source/common/ |
H A D | pluralmap.h | 237 * Returns TRUE if this object equals rhs. 240 const PluralMap<T> &rhs, 243 if (fVariants[i] == rhs.fVariants[i]) { 246 if (fVariants[i] == NULL || rhs.fVariants[i] == NULL) { 249 if (!eqFunc(*fVariants[i], *rhs.fVariants[i])) { 239 equals( const PluralMap<T> &rhs, UBool (*eqFunc)(const T &, const T &)) const argument
|