| /external/eigen/doc/snippets/ |
| SelfAdjointView_operatorNorm.cpp | 3 << ones.selfadjointView<Lower>().operatorNorm() << endl;
|
| SelfAdjointView_eigenvalues.cpp | 2 VectorXd eivals = ones.selfadjointView<Lower>().eigenvalues();
|
| MatrixBase_selfadjointView.cpp | 5 cout << "Here is the symmetric matrix extracted from the lower part of m:" << endl
6 << Matrix3i(m.selfadjointView<Lower>()) << endl;
|
| /external/eigen/blas/ |
| Rank2Update.h | 26 Map<Matrix<Scalar,Dynamic,1> >(mat+stride*i+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)) +=
27 numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1))
28 + alpha * numext::conj(v[i]) * OtherMap(u+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1));
45 Map<Matrix<Scalar,Dynamic,1> >(mat+offset, UpLo==Lower ? size-i : (i+1)) +=
46 numext::conj(alpha) * numext::conj(u[i]) * OtherMap(v+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1))
47 + alpha * numext::conj(v[i]) * OtherMap(u+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1))
[all...] |
| PackedSelfadjointProduct.h | 33 Map<Matrix<Scalar,Dynamic,1> >(mat, UpLo==Lower ? size-i : (i+1)) += alpha * cj(vec[i]) * ConjRhsType(OtherMap(vec+(UpLo==Lower ? i : 0), UpLo==Lower ? size-i : (i+1)));
35 mat[UpLo==Lower ? 0 : i] = numext::real(mat[UpLo==Lower ? 0 : i]);
36 mat += UpLo==Lower ? size-i : (i+1);
47 selfadjoint_packed_rank1_update<Scalar,Index,ColMajor,UpLo==Lower?Upper:Lower,ConjRhs,ConjLhs>::run(size,mat,vec,alpha);
|
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| ConstantRange.cpp | 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
34 Lower = Upper = APInt::getMaxValue(BitWidth);
36 Lower = Upper = APInt::getMinValue(BitWidth);
41 ConstantRange::ConstantRange(const APInt &V) : Lower(V), Upper(V + 1) {}
44 Lower(L), Upper(U) {
48 "Lower == Upper, but they aren't min or max value!");
119 return Lower == Upper && Lower.isMaxValue();
125 return Lower == Upper && Lower.isMinValue()
[all...] |
| /external/libchrome/sandbox/linux/services/ |
| resource_limits.h | 19 // Lower the soft and hard limit of |resource| to |limit|. If the current
20 // limit is lower than |limit|, keep it.
21 static bool Lower(int resource, rlim_t limit) WARN_UNUSED_RESULT;
|
| /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);
69 /// getLower - Return the lower value for this range...
71 const APInt &getLower() const { return Lower; }
79 uint32_t getBitWidth() const { return Lower.getBitWidth(); }
112 if (Upper == Lower + 1
[all...] |
| /external/eigen/test/ |
| cholmod_support.cpp | 17 CholmodDecomposition<SparseMatrix<T>, Lower> g_chol_colmajor_lower; g_chol_colmajor_lower.setMode(CholmodSupernodalLLt);
19 CholmodDecomposition<SparseMatrix<T>, Lower> g_llt_colmajor_lower; g_llt_colmajor_lower.setMode(CholmodSimplicialLLt);
21 CholmodDecomposition<SparseMatrix<T>, Lower> g_ldlt_colmajor_lower; g_ldlt_colmajor_lower.setMode(CholmodLDLt);
24 CholmodSupernodalLLT<SparseMatrix<T>, Lower> chol_colmajor_lower;
26 CholmodSimplicialLLT<SparseMatrix<T>, Lower> llt_colmajor_lower;
28 CholmodSimplicialLDLT<SparseMatrix<T>, Lower> ldlt_colmajor_lower;
|
| incomplete_cholesky.cpp | 18 ConjugateGradient<SparseMatrixType, Lower, IncompleteCholesky<T, Lower, AMDOrdering<I> > > cg_illt_lower_amd;
19 ConjugateGradient<SparseMatrixType, Lower, IncompleteCholesky<T, Lower, NaturalOrdering<I> > > cg_illt_lower_nat;
22 ConjugateGradient<SparseMatrixType, Upper|Lower, IncompleteCholesky<T, Lower, AMDOrdering<I> > > cg_illt_uplo_amd;
59 Eigen::Lower | Eigen::Upper,
|
| conjugate_gradient.cpp | 16 ConjugateGradient<SparseMatrixType, Lower > cg_colmajor_lower_diag;
18 ConjugateGradient<SparseMatrixType, Lower|Upper> cg_colmajor_loup_diag;
19 ConjugateGradient<SparseMatrixType, Lower, IdentityPreconditioner> cg_colmajor_lower_I;
|
| selfadjoint.cpp | 35 m3 = m1.template selfadjointView<Lower>();
36 VERIFY_IS_APPROX(MatrixType(m3.template triangularView<Lower>()), MatrixType(m1.template triangularView<Lower>()));
44 m3 = m1.template selfadjointView<Lower>();
46 m4 -= m1.template selfadjointView<Lower>();
52 Matrix3d m = Matrix3d::Random().selfadjointView<Lower>();
|
| product_mmtr.cpp | 41 CHECK_MMTR(matc, Lower, = s*soc*sor.adjoint());
43 CHECK_MMTR(matr, Lower, = s*soc*soc.adjoint());
46 CHECK_MMTR(matc, Lower, += s*soc*soc.adjoint());
48 CHECK_MMTR(matr, Lower, += s*sor*soc.adjoint());
51 CHECK_MMTR(matc, Lower, -= s*soc*soc.adjoint());
53 CHECK_MMTR(matr, Lower, -= s*soc*soc.adjoint());
56 CHECK_MMTR(matc, Lower, -= s*sqr*sqc.template triangularView<Upper>());
58 CHECK_MMTR(matc, Lower, += s*sqr*sqc.template triangularView<Lower>());
59 CHECK_MMTR(matc, Upper, = s*sqc*sqc.template triangularView<Lower>());
[all...] |
| product_symm.cpp | 36 m2 = m1.template triangularView<Lower>();
37 m3 = m2.template selfadjointView<Lower>();
39 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs1),
45 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().transpose() * (s2*rhs1),
48 VERIFY_IS_APPROX(rhs12 = (s1*m2).conjugate().template selfadjointView<Lower>() * (s2*rhs1),
51 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().conjugate() * (s2*rhs1),
57 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>().adjoint() * (s2*rhs1),
66 m2 = m1.template triangularView<Lower>();
67 VERIFY_IS_APPROX(rhs12 = (s1*m2).template selfadjointView<Lower>() * (s2*rhs2.adjoint()),
75 VERIFY_IS_APPROX(rhs12 = (s1*m2.adjoint()).template selfadjointView<Lower>() * (s2*rhs2.adjoint())
[all...] |
| product_syrk.cpp | 38 VERIFY_IS_APPROX((m2.template selfadjointView<Lower>().rankUpdate(rhs2,s1)._expression()),
39 ((s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
41 VERIFY_IS_APPROX(((m2.template triangularView<Lower>() += s1 * rhs2 * rhs22.adjoint()).nestedExpression()),
42 ((s1 * rhs2 * rhs22.adjoint()).eval().template triangularView<Lower>().toDenseMatrix()));
54 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs1.adjoint(),s1)._expression(),
55 (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix());
57 VERIFY_IS_APPROX((m2.template triangularView<Lower>() += s1 * rhs11.adjoint() * rhs1).nestedExpression(),
58 (s1 * rhs11.adjoint() * rhs1).eval().template triangularView<Lower>().toDenseMatrix());
69 VERIFY_IS_APPROX(m2.template selfadjointView<Lower>().rankUpdate(rhs3.adjoint(),s1)._expression(),
70 (s1 * rhs3.adjoint() * rhs3).eval().template triangularView<Lower>().toDenseMatrix())
[all...] |
| simplicial_cholesky.cpp | 15 SimplicialCholesky<SparseMatrixType, Lower> chol_colmajor_lower_amd;
17 SimplicialLLT< SparseMatrixType, Lower> llt_colmajor_lower_amd;
19 SimplicialLDLT< SparseMatrixType, Lower> ldlt_colmajor_lower_amd;
21 SimplicialLDLT< SparseMatrixType, Lower, NaturalOrdering<I> > ldlt_colmajor_lower_nat;
|
| sparse_permutations.cpp | 65 lo = mat.template triangularView<Lower>();
68 lo_sym_d = mat_d.template selfadjointView<Lower>();
72 VERIFY_IS_APPROX(lo, DenseMatrix(mat_d.template triangularView<Lower>()));
115 VERIFY( is_sorted( res = mat.template selfadjointView<Lower>().twistedBy(p_null) ));
117 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full");
124 VERIFY( is_sorted( res = lo.template selfadjointView<Lower>().twistedBy(p_null) ));
126 VERIFY(res.isApprox(res_d) && "lower selfadjoint full");
133 VERIFY( is_sorted( res = mat.template selfadjointView<Lower>() ));
135 VERIFY(res.isApprox(res_d) && "full selfadjoint lower to full");
141 VERIFY( is_sorted( res = lo.template selfadjointView<Lower>() ));
[all...] |
| /external/llvm/include/llvm/Support/ |
| UnicodeCharRanges.h | 26 /// \brief Represents a closed range of Unicode code points [Lower, Upper].
28 uint32_t Lower;
33 return Value < Range.Lower;
79 if (I != Ranges.begin() && Prev >= I->Lower) {
82 DEBUG(dbgs() << " should be less than succeeding lower bound 0x");
83 DEBUG(dbgs().write_hex(I->Lower) << "\n");
86 if (I->Upper < I->Lower) {
88 DEBUG(dbgs().write_hex(I->Lower));
89 DEBUG(dbgs() << " should not be less than lower bound 0x");
|
| /external/llvm/lib/IR/ |
| ConstantRange.cpp | 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
36 Lower = Upper = APInt::getMaxValue(BitWidth);
38 Lower = Upper = APInt::getMinValue(BitWidth);
44 : Lower(std::move(V)), Upper(Lower + 1) {}
47 : Lower(std::move(L)), Upper(std::move(U)) {
48 assert(Lower.getBitWidth() == Upper.getBitWidth() &&
50 assert((Lower != Upper || (Lower.isMaxValue() || Lower.isMinValue())) &
[all...] |
| /external/clang/unittests/Basic/ |
| VirtualFileSystemTest.cpp | 236 IntrusiveRefCntPtr<DummyFileSystem> Lower(new DummyFileSystem());
239 new vfs::OverlayFileSystem(Lower));
242 Lower->addDirectory("/lower-only");
246 ErrorOr<vfs::Status> Status1 = Lower->status("/lower-only");
248 ErrorOr<vfs::Status> Status2 = O->status("/lower-only");
261 IntrusiveRefCntPtr<DummyFileSystem> Lower(new DummyFileSystem());
264 new vfs::OverlayFileSystem(Lower));
268 Lower->addDirectory("/both", sys::fs::owner_read)
[all...] |
| /external/eigen/unsupported/test/ |
| minres.cpp | 18 MINRES<SparseMatrix<T>, Lower, IdentityPreconditioner > minres_colmajor_lower_I;
22 MINRES<SparseMatrix<T>, Lower, DiagonalPreconditioner<T> > minres_colmajor_lower_diag;
24 MINRES<SparseMatrix<T>, Lower|Upper, DiagonalPreconditioner<T> > minres_colmajor_uplo_diag;
|
| /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);
122 /// Return the lower value for this range.
124 const APInt &getLower() const { return Lower; }
132 uint32_t getBitWidth() const { return Lower.getBitWidth(); }
164 if (Upper == Lower + 1
[all...] |
| /external/icu/icu4c/source/test/testdata/break_rules/ |
| sentence.txt | 17 Lower = [\p{Sentence_Break = Lower}];
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/android_icu4j/src/main/java/android/icu/text/ |
| CaseMap.java | 43 public static Lower toLower() { return Lower.DEFAULT; }
75 public static final class Lower extends CaseMap {
76 private static final Lower DEFAULT = new Lower(0);
77 private static final Lower OMIT_UNCHANGED = new Lower(CaseMapImpl.OMIT_UNCHANGED_TEXT);
78 private Lower(int opt) { super(opt); }
85 public Lower omitUnchangedText() {
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| CaseMap.java | 43 public static Lower toLower() { return Lower.DEFAULT; }
80 public static final class Lower extends CaseMap {
81 private static final Lower DEFAULT = new Lower(0);
82 private static final Lower OMIT_UNCHANGED = new Lower(CaseMapImpl.OMIT_UNCHANGED_TEXT);
83 private Lower(int opt) { super(opt); }
91 public Lower omitUnchangedText() {
|
