Home
last modified time | relevance | path

Searched refs:_Rb_tree (Results 1 – 25 of 29) sorted by relevance

12

/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
Dstl_tree.h427 class _Rb_tree in _GLIBCXX_VISIBILITY()
445 _Reuse_or_alloc_node(_Rb_tree& __t) in _GLIBCXX_VISIBILITY()
518 _Rb_tree& _M_t; in _GLIBCXX_VISIBILITY()
525 _Alloc_node(_Rb_tree& __t) in _GLIBCXX_VISIBILITY()
534 _Rb_tree& _M_t; in _GLIBCXX_VISIBILITY()
889 _M_copy(const _Rb_tree& __x, _NodeGen& __gen) in _GLIBCXX_VISIBILITY()
900 _M_copy(const _Rb_tree& __x) in _GLIBCXX_VISIBILITY()
928 _Rb_tree() { } in _GLIBCXX_VISIBILITY()
930 _Rb_tree() = default; in _GLIBCXX_VISIBILITY()
933 _Rb_tree(const _Compare& __comp, in _GLIBCXX_VISIBILITY()
[all …]
Dnode_handle.h239 friend class _Rb_tree; in _GLIBCXX_VISIBILITY() local
331 friend class _Rb_tree; in _GLIBCXX_VISIBILITY() local
383 friend class _Rb_tree; in _GLIBCXX_VISIBILITY() local
Dstl_multiset.h132 typedef _Rb_tree<key_type, value_type, _Identity<value_type>, in _GLIBCXX_VISIBILITY()
Dstl_set.h133 typedef _Rb_tree<key_type, value_type, _Identity<value_type>, in _GLIBCXX_VISIBILITY()
Dstl_multimap.h153 typedef _Rb_tree<key_type, value_type, _Select1st<value_type>, in _GLIBCXX_VISIBILITY()
Dstl_map.h154 typedef _Rb_tree<key_type, value_type, _Select1st<value_type>, in _GLIBCXX_VISIBILITY()
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/
Drb_tree78 : public std::_Rb_tree<_Key, _Value, _KeyOfValue, _Compare, _Alloc>
80 typedef std::_Rb_tree<_Key, _Value, _KeyOfValue, _Compare, _Alloc> _Base;
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/
DChangeLog-20152437 * include/bits/stl_tree.h (_Rb_tree::swap,
2438 swap(_Rb_tree&, _Rb_tree&)): Likewise.
2714 * include/bits/stl_tree.h (_Rb_tree::operator=(_Rb_tree&&)): Include
2716 (_Rb_tree::_Rb_tree(_Rb_tree&&, _Node_alloc_type&&)): Use
2982 * include/bits/stl_tree.h (_Rb_tree<>::__is_transparent<>): Move to
3186 * include/bits/stl_tree.h (_Rb_tree::_M_end()): Return _Base_ptr
3188 (_Rb_tree::_M_copy): Change second parameter to _Base_ptr.
3189 (_Rb_tree::_M_lower_bound, _Rb_tree:_M_upper_bound): Likewise.
3190 (_Rb_tree::_S_iter): Remove.
3191 (_Rb_tree::_S_lower_bound_tr, _Rb_tree::_S_upper_bound_tr): Remove.
[all …]
DChangeLog-20181607 (operator==(const _Rb_tree<>&, const _Rb_tree<>&)): Make inline friend.
1608 (operator<(const _Rb_tree<>&, const _Rb_tree<>&)): Likewise.
1609 (operator!=(const _Rb_tree<>&, const _Rb_tree<>&)): Likewise and
1611 (operator>(const _Rb_tree<>&, const _Rb_tree<>&)): Likewise.
1612 (operator<=(const _Rb_tree<>&, const _Rb_tree<>&)): Likewise.
1613 (operator>=(const _Rb_tree<>&, const _Rb_tree<>&)): Likewise.
1882 [__cplusplus >= 201103L] (_Rb_tree::__same_value_type): New alias
1884 [__cplusplus >= 201103L] (_Rb_tree::_M_insert_range_unique): Pair of
1887 [__cplusplus >= 201103L] (_Rb_tree::_M_insert_range_equal): Likewise.
1888 [__cplusplus < 201103L] (_Rb_tree::_M_insert_range_unique)
[all …]
DChangeLog-201664 * include/bits/stl_tree.h (_Rb_tree::_M_erase_aux(const_iterator)):
66 (_Rb_tree::_M_erase_aux(const_iterator, const_iterator)): Call
68 (_Rb_tree::_M_erase_aux(const Key&)): Likewise.
228 (_Rb_tree<>::_M_copy(_Const_Link_type, _Base_ptr)): Delete.
229 (_Rb_tree<>::_M_copy(const _Rb_tree&, _NodeGen&)): New.
230 (_Rb_tree<>::_M_copy(const _Rb_tree&)): New, use latter.
231 (_Rb_tree<>(const _Rb_tree&): Use latter.
232 (_Rb_tree<>(const _Rb_tree&, const allocator_type&)): Likewise.
233 (_Rb_tree<>::_M_move_data(_Rb_tree&, false_type)): Likewise.
234 (_Rb_tree<>::_M_move_assign(_Rb_tree&, false_type)): Likewise.
[all …]
DChangeLog-20121623 (_Rb_tree<>::_M_insert_): Take _Base_ptr rather than
1625 (_Rb_tree<>::_M_insert_node): New.
1626 (_Rb_tree<>::_M_get_insert_unique_pos): New, search code of
1628 (_Rb_tree<>::_M_insert_unique): Use latter.
1629 (_Rb_tree<>::_M_emplace_unique): New, likewise.
1630 (_Rb_tree<>::_M_get_insert_equal_pos): New, search code of
1632 (_Rb_tree<>::_M_insert_equal): Use latter.
1633 (_Rb_tree<>::_M_emplace_equal): New, likewise.
1634 (_Rb_tree<>::_M_get_insert_hint_unique_pos): New, search code of
1636 (_Rb_tree<>::_M_insert_unique_): Use latter.
[all …]
DChangeLog-20144971 (_Rb_tree<>::operator=(_Rb_tree<>&&)): New.
4972 (_Rb_tree<>::_M_assign_unique): New.
4973 (_Rb_tree<>::_M_assign_equal): New.
4974 (_Rb_tree<>): Adapt to reuse allocated nodes as much as possible.
4978 _Rb_tree::_M_assign_unique.
4982 _Rb_tree::_M_assign_equal.
4986 _Rb_tree::_M_assign_unique.
4990 _Rb_tree::_M_assign_equal.
6296 * include/bits/stl_tree.h (_Rb_tree::_M_move_assign): Copy the
6581 * include/bits/stl_tree.h (_Rb_tree::_M_end): Fix invalid cast.
[all …]
DChangeLog-200653 * include/bits/stl_tree.h (_Rb_tree<>::_M_insert_unique): Add
87 * include/bits/stl_tree.h (struct _Rb_tree): Change the _Link_type
600 * include/bits/stl_tree.h (_Rb_tree<>::_M_equal_range): Add.
613 * include/bits/stl_tree.h (_Rb_tree<>::destroy_node): Uglify.
619 * include/bits/stl_tree.h (_Rb_tree<>::_M_lower_bound(_Const_Link_type,
630 (_Rb_tree<>::_M_insert(_Base_ptr, _Base_ptr, const value_type&),
637 (_Rb_tree<>::_M_insert_(_Const_Base_ptr, _Const_Base_ptr,
1131 * include/bits/stl_tree.h (_Rb_tree<>::erase(const _Key&)): Don't
1777 * include/bits/stl_tree.h (_Rb_tree<>::max_size): Likewise.
5555 * include/bits/stl_tree.h (_Rb_tree<>::_M_insert_lower,
[all …]
DChangeLog-2005825 rules casting to _Rep_iterator&, forward to _Rb_tree facilities.
828 * include/bits/stl_tree.h (_Rb_tree<>::_M_insert(_Const_Base_ptr,
832 _Rb_tree<>::const_iterator counterparts of existing facilities.
1575 (_Rb_tree<>::begin(), _Rb_tree<>::end()): Adjust consistently.
2785 _Pair_alloc_type and use it for _Rb_tree.
2788 _Key_alloc_type and use it for _Rb_tree.
4489 * include/bits/stl_tree.h (_Rb_tree<>::_M_insert): Don't leak
5215 * include/bits/stl_tree.h (_Rb_tree<>::insert_unique(iterator,
5216 const _Val&), _Rb_tree<>::insert_equal(iterator, const _Val&)):
5249 * include/bits/stl_tree.h (_Rb_tree<>::insert_equal(_II, _II),
[all …]
DChangeLog-2021332 * include/bits/stl_tree.h (_Rb_tree::_Auto_node): Define new
334 (_Rb_tree::_M_insert_node): Use trailing-return-type to simplify
336 (_Rb_tree::_M_insert_lower_node): Likewise.
337 (_Rb_tree::_M_insert_equal_lower_node): Likewise.
338 (_Rb_tree::_M_emplace_unique): Likewise. Use _Auto_node.
339 (_Rb_tree::_M_emplace_equal): Likewise.
340 (_Rb_tree::_M_emplace_hint_unique): Likewise.
341 (_Rb_tree::_M_emplace_hint_equal): Likewise.
374 * include/bits/stl_tree.h (_Rb_tree(_Rb_tree&&, false_type)):
2506 * include/bits/stl_tree.h (_Rb_tree::insert_return_type)
[all …]
DChangeLog-2011643 * include/bits/stl_tree.h (_Rb_tree<>::erase(iterator)): Likewise.
1898 * include/bits/stl_tree.h (_Rb_tree<>::_Rb_tree(const _Compare&,
3488 * include/bits/stl_tree.h (_Rb_tree<>::_Rb_tree(_Rb_tree&&)): Use
3490 (_Rb_tree<>::~_Rb_tree): Use noexcept.
5858 * include/bits/stl_tree.h (_Rb_tree::erase(iterator), erase(iterator,
DChangeLog-20193424 * include/ext/rb_tree (_Rb_tree, allocator): Likewise.
3835 * include/bits/stl_tree.h (_Rb_tree::_S_value(_Const_Link_type)):
3837 (_Rb_tree::_S_key(_Const_Link_type)): Move assertions here. Access
3839 (_Rb_tree::_S_value(_Const_Base_ptr)): Remove.
3840 (_Rb_tree::_S_key(_Const_Base_ptr)): Do downcast and forward to
4071 * include/bits/stl_tree.h (_Rb_tree::erase(const Key*, const Key*)):
5340 * include/bits/stl_tree.h (_Rb_tree): Likewise.
5344 with regexp matching the corresponding _Rb_tree specialization.
DChangeLog-2007670 * include/bits/stl_tree.h (_Rb_tree<>::_Rb_tree_impl<, true>): Remove,
1577 * include/bits/stl_tree.h (_Rb_tree(_Rb_tree&&)): Add.
2330 (_Rb_tree<>::_Rb_tree(const _Compare&, const allocator_type&),
2331 _Rb_tree(const _Rb_tree&)): Adjust.
DChangeLog-2010555 * include/bits/stl_tree.h (_Rb_tree<>::_M_const_cast_iter): Remove.
557 (_Rb_tree<>::erase, _M_insert_unique_): Adjust.
593 * include/bits/stl_tree.h (_Rb_tree<>::_M_insert_, _M_insert_lower,
651 * include/bits/stl_tree.h (_Rb_tree<>::_M_const_cast_iter): Add
684 * include/bits/stl_tree.h (_Rb_tree<>::_M_erase_aux): Add.
685 (_Rb_tree<>::erase(iterator)): Fix in C++0x mode to take
687 (_Rb_tree<>::erase(iterator, iterator)): Likewise.
DChangeLog136 * include/bits/stl_tree.h (_Rb_tree::_M_reinsert_node_unique):
139 (_Rb_tree::_M_reinsert_node_equal): Likewise.
140 (_Rb_tree::_M_reinsert_node_hint_unique): Likewise.
141 (_Rb_tree::_M_reinsert_node_hint_equal): Likewise.
DChangeLog-20201073 (_Rb_tree<>::_M_clone_node): Add _MoveValue template parameter.
1074 (_Rb_tree<>::_M_mbegin): New.
1075 (_Rb_tree<>::_M_begin): Use latter.
1076 (_Rb_tree<>::_M_copy): Add _MoveValues template parameter.
6488 * include/bits/stl_tree.h (_Rb_tree): Likewise.
8740 (_Rb_tree<>::_M_move_assign(_Rb_tree&, false_type)): Replace
DChangeLog-2017293 * include/bits/stl_tree.h (_Rb_tree): Relax invocable checks for
315 * include/bits/stl_tree.h (_Rb_tree): Likewise.
2619 * include/bits/stl_tree.h (_Rb_tree::insert_return_type): Use
DChangeLog-2013505 (_Rb_tree): Use allocator_traits and implement support for sets and
1624 (_Rb_tree) [_M_put_node, _M_destroy_node, _M_root, _M_leftmost,
4001 * include/bits/stl_tree.h (_Rb_tree::_M_create_node): Use
DChangeLog-2008723 (_Rb_tree<>::_M_create_node<>(_Args&&...)): Add in C++0x mode,
725 (_Rb_tree<>::_M_destroy_node(_Link_type): Use _M_get_Node_allocator
862 * include/bits/stl_tree.h (_Rb_tree<>::max_size): Use Node_allocator
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/config/abi/pre/
Dgnu.ver664 # std::_Rb_tree

12