Home
last modified time | relevance | path

Searched refs:Lower (Results 1 – 25 of 290) sorted by relevance

12345678910>>...12

/external/llvm/lib/IR/
DConstantRange.cpp36 Lower = Upper = APInt::getMaxValue(BitWidth); in ConstantRange()
38 Lower = Upper = APInt::getMinValue(BitWidth); in ConstantRange()
44 : Lower(std::move(V)), Upper(Lower + 1) {} in ConstantRange()
47 : Lower(std::move(L)), Upper(std::move(U)) { in ConstantRange()
48 assert(Lower.getBitWidth() == Upper.getBitWidth() && in ConstantRange()
50 assert((Lower != Upper || (Lower.isMaxValue() || Lower.isMinValue())) && in ConstantRange()
184 return Lower == Upper && Lower.isMaxValue(); in isFullSet()
190 return Lower == Upper && Lower.isMinValue(); in isEmptySet()
197 return Lower.ugt(Upper); in isWrappedSet()
218 return (Upper - Lower).zext(getBitWidth()+1); in getSetSize()
[all …]
/external/eigen/test/
Dsparse_permutations.cpp33 lo = mat.template triangularView<Lower>(); in sparse_permutations()
36 lo_sym_d = mat_d.template selfadjointView<Lower>(); in sparse_permutations()
40 VERIFY_IS_APPROX(lo, DenseMatrix(mat_d.template triangularView<Lower>())); in sparse_permutations()
72 res = mat.template selfadjointView<Lower>().twistedBy(p_null); in sparse_permutations()
81 res = lo.template selfadjointView<Lower>().twistedBy(p_null); in sparse_permutations()
90 res = mat.template selfadjointView<Lower>(); in sparse_permutations()
98 res = lo.template selfadjointView<Lower>(); in sparse_permutations()
107 res.template selfadjointView<Lower>() = mat.template selfadjointView<Upper>(); in sparse_permutations()
108 res_d = up_sym_d.template triangularView<Lower>(); in sparse_permutations()
111 res.template selfadjointView<Upper>() = mat.template selfadjointView<Lower>(); in sparse_permutations()
[all …]
Dproduct_syrk.cpp38 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk()
39 … ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
41 …VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpr… in syrk()
42 … ((s1 * rhs2 * rhs22.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
54 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk()
55 … (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix()); in syrk()
57 …VERIFY_IS_APPROX((m2.template triangularView<Lower>() += s1 * rhs11.adjoint() * rhs1).nestedExpres… in syrk()
58 … (s1 * rhs11.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix()); in syrk()
69 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs3.adjoint(),s1)._expression(), in syrk()
70 … (s1 * rhs3.adjoint() * rhs3).eval().template triangularView<Lower>().toDenseMatrix()); in syrk()
[all …]
Deigensolver_selfadjoint.cpp60 VERIFY((symmA.template selfadjointView<Lower>() * eiSymm.eigenvectors()).isApprox( in selfadjointeigensolver()
62 VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiSymm.eigenvalues()); in selfadjointeigensolver()
65 VERIFY((symmA.template selfadjointView<Lower>() * eiDirect.eigenvectors()).isApprox( in selfadjointeigensolver()
67 VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiDirect.eigenvalues()); in selfadjointeigensolver()
76 VERIFY((symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox( in selfadjointeigensolver()
77 …symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDi… in selfadjointeigensolver()
82 …VERIFY((symmB.template selfadjointView<Lower>() * (symmC.template selfadjointView<Lower>() * eiSym… in selfadjointeigensolver()
88 …VERIFY((symmC.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSym… in selfadjointeigensolver()
94 VERIFY_IS_APPROX(MatrixType(symmC.template selfadjointView<Lower>()), sqrtSymmA*sqrtSymmA); in selfadjointeigensolver()
95 VERIFY_IS_APPROX(sqrtSymmA, symmC.template selfadjointView<Lower>()*eiSymm.operatorInverseSqrt()); in selfadjointeigensolver()
[all …]
Dtriangular.cpp56 VERIFY_IS_APPROX(m3.template triangularView<Lower>().transpose().toDenseMatrix(), m1); in triangular_square()
60 m1.template triangularView<Lower>() = m2.transpose() + m2; in triangular_square()
61 VERIFY_IS_APPROX(m3.template triangularView<Lower>().toDenseMatrix(), m1); in triangular_square()
63 VERIFY_IS_APPROX(m3.template triangularView<Lower>().conjugate().toDenseMatrix(), in triangular_square()
64 m3.conjugate().template triangularView<Lower>().toDenseMatrix()); in triangular_square()
73 …VERIFY(v2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(v2)), large… in triangular_square()
74 m3 = m1.template triangularView<Lower>(); in triangular_square()
78 m3 = m1.template triangularView<Lower>(); in triangular_square()
79 …VERIFY(v2.isApprox(m3.conjugate() * (m1.conjugate().template triangularView<Lower>().solve(v2)), l… in triangular_square()
83 …VERIFY(m2.isApprox(m3.adjoint() * (m1.adjoint().template triangularView<Lower>().solve(m2)), large… in triangular_square()
[all …]
Dproduct_symm.cpp36 m2 = m1.template triangularView<Lower>(); in symm()
37 m3 = m2.template selfadjointView<Lower>(); in symm()
39 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1), in symm()
48 m2 = m1.template triangularView<Lower>(); in symm()
49 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
57 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
61 m2 = m1.template triangularView<Lower>(); rhs12.setRandom(); rhs13 = rhs12; in symm()
62 VERIFY_IS_APPROX(rhs12 -= (s1*m2).template selfadjointView<Lower>() * (s2*rhs3), in symm()
66 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate… in symm()
71 …VERIFY_IS_APPROX(rhs12.noalias() += s1 * ((m2.adjoint()).template selfadjointView<Lower>() * (s2*r… in symm()
[all …]
Dproduct_trmv.cpp33 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
34 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Lower>() * v1, largerEps)); in trmv()
43 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
44 …ugate() * v1).isApprox((s1*m1).conjugate().template triangularView<Eigen::Lower>() * v1, largerEps… in trmv()
50 …VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Lower>() * v1,… in trmv()
51 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
60 …VERIFY((m3.adjoint() * v1).isApprox(m1.adjoint().template triangularView<Eigen::Lower>() * v1, lar… in trmv()
61 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
66 m3 = m1.template triangularView<Eigen::Lower>(); in trmv()
67 …VERIFY((v1.transpose() * m3).isApprox(v1.transpose() * m1.template triangularView<Eigen::Lower>(),… in trmv()
[all …]
Dcholmod_support.cpp16 …CholmodDecomposition<SparseMatrix<T>, Lower> g_chol_colmajor_lower; g_chol_colmajor_lower.setMode(… in test_cholmod_T()
18 …CholmodDecomposition<SparseMatrix<T>, Lower> g_llt_colmajor_lower; g_llt_colmajor_lower.setMode(C… in test_cholmod_T()
20 …CholmodDecomposition<SparseMatrix<T>, Lower> g_ldlt_colmajor_lower; g_ldlt_colmajor_lower.setMode(… in test_cholmod_T()
23 CholmodSupernodalLLT<SparseMatrix<T>, Lower> chol_colmajor_lower; in test_cholmod_T()
25 CholmodSimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower; in test_cholmod_T()
27 CholmodSimplicialLDLT<SparseMatrix<T>, Lower> ldlt_colmajor_lower; in test_cholmod_T()
Dproduct_trsolve.cpp46 VERIFY_TRSM(cmLhs.conjugate().template triangularView<Lower>(), cmRhs); in trsolve()
47 VERIFY_TRSM(cmLhs.adjoint() .template triangularView<Lower>(), cmRhs); in trsolve()
49 VERIFY_TRSM(cmLhs .template triangularView<Lower>(), rmRhs); in trsolve()
56 VERIFY_TRSM(rmLhs .template triangularView<Lower>(), cmRhs); in trsolve()
60 VERIFY_TRSM_ONTHERIGHT(cmLhs.conjugate().template triangularView<Lower>(), cmRhs); in trsolve()
62 VERIFY_TRSM_ONTHERIGHT(cmLhs .template triangularView<Lower>(), rmRhs); in trsolve()
68 VERIFY_TRSM_ONTHERIGHT(rmLhs .template triangularView<Lower>(), cmRhs); in trsolve()
72 VERIFY_TRSM(rmLhs.template triangularView<Lower>(), rmRhs.col(c)); in trsolve()
73 VERIFY_TRSM(cmLhs.template triangularView<Lower>(), rmRhs.col(c)); in trsolve()
Dcholesky.cpp35 MatrixType symmLo = symm.template triangularView<Lower>(); in test_chol_update()
39 CholType<MatrixType,Lower> chollo(symmLo); in test_chol_update()
49 CholType<MatrixType,Lower> chol(symmCpy); in test_chol_update()
92 SquareMatrixType symmLo = symm.template triangularView<Lower>(); in cholesky()
94 LLT<SquareMatrixType,Lower> chollo(symmLo); in cholesky()
121 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
122 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky()
124 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
125 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky()
127 m2.noalias() += symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
[all …]
Dsparse_solvers.cpp53 VERIFY_IS_APPROX(refMat2.template triangularView<Lower>().solve(vec2), in sparse_solvers()
54 m2.template triangularView<Lower>().solve(vec3)); in sparse_solvers()
77 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Lower>().solve(vec2), in sparse_solvers()
78 m2.transpose().template triangularView<Lower>().solve(vec3)); in sparse_solvers()
86 refMat2.template triangularView<Lower>().solveInPlace(refMatB); in sparse_solvers()
87 m2.template triangularView<Lower>().solveInPlace(matB); in sparse_solvers()
99 VERIFY_IS_APPROX(refMat2.template triangularView<Lower>().solve(vec2), in sparse_solvers()
100 m2.template triangularView<Lower>().solve(vec3)); in sparse_solvers()
Dproduct_mmtr.cpp38 CHECK_MMTR(matc, Lower, = s*soc*sor.adjoint()); in mmtr()
40 CHECK_MMTR(matr, Lower, = s*soc*soc.adjoint()); in mmtr()
43 CHECK_MMTR(matc, Lower, += s*soc*soc.adjoint()); in mmtr()
45 CHECK_MMTR(matr, Lower, += s*sor*soc.adjoint()); in mmtr()
48 CHECK_MMTR(matc, Lower, -= s*soc*soc.adjoint()); in mmtr()
50 CHECK_MMTR(matr, Lower, -= s*soc*soc.adjoint()); in mmtr()
Dsimplicial_cholesky.cpp14 SimplicialCholesky<SparseMatrix<T>, Lower> chol_colmajor_lower_amd; in test_simplicial_cholesky_T()
16 SimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower_amd; in test_simplicial_cholesky_T()
18 SimplicialLDLT<SparseMatrix<T>, Lower> ldlt_colmajor_lower_amd; in test_simplicial_cholesky_T()
20 SimplicialLDLT<SparseMatrix<T>, Lower, NaturalOrdering<int> > ldlt_colmajor_lower_nat; in test_simplicial_cholesky_T()
Dproduct_selfadjoint.cpp41 m2 = m1.template triangularView<Lower>(); in product_selfadjoint()
42 m2.template selfadjointView<Lower>().rankUpdate(v1,v2); in product_selfadjoint()
43 …VERIFY_IS_APPROX(m2, (m1 + v1 * v2.adjoint()+ v2 * v1.adjoint()).template triangularView<Lower>().… in product_selfadjoint()
55 m2 = m1.template triangularView<Lower>(); in product_selfadjoint()
56 …m2.block(1,1,rows-1,cols-1).template selfadjointView<Lower>().rankUpdate(v1.tail(rows-1),v2.head(c… in product_selfadjoint()
59 VERIFY_IS_APPROX(m2, m3.template triangularView<Lower>().toDenseMatrix()); in product_selfadjoint()
/external/clang/unittests/Basic/
DVirtualFileSystemTest.cpp234 IntrusiveRefCntPtr<DummyFileSystem> Lower(new DummyFileSystem()); in TEST() local
237 new vfs::OverlayFileSystem(Lower)); in TEST()
240 Lower->addDirectory("/lower-only"); in TEST()
244 ErrorOr<vfs::Status> Status1 = Lower->status("/lower-only"); in TEST()
259 IntrusiveRefCntPtr<DummyFileSystem> Lower(new DummyFileSystem()); in TEST() local
262 new vfs::OverlayFileSystem(Lower)); in TEST()
266 Lower->addDirectory("/both", sys::fs::owner_read); in TEST()
273 Lower->addRegularFile("/both/foo", sys::fs::owner_read); in TEST()
395 IntrusiveRefCntPtr<DummyFileSystem> Lower(new DummyFileSystem()); in TEST() local
398 new vfs::OverlayFileSystem(Lower)); in TEST()
[all …]
/external/eigen/blas/
DRank2Update.h26 …Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)) += in run()
27 …numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i … in run()
28 … + alpha * numext::conj(v[i]) * OtherMap(u+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)); in run()
45 Map<Matrix<Scalar,Dynamic,1> >(mat+offset, UpLo==Lower ? size-i : (i+1)) += in run()
46 …numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i … in run()
47 … + alpha * numext::conj(v[i]) * OtherMap(u+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)); in run()
49 mat[offset+(UpLo==Lower ? 0 : i)] = numext::real(mat[offset+(UpLo==Lower ? 0 : i)]); in run()
50 offset += UpLo==Lower ? size-i : (i+1); in run()
DPackedSelfadjointProduct.h33 …ynamic,1> >(mat, UpLo==Lower ? size-i : (i+1)) += alpha * cj(vec[i]) * ConjRhsType(OtherMap(vec+(U…
35 mat[UpLo==Lower ? 0 : i] = numext::real(mat[UpLo==Lower ? 0 : i]);
36 mat += UpLo==Lower ? size-i : (i+1);
47 …selfadjoint_packed_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::ru…
Dlevel2_impl.h88 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, false,Row… in EIGEN_BLAS_FUNC()
89 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, Conj, Row… in EIGEN_BLAS_FUNC()
91 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, false,Col… in EIGEN_BLAS_FUNC()
96 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,false,Row… in EIGEN_BLAS_FUNC()
97 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,Conj, Row… in EIGEN_BLAS_FUNC()
99 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,false,Col… in EIGEN_BLAS_FUNC()
143 …func[TR | (UP << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|0, … in EIGEN_BLAS_FUNC()
144 …func[ADJ | (UP << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|0, … in EIGEN_BLAS_FUNC()
146 …func[NOTR | (LO << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|0, … in EIGEN_BLAS_FUNC()
151 …func[TR | (UP << 2) | (UNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|Uni… in EIGEN_BLAS_FUNC()
[all …]
Dlevel3_impl.h79 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, false,… in EIGEN_BLAS_FUNC()
80 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, Conj, … in EIGEN_BLAS_FUNC()
83 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|0, false,… in EIGEN_BLAS_FUNC()
84 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|0, Conj, … in EIGEN_BLAS_FUNC()
86 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, false,… in EIGEN_BLAS_FUNC()
90 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|0, false,… in EIGEN_BLAS_FUNC()
96 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|UnitDiag,false,Row… in EIGEN_BLAS_FUNC()
97 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|UnitDiag,Conj, Row… in EIGEN_BLAS_FUNC()
100 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|UnitDiag,false,Row… in EIGEN_BLAS_FUNC()
101 … << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|UnitDiag,Conj, Row… in EIGEN_BLAS_FUNC()
[all …]
/external/icu/icu4c/source/test/testdata/
DSentenceBreakTest.txt33 ÷ 0001 × 0061 ÷ # ÷ [0.2] <START OF HEADING> (Other) × [12.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
34 …DING> (Other) × [5.0] COMBINING DIAERESIS (Extend_FE) × [12.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
63 ÷ 000D ÷ 0061 ÷ # ÷ [0.2] <CARRIAGE RETURN (CR)> (CR) ÷ [4.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
64 …RN (CR)> (CR) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [12.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
93 ÷ 000A ÷ 0061 ÷ # ÷ [0.2] <LINE FEED (LF)> (LF) ÷ [4.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
94 …ED (LF)> (LF) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [12.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
123 ÷ 0085 ÷ 0061 ÷ # ÷ [0.2] <NEXT LINE (NEL)> (Sep) ÷ [4.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
124 … (NEL)> (Sep) ÷ [4.0] COMBINING DIAERESIS (Extend_FE) × [12.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
153 ÷ 0009 × 0061 ÷ # ÷ [0.2] <CHARACTER TABULATION> (Sp) × [12.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
154 …ULATION> (Sp) × [5.0] COMBINING DIAERESIS (Extend_FE) × [12.0] LATIN SMALL LETTER A (Lower) ÷ [0.3]
[all …]
/external/clang/lib/StaticAnalyzer/Core/
DRangeConstraintManager.cpp115 const llvm::APSInt &Lower, in IntersectInRange() argument
129 if (i->To() < Lower) { in IntersectInRange()
136 if (i->Includes(Lower)) { in IntersectInRange()
138 newRanges = F.add(newRanges, Range(BV.getValue(Lower), in IntersectInRange()
142 newRanges = F.add(newRanges, Range(BV.getValue(Lower), i->To())); in IntersectInRange()
158 bool pin(llvm::APSInt &Lower, llvm::APSInt &Upper) const { in pin() argument
165 APSIntType::RangeTestResultKind LowerTest = Type.testInRange(Lower, true); in pin()
174 if (Lower < Upper) in pin()
178 Lower = Type.getMinValue(); in pin()
183 Lower = Type.getMinValue(); in pin()
[all …]
/external/llvm/include/llvm/IR/
DConstantRange.h44 APInt Lower, Upper; variable
61 ConstantRange(APIntMoveTy Lower, APIntMoveTy Upper);
98 const APInt &getLower() const { return Lower; } in getLower()
106 uint32_t getBitWidth() const { return Lower.getBitWidth(); } in getBitWidth()
138 if (Upper == Lower + 1) in getSingleElement()
139 return &Lower; in getSingleElement()
170 return Lower == CR.Lower && Upper == CR.Upper;
/external/llvm/include/llvm/Support/
DUnicodeCharRanges.h28 uint32_t Lower; member
33 return Value < Range.Lower;
79 if (I != Ranges.begin() && Prev >= I->Lower) { in rangesAreValid()
83 DEBUG(dbgs().write_hex(I->Lower) << "\n"); in rangesAreValid()
86 if (I->Upper < I->Lower) { in rangesAreValid()
88 DEBUG(dbgs().write_hex(I->Lower)); in rangesAreValid()
/external/eigen/unsupported/test/
Dminres.cpp17 MINRES<SparseMatrix<T>, Lower|Upper, DiagonalPreconditioner<T> > minres_colmajor_diag; in test_minres_T()
18 MINRES<SparseMatrix<T>, Lower, IdentityPreconditioner > minres_colmajor_lower_I; in test_minres_T()
29 MINRES<SparseMatrix<T>, Lower, DiagonalPreconditioner<T> > minres_colmajor_lower_diag; in test_minres_T()
31 MINRES<SparseMatrix<T>, Upper|Lower, DiagonalPreconditioner<T> > minres_colmajor_uplo_diag; in test_minres_T()
/external/eigen/Eigen/src/SparseCore/
DSparseSelfAdjointView.h244 ((UpLo&(Upper|Lower))==(Upper|Lower))
246 || ( (UpLo&Lower) && LhsIsRowMajor),
340 if(UpLo==(Upper|Lower))
344 else if(( UpLo==Lower && r>c) || ( UpLo==Upper && r<c))
373 if(UpLo==(Upper|Lower))
385 else if(( (UpLo&Lower)==Lower && r>c) || ( (UpLo&Upper)==Upper && r<c))
410 DstUpLo = DstOrder==RowMajor ? (_DstUpLo==Upper ? Lower : Upper) : _DstUpLo,
411 SrcUpLo = SrcOrder==RowMajor ? (_SrcUpLo==Upper ? Lower : Upper) : _SrcUpLo
424 if((int(SrcUpLo)==int(Lower) && i<j) || (int(SrcUpLo)==int(Upper) && i>j))
428 count[int(DstUpLo)==int(Lower) ? (std::min)(ip,jp) : (std::max)(ip,jp)]++;
[all …]

12345678910>>...12