From 6c3d9acbc22ea9463ba40ef84c9e8c8419dfacf3 Mon Sep 17 00:00:00 2001 From: Peter Penz Date: Wed, 11 Apr 2012 16:06:18 +0200 Subject: KItemViews: Internal directory restructuration - Move all private headers from the kitemviews-directory into the 'private' subdirectory. - Get rid of DolphinDirLister and just use a directory-lister internally in KFileItemModel. - Minor interface-cleanups for signals --- src/kitemviews/kfileitemmodelsortalgorithm_p.h | 70 -------------------------- 1 file changed, 70 deletions(-) delete mode 100644 src/kitemviews/kfileitemmodelsortalgorithm_p.h (limited to 'src/kitemviews/kfileitemmodelsortalgorithm_p.h') diff --git a/src/kitemviews/kfileitemmodelsortalgorithm_p.h b/src/kitemviews/kfileitemmodelsortalgorithm_p.h deleted file mode 100644 index 3a596dff5..000000000 --- a/src/kitemviews/kfileitemmodelsortalgorithm_p.h +++ /dev/null @@ -1,70 +0,0 @@ -/*************************************************************************** - * Copyright (C) 2012 by Peter Penz * - * * - * This program is free software; you can redistribute it and/or modify * - * it under the terms of the GNU General Public License as published by * - * the Free Software Foundation; either version 2 of the License, or * - * (at your option) any later version. * - * * - * This program is distributed in the hope that it will be useful, * - * but WITHOUT ANY WARRANTY; without even the implied warranty of * - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * - * GNU General Public License for more details. * - * * - * You should have received a copy of the GNU General Public License * - * along with this program; if not, write to the * - * Free Software Foundation, Inc., * - * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA * - ***************************************************************************/ - -#ifndef KFILEITEMMODELSORTALGORITHM_H -#define KFILEITEMMODELSORTALGORITHM_H - -#include - -#include - -/** - * @brief Sort algorithm for sorting items of KFileItemModel. - * - * Sorts the items by using KFileItemModel::lessThan() as comparison criteria. - * The merge sort algorithm is used to assure a worst-case - * of O(n * log(n)) and to keep the number of comparisons low. - * - * 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. - */ -class LIBDOLPHINPRIVATE_EXPORT KFileItemModelSortAlgorithm -{ -public: - static void sort(KFileItemModel* model, - QList::iterator begin, - QList::iterator end); - -private: - static void merge(KFileItemModel* model, - QList::iterator begin, - QList::iterator pivot, - QList::iterator end); - - static QList::iterator - lowerBound(KFileItemModel* model, - QList::iterator begin, - QList::iterator end, - const KFileItemModel::ItemData* value); - - static QList::iterator - upperBound(KFileItemModel* model, - QList::iterator begin, - QList::iterator end, - const KFileItemModel::ItemData* value); - - static void reverse(QList::iterator begin, - QList::iterator end); -}; - -#endif - - -- cgit v1.3