Go to the documentation of this file.
20 inline QStringList
myth_deque_init(
const QStringList * ) {
return QStringList(); }
35 if (deque<T>::empty())
37 T item = deque<T>::front();
38 deque<T>::pop_front();
51 for (
auto it = deque<T>::begin(); it != deque<T>::end(); ++it)
54 return deque<T>::end();
60 for (
auto it = deque<T>::begin(); it != deque<T>::end(); ++it)
63 return deque<T>::end();
70 if (it != deque<T>::end())
77 {
return find(item) != deque<T>::end(); }
84 {
if (!deque<T>::empty())
return deque<T>::front();
88 {
if (!deque<T>::empty())
return deque<T>::front();
101 #endif // MYTH_DEQUE_H
void remove(T const item)
Removes any item from list. O(n).
iterator find(T const item)
Finds an item in the list via linear search O(n).
T head() const
Returns item at head of list. O(1).
T tail()
Returns item at tail of list. O(1).
T myth_deque_init(const T *)
typename deque< QStringList >::const_iterator const_iterator
typename deque< QStringList >::size_type size_type
T tail() const
Returns item at tail of list. O(1).
MythDeque is similar to QPtrQueue, while being based off deque, this allows that items that are not a...
T head()
Returns item at head of list. O(1).
bool contains(T const &item) const
Returns true if item is in list. O(n).
static const iso6937table * d
void enqueue(T d)
Adds item to the back of the list. O(1).
T dequeue()
Removes item from front of list and returns a copy. O(1).
size_type count() const
Returns size of list. O(1).
const_iterator find(T const item) const
Finds an item in the list via linear search O(n).
typename deque< QStringList >::iterator iterator