| /external/tensorflow/tensorflow/core/kernels/ |
| winograd_transform.h | 36 virtual void GetFilterTransformMatrix(const int64 rows, const int64 cols,
39 virtual void GetInputTransformMatrix(const int64 rows, const int64 cols,
42 virtual void GetOutputTransformMatrix(const int64 rows, const int64 cols,
68 const int64 cols,
71 CHECK_GT(cols, 0);
72 memset(transform_matrix, 0, sizeof(T) * rows * cols);
75 transform_matrix[0 * cols + 0] = T(1.0);
77 transform_matrix[1 * cols + 0] = T(0.5);
78 transform_matrix[1 * cols + 1] = T(0.5);
79 transform_matrix[1 * cols + 2] = T(0.5)
[all...] |
| deep_conv2d_test.cc | 22 static void ComputeKroneckerProduct(const int rows, const int cols,
25 for (int j = 0; j < cols; ++j) {
26 const float v = matrix[i * cols + j];
27 const int output_index_base = cols * (i * rows * cols + j);
29 for (int l = 0; l < cols; ++l) {
30 const int input_index = k * cols + l;
31 const int output_index = k * cols * cols + l;
47 const int cols = 2 local
76 const int cols = 3; local
107 const int cols = 4; local
137 const int cols = 4; local
[all...] |
| /external/eigen/doc/snippets/ |
| Tutorial_commainit_02.cpp | 1 int rows=5, cols=5; variable
2 MatrixXf m(rows,cols);
4 MatrixXf::Zero(3,cols-3),
6 MatrixXf::Identity(rows-3,cols-3);
|
| Matrix_resize_int.cpp | 5 cout << "v: " << v.rows() << " rows, " << v.cols() << " cols" << endl;
6 cout << "w: " << w.rows() << " rows, " << w.cols() << " cols" << endl;
|
| Matrix_resize_NoChange_int.cpp | 3 cout << "m: " << m.rows() << " rows, " << m.cols() << " cols" << endl;
|
| Matrix_resize_int_NoChange.cpp | 3 cout << "m: " << m.rows() << " rows, " << m.cols() << " cols" << endl;
|
| tut_matrix_assignment_resizing.cpp | 2 std::cout << "a is of size " << a.rows() << "x" << a.cols() << std::endl;
5 std::cout << "a is now of size " << a.rows() << "x" << a.cols() << std::endl;
|
| /external/syslinux/com32/lib/sys/ |
| screensize.c | 5 int getscreensize(int fd, int *rows, int *cols)
15 *cols = fp->o.cols;
17 if (!*rows || !*cols) {
|
| /external/eigen/test/ |
| resize.cpp | 12 template<DenseIndex rows, DenseIndex cols>
15 MatrixXf A(rows, cols);
17 Matrix<double, rows, cols> C;
20 VERIFY(B.rows() == rows && B.cols() == cols);
25 VERIFY(y.rows() == 1 && y.cols() == rows);
27 y.resize(cols);
29 VERIFY(x.rows() == cols && x.cols() == 1);
|
| bandmatrix.cpp | 19 Index cols = _m.cols(); local
23 MatrixType m(rows,cols,supers,subs);
25 DenseMatrixType dm1(rows,cols);
43 for (int i=0; i<cols; ++i)
48 Index d = (std::min)(rows,cols);
49 Index a = std::max<Index>(0,cols-d-supers);
52 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero();
54 if(b>0) dm1.block(d+subs,0,b,cols).setZero()
66 Index cols = internal::random<Index>(1,10); local
[all...] |
| ctorleak.cpp | 42 Index rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE); local
43 Foo::object_limit = internal::random<Index>(0, rows*cols - 2);
49 std::cout << "\nMatrixX m(" << rows << ", " << cols << ");\n"; local
50 MatrixX m(rows, cols);
59 Foo::object_limit = (rows+1)*(cols+1);
60 MatrixX A(rows, cols);
61 VERIFY_IS_EQUAL(Foo::object_count, rows*cols);
63 VERIFY_IS_EQUAL(Foo::object_count, (rows+1)*cols);
65 VERIFY_IS_EQUAL(Foo::object_count, rows*(cols+1));
|
| /libcore/luni/src/test/java/tests/support/ |
| MockCallback.java | 24 public void columns(String cols[]) {
26 for (int i = 0; i <= cols.length; i++) {
27 System.out.println("<TD>" + cols[i] + "</TD>");
32 public boolean newrow(String cols[]) {
34 for (int i = 0; i <= cols.length; i++) {
35 System.out.println("<TD>" + cols[i] + "</TD>");
|
| /external/eigen/failtest/ |
| map_nonconst_ctor_on_const_ptr_2.cpp | 11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){
12 Map<MatrixXf> m(ptr, rows, cols);
|
| map_nonconst_ctor_on_const_ptr_3.cpp | 11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){
12 Map<MatrixXf, Aligned, InnerStride<2> > m(ptr, rows, cols, InnerStride<2>());
|
| map_nonconst_ctor_on_const_ptr_4.cpp | 11 void foo(const float *ptr, DenseIndex rows, DenseIndex cols){
12 Map<CV_QUALIFIER MatrixXf, Unaligned, OuterStride<> > m(ptr, rows, cols, OuterStride<>(2));
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| Math.h | 116 Matrix(unsigned rows, unsigned cols) :
117 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) {
122 Matrix(unsigned rows, unsigned cols, PBQPNum initVal) :
123 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) {
124 std::fill(data, data + (rows * cols), initVal);
129 rows(m.rows), cols(m.cols), data(new PBQPNum[rows * cols])
[all...] |
| /external/libvpx/libvpx/test/ |
| pp_filter_test.cc | 26 int dst_pixels_per_line, int cols, unsigned char *flimit, int size);
29 int rows, int cols, int flimit);
32 int cols, int flimit);
172 void SetCols(unsigned char *s, int rows, int cols, int src_width) {
174 for (int c = 0; c < cols; c++) {
182 int rows, int cols, int src_pitch) {
184 for (int c = 0; c < cols; c++) {
192 void RunFilterLevel(unsigned char *s, int rows, int cols, int src_width,
195 GetParam()(s, src_width, rows, cols, filter_level));
196 RunComparison(expected_output, s, rows, cols, src_width)
202 const int cols = 16; local
219 const int cols = 16; local
236 const int cols = 16; local
258 const int cols = 16; local
316 const int cols = 16; local
352 const int cols = 16; local
383 const int cols = 16; local
403 const int cols = 16; local
[all...] |
| /external/eigen/doc/examples/ |
| class_Block.cpp | 8 topLeftCorner(MatrixBase<Derived>& m, int rows, int cols)
10 return Eigen::Block<Derived>(m.derived(), 0, 0, rows, cols);
15 topLeftCorner(const MatrixBase<Derived>& m, int rows, int cols)
17 return Eigen::Block<const Derived>(m.derived(), 0, 0, rows, cols);
|
| /external/trappy/trappy/plotter/ |
| PlotLayout.py | 27 :param cols: The number of columns to draw
28 :type cols: int
35 and :math:`N_{cols}` such that:
39 N_{rows} = \\frac{N_{cols}}{N_{plots}}
42 def __init__(self, cols, num_plots, **kwargs):
44 self.cols = cols
51 if self.num_plots < self.cols:
52 self.cols = self.num_plots
53 self.rows = (self.num_plots / self.cols)
[all...] |
| /external/eigen/Eigen/src/Core/ |
| CommaInitializer.h | 42 : m_xpr(xpr), m_row(0), m_col(other.cols()), m_currentBlockRows(other.rows())
44 m_xpr.block(0, 0, other.rows(), other.cols()) = other;
55 const_cast<CommaInitializer&>(o).m_col = m_xpr.cols();
63 if (m_col==m_xpr.cols())
71 eigen_assert(m_col<m_xpr.cols()
83 if (m_col==m_xpr.cols() && (other.cols()!=0 || other.rows()!=m_currentBlockRows))
91 eigen_assert((m_col + other.cols() <= m_xpr.cols())
95 (m_row, m_col, other.rows(), other.cols()) = other
[all...] |
| /external/libavc/common/ |
| ih264_chroma_intra_pred_filters.c | 314 WORD32 rows, cols; /* loop variables*/ local
320 for(cols = 0; cols < 16; cols += 2)
322 *(pu1_dst + rows * dst_strd + cols) = *pu1_left;
324 *(pu1_dst + rows * dst_strd + cols + 1) = *(pu1_left + 1);
438 WORD32 rows, cols; /* loop variables*/ local
450 for(cols = 0; cols < 4; cols++
[all...] |
| /external/python/cpython3/Modules/_decimal/libmpdec/ |
| transpose.c | 51 std_trans(mpd_uint_t dest[], mpd_uint_t src[], mpd_size_t rows, mpd_size_t cols)
57 isrc = r * cols;
59 for (c = 0; c < cols; c++) {
73 swap_halfrows_pow2(mpd_uint_t *matrix, mpd_size_t rows, mpd_size_t cols, int dir)
86 assert(cols == mul_size_t(2, rows));
98 m = cols - 1;
113 for (offset = 0; offset < cols/2; offset += b) {
115 stride = (offset + b < cols/2) ? b : cols/2-offset;
117 hp = matrix + hn*cols/2
[all...] |
| transpose.h | 44 void std_trans(mpd_uint_t dest[], mpd_uint_t src[], mpd_size_t rows, mpd_size_t cols);
45 int transpose_pow2(mpd_uint_t *matrix, mpd_size_t rows, mpd_size_t cols);
46 void transpose_3xpow2(mpd_uint_t *matrix, mpd_size_t rows, mpd_size_t cols);
|
| /external/toybox/toys/pending/ |
| fmt.c | 34 int cols = 0, is_first = 1, indent_end = 0, line_length; local
41 if (cols > 0) xputc('\n');
44 cols = 0;
57 if (!is_first && (cols + (is_first?indent_end:1) + w) >= TT.width) {
60 cols = 0;
63 cols += (is_first?indent_end:1) + w;
68 if (cols > 0) xputc('\n');
|
| /external/eigen/bench/ |
| sparse_transpose.cpp | 39 int cols = SIZE; local
42 EigenSparseMatrix sm1(rows,cols), sm3(rows,cols);
47 fillMatrix(density, rows, cols, sm1);
52 DenseMatrix m1(rows,cols), m3(rows,cols);
59 std::cout << "Non zeros: " << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
81 GmmDynSparse gmmT3(rows,cols);
82 GmmSparse m1(rows,cols), m3(rows,cols);
[all...] |
