123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116 |
- /**
- * @file HeapScheduler.hpp
- * @author The PARADEVS Development Team
- * See the AUTHORS or Authors.txt file
- */
- /*
- * PARADEVS - the multimodeling and simulation environment
- * This file is a part of the PARADEVS environment
- *
- * Copyright (C) 2013 ULCO http://www.univ-litoral.fr
- *
- * 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 <http://www.gnu.org/licenses/>.
- */
- #ifndef COMMON_SCHEDULER_HEAP_SCHEDULER_HPP
- #define COMMON_SCHEDULER_HEAP_SCHEDULER_HPP 1
- #include <common/InternalEvent.hpp>
- #include <boost/heap/fibonacci_heap.hpp>
- #include <sstream>
- namespace paradevs { namespace common { namespace scheduler {
- template < typename Time >
- struct Heap
- {
- typedef boost::heap::fibonacci_heap <
- InternalEvent < Time >, boost::heap::compare <
- EventCompare < InternalEvent < Time > > > > Type;
- typedef typename boost::heap::fibonacci_heap <
- InternalEvent < Time >, boost::heap::compare <
- EventCompare < InternalEvent <
- Time > > > >::handle_type Handle;
- };
- template < class Time >
- class HeapScheduler : public boost::heap::fibonacci_heap <
- InternalEvent < Time >, boost::heap::compare <
- EventCompare < InternalEvent < Time > > > >
- {
- public:
- HeapScheduler()
- { }
- virtual ~HeapScheduler()
- { }
- Model < Time >* get_current_model()
- {
- return HeapScheduler < Time >::top().get_model();
- }
- Models < Time > get_current_models(typename Time::type time) const
- {
- Models < Time > models;
- for (typename HeapScheduler < Time >::ordered_iterator it =
- HeapScheduler < Time >::ordered_begin();
- it != HeapScheduler < Time >::ordered_end() and
- it->get_time() == time; ++it) {
- models.push_back(it->get_model());
- }
- return models;
- }
- typename Time::type get_current_time() const
- {
- return HeapScheduler < Time >::top().get_time();
- }
- void init(typename Time::type time, Model < Time >* model)
- {
- model->heap_id(HeapScheduler < Time >::push(
- InternalEvent < Time >(time, model)));
- }
- void put(typename Time::type time, Model < Time >* model)
- {
- HeapScheduler < Time >::erase(model->heap_id());
- model->heap_id(HeapScheduler < Time >::push(
- InternalEvent < Time >(time, model)));
- }
- std::string to_string() const
- {
- std::stringstream ss;
- ss << "Scheduler = { ";
- for (typename HeapScheduler < Time >::ordered_iterator it =
- HeapScheduler < Time >::ordered_begin();
- it != HeapScheduler < Time >::ordered_end(); ++it) {
- ss << "(" << it->get_time() << " -> " << it->get_model()->get_name()
- << ") ";
- }
- ss << "}";
- return ss.str();
- }
- };
- } } } // namespace paradevs common scheduler
- #endif
|