KCalCore Library
sortablelist.h
Go to the documentation of this file.
int findGE(const T &value, int start=0) const
Search the list for the first item >= value.
Definition sortablelist.h:250
int findLT(const T &value, int start=0) const
Search the list for the last item < value.
Definition sortablelist.h:233
int insertSorted(const T &value)
Insert a value in the list, in correct sorted order.
Definition sortablelist.h:286
int findGT(const T &value, int start=0) const
Search the list for the first item > value.
Definition sortablelist.h:268
int removeSorted(const T &value, int start=0)
Remove value value from the list.
Definition sortablelist.h:296
int findSorted(const T &value, int start=0) const
Search the list for the item equal to value.
Definition sortablelist.h:199
bool containsSorted(const T &value) const
Return whether the list contains value value.
Definition sortablelist.h:110
SortableList(const QList< T > &list)
Constructs a sortable list by copying another one.
Definition sortablelist.h:99
int findLE(const T &value, int start=0) const
Search the list for the last item <= value.
Definition sortablelist.h:216
static uint qHash(const KDateTime &dt)
Private class that helps to provide binary compatibility between releases.
Definition occurrenceiterator.cpp:157
This file is part of the KDE documentation.
Documentation copyright © 1996-2024 The KDE developers.
Generated on Wed Jan 24 2024 00:00:00 by doxygen 1.10.0 written by Dimitri van Heesch, © 1997-2006
Documentation copyright © 1996-2024 The KDE developers.
Generated on Wed Jan 24 2024 00:00:00 by doxygen 1.10.0 written by Dimitri van Heesch, © 1997-2006
KDE's Doxygen guidelines are available online.