| /external/chromium_org/third_party/icu/source/data/unidata/ |
| D | SentenceBreakProperty.txt | 403 0061..007A ; Lower
404 00AA ; Lower
405 00B5 ; Lower
406 00BA ; Lower
407 00DF..00F6 ; Lower
408 00F8..00FF ; Lower
409 0101 ; Lower
410 0103 ; Lower
411 0105 ; Lower
412 0107 ; Lower
[all …]
|
| /external/llvm/lib/Support/ |
| D | ConstantRange.cpp | 34 Lower = Upper = APInt::getMaxValue(BitWidth); in ConstantRange()
36 Lower = Upper = APInt::getMinValue(BitWidth); in ConstantRange()
42 : Lower(llvm_move(V)), Upper(Lower + 1) {} in ConstantRange()
45 : Lower(llvm_move(L)), Upper(llvm_move(U)) { in ConstantRange()
46 assert(Lower.getBitWidth() == Upper.getBitWidth() && in ConstantRange()
48 assert((Lower != Upper || (Lower.isMaxValue() || Lower.isMinValue())) && in ConstantRange()
120 return Lower == Upper && Lower.isMaxValue(); in isFullSet()
126 return Lower == Upper && Lower.isMinValue(); in isEmptySet()
133 return Lower.ugt(Upper); in isWrappedSet()
157 return (Upper - Lower).zext(getBitWidth()+1); in getSetSize()
[all …]
|
| /external/eigen/test/ |
| D | sparse_permutations.cpp | 33 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 …]
|
| D | eigensolver_selfadjoint.cpp | 49 VERIFY((symmA.template selfadjointView<Lower>() * eiSymm.eigenvectors()).isApprox( in selfadjointeigensolver()
51 VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiSymm.eigenvalues()); in selfadjointeigensolver()
54 VERIFY((symmA.template selfadjointView<Lower>() * eiDirect.eigenvectors()).isApprox( in selfadjointeigensolver()
56 VERIFY_IS_APPROX(symmA.template selfadjointView<Lower>().eigenvalues(), eiDirect.eigenvalues()); in selfadjointeigensolver()
65 VERIFY((symmA.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox( in selfadjointeigensolver()
66 …symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDi… in selfadjointeigensolver()
71 …VERIFY((symmB.template selfadjointView<Lower>() * (symmA.template selfadjointView<Lower>() * eiSym… in selfadjointeigensolver()
77 …VERIFY((symmA.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSym… in selfadjointeigensolver()
82 VERIFY_IS_APPROX(MatrixType(symmA.template selfadjointView<Lower>()), sqrtSymmA*sqrtSymmA); in selfadjointeigensolver()
83 VERIFY_IS_APPROX(sqrtSymmA, symmA.template selfadjointView<Lower>()*eiSymm.operatorInverseSqrt()); in selfadjointeigensolver()
[all …]
|
| D | product_symm.cpp | 38 m2 = m1.template triangularView<Lower>(); in symm()
39 m3 = m2.template selfadjointView<Lower>(); in symm()
41 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1), in symm()
50 m2 = m1.template triangularView<Lower>(); in symm()
51 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
59 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint()), in symm()
63 m2 = m1.template triangularView<Lower>(); rhs12.setRandom(); rhs13 = rhs12; in symm()
64 VERIFY_IS_APPROX(rhs12 -= (s1*m2).template selfadjointView<Lower>() * (s2*rhs3), in symm()
68 …VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs3).conjugate… in symm()
73 …VERIFY_IS_APPROX(rhs12.noalias() += s1 * ((m2.adjoint()).template selfadjointView<Lower>() * (s2*r… in symm()
[all …]
|
| D | product_trmv.cpp | 33 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 …]
|
| D | triangular.cpp | 56 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 …]
|
| D | product_syrk.cpp | 36 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()), in syrk()
37 … ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
44 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(), in syrk()
45 … (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix()); in syrk()
52 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs3.adjoint(),s1)._expression(), in syrk()
53 … (s1 * rhs3.adjoint() * rhs3).eval().template triangularView<Lower>().toDenseMatrix()); in syrk()
60 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c),s1)._expression()), in syrk()
61 … ((s1 * m1.col(c) * m1.col(c).adjoint()).eval().template triangularView<Lower>().toDenseMatrix())); in syrk()
68 …VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(m1.col(c).conjugate(),s1)._expre… in syrk()
69 …ugate() * m1.col(c).conjugate().adjoint()).eval().template triangularView<Lower>().toDenseMatrix()… in syrk()
[all …]
|
| D | cholesky.cpp | 35 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()
87 SquareMatrixType symmLo = symm.template triangularView<Lower>(); in cholesky()
94 LLT<SquareMatrixType,Lower> chollo(symmLo); in cholesky()
129 SquareMatrixType symmLo = symm.template triangularView<Lower>(); in cholesky()
131 LDLT<SquareMatrixType,Lower> ldltlo(symmLo); in cholesky()
173 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
174 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB)); in cholesky()
176 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB); in cholesky()
[all …]
|
| D | cholmod_support.cpp | 16 …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()
|
| D | product_trsolve.cpp | 46 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()
|
| D | sparse_solvers.cpp | 53 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()
|
| D | product_mmtr.cpp | 40 CHECK_MMTR(matc, Lower, = s*soc*sor.adjoint()); in mmtr()
42 CHECK_MMTR(matr, Lower, = s*soc*soc.adjoint()); in mmtr()
45 CHECK_MMTR(matc, Lower, += s*soc*soc.adjoint()); in mmtr()
47 CHECK_MMTR(matr, Lower, += s*sor*soc.adjoint()); in mmtr()
50 CHECK_MMTR(matc, Lower, -= s*soc*soc.adjoint()); in mmtr()
52 CHECK_MMTR(matr, Lower, -= s*soc*soc.adjoint()); in mmtr()
|
| D | selfadjoint.cpp | 35 m3 = m1.template selfadjointView<Lower>(); in selfadjoint()
36 …_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangularView<… in selfadjoint()
42 Matrix3d m = Matrix3d::Random().selfadjointView<Lower>(); in bug_159()
|
| D | product_selfadjoint.cpp | 42 m2 = m1.template triangularView<Lower>(); in product_selfadjoint()
43 m2.template selfadjointView<Lower>().rankUpdate(v1,v2); in product_selfadjoint()
44 …VERIFY_IS_APPROX(m2, (m1 + v1 * v2.adjoint()+ v2 * v1.adjoint()).template triangularView<Lower>().… in product_selfadjoint()
56 m2 = m1.template triangularView<Lower>(); in product_selfadjoint()
57 …m2.block(1,1,rows-1,cols-1).template selfadjointView<Lower>().rankUpdate(v1.tail(rows-1),v2.head(c… in product_selfadjoint()
60 VERIFY_IS_APPROX(m2, m3.template triangularView<Lower>().toDenseMatrix()); in product_selfadjoint()
|
| /external/icu4c/test/testdata/ |
| D | SentenceBreakTest.txt | 33 ÷ 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/chromium_org/third_party/icu/source/test/testdata/ |
| D | SentenceBreakTest.txt | 33 ÷ 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/ |
| D | RangeConstraintManager.cpp | 106 const llvm::APSInt &Lower, in IntersectInRange() argument
120 if (i->To() < Lower) { in IntersectInRange()
127 if (i->Includes(Lower)) { in IntersectInRange()
129 newRanges = F.add(newRanges, Range(BV.getValue(Lower), in IntersectInRange()
133 newRanges = F.add(newRanges, Range(BV.getValue(Lower), i->To())); in IntersectInRange()
149 bool pin(llvm::APSInt &Lower, llvm::APSInt &Upper) const { in pin() argument
156 APSIntType::RangeTestResultKind LowerTest = Type.testInRange(Lower, true); in pin()
165 if (Lower < Upper) in pin()
169 Lower = Type.getMinValue(); in pin()
174 Lower = Type.getMinValue(); in pin()
[all …]
|
| /external/llvm/include/llvm/Support/ |
| D | ConstantRange.h | 43 APInt Lower, Upper; variable
65 ConstantRange(APIntMoveTy Lower, APIntMoveTy Upper);
79 const APInt &getLower() const { return Lower; } in getLower()
87 uint32_t getBitWidth() const { return Lower.getBitWidth(); } in getBitWidth()
120 if (Upper == Lower + 1) in getSingleElement()
121 return &Lower; in getSingleElement()
156 return Lower == CR.Lower && Upper == CR.Upper;
|
| D | UnicodeCharRanges.h | 23 uint32_t Lower; member
46 if (I != CharSet.begin() && Prev >= I->Lower) { in isValidCharSet()
50 DEBUG(llvm::dbgs().write_hex(I->Lower) << "\n"); in isValidCharSet()
53 if (I->Upper < I->Lower) { in isValidCharSet()
55 DEBUG(llvm::dbgs().write_hex(I->Lower)); in isValidCharSet()
87 if (C < CharSet[MidPoint].Lower) in isCharInSet()
|
| /external/clang/lib/Lex/ |
| D | UnicodeCharSets.h | 22 uint32_t Lower; member
52 if (Prev >= I->Lower) { in isValidCharSet()
56 DEBUG(llvm::dbgs().write_hex(I->Lower) << "\n"); in isValidCharSet()
59 if (I->Upper < I->Lower) { in isValidCharSet()
61 DEBUG(llvm::dbgs().write_hex(I->Lower)); in isValidCharSet()
90 if (C < CharSet[MidPoint].Lower) in isCharInSet()
|
| /external/eigen/blas/ |
| D | level3_impl.h | 79 … << 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 …]
|
| D | level2_impl.h | 85 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, false,Row… in EIGEN_BLAS_FUNC()
86 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, Conj, Row… in EIGEN_BLAS_FUNC()
88 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, false,Col… in EIGEN_BLAS_FUNC()
93 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,false,Row… in EIGEN_BLAS_FUNC()
94 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,Conj, Row… in EIGEN_BLAS_FUNC()
96 … << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,false,Col… in EIGEN_BLAS_FUNC()
140 …func[TR | (UP << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|0, … in EIGEN_BLAS_FUNC()
141 …func[ADJ | (UP << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|0, … in EIGEN_BLAS_FUNC()
143 …func[NOTR | (LO << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|0, … in EIGEN_BLAS_FUNC()
148 …func[TR | (UP << 2) | (UNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|Uni… in EIGEN_BLAS_FUNC()
[all …]
|
| /external/eigen/Eigen/src/Core/products/ |
| D | 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/Eigen/src/SparseCore/ |
| D | SparseSelfAdjointView.h | 220 ((UpLo&(Upper|Lower))==(Upper|Lower))
222 || ( (UpLo&Lower) && LhsIsRowMajor),
316 if(UpLo==(Upper|Lower))
320 else if(( UpLo==Lower && r>c) || ( UpLo==Upper && r<c))
349 if(UpLo==(Upper|Lower))
361 else if(( (UpLo&Lower)==Lower && r>c) || ( (UpLo&Upper)==Upper && r<c))
386 DstUpLo = DstOrder==RowMajor ? (_DstUpLo==Upper ? Lower : Upper) : _DstUpLo,
387 SrcUpLo = SrcOrder==RowMajor ? (_SrcUpLo==Upper ? Lower : Upper) : _SrcUpLo
400 if((int(SrcUpLo)==int(Lower) && i<j) || (int(SrcUpLo)==int(Upper) && i>j))
404 count[int(DstUpLo)==int(Lower) ? (std::min)(ip,jp) : (std::max)(ip,jp)]++;
[all …]
|