tSearchableStack.h

Go to the documentation of this file.

// this is for emacs file handling -*- mode: c++; indent-tabs-mode: nil -*-

// -- BEGIN LICENSE BLOCK ----------------------------------------------
// This file is part of FZIs ic_workspace.
//
// This program is free software licensed under the LGPL
// (GNU LESSER GENERAL PUBLIC LICENSE Version 3).
// You can find a copy of this license in LICENSE folder in the top
// directory of the source code.
//
// © Copyright 2016 FZI Forschungszentrum Informatik, Karlsruhe, Germany
//
// -- END LICENSE BLOCK ------------------------------------------------

//----------------------------------------------------------------------
//----------------------------------------------------------------------
#ifndef ICL_CORE_T_SEARCHABLE_STACK_H_INCLUDED
#define ICL_CORE_T_SEARCHABLE_STACK_H_INCLUDED

#include <functional>
#include <vector>

#include "icl_core/BaseTypes.h"
#include "icl_core/Deprecate.h"
#include "icl_core/TemplateHelper.h"

namespace icl_core {

template <typename T, typename Compare = std::equal_to<T>, typename Alloc = std::allocator<T> >
class ICL_CORE_VC_DEPRECATE tSearchableStack : protected std::vector<T, Alloc>
{
public:
  typedef typename std::vector<T>::const_iterator const_iterator;
  typedef typename std::vector<T>::const_reverse_iterator const_reverse_iterator;
  typedef typename std::vector<T>::size_type size_type;

  tSearchableStack() : std::vector<T, Alloc>(), m_comp() { }

  void clear() { std::vector<T, Alloc>::clear(); }
  bool empty() const { return std::vector<T, Alloc>::empty(); }
  size_type size() const { return std::vector<T, Alloc>::size(); }

  void push(typename ConvertToRef<T>::ToConstRef t) { std::vector<T, Alloc>::push_back(t); }
  void pop() { std::vector<T, Alloc>::pop_back(); }
  typename ConvertToRef<T>::ToRef top() { return std::vector<T, Alloc>::back(); }
  typename ConvertToRef<T>::ToConstRef top() const { return std::vector<T, Alloc>::back(); }

  const_iterator begin() const { return std::vector<T, Alloc>::begin(); }
  const_iterator end() const { return std::vector<T, Alloc>::end(); }
  const_reverse_iterator rbegin() const { return std::vector<T, Alloc>::rbegin(); }
  const_reverse_iterator rend() const { return std::vector<T, Alloc>::rend(); }

  const_iterator find(typename ConvertToRef<T>::ToConstRef t) const
  {
    for (const_iterator it = begin(); it != end(); ++it)
    {
      if (m_comp(*it, t)) { return it; }
    }
    return end();
  }

  Compare m_comp;
} ICL_CORE_GCC_DEPRECATE;

typedef tSearchableStack<tUnsigned8> tUnsigned8SearchableStack;
typedef tSearchableStack<tUnsigned16> tUnsigned16SearchableStack;
typedef tSearchableStack<tUnsigned32> tUnsigned32SearchableStack;
typedef tSearchableStack<tUnsigned64> tUnsigned64SearchableStack;
typedef tSearchableStack<tSigned8> tSigned8SearchableStack;
typedef tSearchableStack<tSigned16> tSigned16SearchableStack;
typedef tSearchableStack<tSigned32> tSigned32SearchableStack;
typedef tSearchableStack<tSigned64> tSigned64SearchableStack;
typedef tSearchableStack<tFloat> tFloatSearchableStack;
typedef tSearchableStack<tDouble> tDoubleSearchableStack;

}

#endif