| /external/chromium_org/third_party/opus/src/silk/float/ |
| main_FLP.h | 230 const opus_int L, /* I Length of vectors */
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_common.h | 275 // small vectors.
|
| /external/compiler-rt/test/Unit/ |
| comparedf2_test.c | 145 static const struct TestVector vectors[] = { variable in typeref:struct:TestVector
473 const int numVectors = sizeof vectors / sizeof vectors[0];
476 if (test__cmpdf2(&vectors[i])) return 1;
|
| comparesf2_test.c | 145 static const struct TestVector vectors[] = { variable in typeref:struct:TestVector
473 const int numVectors = sizeof vectors / sizeof vectors[0];
476 if (test__cmpsf2(&vectors[i])) return 1;
|
| /external/dropbear/libtomcrypt/src/encauth/eax/ |
| eax_test.c | 156 /* Vectors from Brian Gladman */
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| ComplexEigenSolver.h | 31 * \f$ \lambda \f$ and vectors \f$ v \f$ such that \f$ Av = \lambda v
|
| /external/eigen/Eigen/src/Geometry/ |
| Homogeneous.h | 135 * \returns a matrix expression of homogeneous column (or row) vectors
|
| OrthoMethods.h | 67 * when using 4D vectors instead of 3D ones to get advantage of SSE/AltiVec vectorization.
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseMatrix.h | 146 /** \returns a const pointer to the array of the starting positions of the inner vectors.
150 /** \returns a non-const pointer to the array of the starting positions of the inner vectors.
155 /** \returns a const pointer to the array of the number of non zeros of the inner vectors.
159 /** \returns a non-const pointer to the array of the number of non zeros of the inner vectors.
[all...] |
| /external/eigen/bench/ |
| eig33.cpp | 110 // compute the eigen vectors
|
| /external/eigen/blas/ |
| chbmv.f | 18 * where alpha and beta are scalars, x and y are n element vectors and
|
| chpmv.f | 18 * where alpha and beta are scalars, x and y are n element vectors and
|
| chpr2.f | 18 * where alpha is a scalar, x and y are n element vectors and A is an
|
| ctpsv.f | 17 * where b and x are n element vectors and A is an n by n unit, or
|
| dsbmv.f | 18 * where alpha and beta are scalars, x and y are n element vectors and
|
| dspmv.f | 18 * where alpha and beta are scalars, x and y are n element vectors and
|
| dtpsv.f | 17 * where b and x are n element vectors and A is an n by n unit, or
|
| ssbmv.f | 18 * where alpha and beta are scalars, x and y are n element vectors and
|
| sspmv.f | 18 * where alpha and beta are scalars, x and y are n element vectors and
|
| stpsv.f | 17 * where b and x are n element vectors and A is an n by n unit, or
|
| zhbmv.f | 18 * where alpha and beta are scalars, x and y are n element vectors and
|
| zhpmv.f | 18 * where alpha and beta are scalars, x and y are n element vectors and
|
| zhpr2.f | 18 * where alpha is a scalar, x and y are n element vectors and A is an
|
| ztpsv.f | 17 * where b and x are n element vectors and A is an n by n unit, or
|
| /external/eigen/doc/ |
| A10_Eigen2SupportModes.dox | 47 \li Dot products over complex numbers. Eigen 2's dot product was linear in the first variable. Eigen 3's dot product is linear in the second variable. In other words, the Eigen 2 code \code x.dot(y) \endcode is equivalent to the Eigen 3 code \code y.dot(x) \endcode In yet other words, dot products are complex-conjugated in Eigen 3 compared to Eigen 2. The switch to the new convention was commanded by common usage, especially with the notation \f$ x^Ty \f$ for dot products of column-vectors.
|
