| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| MINRES.h | 169 * Upper, or Lower|Upper in which the full matrix entries will be considered. Default is Lower.
246 && (UpLo==(Lower|Upper))
251 EIGEN_STATIC_ASSERT(EIGEN_IMPLIES(MatrixWrapper::MatrixFree,UpLo==(Lower|Upper)),MATRIX_FREE_CONJUGATE_GRADIENT_IS_COMPATIBLE_WITH_UPPER_UNION_LOWER_MODE_ONLY);
252 typedef typename internal::conditional<UpLo==(Lower|Upper),
|
| /external/eigen/Eigen/src/PardisoSupport/ |
| PardisoSupport.h | 38 template<typename _MatrixType, int Options=Upper> class PardisoLLT;
39 template<typename _MatrixType, int Options=Upper> class PardisoLDLT;
431 * \tparam UpLo can be any bitwise combination of Upper, Lower. The default is Upper, meaning only the upper triangular part has to be used.
432 * Upper|Lower can be used to tell both triangular parts can be used as input.
472 // PARDISO supports only upper, row-major matrices
475 m_matrix.template selfadjointView<Upper>() = matrix.template selfadjointView<UpLo>().twistedBy(p_null);
493 * \tparam Options can be any bitwise combination of Upper, Lower, and Symmetric. The default is Upper, meaning only the upper triangular part has to be used
[all...] |
| /external/eigen/blas/ |
| level2_cplx_impl.h | 25 (internal::selfadjoint_matrix_vector_product<Scalar,int,ColMajor,Upper,false,false>::run),
110 (internal::selfadjoint_packed_rank1_update<Scalar,int,ColMajor,Upper,false,Conj>::run),
154 (internal::packed_rank2_update_selector<Scalar,int,Upper>::run),
202 (selfadjoint_rank1_update<Scalar,int,ColMajor,Upper,false,Conj>::run),
249 (internal::rank2_update_selector<Scalar,int,Upper>::run),
|
| /packages/services/BuiltInPrintService/jni/ipphelper/ |
| ipphelper.c | 86 double Upper;
429 int lower, upper; local
430 lower = ippGetRange(attr, i, &upper);
433 ippTagString(ippGetValueTag(attr)), lower, upper);
518 int lower, upper; local
519 lower = ippGetRange(attr, i, &upper);
521 ippTagString(ippGetValueTag(attr)), lower, upper);
665 char *upper = NULL; // 8.5 local
699 upper = strtok(NULL, x);
700 if (upper != NULL)
1004 int upper = 0; local
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixPower.h | 121 * (or destroyed) before evaluation. Only the upper triangular
168 res = (MatrixType::Identity(IminusT.rows(), IminusT.cols()) + res).template triangularView<Upper>()
204 MatrixType IminusT, sqrtT, T = m_A.template triangularView<Upper>();
223 T = sqrtT.template triangularView<Upper>();
230 res = res.template triangularView<Upper>() * res;
561 m_fT.topRightCorner(m_rank, m_nulls) = m_T.topLeftCorner(m_rank, m_rank).template triangularView<Upper>()
574 { res.noalias() = U * (T.template triangularView<Upper>() * U.adjoint()); }
582 { res.noalias() = (U * (T.template triangularView<Upper>() * U.adjoint())).real(); }
|
| /external/eigen/Eigen/src/Cholesky/ |
| LLT.h | 26 * \tparam _UpLo the triangular part that will be used for the decompositon: Lower (default) or Upper.
49 * Note that during the decomposition, only the upper triangular part of A is considered. Therefore,
114 /** \returns a view of the upper triangular matrix U */
216 * The strict upper part is not used and even not initialized.
353 if(rs>0) A11.adjoint().template triangularView<Upper>().template solveInPlace<OnTheRight>(A21);
366 template<typename Scalar> struct llt_inplace<Scalar, Upper>
393 typedef const TriangularView<const typename MatrixType::AdjointReturnType, Upper> MatrixU;
400 template<typename MatrixType> struct LLT_Traits<MatrixType,Upper>
403 typedef const TriangularView<const MatrixType, Upper> MatrixU;
407 { return llt_inplace<typename MatrixType::Scalar, Upper>::blocked(m)==-1;
[all...] |
| /external/eigen/Eigen/src/SparseCholesky/ |
| SimplicialCholesky.h | 213 if(m_P.size()==0 && (UpLo&Upper)==Upper)
220 tmp.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P);
281 typedef TriangularView<const typename CholMatrixType::AdjointReturnType, Eigen::Upper> MatrixU;
322 * or Upper. Default is Lower.
413 * or Upper. Default is Lower.
670 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>().twistedBy(m_P);
678 // we have to transpose the lower part to to the upper one
680 ap.template selfadjointView<Upper>() = a.template selfadjointView<UpLo>();
|
| /prebuilts/go/darwin-x86/src/unicode/ |
| letter.go | 53 // case representing sequences of alternating corresponding Upper and Lower
82 // Upper Lower Upper Lower.
182 // IsUpper reports whether the rune is an upper case letter.
188 return isExcludingLatin(Upper, r)
222 // In an Upper-Lower sequence, which always starts with
225 // {-1, 0, -1} LowerCase (Upper, Title are previous)
227 // sequence are upper case; the ones at odd offsets are lower.
250 // ToUpper maps the rune to upper case.
275 if 'a' <= r && r <= 'z' { // title case is upper case for ASCI
[all...] |
| graphic_test.go | 44 want := Is(Upper, i)
|
| letter_test.go | 350 if Is(Upper, i) != IsUpper(i) {
351 t.Errorf("IsUpper(U+%04X) disagrees with Is(Upper)", i)
363 t.Errorf("ToUpper(U+%04X) disagrees with To(Upper)", i)
376 upper := []rune("ABCÇDEFG?HI?JKLMNOÖPRS?TUÜVYZ")
378 u := upper[i]
383 t.Errorf("upper(U+%04X) is U+%04X not U+%04X", u, TurkishCase.ToUpper(u), u)
386 t.Errorf("upper(U+%04X) is U+%04X not U+%04X", l, TurkishCase.ToUpper(l), u)
416 // Extra special cases: has lower/upper but no case fold.
420 // Upper comes before lower (Cherokee).
|
| /prebuilts/go/linux-x86/src/unicode/ |
| letter.go | 53 // case representing sequences of alternating corresponding Upper and Lower
82 // Upper Lower Upper Lower.
182 // IsUpper reports whether the rune is an upper case letter.
188 return isExcludingLatin(Upper, r)
222 // In an Upper-Lower sequence, which always starts with
225 // {-1, 0, -1} LowerCase (Upper, Title are previous)
227 // sequence are upper case; the ones at odd offsets are lower.
250 // ToUpper maps the rune to upper case.
275 if 'a' <= r && r <= 'z' { // title case is upper case for ASCI
[all...] |
| graphic_test.go | 44 want := Is(Upper, i)
|
| letter_test.go | 350 if Is(Upper, i) != IsUpper(i) {
351 t.Errorf("IsUpper(U+%04X) disagrees with Is(Upper)", i)
363 t.Errorf("ToUpper(U+%04X) disagrees with To(Upper)", i)
376 upper := []rune("ABCÇDEFG?HI?JKLMNOÖPRS?TUÜVYZ")
378 u := upper[i]
383 t.Errorf("upper(U+%04X) is U+%04X not U+%04X", u, TurkishCase.ToUpper(u), u)
386 t.Errorf("upper(U+%04X) is U+%04X not U+%04X", l, TurkishCase.ToUpper(l), u)
416 // Extra special cases: has lower/upper but no case fold.
420 // Upper comes before lower (Cherokee).
|
| /external/eigen/Eigen/src/Core/products/ |
| SelfadjointMatrixVector.h | 175 enum { LhsUpLo = LhsMode&(Upper|Lower) };
244 enum { RhsUpLo = RhsMode&(Upper|Lower) };
251 selfadjoint_product_impl<Transpose<const Rhs>, int(RhsUpLo)==Upper ? Lower : Upper, false,
|
| GeneralMatrixMatrixTriangular_BLAS.h | 80 LowUp = IsLower ? Lower : Upper, \
101 LowUp = IsLower ? Lower : Upper, \
|
| TriangularMatrixVector_BLAS.h | 82 LowUp = IsLower ? Lower : Upper \
164 LowUp = IsLower ? Lower : Upper \
|
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 51 * is decomposed as A = PLU where L is unit-lower-triangular, U is upper-triangular, and P
135 /** \returns the LU decomposition matrix: the upper-triangular part is U, the
243 m_lu.template triangularView<Upper>().solveInPlace(dst);
260 dst = m_lu.template triangularView<Upper>().adjoint().solve(rhs);
265 dst = m_lu.template triangularView<Upper>().transpose().solve(rhs);
554 * m_lu.template triangularView<Upper>();
|
| FullPivLU.h | 36 * upper-triangular, and P and Q are permutation matrices. This is a rank-revealing LU
125 /** \returns the LU decomposition matrix: the upper-triangular part is U, the
604 .template triangularView<Upper>().toDenseMatrix();
652 * U is upper triangular, with eigenvalues sorted so that any zeros appear at the end.
687 .template triangularView<Upper>().solveInPlace(
783 .template triangularView<Upper>()
827 .template triangularView<Upper>()
838 .template triangularView<Upper>()
[all...] |
| /external/eigen/test/ |
| bandmatrix.cpp | 52 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero();
|
| qr_colpivoting.cpp | 46 cod.matrixT().topLeftCorner(rank, rank).template triangularView<Upper>();
117 MatrixType r = qr.matrixQR().template triangularView<Upper>();
175 Matrix<Scalar,Rows,Cols> r = qr.matrixQR().template triangularView<Upper>();
232 MatrixType r = qr.matrixQR().template triangularView<Upper>();
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| qrsolv.h | 79 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
|
| /external/pdfium/xfa/fxbarcode/oned/ |
| BC_OneDimWriter.h | 99 FX_WCHAR Upper(FX_WCHAR ch);
|
| /external/eigen/Eigen/src/Core/ |
| TriangularMatrix.h | 133 eigen_assert((mode==Upper && col>=row)
156 * \param Mode the kind of triangular matrix expression to construct. Can be #Upper,
158 * This is in fact a bit field; it must have either #Upper or #Lower,
209 TransposeMode = (Mode & Upper ? Lower : 0)
210 | (Mode & Lower ? Upper : 0)
286 /** \returns a selfadjoint view of the referenced triangular part which must be either \c #Upper or \c #Lower.
477 * is an upper (resp. lower) triangular matrix.
617 * The parameter \a Mode can have the following values: \c #Upper, \c #StrictlyUpper, \c #UnitUpper,
642 /** \returns true if *this is approximately equal to an upper triangular matrix,
732 * \tparam UpLo must be either Lower or Upper
[all...] |
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMqrsolv.h | 91 s.topLeftCorner(nsing, nsing).transpose().template triangularView<Upper>().solveInPlace(wa.head(nsing));
140 // Browse the nonzero elements of row j of the upper triangular s
178 wa.head(nsing) = R.topLeftCorner(nsing,nsing).template triangularView<Upper>().solve/*InPlace*/(wa.head(nsing));
|
| LMpar.h | 65 wa1.head(rank) = s.topLeftCorner(rank,rank).template triangularView<Upper>().solve(qtb.head(rank));
92 /* calculate an upper bound, paru, for the zero of the function. */
|
