kde/dolphin
kde/dolphin
1
0
Fork 0
mirror of https://invent.kde.org/system/dolphin synced 2024-11-05 18:47:12 +00:00
Code Issues Projects Releases Packages Wiki Activity

Remove incorrect comments about the sorting functions

Browse source 
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.
This commit is contained in:
Frank Reininghaus 2013-01-15 19:07:36 +01:00
parent d9680ead80
commit 48231488bd
1 changed files with 0 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
src/kitemviews/private/kfileitemmodelsortalgorithm.h
View file

@ -32,8 +32,6 @@
* *
* The implementation is based on qStableSortHelper() from qalgorithms.h * The implementation is based on qStableSortHelper() from qalgorithms.h
* Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies). * 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> template <typename RandomAccessIterator, typename LessThan>
@ -95,8 +93,6 @@ static void parallelMergeSort(RandomAccessIterator begin,
* *
* The implementation is based on qMerge() from qalgorithms.h * The implementation is based on qMerge() from qalgorithms.h
* Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies). * 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> template <typename RandomAccessIterator, typename LessThan>