Needed for compatibility with C++ standard algorithms which expect ordered sets. More...
Inheritance diagram for swift::misc::QOrderedSet< T >:
Public Types | |
| using | value_type = T |
| Type of values stored in the set. | |
Public Member Functions | |
| QMap< T, T >::iterator | insert (const T &value) |
| Insert a new value into the set. | |
| QOrderedSet ()=default | |
| Default constructor. | |
| QOrderedSet (std::initializer_list< T > il) | |
| Initializer list constructor. | |
| QOrderedSet (const QList< T > &list) | |
| Constructor from QList. | |
 Public Member Functions inherited from QMap< T, T > | |
| QDataStream & | operator<< (QDataStream &out, const QMap< Key, T > &map) |
| QDataStream & | operator>> (QDataStream &in, QMap< Key, T > &map) |
| QMap (QMap< Key, T > &&other) | |
| QMap (const QMap< Key, T > &other) | |
| QMap (const std::map< Key, T > &other) | |
| QMap (std::initializer_list< std::pair< Key, T >> list) | |
| QMap (std::map< Key, T > &&other) | |
| QMap< Key, T > & | operator= (QMap< Key, T > &&other) |
| QMap< Key, T > & | operator= (const QMap< Key, T > &other) |
| QMap< Key, T >::iterator | begin () |
| QMap< Key, T >::const_iterator | begin () const const |
| QMap< Key, T >::iterator | end () |
| QMap< Key, T >::const_iterator | end () const const |
| QMap< Key, T >::iterator | erase (QMap< Key, T >::const_iterator first, QMap< Key, T >::const_iterator last) |
| QMap< Key, T >::iterator | erase (QMap< Key, T >::const_iterator pos) |
| QMap< Key, T >::iterator | find (const Key &key) |
| QMap< Key, T >::const_iterator | find (const Key &key) const const |
| QMap< Key, T >::iterator | insert (QMap< Key, T >::const_iterator pos, const Key &key, const T &value) |
| QMap< Key, T >::iterator | insert (const Key &key, const T &value) |
| void | insert (QMap< Key, T > &&map) |
| void | insert (const QMap< Key, T > &map) |
| QMap< Key, T >::iterator | lowerBound (const Key &key) |
| QMap< Key, T >::const_iterator | lowerBound (const Key &key) const const |
| QMap< Key, T >::iterator | upperBound (const Key &key) |
| QMap< Key, T >::const_iterator | upperBound (const Key &key) const const |
| QMap< Key, T >::key_value_iterator | keyValueBegin () |
| QMap< Key, T >::const_key_value_iterator | keyValueBegin () const const |
| QMap< Key, T >::key_value_iterator | keyValueEnd () |
| QMap< Key, T >::const_key_value_iterator | keyValueEnd () const const |
| QMap< Key, T >::size_type | remove (const Key &key) |
| QMap< Key, T >::size_type | removeIf (Predicate pred) |
| T & | first () |
| const T & | first () const const |
| T & | last () |
| const T & | last () const const |
| T & | operator[] (const Key &key) |
| T | operator[] (const Key &key) const const |
| T | take (const Key &key) |
| auto | asKeyValueRange () & |
| auto | asKeyValueRange () && |
| auto | asKeyValueRange () const &const |
| auto | asKeyValueRange () const &&const |
| bool | operator!= (const QMap< Key, T > &lhs, const QMap< Key, T > &rhs) |
| bool | operator== (const QMap< Key, T > &lhs, const QMap< Key, T > &rhs) |
| qsizetype | erase_if (QMap< Key, T > &map, Predicate pred) |
| size_t | qHash (const QMap< Key, T > &key, size_t seed) |
| std::map< Key, T > | toStdMap () && |
| std::map< Key, T > | toStdMap () const &const |
| std::pair< QMap< Key, T >::iterator, QMap< Key, T >::iterator > | equal_range (const Key &key) |
| std::pair< QMap< Key, T >::const_iterator, QMap< Key, T >::const_iterator > | equal_range (const Key &key) const const |
| void | clear () |
| void | swap (QMap< Key, T > &other) |
| Key | key (const T &value, const Key &defaultKey) const const |
| QList< Key > | keys () const const |
| QList< Key > | keys (const T &value) const const |
| QList< T > | values () const const |
| QMap< Key, T >::const_iterator | cbegin () const const |
| QMap< Key, T >::const_iterator | cend () const const |
| QMap< Key, T >::const_iterator | constBegin () const const |
| QMap< Key, T >::const_iterator | constEnd () const const |
| QMap< Key, T >::const_iterator | constFind (const Key &key) const const |
| QMap< Key, T >::const_key_value_iterator | constKeyValueBegin () const const |
| QMap< Key, T >::const_key_value_iterator | constKeyValueEnd () const const |
| QMap< Key, T >::key_iterator | keyBegin () const const |
| QMap< Key, T >::key_iterator | keyEnd () const const |
| QMap< Key, T >::size_type | count () const const |
| QMap< Key, T >::size_type | count (const Key &key) const const |
| QMap< Key, T >::size_type | size () const const |
| T | value (const Key &key, const T &defaultValue) const const |
| bool | contains (const Key &key) const const |
| bool | empty () const const |
| bool | isEmpty () const const |
| const Key & | firstKey () const const |
| const Key & | lastKey () const const |
Additional Inherited Members | |
| Public Attributes inherited from QMap< T, T > | |
| typedef | ConstIterator |
| typedef | Iterator |
| typedef | const_key_value_iterator |
| typedef | key_value_iterator |
| typedef | difference_type |
| typedef | key_type |
| typedef | mapped_type |
| typedef | size_type |
Detailed Description
template<class T>
class swift::misc::QOrderedSet< T >
Needed for compatibility with C++ standard algorithms which expect ordered sets.
Definition at line 73 of file collection.h.
The documentation for this class was generated from the following file:
- src/misc/collection.h
