| /external/icu/icu4c/source/data/brkitr/ |
| 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, \
|
| TriangularSolverMatrix_MKL.h | 46 IsLower = (Mode&Lower) == Lower, \
101 IsLower = (Mode&Lower) == Lower, \
|
| SelfadjointProduct.h | 32 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), (UpLo==Lower ? size-i : (i+1)))
33 += (alpha * cj(vecY[i])) * ConjLhsType(OtherMap(vecX+(UpLo==Lower ? i : 0),UpLo==Lower ? size-i : (i+1)));
43 selfadjoint_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::run(size,mat,stride,vecY,vecX,alpha);
|
| /external/eigen/test/ |
| 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));
|
| 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...] |
| cholesky.cpp | 35 MatrixType symmLo = symm.template triangularView<Lower>();
39 CholType<MatrixType,Lower> chollo(symmLo);
49 CholType<MatrixType,Lower> chol(symmCpy);
92 SquareMatrixType symmLo = symm.template triangularView<Lower>();
94 LLT<SquareMatrixType,Lower> chollo(symmLo);
121 m2 += symmLo.template selfadjointView<Lower>().llt().solve(matB);
122 VERIFY_IS_APPROX(m2, m1 + symmLo.template selfadjointView<Lower>().llt().solve(matB));
124 m2 -= symmLo.template selfadjointView<Lower>().llt().solve(matB);
125 VERIFY_IS_APPROX(m2, m1 - symmLo.template selfadjointView<Lower>().llt().solve(matB));
127 m2.noalias() += symmLo.template selfadjointView<Lower>().llt().solve(matB)
[all...] |
| product_notemporary.cpp | 77 VERIFY_EVALUATION_COUNT( m3.noalias() -= (s1 * m1).template triangularView<Lower>() * m2, 0);
87 VERIFY_EVALUATION_COUNT( m1.template triangularView<Lower>().solveInPlace(m3), 0);
88 VERIFY_EVALUATION_COUNT( m1.adjoint().template triangularView<Lower>().solveInPlace(m3.transpose()), 0);
90 VERIFY_EVALUATION_COUNT( m3.noalias() -= (s1 * m1).adjoint().template selfadjointView<Lower>() * (-m2*s3).adjoint(), 0);
92 VERIFY_EVALUATION_COUNT( rm3.noalias() = (s1 * m1.adjoint()).template selfadjointView<Lower>() * m2.adjoint(), 0);
95 VERIFY_EVALUATION_COUNT( m3.col(c0).noalias() = (s1 * m1).adjoint().template selfadjointView<Lower>() * (-m2.row(c0)*s3).adjoint(), 1);
101 VERIFY_EVALUATION_COUNT( m3.template selfadjointView<Lower>().rankUpdate(m2.adjoint()), 0);
105 VERIFY_EVALUATION_COUNT( m3.noalias() = m1.block(r0,r0,r1,r1).template selfadjointView<Lower>() * m2.block(r0,c0,r1,c1), 1);
|
| /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/eigen/unsupported/test/ |
| mpreal_support.cpp | 38 X = S.selfadjointView<Lower>().llt().solve(B);
39 VERIFY_IS_APPROX((S.selfadjointView<Lower>()*X).eval(),B);
48 VERIFY( (S.selfadjointView<Lower>() * eig.eigenvectors()).isApprox(eig.eigenvectors() * eig.eigenvalues().asDiagonal(), NumTraits<mpreal>::dummy_precision()*1e3) );
|
| /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/eigen/blas/ |
| PackedTriangularSolverVector.h | 23 IsLower = (Mode&Lower)==Lower
51 IsLower = (Mode&Lower)==Lower
80 ((Mode&Upper)==Upper ? Lower : Upper) | (Mode&UnitDiag),
|
| level2_impl.h | 88 func[TR | (UP << 2) | (NUNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, false,RowMajor>::run);
89 func[ADJ | (UP << 2) | (NUNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, Conj, RowMajor>::run);
91 func[NOTR | (LO << 2) | (NUNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|0, false,ColMajor>::run);
96 func[TR | (UP << 2) | (UNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,false,RowMajor>::run);
97 func[ADJ | (UP << 2) | (UNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,Conj, RowMajor>::run);
99 func[NOTR | (LO << 2) | (UNIT << 3)] = (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Lower|UnitDiag,false,ColMajor>::run);
143 func[TR | (UP << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|0, Scalar,false,Scalar,false,RowMajor>::run);
144 func[ADJ | (UP << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|0, Scalar,Conj, Scalar,false,RowMajor>::run);
146 func[NOTR | (LO << 2) | (NUNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|0, Scalar,false,Scalar,false,ColMajor>::run);
151 func[TR | (UP << 2) | (UNIT << 3)] = (internal::triangular_matrix_vector_product<int,Lower|UnitDiag,Scalar,false,Scalar,false,RowMajor>::run)
[all...] |
| PackedTriangularMatrixVector.h | 23 IsLower = (Mode & Lower) ==Lower,
52 IsLower = (Mode & Lower) ==Lower,
|
| level3_impl.h | 79 func[TR | (LEFT << 2) | (UP << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, false,RowMajor,ColMajor>::run);
80 func[ADJ | (LEFT << 2) | (UP << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, Conj, RowMajor,ColMajor>::run);
83 func[TR | (RIGHT << 2) | (UP << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|0, false,RowMajor,ColMajor>::run);
84 func[ADJ | (RIGHT << 2) | (UP << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|0, Conj, RowMajor,ColMajor>::run);
86 func[NOTR | (LEFT << 2) | (LO << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|0, false,ColMajor,ColMajor>::run);
90 func[NOTR | (RIGHT << 2) | (LO << 3) | (NUNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|0, false,ColMajor,ColMajor>::run);
96 func[TR | (LEFT << 2) | (UP << 3) | (UNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|UnitDiag,false,RowMajor,ColMajor>::run);
97 func[ADJ | (LEFT << 2) | (UP << 3) | (UNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Lower|UnitDiag,Conj, RowMajor,ColMajor>::run);
100 func[TR | (RIGHT << 2) | (UP << 3) | (UNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|UnitDiag,false,RowMajor,ColMajor>::run);
101 func[ADJ | (RIGHT << 2) | (UP << 3) | (UNIT << 4)] = (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Lower|UnitDiag,Conj, RowMajor,ColMajor>::run)
[all...] |
| /external/eigen/Eigen/src/Core/util/ |
| Constants.h | 166 /** View matrix as a lower triangular matrix. */
167 Lower=0x1,
170 /** %Matrix has ones on the diagonal; to be used in combination with #Lower or #Upper. */
172 /** %Matrix has zeros on the diagonal; to be used in combination with #Lower or #Upper. */
174 /** View matrix as a lower triangular matrix with ones on the diagonal. */
175 UnitLower=UnitDiag|Lower,
178 /** View matrix as a lower triangular matrix with zeros on the diagonal. */
179 StrictlyLower=ZeroDiag|Lower,
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| GeneralizedSelfAdjointEigenSolver.h | 33 * Only the \b lower \b triangular \b part of the input matrix is referenced.
84 * Only the lower triangular part of the matrix is referenced.
86 * Only the lower triangular part of the matrix is referenced.
117 * Only the lower triangular part of the matrix is referenced.
119 * Only the lower triangular part of the matrix is referenced.
185 MatrixType matC = matA.template selfadjointView<Lower>();
198 MatrixType matC = matA.template selfadjointView<Lower>();
211 MatrixType matC = matA.template selfadjointView<Lower>();
|
| /external/eigen/bench/spbench/ |
| sp_solver.cpp | 30 ConjugateGradient<SparseMatrix<double, ColMajor>, Lower,IncompleteCholesky<double,Lower> > solver;
48 if (sym != 0) { // symmetric matrices, only the lower part is stored
51 A = temp.selfadjointView<Lower>();
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseSelfAdjointView.h | 21 * \param UpLo can be either \c #Lower or \c #Upper
244 ((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
[all...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64MCInstLower.h | 1 //===-- AArch64MCInstLower.h - Lower MachineInstr to MCInst ---------------===//
28 /// AArch64MCInstLower - This class is used to lower an MachineInstr
39 void Lower(const MachineInstr *MI, MCInst &OutMI) const;
|
| /external/llvm/lib/Target/MSP430/ |
| MSP430MCInstLower.h | 1 //===-- MSP430MCInstLower.h - Lower MachineInstr to MCInst ------*- C++ -*-===//
25 /// MSP430MCInstLower - This class is used to lower an MachineInstr
34 void Lower(const MachineInstr *MI, MCInst &OutMI) const;
|
| /external/llvm/lib/Target/Mips/ |
| MipsMCInstLower.h | 1 //===-- MipsMCInstLower.h - Lower MachineInstr to MCInst -------*- C++ -*--===//
25 /// MipsMCInstLower - This class is used to lower an MachineInstr into an
34 void Lower(const MachineInstr *MI, MCInst &OutMI) const;
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT_MKL.h | 67 template<> struct llt_inplace<EIGTYPE, Lower> \
89 return llt_inplace<EIGTYPE, Lower>::rankUpdate(matt, vec.conjugate(), sigma); \
|
| /external/llvm/lib/Target/SystemZ/ |
| SystemZAsmPrinter.cpp | 70 SystemZMCInstLower Lower(MF->getContext(), *this);
80 .addExpr(Lower.getExpr(MI->getOperand(0), MCSymbolRefExpr::VK_PLT));
91 .addExpr(Lower.getExpr(MI->getOperand(0), MCSymbolRefExpr::VK_PLT));
164 Lower.lower(MI, LoweredMI);
203 SystemZMCInstLower Lower(MF->getContext(), *this);
204 MCOperand MO(Lower.lowerOperand(MI->getOperand(OpNo)));
|
