KCalCore Library
sortablelist.h
Go to the documentation of this file.
int count() const
void removeAt(int i)
iterator erase(iterator pos)
int findLE(const T &value, int start=0) const
Search the list for the last item <= value.
Definition: sortablelist.h:216
T value(int i) const
int count(const T &value) const
int removeSorted(const T &value, int start=0)
Remove value value from the list.
Definition: sortablelist.h:296
SortableList(const QList< T > &list)
Constructs a sortable list by copying another one.
Definition: sortablelist.h:99
iterator end()
int findGE(const T &value, int start=0) const
Search the list for the first item >= value.
Definition: sortablelist.h:250
int findSorted(const T &value, int start=0) const
Search the list for the item equal to value.
Definition: sortablelist.h:199
int insertSorted(const T &value)
Insert a value in the list, in correct sorted order.
Definition: sortablelist.h:286
void insert(int i, const T &value)
int findGT(const T &value, int start=0) const
Search the list for the first item > value.
Definition: sortablelist.h:268
bool containsSorted(const T &value) const
Return whether the list contains value value.
Definition: sortablelist.h:110
int findLT(const T &value, int start=0) const
Search the list for the last item < value.
Definition: sortablelist.h:233
iterator begin()
This file is part of the KDE documentation.
Documentation copyright © 1996-2020 The KDE developers.
Generated on Mon Jun 22 2020 13:36:53 by doxygen 1.8.7 written by Dimitri van Heesch, © 1997-2006
Documentation copyright © 1996-2020 The KDE developers.
Generated on Mon Jun 22 2020 13:36:53 by doxygen 1.8.7 written by Dimitri van Heesch, © 1997-2006
KDE's Doxygen guidelines are available online.