Lines Matching refs:_Compare
60 template <class _Tp, class _Compare, class _Allocator> class __tree;
991 template<class _Tp, class _Compare>
993 _LIBCPP_DIAGNOSE_WARNING(!__invokable<_Compare const&, _Tp const&, _Tp const&>::value,
998 template <class _Tp, class _Compare, class _Allocator>
1003 typedef _Compare value_compare;
1548 template <class _Tp, class _Compare, class _Allocator>
1549 __tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp)
1558 template <class _Tp, class _Compare, class _Allocator>
1559 __tree<_Tp, _Compare, _Allocator>::__tree(const allocator_type& __a)
1567 template <class _Tp, class _Compare, class _Allocator>
1568 __tree<_Tp, _Compare, _Allocator>::__tree(const value_compare& __comp,
1578 template <class _Tp, class _Compare, class _Allocator>
1579 typename __tree<_Tp, _Compare, _Allocator>::__node_pointer
1580 __tree<_Tp, _Compare, _Allocator>::_DetachedTreeCache::__detach_from_tree(__tree *__t) _NOEXCEPT
1599 template <class _Tp, class _Compare, class _Allocator>
1600 typename __tree<_Tp, _Compare, _Allocator>::__node_pointer
1601 __tree<_Tp, _Compare, _Allocator>::_DetachedTreeCache::__detach_next(__node_pointer __cache) _NOEXC…
1621 template <class _Tp, class _Compare, class _Allocator>
1622 __tree<_Tp, _Compare, _Allocator>&
1623 __tree<_Tp, _Compare, _Allocator>::operator=(const __tree& __t)
1634 template <class _Tp, class _Compare, class _Allocator>
1637 __tree<_Tp, _Compare, _Allocator>::__assign_unique(_ForwardIterator __first, _ForwardIterator __las…
1657 template <class _Tp, class _Compare, class _Allocator>
1660 __tree<_Tp, _Compare, _Allocator>::__assign_multi(_InputIterator __first, _InputIterator __last)
1681 template <class _Tp, class _Compare, class _Allocator>
1682 __tree<_Tp, _Compare, _Allocator>::__tree(const __tree& __t)
1690 template <class _Tp, class _Compare, class _Allocator>
1691 __tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t)
1710 template <class _Tp, class _Compare, class _Allocator>
1711 __tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t, const allocator_type& __a)
1736 template <class _Tp, class _Compare, class _Allocator>
1738 __tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, true_type)
1758 template <class _Tp, class _Compare, class _Allocator>
1760 __tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, false_type)
1782 template <class _Tp, class _Compare, class _Allocator>
1783 __tree<_Tp, _Compare, _Allocator>&
1784 __tree<_Tp, _Compare, _Allocator>::operator=(__tree&& __t)
1796 template <class _Tp, class _Compare, class _Allocator>
1797 __tree<_Tp, _Compare, _Allocator>::~__tree()
1804 template <class _Tp, class _Compare, class _Allocator>
1806 __tree<_Tp, _Compare, _Allocator>::destroy(__node_pointer __nd) _NOEXCEPT
1818 template <class _Tp, class _Compare, class _Allocator>
1820 __tree<_Tp, _Compare, _Allocator>::swap(__tree& __t)
1846 template <class _Tp, class _Compare, class _Allocator>
1848 __tree<_Tp, _Compare, _Allocator>::clear() _NOEXCEPT
1859 template <class _Tp, class _Compare, class _Allocator>
1860 typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer&
1861 __tree<_Tp, _Compare, _Allocator>::__find_leaf_low(__parent_pointer& __parent,
1898 template <class _Tp, class _Compare, class _Allocator>
1899 typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer&
1900 __tree<_Tp, _Compare, _Allocator>::__find_leaf_high(__parent_pointer& __parent,
1940 template <class _Tp, class _Compare, class _Allocator>
1941 typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer&
1942 __tree<_Tp, _Compare, _Allocator>::__find_leaf(const_iterator __hint,
1975 template <class _Tp, class _Compare, class _Allocator>
1977 typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer&
1978 __tree<_Tp, _Compare, _Allocator>::__find_equal(__parent_pointer& __parent,
2025 template <class _Tp, class _Compare, class _Allocator>
2027 typename __tree<_Tp, _Compare, _Allocator>::__node_base_pointer&
2028 __tree<_Tp, _Compare, _Allocator>::__find_equal(const_iterator __hint,
2081 template <class _Tp, class _Compare, class _Allocator>
2082 void __tree<_Tp, _Compare, _Allocator>::__insert_node_at(
2097 template <class _Tp, class _Compare, class _Allocator>
2099 pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool>
2100 __tree<_Tp, _Compare, _Allocator>::__emplace_unique_key_args(_Key const& __k, _Args&&... __args)
2116 template <class _Tp, class _Compare, class _Allocator>
2118 pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool>
2119 __tree<_Tp, _Compare, _Allocator>::__emplace_hint_unique_key_args(
2137 template <class _Tp, class _Compare, class _Allocator>
2139 typename __tree<_Tp, _Compare, _Allocator>::__node_holder
2140 __tree<_Tp, _Compare, _Allocator>::__construct_node(_Args&& ...__args)
2152 template <class _Tp, class _Compare, class _Allocator>
2154 pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool>
2155 __tree<_Tp, _Compare, _Allocator>::__emplace_unique_impl(_Args&&... __args)
2171 template <class _Tp, class _Compare, class _Allocator>
2173 typename __tree<_Tp, _Compare, _Allocator>::iterator
2174 __tree<_Tp, _Compare, _Allocator>::__emplace_hint_unique_impl(const_iterator __p, _Args&&... __args)
2189 template <class _Tp, class _Compare, class _Allocator>
2191 typename __tree<_Tp, _Compare, _Allocator>::iterator
2192 __tree<_Tp, _Compare, _Allocator>::__emplace_multi(_Args&&... __args)
2201 template <class _Tp, class _Compare, class _Allocator>
2203 typename __tree<_Tp, _Compare, _Allocator>::iterator
2204 __tree<_Tp, _Compare, _Allocator>::__emplace_hint_multi(const_iterator __p,
2214 template <class _Tp, class _Compare, class _Allocator>
2215 pair<typename __tree<_Tp, _Compare, _Allocator>::iterator, bool>
2216 __tree<_Tp, _Compare, _Allocator>::__node_assign_unique(const __container_value_type& __v, __node_p…
2233 template <class _Tp, class _Compare, class _Allocator>
2234 typename __tree<_Tp, _Compare, _Allocator>::iterator
2235 __tree<_Tp, _Compare, _Allocator>::__node_insert_multi(__node_pointer __nd)
2243 template <class _Tp, class _Compare, class _Allocator>
2244 typename __tree<_Tp, _Compare, _Allocator>::iterator
2245 __tree<_Tp, _Compare, _Allocator>::__node_insert_multi(const_iterator __p,
2254 template <class _Tp, class _Compare, class _Allocator>
2255 typename __tree<_Tp, _Compare, _Allocator>::iterator
2256 __tree<_Tp, _Compare, _Allocator>::__remove_node_pointer(__node_pointer __ptr) _NOEXCEPT
2269 template <class _Tp, class _Compare, class _Allocator>
2273 __tree<_Tp, _Compare, _Allocator>::__node_handle_insert_unique(
2294 template <class _Tp, class _Compare, class _Allocator>
2297 typename __tree<_Tp, _Compare, _Allocator>::iterator
2298 __tree<_Tp, _Compare, _Allocator>::__node_handle_insert_unique(
2320 template <class _Tp, class _Compare, class _Allocator>
2324 __tree<_Tp, _Compare, _Allocator>::__node_handle_extract(key_type const& __key)
2332 template <class _Tp, class _Compare, class _Allocator>
2336 __tree<_Tp, _Compare, _Allocator>::__node_handle_extract(const_iterator __p)
2343 template <class _Tp, class _Compare, class _Allocator>
2347 __tree<_Tp, _Compare, _Allocator>::__node_handle_merge_unique(_Tree& __source)
2367 template <class _Tp, class _Compare, class _Allocator>
2370 typename __tree<_Tp, _Compare, _Allocator>::iterator
2371 __tree<_Tp, _Compare, _Allocator>::__node_handle_insert_multi(_NodeHandle&& __nh)
2384 template <class _Tp, class _Compare, class _Allocator>
2387 typename __tree<_Tp, _Compare, _Allocator>::iterator
2388 __tree<_Tp, _Compare, _Allocator>::__node_handle_insert_multi(
2403 template <class _Tp, class _Compare, class _Allocator>
2407 __tree<_Tp, _Compare, _Allocator>::__node_handle_merge_multi(_Tree& __source)
2427 template <class _Tp, class _Compare, class _Allocator>
2428 typename __tree<_Tp, _Compare, _Allocator>::iterator
2429 __tree<_Tp, _Compare, _Allocator>::erase(const_iterator __p)
2440 template <class _Tp, class _Compare, class _Allocator>
2441 typename __tree<_Tp, _Compare, _Allocator>::iterator
2442 __tree<_Tp, _Compare, _Allocator>::erase(const_iterator __f, const_iterator __l)
2449 template <class _Tp, class _Compare, class _Allocator>
2451 typename __tree<_Tp, _Compare, _Allocator>::size_type
2452 __tree<_Tp, _Compare, _Allocator>::__erase_unique(const _Key& __k)
2461 template <class _Tp, class _Compare, class _Allocator>
2463 typename __tree<_Tp, _Compare, _Allocator>::size_type
2464 __tree<_Tp, _Compare, _Allocator>::__erase_multi(const _Key& __k)
2473 template <class _Tp, class _Compare, class _Allocator>
2475 typename __tree<_Tp, _Compare, _Allocator>::iterator
2476 __tree<_Tp, _Compare, _Allocator>::find(const _Key& __v)
2484 template <class _Tp, class _Compare, class _Allocator>
2486 typename __tree<_Tp, _Compare, _Allocator>::const_iterator
2487 __tree<_Tp, _Compare, _Allocator>::find(const _Key& __v) const
2495 template <class _Tp, class _Compare, class _Allocator>
2497 typename __tree<_Tp, _Compare, _Allocator>::size_type
2498 __tree<_Tp, _Compare, _Allocator>::__count_unique(const _Key& __k) const
2515 template <class _Tp, class _Compare, class _Allocator>
2517 typename __tree<_Tp, _Compare, _Allocator>::size_type
2518 __tree<_Tp, _Compare, _Allocator>::__count_multi(const _Key& __k) const
2540 template <class _Tp, class _Compare, class _Allocator>
2542 typename __tree<_Tp, _Compare, _Allocator>::iterator
2543 __tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v,
2560 template <class _Tp, class _Compare, class _Allocator>
2562 typename __tree<_Tp, _Compare, _Allocator>::const_iterator
2563 __tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v,
2580 template <class _Tp, class _Compare, class _Allocator>
2582 typename __tree<_Tp, _Compare, _Allocator>::iterator
2583 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
2600 template <class _Tp, class _Compare, class _Allocator>
2602 typename __tree<_Tp, _Compare, _Allocator>::const_iterator
2603 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
2620 template <class _Tp, class _Compare, class _Allocator>
2622 pair<typename __tree<_Tp, _Compare, _Allocator>::iterator,
2623 typename __tree<_Tp, _Compare, _Allocator>::iterator>
2624 __tree<_Tp, _Compare, _Allocator>::__equal_range_unique(const _Key& __k)
2648 template <class _Tp, class _Compare, class _Allocator>
2650 pair<typename __tree<_Tp, _Compare, _Allocator>::const_iterator,
2651 typename __tree<_Tp, _Compare, _Allocator>::const_iterator>
2652 __tree<_Tp, _Compare, _Allocator>::__equal_range_unique(const _Key& __k) const
2676 template <class _Tp, class _Compare, class _Allocator>
2678 pair<typename __tree<_Tp, _Compare, _Allocator>::iterator,
2679 typename __tree<_Tp, _Compare, _Allocator>::iterator>
2680 __tree<_Tp, _Compare, _Allocator>::__equal_range_multi(const _Key& __k)
2701 template <class _Tp, class _Compare, class _Allocator>
2703 pair<typename __tree<_Tp, _Compare, _Allocator>::const_iterator,
2704 typename __tree<_Tp, _Compare, _Allocator>::const_iterator>
2705 __tree<_Tp, _Compare, _Allocator>::__equal_range_multi(const _Key& __k) const
2726 template <class _Tp, class _Compare, class _Allocator>
2727 typename __tree<_Tp, _Compare, _Allocator>::__node_holder
2728 __tree<_Tp, _Compare, _Allocator>::remove(const_iterator __p) _NOEXCEPT
2744 template <class _Tp, class _Compare, class _Allocator>
2747 swap(__tree<_Tp, _Compare, _Allocator>& __x,
2748 __tree<_Tp, _Compare, _Allocator>& __y)