Remove incorrect comments about the sorting functions

In fact, we could use the sorting functions provided by Qt or the STL.
The reason why we have our own is that we want to support parallel
sorting because sorting many items naturally by name can be expensive.

diff --git a/src/kitemviews/private/kfileitemmodelsortalgorithm.h b/src/kitemviews/private/kfileitemmodelsortalgorithm.h
index 278c69469f84c397c652481dd64e3d1da89ede19..1d56894325ed968979cb31b92f5d44c0474dca4b 100644 (file)
--- a/src/kitemviews/private/kfileitemmodelsortalgorithm.h
+++ b/src/kitemviews/private/kfileitemmodelsortalgorithm.h
@@ -32,8 +32,6 @@
  *
  * The implementation is based on qStableSortHelper() from qalgorithms.h
  * Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
- * The sorting implementations of qAlgorithms could not be used as they
- * don't support having a member-function as comparison criteria.
  */
 
 template <typename RandomAccessIterator, typename LessThan>
@@ -95,8 +93,6 @@ static void parallelMergeSort(RandomAccessIterator begin,
  *
  * The implementation is based on qMerge() from qalgorithms.h
  * Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
- * The sorting implementations of qAlgorithms could not be used as they
- * don't support having a member-function as comparison criteria.
  */
 
 template <typename RandomAccessIterator, typename LessThan>