fl::adl_barrier Namespace Reference

Functions
template<typename T, typename A, typename... Args>
shared_ptr< T >	allocate_shared (const A &alloc, Args &&... args) FL_NO_EXCEPT
template<typename Container>
constexpr auto	begin (const Container &c) FL_NO_EXCEPT -> decltype(c.begin())
template<typename Container>
constexpr auto	begin (Container &c) FL_NO_EXCEPT -> decltype(c.begin())
template<typename T, fl::size N>
constexpr T *	begin (T(&array)[N]) FL_NO_EXCEPT
template<typename Container>
constexpr auto	end (const Container &c) FL_NO_EXCEPT -> decltype(c.end())
template<typename Container>
constexpr auto	end (Container &c) FL_NO_EXCEPT -> decltype(c.end())
template<typename T, fl::size N>
constexpr T *	end (T(&array)[N]) FL_NO_EXCEPT
template<typename Iterator1, typename Iterator2>
bool	equal (Iterator1 first1, Iterator1 last1, Iterator2 first2) FL_NO_EXCEPT
template<typename Iterator1, typename Iterator2, typename BinaryPredicate>
bool	equal (Iterator1 first1, Iterator1 last1, Iterator2 first2, BinaryPredicate pred) FL_NO_EXCEPT
template<typename Iterator1, typename Iterator2>
bool	equal (Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2) FL_NO_EXCEPT
template<typename Iterator1, typename Iterator2, typename BinaryPredicate>
bool	equal (Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2, BinaryPredicate pred) FL_NO_EXCEPT
template<typename Container1, typename Container2>
bool	equal_container (const Container1 &c1, const Container2 &c2) FL_NO_EXCEPT
template<typename Container1, typename Container2, typename BinaryPredicate>
bool	equal_container (const Container1 &c1, const Container2 &c2, BinaryPredicate pred) FL_NO_EXCEPT
template<typename Iterator, typename T>
void	fill (Iterator first, Iterator last, const T &value) FL_NO_EXCEPT
template<typename Iterator, typename T>
Iterator	find (Iterator first, Iterator last, const T &value) FL_NO_EXCEPT
template<typename Iterator, typename UnaryPredicate>
Iterator	find_if (Iterator first, Iterator last, UnaryPredicate pred) FL_NO_EXCEPT
template<typename Iterator, typename UnaryPredicate>
Iterator	find_if_not (Iterator first, Iterator last, UnaryPredicate pred) FL_NO_EXCEPT
template<typename T>
constexpr T &&	forward (typename remove_reference< T >::type &&t) FL_NO_EXCEPT
template<typename T>
constexpr T &&	forward (typename remove_reference< T >::type &t) FL_NO_EXCEPT
template<typename F, typename... Args>
auto	invoke (F &&f, Args &&... args) FL_NO_EXCEPT -> enable_if_t<!is_member_function_pointer< typename remove_reference< F >::type >::value &&!detail::is_member_data_pointer< typename remove_reference< F >::type >::value, decltype(fl::forward< F >(f)(fl::forward< Args >(args)...))>
template<typename F, typename T1>
auto	invoke (F &&f, T1 &&t1) FL_NO_EXCEPT -> enable_if_t< detail::is_member_data_pointer< typename remove_reference< F >::type >::value &&!detail::use_pointer_syntax< T1 >::value, decltype(fl::forward< T1 >(t1).*f)>
template<typename F, typename T1, typename... Args>
auto	invoke (F &&f, T1 &&t1, Args &&... args) FL_NO_EXCEPT -> enable_if_t< is_member_function_pointer< typename remove_reference< F >::type >::value &&!detail::use_pointer_syntax< T1 >::value, decltype((fl::forward< T1 >(t1).*f)(fl::forward< Args >(args)...))>
template<typename Iterator1, typename Iterator2>
bool	lexicographical_compare (Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2) FL_NO_EXCEPT
template<typename Iterator1, typename Iterator2, typename Compare>
bool	lexicographical_compare (Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2, Compare comp) FL_NO_EXCEPT
template<typename Iterator, typename T>
Iterator	lower_bound (Iterator first, Iterator last, const T &value) FL_NO_EXCEPT
template<typename Iterator, typename T, typename Compare>
Iterator	lower_bound (Iterator first, Iterator last, const T &value, Compare comp) FL_NO_EXCEPT
template<typename T1, typename T2>
pair< typename fl::decay< T1 >::type, typename fl::decay< T2 >::type >	make_pair (T1 &&t, T2 &&u) FL_NO_EXCEPT
template<typename T, typename... Args>
shared_ptr< T >	make_shared (Args &&... args) FL_NO_EXCEPT
template<typename... Ts>
tuple< typename fl::decay< Ts >::type... >	make_tuple (Ts &&... args) FL_NO_EXCEPT
template<typename T, typename... Args>
fl::enable_if<!fl::is_array< T >::value, unique_ptr< T > >::type	make_unique (Args &&... args) FL_NO_EXCEPT
template<typename T>
fl::enable_if< fl::is_array< T >::value, unique_ptr< T > >::type	make_unique (fl::size_t size) FL_NO_EXCEPT
template<typename Iterator>
Iterator	max_element (Iterator first, Iterator last) FL_NO_EXCEPT
template<typename Iterator, typename Compare>
Iterator	max_element (Iterator first, Iterator last, Compare comp) FL_NO_EXCEPT
template<typename Iterator>
Iterator	min_element (Iterator first, Iterator last) FL_NO_EXCEPT
template<typename Iterator, typename Compare>
Iterator	min_element (Iterator first, Iterator last, Compare comp) FL_NO_EXCEPT
template<typename T>
constexpr remove_reference< T >::type &&	move (T &&t) FL_NO_EXCEPT
template<typename Iterator, typename T>
Iterator	remove (Iterator first, Iterator last, const T &value) FL_NO_EXCEPT
template<typename Iterator, typename UnaryPredicate>
Iterator	remove_if (Iterator first, Iterator last, UnaryPredicate pred) FL_NO_EXCEPT
template<typename Iterator, typename T>
void	replace (Iterator first, Iterator last, const T &old_value, const T &new_value) FL_NO_EXCEPT
template<typename Iterator, typename UnaryPredicate, typename T>
void	replace_if (Iterator first, Iterator last, UnaryPredicate pred, const T &new_value) FL_NO_EXCEPT
template<typename Iterator>
void	reverse (Iterator first, Iterator last) FL_NO_EXCEPT
template<typename Iterator>
void	shuffle (Iterator first, Iterator last) FL_NO_EXCEPT
template<typename Iterator>
void	shuffle (Iterator first, Iterator last, math::random &rng) FL_NO_EXCEPT
template<typename Iterator, typename RandomGenerator>
void	shuffle (Iterator first, Iterator last, RandomGenerator &g) FL_NO_EXCEPT
template<typename Iterator>
void	sort (Iterator first, Iterator last) FL_NO_EXCEPT
template<typename Iterator, typename Compare>
void	sort (Iterator first, Iterator last, Compare comp) FL_NO_EXCEPT
template<typename Iterator>
void	sort_small (Iterator first, Iterator last) FL_NO_EXCEPT
template<typename Iterator, typename Compare>
void	sort_small (Iterator first, Iterator last, Compare comp) FL_NO_EXCEPT
template<typename Iterator>
void	stable_sort (Iterator first, Iterator last) FL_NO_EXCEPT
template<typename Iterator, typename Compare>
void	stable_sort (Iterator first, Iterator last, Compare comp) FL_NO_EXCEPT