|
| BCP_lp_var_pool () |
|
| ~BCP_lp_var_pool () |
|
bool | cols_are_valid () const |
|
void | cols_are_valid (bool status) |
|
void | compute_red_costs (const BCP_lp_result &lpres, BCP_lp_var_pool::iterator first, BCP_lp_var_pool::iterator last) |
|
int | remove_positives (const double etol) |
|
| BCP_vec (const size_t n, const_reference value) |
|
| BCP_vec (const_iterator first, const_iterator last) |
|
| BCP_vec (const bool *x, const size_t num) |
|
| BCP_vec (const size_t n, const_reference value) |
|
| BCP_vec (const_iterator first, const_iterator last) |
|
| BCP_vec (const short *x, const size_t num) |
|
void | reserve (const size_t n) |
|
void | reserve (const size_t n) |
|
BCP_vec< bool > & | operator= (const BCP_vec< bool > &x) |
|
BCP_vec< short > & | operator= (const BCP_vec< short > &x) |
|
void | assign (const void *x, const size_t num) |
|
void | assign (const void *x, const size_t num) |
|
void | insert (bool *position, const void *first, const size_t n) |
|
void | insert (iterator position, const_iterator first, const_iterator last) |
|
void | insert (iterator position, const size_t n, const_reference x) |
|
BCP_vec< bool >::iterator | insert (iterator position, const_reference x) |
|
void | insert (short *position, const void *first, const size_t n) |
|
void | insert (iterator position, const_iterator first, const_iterator last) |
|
void | insert (iterator position, const size_t n, const_reference x) |
|
BCP_vec< short >::iterator | insert (iterator position, const_reference x) |
|
void | push_back (const_reference x) |
|
void | push_back (const_reference x) |
|
void | unchecked_push_back (const_reference x) |
|
void | unchecked_push_back (const_reference x) |
|
void | pop_back () |
|
void | pop_back () |
|
void | update (const BCP_vec< int > &positions, const BCP_vec< bool > &values) |
|
void | update (const BCP_vec< int > &positions, const BCP_vec< short > &values) |
|
void | unchecked_update (const BCP_vec< int > &positions, const BCP_vec< bool > &values) |
|
void | unchecked_update (const BCP_vec< int > &positions, const BCP_vec< short > &values) |
|
void | keep (iterator pos) |
|
void | keep (iterator first, iterator last) |
|
void | keep (iterator pos) |
|
void | keep (iterator first, iterator last) |
|
void | erase (iterator position) |
|
void | erase (iterator first, iterator last) |
|
void | erase (iterator position) |
|
void | erase (iterator first, iterator last) |
|
| BCP_vec () |
| The default constructor initializes the data members as 0 pointers.
|
|
| BCP_vec (const BCP_vec< BCP_lp_waiting_col * > &x) |
| The copy constructor copies over the content of x .
|
|
| BCP_vec (const size_t n, const_reference value=BCP_lp_waiting_col *()) |
| Construct a BCP_vec with n elements, all initialized with the second argument (or initialized with the default constructor of T if the second argument is missing).
|
|
| BCP_vec (const_iterator first, const_iterator last) |
| Construct a BCP_vec by copying the elements from first to last-1 .
|
|
| BCP_vec (const BCP_lp_waiting_col * *x, const size_t num) |
| Construct a BCP_vec by copying num objects of type T from the memory starting at x .
|
|
virtual | ~BCP_vec () |
| The destructor deallocates the memory allocated for the BCP_vec .
|
|
iterator | begin () |
| Return an iterator to the beginning of the object.
|
|
const_iterator | begin () const |
| Return a const iterator to the beginning of the object.
|
|
iterator | end () |
| Return an iterator to the end of the object.
|
|
const_iterator | end () const |
| Return a const iterator to the end of the object.
|
|
iterator | entry (const int i) |
| Return an iterator to the i -th entry.
|
|
const_iterator | entry (const int i) const |
| Return a const iterator to the i -th entry.
|
|
size_t | index (const_iterator pos) const |
| Return the index of the entry pointed to by pos .
|
|
size_t | size () const |
| Return the current number of entries.
|
|
size_t | capacity () const |
| Return the capacity of the object (space allocated for this many entries).
|
|
bool | empty () const |
| Test if there are any entries in the object.
|
|
reference | operator[] (const size_t i) |
| Return a reference to the i -th entry.
|
|
const_reference | operator[] (const size_t i) const |
| Return a const reference to the i -th entry.
|
|
reference | front () |
| Return a reference to the first entry.
|
|
const_reference | front () const |
| Return a const reference to the first entry.
|
|
reference | back () |
| Return a reference to the last entry.
|
|
const_reference | back () const |
| Return a const reference to the last entry.
|
|
void | reserve (const size_t n) |
| Reallocate the object to make space for n entries.
|
|
void | swap (BCP_vec< BCP_lp_waiting_col * > &x) |
| Exchange the contents of the object with that of x .
|
|
BCP_vec< BCP_lp_waiting_col * > & | operator= (const BCP_vec< BCP_lp_waiting_col * > &x) |
| Copy the contents of x into the object and return a reference the the object itself.
|
|
void | assign (const void *x, const size_t num) |
| Copy num entries of type T starting at the memory location x into the object.
|
|
void | insert (iterator position, const void *first, const size_t num) |
| Insert num entries starting from memory location first into the vector from position pos .
|
|
void | insert (iterator position, const_iterator first, const_iterator last) |
| Insert the entries [first,last) into the vector from position pos .
|
|
void | insert (iterator position, const size_t n, const_reference x) |
| Insert n copies of x into the vector from position pos .
|
|
iterator | insert (iterator position, const_reference x) |
| Insert x (a single entry) into the vector at position pos .
|
|
void | append (const BCP_vec< BCP_lp_waiting_col * > &x) |
| Append the entries in x to the end of the vector.
|
|
void | append (const_iterator first, const_iterator last) |
| Append the entries [first,last) to the end of the vector.
|
|
void | push_back (const_reference x) |
| Append x to the end of the vector.
|
|
void | unchecked_push_back (const_reference x) |
| Append x to the end of the vector.
|
|
void | pop_back () |
| Delete the last entry.
|
|
void | clear () |
| Delete every entry.
|
|
void | update (const BCP_vec< int > &positions, const BCP_vec< BCP_lp_waiting_col * > &values) |
| Update those entries listed in positions to the given values .
|
|
void | unchecked_update (const BCP_vec< int > &positions, const BCP_vec< BCP_lp_waiting_col * > &values) |
| Same as the previous method but without sanity checks.
|
|
void | keep (iterator pos) |
| Keep only the entry pointed to by pos .
|
|
void | keep (iterator first, iterator last) |
| Keep the entries [first,last) .
|
|
void | keep_by_index (const BCP_vec< int > &positions) |
| Keep the entries indexed by indices .
|
|
void | keep_by_index (const int *firstpos, const int *lastpos) |
| Keep the entries indexed by the values in [firstpos,lastpos) .
|
|
void | unchecked_keep_by_index (const BCP_vec< int > &positions) |
| Same as the previous method but without the sanity checks.
|
|
void | unchecked_keep_by_index (const int *firstpos, const int *lastpos) |
| Same as the previous method but without the sanity checks.
|
|
void | erase (iterator pos) |
| Erase the entry pointed to by pos .
|
|
void | erase (iterator first, iterator last) |
| Erase the entries [first,last) .
|
|
void | erase_by_index (const BCP_vec< int > &positions) |
| Erase the entries indexed by indices .
|
|
void | erase_by_index (const int *firstpos, const int *lastpos) |
| Like the other erase_by_index method (including sanity checks), just the indices of the entries to be erased are given in [firstpos,lastpos) .
|
|
void | unchecked_erase_by_index (const BCP_vec< int > &positions) |
| Same as the previous method but without the sanity check.
|
|
void | unchecked_erase_by_index (const int *firstpos, const int *lastpos) |
| Same as the previous method but without the sanity checks.
|
|