heap-scheduler.h

Go to the documentation of this file.

/* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/*
 * Copyright (c) 2005 INRIA
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation;
 *
 * 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, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 * Author: Mathieu Lacage <mathieu.lacage@sophia.inria.fr>
 */
 
#ifndef HEAP_SCHEDULER_H
#define HEAP_SCHEDULER_H
 
#include "scheduler.h"
#include <stdint.h>
#include <vector>
 
namespace ns3 {
 
class HeapScheduler : public Scheduler
{
public:
  static TypeId GetTypeId (void);
 
  HeapScheduler ();
  virtual ~HeapScheduler ();
 
  // Inherited
  virtual void Insert (const Scheduler::Event &ev);
  virtual bool IsEmpty (void) const;
  virtual Scheduler::Event PeekNext (void) const;
  virtual Scheduler::Event RemoveNext (void);
  virtual void Remove (const Scheduler::Event &ev);
 
private:
  typedef std::vector<Scheduler::Event> BinaryHeap;
 
  inline std::size_t Parent (std::size_t id) const;
  std::size_t Sibling (std::size_t id) const;
  inline std::size_t LeftChild (std::size_t id) const;
  inline std::size_t RightChild (std::size_t id) const;
  inline std::size_t Root (void) const;
  std::size_t Last (void) const;
  inline bool IsRoot (std::size_t id) const;
  inline bool IsBottom (std::size_t id) const;
  inline bool IsLessStrictly (std::size_t a, std::size_t b) const;
  inline std::size_t Smallest (std::size_t a, std::size_t b) const;
  inline void Exch (std::size_t a, std::size_t b);
  void BottomUp (void);
  void TopDown (std::size_t start);
 
  BinaryHeap m_heap;
};
 
} // namespace ns3
 
#endif /* HEAP_SCHEDULER_H */