| /external/eigen/test/ |
| 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...] |
| pardiso_support.cpp | 11 PardisoLLT < SparseMatrix<T, RowMajor>, Upper> pardiso_llt_upper;
13 PardisoLDLT < SparseMatrix<T, RowMajor>, Upper> pardiso_ldlt_upper;
|
| nomalloc.cpp | 58 m2.col(0).noalias() = m1.template triangularView<Upper>() * m1.col(0);
59 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.col(0);
60 m2.col(0).noalias() -= m1.template triangularView<Upper>() * m1.row(0).adjoint();
61 m2.col(0).noalias() -= m1.adjoint().template triangularView<Upper>() * m1.row(0).adjoint();
63 m2.row(0).noalias() = m1.row(0) * m1.template triangularView<Upper>();
64 m2.row(0).noalias() -= m1.row(0) * m1.adjoint().template triangularView<Upper>();
65 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.template triangularView<Upper>();
66 m2.row(0).noalias() -= m1.col(0).adjoint() * m1.adjoint().template triangularView<Upper>();
69 m2.col(0).noalias() = m1.template selfadjointView<Upper>() * m1.col(0);
70 m2.col(0).noalias() -= m1.adjoint().template selfadjointView<Upper>() * m1.col(0)
[all...] |
| product_symm.cpp | 42 VERIFY_IS_APPROX(rhs12 = (s1*m2).transpose().template selfadjointView<Upper>() * (s2*rhs1),
54 VERIFY_IS_APPROX(rhs12 = (s1*m2).adjoint().template selfadjointView<Upper>() * (s2*rhs1),
60 m2 = m1.template triangularView<Upper>(); rhs12.setRandom(); rhs13 = rhs12;
61 m3 = m2.template selfadjointView<Upper>();
63 VERIFY_IS_APPROX(rhs12 += (s1*m2).template selfadjointView<Upper>() * (s2*rhs1),
70 m2 = m1.template triangularView<Upper>();
71 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Upper>() * (s2*rhs2.adjoint()),
74 m2 = m1.template triangularView<Upper>();
83 m2 = m1.template triangularView<Upper>();
88 m2 = m1.template triangularView<Upper>(); rhs13 = rhs12
[all...] |
| sparse_solvers.cpp | 56 // upper - dense
58 VERIFY_IS_APPROX(refMat2.template triangularView<Upper>().solve(vec2),
59 m2.template triangularView<Upper>().solve(vec3));
60 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2),
61 m2.conjugate().template triangularView<Upper>().solve(vec3));
66 VERIFY_IS_APPROX(refMat2.conjugate().template triangularView<Upper>().solve(vec2),
67 mm2.conjugate().template triangularView<Upper>().solve(vec3));
72 VERIFY_IS_APPROX(refMat2.transpose().template triangularView<Upper>().solve(vec2),
73 m2.transpose().template triangularView<Upper>().solve(vec3));
75 // upper - transpos
[all...] |
| product_selfadjoint.cpp | 45 m2 = m1.template triangularView<Upper>();
46 m2.template selfadjointView<Upper>().rankUpdate(-v1,s2*v2,s3);
47 VERIFY_IS_APPROX(m2, (m1 + (s3*(-v1)*(s2*v2).adjoint()+numext::conj(s3)*(s2*v2)*(-v1).adjoint())).template triangularView<Upper>().toDenseMatrix());
49 m2 = m1.template triangularView<Upper>();
50 m2.template selfadjointView<Upper>().rankUpdate(-s2*r1.adjoint(),r2.adjoint()*s3,s1);
51 VERIFY_IS_APPROX(m2, (m1 + s1*(-s2*r1.adjoint())*(r2.adjoint()*s3).adjoint() + numext::conj(s1)*(r2.adjoint()*s3) * (-s2*r1.adjoint()).adjoint()).template triangularView<Upper>().toDenseMatrix());
|
| pastix_support.cpp | 21 PastixLLT< SparseMatrix<T, ColMajor>, Eigen::Upper > pastix_llt_upper;
22 PastixLDLT< SparseMatrix<T, ColMajor>, Eigen::Upper > pastix_ldlt_upper;
|
| product_trmv.cpp | 35 m3 = m1.template triangularView<Eigen::Upper>();
36 VERIFY((m3 * v1).isApprox(m1.template triangularView<Eigen::Upper>() * v1, largerEps));
45 m3 = m1.template triangularView<Eigen::Upper>();
46 VERIFY((m3.conjugate() * v1.conjugate()).isApprox(m1.conjugate().template triangularView<Eigen::Upper>() * v1.conjugate(), largerEps));
49 m3 = m1.template triangularView<Eigen::Upper>();
52 VERIFY((m3.transpose() * v1).isApprox(m1.transpose().template triangularView<Eigen::Upper>() * v1, largerEps));
59 m3 = m1.template triangularView<Eigen::Upper>();
62 VERIFY((m3.adjoint() * (s1*v1.conjugate())).isApprox(m1.adjoint().template triangularView<Eigen::Upper>() * (s1*v1.conjugate()), largerEps));
|
| product_trsolve.cpp | 48 VERIFY_TRSM(cmLhs .template triangularView<Upper>(), cmRhs);
50 VERIFY_TRSM(cmLhs.conjugate().template triangularView<Upper>(), rmRhs);
51 VERIFY_TRSM(cmLhs.adjoint() .template triangularView<Upper>(), rmRhs);
61 VERIFY_TRSM_ONTHERIGHT(cmLhs .template triangularView<Upper>(), cmRhs);
63 VERIFY_TRSM_ONTHERIGHT(cmLhs.conjugate().template triangularView<Upper>(), rmRhs);
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| CaseMap.java | 48 public static Upper toUpper() { return Upper.DEFAULT; }
118 public static final class Upper extends CaseMap {
119 private static final Upper DEFAULT = new Upper(0);
120 private static final Upper OMIT_UNCHANGED = new Upper(CaseMapImpl.OMIT_UNCHANGED_TEXT);
121 private Upper(int opt) { super(opt); }
128 public Upper omitUnchangedText() {
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| CaseMap.java | 49 public static Upper toUpper() { return Upper.DEFAULT; }
126 public static final class Upper extends CaseMap {
127 private static final Upper DEFAULT = new Upper(0);
128 private static final Upper OMIT_UNCHANGED = new Upper(CaseMapImpl.OMIT_UNCHANGED_TEXT);
129 private Upper(int opt) { super(opt); }
137 public Upper omitUnchangedText() {
|
| /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...] |
| /external/llvm/include/llvm/Support/ |
| Format.h | 147 bool Upper;
154 : HexValue(HV), DecValue(DV), Width(W), Hex(H), Upper(U),
165 bool Upper = false) {
167 return FormattedNumber(N, 0, Width, true, Upper, true);
178 bool Upper = false) {
180 return FormattedNumber(N, 0, Width, true, Upper, false);
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| RangeConstraintManager.cpp | 116 const llvm::APSInt &Upper,
132 if (i->From() > Upper) {
137 if (i->Includes(Upper)) {
139 BV.getValue(Upper)));
144 if (i->Includes(Upper)) {
145 newRanges = F.add(newRanges, Range(i->From(), BV.getValue(Upper)));
158 bool pin(llvm::APSInt &Lower, llvm::APSInt &Upper) const {
160 // both the upper and lower bounds against the symbol's type.
166 APSIntType::RangeTestResultKind UpperTest = Type.testInRange(Upper, true);
174 if (Lower <= Upper)
[all...] |
| /external/eigen/lapack/ |
| cholesky.cpp | 29 if(UPLO(*uplo)==UP) ret = int(internal::llt_inplace<Scalar, Upper>::blocked(A));
62 A.triangularView<Upper>().adjoint().solveInPlace(B);
63 A.triangularView<Upper>().solveInPlace(B);
|
| lu.cpp | 71 lu.triangularView<Upper>().solveInPlace(B);
75 lu.triangularView<Upper>().transpose().solveInPlace(B);
81 lu.triangularView<Upper>().adjoint().solveInPlace(B);
|
| /external/eigen/blas/ |
| level3_impl.h | 85 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|0, false,ColMajor,ColMajor>::run),
92 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Upper|0, false,ColMajor,ColMajor>::run),
101 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|0, false,RowMajor,ColMajor>::run),
103 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|0, Conj, RowMajor,ColMajor>::run),
108 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Upper|0, false,RowMajor,ColMajor>::run),
110 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Upper|0, Conj, RowMajor,ColMajor>::run),
113 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|UnitDiag,false,ColMajor,ColMajor>::run),
120 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheRight,Upper|UnitDiag,false,ColMajor,ColMajor>::run),
129 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|UnitDiag,false,RowMajor,ColMajor>::run),
131 (internal::triangular_solve_matrix<Scalar,DenseIndex,OnTheLeft, Upper|UnitDiag,Conj, RowMajor,ColMajor>::run)
[all...] |
| level2_impl.h | 91 (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, false,ColMajor>::run),
100 (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, false,RowMajor>::run),
102 (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|0, Conj, RowMajor>::run),
105 (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|UnitDiag,false,ColMajor>::run),
114 (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|UnitDiag,false,RowMajor>::run),
116 (internal::triangular_solve_vector<Scalar,Scalar,int,OnTheLeft, Upper|UnitDiag,Conj, RowMajor>::run),
150 (internal::triangular_matrix_vector_product<int,Upper|0, Scalar,false,Scalar,false,ColMajor>::run),
159 (internal::triangular_matrix_vector_product<int,Upper|0, Scalar,false,Scalar,false,RowMajor>::run),
161 (internal::triangular_matrix_vector_product<int,Upper|0, Scalar,Conj, Scalar,false,RowMajor>::run),
164 (internal::triangular_matrix_vector_product<int,Upper|UnitDiag,Scalar,false,Scalar,false,ColMajor>::run)
[all...] |
| /external/icu/icu4c/source/data/brkitr/rules/ |
| sent.txt | 26 $Upper = [\p{Sentence_Break = Upper}];
41 $UpperEx = $Upper ($Extend | $Format)*;
73 $NotLettersEx = [^$OLetter $Upper $Lower $Sep $CR $LF $ATerm $STerm] ($Extend | $Format)*;
|
| sent_el.txt | 26 $Upper = [\p{Sentence_Break = Upper}];
41 $UpperEx = $Upper ($Extend | $Format)*;
73 $NotLettersEx = [^$OLetter $Upper $Lower $Sep $CR $LF $ATerm $STerm] ($Extend | $Format)*;
|
| /external/eigen/Eigen/src/Core/ |
| SelfAdjointView.h | 22 * \param TriangularPart can be either \c #Lower or \c #Upper
68 TransposeMode = ((Mode & Upper) ? Lower : 0) | ((Mode & Lower) ? Upper : 0)
170 * The parameter \a TriMode can have the following values: \c #Upper, \c #StrictlyUpper, \c #UnitUpper,
180 typename internal::conditional<(TriMode&(Upper|Lower))==(UpLo&(Upper|Lower)),
185 typename internal::conditional<(TriMode&(Upper|Lower))==(UpLo&(Upper|Lower)), MatrixType&, typename MatrixType::ConstTransposeReturnType>::type tmp1(m_matrix);
186 typename internal::conditional<(TriMode&(Upper|Lower))==(UpLo&(Upper|Lower)), MatrixType&, typename MatrixType::AdjointReturnType>::type tmp2(tmp1)
[all...] |
| /external/eigen/Eigen/src/Householder/ |
| BlockHouseholder.h | 42 // triFactor.col(i).head(i) = triFactor.block(0,0,i,i).template triangularView<Upper>()
67 triFactor.row(i).tail(rt) = triFactor.row(i).tail(rt) * triFactor.bottomRightCorner(rt,rt).template triangularView<Upper>();
94 if(forward) tmp = T.template triangularView<Upper>() * tmp;
95 else tmp = T.template triangularView<Upper>().adjoint() * tmp;
|
| /external/eigen/doc/snippets/ |
| class_FullPivLU.cpp | 13 Matrix5x3 u = lu.matrixLU().triangularView<Upper>();
|
| /external/llvm/lib/Support/ |
| ScaledNumber.cpp | 34 uint64_t Upper = P1, Lower = P4;
37 Upper += getU(N) + (NewLower < Lower);
43 // Check whether the upper digit is empty.
44 if (!Upper)
48 unsigned LeadingZeros = countLeadingZeros(Upper);
51 Upper = Upper << LeadingZeros | Lower >> Shift;
52 return getRounded(Upper, Shift,
|
| /external/clang/unittests/Basic/ |
| VirtualFileSystemTest.cpp | 237 IntrusiveRefCntPtr<DummyFileSystem> Upper(new DummyFileSystem());
240 O->pushOverlay(Upper);
243 Upper->addDirectory("/upper-only");
252 Status1 = Upper->status("/upper-only");
254 Status2 = O->status("/upper-only");
260 // merged directories get the permissions of the upper dir
262 IntrusiveRefCntPtr<DummyFileSystem> Upper(new DummyFileSystem());
265 O->pushOverlay(Upper);
[all...] |
