Lines Matching full:m1
15 block_real_only(const MatrixType &m1, Index r1, Index r2, Index c1, Index c2, const Scalar& s1) { in block_real_only() argument
17 VERIFY_IS_APPROX(m1.row(r1).cwiseMax(s1), m1.cwiseMax(s1).row(r1)); in block_real_only()
18 VERIFY_IS_APPROX(m1.col(c1).cwiseMin(s1), m1.cwiseMin(s1).col(c1)); in block_real_only()
20 …VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMin(s1), m1.cwiseMin(s1).block(r1,c1,r2-r1+1… in block_real_only()
21 …VERIFY_IS_APPROX(m1.block(r1,c1,r2-r1+1,c2-c1+1).cwiseMax(s1), m1.cwiseMax(s1).block(r1,c1,r2-r1+1… in block_real_only()
46 MatrixType m1 = MatrixType::Random(rows, cols), in block() local
47 m1_copy = m1, in block()
60 block_real_only(m1, r1, r2, c1, c1, s1); in block()
63 VERIFY_IS_EQUAL(m1.col(c1).transpose(), m1.transpose().row(c1)); in block()
65 m1 = m1_copy; in block()
66 m1.row(r1) += s1 * m1_copy.row(r2); in block()
67 VERIFY_IS_APPROX(m1.row(r1), m1_copy.row(r1) + s1 * m1_copy.row(r2)); in block()
69 m1.row(r1).row(0) += s1 * m1_copy.row(r2); in block()
70 VERIFY_IS_APPROX(m1.row(r1), m1_copy.row(r1) + Scalar(2) * s1 * m1_copy.row(r2)); in block()
71 m1 = m1_copy; in block()
72 m1.col(c1) += s1 * m1_copy.col(c2); in block()
73 VERIFY_IS_APPROX(m1.col(c1), m1_copy.col(c1) + s1 * m1_copy.col(c2)); in block()
74 m1.col(c1).col(0) += s1 * m1_copy.col(c2); in block()
75 VERIFY_IS_APPROX(m1.col(c1), m1_copy.col(c1) + Scalar(2) * s1 * m1_copy.col(c2)); in block()
79 Matrix<Scalar,Dynamic,Dynamic> b1(1,1); b1(0,0) = m1(r1,c1); in block()
81 RowVectorType br1(m1.block(r1,0,1,cols)); in block()
82 VectorType bc1(m1.block(0,c1,rows,1)); in block()
83 VERIFY_IS_EQUAL(b1, m1.block(r1,c1,1,1)); in block()
84 VERIFY_IS_EQUAL(m1.row(r1), br1); in block()
85 VERIFY_IS_EQUAL(m1.col(c1), bc1); in block()
87 m1.block(r1,c1,r2-r1+1,c2-c1+1) = s1 * m2.block(0, 0, r2-r1+1,c2-c1+1); in block()
88 m1.block(r1,c1,r2-r1+1,c2-c1+1)(r2-r1,c2-c1) = m2.block(0, 0, r2-r1+1,c2-c1+1)(0,0); in block()
97 m1.template block<BlockRows,BlockCols>(1,1) *= s1; in block()
99 m1.template block<BlockRows,BlockCols>(1,1)(0, 3) = m1.template block<2,5>(1,1)(1,2); in block()
101 Matrix<Scalar,Dynamic,Dynamic> b = m1.template block<BlockRows,BlockCols>(3,3); in block()
102 VERIFY_IS_EQUAL(b, m1.block(3,3,BlockRows,BlockCols)); in block()
105 m1.template block<BlockRows,Dynamic>(1,1,BlockRows,BlockCols) *= s1; in block()
106 …m1.template block<BlockRows,Dynamic>(1,1,BlockRows,BlockCols)(0,3) = m1.template block<2,5>(1,1)(1… in block()
107 Matrix<Scalar,Dynamic,Dynamic> b2 = m1.template block<Dynamic,BlockCols>(3,3,2,5); in block()
108 VERIFY_IS_EQUAL(b2, m1.block(3,3,BlockRows,BlockCols)); in block()
137 …VERIFY_IS_EQUAL( (m1.block(r1,c1,rows-r1,cols-c1).block(r2-r1,c2-c1,rows-r2,cols-c2)) , (m1.block(… in block()
138 VERIFY_IS_EQUAL( (m1.block(r1,c1,r2-r1+1,c2-c1+1).row(0)) , (m1.row(r1).segment(c1,c2-c1+1)) ); in block()
139 VERIFY_IS_EQUAL( (m1.block(r1,c1,r2-r1+1,c2-c1+1).col(0)) , (m1.col(c1).segment(r1,r2-r1+1)) ); in block()
140 …VERIFY_IS_EQUAL( (m1.block(r1,c1,r2-r1+1,c2-c1+1).transpose().col(0)) , (m1.row(r1).segment(c1,c2-… in block()
141 …VERIFY_IS_EQUAL( (m1.transpose().block(c1,r1,c2-c1+1,r2-r1+1).col(0)) , (m1.row(r1).segment(c1,c2-… in block()
144 …VERIFY_IS_EQUAL( ((m1+m2).block(r1,c1,rows-r1,cols-c1).block(r2-r1,c2-c1,rows-r2,cols-c2)) , ((m1+… in block()
145 …VERIFY_IS_EQUAL( ((m1+m2).block(r1,c1,r2-r1+1,c2-c1+1).row(0)) , ((m1+m2).row(r1).segment(c1,c2-c1… in block()
146 …VERIFY_IS_EQUAL( ((m1+m2).block(r1,c1,r2-r1+1,c2-c1+1).col(0)) , ((m1+m2).col(c1).segment(r1,r2-r1… in block()
147 …VERIFY_IS_EQUAL( ((m1+m2).block(r1,c1,r2-r1+1,c2-c1+1).transpose().col(0)) , ((m1+m2).row(r1).segm… in block()
148 …VERIFY_IS_EQUAL( ((m1+m2).transpose().block(c1,r1,c2-c1+1,r2-r1+1).col(0)) , ((m1+m2).row(r1).segm… in block()
154 dm = m1.block(r1,c1,rows-r1,cols-c1).block(r2-r1,c2-c1,rows-r2,cols-c2); in block()
155 VERIFY_IS_EQUAL(dm, (m1.block(r2,c2,rows-r2,cols-c2))); in block()
158 dm = m1.block(r1,c1,r2-r1+1,c2-c1+1).row(0).transpose(); in block()
159 dv = m1.row(r1).segment(c1,c2-c1+1); in block()
163 dm = m1.col(c1).segment(r1,r2-r1+1); in block()
164 dv = m1.block(r1,c1,r2-r1+1,c2-c1+1).col(0); in block()
168 dm = m1.block(r1,c1,r2-r1+1,c2-c1+1).transpose().col(0); in block()
169 dv = m1.row(r1).segment(c1,c2-c1+1); in block()
173 dm = m1.row(r1).segment(c1,c2-c1+1).transpose(); in block()
174 dv = m1.transpose().block(c1,r1,c2-c1+1,r2-r1+1).col(0); in block()
225 MatrixType m1 = MatrixType::Random(rows, cols); in data_and_stride() local
226 compare_using_data_and_stride(m1.block(r1, c1, r2-r1+1, c2-c1+1)); in data_and_stride()
227 compare_using_data_and_stride(m1.transpose().block(c1, r1, c2-c1+1, r2-r1+1)); in data_and_stride()
228 compare_using_data_and_stride(m1.row(r1)); in data_and_stride()
229 compare_using_data_and_stride(m1.col(c1)); in data_and_stride()
230 compare_using_data_and_stride(m1.row(r1).transpose()); in data_and_stride()
231 compare_using_data_and_stride(m1.col(c1).transpose()); in data_and_stride()