| /external/eigen/test/ |
| sparse_permutations.cpp | 32 up = mat.template triangularView<Upper>();
35 up_sym_d = mat_d.template selfadjointView<Upper>();
39 VERIFY_IS_APPROX(up, DenseMatrix(mat_d.template triangularView<Upper>()));
68 res = mat.template selfadjointView<Upper>().twistedBy(p_null);
70 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full");
77 res = up.template selfadjointView<Upper>().twistedBy(p_null);
79 VERIFY(res.isApprox(res_d) && "upper selfadjoint to full");
86 res = mat.template selfadjointView<Upper>();
88 VERIFY(res.isApprox(res_d) && "full selfadjoint upper to full");
94 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;
|
| cholmod_support.cpp | 17 CholmodDecomposition<SparseMatrix<T>, Upper> g_chol_colmajor_upper; g_chol_colmajor_upper.setMode(CholmodSupernodalLLt);
19 CholmodDecomposition<SparseMatrix<T>, Upper> g_llt_colmajor_upper; g_llt_colmajor_upper.setMode(CholmodSimplicialLLt);
21 CholmodDecomposition<SparseMatrix<T>, Upper> g_ldlt_colmajor_upper; g_ldlt_colmajor_upper.setMode(CholmodLDLt);
24 CholmodSupernodalLLT<SparseMatrix<T>, Upper> chol_colmajor_upper;
26 CholmodSimplicialLLT<SparseMatrix<T>, Upper> llt_colmajor_upper;
28 CholmodSimplicialLDLT<SparseMatrix<T>, Upper> ldlt_colmajor_upper;
|
| triangular.cpp | 33 MatrixType m1up = m1.template triangularView<Upper>();
34 MatrixType m2up = m2.template triangularView<Upper>();
43 // VERIFY_IS_APPROX(m1up.transpose() * m2, m1.upper().transpose().lower() * m2);
48 r1.template triangularView<Upper>() += m1;
54 m1.template triangularView<Upper>() = m2.transpose() + m2;
72 m3 = m1.template triangularView<Upper>();
75 VERIFY(v2.isApprox(m3.transpose() * (m1.transpose().template triangularView<Upper>().solve(v2)), largerEps));
76 m3 = m1.template triangularView<Upper>();
77 VERIFY(v2.isApprox(m3 * (m1.template triangularView<Upper>().solve(v2)), largerEps));
82 m3 = m1.template triangularView<Upper>();
[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_syrk.cpp | 46 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs2,s1)._expression(),
47 (s1 * rhs2 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix());
49 VERIFY_IS_APPROX((m2.template triangularView<Upper>() += s1 * rhs22 * rhs2.adjoint()).nestedExpression(),
50 (s1 * rhs22 * rhs2.adjoint()).eval().template triangularView<Upper>().toDenseMatrix());
62 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs1.adjoint(),s1)._expression(),
63 (s1 * rhs1.adjoint() * rhs1).eval().template triangularView<Upper>().toDenseMatrix());
64 VERIFY_IS_APPROX((m2.template triangularView<Upper>() = s1 * rhs1.adjoint() * rhs11).nestedExpression(),
65 (s1 * rhs1.adjoint() * rhs11).eval().template triangularView<Upper>().toDenseMatrix());
73 VERIFY_IS_APPROX(m2.template selfadjointView<Upper>().rankUpdate(rhs3.adjoint(),s1)._expression(),
74 (s1 * rhs3.adjoint() * rhs3).eval().template triangularView<Upper>().toDenseMatrix())
[all...] |
| simplicial_cholesky.cpp | 15 SimplicialCholesky<SparseMatrix<T>, Upper> chol_colmajor_upper_amd;
17 SimplicialLLT<SparseMatrix<T>, Upper> llt_colmajor_upper_amd;
19 SimplicialLDLT<SparseMatrix<T>, Upper> ldlt_colmajor_upper_amd;
21 SimplicialLDLT<SparseMatrix<T>, Upper, NaturalOrdering<int> > ldlt_colmajor_upper_nat;
|
| product_mmtr.cpp | 39 CHECK_MMTR(matc, Upper, = s*(soc*soc.adjoint()));
41 CHECK_MMTR(matr, Upper, = soc*(s*sor.adjoint()));
44 CHECK_MMTR(matc, Upper, += s*(soc*sor.transpose()));
46 CHECK_MMTR(matr, Upper, += soc*(s*soc.adjoint()));
49 CHECK_MMTR(matc, Upper, -= s*(osc.transpose()*osc.conjugate()));
51 CHECK_MMTR(matr, Upper, -= soc*(s*soc.adjoint()));
|
| /cts/tools/signature-tools/src/signature/compare/model/ |
| IUpperBoundsDelta.java | 28 * This interface is aware, that for the first argument, the order of the upper
34 * Returns the upper bound delta of the first upper bound or {@code null} if
37 * @return the upper bound delta of the first upper bound, maybe {@code
43 * Returns a set of remaining upper bound deltas or {@code null} if no
46 * @return a set of remaining upper bound deltas, maybe {@code null}
|
| /external/eigen/doc/snippets/ |
| Tutorial_solve_triangular_inplace.cpp | 5 A.triangularView<Upper>().solveInPlace(b);
|
| MatrixBase_extract.cpp | 7 cout << "Here is the upper-triangular matrix extracted from m:" << endl
9 cout << "Here is the strictly-upper-triangular matrix extracted from m:" << endl
|
| Tutorial_solve_triangular.cpp | 7 Vector3f x = A.triangularView<Upper>().solve(b);
|
| /external/eigen/doc/examples/ |
| TemplateKeyword_simple.cpp | 8 dst.triangularView<Upper>() = src.triangularView<Upper>();
|
| /external/jmonkeyengine/engine/src/core/checkers/quals/ |
| DefaultLocation.java | 17 /** Apply default annotations to unannotated upper bounds: both
18 * explicit ones in <tt>extends</tt> clauses, and implicit upper bounds
|
| /libcore/luni/src/main/java/java/lang/reflect/ |
| WildcardType.java | 21 * A pattern type, such as the upper bounded wildcard {@code
24 * <p>Although this interface permits an arbitrary number of upper and lower
27 * <li><strong>No lower bound and one upper bound.</strong> Such types are
28 * written like {@code ? extends java.lang.Number}. When the upper bound is
32 * <li><strong>One lower bound and an upper bound of {@code
39 * Returns the array of types that represent the upper bounds of this type.
40 * The default upper bound is {@code Object}.
42 * @return an array containing the upper bounds types
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/random/ |
| RandomData.java | 46 * <code>lower</code> and <code>upper</code> (endpoints included).
53 * <li><code>lower < upper</code> (otherwise an IllegalArgumentException
58 * @param upper upper bound for generated integer
60 * and less than or equal to <code>upper</code>.
62 int nextInt(int lower, int upper);
66 * <code>lower</code> and <code>upper</code> (endpoints included).
74 * <li><code>lower < upper</code> (otherwise an IllegalArgumentException
79 * @param upper upper bound for generated intege
[all...] |
| /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
34 Lower = Upper = APInt::getMaxValue(BitWidth);
36 Lower = Upper = APInt::getMinValue(BitWidth);
42 : Lower(std::move(V)), Upper(Lower + 1) {}
45 : Lower(std::move(L)), Upper(std::move(U)) {
46 assert(Lower.getBitWidth() == Upper.getBitWidth() &&
48 assert((Lower != Upper || (Lower.isMaxValue() || Lower.isMinValue())) &&
49 "Lower == Upper, but they aren't min or max value!");
131 return Lower == Upper && Lower.isMaxValue()
[all...] |
| /cts/tools/signature-tools/src/signature/model/ |
| ITypeVariableDefinition.java | 27 * Returns the upper bounds for this type variable as specified by the
28 * extends clause. If no upper bounds are explicitly specified then
29 * java.lang.Object is returned as upper bound.
31 * @return the upper bounds for this type variable
|
| IWildcardType.java | 27 * Returns the upper bounds for this type variable as specified by the
28 * extends clause. If no upper bounds are explicitly specified then
29 * java.lang.Object is returned as upper bound.
31 * @return the upper bounds for this type variable
|
| /hardware/intel/common/libva/va/egl/ |
| va_egl.h | 13 * (lower 16bits is buffer index, upper 16bits
|
| /frameworks/base/core/java/android/util/ |
| Range.java | 44 * The endpoints are {@code [lower, upper]}; that
46 * to {@code upper}.
50 * @param upper The upper endpoint (inclusive)
52 * @throws NullPointerException if {@code lower} or {@code upper} is {@code null}
54 public Range(final T lower, final T upper) {
56 mUpper = checkNotNull(upper, "upper must not be null");
58 if (lower.compareTo(upper) > 0) {
59 throw new IllegalArgumentException("lower must be less than or equal to upper");
[all...] |
| /external/icu/icu4c/source/samples/case/ |
| ucase.c | 25 static const UChar upper[] = {0x61, 0x42, 0x49, 0}; /* upper = "aBI" */ local
50 length = u_strToLower(buffer, sizeof(buffer)/sizeof(buffer[0]), upper,
51 sizeof(upper)/sizeof(upper[0]), "tr", &errorCode);
57 u_fprintf(out, "u_strToLower(%S, turkish) -> %S\n", upper, buffer);
63 length = u_strToUpper(buffer, sizeof(buffer)/sizeof(buffer[0]), upper,
64 sizeof(upper)/sizeof(upper[0]), "en", &errorCode);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| UnivariateRealSolverImpl.java | 147 * @param max the upper bound for the interval.
170 * @param max the upper bound for the interval.
225 * @param upper the upper endpoint
227 * @return true if f(lower) * f(upper) < 0
230 protected boolean isBracketing(final double lower, final double upper,
234 final double f2 = function.value(upper);
255 * @param upper upper endpoint
258 protected void verifyInterval(final double lower, final double upper) {
[all...] |
| /external/libnfc-nxp/src/ |
| phDal4Nfc.h | 21 * \brief Common DAL for the upper layer.
60 /**< Used for messaging by DAL as well as Upper Layers */
71 * DAL context : This contains the information of the upper layer callback
76 phNfcIF_sCallBack_t cb_if; /**<Callback info registered by upper layer*/
91 calls read callback registered by upper layer */
94 calls read wait callback registered by upper layer */
97 calls write wait callback registered by upper layer */
100 calls notify callback registered by upper layer */
110 * reference details as registered by upper layer.
122 /**<Reference to read callback,registered by upper layer.This is of type \ref pphNfcIF_Transact_Completion_CB_t*
[all...] |
| /external/chromium-libpac/test/ |
| jstocstring.pl | 16 $upper = uc();
17 print FILE "#define $upper \\\n";
|
