/external/eigen/test/ |
conjugate_gradient.cpp | 17 ConjugateGradient<SparseMatrixType, Upper > cg_colmajor_upper_diag; 18 ConjugateGradient<SparseMatrixType, Lower|Upper> cg_colmajor_loup_diag; 20 ConjugateGradient<SparseMatrixType, Upper, IdentityPreconditioner> cg_colmajor_upper_I;
|
incomplete_cholesky.cpp | 20 ConjugateGradient<SparseMatrixType, Upper, IncompleteCholesky<T, Upper, AMDOrdering<I> > > cg_illt_upper_amd; 21 ConjugateGradient<SparseMatrixType, Upper, IncompleteCholesky<T, Upper, NaturalOrdering<I> > > cg_illt_upper_nat; 22 ConjugateGradient<SparseMatrixType, Upper|Lower, IncompleteCholesky<T, Lower, AMDOrdering<I> > > cg_illt_uplo_amd; 59 Eigen::Lower | Eigen::Upper,
|
product_mmtr.cpp | 49 CHECK_MMTR(matc, Upper, = s*(soc*soc.adjoint())); 51 CHECK_MMTR(matr, Upper, = soc*(s*sor.adjoint())); 54 CHECK_MMTR(matc, Upper, += s*(soc*sor.transpose())); 56 CHECK_MMTR(matr, Upper, += soc*(s*soc.adjoint())); 59 CHECK_MMTR(matc, Upper, -= s*(osc.transpose()*osc.conjugate())); 61 CHECK_MMTR(matr, Upper, -= soc*(s*soc.adjoint())); 63 CHECK_MMTR(matc, Lower, -= s*sqr*sqc.template triangularView<Upper>()); 64 CHECK_MMTR(matc, Upper, = s*sqc*sqr.template triangularView<Upper>()); 66 CHECK_MMTR(matc, Upper, = s*sqc*sqc.template triangularView<Lower>()) [all...] |
product_syrk.cpp | 46 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(), 47 (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); 49 VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpression(), 50 (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix()); 62 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs1.adjoint(),s1)._expression(), 63 (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Upper>().toDenseMatrix()); 64 VERIFY_IS_APPROX((m2.template triangularView<Upper>() = s1 * rhs1.adjoint() * rhs11).nestedExpression(), 65 (s1 * rhs1.adjoint() * rhs11).eval().template triangularView<Upper>().toDenseMatrix()); 73 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs3.adjoint(),s1)._expression(), 74 (s1 * rhs3.adjoint() * rhs3).eval().template triangularView<Upper>().toDenseMatrix()) [all...] |
simplicial_cholesky.cpp | 16 SimplicialCholesky<SparseMatrixType, Upper> chol_colmajor_upper_amd; 18 SimplicialLLT< SparseMatrixType, Upper> llt_colmajor_upper_amd; 20 SimplicialLDLT< SparseMatrixType, Upper> ldlt_colmajor_upper_amd; 22 SimplicialLDLT< SparseMatrixType, Upper, NaturalOrdering<I> > ldlt_colmajor_upper_nat;
|
selfadjoint.cpp | 31 m3 = m1.template selfadjointView<Upper>(); 32 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Upper>()), MatrixType(m1.template triangularView<Upper>())); 39 m3 = m1.template selfadjointView<Upper>(); 41 m4 += m1.template selfadjointView<Upper>();
|
sparse_permutations.cpp | 64 up = mat.template triangularView<Upper>(); 67 up_sym_d = mat_d.template selfadjointView<Upper>(); 71 VERIFY_IS_APPROX(up, DenseMatrix(mat_d.template triangularView<Upper>())); 111 VERIFY( is_sorted( res = mat.template selfadjointView<Upper>().twistedBy(p_null) )); 113 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full"); 120 VERIFY( is_sorted( res = up.template selfadjointView<Upper>().twistedBy(p_null) )); 122 VERIFY(res.isApprox(res_d) && "upper selfadjoint to full"); 129 VERIFY( is_sorted( res = mat.template selfadjointView<Upper>() )); 131 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full"); 137 VERIFY( is_sorted( res = up.template selfadjointView<Upper>() )); [all...] |
/external/eigen/unsupported/test/ |
minres.cpp | 19 MINRES<SparseMatrix<T>, Upper, IdentityPreconditioner > minres_colmajor_upper_I; 23 MINRES<SparseMatrix<T>, Upper, DiagonalPreconditioner<T> > minres_colmajor_upper_diag; 24 MINRES<SparseMatrix<T>, Lower|Upper, DiagonalPreconditioner<T> > minres_colmajor_uplo_diag;
|
/external/swiftshader/third_party/llvm-subzero/include/llvm/Support/ |
Format.h | 160 bool Upper; 167 : HexValue(HV), DecValue(DV), Width(W), Hex(H), Upper(U), 178 bool Upper = false) { 180 return FormattedNumber(N, 0, Width, true, Upper, true); 191 bool Upper = false) { 193 return FormattedNumber(N, 0, Width, true, Upper, false); 214 bool Upper; // Show offset and hex bytes as upper case. 222 ByteGroupSize(BGS), Upper(U), ASCII(A) { 232 uint32_t IndentLevel = 0, bool Upper = false) [all...] |
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
Format.h | 160 bool Upper; 167 : HexValue(HV), DecValue(DV), Width(W), Hex(H), Upper(U), 178 bool Upper = false) { 180 return FormattedNumber(N, 0, Width, true, Upper, true); 191 bool Upper = false) { 193 return FormattedNumber(N, 0, Width, true, Upper, false); 214 bool Upper; // Show offset and hex bytes as upper case. 222 ByteGroupSize(BGS), Upper(U), ASCII(A) { 232 uint32_t IndentLevel = 0, bool Upper = false) [all...] |
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Support/ |
Format.h | 160 bool Upper; 167 : HexValue(HV), DecValue(DV), Width(W), Hex(H), Upper(U), 178 bool Upper = false) { 180 return FormattedNumber(N, 0, Width, true, Upper, true); 191 bool Upper = false) { 193 return FormattedNumber(N, 0, Width, true, Upper, false); 214 bool Upper; // Show offset and hex bytes as upper case. 222 ByteGroupSize(BGS), Upper(U), ASCII(A) { 232 uint32_t IndentLevel = 0, bool Upper = false) [all...] |
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Support/ |
Format.h | 160 bool Upper; 167 : HexValue(HV), DecValue(DV), Width(W), Hex(H), Upper(U), 178 bool Upper = false) { 180 return FormattedNumber(N, 0, Width, true, Upper, true); 191 bool Upper = false) { 193 return FormattedNumber(N, 0, Width, true, Upper, false); 214 bool Upper; // Show offset and hex bytes as upper case. 222 ByteGroupSize(BGS), Upper(U), ASCII(A) { 232 uint32_t IndentLevel = 0, bool Upper = false) [all...] |
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
Format.h | 160 bool Upper; 167 : HexValue(HV), DecValue(DV), Width(W), Hex(H), Upper(U), 178 bool Upper = false) { 180 return FormattedNumber(N, 0, Width, true, Upper, true); 191 bool Upper = false) { 193 return FormattedNumber(N, 0, Width, true, Upper, false); 214 bool Upper; // Show offset and hex bytes as upper case. 222 ByteGroupSize(BGS), Upper(U), ASCII(A) { 232 uint32_t IndentLevel = 0, bool Upper = false) [all...] |
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Support/ |
Format.h | 160 bool Upper; 167 : HexValue(HV), DecValue(DV), Width(W), Hex(H), Upper(U), 178 bool Upper = false) { 180 return FormattedNumber(N, 0, Width, true, Upper, true); 191 bool Upper = false) { 193 return FormattedNumber(N, 0, Width, true, Upper, false); 214 bool Upper; // Show offset and hex bytes as upper case. 222 ByteGroupSize(BGS), Upper(U), ASCII(A) { 232 uint32_t IndentLevel = 0, bool Upper = false) [all...] |
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Support/ |
Format.h | 160 bool Upper; 167 : HexValue(HV), DecValue(DV), Width(W), Hex(H), Upper(U), 178 bool Upper = false) { 180 return FormattedNumber(N, 0, Width, true, Upper, true); 191 bool Upper = false) { 193 return FormattedNumber(N, 0, Width, true, Upper, false); 214 bool Upper; // Show offset and hex bytes as upper case. 222 ByteGroupSize(BGS), Upper(U), ASCII(A) { 232 uint32_t IndentLevel = 0, bool Upper = false) [all...] |
/external/swiftshader/third_party/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); 73 /// getUpper - Return the upper value for this range... 75 const APInt &getUpper() const { return Upper; } 112 if (Upper == Lower + 1) 148 return Lower == CR.Lower && Upper == CR.Upper; [all...] |
/external/eigen/doc/examples/ |
TemplateKeyword_flexible.cpp | 10 dst.template triangularView<Upper>() = src.template triangularView<Upper>();
|
TemplateKeyword_simple.cpp | 8 dst.triangularView<Upper>() = src.triangularView<Upper>();
|
/external/eigen/doc/snippets/ |
MatrixBase_selfadjointView.cpp | 3 cout << "Here is the symmetric matrix extracted from the upper part of m:" << endl 4 << Matrix3i(m.selfadjointView<Upper>()) << endl;
|
MatrixBase_triangularView.cpp | 3 cout << "Here is the upper-triangular matrix extracted from m:" << endl 4 << Matrix3i(m.triangularView<Eigen::Upper>()) << endl; 5 cout << "Here is the strictly-upper-triangular matrix extracted from m:" << endl
|
Tutorial_solve_triangular.cpp | 7 Vector3f x = A.triangularView<Upper>().solve(b);
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/rbbi/break_rules/ |
sentence.txt | 18 Upper = [\p{Sentence_Break = Upper}]; 42 SB7: (Upper | Lower) ExtFmt* ATerm ExtFmt* Upper; 43 SB8: ATerm ExtFmt* (Close ExtFmt*)* (Sp ExtFmt*)* ([^OLetter Upper Lower ParaSep SATerm ExtFmt] ExtFmt *)* Lower;
|
/external/icu/icu4c/source/test/testdata/break_rules/ |
sentence.txt | 18 Upper = [\p{Sentence_Break = Upper}]; 42 SB7: (Upper | Lower) ExtFmt* ATerm ExtFmt* Upper; 43 SB8: ATerm ExtFmt* (Close ExtFmt*)* (Sp ExtFmt*)* ([^OLetter Upper Lower ParaSep SATerm ExtFmt] ExtFmt *)* Lower;
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/rbbi/break_rules/ |
sentence.txt | 18 Upper = [\p{Sentence_Break = Upper}]; 42 SB7: (Upper | Lower) ExtFmt* ATerm ExtFmt* Upper; 43 SB8: ATerm ExtFmt* (Close ExtFmt*)* (Sp ExtFmt*)* ([^OLetter Upper Lower ParaSep SATerm ExtFmt] ExtFmt *)* Lower;
|
/external/llvm/include/llvm/IR/ |
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 44 APInt Lower, Upper; 59 /// Lower==Upper and Lower != Min or Max value for its type. It will also 61 ConstantRange(APIntMoveTy Lower, APIntMoveTy Upper); 126 /// Return the upper value for this range. 128 const APInt &getUpper() const { return Upper; } 164 if (Upper == Lower + 1) 196 return Lower == CR.Lower && Upper == CR.Upper; [all...] |