--- a/src/simulator/heap-scheduler.h	Thu Apr 08 13:28:54 2010 +0200
+++ b/src/simulator/heap-scheduler.h	Thu Apr 08 13:39:07 2010 +0200
@@ -30,9 +30,9 @@
 /**
  * \ingroup scheduler
  * \brief a binary heap event scheduler
- * 
+ *
  * This code started as a c++ translation of a java-based code written in 2005
- * to implement a heap sort. So, this binary heap is really a pretty 
+ * to implement a heap sort. So, this binary heap is really a pretty
  * straightforward implementation of the classic data structure. Not much to say
  * about it.
  *
@@ -44,7 +44,7 @@
  *  - It uses a slightly non-standard while loop for top-down heapify
  *    to move one if statement out of the loop.
  */
-class HeapScheduler : public Scheduler 
+class HeapScheduler : public Scheduler
 {
 public:
   static TypeId GetTypeId (void);