| /external/eigen/test/ |
| pardiso_support.cpp | 10 PardisoLLT < SparseMatrix<T, RowMajor>, Lower> pardiso_llt_lower;
12 PardisoLDLT < SparseMatrix<T, RowMajor>, Lower> pardiso_ldlt_lower;
|
| 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...] |
| 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...] |
| nesting_ops.cpp | 61 VERIFY_EVALUATION_COUNT( use_n_times<1>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 );
62 VERIFY_EVALUATION_COUNT( use_n_times<10>(m1.template triangularView<Lower>().solve(m1.col(0))), 1 );
64 VERIFY_EVALUATION_COUNT( use_n_times<1>(Scalar(2)*m1.template triangularView<Lower>().solve(m1.col(0))), 2 ); // FIXME could be one by applying the scaling in-place on the solve result
65 VERIFY_EVALUATION_COUNT( use_n_times<1>(m1.col(0)+m1.template triangularView<Lower>().solve(m1.col(0))), 2 ); // FIXME could be one by adding m1.col() inplace
66 VERIFY_EVALUATION_COUNT( use_n_times<10>(m1.col(0)+m1.template triangularView<Lower>().solve(m1.col(0))), 2 );
88 VERIFY( verify_eval_type<1>(m1.template triangularView<Lower>().solve(m1), m1) );
89 VERIFY( verify_eval_type<1>(m1+m1.template triangularView<Lower>().solve(m1), m1) );
|
| product_selfadjoint.cpp | 41 m2 = m1.template triangularView<Lower>();
42 m2.template selfadjointView<Lower>().rankUpdate(v1,v2);
43 VERIFY_IS_APPROX(m2, (m1 + v1 * v2.adjoint()+ v2 * v1.adjoint()).template triangularView<Lower>().toDenseMatrix());
55 m2 = m1.template triangularView<Lower>();
56 m2.block(1,1,rows-1,cols-1).template selfadjointView<Lower>().rankUpdate(v1.tail(rows-1),v2.head(cols-1));
59 VERIFY_IS_APPROX(m2, m3.template triangularView<Lower>().toDenseMatrix());
|
| product_trsolve.cpp | 46 VERIFY_TRSM(cmLhs.conjugate().template triangularView<Lower>(), cmRhs);
47 VERIFY_TRSM(cmLhs.adjoint() .template triangularView<Lower>(), cmRhs);
49 VERIFY_TRSM(cmLhs .template triangularView<Lower>(), rmRhs);
56 VERIFY_TRSM(rmLhs .template triangularView<Lower>(), cmRhs);
60 VERIFY_TRSM_ONTHERIGHT(cmLhs.conjugate().template triangularView<Lower>(), cmRhs);
62 VERIFY_TRSM_ONTHERIGHT(cmLhs .template triangularView<Lower>(), rmRhs);
68 VERIFY_TRSM_ONTHERIGHT(rmLhs .template triangularView<Lower>(), cmRhs);
72 VERIFY_TRSM(rmLhs.template triangularView<Lower>(), rmRhs.col(c));
73 VERIFY_TRSM(cmLhs.template triangularView<Lower>(), rmRhs.col(c));
|
| cholesky.cpp | 32 MatrixType symmLo = symm.template triangularView<Lower>();
36 CholType<MatrixType,Lower> chollo(symmLo);
46 CholType<MatrixType,Lower> chol(symmCpy);
85 SquareMatrixType symmLo = symm.template triangularView<Lower>();
87 LLT<SquareMatrixType,Lower> chollo(symmLo);
95 RealScalar rcond = (RealScalar(1) / matrix_l1_norm<MatrixType, Lower>(symmLo)) /
96 matrix_l1_norm<MatrixType, Lower>(symmLo_inverse);
131 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB);
132 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB));
134 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB)
[all...] |
| eigensolver_selfadjoint.cpp | 35 VERIFY_IS_APPROX((m.template selfadjointView<Lower>() * eiSymm.eigenvectors())/scaling,
38 VERIFY_IS_APPROX(m.template selfadjointView<Lower>().eigenvalues(), eiSymm.eigenvalues());
60 VERIFY_IS_APPROX((m.template selfadjointView<Lower>() * eiDirect.eigenvectors())/scaling,
62 VERIFY_IS_APPROX(m.template selfadjointView<Lower>().eigenvalues()/scaling, eiDirect.eigenvalues()/scaling);
111 VERIFY((symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors()).isApprox(
112 symmB.template selfadjointView<Lower>() * (eiSymmGen.eigenvectors() * eiSymmGen.eigenvalues().asDiagonal()), largerEps));
117 VERIFY((symmB.template selfadjointView<Lower>() * (symmC.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox(
123 VERIFY((symmC.template selfadjointView<Lower>() * (symmB.template selfadjointView<Lower>() * eiSymmGen.eigenvectors())).isApprox
[all...] |
| pastix_support.cpp | 19 PastixLLT< SparseMatrix<T, ColMajor>, Eigen::Lower > pastix_llt_lower;
20 PastixLDLT< SparseMatrix<T, ColMajor>, Eigen::Lower > pastix_ldlt_lower;
|
| sparse_solvers.cpp | 51 // lower - dense
53 VERIFY_IS_APPROX(refMat2.template triangularView<Lower>().solve(vec2),
54 m2.template triangularView<Lower>().solve(vec3));
70 // lower - transpose
77 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Lower>().solve(vec2),
78 m2.transpose().template triangularView<Lower>().solve(vec3));
83 // lower - sparse
86 refMat2.template triangularView<Lower>().solveInPlace(refMatB);
87 m2.template triangularView<Lower>().solveInPlace(matB);
99 VERIFY_IS_APPROX(refMat2.template triangularView<Lower>().solve(vec2)
[all...] |
| /external/eigen/doc/snippets/ |
| Triangular_solve.cpp | 5 n.triangularView<Eigen::Lower>() *= 2;
|
| /external/libchrome/sandbox/linux/services/ |
| resource_limits.cc | 15 bool ResourceLimits::Lower(int resource, rlim_t limit) {
|
| resource_limits_unittests.cc | 32 SANDBOX_ASSERT(ResourceLimits::Lower(RLIMIT_NPROC, 0));
|
| /external/eigen/unsupported/test/ |
| mpreal_support.cpp | 43 X = S.selfadjointView<Lower>().llt().solve(B);
44 VERIFY_IS_APPROX((S.selfadjointView<Lower>()*X).eval(),B);
46 Xc = Sc.selfadjointView<Lower>().llt().solve(Bc);
47 VERIFY_IS_APPROX((Sc.selfadjointView<Lower>()*Xc).eval(),Bc);
56 VERIFY( (S.selfadjointView<Lower>() * eig.eigenvectors()).isApprox(eig.eigenvectors() * eig.eigenvalues().asDiagonal(), NumTraits<mpreal>::dummy_precision()*1e3) );
|
| /external/icu/icu4c/source/data/brkitr/rules/ |
| sent.txt | 25 $Lower = [\p{Sentence_Break = Lower}];
40 $LowerEx = $Lower ($Extend | $Format)*;
73 $NotLettersEx = [^$OLetter $Upper $Lower $Sep $CR $LF $ATerm $STerm] ($Extend | $Format)*;
74 $ATermEx $CloseEx* $SpEx* $NotLettersEx* $Lower;
|
| sent_el.txt | 25 $Lower = [\p{Sentence_Break = Lower}];
40 $LowerEx = $Lower ($Extend | $Format)*;
73 $NotLettersEx = [^$OLetter $Upper $Lower $Sep $CR $LF $ATerm $STerm] ($Extend | $Format)*;
74 $ATermEx $CloseEx* $SpEx* $NotLettersEx* $Lower;
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| RangeConstraintManager.cpp | 115 const llvm::APSInt &Lower,
129 if (i->To() < Lower) {
136 if (i->Includes(Lower)) {
138 newRanges = F.add(newRanges, Range(BV.getValue(Lower),
142 newRanges = F.add(newRanges, Range(BV.getValue(Lower), i->To()));
158 bool pin(llvm::APSInt &Lower, llvm::APSInt &Upper) const {
160 // both the upper and lower bounds against the symbol's type.
165 APSIntType::RangeTestResultKind LowerTest = Type.testInRange(Lower, true);
174 if (Lower <= Upper)
178 Lower = Type.getMinValue()
[all...] |
| /external/eigen/lapack/ |
| cholesky.cpp | 30 else ret = int(internal::llt_inplace<Scalar, Lower>::blocked(A));
67 A.triangularView<Lower>().solveInPlace(B);
68 A.triangularView<Lower>().adjoint().solveInPlace(B);
|
| /external/llvm/lib/Target/BPF/ |
| BPFAsmPrinter.cpp | 52 MCInstLowering.Lower(MI, TmpInst);
|
| BPFMCInstLower.h | 1 //===-- BPFMCInstLower.h - Lower MachineInstr to MCInst ---------*- C++ -*-===//
26 // BPFMCInstLower - This class is used to lower an MachineInstr into an MCInst.
35 void Lower(const MachineInstr *MI, MCInst &OutMI) const;
|
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyMCInstLower.h | 1 //===-- WebAssemblyMCInstLower.h - Lower MachineInstr to MCInst -*- C++ -*-===//
11 /// \brief This file declares the class to lower WebAssembly MachineInstrs to
29 /// This class is used to lower an MachineInstr into an MCInst.
42 void Lower(const MachineInstr *MI, MCInst &OutMI) const;
|
| /external/llvm/lib/Target/XCore/ |
| XCoreMCInstLower.h | 1 //===-- XCoreMCInstLower.h - Lower MachineInstr to MCInst ------*- C++ -*--===//
24 /// \brief This class is used to lower an MachineInstr into an MCInst.
33 void Lower(const MachineInstr *MI, MCInst &OutMI) const;
|
| /external/swiftshader/third_party/LLVM/lib/Target/Mips/ |
| MipsMCInstLower.h | 1 //===-- MipsMCInstLower.h - Lower MachineInstr to MCInst -------------------==//
26 /// MipsMCInstLower - This class is used to lower an MachineInstr into an
36 void Lower(const MachineInstr *MI, MCInst &OutMI) const;
|
| /external/swiftshader/third_party/LLVM/lib/Target/X86/ |
| X86MCInstLower.h | 1 //===-- X86MCInstLower.h - Lower MachineInstr to MCInst -------------------===//
29 /// X86MCInstLower - This class is used to lower an MachineInstr into an MCInst.
41 void Lower(const MachineInstr *MI, MCInst &OutMI) const;
|
| /external/eigen/blas/ |
| level3_impl.h | 87 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, false,RowMajor,ColMajor>::run),
89 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, Conj, RowMajor,ColMajor>::run),\
94 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|0, false,RowMajor,ColMajor>::run),
96 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|0, Conj, RowMajor,ColMajor>::run),
99 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, false,ColMajor,ColMajor>::run),
106 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|0, false,ColMajor,ColMajor>::run),
115 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|UnitDiag,false,RowMajor,ColMajor>::run),
117 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|UnitDiag,Conj, RowMajor,ColMajor>::run),
122 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|UnitDiag,false,RowMajor,ColMajor>::run),
124 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|UnitDiag,Conj, RowMajor,ColMajor>::run)
[all...] |
