src/base/algorithm.h

   1 /*
   2  * Bittorrent Client using Qt and libtorrent.
   3  * Copyright (C) 2023  Mike Tzou (Chocobo1)
   4  * Copyright (C) 2018  Vladimir Golovnev <glassez@yandex.ru>
   5  *
   6  * This program is free software; you can redistribute it and/or
   7  * modify it under the terms of the GNU General Public License
   8  * as published by the Free Software Foundation; either version 2
   9  * of the License, or (at your option) any later version.
  10  *
  11  * This program is distributed in the hope that it will be useful,
  12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  14  * GNU General Public License for more details.
  15  *
  16  * You should have received a copy of the GNU General Public License
  17  * along with this program; if not, write to the Free Software
  18  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
  19  *
  20  * In addition, as a special exception, the copyright holders give permission to
  21  * link this program with the OpenSSL project's "OpenSSL" library (or with
  22  * modified versions of it that use the same license as the "OpenSSL" library),
  23  * and distribute the linked executables. You must obey the GNU General Public
  24  * License in all respects for all of the code used other than "OpenSSL".  If you
  25  * modify file(s), you may extend this exception to your version of the file(s),
  26  * but you are not obligated to do so. If you do not wish to do so, delete this
  27  * exception statement from your version.
  28  */
  29
  30 #pragma once
  31
  32 namespace Algorithm
  33 {
  34     template <typename T>
  35     concept HasMappedType = requires
  36     {
  37         typename T::mapped_type;
  38     };
  39
  40     // To be used with associative array types, such as QMap, QHash and its variants
  41     template <HasMappedType T, typename BinaryPredicate>
  42     void removeIf(T &dict, BinaryPredicate &&p)
  43     {
  44         auto it = dict.begin();
  45         while (it != dict.end())
  46             it = (p(it.key(), it.value()) ? dict.erase(it) : ++it);
  47     }
  48
  49     template <typename List>
  50     List sorted(List list)
  51     {
  52         list.sort();
  53         return list;
  54     }
  55 }