| /external/eigen/Eigen/src/Geometry/ |
| OrthoMethods.h | 45 typename Scalar = typename VectorLhs::Scalar,
104 EIGEN_STATIC_ASSERT((internal::is_same<Scalar, typename OtherDerived::Scalar>::value),
131 typedef typename traits<Derived>::Scalar Scalar;
132 typedef typename NumTraits<Scalar>::Real RealScalar;
134 typedef Matrix<Scalar,2,1> Vector2;
155 typedef typename traits<Derived>::Scalar Scalar;
[all...] |
| /external/skia/src/xml/ |
| SkJSDisplayable.cpp | 232 SkScalar scalar = 0; local
243 scalar = scriptValue.fOperand.fScalar;
262 scalar = operand.fScalar;
277 if (SkScalarFraction(scalar) == 0)
278 *vp = INT_TO_JSVAL(SkScalarFloor(scalar));
280 *vp = DOUBLE_TO_JSVAL(scalar);
304 SkScalar scalar = 0; local
319 scalar = SkIntToScalar(JSVAL_TO_INT(value));
322 scalar = (float) *(double*) JSVAL_TO_DOUBLE(value);
337 scriptValue.fOperand.fScalar = scalar;
[all...] |
| /art/compiler/dex/ |
| backend.h | 45 * are held back to generate scalar code without exhausting vector
46 * registers, if scalar code also uses the vector registers.
|
| /external/chromium_org/third_party/icu/source/test/compat/ |
| tzone.pl | 25 if (scalar(@ARGV) == 5) {
55 if (scalar(@result) > 0) {
|
| /external/chromium_org/tools/perf/benchmarks/ |
| html5gaming.py | 18 from telemetry.value import scalar namespace
31 scalar.ScalarValue(results.current_page, 'Score', 'score', result))
|
| /external/chromium_org/tools/perf/measurements/ |
| record_per_area.py | 9 from telemetry.value import scalar namespace
62 results.AddValue(scalar.ScalarValue(
|
| endure.py | 10 from telemetry.value import scalar namespace
94 results.AddValue(scalar.ScalarValue(
97 results.AddValue(scalar.ScalarValue(
144 results.AddSummaryValue(scalar.ScalarValue(None, 'total_iterations',
148 results.AddSummaryValue(scalar.ScalarValue(None, 'total_time', 'seconds',
159 scalar.ScalarValue(None, value_name, units, max(values)))
|
| /external/chromium_org/tools/telemetry/telemetry/web_perf/metrics/ |
| smoothness.py | 8 from telemetry.value import scalar namespace
91 scalar.ScalarValue(
95 scalar.ScalarValue(
113 scalar.ScalarValue(
170 scalar.ScalarValue(
174 scalar.ScalarValue(
191 return scalar.ScalarValue(
215 return scalar.ScalarValue(
|
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| ConjugateGradient.h | 35 typedef typename Dest::Scalar Scalar;
36 typedef Matrix<Scalar,Dynamic,1> VectorType;
72 Scalar alpha = absNew / p.dot(tmp); // the amount we travel on dir
95 typename _Preconditioner = DiagonalPreconditioner<typename _MatrixType::Scalar> >
122 * and NumTraits<Scalar>::epsilon() for the tolerance.
168 typedef typename MatrixType::Scalar Scalar;
|
| /external/eigen/Eigen/src/plugins/ |
| CommonCwiseBinaryOps.h | 15 * \note If you want to substract a given scalar from all coefficients, see Cwise::operator-().
23 * \note If you want to add a given scalar to all coefficients, see Cwise::operator+().
|
| /external/eigen/doc/ |
| QuickReference.dox | 35 typedef Matrix<Scalar, RowsAtCompileTime, ColsAtCompileTime, Options> MyMatrixType;
36 typedef Array<Scalar, RowsAtCompileTime, ColsAtCompileTime, Options> MyArrayType;
39 \li \c Scalar is the scalar type of the coefficients (e.g., \c float, \c double, \c bool, \c int, etc.).
143 ObjectType::Scalar ObjectType::RowsAtCompileTime
326 scalar product</td><td>\code
344 scalar = vec1.dot(vec2);
345 scalar = col1.adjoint() * col2;
346 scalar = (col1.adjoint() * col2).value();\endcode
355 scalar = vec1.norm(); scalar = vec1.squaredNorm(
[all...] |
| HiPerformance.dox | 30 alpha is a scalar value, and op1, op2 can be transpose, adjoint, conjugate, or the identity.
32 unique scalar factor alpha, and for each side, its effective storage order, shape, and conjugation states.
33 More precisely each side is simplified by iteratively removing trivial expressions such as scalar multiple,
68 <td>This is a special feature of Eigen. Here the product between a scalar
70 returns a matrix product expression tracking the scalar scaling factor. <br>
119 expressions nested in a Block expression. Therefore the nested scalar
|
| /external/eigen/test/ |
| nomalloc.cpp | 38 typedef typename MatrixType::Scalar Scalar;
47 Scalar s1 = internal::random<Scalar>();
101 template<typename Scalar>
107 typedef Eigen::Matrix<Scalar,
112 typedef Eigen::Matrix<Scalar,
117 typedef Eigen::Matrix<std::complex<Scalar>,
|
| product_syrk.cpp | 15 typedef typename MatrixType::Scalar Scalar;
16 typedef Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::ColsAtCompileTime, RowMajor> RMatrixType;
17 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, Dynamic> Rhs1;
18 typedef Matrix<Scalar, Dynamic, MatrixType::RowsAtCompileTime> Rhs2;
19 typedef Matrix<Scalar, MatrixType::ColsAtCompileTime, Dynamic,RowMajor> Rhs3;
33 Scalar s1 = internal::random<Scalar>();
|
| /external/icu/icu4c/source/test/compat/ |
| tzone.pl | 25 if (scalar(@ARGV) == 5) {
55 if (scalar(@result) > 0) {
|
| /external/llvm/lib/Transforms/Scalar/ |
| LLVMBuild.txt | 1 ;===- ./lib/Transforms/Scalar/LLVMBuild.txt --------------------*- Conf -*--===;
20 name = Scalar
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| 2008-07-12-UnneededSelect1.ll | 1 ; RUN: opt < %s -analyze -scalar-evolution 2>&1 | FileCheck %s
4 ; CHECK: Printing analysis 'Scalar Evolution Analysis' for function 'foo'
|
| 2008-07-12-UnneededSelect2.ll | 1 ; RUN: opt < %s -analyze -scalar-evolution 2>&1 | FileCheck %s
4 ; CHECK: Printing analysis 'Scalar Evolution Analysis' for function 'a'
|
| 2009-01-02-SignedNegativeStride.ll | 1 ; RUN: opt < %s -analyze -scalar-evolution | FileCheck %s
4 ; CHECK: Printing analysis 'Scalar Evolution Analysis' for function 'func_15'
|
| /external/proguard/src/proguard/evaluation/value/ |
| ComparisonValue.java | 24 * This IntegerValue represents the result of a comparisons of two scalar
36 * Creates a new comparison integer value of the two given scalar values.
|
| /external/chromium_org/third_party/boringssl/src/crypto/ec/ |
| wnaf.c | 149 /* Determine the modified width-(w+1) Non-Adjacent Form (wNAF) of 'scalar'.
152 * scalar = \sum_j r[j]*2^j
157 static signed char *compute_wNAF(const BIGNUM *scalar, int w, size_t *ret_len) {
165 if (BN_is_zero(scalar)) {
186 if (BN_is_negative(scalar)) {
190 if (scalar->d == NULL || scalar->top == 0) {
195 len = BN_num_bits(scalar);
200 * BN_num_bits(scalar) + 1) */
205 window_val = scalar->d[0] & mask
[all...] |
| /external/deqp/doc/testspecs/GLES3/ |
| functional.shaders.int_op.txt | 32 + Integer scalar and vector unary operators:
36 + Integer scalar and vector binary operators:
51 + Scalar-scalar, vector-vector and vector-scalar binary operators
70 0..1. The resulting scalar or vector value is then written out as vertex or
|
| /external/eigen/Eigen/src/SparseLU/ |
| SparseLU_pivotL.h | 59 template <typename Scalar, typename Index>
60 Index SparseLUImpl<Scalar,Index>::pivotL(const Index jcol, const RealScalar& diagpivotthresh, IndexVector& perm_r, IndexVector& iperm_c, Index& pivrow, GlobalLU_t& glu)
68 Scalar* lu_sup_ptr = &(glu.lusup.data()[glu.xlusup(fsupc)]); // Start of the current supernode
69 Scalar* lu_col_ptr = &(glu.lusup.data()[glu.xlusup(jcol)]); // Start of jcol in the supernode
125 Scalar temp = Scalar(1.0) / lu_col_ptr[nsupc];
|
| /external/eigen/test/eigen2/ |
| gsl_helper.h | 24 template<typename Scalar, bool IsComplex = NumTraits<Scalar>::IsComplex> struct GslTraits
59 template<typename Scalar> struct GslTraits<Scalar,true>
150 res(i,j) = typename MatrixType::Scalar(
168 res[i] = typename VectorType::Scalar(
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixSquareRoot.h | 57 typedef typename MatrixType::Scalar Scalar;
142 Matrix<Scalar,2,2> block = T.template block<2,2>(i,i);
143 EigenSolver<Matrix<Scalar,2,2> > es(block);
156 Scalar tmp = (sqrtT.row(i).segment(i+1,j-i-1) * sqrtT.col(j).segment(i+1,j-i-1)).value();
166 Matrix<Scalar,1,2> rhs = T.template block<1,2>(i,j);
169 Matrix<Scalar,2,2> A = sqrtT.coeff(i,i) * Matrix<Scalar,2,2>::Identity();
180 Matrix<Scalar,2,1> rhs = T.template block<2,1>(i,j);
183 Matrix<Scalar,2,2> A = sqrtT.coeff(j,j) * Matrix<Scalar,2,2>::Identity()
[all...] |
