3#ifndef _BCP_INDEXED_PRICING_H
4#define _BCP_INDEXED_PRICING_H
12class BCP_indexed_pricing_list {
14 inline void clean() { _del_pos.
clear(); _indices.clear(); }
16 BCP_pricing_status _pr_status;
18 BCP_vec<int> _del_pos;
19 BCP_vec<int> _indices;
21 BCP_indexed_pricing_list() :
23 _del_pos(), _indices() {}
24 ~BCP_indexed_pricing_list() {}
28 inline BCP_pricing_status get_status()
const {
return _pr_status; }
30 inline const BCP_vec<int>& get_indices()
const {
return _indices; }
37 inline void set_status(BCP_pricing_status new_stat) {
38 _pr_status = new_stat; }
39 inline void set_indices(BCP_vec<int>& new_indices) {
40 _indices.
swap(new_indices); }
42 void swap(BCP_indexed_pricing_list& x);
43 void update(
const BCP_indexed_pricing_list& change);
44 BCP_indexed_pricing_list*
45 as_change(
const BCP_indexed_pricing_list& old_list)
const;
47 int pack_size()
const;
48 void pack(BCP_buffer& buf)
const;
49 void unpack(BCP_buffer& buf);
BCP_storage_t
This enumerative constant describes how to store certain data for a search tree node.
@ BCP_Storage_Explicit
The data stored is an explicit listing of values.
This class describes the message buffer used for all processes of BCP.
void clear()
Completely clear the buffer.
void swap(BCP_vec< T > &x)
Exchange the contents of the object with that of x.