QMinimalFlatSet< T, Container, Compare > Class Template Reference

#include <qminimalflatset_p.h>

Inheritance diagram for QMinimalFlatSet< T, Container, Compare >:

Collaboration diagram for QMinimalFlatSet< T, Container, Compare >:

Public Types
using	const_iterator = typename Container::const_iterator
using	iterator = const_iterator
using	const_reverse_iterator = typename Container::const_reverse_iterator
using	reverse_iterator = const_reverse_iterator
using	value_type = T
using	key_compare = Compare
using	value_compare = Compare
using	const_iterator = typename Container::const_iterator
using	iterator = const_iterator
using	const_reverse_iterator = typename Container::const_reverse_iterator
using	reverse_iterator = const_reverse_iterator
using	value_type = T

Public Member Functions
	QMinimalFlatSet ()=default
	QMinimalFlatSet (const Compare &cmp)
key_compare	key_comp () const
value_compare	value_comp () const
iterator	begin () const
iterator	end () const
iterator	cbegin () const
iterator	cend () const
reverse_iterator	rbegin () const
reverse_iterator	rend () const
reverse_iterator	crbegin () const
reverse_iterator	crend () const
void	clear ()
auto	size () const
auto	count () const
bool	isEmpty () const
std::pair< iterator, bool >	insert (value_type &&v)
std::pair< iterator, bool >	insert (const value_type &v)
void	erase (const value_type &v)
void	remove (const value_type &v)
bool	contains (const value_type &v) const
const Container &	values () const &
Container	values () &&
iterator	begin () const
iterator	end () const
iterator	cbegin () const
iterator	cend () const
reverse_iterator	rbegin () const
reverse_iterator	rend () const
reverse_iterator	crbegin () const
reverse_iterator	crend () const
void	clear ()
auto	size () const
auto	count () const
bool	isEmpty () const
std::pair< iterator, bool >	insert (value_type &&v)
std::pair< iterator, bool >	insert (const value_type &v)
void	erase (const value_type &v)
void	remove (const value_type &v)
bool	contains (const value_type &v) const
const Container &	values () const &
Container	values () &&

Detailed Description

template<typename T, typename Container = QList<T>, typename Compare = std::less<T>>
class QMinimalFlatSet< T, Container, Compare >

Definition at line 48 of file qminimalflatset_p.h.

Member Typedef Documentation

const_iterator [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

using QMinimalFlatSet< T, Container, Compare >::const_iterator = typename Container::const_iterator

Definition at line 57 of file qminimalflatset_p.h.

const_iterator [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

using QMinimalFlatSet< T, Container, Compare >::const_iterator = typename Container::const_iterator

Definition at line 60 of file qminimalflatset_p.h.

const_reverse_iterator [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

using QMinimalFlatSet< T, Container, Compare >::const_reverse_iterator = typename Container::const_reverse_iterator

Definition at line 59 of file qminimalflatset_p.h.

const_reverse_iterator [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

using QMinimalFlatSet< T, Container, Compare >::const_reverse_iterator = typename Container::const_reverse_iterator

Definition at line 62 of file qminimalflatset_p.h.

iterator [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

using QMinimalFlatSet< T, Container, Compare >::iterator = const_iterator

Definition at line 58 of file qminimalflatset_p.h.

iterator [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

using QMinimalFlatSet< T, Container, Compare >::iterator = const_iterator

Definition at line 61 of file qminimalflatset_p.h.

key_compare

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

using QMinimalFlatSet< T, Container, Compare >::key_compare = Compare

Definition at line 62 of file qminimalflatset_p.h.

reverse_iterator [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

using QMinimalFlatSet< T, Container, Compare >::reverse_iterator = const_reverse_iterator

Definition at line 60 of file qminimalflatset_p.h.

reverse_iterator [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

using QMinimalFlatSet< T, Container, Compare >::reverse_iterator = const_reverse_iterator

Definition at line 63 of file qminimalflatset_p.h.

value_compare

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

using QMinimalFlatSet< T, Container, Compare >::value_compare = Compare

Definition at line 63 of file qminimalflatset_p.h.

value_type [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

using QMinimalFlatSet< T, Container, Compare >::value_type = T

Definition at line 61 of file qminimalflatset_p.h.

value_type [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

using QMinimalFlatSet< T, Container, Compare >::value_type = T

Definition at line 64 of file qminimalflatset_p.h.

Constructor & Destructor Documentation

QMinimalFlatSet() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

QMinimalFlatSet< T, Container, Compare >::QMinimalFlatSet ( )

default

QMinimalFlatSet() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

QMinimalFlatSet< T, Container, Compare >::QMinimalFlatSet ( const Compare & cmp )

inlineexplicit

Definition at line 54 of file qminimalflatset_p.h.

Member Function Documentation

begin() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

iterator QMinimalFlatSet< T, Container, Compare >::begin ( ) const

inline

Definition at line 68 of file qminimalflatset_p.h.

Referenced by QMinimalFlatSet< T, Container, Compare >::cbegin().

Here is the caller graph for this function:

begin() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

iterator QMinimalFlatSet< T, Container, Compare >::begin ( ) const

inline

Definition at line 66 of file qminimalflatset_p.h.

cbegin() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

iterator QMinimalFlatSet< T, Container, Compare >::cbegin ( ) const

inline

Definition at line 70 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::begin().

Here is the call graph for this function:

cbegin() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

iterator QMinimalFlatSet< T, Container, Compare >::cbegin ( ) const

inline

Definition at line 68 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::begin().

Here is the call graph for this function:

cend() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

iterator QMinimalFlatSet< T, Container, Compare >::cend ( ) const

inline

Definition at line 71 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::cend().

Referenced by QMinimalFlatSet< T, Container, Compare >::cend().

Here is the call graph for this function:

Here is the caller graph for this function:

cend() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

iterator QMinimalFlatSet< T, Container, Compare >::cend ( ) const

inline

Definition at line 69 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::cend().

Referenced by QMinimalFlatSet< T, Container, Compare >::cend().

Here is the call graph for this function:

Here is the caller graph for this function:

clear() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

void QMinimalFlatSet< T, Container, Compare >::clear ( )

inline

Definition at line 78 of file qminimalflatset_p.h.

References QMINIMAL_FLAT_SET_PRINT_AT_END.

Referenced by QQuickTableViewPrivate::loadInitialTable().

Here is the caller graph for this function:

clear() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

void QMinimalFlatSet< T, Container, Compare >::clear ( )

inline

Definition at line 76 of file qminimalflatset_p.h.

References QMINIMAL_FLAT_SET_PRINT_AT_END.

contains() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

bool QMinimalFlatSet< T, Container, Compare >::contains ( const value_type & v ) const

inline

Definition at line 115 of file qminimalflatset_p.h.

Referenced by QQuickTableViewPrivate::checkForVisibilityChanges(), QQuickTableViewPrivate::getEffectiveColumnWidth(), QQuickTableViewPrivate::getEffectiveColumnX(), QQuickTableViewPrivate::getEffectiveRowHeight(), QQuickTableViewPrivate::getEffectiveRowY(), QQuickTableViewPrivate::scrollToColumn(), and QQuickTableViewPrivate::scrollToRow().

Here is the caller graph for this function:

contains() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

bool QMinimalFlatSet< T, Container, Compare >::contains ( const value_type & v ) const

inline

Definition at line 113 of file qminimalflatset_p.h.

count() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

auto QMinimalFlatSet< T, Container, Compare >::count ( ) const

inline

Definition at line 83 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::size().

Referenced by QQuickTableViewPrivate::canUnloadTableEdge(), QQuickTableViewPrivate::drainReusePoolAfterLoadRequest(), QQuickTableViewPrivate::layoutHorizontalEdge(), QQuickTableViewPrivate::layoutVerticalEdge(), QQuickTableViewPrivate::updateAverageColumnWidth(), and QQuickTableViewPrivate::updateAverageRowHeight().

Here is the call graph for this function:

Here is the caller graph for this function:

count() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

auto QMinimalFlatSet< T, Container, Compare >::count ( ) const

inline

Definition at line 81 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::size().

Here is the call graph for this function:

crbegin() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

reverse_iterator QMinimalFlatSet< T, Container, Compare >::crbegin ( ) const

inline

Definition at line 75 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::rbegin().

Here is the call graph for this function:

crbegin() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

reverse_iterator QMinimalFlatSet< T, Container, Compare >::crbegin ( ) const

inline

Definition at line 73 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::rbegin().

Here is the call graph for this function:

crend() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

reverse_iterator QMinimalFlatSet< T, Container, Compare >::crend ( ) const

inline

Definition at line 76 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::rend().

Here is the call graph for this function:

crend() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

reverse_iterator QMinimalFlatSet< T, Container, Compare >::crend ( ) const

inline

Definition at line 74 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::rend().

Here is the call graph for this function:

end() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

iterator QMinimalFlatSet< T, Container, Compare >::end ( ) const

inline

Definition at line 69 of file qminimalflatset_p.h.

end() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

iterator QMinimalFlatSet< T, Container, Compare >::end ( ) const

inline

Definition at line 67 of file qminimalflatset_p.h.

erase() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

void QMinimalFlatSet< T, Container, Compare >::erase ( const value_type & v )

inline

Definition at line 106 of file qminimalflatset_p.h.

References QMINIMAL_FLAT_SET_PRINT_AT_END.

Referenced by QMinimalFlatSet< T, Container, Compare >::remove().

Here is the caller graph for this function:

erase() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

void QMinimalFlatSet< T, Container, Compare >::erase ( const value_type & v )

inline

Definition at line 104 of file qminimalflatset_p.h.

References QMINIMAL_FLAT_SET_PRINT_AT_END.

insert() [1/4]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

std::pair< iterator, bool > QMinimalFlatSet< T, Container, Compare >::insert ( const value_type & v )

inline

Definition at line 96 of file qminimalflatset_p.h.

References QMINIMAL_FLAT_SET_PRINT_AT_END.

insert() [2/4]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

std::pair< iterator, bool > QMinimalFlatSet< T, Container, Compare >::insert ( const value_type & v )

inline

Definition at line 94 of file qminimalflatset_p.h.

References QMINIMAL_FLAT_SET_PRINT_AT_END.

insert() [3/4]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

std::pair< iterator, bool > QMinimalFlatSet< T, Container, Compare >::insert ( value_type && v )

inline

Definition at line 86 of file qminimalflatset_p.h.

References QMINIMAL_FLAT_SET_PRINT_AT_END.

Referenced by QQuickTableViewPrivate::syncLoadedTableFromLoadRequest().

Here is the caller graph for this function:

insert() [4/4]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

std::pair< iterator, bool > QMinimalFlatSet< T, Container, Compare >::insert ( value_type && v )

inline

Definition at line 84 of file qminimalflatset_p.h.

References QMINIMAL_FLAT_SET_PRINT_AT_END.

isEmpty() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

bool QMinimalFlatSet< T, Container, Compare >::isEmpty ( ) const

inline

Definition at line 84 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::size().

Here is the call graph for this function:

isEmpty() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

bool QMinimalFlatSet< T, Container, Compare >::isEmpty ( ) const

inline

Definition at line 82 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::size().

Here is the call graph for this function:

key_comp()

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

key_compare QMinimalFlatSet< T, Container, Compare >::key_comp ( ) const

inline

Definition at line 65 of file qminimalflatset_p.h.

Referenced by QMinimalFlatSet< T, Container, Compare >::value_comp().

Here is the caller graph for this function:

rbegin() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

reverse_iterator QMinimalFlatSet< T, Container, Compare >::rbegin ( ) const

inline

Definition at line 73 of file qminimalflatset_p.h.

Referenced by QMinimalFlatSet< T, Container, Compare >::crbegin().

Here is the caller graph for this function:

rbegin() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

reverse_iterator QMinimalFlatSet< T, Container, Compare >::rbegin ( ) const

inline

Definition at line 71 of file qminimalflatset_p.h.

remove() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

void QMinimalFlatSet< T, Container, Compare >::remove ( const value_type & v )

inline

Definition at line 113 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::erase().

Referenced by QQuickTableViewPrivate::unloadEdge().

Here is the call graph for this function:

Here is the caller graph for this function:

remove() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

void QMinimalFlatSet< T, Container, Compare >::remove ( const value_type & v )

inline

Definition at line 111 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::erase().

Here is the call graph for this function:

rend() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

reverse_iterator QMinimalFlatSet< T, Container, Compare >::rend ( ) const

inline

Definition at line 74 of file qminimalflatset_p.h.

Referenced by QMinimalFlatSet< T, Container, Compare >::crend().

Here is the caller graph for this function:

rend() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

reverse_iterator QMinimalFlatSet< T, Container, Compare >::rend ( ) const

inline

Definition at line 72 of file qminimalflatset_p.h.

size() [1/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

auto QMinimalFlatSet< T, Container, Compare >::size ( ) const

inline

Definition at line 82 of file qminimalflatset_p.h.

Referenced by QMinimalFlatSet< T, Container, Compare >::count(), and QMinimalFlatSet< T, Container, Compare >::isEmpty().

Here is the caller graph for this function:

size() [2/2]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

auto QMinimalFlatSet< T, Container, Compare >::size ( ) const

inline

Definition at line 80 of file qminimalflatset_p.h.

value_comp()

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

value_compare QMinimalFlatSet< T, Container, Compare >::value_comp ( ) const

inline

Definition at line 66 of file qminimalflatset_p.h.

References QMinimalFlatSet< T, Container, Compare >::key_comp().

Here is the call graph for this function:

values() [1/4]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

Container QMinimalFlatSet< T, Container, Compare >::values ( ) &&

inline

Definition at line 121 of file qminimalflatset_p.h.

values() [2/4]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

Container QMinimalFlatSet< T, Container, Compare >::values ( ) &&

inline

Definition at line 119 of file qminimalflatset_p.h.

values() [3/4]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

const Container & QMinimalFlatSet< T, Container, Compare >::values ( ) const &

inline

Definition at line 120 of file qminimalflatset_p.h.

Referenced by QQuickTableViewPrivate::layoutHorizontalEdge(), QQuickTableViewPrivate::layoutVerticalEdge(), and QQuickTableViewPrivate::loadEdge().

Here is the caller graph for this function:

values() [4/4]

template<typename T , typename Container = QList<T>, typename Compare = std::less<T>>

const Container & QMinimalFlatSet< T, Container, Compare >::values ( ) const &

inline

Definition at line 118 of file qminimalflatset_p.h.

---

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

• qtbase/src/corelib/tools/qminimalflatset_p.h (7a8e7213e4fe3a83aff3146c0101bcfb2f925ea2)
• qtdeclarative/src/quick/util/qminimalflatset_p.h (9df2d921628bca1def8993c75cddb5559fede60a)