|
| | 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 () |
| | The default constructor initializes the data members as 0 pointers. More...
|
| |
| | BCP_vec (const BCP_vec< BCP_lp_waiting_col * > &x) |
| | The copy constructor copies over the content of x. More...
|
| |
| | 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). More...
|
| |
| | BCP_vec (const_iterator first, const_iterator last) |
| | Construct a BCP_vec by copying the elements from first to last-1. More...
|
| |
| | 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. More...
|
| |
| virtual | ~BCP_vec () |
| | The destructor deallocates the memory allocated for the BCP_vec. More...
|
| |
| iterator | begin () |
| | Return an iterator to the beginning of the object. More...
|
| |
| const_iterator | begin () const |
| | Return a const iterator to the beginning of the object. More...
|
| |
| iterator | end () |
| | Return an iterator to the end of the object. More...
|
| |
| const_iterator | end () const |
| | Return a const iterator to the end of the object. More...
|
| |
| iterator | entry (const int i) |
| | Return an iterator to the i-th entry. More...
|
| |
| const_iterator | entry (const int i) const |
| | Return a const iterator to the i-th entry. More...
|
| |
| size_t | index (const_iterator pos) const |
| | Return the index of the entry pointed to by pos. More...
|
| |
| size_t | size () const |
| | Return the current number of entries. More...
|
| |
| size_t | capacity () const |
| | Return the capacity of the object (space allocated for this many entries). More...
|
| |
| bool | empty () const |
| | Test if there are any entries in the object. More...
|
| |
| reference | operator[] (const size_t i) |
| | Return a reference to the i-th entry. More...
|
| |
| const_reference | operator[] (const size_t i) const |
| | Return a const reference to the i-th entry. More...
|
| |
| reference | front () |
| | Return a reference to the first entry. More...
|
| |
| const_reference | front () const |
| | Return a const reference to the first entry. More...
|
| |
| reference | back () |
| | Return a reference to the last entry. More...
|
| |
| const_reference | back () const |
| | Return a const reference to the last entry. More...
|
| |
| void | reserve (const size_t n) |
| | Reallocate the object to make space for n entries. More...
|
| |
| void | swap (BCP_vec< BCP_lp_waiting_col * > &x) |
| | Exchange the contents of the object with that of x. More...
|
| |
| 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. More...
|
| |
| void | assign (const void *x, const size_t num) |
| | Copy num entries of type T starting at the memory location x into the object. More...
|
| |
| 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. More...
|
| |
| void | insert (iterator position, const_iterator first, const_iterator last) |
| | Insert the entries [first,last) into the vector from position pos. More...
|
| |
| void | insert (iterator position, const size_t n, const_reference x) |
| | Insert n copies of x into the vector from position pos. More...
|
| |
| iterator | insert (iterator position, const_reference x) |
| | Insert x (a single entry) into the vector at position pos. More...
|
| |
| void | append (const BCP_vec< BCP_lp_waiting_col * > &x) |
| | Append the entries in x to the end of the vector. More...
|
| |
| void | append (const_iterator first, const_iterator last) |
| | Append the entries [first,last) to the end of the vector. More...
|
| |
| void | push_back (const_reference x) |
| | Append x to the end of the vector. More...
|
| |
| void | unchecked_push_back (const_reference x) |
| | Append x to the end of the vector. More...
|
| |
| void | pop_back () |
| | Delete the last entry. More...
|
| |
| void | clear () |
| | Delete every entry. More...
|
| |
| 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. More...
|
| |
| 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. More...
|
| |
| void | keep (iterator pos) |
| | Keep only the entry pointed to by pos. More...
|
| |
| void | keep (iterator first, iterator last) |
| | Keep the entries [first,last). More...
|
| |
| void | keep_by_index (const BCP_vec< int > &positions) |
| | Keep the entries indexed by indices. More...
|
| |
| void | keep_by_index (const int *firstpos, const int *lastpos) |
| | Keep the entries indexed by the values in [firstpos,lastpos). More...
|
| |
| void | unchecked_keep_by_index (const BCP_vec< int > &positions) |
| | Same as the previous method but without the sanity checks. More...
|
| |
| void | unchecked_keep_by_index (const int *firstpos, const int *lastpos) |
| | Same as the previous method but without the sanity checks. More...
|
| |
| void | erase (iterator pos) |
| | Erase the entry pointed to by pos. More...
|
| |
| void | erase (iterator first, iterator last) |
| | Erase the entries [first,last). More...
|
| |
| void | erase_by_index (const BCP_vec< int > &positions) |
| | Erase the entries indexed by indices. More...
|
| |
| 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). More...
|
| |
| void | unchecked_erase_by_index (const BCP_vec< int > &positions) |
| | Same as the previous method but without the sanity check. More...
|
| |
| void | unchecked_erase_by_index (const int *firstpos, const int *lastpos) |
| | Same as the previous method but without the sanity checks. More...
|
| |
Definition at line 109 of file BCP_lp_pool.hpp.
Public Member Functions inherited from BCP_vec< BCP_lp_waiting_col * >