HomeSort by relevance Sort by last modified time
    Searched refs:cols (Results 76 - 100 of 866) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/eigen/blas/
GeneralRank1Update.h 22 static void run(Index rows, Index cols, Scalar* mat, Index stride, const Scalar* u, const Scalar* v, Scalar alpha)
28 for (Index i=0; i<cols; ++i)
36 static void run(Index rows, Index cols, Scalar* mat, Index stride, const Scalar* u, const Scalar* v, Scalar alpha)
38 general_rank1_update<Scalar,Index,ColMajor,ConjRhs,ConjRhs>::run(rows,cols,mat,stride,u,v,alpha);
  /external/eigen/doc/examples/
function_taking_eigenbase.cpp 8 std::cout << "size (rows, cols): " << b.size() << " (" << b.rows()
9 << ", " << b.cols() << ")" << std::endl;
  /external/eigen/test/
sizeoverflow.cpp 22 void triggerMatrixBadAlloc(Index rows, Index cols)
24 VERIFY_THROWS_BADALLOC( MatrixType m(rows, cols) );
25 VERIFY_THROWS_BADALLOC( MatrixType m; m.resize(rows, cols) );
26 VERIFY_THROWS_BADALLOC( MatrixType m; m.conservativeResize(rows, cols) );
39 // there are 2 levels of overflow checking. first in PlainObjectBase.h we check for overflow in rows*cols computations.
spqr_support.cpp 20 int cols = internal::random<int>(1,rows); local
21 double density = (std::max)(8./(rows*cols), 0.01);
23 A.resize(rows,cols);
24 dA.resize(rows,cols);
inplace_decomposition.cpp 24 Index cols = MatrixType::ColsAtCompileTime==Dynamic ? (square?rows:internal::random<Index>(2,rows)) : Index(MatrixType::ColsAtCompileTime); local
26 MatrixType A = MatrixType::Random(rows,cols);
28 ResType x(cols);
33 A.topRows(cols) = A.topRows(cols).adjoint() * A.topRows(cols);
46 if(rows==cols)
57 if(rows==cols)
71 if(rows==cols)
product_selfadjoint.cpp 22 Index cols = m.cols(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols),
56 m2.block(1,1,rows-1,cols-1).template selfadjointView<Lower>().rankUpdate(v1.tail(rows-1),v2.head(cols-1));
58 m3.block(1,1,rows-1,cols-1) += v1.tail(rows-1) * v2.head(cols-1).adjoint()+ v2.head(cols-1) * v1.tail(rows-1).adjoint();
sparse_basic.cpp 23 const Index cols = ref.cols(); local
31 double density = (std::max)(8./(rows*cols), 0.01);
38 SparseMatrixType m(rows, cols);
39 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
64 VERIFY_RAISES_ASSERT( m.coeffRef(0,m.cols()) = 0 );
69 DenseMatrix m1(rows,cols);
71 SparseMatrixType m2(rows,cols);
82 for (Index j=0; j<cols; ++j)
103 DenseMatrix m1(rows,cols);
    [all...]
  /external/libvpx/libvpx/vpx_dsp/
subtract.c 19 void vpx_subtract_block_c(int rows, int cols, int16_t *diff,
26 for (c = 0; c < cols; c++) diff[c] = src[c] - pred[c];
35 void vpx_highbd_subtract_block_c(int rows, int cols, int16_t *diff,
45 for (c = 0; c < cols; c++) {
  /external/opencv/cvaux/src/
cvvideo.cpp 64 if( frame->cols != even->cols || frame->cols != odd->cols ||
  /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/general/
GaussNewtonOptimizer.java 80 final double[] b = new double[cols];
81 final double[][] a = new double[cols][cols];
90 for (int j = 0; j < cols; ++j) {
95 for (int k = 0; k < cols; ++k) {
98 for (int l = 0; l < cols; ++l) {
115 for (int i = 0; i < cols; ++i) {
AbstractLeastSquaresOptimizer.java 63 protected int cols; field in class:AbstractLeastSquaresOptimizer
200 for (int j = 0; j < cols; ++j) {
232 index += cols;
277 double[][] jTj = new double[cols][cols];
278 for (int i = 0; i < cols; ++i) {
279 for (int j = i; j < cols; ++j) {
311 if (rows <= cols) {
314 rows, cols);
316 double[] errors = new double[cols];
    [all...]
  /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_cond_timedwait/
do-plot 32 if ! cols=$(grep "#[ ]*COLUMNS" $FILE)
38 cols=$(echo $cols | sed 's/#//')
39 columns=$(echo $cols | awk '{print $2;}')
43 column[$count]=$(echo $cols | awk -vcount=$count '{print $(2 + count);}')
  /external/syslinux/com32/rosh/
rosh.h 140 static inline int getscreensize(int fd, int *rows, int *cols)
147 if (cols)
148 *cols = 0;
154 if (cols)
155 *cols = ws.ws_col;
161 if (cols && !*cols) {
164 *cols = atoi(str);
167 if (!rows || !cols)
169 else if (!*rows || !*cols)
    [all...]
  /external/eigen/unsupported/test/
cxx11_tensor_generator.cpp 60 int cols = 48; local
63 means[1] = cols / 2.0f;
69 Tensor<float, 2> matrix(rows, cols);
73 for (int j = 0; j < cols; ++j) {
75 float g_cols = powf(cols/2.0f - j, 2) / (2.7f * 2.7f) * 0.5f;
  /external/ltp/testcases/open_posix_testsuite/stress/threads/fork/
do-plot 32 if ! cols=$(grep "#[ ]*COLUMNS" $FILE)
38 cols=$(echo $cols | sed 's/#//')
39 columns=$(echo $cols | awk '{print $2;}')
43 column[$count]=$(echo $cols | awk -vcount=$count '{print $(2 + count);}')
  /external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_create/
do-plot 32 if ! cols=$(grep "#[ ]*COLUMNS" $FILE)
38 cols=$(echo $cols | sed 's/#//')
39 columns=$(echo $cols | awk '{print $2;}')
43 column[$count]=$(echo $cols | awk -vcount=$count '{print $(2 + count);}')
  /external/ltp/testcases/open_posix_testsuite/stress/threads/sem_init/
do-plot 32 if ! cols=$(grep "#[ ]*COLUMNS" $FILE)
38 cols=$(echo $cols | sed 's/#//')
39 columns=$(echo $cols | awk '{print $2;}')
43 column[$count]=$(echo $cols | awk -vcount=$count '{print $(2 + count);}')
  /external/ltp/testcases/open_posix_testsuite/stress/threads/sem_open/
do-plot 32 if ! cols=$(grep "#[ ]*COLUMNS" $FILE)
38 cols=$(echo $cols | sed 's/#//')
39 columns=$(echo $cols | awk '{print $2;}')
43 column[$count]=$(echo $cols | awk -vcount=$count '{print $(2 + count);}')
  /external/gemmlowp/meta/generators/
gemm_NxMxK_neon.py 80 def GenerateZipRhs(emitter, aligned, cols, leftovers):
90 if cols is not 0:
92 ZipName(cols, leftovers, aligned),
97 def MulName(result_type, lhs_add, rhs_add, rows, cols):
98 return mul_Nx8_Mx8_neon.BuildName(result_type, lhs_add, rhs_add, rows, cols)
110 rows, cols, leftovers):
128 if cols is not 0:
130 MulName(result_type, lhs_add, rhs_add, rows, cols),
134 def GenerateQuantized8BitMul(emitter, aligned, rows, cols, leftovers):
138 cols, leftovers
    [all...]
mul_Nx8_Mx8_neon.py 65 """Emit inner loop for N rows x M cols multiplication."""
84 cols = len(right_lanes.lanes)
87 for i in range(0, rows * cols):
91 for col in range(0, cols):
92 index = row * cols + col
96 for i in range(0, rows * cols):
111 """Emit inner loop for 3 rows x 3 cols multiplication (register trick)."""
178 def Duplicate(emitter, registers, rows, cols, min_register, values):
181 if cols == 1 or cols == 2
    [all...]
  /art/tools/ahat/src/main/com/android/ahat/
HtmlDoc.java 102 public void table(DocString description, List<Column> subcols, List<Column> cols) {
103 mCurrentTableColumns = new Column[subcols.size() + cols.size()];
113 for (Column col : cols) {
120 for (int i = 0; i < cols.size() - 1; i++) {
121 if (cols.get(i).visible) {
122 ps.format("<th rowspan=\"2\">%s</th>", cols.get(i).heading.html());
125 if (!cols.isEmpty()) {
128 Column col = cols.get(cols.size() - 1);
  /external/eigen/Eigen/src/Core/products/
GeneralMatrixVector_BLAS.h 56 Index rows, Index cols, \
63 rows, cols, lhs, rhs, res, resIncr, alpha); \
66 rows, cols, lhs.data(), lhs.stride(), rhs.data(), rhs.stride(), res, resIncr, alpha); \
73 Index rows, Index cols, \
79 rows, cols, lhs.data(), lhs.stride(), rhs.data(), rhs.stride(), res, resIncr, alpha); \
95 Index rows, Index cols, \
100 BlasIndex m=convert_index<BlasIndex>(rows), n=convert_index<BlasIndex>(cols), \
106 m = convert_index<BlasIndex>(cols); \
111 Map<const GEMVVector, 0, InnerStride<> > map_x(rhs,cols,1,InnerStride<>(incx)); \
  /external/dng_sdk/source/
dng_pixel_buffer.cpp 549 uint32 cols = area.W (); local
562 cols,
574 if (rows == 1 && cols == 1 && dPlaneStep == 1 && value == 0)
587 cols,
602 if (rows == 1 && cols == 1 && dPlaneStep == 1 && value == 0)
615 cols,
630 if (rows == 1 && cols == 1 && dPlaneStep == 1 && value == 0)
643 cols,
718 uint32 cols = area.W (); local
741 cols,
1295 uint32 cols = dstArea.W (); local
1433 uint32 cols = fArea.W (); local
1518 uint32 cols = area.W (); local
1746 uint32 cols = area.W (); local
    [all...]
  /external/eigen/bench/
sparse_cholesky.cpp 44 void fillSpdMatrix(float density, int rows, int cols, EigenSparseSelfAdjointMatrix& dst)
46 dst.startFill(rows*cols*density);
47 for(int j = 0; j < cols; j++)
80 int cols = SIZE; local
84 VectorXf b = VectorXf::Random(cols);
85 VectorXf x = VectorXf::Random(cols);
92 EigenSparseSelfAdjointMatrix sm1(rows, cols);
94 fillSpdMatrix(density, rows, cols, sm1);
103 DenseMatrix m1(rows,cols);
117 for (int j=0; j<cols; ++j
    [all...]
  /external/eigen/Eigen/src/QR/
ColPivHouseholderQR_LAPACKE.h 52 Index cols = matrix.cols();\
58 m_colsTranspositions.resize(cols);\
63 m_colsPermutation.resize(cols); \
68 LAPACKE_##LAPACKE_PREFIX##geqp3( matrix_order, internal::convert_index<lapack_int,Index>(rows), internal::convert_index<lapack_int,Index>(cols), \
78 for(Index i=0;i<cols;i++) perm[i]--;\

Completed in 463 milliseconds

1 2 34 5 6 7 8 91011>>