KCal Library
sortablelist.h
Go to the documentation of this file.
int findLE(const T &value, int start=0) const
Search the list for the last item <= value.
Definition: sortablelist.h:212
int findLT(const T &value, int start=0) const
Search the list for the last item < value.
Definition: sortablelist.h:229
int findGT(const T &value, int start=0) const
Search the list for the first item > value.
Definition: sortablelist.h:264
int insertSorted(const T &value)
Insert a value in the list, in correct sorted order.
Definition: sortablelist.h:282
int findGE(const T &value, int start=0) const
Search the list for the first item >= value.
Definition: sortablelist.h:246
int findSorted(const T &value, int start=0) const
Search the list for the item equal to value.
Definition: sortablelist.h:195
int removeSorted(const T &value, int start=0)
Remove value value from the list.
Definition: sortablelist.h:292
SortableList(const QList< T > &list)
Constructs a sortable list by copying another one.
Definition: sortablelist.h:99
bool containsSorted(const T &value) const
Return whether the list contains value value.
Definition: sortablelist.h:110
This file is part of the KDE documentation.
Documentation copyright © 1996-2022 The KDE developers.
Generated on Thu Jul 21 2022 00:00:00 by doxygen 1.9.5 written by Dimitri van Heesch, © 1997-2006
Documentation copyright © 1996-2022 The KDE developers.
Generated on Thu Jul 21 2022 00:00:00 by doxygen 1.9.5 written by Dimitri van Heesch, © 1997-2006
KDE's Doxygen guidelines are available online.