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) {}
353 std::pair<const_iterator, bool>
356 return insert_segment_impl(start_key, end_key, val,
true);
374 std::pair<const_iterator, bool>
377 return insert_segment_impl(start_key, end_key, val,
false);
395 std::pair<const_iterator, bool>
407 void shift_left(key_type start_key, key_type end_key);
421 void shift_right(key_type pos, key_type size,
bool skip_start_node);
440 std::pair<const_iterator, bool>
441 search(key_type key, value_type& value, key_type* start_key =
nullptr, key_type* end_key =
nullptr)
const;
461 std::pair<const_iterator, bool>
462 search(
const const_iterator& pos, key_type key, value_type& value, key_type* start_key =
nullptr, key_type* end_key =
nullptr)
const;
483 std::pair<const_iterator, bool>
484 search_tree(key_type key, value_type& value, key_type* start_key =
nullptr, key_type* end_key =
nullptr)
const;
514 key_type min_key()
const 516 return m_left_leaf->value_leaf.key;
519 key_type max_key()
const 521 return m_right_leaf->value_leaf.key;
524 value_type default_value()
const 536 #ifdef MDDS_UNIT_TEST 537 nonleaf_node* get_root_node()
const 542 void dump_tree()
const 548 assert(!
"attempted to dump an invalid tree!");
550 size_t node_count = mdds::__st::tree_dumper<node, nonleaf_node>::dump(m_root_node);
551 size_t node_instance_count = node::get_instance_count();
554 cout <<
"tree node count = " << node_count <<
"; node instance count = " 555 << node_instance_count <<
"; leaf node count = " << leaf_count << endl;
557 assert(leaf_count == node_instance_count);
560 void dump_leaf_nodes()
const 565 cout <<
"------------------------------------------" << endl;
567 node_ptr cur_node = m_left_leaf;
571 cout <<
" node " << node_id++ <<
": key = " << cur_node->value_leaf.key
572 <<
"; value = " << cur_node->value_leaf.value
574 cur_node = cur_node->next;
576 cout << endl <<
" node instance count = " << node::get_instance_count() << endl;
586 bool verify_keys(const ::std::vector<key_type>& key_values)
const 590 node* cur_node = m_left_leaf.get();
591 typename ::std::vector<key_type>::const_iterator itr = key_values.begin(), itr_end = key_values.end();
592 for (; itr != itr_end; ++itr)
598 if (cur_node->value_leaf.key != *itr)
602 cur_node = cur_node->
next.get();
613 node* cur_node = m_right_leaf.get();
614 typename ::std::vector<key_type>::const_reverse_iterator itr = key_values.rbegin(), itr_end = key_values.rend();
615 for (; itr != itr_end; ++itr)
621 if (cur_node->value_leaf.key != *itr)
625 cur_node = cur_node->prev.get();
644 bool verify_values(const ::std::vector<value_type>& values)
const 646 node* cur_node = m_left_leaf.get();
647 node* end_node = m_right_leaf.get();
648 typename ::std::vector<value_type>::const_iterator itr = values.begin(), itr_end = values.end();
649 for (; itr != itr_end; ++itr)
651 if (cur_node == end_node || !cur_node)
654 if (cur_node->value_leaf.value != *itr)
658 cur_node = cur_node->
next.get();
661 if (cur_node != end_node)
673 void append_new_segment(key_type start_key)
675 if (m_right_leaf->prev->value_leaf.key == start_key)
677 m_right_leaf->prev->value_leaf.value = m_init_val;
681 #ifdef MDDS_UNIT_TEST 684 assert(m_right_leaf->prev->value_leaf.key < start_key);
687 if (m_right_leaf->prev->value_leaf.value == m_init_val)
692 node_ptr new_node(
new node);
693 new_node->value_leaf.key = start_key;
694 new_node->value_leaf.value = m_init_val;
695 new_node->prev = m_right_leaf->prev;
696 new_node->next = m_right_leaf;
697 m_right_leaf->prev->next = new_node;
698 m_right_leaf->prev = new_node;
699 m_valid_tree =
false;
702 ::std::pair<const_iterator, bool>
703 insert_segment_impl(key_type start_key, key_type end_key, value_type val,
bool forward);
705 ::std::pair<const_iterator, bool>
706 insert_to_pos(node_ptr& start_pos, key_type start_key, key_type end_key, value_type val);
708 ::std::pair<const_iterator, bool>
709 search_impl(
const node* pos, key_type key, value_type& value, key_type* start_key, key_type* end_key)
const;
711 const node* get_insertion_pos_leaf_reverse(key_type key,
const node* start_pos)
const;
713 const node* get_insertion_pos_leaf(key_type key,
const node* start_pos)
const;
715 static void shift_leaf_key_left(node_ptr& begin_node, node_ptr& end_node, key_type shift_value)
717 node* cur_node_p = begin_node.get();
718 node* end_node_p = end_node.get();
719 while (cur_node_p != end_node_p)
721 cur_node_p->value_leaf.key -= shift_value;
722 cur_node_p = cur_node_p->
next.get();
726 static void shift_leaf_key_right(node_ptr& cur_node, node_ptr& end_node, key_type shift_value)
728 key_type end_node_key = end_node->value_leaf.key;
729 while (cur_node.get() != end_node.get())
731 cur_node->value_leaf.key += shift_value;
732 if (cur_node->value_leaf.key < end_node_key)
735 cur_node = cur_node->next;
743 node_ptr last_node = cur_node->prev;
744 while (cur_node.get() != end_node.get())
746 node_ptr next_node = cur_node->next;
747 disconnect_all_nodes(cur_node.get());
748 cur_node = next_node;
750 last_node->next = end_node;
751 end_node->prev = last_node;
765 bool adjust_segment_range(key_type& start_key, key_type& end_key)
const;
768 std::vector<nonleaf_node> m_nonleaf_node_pool;
770 nonleaf_node* m_root_node;
771 node_ptr m_left_leaf;
772 node_ptr m_right_leaf;
773 value_type m_init_val;
777 template<
typename _Key,
typename _Value>
786 #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:354
void shift_left(key_type start_key, key_type end_key)
Definition: flat_segment_tree.hpp:205
const_segment_iterator end_segment() const
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:497
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)
const_reverse_iterator rend() const
Definition: flat_segment_tree.hpp:269
Definition: flat_segment_tree_itr.hpp:37
Definition: flat_segment_tree.hpp:73
const_reverse_iterator rbegin() const
Definition: flat_segment_tree.hpp:255
const_iterator begin() const
Definition: flat_segment_tree.hpp:229
void swap(flat_segment_tree< key_type, value_type > &other)
const_iterator end() const
Definition: flat_segment_tree.hpp:242
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:375
Definition: flat_segment_tree.hpp:49
Definition: flat_segment_tree.hpp:46
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
const_segment_iterator begin_segment() const
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