mythdeque.h

Go to the documentation of this file.

// -*- Mode: c++ -*-
 
#ifndef MYTH_DEQUE_H
#define MYTH_DEQUE_H
 
#include <QString>
#include <QStringList>
#include <deque>
 
template<typename T>
inline T myth_deque_init(const T */*unused*/) { return nullptr; }
template<>
inline int myth_deque_init(const int * /*unused*/) { return 0; }
template<>
inline uint myth_deque_init(const uint * /*unused*/) { return 0; }
template<>
inline QString myth_deque_init(const QString * /*unused*/) { return {}; }
template<>
inline QStringList myth_deque_init(const QStringList * /*unused*/) { return {}; }
 
template<typename T>
class MythDeque : public std::deque<T>
{
  public:
    T dequeue()
    {
        T *dummy = nullptr;
        if (std::deque<T>::empty())
            return myth_deque_init(dummy);
        T item = std::deque<T>::front();
        std::deque<T>::pop_front();
        return item;
    }
    void enqueue(T d) { std::deque<T>::push_back(d); }
 
    using iterator = typename std::deque<T>::iterator;
    using const_iterator = typename std::deque<T>::const_iterator;
    using size_type = typename std::deque<T>::size_type;
 
    iterator find(T const item)
    {
        for (auto it = std::deque<T>::begin(); it != std::deque<T>::end(); ++it)
            if (*it == item)
                return it;
        return std::deque<T>::end();
    }
 
    const_iterator find(T const item) const
    {
        for (auto it = std::deque<T>::begin(); it != std::deque<T>::end(); ++it)
            if (*it == item)
                return it;
        return std::deque<T>::end();
    }
 
    void remove(T const item)
    {
        auto it = find(item);
        if (it != std::deque<T>::end())
            std::deque<T>::erase(it);
    }
 
    // cppcheck-suppress constParameter
    bool contains(T const &item) const
        { return find(item) != std::deque<T>::end(); }
 
    size_type count() const { return std::deque<T>::size(); }
 
    T head()
        { if (!std::deque<T>::empty()) return std::deque<T>::front();
          T *dummy = nullptr; return myth_deque_init(dummy); }
    T head() const
        { if (!std::deque<T>::empty()) return std::deque<T>::front();
          T *dummy = NULL; return myth_deque_init(dummy); }
 
    T tail()
        { if (!std::deque<T>::empty()) return std::deque<T>::back();
          T *dummy = nullptr; return myth_deque_init(dummy); }
    T tail() const
        { if (!std::deque<T>::empty()) return std::deque<T>::back();
          T *dummy = NULL; return myth_deque_init(dummy); }
};
 
#endif // MYTH_DEQUE_H