Lines Matching refs:cols
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]) {
130 std::copy(m.data, m.data + (rows * cols), data);
139 rows = m.rows; cols = m.cols;
140 data = new PBQPNum[rows * cols];
141 std::copy(m.data, m.data + (rows * cols), data);
148 /// \brief Return the number of cols in this matrix.
149 unsigned getCols() const { return cols; }
154 return data + (r * cols);
160 return data + (r * cols);
165 Vector v(cols);
166 for (unsigned c = 0; c < cols; ++c)
181 std::fill(data, data + (rows * cols), val);
188 std::fill(data + (r * cols), data + ((r + 1) * cols), val);
194 assert(c < cols && "Column out of bounds.");
202 Matrix m(cols, rows);
204 for (unsigned c = 0; c < cols; ++c)
213 assert(rows == cols && "Attempt to diagonalize non-square matrix.");
223 assert(rows == m.rows && cols == m.cols &&
225 std::transform(data, data + (rows * cols), m.data, data,
233 return *std::min_element(data + (r * cols), data + ((r + 1) * cols));
247 std::transform(data + (r * cols), data + ((r + 1) * cols),
248 data + (r * cols),
262 return find_if(data, data + (rows * cols),
264 data + (rows * cols);
268 unsigned rows, cols;