OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:refX
(Results
1 - 8
of
8
) sorted by null
/external/skia/tests/
DrawTextTest.cpp
47
int
refX
= x + xOff;
50
if (
refX
>= 0 &&
refX
< ref.width() &&
53
refColor = ref.getColor(
refX
, refY);
FontHostStreamTest.cpp
50
int
refX
= x + xOff;
53
if (
refX
>= 0 &&
refX
< ref.width() &&
56
refColor = ref.getColor(
refX
, refY);
BlurTest.cpp
74
int
refX
= x + xOff;
77
if (
refX
>= 0 &&
refX
< ref.width() &&
80
refColor = ref.getColor(
refX
, refY);
/external/eigen/test/eigen2/
eigen2_sparse_product.cpp
75
DenseMatrix
refX
= DenseMatrix::Random(rows, rows);
98
VERIFY_IS_APPROX(x=mS*b,
refX
=refS*b);
99
VERIFY_IS_APPROX(x=mUp.template marked<UpperTriangular|SelfAdjoint>()*b,
refX
=refS*b);
100
VERIFY_IS_APPROX(x=mLo.template marked<LowerTriangular|SelfAdjoint>()*b,
refX
=refS*b);
101
VERIFY_IS_APPROX(x=mS.template marked<SelfAdjoint>()*b,
refX
=refS*b);
/external/eigen/test/
sparse_product.cpp
141
DenseMatrix
refX
= DenseMatrix::Random(rows, rows);
165
VERIFY_IS_APPROX(x=mS*b,
refX
=refS*b);
167
VERIFY_IS_APPROX(x=mUp.template selfadjointView<Upper>()*b,
refX
=refS*b);
168
VERIFY_IS_APPROX(x=mLo.template selfadjointView<Lower>()*b,
refX
=refS*b);
169
VERIFY_IS_APPROX(x=mS.template selfadjointView<Upper|Lower>()*b,
refX
=refS*b);
sparse_solver.h
19
DenseRhs
refX
= dA.lu().solve(db);
39
VERIFY(x.isApprox(
refX
,test_precision<Scalar>()));
59
VERIFY(x.isApprox(
refX
,test_precision<Scalar>()));
68
VERIFY(x.isApprox(
refX
,test_precision<Scalar>()));
73
void check_sparse_solving_real_cases(Solver& solver, const typename Solver::MatrixType& A, const Rhs& b, const Rhs&
refX
)
97
if(
refX
.size() != 0)
98
res_error = (
refX
- x).norm()/
refX
.norm();
215
check_sparse_solving_real_cases(solver, it.matrix(), it.rhs(), it.
refX
());
216
check_sparse_solving_real_cases(solver, halfA, it.rhs(), it.
refX
());
[
all
...]
/external/eigen/unsupported/Eigen/src/SparseExtra/
MatrixMarketIterator.h
129
* then
refX
is randomly generated such that A*
refX
= b
131
* Note that when a rhs is provided,
refX
is not available
133
inline VectorType&
refX
()
/external/eigen/bench/spbench/
spbenchsolver.h
126
Stats call_solver(Solver &solver, const typename Solver::MatrixType& A, const Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>&
refX
)
158
if(
refX
.size() != 0)
159
stat.rel_error = (
refX
- x).norm()/
refX
.norm();
180
Stats call_directsolver(Solver& solver, const typename Solver::MatrixType& A, const Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>&
refX
)
183
stat = call_solver(solver, A, b,
refX
);
188
Stats call_itersolver(Solver &solver, const typename Solver::MatrixType& A, const Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>&
refX
)
194
stat = call_solver(solver, A, b,
refX
);
287
int SelectSolvers(const SparseMatrix<Scalar>&A, unsigned int sym, Matrix<Scalar, Dynamic, 1>& b, const Matrix<Scalar, Dynamic, 1>&
refX
, Stats *stat)
298
stat[EIGEN_UMFPACK] = call_directsolver(solver, A, b,
refX
);
[
all
...]
Completed in 890 milliseconds