13 #include "CoinPackedMatrix.hpp"
138 size_t oldSize = ordering.size();
139 ordering.resize(newSize);
140 for(
size_t i = oldSize ; i < newSize ; i++)
141 ordering[i] = static_cast<int>(i);
145 void create(
const CoinPackedMatrix &M);
void make_lower_to_be_upper()
int numNonEmptyCols()
Get number of non empty cols.
void make_upper_triangular(const MatrixStorageType &T)
A small wrap around std::vector to give easy access to array for interfacing with fortran code...
vector< int > rowOrdering_
bool operator()(const int &i, const int &j)
TMat & operator=(const TMat &rhs)
Assignment operator.
const vector< int > & orderByColumns()
Orders current matrix by columns.
TMat()
Default constructor.
const vector< int > & orderByRows()
Orders current matrix by rows.
void makeQuadUpperDiag()
Assuming that this is representing a quadratic form.
void make_full_upper_triangular()
void resizeOrdering(vector< int > &ordering, unsigned int newSize)
const RowS & nonEmptyCols() const
Get the list of non empty row.
Structure for ordering matrix by columns.
bool operator()(const int &i, const int &j)
vector< int > columnOrdering_
Structure for ordering matrix by columns.
const RowS & nonEmptyRows() const
Get the list of non empty row.
vector< std::pair< int, int > > RowS
Storage for non empty rows.
void removeDuplicates()
Remove the duplicated entries.
void resizeAndCopyArray(X *&array, unsigned int oldSize, unsigned int newSize)
Structure for ordering matrix.
void create(const CoinPackedMatrix &M)
Create the TMat from M.
int numNonEmptyRows()
Get number of non empty rows.