KDbUtils::AutodeletedList
KDbUtils::AutodeletedList< T > Class Template Reference
#include <KDbUtils.h>
Inheritance diagram for KDbUtils::AutodeletedList< T >:

Public Member Functions | |
AutodeletedList (bool autoDelete=true) | |
AutodeletedList (const AutodeletedList &other) | |
bool | autoDelete () const |
void | clear () |
QList< T >::iterator | erase (typename QList< T >::iterator afirst, typename QList< T >::iterator alast) |
QList< T >::iterator | erase (typename QList< T >::iterator pos) |
void | insert (int i, const T &value) |
void | pop_back () |
void | pop_front () |
int | removeAll (const T &value) |
void | removeAt (int i) |
void | removeFirst () |
void | removeLast () |
void | replace (int i, const T &value) |
void | setAutoDelete (bool set) |
![]() | |
QList (const QList< T > &other) | |
QList (InputIterator first, InputIterator last) | |
QList (QList< T > &&other) | |
QList (std::initializer_list< T > args) | |
void | append (const QList< T > &value) |
void | append (const T &value) |
const T & | at (int i) const const |
T & | back () |
const T & | back () const const |
QList::iterator | begin () |
QList::const_iterator | begin () const const |
QList::const_iterator | cbegin () const const |
QList::const_iterator | cend () const const |
void | clear () |
QList::const_iterator | constBegin () const const |
QList::const_iterator | constEnd () const const |
const T & | constFirst () const const |
const T & | constLast () const const |
bool | contains (const T &value) const const |
int | count () const const |
int | count (const T &value) const const |
QList::const_reverse_iterator | crbegin () const const |
QList::const_reverse_iterator | crend () const const |
bool | empty () const const |
QList::iterator | end () |
QList::const_iterator | end () const const |
bool | endsWith (const T &value) const const |
QList::iterator | erase (QList::iterator begin, QList::iterator end) |
QList::iterator | erase (QList::iterator pos) |
T & | first () |
const T & | first () const const |
T & | front () |
const T & | front () const const |
int | indexOf (const T &value, int from) const const |
void | insert (int i, const T &value) |
QList::iterator | insert (QList::iterator before, const T &value) |
bool | isEmpty () const const |
T & | last () |
const T & | last () const const |
int | lastIndexOf (const T &value, int from) const const |
int | length () const const |
QList< T > | mid (int pos, int length) const const |
void | move (int from, int to) |
bool | operator!= (const QList< T > &other) const const |
QList< T > | operator+ (const QList< T > &other) const const |
QList< T > & | operator+= (const QList< T > &other) |
QList< T > & | operator+= (const T &value) |
bool | operator< (const QList< T > &lhs, const QList< T > &rhs) |
QList< T > & | operator<< (const QList< T > &other) |
QList< T > & | operator<< (const T &value) |
QDataStream & | operator<< (QDataStream &out, const QList< T > &list) |
bool | operator<= (const QList< T > &lhs, const QList< T > &rhs) |
QList< T > & | operator= (const QList< T > &other) |
QList< T > & | operator= (QList< T > &&other) |
bool | operator== (const QList< T > &other) const const |
bool | operator> (const QList< T > &lhs, const QList< T > &rhs) |
bool | operator>= (const QList< T > &lhs, const QList< T > &rhs) |
QDataStream & | operator>> (QDataStream &in, QList< T > &list) |
T & | operator[] (int i) |
const T & | operator[] (int i) const const |
void | pop_back () |
void | pop_front () |
void | prepend (const T &value) |
void | push_back (const T &value) |
void | push_front (const T &value) |
uint | qHash (const QList< T > &key, uint seed) |
QList::reverse_iterator | rbegin () |
QList::const_reverse_iterator | rbegin () const const |
int | removeAll (const T &value) |
void | removeAt (int i) |
void | removeFirst () |
void | removeLast () |
bool | removeOne (const T &value) |
QList::reverse_iterator | rend () |
QList::const_reverse_iterator | rend () const const |
void | replace (int i, const T &value) |
void | reserve (int alloc) |
int | size () const const |
bool | startsWith (const T &value) const const |
void | swap (int i, int j) |
void | swap (QList< T > &other) |
void | swapItemsAt (int i, int j) |
T | takeAt (int i) |
T | takeFirst () |
T | takeLast () |
QSet< T > | toSet () const const |
std::list< T > | toStdList () const const |
QVector< T > | toVector () const const |
T | value (int i) const const |
T | value (int i, const T &defaultValue) const const |
Additional Inherited Members | |
![]() | |
QList< T > | fromSet (const QSet< T > &set) |
QList< T > | fromStdList (const std::list< T > &list) |
QList< T > | fromVector (const QVector< T > &vector) |
![]() | |
typedef | const_pointer |
typedef | const_reference |
typedef | const_reverse_iterator |
typedef | ConstIterator |
typedef | difference_type |
typedef | Iterator |
typedef | pointer |
typedef | reference |
typedef | reverse_iterator |
typedef | size_type |
typedef | value_type |
Detailed Description
template<typename T>
class KDbUtils::AutodeletedList< T >
Autodeleting list.
Definition at line 244 of file KDbUtils.h.
Constructor & Destructor Documentation
◆ AutodeletedList() [1/2]
template<typename T >
|
inline |
Creates autodeleting list as a copy of other.
Auto-deletion is not enabled as it would cause double deletion for items. If you enable auto-deletion on here, make sure you disable it in the other list.
Definition at line 250 of file KDbUtils.h.
◆ AutodeletedList() [2/2]
template<typename T >
|
inline |
Creates empty autodeleting list.
Auto-deletion is enabled by default.
Definition at line 255 of file KDbUtils.h.
The documentation for this class was generated from the following file:
This file is part of the KDE documentation.
Documentation copyright © 1996-2023 The KDE developers.
Generated on Thu Jun 8 2023 04:09:19 by doxygen 1.8.17 written by Dimitri van Heesch, © 1997-2006
Documentation copyright © 1996-2023 The KDE developers.
Generated on Thu Jun 8 2023 04:09:19 by doxygen 1.8.17 written by Dimitri van Heesch, © 1997-2006
KDE's Doxygen guidelines are available online.