BCP_lp_node.cpp
Go to the documentation of this file.
1 // Copyright (C) 2000, International Business Machines
2 // Corporation and others. All Rights Reserved.
3 #include "BCP_lp_node.hpp"
4 #include "BCP_warmstart.hpp"
5 #include "BCP_USER.hpp"
6 
7 #include "BCP_message.hpp"
8 
10 {
11  clean();
12  purge_ptr_vector(*(dynamic_cast<BCP_vec<BCP_var*>*>(&vars)));
13  purge_ptr_vector(*(dynamic_cast<BCP_vec<BCP_cut*>*>(&cuts)));
14 }
15 
16 void
18 {
19  delete user_data; user_data = 0;
20  cg = -1;
21  cp = -1;
22  vg = -1;
23  vp = -1;
24  delete warmstart; warmstart = 0;
26 }
27 
28 //#############################################################################
29 
30 void
32 {
33  delete warmstart;
34  warmstart = 0;
35 }
36 
38 {
39  clean();
40 }
41 
BCP_warmstart * warmstart
this is always explicit, it&#39;s just that coding is simpler if we reuse the BCP_obj_set_change object ...
Definition: BCP_lp_node.hpp:64
void clear()
Delete every entry.
BCP_var_set vars
BCP_cut_set cuts
BCP_warmstart * warmstart
BCP_vec< double > lb_at_cutgen
void purge_ptr_vector(BCP_vec< T * > &pvec, typename BCP_vec< T * >::iterator first, typename BCP_vec< T * >::iterator last)
This function purges the entries [first,last) from the vector of pointers pvec.
Definition: BCP_vector.hpp:266
BCP_user_data * user_data
Data the user wants to pass along with the search tree node.
void clean()
Definition: BCP_lp_node.cpp:17