#include <qflatmap_p.h>

Inheritance diagram for QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >:

Collaboration diagram for QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >:

Classes
struct	containers
class	iterator
class	const_iterator

Public Types
using	key_type = Key
using	mapped_type = T
using	value_compare = QFlatMapValueCompare<Key, T, Compare>
using	value_type = typename value_compare::value_type
using	key_container_type = KeyContainer
using	mapped_container_type = MappedContainer
using	size_type = typename key_container_type::size_type
using	key_compare = Compare

Public Member Functions
	QFlatMap ()=default
	QFlatMap (const key_container_type &keys, const mapped_container_type &values)
	QFlatMap (key_container_type &&keys, const mapped_container_type &values)
	QFlatMap (const key_container_type &keys, mapped_container_type &&values)
	QFlatMap (key_container_type &&keys, mapped_container_type &&values)
	QFlatMap (std::initializer_list< value_type > lst)
template<class InputIt, is_compatible_iterator< InputIt > = nullptr>
	QFlatMap (InputIt first, InputIt last)
	QFlatMap (Qt::OrderedUniqueRange_t, const key_container_type &keys, const mapped_container_type &values)
	QFlatMap (Qt::OrderedUniqueRange_t, key_container_type &&keys, const mapped_container_type &values)
	QFlatMap (Qt::OrderedUniqueRange_t, const key_container_type &keys, mapped_container_type &&values)
	QFlatMap (Qt::OrderedUniqueRange_t, key_container_type &&keys, mapped_container_type &&values)
	QFlatMap (Qt::OrderedUniqueRange_t, std::initializer_list< value_type > lst)
template<class InputIt, is_compatible_iterator< InputIt > = nullptr>
	QFlatMap (Qt::OrderedUniqueRange_t, InputIt first, InputIt last)
	QFlatMap (const Compare &compare)
	QFlatMap (const key_container_type &keys, const mapped_container_type &values, const Compare &compare)
	QFlatMap (key_container_type &&keys, const mapped_container_type &values, const Compare &compare)
	QFlatMap (const key_container_type &keys, mapped_container_type &&values, const Compare &compare)
	QFlatMap (key_container_type &&keys, mapped_container_type &&values, const Compare &compare)
	QFlatMap (std::initializer_list< value_type > lst, const Compare &compare)
template<class InputIt, is_compatible_iterator< InputIt > = nullptr>
	QFlatMap (InputIt first, InputIt last, const Compare &compare)
	QFlatMap (Qt::OrderedUniqueRange_t, const key_container_type &keys, const mapped_container_type &values, const Compare &compare)
	QFlatMap (Qt::OrderedUniqueRange_t, key_container_type &&keys, const mapped_container_type &values, const Compare &compare)
	QFlatMap (Qt::OrderedUniqueRange_t, const key_container_type &keys, mapped_container_type &&values, const Compare &compare)
	QFlatMap (Qt::OrderedUniqueRange_t, key_container_type &&keys, mapped_container_type &&values, const Compare &compare)
	QFlatMap (Qt::OrderedUniqueRange_t, std::initializer_list< value_type > lst, const Compare &compare)
template<class InputIt, is_compatible_iterator< InputIt > = nullptr>
	QFlatMap (Qt::OrderedUniqueRange_t, InputIt first, InputIt last, const Compare &compare)
size_type	count () const noexcept
size_type	size () const noexcept
size_type	capacity () const noexcept
bool	isEmpty () const noexcept
bool	empty () const noexcept
containers	extract () &&
const key_container_type &	keys () const noexcept
const mapped_container_type &	values () const noexcept
void	reserve (size_type s)
void	clear ()
bool	remove (const Key &key)
template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>
bool	remove (const X &key)
iterator	erase (iterator it)
T	take (const Key &key)
template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>
T	take (const X &key)
bool	contains (const Key &key) const
template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>
bool	contains (const X &key) const
T	value (const Key &key, const T &defaultValue) const
template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>
T	value (const X &key, const T &defaultValue) const
T	value (const Key &key) const
template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>
T	value (const X &key) const
T &	operator[] (const Key &key)
T &	operator[] (Key &&key)
T	operator[] (const Key &key) const
std::pair< iterator, bool >	insert (const Key &key, const T &value)
std::pair< iterator, bool >	insert (Key &&key, const T &value)
std::pair< iterator, bool >	insert (const Key &key, T &&value)
std::pair< iterator, bool >	insert (Key &&key, T &&value)
template<typename... Args>
std::pair< iterator, bool >	try_emplace (const Key &key, Args &&...args)
template<typename... Args>
std::pair< iterator, bool >	try_emplace (Key &&key, Args &&...args)
template<typename M>
std::pair< iterator, bool >	insert_or_assign (const Key &key, M &&obj)
template<typename M>
std::pair< iterator, bool >	insert_or_assign (Key &&key, M &&obj)
template<class InputIt, is_compatible_iterator< InputIt > = nullptr>
void	insert (InputIt first, InputIt last)
void	insert (const value_type first, const value_type last)
template<class InputIt, is_compatible_iterator< InputIt > = nullptr>
void	insert (Qt::OrderedUniqueRange_t, InputIt first, InputIt last)
void	insert (Qt::OrderedUniqueRange_t, const value_type first, const value_type last)
iterator	begin ()
const_iterator	begin () const
const_iterator	cbegin () const
const_iterator	constBegin () const
iterator	end ()
const_iterator	end () const
const_iterator	cend () const
const_iterator	constEnd () const
std::reverse_iterator< iterator >	rbegin ()
std::reverse_iterator< const_iterator >	rbegin () const
std::reverse_iterator< const_iterator >	crbegin () const
std::reverse_iterator< iterator >	rend ()
std::reverse_iterator< const_iterator >	rend () const
std::reverse_iterator< const_iterator >	crend () const
iterator	lower_bound (const Key &key)
template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>
iterator	lower_bound (const X &key)
const_iterator	lower_bound (const Key &key) const
template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>
const_iterator	lower_bound (const X &key) const
iterator	find (const Key &key)
template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>
iterator	find (const X &key)
const_iterator	find (const Key &key) const
template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>
const_iterator	find (const X &key) const
template<typename Predicate>
size_type	remove_if (Predicate pred)
key_compare	key_comp () const noexcept
value_compare	value_comp () const noexcept

Detailed Description

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>
class QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >

Definition at line 77 of file qflatmap_p.h.

Member Typedef Documentation

◆ key_compare

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

using QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::key_compare = Compare

Definition at line 88 of file qflatmap_p.h.

◆ key_container_type

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

using QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::key_container_type = KeyContainer

Definition at line 85 of file qflatmap_p.h.

◆ key_type

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

using QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::key_type = Key

Definition at line 81 of file qflatmap_p.h.

◆ mapped_container_type

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

using QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::mapped_container_type = MappedContainer

Definition at line 86 of file qflatmap_p.h.

◆ mapped_type

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

using QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::mapped_type = T

Definition at line 82 of file qflatmap_p.h.

◆ size_type

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

using QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::size_type = typename key_container_type::size_type

Definition at line 87 of file qflatmap_p.h.

◆ value_compare

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

using QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value_compare = QFlatMapValueCompare<Key, T, Compare>

Definition at line 83 of file qflatmap_p.h.

◆ value_type

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

using QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value_type = typename value_compare::value_type

Definition at line 84 of file qflatmap_p.h.

Constructor & Destructor Documentation

◆ QFlatMap() [1/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap ( )

default

◆ QFlatMap() [2/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	const key_container_type &	keys,
		const mapped_container_type &	values )

inlineexplicit

Definition at line 383 of file qflatmap_p.h.

◆ QFlatMap() [3/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	key_container_type &&	keys,
		const mapped_container_type &	values )

inlineexplicit

Definition at line 389 of file qflatmap_p.h.

◆ QFlatMap() [4/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	const key_container_type &	keys,
		mapped_container_type &&	values )

inlineexplicit

Definition at line 395 of file qflatmap_p.h.

◆ QFlatMap() [5/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	key_container_type &&	keys,
		mapped_container_type &&	values )

inlineexplicit

Definition at line 401 of file qflatmap_p.h.

◆ QFlatMap() [6/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap ( std::initializer_list< value_type > lst )

inlineexplicit

Definition at line 407 of file qflatmap_p.h.

◆ QFlatMap() [7/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class InputIt, is_compatible_iterator< InputIt > = nullptr>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	InputIt	first,
		InputIt	last )

inlineexplicit

Definition at line 413 of file qflatmap_p.h.

◆ QFlatMap() [8/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	Qt::OrderedUniqueRange_t	,
		const key_container_type &	keys,
		const mapped_container_type &	values )

inlineexplicit

Definition at line 419 of file qflatmap_p.h.

◆ QFlatMap() [9/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	Qt::OrderedUniqueRange_t	,
		key_container_type &&	keys,
		const mapped_container_type &	values )

inlineexplicit

Definition at line 425 of file qflatmap_p.h.

◆ QFlatMap() [10/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	Qt::OrderedUniqueRange_t	,
		const key_container_type &	keys,
		mapped_container_type &&	values )

inlineexplicit

Definition at line 431 of file qflatmap_p.h.

◆ QFlatMap() [11/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	Qt::OrderedUniqueRange_t	,
		key_container_type &&	keys,
		mapped_container_type &&	values )

inlineexplicit

Definition at line 437 of file qflatmap_p.h.

◆ QFlatMap() [12/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	Qt::OrderedUniqueRange_t	,
		std::initializer_list< value_type >	lst )

inlineexplicit

Definition at line 443 of file qflatmap_p.h.

◆ QFlatMap() [13/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class InputIt, is_compatible_iterator< InputIt > = nullptr>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	Qt::OrderedUniqueRange_t	,
		InputIt	first,
		InputIt	last )

inlineexplicit

Definition at line 449 of file qflatmap_p.h.

◆ QFlatMap() [14/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap ( const Compare & compare )

inlineexplicit

Definition at line 454 of file qflatmap_p.h.

◆ QFlatMap() [15/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	const key_container_type &	keys,
		const mapped_container_type &	values,
		const Compare &	compare )

inlineexplicit

Definition at line 459 of file qflatmap_p.h.

◆ QFlatMap() [16/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	key_container_type &&	keys,
		const mapped_container_type &	values,
		const Compare &	compare )

inlineexplicit

Definition at line 466 of file qflatmap_p.h.

◆ QFlatMap() [17/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	const key_container_type &	keys,
		mapped_container_type &&	values,
		const Compare &	compare )

inlineexplicit

Definition at line 473 of file qflatmap_p.h.

◆ QFlatMap() [18/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	key_container_type &&	keys,
		mapped_container_type &&	values,
		const Compare &	compare )

inlineexplicit

Definition at line 480 of file qflatmap_p.h.

◆ QFlatMap() [19/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	std::initializer_list< value_type >	lst,
		const Compare &	compare )

inlineexplicit

Definition at line 487 of file qflatmap_p.h.

◆ QFlatMap() [20/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class InputIt, is_compatible_iterator< InputIt > = nullptr>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	InputIt	first,
		InputIt	last,
		const Compare &	compare )

inlineexplicit

Definition at line 493 of file qflatmap_p.h.

◆ QFlatMap() [21/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	Qt::OrderedUniqueRange_t	,
		const key_container_type &	keys,
		const mapped_container_type &	values,
		const Compare &	compare )

inlineexplicit

Definition at line 500 of file qflatmap_p.h.

◆ QFlatMap() [22/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	Qt::OrderedUniqueRange_t	,
		key_container_type &&	keys,
		const mapped_container_type &	values,
		const Compare &	compare )

inlineexplicit

Definition at line 506 of file qflatmap_p.h.

◆ QFlatMap() [23/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	Qt::OrderedUniqueRange_t	,
		const key_container_type &	keys,
		mapped_container_type &&	values,
		const Compare &	compare )

inlineexplicit

Definition at line 512 of file qflatmap_p.h.

◆ QFlatMap() [24/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	Qt::OrderedUniqueRange_t	,
		key_container_type &&	keys,
		mapped_container_type &&	values,
		const Compare &	compare )

inlineexplicit

Definition at line 518 of file qflatmap_p.h.

◆ QFlatMap() [25/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	Qt::OrderedUniqueRange_t	,
		std::initializer_list< value_type >	lst,
		const Compare &	compare )

inlineexplicit

Definition at line 524 of file qflatmap_p.h.

◆ QFlatMap() [26/26]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class InputIt, is_compatible_iterator< InputIt > = nullptr>

QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::QFlatMap	(	Qt::OrderedUniqueRange_t	,
		InputIt	first,
		InputIt	last,
		const Compare &	compare )

inlineexplicit

Definition at line 531 of file qflatmap_p.h.

Member Function Documentation

◆ begin() [1/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::begin ( )

inline

Definition at line 730 of file qflatmap_p.h.

◆ begin() [2/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

const_iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::begin ( ) const

inline

Definition at line 731 of file qflatmap_p.h.

◆ capacity()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

size_type QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::capacity ( ) const

inlinenoexcept

Definition at line 539 of file qflatmap_p.h.

◆ cbegin()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

const_iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::cbegin ( ) const

inline

Definition at line 732 of file qflatmap_p.h.

Referenced by QFlatMap< qint64, const QPointingDevice * >::constBegin().

Here is the caller graph for this function:

◆ cend()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

const_iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::cend ( ) const

inline

Definition at line 736 of file qflatmap_p.h.

Referenced by QFlatMap< qint64, const QPointingDevice * >::constEnd().

Here is the caller graph for this function:

◆ clear()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

void QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::clear ( )

inline

Definition at line 552 of file qflatmap_p.h.

◆ constBegin()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

const_iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::constBegin ( ) const

inline

Definition at line 733 of file qflatmap_p.h.

◆ constEnd()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

const_iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::constEnd ( ) const

inline

Definition at line 737 of file qflatmap_p.h.

◆ contains() [1/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

bool QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::contains ( const Key & key ) const

inline

Definition at line 586 of file qflatmap_p.h.

◆ contains() [2/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>

bool QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::contains ( const X & key ) const

inline

Definition at line 592 of file qflatmap_p.h.

◆ count()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

size_type QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::count ( ) const

inlinenoexcept

Definition at line 537 of file qflatmap_p.h.

◆ crbegin()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

std::reverse_iterator< const_iterator > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::crbegin ( ) const

inline

Definition at line 743 of file qflatmap_p.h.

◆ crend()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

std::reverse_iterator< const_iterator > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::crend ( ) const

inline

Definition at line 751 of file qflatmap_p.h.

◆ empty()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

bool QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::empty ( ) const

inlinenoexcept

Definition at line 541 of file qflatmap_p.h.

◆ end() [1/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::end ( )

inline

Definition at line 734 of file qflatmap_p.h.

◆ end() [2/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

const_iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::end ( ) const

inline

Definition at line 735 of file qflatmap_p.h.

◆ erase()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::erase ( iterator it )

inline

Definition at line 569 of file qflatmap_p.h.

◆ extract()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

containers QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::extract ( ) &&

inline

Definition at line 542 of file qflatmap_p.h.

◆ find() [1/4]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find ( const Key & key )

inline

Definition at line 777 of file qflatmap_p.h.

◆ find() [2/4]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

const_iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find ( const Key & key ) const

inline

Definition at line 788 of file qflatmap_p.h.

◆ find() [3/4]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>

iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find ( const X & key )

inline

Definition at line 783 of file qflatmap_p.h.

◆ find() [4/4]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>

const_iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find ( const X & key ) const

inline

Definition at line 800 of file qflatmap_p.h.

◆ insert() [1/8]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

std::pair< iterator, bool > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert	(	const Key &	key,
		const T &	value )

inline

Definition at line 642 of file qflatmap_p.h.

◆ insert() [2/8]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

std::pair< iterator, bool > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert	(	const Key &	key,
		T &&	value )

inline

Definition at line 652 of file qflatmap_p.h.

◆ insert() [3/8]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

void QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert	(	const value_type *	first,
		const value_type *	last )

inline

Definition at line 712 of file qflatmap_p.h.

◆ insert() [4/8]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class InputIt, is_compatible_iterator< InputIt > = nullptr>

void QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert	(	InputIt	first,
		InputIt	last )

inline

Definition at line 705 of file qflatmap_p.h.

◆ insert() [5/8]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

std::pair< iterator, bool > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert	(	Key &&	key,
		const T &	value )

inline

Definition at line 647 of file qflatmap_p.h.

◆ insert() [6/8]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

std::pair< iterator, bool > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert	(	Key &&	key,
		T &&	value )

inline

Definition at line 657 of file qflatmap_p.h.

◆ insert() [7/8]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

void QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert	(	Qt::OrderedUniqueRange_t	,
		const value_type *	first,
		const value_type *	last )

inline

Definition at line 725 of file qflatmap_p.h.

◆ insert() [8/8]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class InputIt, is_compatible_iterator< InputIt > = nullptr>

void QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert	(	Qt::OrderedUniqueRange_t	,
		InputIt	first,
		InputIt	last )

inline

Definition at line 718 of file qflatmap_p.h.

◆ insert_or_assign() [1/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<typename M>

std::pair< iterator, bool > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert_or_assign	(	const Key &	key,
		M &&	obj )

inline

Definition at line 687 of file qflatmap_p.h.

◆ insert_or_assign() [2/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<typename M>

std::pair< iterator, bool > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert_or_assign	(	Key &&	key,
		M &&	obj )

inline

Definition at line 696 of file qflatmap_p.h.

◆ isEmpty()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

bool QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::isEmpty ( ) const

inlinenoexcept

Definition at line 540 of file qflatmap_p.h.

◆ key_comp()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

key_compare QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::key_comp ( ) const

inlinenoexcept

Definition at line 885 of file qflatmap_p.h.

Referenced by QFlatMap< qint64, const QPointingDevice * >::lower_bound(), and QFlatMap< qint64, const QPointingDevice * >::lower_bound().

Here is the caller graph for this function:

◆ keys()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

const key_container_type & QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::keys ( ) const

inlinenoexcept

Definition at line 543 of file qflatmap_p.h.

◆ lower_bound() [1/4]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::lower_bound ( const Key & key )

inline

Definition at line 753 of file qflatmap_p.h.

◆ lower_bound() [2/4]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

const_iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::lower_bound ( const Key & key ) const

inline

Definition at line 766 of file qflatmap_p.h.

◆ lower_bound() [3/4]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>

iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::lower_bound ( const X & key )

inline

Definition at line 760 of file qflatmap_p.h.

◆ lower_bound() [4/4]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>

const_iterator QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::lower_bound ( const X & key ) const

inline

Definition at line 772 of file qflatmap_p.h.

◆ operator[]() [1/3]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

T & QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::operator[] ( const Key & key )

inline

Definition at line 627 of file qflatmap_p.h.

◆ operator[]() [2/3]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

T QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::operator[] ( const Key & key ) const

inline

Definition at line 637 of file qflatmap_p.h.

◆ operator[]() [3/3]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

T & QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::operator[] ( Key && key )

inline

Definition at line 632 of file qflatmap_p.h.

◆ rbegin() [1/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

std::reverse_iterator< iterator > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::rbegin ( )

inline

Definition at line 738 of file qflatmap_p.h.

◆ rbegin() [2/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

std::reverse_iterator< const_iterator > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::rbegin ( ) const

inline

Definition at line 739 of file qflatmap_p.h.

◆ remove() [1/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

bool QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::remove ( const Key & key )

inline

Definition at line 558 of file qflatmap_p.h.

◆ remove() [2/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>

bool QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::remove ( const X & key )

inline

Definition at line 564 of file qflatmap_p.h.

◆ remove_if()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<typename Predicate>

size_type QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::remove_if ( Predicate pred )

inline

Definition at line 812 of file qflatmap_p.h.

◆ rend() [1/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

std::reverse_iterator< iterator > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::rend ( )

inline

Definition at line 744 of file qflatmap_p.h.

◆ rend() [2/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

std::reverse_iterator< const_iterator > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::rend ( ) const

inline

Definition at line 747 of file qflatmap_p.h.

◆ reserve()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

void QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::reserve ( size_type s )

inline

Definition at line 546 of file qflatmap_p.h.

◆ size()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

size_type QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::size ( ) const

inlinenoexcept

Definition at line 538 of file qflatmap_p.h.

◆ take() [1/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

T QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::take ( const Key & key )

inline

Definition at line 575 of file qflatmap_p.h.

◆ take() [2/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>

T QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::take ( const X & key )

inline

Definition at line 581 of file qflatmap_p.h.

◆ try_emplace() [1/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<typename... Args>

std::pair< iterator, bool > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::try_emplace	(	const Key &	key,
		Args &&...	args )

inline

Definition at line 663 of file qflatmap_p.h.

◆ try_emplace() [2/2]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<typename... Args>

std::pair< iterator, bool > QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::try_emplace	(	Key &&	key,
		Args &&...	args )

inline

Definition at line 675 of file qflatmap_p.h.

◆ value() [1/4]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

T QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value ( const Key & key ) const

inline

Definition at line 610 of file qflatmap_p.h.

◆ value() [2/4]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

T QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value	(	const Key &	key,
		const T &	defaultValue ) const

inline

Definition at line 597 of file qflatmap_p.h.

◆ value() [3/4]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>

T QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value ( const X & key ) const

inline

Definition at line 619 of file qflatmap_p.h.

◆ value() [4/4]

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

template<class X, class Y = Compare, is_marked_transparent< Y > = nullptr>

T QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value	(	const X &	key,
		const T &	defaultValue ) const

inline

Definition at line 604 of file qflatmap_p.h.

◆ value_comp()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

value_compare QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value_comp ( ) const

inlinenoexcept

Definition at line 890 of file qflatmap_p.h.

◆ values()

template<class Key, class T, class Compare = std::less<Key>, class KeyContainer = QList<Key>, class MappedContainer = QList<T>>

const mapped_container_type & QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::values ( ) const

inlinenoexcept

Definition at line 544 of file qflatmap_p.h.

The documentation for this class was generated from the following file:

qtbase/src/corelib/tools/qflatmap_p.h (3146a5b8ebfb37e736789ae45aea5f2eae4b0c32)

Classes

Public Types

Public Member Functions

Detailed Description

Member Typedef Documentation

◆ key_compare

◆ key_container_type

◆ key_type

◆ mapped_container_type

◆ mapped_type

◆ size_type

◆ value_compare

◆ value_type

Constructor & Destructor Documentation

◆ QFlatMap() [1/26]

◆ QFlatMap() [2/26]

◆ QFlatMap() [3/26]

◆ QFlatMap() [4/26]

◆ QFlatMap() [5/26]

◆ QFlatMap() [6/26]

◆ QFlatMap() [7/26]

◆ QFlatMap() [8/26]

◆ QFlatMap() [9/26]

◆ QFlatMap() [10/26]

◆ QFlatMap() [11/26]

◆ QFlatMap() [12/26]

◆ QFlatMap() [13/26]

◆ QFlatMap() [14/26]

◆ QFlatMap() [15/26]

◆ QFlatMap() [16/26]

◆ QFlatMap() [17/26]

◆ QFlatMap() [18/26]

◆ QFlatMap() [19/26]

◆ QFlatMap() [20/26]

◆ QFlatMap() [21/26]

◆ QFlatMap() [22/26]

◆ QFlatMap() [23/26]

◆ QFlatMap() [24/26]

◆ QFlatMap() [25/26]

◆ QFlatMap() [26/26]

Member Function Documentation

◆ begin() [1/2]

◆ begin() [2/2]

◆ capacity()

◆ cbegin()

◆ cend()

◆ clear()

◆ constBegin()

◆ constEnd()

◆ contains() [1/2]

◆ contains() [2/2]

◆ count()

◆ crbegin()

◆ crend()

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ erase()

◆ extract()

◆ find() [1/4]

◆ find() [2/4]

◆ find() [3/4]

◆ find() [4/4]

◆ insert() [1/8]

◆ insert() [2/8]

◆ insert() [3/8]

◆ insert() [4/8]

◆ insert() [5/8]

◆ insert() [6/8]

◆ insert() [7/8]

◆ insert() [8/8]

◆ insert_or_assign() [1/2]

◆ insert_or_assign() [2/2]

◆ isEmpty()

◆ key_comp()

◆ keys()

◆ lower_bound() [1/4]

◆ lower_bound() [2/4]

◆ lower_bound() [3/4]

◆ lower_bound() [4/4]