Queue.H

/* Aleph-w

     / \  | | ___ _ __ | |__      __      __
    / _ \ | |/ _ \ '_ \| '_ \ ____\ \ /\ / / Data structures & Algorithms
   / ___ \| |  __/ |_) | | | |_____\ V  V /  version 1.9b
  /_/   \_\_|\___| .__/|_| |_|      \_/\_/   https://github.com/lrleon/Aleph-w
                 |_|         

  This file is part of Aleph-w library

  Copyright (c) 2002-2018 Leandro Rabindranath Leon & Alejandro Mujica

  This program is free software: you can redistribute it and/or modify
  it under the terms of the GNU General Public License as published by
  the Free Software Foundation, either version 3 of the License, or
  (at your option) any later version.

  This program is distributed in the hope that it will be useful, but
  WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  General Public License for more details.

  You should have received a copy of the GNU General Public License
  along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
# ifndef AH_QUEUE_H
# define AH_QUEUE_H

# include <tpl_dynListQueue.H>

namespace Aleph {

    template <class T>
class queue : public Aleph::DynListQueue<T>
{
public:

  typedef size_t size_type;

  queue() { /* empty */ }

      template <class Container>
  queue(Container & cont)
  {
    const typename Container::iterator end = cont.end();

    for (typename Container::iterator it(cont.begin()); it != end; put(it++));
  }
  
  void push(const T & value) { put(value); }

  void pop() { this->get(); }

  T & back() { return this->rear(); }

  bool empty() const { return this->is_empty(); }
};

} // end namespace Aleph

# endif // AH_QUEUE_H