| /external/eigen/doc/snippets/ |
| SelfAdjointView_operatorNorm.cpp | 3 << ones.selfadjointView<Lower>().operatorNorm() << endl;
|
| SelfAdjointView_eigenvalues.cpp | 2 VectorXd eivals = ones.selfadjointView<Lower>().eigenvalues();
|
| /external/llvm/lib/Support/ |
| ConstantRange.cpp | 11 // for an integral value. This keeps track of a lower and upper bound for the
13 // keeps track of a [lower, upper) bound, which specifies an interval just like
34 Lower = Upper = APInt::getMaxValue(BitWidth);
36 Lower = Upper = APInt::getMinValue(BitWidth);
41 ConstantRange::ConstantRange(const APInt &V) : Lower(V), Upper(V + 1) {}
44 Lower(L), Upper(U) {
48 "Lower == Upper, but they aren't min or max value!");
119 return Lower == Upper && Lower.isMaxValue();
125 return Lower == Upper && Lower.isMinValue()
[all...] |
| /external/llvm/include/llvm/Support/ |
| ConstantRange.h | 11 // for an integral value. This keeps track of a lower and upper bound for the
13 // keeps track of a [lower, upper) bound, which specifies an interval just like
43 APInt Lower, Upper;
55 /// Lower==Upper and Lower != Min or Max value for its type. It will also
57 ConstantRange(const APInt &Lower, const APInt &Upper);
69 /// getLower - Return the lower value for this range...
71 const APInt &getLower() const { return Lower; }
79 uint32_t getBitWidth() const { return Lower.getBitWidth(); }
112 if (Upper == Lower + 1
[all...] |
| /external/eigen/test/ |
| cholmod_support.cpp | 16 CholmodDecomposition<SparseMatrix<T>, Lower> g_chol_colmajor_lower; g_chol_colmajor_lower.setMode(CholmodSupernodalLLt);
18 CholmodDecomposition<SparseMatrix<T>, Lower> g_llt_colmajor_lower; g_llt_colmajor_lower.setMode(CholmodSimplicialLLt);
20 CholmodDecomposition<SparseMatrix<T>, Lower> g_ldlt_colmajor_lower; g_ldlt_colmajor_lower.setMode(CholmodLDLt);
23 CholmodSupernodalLLT<SparseMatrix<T>, Lower> chol_colmajor_lower;
25 CholmodSimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower;
27 CholmodSimplicialLDLT<SparseMatrix<T>, Lower> ldlt_colmajor_lower;
|
| sparse_permutations.cpp | 33 lo = mat.template triangularView<Lower>();
36 lo_sym_d = mat_d.template selfadjointView<Lower>();
40 VERIFY_IS_APPROX(lo, DenseMatrix(mat_d.template triangularView<Lower>()));
72 res = mat.template selfadjointView<Lower>().twistedBy(p_null);
74 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full");
81 res = lo.template selfadjointView<Lower>().twistedBy(p_null);
83 VERIFY(res.isApprox(res_d) && "lower selfadjoint full");
90 res = mat.template selfadjointView<Lower>();
92 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full");
98 res = lo.template selfadjointView<Lower>();
[all...] |
| simplicial_cholesky.cpp | 14 SimplicialCholesky<SparseMatrix<T>, Lower> chol_colmajor_lower;
16 SimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower;
18 SimplicialLDLT<SparseMatrix<T>, Lower> ldlt_colmajor_lower;
|
| conjugate_gradient.cpp | 15 ConjugateGradient<SparseMatrix<T>, Lower> cg_colmajor_lower_diag;
17 ConjugateGradient<SparseMatrix<T>, Lower, IdentityPreconditioner> cg_colmajor_lower_I;
|
| selfadjoint.cpp | 35 m3 = m1.template selfadjointView<Lower>();
36 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangularView<Lower>()));
42 Matrix3d m = Matrix3d::Random().selfadjointView<Lower>();
|
| eigensolver_selfadjoint.cpp | 49 VERIFY((symmA.template selfadjointView<Lower>() * eiSymm.eigenvectors()).isApprox(
51 VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiSymm.eigenvalues());
54 VERIFY((symmA.template selfadjointView<Lower>() * eiDirect.eigenvectors()).isApprox(
56 VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiDirect.eigenvalues());
65 VERIFY((symmA.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox(
66 symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));
71 VERIFY((symmB.template selfadjointView<Lower>() * (symmA.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(
77 VERIFY((symmA.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox
[all...] |
| product_mmtr.cpp | 40 CHECK_MMTR(matc, Lower, = s*soc*sor.adjoint());
42 CHECK_MMTR(matr, Lower, = s*soc*soc.adjoint());
45 CHECK_MMTR(matc, Lower, += s*soc*soc.adjoint());
47 CHECK_MMTR(matr, Lower, += s*sor*soc.adjoint());
50 CHECK_MMTR(matc, Lower, -= s*soc*soc.adjoint());
52 CHECK_MMTR(matr, Lower, -= s*soc*soc.adjoint());
|
| product_symm.cpp | 38 m2 = m1.template triangularView<Lower>();
39 m3 = m2.template selfadjointView<Lower>();
41 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1),
50 m2 = m1.template triangularView<Lower>();
51 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
59 VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
63 m2 = m1.template triangularView<Lower>(); rhs12.setRandom(); rhs13 = rhs12;
64 VERIFY_IS_APPROX(rhs12 -= (s1*m2).template selfadjointView<Lower>() * (s2*rhs3),
68 VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate(),
73 VERIFY_IS_APPROX(rhs12.noalias() += s1 * ((m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate())
[all...] |
| pardiso_support.cpp | 10 PardisoLLT < SparseMatrix<T, RowMajor>, Lower> pardiso_llt_lower;
12 PardisoLDLT < SparseMatrix<T, RowMajor>, Lower> pardiso_ldlt_lower;
|
| pastix_support.cpp | 17 PastixLLT< SparseMatrix<T, ColMajor>, Eigen::Lower > pastix_llt_lower;
18 PastixLDLT< SparseMatrix<T, ColMajor>, Eigen::Lower > pastix_ldlt_lower;
|
| product_syrk.cpp | 36 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()),
37 ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
44 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(),
45 (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix());
52 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs3.adjoint(),s1)._expression(),
53 (s1 * rhs3.adjoint() * rhs3).eval().template triangularView<Lower>().toDenseMatrix());
60 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c),s1)._expression()),
61 ((s1 * m1.col(c) * m1.col(c).adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
68 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c).conjugate(),s1)._expression()),
69 ((s1 * m1.col(c).conjugate() * m1.col(c).conjugate().adjoint()).eval().template triangularView<Lower>().toDenseMatrix()))
[all...] |
| product_trmv.cpp | 33 m3 = m1.template triangularView<Eigen::Lower>();
34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps));
43 m3 = m1.template triangularView<Eigen::Lower>();
44 VERIFY(((s1*m3).conjugate() * v1).isApprox((s1*m1).conjugate().template triangularView<Eigen::Lower>() * v1, largerEps));
50 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Lower>() * v1, largerEps));
51 m3 = m1.template triangularView<Eigen::Lower>();
60 VERIFY((m3.adjoint() * v1).isApprox(m1.adjoint().template triangularView<Eigen::Lower>() * v1, largerEps));
61 m3 = m1.template triangularView<Eigen::Lower>();
66 m3 = m1.template triangularView<Eigen::Lower>();
67 VERIFY((v1.transpose() * m3).isApprox(v1.transpose() * m1.template triangularView<Eigen::Lower>(), largerEps))
[all...] |
| cholesky.cpp | 35 MatrixType symmLo = symm.template triangularView<Lower>();
39 CholType<MatrixType,Lower> chollo(symmLo);
49 CholType<MatrixType,Lower> chol(symmCpy);
87 SquareMatrixType symmLo = symm.template triangularView<Lower>();
94 LLT<SquareMatrixType,Lower> chollo(symmLo);
129 SquareMatrixType symmLo = symm.template triangularView<Lower>();
131 LDLT<SquareMatrixType,Lower> ldltlo(symmLo);
173 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB);
174 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB));
176 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB)
[all...] |
| triangular.cpp | 43 // VERIFY_IS_APPROX(m1up.transpose() * m2, m1.upper().transpose().lower() * m2);
56 VERIFY_IS_APPROX(m3.template triangularView<Lower>().transpose().toDenseMatrix(), m1);
60 m1.template triangularView<Lower>() = m2.transpose() + m2;
61 VERIFY_IS_APPROX(m3.template triangularView<Lower>().toDenseMatrix(), m1);
63 VERIFY_IS_APPROX(m3.template triangularView<Lower>().conjugate().toDenseMatrix(),
64 m3.conjugate().template triangularView<Lower>().toDenseMatrix());
73 VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), largerEps));
74 m3 = m1.template triangularView<Lower>();
78 m3 = m1.template triangularView<Lower>();
79 VERIFY(v2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(v2)), largerEps))
[all...] |
| product_selfadjoint.cpp | 42 m2 = m1.template triangularView<Lower>();
43 m2.template selfadjointView<Lower>().rankUpdate(v1,v2);
44 VERIFY_IS_APPROX(m2, (m1 + v1 * v2.adjoint()+ v2 * v1.adjoint()).template triangularView<Lower>().toDenseMatrix());
56 m2 = m1.template triangularView<Lower>();
57 m2.block(1,1,rows-1,cols-1).template selfadjointView<Lower>().rankUpdate(v1.tail(rows-1),v2.head(cols-1));
60 VERIFY_IS_APPROX(m2, m3.template triangularView<Lower>().toDenseMatrix());
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| RangeConstraintManager.cpp | 106 const llvm::APSInt &Lower,
120 if (i->To() < Lower) {
127 if (i->Includes(Lower)) {
129 newRanges = F.add(newRanges, Range(BV.getValue(Lower),
133 newRanges = F.add(newRanges, Range(BV.getValue(Lower), i->To()));
149 bool pin(llvm::APSInt &Lower, llvm::APSInt &Upper) const {
151 // both the upper and lower bounds against the symbol's type.
156 APSIntType::RangeTestResultKind LowerTest = Type.testInRange(Lower);
165 if (Lower < Upper)
169 Lower = Type.getMinValue()
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/ |
| TriangularSolver.h | 18 const unsigned int LowerTriangularBit = Lower;
21 const unsigned int LowerTriangular = Lower;
|
| /external/icu4c/data/brkitr/ |
| sent.txt | 22 $Lower = [\p{Sentence_Break = Lower}];
37 $LowerEx = $Lower ($Extend | $Format)*;
70 $NotLettersEx = [^$OLetter $Upper $Lower $Sep $CR $LF $ATerm $STerm] ($Extend | $Format)*;
71 $ATermEx $CloseEx* $SpEx* $NotLettersEx* $Lower;
|
| sent_el.txt | 22 $Lower = [\p{Sentence_Break = Lower}];
37 $LowerEx = $Lower ($Extend | $Format)*;
70 $NotLettersEx = [^$OLetter $Upper $Lower $Sep $CR $LF $ATerm $STerm] ($Extend | $Format)*;
71 $ATermEx $CloseEx* $SpEx* $NotLettersEx* $Lower;
|
| /external/eigen/Eigen/src/Core/products/ |
| GeneralMatrixMatrixTriangular_MKL.h | 78 IsLower = (UpLo&Lower) == Lower, \
79 LowUp = IsLower ? Lower : Upper, \
103 IsLower = (UpLo&Lower) == Lower, \
104 LowUp = IsLower ? Lower : Upper, \
|
| /external/eigen/lapack/ |
| cholesky.cpp | 30 else ret = internal::llt_inplace<Scalar, Lower>::blocked(A);
67 A.triangularView<Lower>().solveInPlace(B);
68 A.triangularView<Lower>().adjoint().solveInPlace(B);
|
