|
| constexpr Iterator_t | lower_bound (const Iterator_t &hint, const Element_t &element) |
| | Return the lower bound for element, using an iterator hint known to be less than or equal to the correct result. More...
|
| |
| constexpr Const_iterator_t | lower_bound (const Const_iterator_t &hint, const Element_t &element) const |
| | Return the lower bound for element, using an iterator hint known to be less than or equal to the correct result. More...
|
| |
| constexpr Iterator_t | lower_bound (const Element_t &element) |
| | Return the lower bound for element. More...
|
| |
| constexpr Const_iterator_t | lower_bound (const Element_t &element) const |
| | Return the lower bound for element. More...
|
| |
| constexpr Iterator_t | upper_bound (const Iterator_t &hint, const Element_t &element) |
| | Return the upper bound for element, using an iterator hint known to be less than or equal to the correct result. More...
|
| |
| constexpr Const_iterator_t | upper_bound (const Const_iterator_t &hint, const Element_t &element) const |
| | Return the upper bound for element, using an iterator hint known to be less than or equal to the correct result. More...
|
| |
| constexpr Iterator_t | upper_bound (const Element_t &element) |
| | Return the upper bound for element. More...
|
| |
| constexpr Const_iterator_t | upper_bound (const Element_t &element) const |
| | Return the upper bound for element. More...
|
| |
| static constexpr Iter_t | lower_bound_dispatch (Self_arg_t &self_arg, const Iter_t &hint, const Element_t &element) |
| | Implements the lower_bound functions with hint defined above, checking if the hint is already the correct answer, and otherwise delegating to the implementing class. More...
|
| |
| static constexpr auto | lower_bound_dispatch (Self_arg_t &self_arg, const Element_t &element) |
| | Implements the lower_bound functions without hint defined above. More...
|
| |
| static constexpr Iter_t | upper_bound_dispatch (Self_arg_t &self_arg, const Iter_t &hint, const Element_t &element) |
| | Implements the upper_bound functions with hint defined above, checking if the hint is already the correct answer, and otherwise delegating to the implementing class. More...
|
| |
| static constexpr auto | upper_bound_dispatch (Self_arg_t &self_arg, const Element_t &element) |
| | Implements the upper_bound functions without hint defined above. More...
|
| |
template<class Self_tp, Is_boundary_iterator Iterator_tp, Is_boundary_iterator Const_iterator_tp, Is_bounded_set_traits Set_traits_tp>
class mysql::sets::detail::Boundary_set_interface< Self_tp, Iterator_tp, Const_iterator_tp, Set_traits_tp >
CRTP base class used to implement Boundary Sets.
This defines all the lower_bound/upper_bound members based on the lower_bound_impl/upper_bound_impl members in the subclass.
The subclass additionally has to define the view members, e.g. by deriving from mysql::ranges::Collection_interface or mysql::containers::Basic_container_wrapper. Doing so will make it satisfy the mysql::sets::Is_boundary_set concept. As a convenience, use Boundary_view_interface to inherit both from this class and from Collection_interface, and use Basic_boundary_container_wrapper to inherit both this class and from Basic_container_wrapper.
- Template Parameters
-
| Self_tp | The subclass. This must satisfy Is_boundary_set_implementation. |
| Iterator_tp | Iterator type. |
| Const_iterator_tp | Const iterator type. |
| Set_traits_tp | Set Traits for the set. |