Renamed Remove function for consistency

SystemExtensions/Collections/BinaryHeap.cs

@@ -101,7 +101,7 @@ namespace SystemExtensions.Collections
         /// Removes the item at the root. Throws exception if there are no items in the heap.
         /// </summary>
         /// <returns>Value removed.</returns>
-        public T RemoveMinimum()
+        public T Remove()
         {
             if (count == 0)
             {
@@ -113,6 +113,19 @@ namespace SystemExtensions.Collections
             return min;
         }
         /// <summary>
+        /// Peeks at the item at the root. Throws exception if there are no items in the heap.
+        /// </summary>
+        /// <returns></returns>
+        public T Peek()
+        {
+            if (count == 0)
+            {
+                throw new IndexOutOfRangeException("Heap is empty!");
+            }
+            T min = items[1];
+            return min;
+        }
+        /// <summary>
         /// Return the heap structure as an array
         /// </summary>
         /// <returns>Array with values sorted as in heap</returns>

SystemExtensions/Collections/PriorityQueue.cs

@@ -56,7 +56,7 @@ namespace SystemExtensions.Collections
         {
             if (Count > 0)
             {
-                return binaryHeap.RemoveMinimum();
+                return binaryHeap.Remove();
             }
             else
             {

SystemExtensionsTests/Collections/BinaryHeapTests.cs

@@ -63,7 +63,7 @@ namespace SystemExtensions.Collections.Tests
                     {
                         Assert.Fail();
                     }
-                    System.Diagnostics.Debug.WriteLine(binaryHeap.RemoveMinimum());
+                    System.Diagnostics.Debug.WriteLine(binaryHeap.Remove());
                     tries--;
                 }
             }