Queue.h

Go to the documentation of this file.

#ifndef STACK_PROJECT_COMMA_H
#define STACK_PROJECT_COMMA_H
 
/*
 * CoMMA
 *
 * Copyright © 2024 ONERA
 *
 * Authors: Nicolas Lantos, Alberto Remigi, and Riccardo Milani
 * Contributors: Karim Anemiche
 *
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at https://mozilla.org/MPL/2.0/.
 */
 
#include <cassert>
#include <deque>
#include <iostream>
#include <vector>
 
namespace comma {
 
template<typename T>
class Queue {
private:
  std::deque<T> _elems;
 
public:
  Queue() = default;
  ~Queue() = default;
 
  void push(T const &elem) { _elems.push_back(elem); }
 
  T pop() {
    if (_elems.empty()) {
      return static_cast<T>(-1);
    }
    T elem = _elems.front();  // Copy last element
    _elems.pop_front();  // remove last element
    return elem;
  }
 
  T top() const {
    if (_elems.empty()) {
      return static_cast<T>(-1);
    }
    return _elems.front();
  }
 
  inline bool empty() const { return _elems.empty(); }
};
 
}  // end namespace comma
 
#endif