18 #ifndef BIDIRECTIONAL_MAP_HH_
19 #define BIDIRECTIONAL_MAP_HH_
40 unsigned int size()
const;
48 void set_item(T val,
unsigned int pos);
57 void reinit(
unsigned int init_size = 0);
61 void resize(
unsigned int new_size);
78 return vals_map_.size();
83 ASSERT_LT_DBG( pos, vals_vec_.size() )(pos)(vals_vec_.size()).error(
"Value id is out of vector size.");
96 ASSERT( vals_map_.find(val) == vals_map_.end() )(val).error(
"Can not add item since it already exists.");
97 vals_map_[val] = vals_vec_.size();
98 vals_vec_.push_back(val);
99 return vals_map_[val];
105 if (iter == vals_map_.end())
return -1;
106 else return iter->second;
113 vals_vec_.resize(init_size, -1);
121 for(
uint pos = new_size; pos < vals_vec_.size(); pos++){
122 vals_map_.erase(vals_vec_[pos]);
124 vals_vec_.resize(new_size);
125 ASSERT_DBG(vals_vec_.size() == vals_map_.size())(vals_vec_.size())(vals_map_.size());
130 ASSERT( pos < vals_vec_.size() )(pos)(vals_vec_.size());
131 return vals_vec_[pos];
135 #endif // BIDIRECTIONAL_MAP_HH_