28 #ifndef INCLUDED_MDDS_SEGMENTTREE_HPP
29 #define INCLUDED_MDDS_SEGMENTTREE_HPP
31 #include "mdds/node.hpp"
32 #include "mdds/global.hpp"
37 #include <unordered_map>
46 template<
typename _Key,
typename _Value>
50 typedef _Key key_type;
51 typedef _Value value_type;
52 typedef size_t size_type;
53 typedef std::vector<value_type> search_results_type;
62 segment_data(key_type _beg, key_type _end, value_type p) :
63 begin_key(_beg), end_key(_end), pdata(p) {}
67 return begin_key == r.begin_key && end_key == r.end_key && pdata == r.pdata;
70 bool operator!=(
const segment_data& r)
const
76 struct segment_map_printer
78 void operator() (const ::std::pair<value_type, ::std::pair<key_type, key_type> >& r)
const
81 cout << r.second.first <<
"-" << r.second.second <<
": " << r.first->name << endl;
87 typedef ::std::vector<value_type> data_chain_type;
88 typedef std::unordered_map<value_type, ::std::pair<key_type, key_type> > segment_map_type;
89 typedef ::std::map<value_type, ::std::pair<key_type, key_type> > sorted_segment_map_type;
99 return low == r.low && high == r.
high && data_chain == r.
data_chain;
106 data_chain_type* data_chain;
110 return key == r.key && data_chain == r.data_chain;
117 #ifdef MDDS_UNIT_TEST
118 struct to_string_handler;
122 typedef typename node::node_ptr node_ptr;
133 _self.value_nonleaf.low = left_node->
is_leaf ?
134 static_cast<const node*
>(left_node)->value_leaf.key :
135 static_cast<const nonleaf_node*
>(left_node)->value_nonleaf.low;
140 throw general_error(
"segment_tree::fill_nonleaf_value_handler: Having a left node is prerequisite.");
151 const node* p =
static_cast<const node*
>(right_node);
153 _self.value_nonleaf.high = p->
next->value_leaf.key;
155 _self.value_nonleaf.high = p->value_leaf.key;
159 _self.value_nonleaf.high =
static_cast<const nonleaf_node*
>(right_node)->value_nonleaf.high;
164 _self.value_nonleaf.high = left_node->
is_leaf ?
165 static_cast<const node*
>(left_node)->value_leaf.key :
166 static_cast<const nonleaf_node*
>(left_node)->value_nonleaf.high;
171 #ifdef MDDS_UNIT_TEST
172 struct to_string_handler
174 std::string operator() (
const node& _self)
const
176 std::ostringstream os;
177 os <<
"[" << _self.value_leaf.key <<
"] ";
183 std::ostringstream os;
184 os <<
"[" << _self.value_nonleaf.low <<
"-" << _self.value_nonleaf.high <<
")";
185 if (_self.value_nonleaf.data_chain)
188 typename data_chain_type::const_iterator
190 itr_beg = _self.value_nonleaf.data_chain->begin(),
191 itr_end = _self.value_nonleaf.data_chain->end();
192 for (itr = itr_beg; itr != itr_end; ++itr)
208 void operator() (
node& _self)
210 _self.value_leaf.data_chain =
nullptr;
215 _self.value_nonleaf.data_chain =
nullptr;
221 void operator() (
node& _self)
223 delete _self.value_leaf.data_chain;
228 delete _self.value_nonleaf.data_chain;
232 #ifdef MDDS_UNIT_TEST
238 std::cout << static_cast<const node*>(p)->to_string() <<
" ";
240 std::cout << static_cast<const nonleaf_node*>(p)->to_string() <<
" ";
251 class search_results_base
254 typedef std::vector<data_chain_type*> res_chains_type;
255 typedef std::shared_ptr<res_chains_type> res_chains_ptr;
258 search_results_base() :
259 mp_res_chains(static_cast<res_chains_type*>(nullptr)) {}
261 search_results_base(
const search_results_base& r) :
262 mp_res_chains(r.mp_res_chains) {}
270 typename res_chains_type::const_iterator
271 itr = mp_res_chains->begin(), itr_end = mp_res_chains->end();
272 for (; itr != itr_end; ++itr)
273 combined += (*itr)->size();
277 void push_back_chain(data_chain_type* chain)
279 if (!chain || chain->empty())
283 mp_res_chains.reset(
new res_chains_type);
284 mp_res_chains->push_back(chain);
287 res_chains_ptr& get_res_chains() {
return mp_res_chains; }
290 res_chains_ptr mp_res_chains;
296 typedef typename search_results_base::res_chains_type res_chains_type;
297 typedef typename search_results_base::res_chains_ptr res_chains_ptr;
299 iterator_base(
const res_chains_ptr& p) :
300 mp_res_chains(p), m_end_pos(true) {}
303 typedef ::std::bidirectional_iterator_tag iterator_category;
304 typedef typename data_chain_type::value_type value_type;
305 typedef typename data_chain_type::pointer pointer;
306 typedef typename data_chain_type::reference reference;
307 typedef typename data_chain_type::difference_type difference_type;
310 mp_res_chains(static_cast<res_chains_type*>(nullptr)), m_end_pos(true) {}
312 iterator_base(
const iterator_base& r) :
313 mp_res_chains(r.mp_res_chains),
314 m_cur_chain(r.m_cur_chain),
315 m_cur_pos_in_chain(r.m_cur_pos_in_chain),
316 m_end_pos(r.m_end_pos) {}
318 iterator_base& operator= (
const iterator_base& r)
320 mp_res_chains = r.mp_res_chains;
321 m_cur_chain = r.m_cur_chain;
322 m_cur_pos_in_chain = r.m_cur_pos_in_chain;
323 m_end_pos = r.m_end_pos;
327 typename data_chain_type::value_type* operator++ ()
338 typename data_chain_type::iterator cur_pos_in_chain = m_cur_pos_in_chain;
340 if (++cur_pos_in_chain == (*m_cur_chain)->end())
343 typename res_chains_type::iterator cur_chain = m_cur_chain;
345 if (cur_chain == mp_res_chains->end())
350 m_cur_chain = cur_chain;
351 m_cur_pos_in_chain = (*m_cur_chain)->begin();
354 ++m_cur_pos_in_chain;
359 typename data_chain_type::value_type* operator-- ()
367 return &(*m_cur_pos_in_chain);
370 if (m_cur_pos_in_chain == (*m_cur_chain)->begin())
372 if (m_cur_chain == mp_res_chains->begin())
378 m_cur_pos_in_chain = (*m_cur_chain)->end();
380 --m_cur_pos_in_chain;
384 bool operator== (
const iterator_base& r)
const
386 if (mp_res_chains.get())
389 return mp_res_chains.get() == r.mp_res_chains.get() &&
390 m_cur_chain == r.m_cur_chain && m_cur_pos_in_chain == r.m_cur_pos_in_chain &&
391 m_end_pos == r.m_end_pos;
395 if (r.mp_res_chains.get())
397 return m_end_pos == r.m_end_pos;
400 bool operator!= (
const iterator_base& r)
const {
return !
operator==(r); }
402 typename data_chain_type::value_type& operator*()
404 return *m_cur_pos_in_chain;
407 typename data_chain_type::value_type* operator->()
409 return &(*m_cur_pos_in_chain);
424 m_cur_chain = mp_res_chains->begin();
425 m_cur_pos_in_chain = (*m_cur_chain)->begin();
436 m_cur_chain = mp_res_chains->end();
438 m_cur_pos_in_chain = (*m_cur_chain)->end();
439 --m_cur_pos_in_chain;
443 res_chains_ptr mp_res_chains;
444 typename res_chains_type::iterator m_cur_chain;
445 typename data_chain_type::iterator m_cur_pos_in_chain;
453 typedef typename search_results_base::res_chains_type res_chains_type;
454 typedef typename search_results_base::res_chains_ptr res_chains_ptr;
461 iterator(const res_chains_ptr& p) : iterator_base(p) {}
485 void operator() (data_chain_type* node_data)
490 typename data_chain_type::const_iterator itr = node_data->begin(), itr_end = node_data->end();
491 for (; itr != itr_end; ++itr)
492 m_result.push_back(*itr);
495 search_results_type& m_result;
502 void operator() (data_chain_type* node_data)
507 m_result.push_back_chain(node_data);
510 search_results_base& m_result;
547 bool insert(key_type begin_key, key_type end_key, value_type pdata);
565 bool search(key_type point, search_results_type& result)
const;
609 #ifdef MDDS_UNIT_TEST
610 void dump_tree()
const;
611 void dump_leaf_nodes()
const;
612 void dump_segment_data()
const;
613 bool verify_node_lists()
const;
615 struct leaf_node_check
618 data_chain_type data_chain;
621 bool verify_leaf_nodes(const ::std::vector<leaf_node_check>& checks)
const;
629 bool verify_segment_data(
const segment_map_type& checks)
const;
636 void search(key_type point, search_results_base& result)
const;
638 typedef std::vector<__st::node_base*> node_list_type;
639 typedef std::map<value_type, std::unique_ptr<node_list_type>> data_node_map_type;
641 static void create_leaf_node_instances(const ::std::vector<key_type>& keys, node_ptr& left, node_ptr& right);
648 void descend_tree_and_mark(
649 __st::node_base* pnode, value_type pdata, key_type begin_key, key_type end_key, node_list_type* plist);
651 void build_leaf_nodes();
657 void remove_data_from_nodes(node_list_type* plist,
const value_type pdata);
658 void remove_data_from_chain(data_chain_type& chain,
const value_type pdata);
660 void clear_all_nodes();
662 #ifdef MDDS_UNIT_TEST
663 static bool has_data_pointer(
const node_list_type& node_list,
const value_type pdata);
664 static void print_leaf_value(
const leaf_value_type& v);
668 std::vector<nonleaf_node> m_nonleaf_node_pool;
670 segment_map_type m_segment_data;
677 data_node_map_type m_tagged_node_map;
679 nonleaf_node* m_root_node;
680 node_ptr m_left_leaf;
681 node_ptr m_right_leaf;
687 #include "segment_tree_def.inl"
Definition: global.hpp:82
Definition: segment_tree.hpp:499
Definition: segment_tree.hpp:482
Definition: segment_tree.hpp:458
Definition: segment_tree.hpp:452
Definition: segment_tree.hpp:48
bool insert(key_type begin_key, key_type end_key, value_type pdata)
bool operator==(const segment_tree &r) const
bool search(key_type point, search_results_type &result) const
void remove(value_type value)
bool is_tree_valid() const
Definition: segment_tree.hpp:531
search_results search(key_type point) const
bool is_leaf
parent nonleaf_node
Definition: node.hpp:46
node_ptr next
previous sibling leaf node.
Definition: node.hpp:166
Definition: segment_tree.hpp:220
Definition: segment_tree.hpp:127
Definition: segment_tree.hpp:207
Definition: segment_tree.hpp:104
Definition: segment_tree.hpp:92
key_type high
low range value (inclusive)
Definition: segment_tree.hpp:94
data_chain_type * data_chain
high range value (non-inclusive)
Definition: segment_tree.hpp:95