137     typedef typename base_maker::type super_t;  typedef in boost::heap::fibonacci_heap
139     typedef typename super_t::size_holder_type size_holder;
140     typedef typename super_t::internal_type internal_type;
167         typedef detail::value_extractor<value_type, internal_type, super_t> value_extractor;
168         typedef typename super_t::internal_compare internal_compare;
169         typedef detail::node_handle<node_pointer, super_t, reference> handle_type;
224         super_t(cmp), top_element(0)  in fibonacci_heap()
229         super_t(rhs), top_element(0)  in fibonacci_heap()
241         super_t(std::move(rhs)), top_element(rhs.top_element)  in fibonacci_heap()
252         super_t::operator=(std::move(rhs));  in operator =()
265         static_cast<super_t&>(*this) = rhs;  in operator =()
326         super_t::swap(rhs);  in swap()
337         return super_t::get_value(top_element->value);  in top()
354         new(n) node(super_t::make_node(v));  in push()
357         if (!top_element || super_t::operator()(top_element->value, n->value))  in push()
378         new(n) node(super_t::make_node(std::forward<Args>(args)...));  in emplace()
381         if (!top_element || super_t::operator()(top_element->value, n->value))  in emplace()
411         if (super_t::operator()(super_t::get_value(handle.node_->value), v))  in update()
424         handle.node_->value = super_t::make_node(v);  in update_lazy()
457         if (super_t::operator()(top_element->value, n->value))  in update_lazy()
471         handle.node_->value = super_t::make_node(v);  in increase()
487             if (super_t::operator()(n->get_parent()->value, n->value)) {  in increase()
494         if (super_t::operator()(top_element->value, n->value)) {  in increase()
509         handle.node_->value = super_t::make_node(v);  in decrease()
563         return ordered_iterator(roots.begin(), roots.end(), top_element, super_t::value_comp());  in ordered_begin()
573         return ordered_iterator(NULL, super_t::value_comp());  in ordered_end()
587             (rhs.top_element && super_t::operator()(top_element->value, rhs.top_element->value)))  in merge()
595         super_t::set_stability_count((std::max)(super_t::get_stability_count(),  in merge()
610         return super_t::value_comp();  in value_comp()
663 …top_element = detail::find_max_child<node_list_type, node, internal_compare>(roots, super_t::get_i…  in clone_forest()
720                     if (super_t::operator()(n->value, other->value))  in consolidate()
736             if (!super_t::operator()(n->value, top_element->value))  in consolidate()