Namespaces
namespace	chrono

namespace	detail

namespace	ranges

Classes
struct	identity

struct	type_identity

Typedefs
template<typename Dereferencable >
using	iter_reference_t = decltype(*std::declval<Dereferencable&>())

template<typename T >
using	remove_cvref = std::remove_cv<std::remove_reference_t<T>>

template<typename T >
using	remove_cvref_t = std::remove_cv_t<std::remove_reference_t<T>>

template<typename T >
using	type_identity_t = typename type_identity<T>::type

Functions
template<typename InputIterator , typename OutputIterator >
constexpr OutputIterator	copy (InputIterator first, InputIterator last, OutputIterator dest)

template<typename InputIterator , typename OutputIterator , typename UnaryPredicate >
constexpr OutputIterator	copy_if (InputIterator first, InputIterator last, OutputIterator dest, UnaryPredicate pred)

template<typename InputIterator , typename Size , typename OutputIterator >
constexpr OutputIterator	copy_n (InputIterator first, Size n, OutputIterator dest)

template<typename ForwardIterator , typename Value >
constexpr void	fill (ForwardIterator first, ForwardIterator last, const Value &value)

template<typename OutputIterator , typename Size , typename Value >
constexpr OutputIterator	fill_n (OutputIterator first, Size n, const Value &value)

template<typename ForwardIterator , typename BinaryPredicate = std::less<>>
constexpr ForwardIterator	is_sorted_until (ForwardIterator first, ForwardIterator last, BinaryPredicate p={})

template<typename ForwardIterator , typename BinaryPredicate = std::less<>>
constexpr bool	is_sorted (ForwardIterator first, ForwardIterator last, BinaryPredicate p={})

template<typename InputIterator , typename OutputIterator , typename UnaryFunction >
constexpr OutputIterator	transform (InputIterator first, InputIterator last, OutputIterator dest, UnaryFunction op)

template<class C >
constexpr auto	ssize (const C &c) -> std::common_type_t< std::ptrdiff_t, std::make_signed_t< decltype(c.size())> >

template<class T , std::ptrdiff_t N>
constexpr std::ptrdiff_t	ssize (const T(&)[N]) noexcept

template<typename T , typename... Args, typename Enable = std::void_t<decltype(::new (std::declval<void *>()) T(std::declval<Args>()...))>>
T *	construct_at (T *ptr, Args &&... args)

template<typename T >
constexpr T *	to_address (T *p) noexcept

template<typename Ptr , typename std::enable_if_t<!std::is_pointer_v< Ptr >, bool > = true>
constexpr auto	to_address (const Ptr &ptr) noexcept

constexpr bool	is_constant_evaluated () noexcept

template<typename T , typename U >
constexpr std::vector< T, std::allocator< T > >::size_type	erase (std::vector< T, std::allocator< T > > &c, const U &value)

template<typename T , typename Pred >
constexpr std::vector< T, std::allocator< T > >::size_type	erase_if (std::vector< T, std::allocator< T > > &c, Pred pred)

Variables
constexpr auto	dynamic_extent = std::size_t(-1)

Typedef Documentation

◆ iter_reference_t

template<typename Dereferencable >

using q20::iter_reference_t = decltype(*std::declval<Dereferencable&>())

Definition at line 48 of file q20iterator.h.

◆ remove_cvref

template<typename T >

using q20::remove_cvref = std::remove_cv<std::remove_reference_t<T>>

Definition at line 60 of file q20type_traits.h.

◆ remove_cvref_t

template<typename T >

using q20::remove_cvref_t = std::remove_cv_t<std::remove_reference_t<T>>

Definition at line 62 of file q20type_traits.h.

◆ type_identity_t

template<typename T >

using q20::type_identity_t = typename type_identity<T>::type

Definition at line 75 of file q20type_traits.h.

Function Documentation

◆ construct_at()

template<typename T , typename... Args, typename Enable = std::void_t<decltype(::new (std::declval<void *>()) T(std::declval<Args>()...))>>

T * q20::construct_at	(	T *	ptr,
		Args &&...	args )

Definition at line 41 of file q20memory.h.

References args, and ptr().

Referenced by QVLABase< T >::emplace_back_impl(), QRecyclePool< T, Step >::New(), QVLABase< T >::resize_impl(), and QVLABase< T >::resize_impl().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ copy()

template<typename InputIterator , typename OutputIterator >

constexpr OutputIterator q20::copy	(	InputIterator	first,
		InputIterator	last,
		OutputIterator	dest )

constexpr

Definition at line 43 of file q20algorithm.h.

◆ copy_if()

template<typename InputIterator , typename OutputIterator , typename UnaryPredicate >

constexpr OutputIterator q20::copy_if	(	InputIterator	first,
		InputIterator	last,
		OutputIterator	dest,
		UnaryPredicate	pred )

constexpr

Definition at line 55 of file q20algorithm.h.

◆ copy_n()

template<typename InputIterator , typename Size , typename OutputIterator >

constexpr OutputIterator q20::copy_n	(	InputIterator	first,
		Size	n,
		OutputIterator	dest )

constexpr

Definition at line 69 of file q20algorithm.h.

Referenced by QtPrivate::StaticString< N >::StaticString(), QPluginMetaData::copy(), and QtPrivate::makeStaticString().

Here is the caller graph for this function:

◆ erase()

template<typename T , typename U >

constexpr std::vector< T, std::allocator< T > >::size_type q20::erase	(	std::vector< T, std::allocator< T > > &	c,
		const U &	value )

constexpr

Definition at line 45 of file q20vector.h.

References QSet< T >::end(), and it.

Here is the call graph for this function:

◆ erase_if()

template<typename T , typename Pred >

constexpr std::vector< T, std::allocator< T > >::size_type q20::erase_if	(	std::vector< T, std::allocator< T > > &	c,
		Pred	pred )

constexpr

Definition at line 55 of file q20vector.h.

References QSet< T >::end(), and it.

Referenced by QLibraryStore::releaseLibrary().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ fill()

template<typename ForwardIterator , typename Value >

constexpr void q20::fill	(	ForwardIterator	first,
		ForwardIterator	last,
		const Value &	value )

constexpr

Definition at line 82 of file q20algorithm.h.

Referenced by QtPrivate::q_boyer_moore_searcher< RandomIt1, Hash, BinaryPredicate >::q_boyer_moore_searcher(), QtPrivate::q_boyer_moore_searcher_hashed_needle< RandomIt1, Hash, BinaryPredicate >::q_boyer_moore_searcher_hashed_needle(), and QStaticByteArrayMatcherBase::~QStaticByteArrayMatcherBase().

Here is the caller graph for this function:

◆ fill_n()

template<typename OutputIterator , typename Size , typename Value >

constexpr OutputIterator q20::fill_n	(	OutputIterator	first,
		Size	n,
		const Value &	value )

constexpr

Definition at line 92 of file q20algorithm.h.

◆ is_constant_evaluated()

constexpr bool q20::is_constant_evaluated ( )

constexprnoexcept

Definition at line 36 of file q20type_traits.h.

Referenced by QtPrivate::lengthHelperContainer().

Here is the caller graph for this function:

◆ is_sorted()

template<typename ForwardIterator , typename BinaryPredicate = std::less<>>

constexpr bool q20::is_sorted	(	ForwardIterator	first,
		ForwardIterator	last,
		BinaryPredicate	p = {} )

constexpr

Definition at line 118 of file q20algorithm.h.

◆ is_sorted_until()

template<typename ForwardIterator , typename BinaryPredicate = std::less<>>

constexpr ForwardIterator q20::is_sorted_until	(	ForwardIterator	first,
		ForwardIterator	last,
		BinaryPredicate	p = {} )

constexpr

Definition at line 104 of file q20algorithm.h.

◆ ssize() [1/2]

template<class C >

constexpr auto q20::ssize ( const C & c ) -> std::common_type_t<std::ptrdiff_t, std::make_signed_t<decltype(c.size())>>

constexpr

Definition at line 33 of file q20iterator.h.

◆ ssize() [2/2]

template<class T , std::ptrdiff_t N>

constexpr std::ptrdiff_t q20::ssize ( const T(&)[N] )

constexprnoexcept

Definition at line 37 of file q20iterator.h.

◆ to_address() [1/2]

template<typename Ptr , typename std::enable_if_t<!std::is_pointer_v< Ptr >, bool > = true>

constexpr auto q20::to_address ( const Ptr & ptr )

constexprnoexcept

Definition at line 85 of file q20memory.h.

References ptr(), and to_address().

Here is the call graph for this function:

◆ to_address() [2/2]

template<typename T >

constexpr T * q20::to_address ( T * p )

constexprnoexcept

Definition at line 57 of file q20memory.h.

References to_address().

Referenced by QString::assign(), q20::detail::to_address_helper< Ptr, typename >::get(), to_address(), and to_address().

Here is the call graph for this function:

Here is the caller graph for this function:

◆ transform()

template<typename InputIterator , typename OutputIterator , typename UnaryFunction >

constexpr OutputIterator q20::transform	(	InputIterator	first,
		InputIterator	last,
		OutputIterator	dest,
		UnaryFunction	op )

constexpr

Definition at line 125 of file q20algorithm.h.

Referenced by QtPrivate::makeOffsetStringArray().

Here is the caller graph for this function:

Variable Documentation

◆ dynamic_extent

constexpr auto q20::dynamic_extent = std::size_t(-1)

inlineconstexpr

Definition at line 26 of file qspan.h.

Referenced by QSpan< T, E >::subspan().

Namespaces

Classes

Typedefs

Functions

Variables

Typedef Documentation

◆ iter_reference_t

◆ remove_cvref

◆ remove_cvref_t

◆ type_identity_t

Function Documentation

◆ construct_at()

◆ copy()

◆ copy_if()

◆ copy_n()

◆ erase()

◆ erase_if()

◆ fill()

◆ fill_n()

◆ is_constant_evaluated()

◆ is_sorted()

◆ is_sorted_until()

◆ ssize() [1/2]

◆ ssize() [2/2]

◆ to_address() [1/2]

◆ to_address() [2/2]

◆ transform()

Variable Documentation

◆ dynamic_extent