Lines Matching refs:rows
71 size_t rows = l.rows() + r.rows(); in operator &&() local
73 Matrix<T> toReturn(rows, cols); in operator &&()
75 for (rows = 0; rows < l.rows(); rows++) in operator &&()
77 toReturn(rows, cols) = l(rows, cols); in operator &&()
79 for (rows = 0; rows < r.rows(); rows++) in operator &&()
81 toReturn(rows + l.rows(), cols) = r(rows, cols); in operator &&()
101 size_t rows = t.rows() + 1; in operator &&() local
103 Matrix<T> toReturn(rows, cols); in operator &&()
105 for (rows = 0; rows < t.rows(); rows++) in operator &&()
107 toReturn(rows, cols) = t(rows, cols); in operator &&()
110 toReturn(t.rows(), cols) = b(cols); in operator &&()
130 size_t rows = 1 + b.rows(); in operator &&() local
132 Matrix<T> toReturn(rows, cols); in operator &&()
137 for (rows = 1; rows < b.rows()+1; rows++) in operator &&()
139 toReturn(rows, cols) = b(rows, cols); in operator &&()
153 if (l.rows() != r.rows()) in operator ||()
159 size_t rows = l.rows(); in operator ||() local
161 Matrix<T> toReturn(rows, cols); in operator ||()
164 for (rows = 0; rows < l.rows(); rows++) in operator ||()
165 toReturn(rows, cols) = l(rows, cols); in operator ||()
168 for (rows = 0; rows < l.rows(); rows++) in operator ||()
169 toReturn(rows, cols + l.cols()) = r(rows,cols); in operator ||()
183 if (l.rows() != r.size()) in operator ||()
189 size_t rows = l.rows(); in operator ||() local
191 Matrix<T> toReturn(rows, cols); in operator ||()
194 for (rows = 0; rows < l.rows(); rows++) in operator ||()
195 toReturn(rows, cols) = l(rows, cols); in operator ||()
197 for (rows = 0; rows < l.rows(); rows++) in operator ||()
198 toReturn(rows, l.cols()) = r(rows); in operator ||()
212 if (l.size() != r.rows()) in operator ||()
218 size_t rows = r.rows(); in operator ||() local
220 Matrix<T> toReturn(rows, cols); in operator ||()
222 for (rows = 0; rows < r.rows(); rows++) in operator ||()
223 toReturn(rows, 0) = l(rows); in operator ||()
226 for (rows = 0; rows < r.rows(); rows++) in operator ||()
227 toReturn(rows, cols) = r(rows, cols); in operator ||()
247 size_t rows = r.size(); in operator ||() local
248 Matrix<T> toReturn(rows, 2); in operator ||()
250 for (rows = 0; rows < r.size(); rows++) in operator ||()
252 toReturn(rows, 0) = l(rows); in operator ||()
253 toReturn(rows, 1) = r(rows); in operator ||()
269 if ((row >= l.rows()) || (col >= l.cols())) in minorMatrix()
279 return Matrix<T>(l,1,1,l.rows()-1,l.cols()-1); in minorMatrix()
283 return Matrix<T>(l,1,0,l.rows()-1,l.cols()-1); in minorMatrix()
287 return Matrix<T>(l,1,0,l.rows()-1,col) || in minorMatrix()
288 Matrix<T>(l,1,col+1,l.rows()-1,l.cols()-col-1); in minorMatrix()
291 else if (row == (l.rows() - 1)) in minorMatrix()
295 return Matrix<T>(l,0,1,l.rows()-1,l.cols()-1); in minorMatrix()
299 return Matrix<T>(l,0,0,l.rows()-1,l.cols()-1); in minorMatrix()
303 return Matrix<T>(l,0,0,l.rows()-1,col) || in minorMatrix()
304 Matrix<T>(l,0,col+1,l.rows()-1,l.cols()-col-1); in minorMatrix()
310 Matrix<T>(l,row+1,1,l.rows()-row-1,l.cols()-1); in minorMatrix()
315 Matrix<T>(l,row+1,0,l.rows()-row-1,l.cols()-1); in minorMatrix()
321 (Matrix<T>(l, row + 1, 0, l.rows()-row-1, col) || in minorMatrix()
322 Matrix<T>(l, row + 1, col + 1, l.rows()-row-1, l.cols()-col-1)); in minorMatrix()
332 Matrix<T> temp(m.cols(), m.rows()); in transpose()
334 for (i = 0; i < m.rows(); i++) in transpose()
404 for (i = 0; i < toReturn.rows(); i++) in ident()
416 if ( (m.rows() != m.cols()) || (m.cols() < 1) ) in diag()
422 const size_t dim = m.rows(); in diag()
439 if ( (m1.rows() != m1.cols()) || (m1.cols() < 1) || in blkdiag()
440 (m2.rows() != m2.cols()) || (m2.cols() < 1) ) in blkdiag()
446 const size_t dim1 = m1.rows(); in blkdiag()
447 const size_t dim2 = m2.rows(); in blkdiag()
521 if ((m.rows() != m.cols()) || (m.cols() == 0)) in inverse()
527 Matrix<T> toReturn(m.rows(), m.cols() * 2); in inverse()
534 MatrixSlice<T> ms(toReturn, 0, 0, m.rows(), m.cols()); in inverse()
540 MatrixSlice<T> ms(toReturn, 0, m.cols(), m.rows(), m.cols()); in inverse()
544 for (r = 0; r < m.rows(); r++) in inverse()
551 while ( (t < m.rows()) && (toReturn(t,r) == 0) ) in inverse()
554 if (t == m.rows()) in inverse()
570 for (t = 0; t < m.rows(); t++) in inverse()
581 return Matrix<T>(toReturn, 0, m.cols(), m.rows(), m.cols()); in inverse()
593 if ((m.rows() != m.cols()) || (m.cols() == 0)) { in inverseLUD()
598 size_t i,j,N=m.rows(); in inverseLUD()
622 if ((m.rows() != m.cols()) || (m.cols() == 0)) { in inverseLUD()
627 size_t i,j,N=m.rows(); in inverseLUD()
634 for(i = 0; i < m.rows(); i++) determ *= LU.LU(i,i); in inverseLUD()
655 if ((m.rows() != m.cols()) || (m.cols() == 0)) { in inverseSVD()
660 size_t i,j,N=m.rows(); in inverseSVD()
694 if ((m.rows() != m.cols()) || (m.cols() == 0)) { in inverseSVD()
699 size_t i,j,N=m.rows(); in inverseSVD()
739 if ((m.rows() != m.cols()) || (m.cols() == 0)) { in inverseSVD()
744 size_t i,j,N=m.rows(); in inverseSVD()
784 int N = m.rows(), i, j, k; in inverseChol()
817 if (l.cols() != r.rows()) in operator *()
823 Matrix<T> toReturn(l.rows(), r.cols(), T(0)); in operator *()
825 for (i = 0; i < toReturn.rows(); i++) in operator *()
847 Vector<T> toReturn(m.rows()); in operator *()
849 for (i = 0; i < m.rows(); i++) in operator *()
865 if (v.size() != m.rows()) in operator *()
876 for (j = 0; j < m.rows(); j++) in operator *()
890 if (l.cols() != r.cols() || l.rows() != r.rows()) in operator +()
896 Matrix<T> toReturn(l.rows(), r.cols(), T(0)); in operator +()
898 for (i = 0; i < toReturn.rows(); i++) in operator +()
913 if (l.cols() != r.cols() || l.rows() != r.rows()) in operator -()
919 Matrix<T> toReturn(l.rows(), r.cols(), T(0)); in operator -()
921 for (i = 0; i < toReturn.rows(); i++) in operator -()
955 for(int i = 0; i < a.rows(); i++) in maxabs()