actions.h

Go to the documentation of this file.

/*
 *    Copyright (c) 2015-2020
 *      SMASH Team
 *
 *    GNU General Public License (GPLv3 or later)
 */
#ifndef SRC_INCLUDE_SMASH_ACTIONS_H_
#define SRC_INCLUDE_SMASH_ACTIONS_H_
 
#include <algorithm>
#include <stdexcept>
#include <utility>
#include <vector>
 
#include "action.h"
#include "forwarddeclarations.h"
 
namespace smash {
 
class Actions {
 public:
  Actions() {}
  explicit Actions(ActionList&& action_list) : data_(std::move(action_list)) {
    std::make_heap(data_.begin(), data_.end(), cmp);
  }
 
  Actions(const Actions&) = delete;
  Actions& operator=(const Actions&) = delete;
 
  bool is_empty() const { return data_.empty(); }
 
  ActionPtr pop() {
    if (data_.empty()) {
      throw std::runtime_error("Empty actions list!");
    }
    std::pop_heap(data_.begin(), data_.end(), cmp);
    ActionPtr act = std::move(data_.back());
    data_.pop_back();
    return act;
  }
 
  double earliest_time() const { return data_.front()->time_of_execution(); }
 
  void insert(ActionList&& new_acts) {
    for (auto& a : new_acts) {
      insert(std::move(a));
    }
  }
 
  void insert(ActionPtr&& action) {
    data_.push_back(std::move(action));
    std::push_heap(data_.begin(), data_.end(), cmp);
  }
 
  ActionList::size_type size() const { return data_.size(); }
 
  void clear() { data_.clear(); }
 
  std::vector<ActionPtr>::const_reverse_iterator begin() const {
    return data_.crbegin();
  }
 
  std::vector<ActionPtr>::const_reverse_iterator end() const {
    return data_.crend();
  }
 
 private:
  static bool cmp(const ActionPtr& a, const ActionPtr& b) {
    return a->time_of_execution() > b->time_of_execution();
  }
 
  std::vector<ActionPtr> data_;
};
 
}  // namespace smash
 
#endif  // SRC_INCLUDE_SMASH_ACTIONS_H_