Fixed quick_sort when array is length 0 or 1

[nit.git] / lib / core / queue.nit

diff --git a/lib/core/queue.nit b/lib/core/queue.nit
index 5b4353e..f545504 100644 (file)
--- a/lib/core/queue.nit
+++ b/lib/core/queue.nit
@@ -238,6 +238,7 @@ class MinHeap[E: Object]
        redef fun is_empty do return items.is_empty
        redef fun length do return items.length
        redef fun iterator do return items.iterator
+       redef fun clear do items.clear
 
        redef fun peek do return items.first
        redef fun add(e)