Fixed naming and documentation

Author: mikkul

PriorityQueues/MappedPriorityQueue.cs renamed to PriorityQueues/BinaryHeapMappedPriorityQueue.cs

@@ -5,7 +5,7 @@
 
 namespace PriorityQueues
 {
-	public class MappedPriorityQueue<T> : IPriorityQueue<T> where T : IPriorityElement
+	public class BinaryHeapMappedPriorityQueue<T> : IPriorityQueue<T> where T : IPriorityElement
 	{
 		#region Private fields
 		private List<T> _heap;
@@ -20,31 +20,31 @@ public class MappedPriorityQueue<T> : IPriorityQueue<T> where T : IPriorityEleme
 
 		#region Constructors
 		/// <summary>
-		/// Initializes a new instance of <see cref="PriorityQueue{T}"/> class that is empty and has the default initial capacity
+		/// Initializes a new instance of <see cref="BinaryHeapMappedPriorityQueue{T}"/> class that is empty and has the default initial capacity
 		/// </summary>
-		public MappedPriorityQueue()
+		public BinaryHeapMappedPriorityQueue()
 		{
 			_heap = new List<T>();
 
 			_map = new Dictionary<T, List<int>>();
 		}
 
 		/// <summary>
-		/// Initializes a new instance of <see cref="PriorityQueue{T}"/> class that is empty and has the specified initial capacity
+		/// Initializes a new instance of <see cref="BinaryHeapMappedPriorityQueue{T}"/> class that is empty and has the specified initial capacity
 		/// </summary>
-		/// <param name="capacity">The number of elements the <see cref="PriorityQueue{T}"/> can initially store</param>
-		public MappedPriorityQueue(int capacity)
+		/// <param name="capacity">The number of elements the <see cref="BinaryHeapMappedPriorityQueue{T}"/> can initially store</param>
+		public BinaryHeapMappedPriorityQueue(int capacity)
 		{
 			_heap = new List<T>(capacity);
 
 			_map = new Dictionary<T, List<int>>(capacity);
 		}
 
 		/// <summary>
-		/// Initializes a new instance of <see cref="PriorityQueue{T}"/> class that contains elements copied from the specified collection, sorted by their priority value
+		/// Initializes a new instance of <see cref="BinaryHeapMappedPriorityQueue{T}"/> class that contains elements copied from the specified collection, sorted by their priority value
 		/// </summary>
-		/// <param name="collection">The collection whose elements are copied to the <see cref="PriorityQueue{T}"/></param>
-		public MappedPriorityQueue(IEnumerable<T> collection)
+		/// <param name="collection">The collection whose elements are copied to the <see cref="BinaryHeapMappedPriorityQueue{T}"/></param>
+		public BinaryHeapMappedPriorityQueue(IEnumerable<T> collection)
 		{
 			_heap = new List<T>(collection.Count());
 

PriorityQueues/PriorityQueue.cs renamed to PriorityQueues/BinaryHeapPriorityQueue.cs

@@ -5,7 +5,7 @@
 
 namespace PriorityQueues
 {
-	public class PriorityQueue<T> : IPriorityQueue<T> where T : IPriorityElement
+	public class BinaryHeapPriorityQueue<T> : IPriorityQueue<T> where T : IPriorityElement
 	{
 		#region Private fields
 		private List<T> _heap;
@@ -18,27 +18,27 @@ public class PriorityQueue<T> : IPriorityQueue<T> where T : IPriorityElement
 
 		#region Constructors
 		/// <summary>
-		/// Initializes a new instance of <see cref="PriorityQueue{T}"/> class that is empty and has the default initial capacity
+		/// Initializes a new instance of <see cref="BinaryHeapPriorityQueue{T}"/> class that is empty and has the default initial capacity
 		/// </summary>
-		public PriorityQueue()
+		public BinaryHeapPriorityQueue()
 		{
 			_heap = new List<T>();
 		}
 
 		/// <summary>
-		/// Initializes a new instance of <see cref="PriorityQueue{T}"/> class that is empty and has the specified initial capacity
+		/// Initializes a new instance of <see cref="BinaryHeapPriorityQueue{T}"/> class that is empty and has the specified initial capacity
 		/// </summary>
-		/// <param name="capacity">The number of elements the <see cref="PriorityQueue{T}"/> can initially store</param>
-		public PriorityQueue(int capacity)
+		/// <param name="capacity">The number of elements the <see cref="BinaryHeapPriorityQueue{T}"/> can initially store</param>
+		public BinaryHeapPriorityQueue(int capacity)
 		{
 			_heap = new List<T>(capacity);
 		}
 
 		/// <summary>
-		/// Initializes a new instance of <see cref="PriorityQueue{T}"/> class that contains elements copied from the specified collection, sorted by their priority value
+		/// Initializes a new instance of <see cref="BinaryHeapPriorityQueue{T}"/> class that contains elements copied from the specified collection, sorted by their priority value
 		/// </summary>
-		/// <param name="collection">The collection whose elements are copied to the <see cref="PriorityQueue{T}"/></param>
-		public PriorityQueue(IEnumerable<T> collection)
+		/// <param name="collection">The collection whose elements are copied to the <see cref="BinaryHeapPriorityQueue{T}"/></param>
+		public BinaryHeapPriorityQueue(IEnumerable<T> collection)
 		{
 			_heap = new List<T>(collection.Count());
 

PriorityQueues/PriorityQueues.csproj

@@ -43,8 +43,8 @@
   <ItemGroup>
     <Compile Include="IPriorityElement.cs" />
     <Compile Include="IPriorityQueue.cs" />
-    <Compile Include="MappedPriorityQueue.cs" />
-    <Compile Include="PriorityQueue.cs" />
+    <Compile Include="BinaryHeapMappedPriorityQueue.cs" />
+    <Compile Include="BinaryHeapPriorityQueue.cs" />
     <Compile Include="Properties\AssemblyInfo.cs" />
   </ItemGroup>
   <Import Project="$(MSBuildToolsPath)\Microsoft.CSharp.targets" />