29 #ifndef INCLUDED_MDDS_FLAT_SEGMENT_TREE_HPP 30 #define INCLUDED_MDDS_FLAT_SEGMENT_TREE_HPP 37 #include "mdds/node.hpp" 38 #include "mdds/flat_segment_tree_itr.hpp" 39 #include "mdds/global.hpp" 48 template<
typename _Key,
typename _Value>
52 typedef _Key key_type;
53 typedef _Value value_type;
54 typedef size_t size_type;
63 return low == r.low && high == r.
high;
80 return key == r.key && value == r.value;
95 struct to_string_handler;
99 typedef typename node::node_ptr node_ptr;
110 _self.value_nonleaf.low =
112 static_cast<const node*
>(left_node)->value_leaf.key :
113 static_cast<const nonleaf_node*>(left_node)->value_nonleaf.low;
118 throw general_error(
"flat_segment_tree::fill_nonleaf_value_handler: Having a left node is prerequisite.");
128 const node* p =
static_cast<const node*
>(right_node);
130 _self.value_nonleaf.high = p->
next->value_leaf.key;
132 _self.value_nonleaf.high = p->value_leaf.key;
136 _self.value_nonleaf.high =
static_cast<const nonleaf_node*
>(right_node)->value_nonleaf.high;
141 _self.value_nonleaf.high =
143 static_cast<const node*
>(left_node)->value_leaf.key :
144 static_cast<const nonleaf_node*>(left_node)->value_nonleaf.high;
149 #ifdef MDDS_UNIT_TEST 150 struct to_string_handler
152 std::string operator() (
const node& _self)
const 154 std::ostringstream os;
155 os <<
"(" << _self.value_leaf.key <<
") ";
161 std::ostringstream os;
162 os <<
"(" << _self.value_nonleaf.low <<
"-" << _self.value_nonleaf.high <<
") ";
170 void operator() (node& ) {}
176 void operator() (node& ) {}
182 friend struct ::mdds::__fst::itr_forward_handler<flat_segment_tree>;
183 friend struct ::mdds::__fst::itr_reverse_handler<flat_segment_tree>;
187 flat_segment_tree, ::mdds::__fst::itr_forward_handler<flat_segment_tree> >
189 typedef ::mdds::__fst::const_iterator_base<
192 friend class flat_segment_tree;
195 base_type(
nullptr,
false) {}
199 base_type(_db, _end) {}
206 flat_segment_tree, ::mdds::__fst::itr_reverse_handler<flat_segment_tree> >
208 typedef ::mdds::__fst::const_iterator_base<
211 friend class flat_segment_tree;
214 base_type(
nullptr,
false) {}
217 base_type(_db, _end) {}
279 std::pair<const_iterator, bool>
282 return insert_segment_impl(start_key, end_key, val,
true);
300 std::pair<const_iterator, bool>
303 return insert_segment_impl(start_key, end_key, val,
false);
321 std::pair<const_iterator, bool>
333 void shift_left(key_type start_key, key_type end_key);
347 void shift_right(key_type pos, key_type size,
bool skip_start_node);
366 std::pair<const_iterator, bool>
367 search(key_type key, value_type& value, key_type* start_key =
nullptr, key_type* end_key =
nullptr)
const;
387 std::pair<const_iterator, bool>
388 search(
const const_iterator& pos, key_type key, value_type& value, key_type* start_key =
nullptr, key_type* end_key =
nullptr)
const;
409 std::pair<const_iterator, bool>
410 search_tree(key_type key, value_type& value, key_type* start_key =
nullptr, key_type* end_key =
nullptr)
const;
440 key_type min_key()
const 442 return m_left_leaf->value_leaf.key;
445 key_type max_key()
const 447 return m_right_leaf->value_leaf.key;
450 value_type default_value()
const 462 #ifdef MDDS_UNIT_TEST 463 nonleaf_node* get_root_node()
const 468 void dump_tree()
const 474 assert(!
"attempted to dump an invalid tree!");
476 size_t node_count = mdds::__st::tree_dumper<node, nonleaf_node>::dump(m_root_node);
477 size_t node_instance_count = node::get_instance_count();
480 cout <<
"tree node count = " << node_count <<
"; node instance count = " 481 << node_instance_count <<
"; leaf node count = " << leaf_count << endl;
483 assert(leaf_count == node_instance_count);
486 void dump_leaf_nodes()
const 491 cout <<
"------------------------------------------" << endl;
493 node_ptr cur_node = m_left_leaf;
497 cout <<
" node " << node_id++ <<
": key = " << cur_node->value_leaf.key
498 <<
"; value = " << cur_node->value_leaf.value
500 cur_node = cur_node->next;
502 cout << endl <<
" node instance count = " << node::get_instance_count() << endl;
512 bool verify_keys(const ::std::vector<key_type>& key_values)
const 516 node* cur_node = m_left_leaf.get();
517 typename ::std::vector<key_type>::const_iterator itr = key_values.begin(), itr_end = key_values.end();
518 for (; itr != itr_end; ++itr)
524 if (cur_node->value_leaf.key != *itr)
528 cur_node = cur_node->
next.get();
539 node* cur_node = m_right_leaf.get();
540 typename ::std::vector<key_type>::const_reverse_iterator itr = key_values.rbegin(), itr_end = key_values.rend();
541 for (; itr != itr_end; ++itr)
547 if (cur_node->value_leaf.key != *itr)
551 cur_node = cur_node->prev.get();
570 bool verify_values(const ::std::vector<value_type>& values)
const 572 node* cur_node = m_left_leaf.get();
573 node* end_node = m_right_leaf.get();
574 typename ::std::vector<value_type>::const_iterator itr = values.begin(), itr_end = values.end();
575 for (; itr != itr_end; ++itr)
577 if (cur_node == end_node || !cur_node)
580 if (cur_node->value_leaf.value != *itr)
584 cur_node = cur_node->
next.get();
587 if (cur_node != end_node)
599 void append_new_segment(key_type start_key)
601 if (m_right_leaf->prev->value_leaf.key == start_key)
603 m_right_leaf->prev->value_leaf.value = m_init_val;
607 #ifdef MDDS_UNIT_TEST 610 assert(m_right_leaf->prev->value_leaf.key < start_key);
613 if (m_right_leaf->prev->value_leaf.value == m_init_val)
618 node_ptr new_node(
new node);
619 new_node->value_leaf.key = start_key;
620 new_node->value_leaf.value = m_init_val;
621 new_node->prev = m_right_leaf->prev;
622 new_node->next = m_right_leaf;
623 m_right_leaf->prev->next = new_node;
624 m_right_leaf->prev = new_node;
625 m_valid_tree =
false;
628 ::std::pair<const_iterator, bool>
629 insert_segment_impl(key_type start_key, key_type end_key, value_type val,
bool forward);
631 ::std::pair<const_iterator, bool>
632 insert_to_pos(node_ptr& start_pos, key_type start_key, key_type end_key, value_type val);
634 ::std::pair<const_iterator, bool>
635 search_impl(
const node* pos, key_type key, value_type& value, key_type* start_key, key_type* end_key)
const;
637 const node* get_insertion_pos_leaf_reverse(key_type key,
const node* start_pos)
const;
639 const node* get_insertion_pos_leaf(key_type key,
const node* start_pos)
const;
641 static void shift_leaf_key_left(node_ptr& begin_node, node_ptr& end_node, key_type shift_value)
643 node* cur_node_p = begin_node.get();
644 node* end_node_p = end_node.get();
645 while (cur_node_p != end_node_p)
647 cur_node_p->value_leaf.key -= shift_value;
648 cur_node_p = cur_node_p->
next.get();
652 static void shift_leaf_key_right(node_ptr& cur_node, node_ptr& end_node, key_type shift_value)
654 key_type end_node_key = end_node->value_leaf.key;
655 while (cur_node.get() != end_node.get())
657 cur_node->value_leaf.key += shift_value;
658 if (cur_node->value_leaf.key < end_node_key)
661 cur_node = cur_node->next;
669 node_ptr last_node = cur_node->prev;
670 while (cur_node.get() != end_node.get())
672 node_ptr next_node = cur_node->next;
673 disconnect_all_nodes(cur_node.get());
674 cur_node = next_node;
676 last_node->next = end_node;
677 end_node->prev = last_node;
691 bool adjust_segment_range(key_type& start_key, key_type& end_key)
const;
694 std::vector<nonleaf_node> m_nonleaf_node_pool;
696 nonleaf_node* m_root_node;
697 node_ptr m_left_leaf;
698 node_ptr m_right_leaf;
699 value_type m_init_val;
703 template<
typename _Key,
typename _Value>
712 #include "flat_segment_tree_def.inl" std::pair< const_iterator, bool > insert_front(key_type start_key, key_type end_key, value_type val)
Definition: flat_segment_tree.hpp:280
void shift_left(key_type start_key, key_type end_key)
Definition: flat_segment_tree.hpp:205
bool is_leaf
parent nonleaf_node
Definition: node.hpp:46
bool operator==(const nonleaf_value_type &r) const
high range value (non-inclusive)
Definition: flat_segment_tree.hpp:61
bool is_tree_valid() const
Definition: flat_segment_tree.hpp:423
std::pair< const_iterator, bool > search_tree(key_type key, value_type &value, key_type *start_key=nullptr, key_type *end_key=nullptr) const
std::pair< const_iterator, bool > insert(const const_iterator &pos, key_type start_key, key_type end_key, value_type val)
Definition: flat_segment_tree_itr.hpp:37
Definition: flat_segment_tree.hpp:73
Definition: global.hpp:58
std::pair< const_iterator, bool > search(key_type key, value_type &value, key_type *start_key=nullptr, key_type *end_key=nullptr) const
std::pair< const_iterator, bool > insert_back(key_type start_key, key_type end_key, value_type val)
Definition: flat_segment_tree.hpp:301
Definition: flat_segment_tree.hpp:49
Definition: default_deleter.hpp:33
key_type high
low range value (inclusive)
Definition: flat_segment_tree.hpp:59
Definition: flat_segment_tree.hpp:56
flat_segment_tree< key_type, value_type > & operator=(const flat_segment_tree< key_type, value_type > &other)
Definition: flat_segment_tree_itr.hpp:67
Definition: flat_segment_tree_itr.hpp:94
size_type leaf_size() const
void shift_right(key_type pos, key_type size, bool skip_start_node)
Definition: flat_segment_tree.hpp:186
Definition: flat_segment_tree.hpp:103
Definition: flat_segment_tree.hpp:174
node_ptr next
previous sibling leaf node.
Definition: node.hpp:166
Definition: flat_segment_tree_itr.hpp:185
Definition: flat_segment_tree.hpp:168