Added method "sort(bool)" to sort the element of the queue in ascending or descending order

vcg/space/index/kdtree/priorityqueue.h

@@ -21,8 +21,12 @@
 *                                                                           *
 ****************************************************************************/
 
-#ifndef _PriorityQueue_h_
+#ifndef _PRIORITYQUEUE_H_
-#define _PriorityQueue_h_
+#define _PRIORITYQUEUE_H_
+
+#include <algorithm>
+
+namespace vcg {
 
 	/** Implements a bounded-size max priority queue using a heap
 	*/
@@ -35,6 +39,26 @@ class HeapMaxPriorityQueue
 			Index index;
 		};
 
+
+		struct 
+		{
+			bool operator()(const Element& a, const Element& b) const
+			{   
+				return a.weight < b.weight;
+			}   
+		} lessElement;
+
+
+		struct 
+		{
+			bool operator()(const Element& a, const Element& b) const
+			{   
+				return a.weight > b.weight;
+			}   
+		} greaterElement;
+
+
+
 	public:
 
 		HeapMaxPriorityQueue(void)
@@ -118,6 +142,14 @@ public:
 			}
 		}
 
+		inline void sort(bool ascending = true)
+		{
+			if (ascending)
+				std::sort(mElements, mElements + mCount, lessElement);
+			else
+				std::sort(mElements, mElements + mCount, greaterElement);
+		}
+
 	protected:
 
 		int mCount;
@@ -126,4 +158,5 @@ protected:
 		Element* mpOffsetedElements;
 	};
 
+}
 #endif