Searched refs:rhs (Results 176 - 200 of 467) sorted by relevance

1234567891011>>

/external/eigen/unsupported/Eigen/src/MatrixFunctions/
H A DMatrixSquareRoot.h174 Matrix<Scalar,1,2> rhs = T.template block<1,2>(i,j); local
176 rhs -= sqrtT.block(i, i+1, 1, j-i-1) * sqrtT.block(i+1, j, j-i-1, 2);
179 sqrtT.template block<1,2>(i,j).transpose() = A.fullPivLu().solve(rhs.transpose());
188 Matrix<Scalar,2,1> rhs = T.template block<2,1>(i,j); local
190 rhs -= sqrtT.block(i, i+2, 2, j-i-2) * sqrtT.block(i+2, j, j-i-2, 1);
193 sqrtT.template block<2,1>(i,j) = A.fullPivLu().solve(rhs);
236 Matrix<Scalar,4,1> rhs; local
237 rhs.coeffRef(0) = C.coeff(0,0);
238 rhs.coeffRef(1) = C.coeff(0,1);
239 rhs
[all...]
/external/emma/core/java12/com/vladium/emma/data/
H A DClassDescriptor.java72 public final boolean equals (final Object rhs) argument
74 if (! (rhs instanceof ClassDescriptor)) return false;
76 final ClassDescriptor _rhs = (ClassDescriptor) rhs;
/external/stlport/test/unit/
H A Dmap_test.cpp313 bool operator () (Key lhs, Key rhs) const
314 { return lhs.m_data < rhs.m_data; }
316 bool operator () (Key lhs, int rhs) const
317 { return lhs.m_data < rhs; }
319 bool operator () (int lhs, Key rhs) const
320 { return lhs < rhs.m_data; }
325 bool operator () (Key const volatile *lhs, Key const volatile *rhs) const
326 { return (*lhs).m_data < (*rhs).m_data; }
328 bool operator () (Key const volatile *lhs, int rhs) const
329 { return (*lhs).m_data < rhs; }
[all...]
/external/v8/src/
H A Ddata-flow.h107 BitVector& operator=(const BitVector& rhs) { argument
108 if (this != &rhs) CopyFrom(rhs);
/external/ceres-solver/internal/ceres/
H A Dtriplet_sparse_matrix.cc113 const TripletSparseMatrix& rhs) {
114 num_rows_ = rhs.num_rows_;
115 num_cols_ = rhs.num_cols_;
116 num_nonzeros_ = rhs.num_nonzeros_;
117 max_num_nonzeros_ = rhs.max_num_nonzeros_;
119 CopyData(rhs);
112 operator =( const TripletSparseMatrix& rhs) argument
H A Dblock_structure.cc37 bool CellLessThan(const Cell& lhs, const Cell& rhs) { argument
38 return (lhs.block_id < rhs.block_id);
H A Dgraph_algorithms.h51 bool operator()(const Vertex& lhs, const Vertex& rhs) const {
52 if (graph_.Neighbors(lhs).size() == graph_.Neighbors(rhs).size()) {
53 return lhs < rhs;
55 return graph_.Neighbors(lhs).size() < graph_.Neighbors(rhs).size();
H A Dimplicit_schur_complement.h132 const Vector& rhs() const { return rhs_; } function in class:ceres::internal::ImplicitSchurComplement
H A Dschur_eliminator_test.cc149 Vector rhs(schur_size);
164 eliminator->Eliminate(A.get(), b.get(), diagonal.data(), &lhs, rhs.data());
171 .solve(rhs);
186 EXPECT_NEAR((rhs - rhs_expected).norm() / rhs_expected.norm(), 0.0,
H A Dsparse_normal_cholesky_solver.cc191 cholmod_dense* rhs = ss_.CreateDenseVector(Atb.data(), num_cols, num_cols); local
212 cholmod_dense* sol = ss_.SolveCholesky(lhs.get(), factor_, rhs);
215 ss_.Free(rhs);
216 rhs = NULL;
H A Dtriplet_sparse_matrix.h57 TripletSparseMatrix& operator=(const TripletSparseMatrix& rhs);
/external/chromium/chrome/browser/sync/glue/
H A Dtyped_url_model_associator_unittest.cc51 static bool URLsEqual(history::URLRow& lhs, history::URLRow& rhs) { argument
52 return (lhs.url().spec().compare(rhs.url().spec()) == 0) &&
53 (lhs.title().compare(rhs.title()) == 0) &&
54 (lhs.visit_count() == rhs.visit_count()) &&
55 (lhs.typed_count() == rhs.typed_count()) &&
56 (lhs.hidden() == rhs.hidden());
/external/eigen/Eigen/src/Core/
H A DNoAlias.h78 { return m_expression.derived() += CoeffBasedProduct<Lhs,Rhs,NestByRefBit>(other.lhs(), other.rhs()); }
82 { return m_expression.derived() -= CoeffBasedProduct<Lhs,Rhs,NestByRefBit>(other.lhs(), other.rhs()); }
/external/eigen/Eigen/src/Core/products/
H A DGeneralMatrixMatrix_MKL.h100 Map<const MatrixX##EIGPREFIX, 0, OuterStride<> > rhs(_rhs,k,n,OuterStride<>(rhsStride)); \
101 b_tmp = rhs.conjugate(); \
H A DGeneralMatrixVector.h54 const RhsScalar* rhs, Index rhsIncr,
146 RhsPacket ptmp0 = pset1<RhsPacket>(alpha*rhs[i*rhsIncr]),
147 ptmp1 = pset1<RhsPacket>(alpha*rhs[(i+offset1)*rhsIncr]),
148 ptmp2 = pset1<RhsPacket>(alpha*rhs[(i+2)*rhsIncr]),
149 ptmp3 = pset1<RhsPacket>(alpha*rhs[(i+offset3)*rhsIncr]);
241 RhsPacket ptmp0 = pset1<RhsPacket>(alpha*rhs[k*rhsIncr]);
310 const RhsScalar* rhs, Index rhsIncr,
321 RhsPacket b = pload<RhsPacket>(&rhs[j]); \
341 Index alignedStart = internal::first_aligned(rhs, depth);
353 // find how many rows do we have to skip to be aligned with rhs (i
51 run( Index rows, Index cols, const LhsScalar* lhs, Index lhsStride, const RhsScalar* rhs, Index rhsIncr, ResScalar* res, Index resIncr , RhsScalar alpha) argument
307 run( Index rows, Index cols, const LhsScalar* lhs, Index lhsStride, const RhsScalar* rhs, Index rhsIncr, ResScalar* res, Index resIncr, ResScalar alpha) argument
[all...]
H A DGeneralMatrixMatrix.h30 const RhsScalar* rhs, Index rhsStride,
41 ::run(cols,rows,depth,rhs,rhsStride,lhs,lhsStride,res,resStride,alpha,blocking,info);
63 const_blas_data_mapper<RhsScalar, Index, RhsStorageOrder> rhs(_rhs,rhsStride);
90 // For each horizontal panel of the rhs, and corresponding vertical panel of the lhs...
108 pack_rhs(blockB+info[tid].rhs_start*actual_kc, &rhs(k,info[tid].rhs_start), rhsStride, actual_kc, info[tid].rhs_length);
160 // For each horizontal panel of the rhs, and corresponding panel of the lhs...
166 // OK, here we have selected one horizontal panel of rhs and one vertical panel of lhs.
167 // => Pack rhs's panel into a sequential chunk of memory (L2 caching)
170 pack_rhs(blockB, &rhs(k2,0), rhsStride, actual_kc, cols);
181 // micro vertical panel of the large rhs'
27 run( Index rows, Index cols, Index depth, const LhsScalar* lhs, Index lhsStride, const RhsScalar* rhs, Index rhsStride, ResScalar* res, Index resStride, ResScalar alpha, level3_blocking<RhsScalar,LhsScalar>& blocking, GemmParallelInfo<Index>* info = 0) argument
207 gemm_functor(const Lhs& lhs, const Rhs& rhs, Dest& dest, Scalar actualAlpha, BlockingType& blocking) argument
392 GeneralProduct(const Lhs& lhs, const Rhs& rhs) argument
403 typename internal::add_const_on_value_type<ActualRhsType>::type rhs = RhsBlasTraits::extract(m_rhs); local
[all...]
/external/eigen/test/
H A Djacobisvd.cpp85 RhsType rhs = RhsType::Random(rows, internal::random<Index>(1, cols)); local
87 SolutionType x = svd.solve(rhs);
89 VERIFY_IS_APPROX(m.adjoint()*m*x,m.adjoint()*rhs);
153 RhsType rhs(rows);
159 VERIFY_RAISES_ASSERT(svd.solve(rhs))
167 VERIFY_RAISES_ASSERT(svd.solve(rhs))
174 VERIFY_RAISES_ASSERT(svd.solve(rhs))
179 VERIFY_RAISES_ASSERT(svd.solve(rhs))
/external/icu4c/i18n/
H A Ddcfmtsym.cpp105 DecimalFormatSymbols::operator=(const DecimalFormatSymbols& rhs) argument
107 if (this != &rhs) {
110 fSymbols[(ENumberFormatSymbol)i].fastCopyFrom(rhs.fSymbols[(ENumberFormatSymbol)i]);
113 currencySpcBeforeSym[i].fastCopyFrom(rhs.currencySpcBeforeSym[i]);
114 currencySpcAfterSym[i].fastCopyFrom(rhs.currencySpcAfterSym[i]);
116 locale = rhs.locale;
117 uprv_strcpy(validLocale, rhs.validLocale);
118 uprv_strcpy(actualLocale, rhs.actualLocale);
/external/webkit/Source/JavaScriptCore/wtf/unicode/icu/
H A DCollatorICU.cpp92 Collator::Result Collator::collate(const UChar* lhs, size_t lhsLength, const UChar* rhs, size_t rhsLength) const argument
97 return static_cast<Result>(ucol_strcoll(m_collator, lhs, lhsLength, rhs, rhsLength));
/external/chromium/testing/gtest/include/gtest/internal/
H A Dgtest-internal.h399 // rhs. In particular, this function:
404 bool AlmostEquals(const FloatingPoint& rhs) const {
407 if (is_nan() || rhs.is_nan()) return false;
409 return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_)
946 bool ArrayEq(const T* lhs, size_t size, const U* rhs);
950 inline bool ArrayEq(const T& lhs, const U& rhs) { return lhs == rhs; } argument
954 inline bool ArrayEq(const T(&lhs)[N], const U(&rhs)[N]) {
955 return internal::ArrayEq(lhs, N, rhs);
962 bool ArrayEq(const T* lhs, size_t size, const U* rhs) { argument
1038 NativeArray(const NativeArray& rhs) argument
[all...]
/external/gtest/include/gtest/internal/
H A Dgtest-internal.h405 // rhs. In particular, this function:
410 bool AlmostEquals(const FloatingPoint& rhs) const {
413 if (is_nan() || rhs.is_nan()) return false;
415 return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_)
953 bool ArrayEq(const T* lhs, size_t size, const U* rhs);
957 inline bool ArrayEq(const T& lhs, const U& rhs) { return lhs == rhs; } argument
961 inline bool ArrayEq(const T(&lhs)[N], const U(&rhs)[N]) {
962 return internal::ArrayEq(lhs, N, rhs);
969 bool ArrayEq(const T* lhs, size_t size, const U* rhs) { argument
1045 NativeArray(const NativeArray& rhs) argument
[all...]
/external/libvpx/libvpx/third_party/googletest/src/include/gtest/internal/
H A Dgtest-internal.h405 // rhs. In particular, this function:
410 bool AlmostEquals(const FloatingPoint& rhs) const {
413 if (is_nan() || rhs.is_nan()) return false;
415 return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_)
953 bool ArrayEq(const T* lhs, size_t size, const U* rhs);
957 inline bool ArrayEq(const T& lhs, const U& rhs) { return lhs == rhs; } argument
961 inline bool ArrayEq(const T(&lhs)[N], const U(&rhs)[N]) {
962 return internal::ArrayEq(lhs, N, rhs);
969 bool ArrayEq(const T* lhs, size_t size, const U* rhs) { argument
1045 NativeArray(const NativeArray& rhs) argument
[all...]
/external/llvm/utils/unittest/googletest/include/gtest/internal/
H A Dgtest-internal.h433 // rhs. In particular, this function:
438 bool AlmostEquals(const FloatingPoint& rhs) const {
441 if (is_nan() || rhs.is_nan()) return false;
443 return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_)
981 bool ArrayEq(const T* lhs, size_t size, const U* rhs);
985 inline bool ArrayEq(const T& lhs, const U& rhs) { return lhs == rhs; } argument
989 inline bool ArrayEq(const T(&lhs)[N], const U(&rhs)[N]) {
990 return internal::ArrayEq(lhs, N, rhs);
997 bool ArrayEq(const T* lhs, size_t size, const U* rhs) { argument
1073 NativeArray(const NativeArray& rhs) argument
[all...]
/external/valgrind/main/drd/
H A Ddrd_bitmap.c945 * Return True if the two bitmaps *lhs and *rhs are identical, and false
948 Bool DRD_(bm_equal)(struct bitmap* const lhs, struct bitmap* const rhs) argument
954 /* so complain if lhs == rhs. */
955 tl_assert(lhs != rhs);
958 VG_(OSetGen_ResetIter)(rhs->oset);
975 bm2r = VG_(OSetGen_Next)(rhs->oset);
979 while (! DRD_(bm_has_any_access)(rhs,
984 tl_assert(DRD_(bm_has_any_access)(rhs,
998 bm2r = VG_(OSetGen_Next)(rhs->oset);
999 } while (bm2r && ! DRD_(bm_has_any_access)(rhs,
1020 bm_merge2(struct bitmap* const lhs, struct bitmap* const rhs) argument
1111 bm_merge2_marked(struct bitmap* const lhs, struct bitmap* const rhs) argument
1162 bm_has_races(struct bitmap* const lhs, struct bitmap* const rhs) argument
[all...]
/external/chromium/chrome/browser/profiles/
H A Dprofile_keyed_service_factory.h61 void DependsOn(ProfileKeyedServiceFactory* rhs);

Completed in 1163 milliseconds

1234567891011>>