refactor(runtime): use Reverse in BinaryHeap

compio-runtime/src/runtime/time.rs

@@ -1,4 +1,5 @@
 use std::{
+    cmp::Reverse,
     collections::BinaryHeap,
     future::Future,
     pin::Pin,
@@ -32,14 +33,14 @@ impl PartialOrd for TimerEntry {
 
 impl Ord for TimerEntry {
     fn cmp(&self, other: &Self) -> std::cmp::Ordering {
-        other.delay.cmp(&self.delay)
+        self.delay.cmp(&other.delay)
     }
 }
 
 pub struct TimerRuntime {
     time: Instant,
     tasks: Slab<FutureState>,
-    wheel: BinaryHeap<TimerEntry>,
+    wheel: BinaryHeap<Reverse<TimerEntry>>,
 }
 
 impl TimerRuntime {
@@ -66,7 +67,7 @@ impl TimerRuntime {
         let key = self.tasks.insert(FutureState::Active(None));
         delay += elapsed;
         let entry = TimerEntry { key, delay };
-        self.wheel.push(entry);
+        self.wheel.push(Reverse(entry));
         Some(key)
     }
 
@@ -83,8 +84,8 @@ impl TimerRuntime {
     pub fn min_timeout(&self) -> Option<Duration> {
         let elapsed = self.time.elapsed();
         self.wheel.peek().map(|entry| {
-            if entry.delay > elapsed {
-                entry.delay - elapsed
+            if entry.0.delay > elapsed {
+                entry.0.delay - elapsed
             } else {
                 Duration::ZERO
             }
@@ -94,8 +95,8 @@ impl TimerRuntime {
     pub fn wake(&mut self) {
         let elapsed = self.time.elapsed();
         while let Some(entry) = self.wheel.pop() {
-            if entry.delay <= elapsed {
-                if let Some(state) = self.tasks.get_mut(entry.key) {
+            if entry.0.delay <= elapsed {
+                if let Some(state) = self.tasks.get_mut(entry.0.key) {
                     let old_state = std::mem::replace(state, FutureState::Completed);
                     if let FutureState::Active(Some(waker)) = old_state {
                         waker.wake();