QFlatMap< Key, T, Compare, KeyContainer, MappedContainer > Class Template Reference

#include <qflatmap_p.h>

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

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

Classes
class	const_iterator
struct	containers
class	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 108 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 123 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 120 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 116 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 121 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 117 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 122 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 118 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 119 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 419 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 425 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 431 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 437 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 443 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 449 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 456 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 462 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 468 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 474 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 480 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 486 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 491 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 497 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 504 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 511 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 518 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 525 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 531 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 539 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 545 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 551 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 557 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 563 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 570 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 769 of file qflatmap_p.h.

Referenced by QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::cbegin(), QQuickDeliveryAgentPrivate::deliverHoverEvent(), QGtk3Storage::palette(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::remove_if(), QQmlJSCompilePass::State::renameSourceRegisterIndex(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::rend(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::rend(), QQmlJSBasicBlocks::run(), QQmlJSStorageGeneralizer::run(), and QQmlJSCompilePass::State::setHasSideEffects().

Here is the caller graph for this function:

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 770 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 578 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 771 of file qflatmap_p.h.

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

Referenced by QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::constBegin().

Here is the call graph for this function:

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 775 of file qflatmap_p.h.

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

Referenced by QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::constEnd().

Here is the call graph for this function:

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 591 of file qflatmap_p.h.

Referenced by QQuickDeliveryAgentPrivate::clearHover().

Here is the caller graph for this function:

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 772 of file qflatmap_p.h.

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

Referenced by QGtk3Json::save().

Here is the call graph for this function:

Here is the caller graph for this function:

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 776 of file qflatmap_p.h.

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

Referenced by QQmlJSCompilePass::nextStateFromAnnotations(), and QGtk3Json::save().

Here is the call graph for this function:

Here is the caller graph for this function:

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 625 of file qflatmap_p.h.

References QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::end(), and QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find().

Referenced by QQuickDeliveryAgentPrivate::deliverHoverEventToItem(), QGtk3Storage::palette(), QQmlJSCompilePass::State::readRegister(), QQmlJSCompilePass::State::readsRegister(), and QGtk3Json::save().

Here is the call graph for this function:

Here is the caller graph for this function:

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 631 of file qflatmap_p.h.

References QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::end(), and QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find().

Here is the call graph for this function:

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 576 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 782 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 790 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 580 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 773 of file qflatmap_p.h.

Referenced by QQmlJSCompilePass::State::accumulatorIn(), QQmlJSCompilePass::State::canMoveReadRegister(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::cend(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::contains(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::contains(), QQuickDeliveryAgentPrivate::deliverHoverEvent(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find(), QQmlJSShadowCheck::generate_GetLookup(), QQmlJSShadowCheck::generate_LoadProperty(), QAndroidPlatformIntegration::handleScreenChanged(), QAndroidPlatformIntegration::handleScreenRemoved(), QQmlJSCompilePass::State::isRegisterAffectedBySideEffects(), QGtk3Storage::palette(), QPointingDevicePrivate::queryPointById(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::rbegin(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::rbegin(), QQmlJSCodeGenerator::registerType(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::remove_if(), QQmlJSStorageGeneralizer::run(), QQmlJSCompilePass::State::setHasSideEffects(), QQmlJSCodeGenerator::startInstruction(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::try_emplace(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::try_emplace(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value(), and QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value().

Here is the caller graph for this function:

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 774 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 608 of file qflatmap_p.h.

References it.

Referenced by QQuickDeliveryAgentPrivate::deliverHoverEvent(), and QAndroidPlatformIntegration::handleScreenRemoved().

Here is the caller graph for this function:

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 581 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 816 of file qflatmap_p.h.

Referenced by QQmlJSCompilePass::State::accumulatorIn(), QQmlJSCompilePass::State::canMoveReadRegister(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::contains(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::contains(), QQmlJSShadowCheck::generate_GetLookup(), QQmlJSShadowCheck::generate_LoadProperty(), QAndroidPlatformIntegration::handleScreenChanged(), QAndroidPlatformIntegration::handleScreenRemoved(), QQmlJSCompilePass::State::isRegisterAffectedBySideEffects(), QQmlJSCompilePass::nextStateFromAnnotations(), QPointingDevicePrivate::queryPointById(), QQmlJSCodeGenerator::registerType(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::remove(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::remove(), QQmlJSCodeGenerator::startInstruction(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::take(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::take(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value(), and QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::value().

Here is the caller graph for this function:

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 827 of file qflatmap_p.h.

References QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::end(), it, and QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::lower_bound().

Here is the call graph for this function:

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 822 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 839 of file qflatmap_p.h.

References QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::end(), it, and QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::lower_bound().

Here is the call graph for this function:

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 678 of file qflatmap_p.h.

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

Referenced by QAndroidPlatformIntegration::handleScreenAdded(), QGtk3Json::load(), and QGtk3Json::save().

Here is the call graph for this function:

Here is the caller graph for this function:

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 688 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 750 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 743 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 683 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 693 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 763 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 756 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 724 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 733 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 579 of file qflatmap_p.h.

Referenced by QQuickDeliveryAgentPrivate::clearHover(), QQuickDeliveryAgentPrivate::deliverHoverEvent(), and QPointingDevicePrivate::firstPointExclusiveGrabber().

Here is the caller graph for this function:

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 924 of file qflatmap_p.h.

Referenced by QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::lower_bound(), and QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::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 582 of file qflatmap_p.h.

Referenced by QtPrivate::QCalendarRegistry::availableCalendars().

Here is the caller graph for this function:

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 792 of file qflatmap_p.h.

Referenced by QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::try_emplace(), and QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::try_emplace().

Here is the caller graph for this function:

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 805 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 799 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 811 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 662 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 672 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 667 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 777 of file qflatmap_p.h.

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

Referenced by QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::crbegin().

Here is the call graph for this function:

Here is the caller graph for this function:

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 778 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 597 of file qflatmap_p.h.

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

Referenced by QPointingDevicePrivate::removePointById().

Here is the call graph for this function:

Here is the caller graph for this function:

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 603 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 851 of file qflatmap_p.h.

References QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::begin(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::end(), and it.

Here is the call graph for this function:

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 783 of file qflatmap_p.h.

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

Referenced by QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::crend().

Here is the call graph for this function:

Here is the caller graph for this function:

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 786 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 585 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 577 of file qflatmap_p.h.

Referenced by QtPrivate::QCalendarRegistry::backendNames(), and QQmlJSCompilePass::State::renameSourceRegisterIndex().

Here is the caller graph for this function:

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 614 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 620 of file qflatmap_p.h.

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

Here is the call graph for this function:

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 700 of file qflatmap_p.h.

References args, QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::end(), it, and QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::lower_bound().

Referenced by QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert_or_assign(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::insert_or_assign(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::operator[](), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::operator[](), and QPointingDevicePrivate::pointById().

Here is the call graph for this function:

Here is the caller graph for this function:

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 712 of file qflatmap_p.h.

References args, QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::end(), it, and QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::lower_bound().

Here is the call graph for this function:

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 649 of file qflatmap_p.h.

References QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::end(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find(), and it.

Here is the call graph for this function:

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 636 of file qflatmap_p.h.

References QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::end(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find(), and it.

Referenced by QQmlXmlListModel::data(), QtPrivate::QCalendarRegistry::fromName(), QGtk3Storage::palette(), and QGtk3Json::save().

Here is the call graph for this function:

Here is the caller graph for this function:

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 656 of file qflatmap_p.h.

References QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::end(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find(), and it.

Here is the call graph for this function:

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 643 of file qflatmap_p.h.

References QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::end(), QFlatMap< Key, T, Compare, KeyContainer, MappedContainer >::find(), and it.

Here is the call graph for this function:

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 929 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 583 of file qflatmap_p.h.

Referenced by QApplicationPrivate::findClosestTouchPointTarget(), QPointingDevicePrivate::firstActiveTarget(), QPointingDevicePrivate::firstActiveWindow(), QPointingDevicePrivate::firstPointExclusiveGrabber(), QGuiApplicationPrivate::processTouchEvent(), QPointingDevicePrivate::removeExclusiveGrabber(), QPointingDevicePrivate::sendTouchCancelEvent(), and QApplicationPrivate::translateTouchCancel().

Here is the caller graph for this function:

---

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

• qtbase/src/corelib/tools/qflatmap_p.h