- make Common::sort supporting a function object to compare two entries instead of operator <

- adapt parallaction to use the new Common::sort function

svn-id: r30692

1 files changed, 21 insertions, 0 deletions

diff --git a/common/algorithm.h b/common/algorithm.h
index e2ee653fca..beae34245f 100644
--- a/common/algorithm.h
+++ b/common/algorithm.h
@@ -131,6 +131,27 @@ void sort(T first, T last) {
 	}
 }
 
+// Using this with: Common::Less from common/func.h
+// will give the same results as the function above.
+template<class T, class StrictWeakOrdering>
+void sort(T first, T last, StrictWeakOrdering comp) {
+	if (first == last)
+		return;
+
+	// Simple selection sort
+	T i(first);
+	for (; i != last; ++i) {
+		T minElem(i);
+		T j(i);
+		++j;
+		for (; j != last; ++j)
+			if (comp(*j, *minElem))
+				minElem = j;
+		if (minElem != i)
+			SWAP(*minElem, *i);
+	}
+}
+
 } // end of namespace Common
 #endif