home | help 
std::flat_set::lower_bound(3)  C++ Standard Libary std::flat_set::lower_bound(3)

NAME
     std::flat_set::lower_bound - std::flat_set::lower_bound

Synopsis
	iterator lower_bound( const Key& key ); 	    (1) (since C++23)
	const_iterator lower_bound( const Key& key ) const; (2) (since C++23)
	template< class K >				    (3) (since C++23)
	iterator lower_bound( const K& x );
	template< class K >				    (4) (since C++23)
	const_iterator lower_bound( const K& x ) const;

	1,2)  Returns an iterator pointing to the first element that is not less
     than (i.e.
	greater or equal to) key.
	3,4) Returns an iterator pointing to the first element that compares not
     less (i.e.
	greater or equal) to the value x. This overload participates in overload
     resolution
	only if the qualified-id Compare::is_transparent is valid and denotes  a
     type. It
	allows calling this function without constructing an instance of Key.

Parameters
	key - key value to compare the elements to
	x   - alternative value that can be compared to Key

Return value
	Iterator  pointing to the first element that is not less than key. If no
     such element
	is found, a past-the-end iterator (see end()) is returned.

Complexity
	Logarithmic in the size of the container.

Example
	 This section is incomplete
	 Reason: no example

See also
	equal_range returns range of elements matching a specific key
		    (public member function)
	upper_bound returns an iterator to the first element  greater  than  the
     given key
		    (public member function)

Category:
	  * Todo no example

http://cppreference.com 	   2024.06.10	   std::flat_set::lower_bound(3)
home | help