HomeSort by relevance Sort by last modified time
    Searched full:rows (Results 1 - 25 of 3134) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/eigen/doc/snippets/
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;
Matrix_resize_int.cpp 5 cout << "v: " << v.rows() << " rows, " << v.cols() << " cols" << endl;
6 cout << "w: " << w.rows() << " rows, " << w.cols() << " cols" << endl;
Tutorial_commainit_02.cpp 1 int rows=5, cols=5; variable
2 MatrixXf m(rows,cols);
5 MatrixXf::Zero(rows-3,3),
6 MatrixXf::Identity(rows-3,cols-3);
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/chromium_org/chrome/browser/ui/cocoa/
table_row_nsimage_cache_unittest.mm 16 std::vector<SkBitmap>* rows() {
47 std::vector<SkBitmap>* rows = table.rows();
48 rows->push_back(MakeImage(10, 10));
49 rows->push_back(MakeImage(20, 20));
50 rows->push_back(MakeImage(30, 30));
57 COMPARE_SK_NS_IMG_SIZES(rows->at(0), image0);
58 COMPARE_SK_NS_IMG_SIZES(rows->at(1), image1);
59 COMPARE_SK_NS_IMG_SIZES(rows->at(2), image2);
61 rows->clear()
    [all...]
  /external/chromium_org/third_party/WebKit/ManualTests/
textarea-iframe-navigation2.html 6 <textarea rows="3">
  /external/chromium_org/chrome/browser/
remove_rows_table_model.h 12 // A table model that also supports removing rows. Used for example for the
16 typedef std::set<size_t> Rows;
18 // Returns whether or not the rows can be removed.
19 virtual bool CanRemoveRows(const Rows& rows) const = 0;
21 // Remove the rows from the table.
22 virtual void RemoveRows(const Rows& rows) = 0;
24 // Removes all the rows.
  /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/eigen/test/eigen2/
eigen2_sparse_product.cpp 14 const int rows = ref.rows(); local
19 double density = std::max(8./(rows*cols), 0.01);
25 DenseMatrix refMat2 = DenseMatrix::Zero(rows, rows);
26 DenseMatrix refMat3 = DenseMatrix::Zero(rows, rows);
27 DenseMatrix refMat4 = DenseMatrix::Zero(rows, rows);
28 DenseMatrix dm4 = DenseMatrix::Zero(rows, rows)
    [all...]
eigen2_miscmatrices.cpp 21 int rows = m.rows(); local
24 int r = ei_random<int>(0, rows-1), r2 = ei_random<int>(0, rows-1), c = ei_random<int>(0, cols-1);
25 VERIFY_IS_APPROX(MatrixType::Ones(rows,cols)(r,c), static_cast<Scalar>(1));
26 MatrixType m1 = MatrixType::Ones(rows,cols);
28 VectorType v1 = VectorType::Random(rows);
34 square = MatrixType::Zero(rows, rows);
35 square.diagonal() = VectorType::Ones(rows);
    [all...]
eigen2_nomalloc.cpp 30 int rows = m.rows(); local
33 MatrixType m1 = MatrixType::Random(rows, cols),
34 m2 = MatrixType::Random(rows, cols),
35 m3(rows, cols),
36 mzero = MatrixType::Zero(rows, cols),
38 ::Identity(rows, rows),
40 ::Random(rows, rows);
    [all...]
eigen2_sparse_basic.cpp 48 const int rows = ref.rows(); local
53 double density = std::max(8./(rows*cols), 0.01);
58 SparseMatrixType m(rows, cols);
59 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
60 DenseVector vec1 = DenseVector::Random(rows);
88 int i = ei_random<int>(0,rows-1);
90 int h = ei_random<int>(1,rows-i-1);
117 for(int r=0; r<rows; r++)
167 DenseMatrix m1(rows,cols)
    [all...]
eigen2_basicstuff.cpp 17 int rows = m.rows(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m2 = MatrixType::Random(rows, cols),
24 m3(rows, cols),
25 mzero = MatrixType::Zero(rows, cols),
27 ::Identity(rows, rows),
28 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows);
    [all...]
  /external/eigen/test/
miscmatrices.cpp 20 Index rows = m.rows(); local
23 Index r = internal::random<Index>(0, rows-1), r2 = internal::random<Index>(0, rows-1), c = internal::random<Index>(0, cols-1);
24 VERIFY_IS_APPROX(MatrixType::Ones(rows,cols)(r,c), static_cast<Scalar>(1));
25 MatrixType m1 = MatrixType::Ones(rows,cols);
27 VectorType v1 = VectorType::Random(rows);
33 square = MatrixType::Zero(rows, rows);
34 square.diagonal() = VectorType::Ones(rows);
    [all...]
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);
22 VectorXf x(rows);
25 VERIFY(y.rows() == 1 && y.cols() == rows);
29 VERIFY(x.rows() == cols && x.cols() == 1);
  /external/chromium_org/third_party/WebKit/ManualTests/resources/
nestedframesets.html 1 <frameset cols="300,300" rows="*">
testframeset.html 1 <frameset rows="244,516" cols="*">
  /external/chromium-trace/trace-viewer/src/tracing/analysis/
analyze_slices_test.js 112 assertEquals(3, table.rows.length);
114 assertEquals('b', table.rows[0].text);
115 assertEquals(0, table.rows[1].time);
116 assertAlmostEquals(0.002, table.rows[2].time);
127 assertEquals(4, table.rows.length);
129 assertEquals('b', table.rows[0].text);
130 assertEquals('foo', table.rows[1].text);
131 assertEquals(0, table.rows[2].time);
132 assertAlmostEquals(0.002, table.rows[3].time);
143 assertEquals(6, table.rows.length)
    [all...]
  /external/eigen/doc/examples/
function_taking_eigenbase.cpp 8 std::cout << "size (rows, cols): " << b.size() << " (" << b.rows()
  /external/chromium_org/third_party/skia/src/utils/
SkMeshUtils.cpp 21 int texW, int texH, int rows, int cols) {
22 if (rows < 2 || cols < 2) {
34 fTexCount = rows * cols;
35 rows -= 1;
37 fIndexCount = rows * cols * 6;
54 for (int x = 0; x < rows; x++) {
56 *idx++ = index + rows + 1;
60 *idx++ = index + rows + 1;
61 *idx++ = index + rows + 2;
72 const SkScalar dx = SkIntToScalar(texW) / rows;
    [all...]
  /external/skia/src/utils/
SkMeshUtils.cpp 21 int texW, int texH, int rows, int cols) {
22 if (rows < 2 || cols < 2) {
34 fTexCount = rows * cols;
35 rows -= 1;
37 fIndexCount = rows * cols * 6;
54 for (int x = 0; x < rows; x++) {
56 *idx++ = index + rows + 1;
60 *idx++ = index + rows + 1;
61 *idx++ = index + rows + 2;
72 const SkScalar dx = SkIntToScalar(texW) / rows;
    [all...]
  /external/deqp/framework/common/
tcuMatrix.hpp 50 template <typename T, int Rows, int Cols>
54 typedef Vector<T, Rows> Element;
60 ROWS = Rows,
66 explicit Matrix (const T src[Rows*Cols]);
67 Matrix (const Vector<T, Rows>& src);
68 Matrix (const Matrix<T, Rows, Cols>& src);
71 Matrix<T, Rows, Cols>& operator= (const Matrix<T, Rows, Cols>& src);
72 Matrix<T, Rows, Cols>& operator*= (const Matrix<T, Rows, Cols>& src)
    [all...]

Completed in 5381 milliseconds

1 2 3 4 5 6 7 8 91011>>