Qt: Remove predicates.h and stl_util.h

* src/lang/qt/predicates.h, src/lang/qt/stl_util.h: Removed.

--
The magic is still better placed in libkleo.

1 files changed, 0 insertions, 205 deletions

diff --git a/lang/qt/src/predicates.h b/lang/qt/src/predicates.h
deleted file mode 100644
index 74bbe3d2..00000000
--- a/lang/qt/src/predicates.h
+++ /dev/null
@@ -1,205 +0,0 @@
-/* -*- mode: c++; c-basic-offset:4 -*-
-    models/predicates.h
-
-    This file is part of Kleopatra, the KDE keymanager
-    Copyright (c) 2007 Klarälvdalens Datakonsult AB
-    Copyright (c) 2016 Intevation GmbH
-
-    Kleopatra 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.
-
-    Kleopatra 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
-
-    In addition, as a special exception, the copyright holders give
-    permission to link the code of this program with any edition of
-    the Qt library by Trolltech AS, Norway (or with modified versions
-    of Qt that use the same license as Qt), and distribute linked
-    combinations including the two.  You must obey the GNU General
-    Public License in all respects for all of the code used other than
-    Qt.  If you modify this file, you may extend this exception to
-    your version of the file, but you are not obligated to do so.  If
-    you do not wish to do so, delete this exception statement from
-    your version.
-*/
-
-#ifndef __QGPGME_PREDICATES_H__
-#define __QGPGME_PREDICATES_H__
-
-#include <stl_util.h>
-
-#include <string>
-
-#ifdef BUILDING_QGPGME
-# include "global.h"
-#else
-# include <gpgme++/key.h>
-#endif
-
-#include <boost/bind.hpp>
-
-#include <cstring>
-#include <algorithm>
-#include <iterator>
-
-namespace QGpgME
-{
-namespace _detail
-{
-
-inline int mystrcmp(const char *s1, const char *s2)
-{
-    using namespace std;
-    return s1 ? s2 ? strcmp(s1, s2) : 1 : s2 ? -1 : 0;
-}
-
-#define make_comparator_str_impl( Name, expr, cmp )                     \
-    template <template <typename U> class Op>                           \
-    struct Name {                                                       \
-        typedef bool result_type;                                       \
-        \
-        bool operator()( const char * lhs, const char * rhs ) const {   \
-            return Op<int>()( cmp, 0 );                                 \
-        }                                                               \
-        \
-        bool operator()( const std::string & lhs, const std::string & rhs ) const { \
-            return operator()( lhs.c_str(), rhs.c_str() );              \
-        }                                                               \
-        bool operator()( const char * lhs, const std::string & rhs ) const { \
-            return operator()( lhs, rhs.c_str() );                      \
-        }                                                               \
-        bool operator()( const std::string & lhs, const char * rhs ) const { \
-            return operator()( lhs.c_str(), rhs );                      \
-        }                                                               \
-        \
-        template <typename T>                                           \
-        bool operator()( const T & lhs, const T & rhs ) const {         \
-            return operator()( (lhs expr), (rhs expr) );                \
-        }                                                               \
-        template <typename T>                                           \
-        bool operator()( const T & lhs, const char * rhs ) const {      \
-            return operator()( (lhs expr), rhs );                       \
-        }                                                               \
-        template <typename T>                                           \
-        bool operator()( const char * lhs, const T & rhs ) const {      \
-            return operator()( lhs, (rhs expr) );                       \
-        }                                                               \
-        template <typename T>                                           \
-        bool operator()( const T & lhs, const std::string & rhs ) const { \
-            return operator()( (lhs expr), rhs );                       \
-        }                                                               \
-        template <typename T>                                           \
-        bool operator()( const std::string & lhs, const T & rhs ) const {    \
-            return operator()( lhs, (rhs expr) );                       \
-        }                                                               \
-    }
-
-#define make_comparator_str_fast( Name, expr )                          \
-    make_comparator_str_impl( Name, expr, _detail::mystrcmp( lhs, rhs ) )
-#define make_comparator_str( Name, expr )                               \
-    make_comparator_str_impl( Name, expr, qstricmp( lhs, rhs ) )
-
-make_comparator_str_fast(ByFingerprint, .primaryFingerprint());
-make_comparator_str_fast(ByKeyID, .keyID());
-make_comparator_str_fast(ByShortKeyID, .shortKeyID());
-make_comparator_str_fast(ByChainID, .chainID());
-
-template <typename T>
-void sort_by_fpr(T &t)
-{
-    std::sort(t.begin(), t.end(), ByFingerprint<std::less>());
-}
-
-template <typename T>
-void remove_duplicates_by_fpr(T &t)
-{
-    t.erase(std::unique(t.begin(), t.end(), ByFingerprint<std::equal_to>()), t.end());
-}
-
-template <typename T>
-T union_by_fpr(const T &t1, const T &t2)
-{
-    T result;
-    result.reserve(t1.size() + t2.size());
-    std::set_union(t1.begin(), t1.end(),
-                   t2.begin(), t2.end(),
-                   std::back_inserter(result),
-                   ByFingerprint<std::less>());
-    return result;
-}
-
-template <typename T>
-T union_by_fpr_dirty(const T &t1, const T &t2)
-{
-    T cleaned(t1);
-    sort_by_fpr(cleaned);
-    remove_duplicates_by_fpr(cleaned);
-    return union_by_fpr(cleaned, t2);
-}
-
-template <typename T>
-void grep_protocol(T &t, GpgME::Protocol proto)
-{
-    t.erase(std::remove_if(t.begin(), t.end(), boost::bind(&GpgME::Key::protocol, _1) != proto), t.end());
-}
-
-template <typename T>
-bool any_protocol(const T &t, GpgME::Protocol proto)
-{
-    return kdtools::any(t, boost::bind(&GpgME::Key::protocol, _1) == proto);
-}
-
-template <typename T>
-bool all_protocol(const T &t, GpgME::Protocol proto)
-{
-    return kdtools::all(t, boost::bind(&GpgME::Key::protocol, _1) == proto);
-}
-
-template <typename T>
-bool none_of_protocol(const T &t, GpgME::Protocol proto)
-{
-    return kdtools::none_of(t, boost::bind(&GpgME::Key::protocol, _1) == proto);
-}
-
-template <typename T>
-void grep_secret(T &t)
-{
-    t.erase(std::remove_if(t.begin(), t.end(), boost::mem_fn(&GpgME::Key::hasSecret)), t.end());
-}
-
-template <typename T>
-bool any_secret(const T &t)
-{
-    return kdtools::any(t, boost::mem_fn(&GpgME::Key::hasSecret));
-}
-
-template <typename T>
-bool all_secret(const T &t)
-{
-    return kdtools::all(t, boost::mem_fn(&GpgME::Key::hasSecret));
-}
-
-template <typename T>
-bool none_of_secret(const T &t)
-{
-    return kdtools::none_of(t, boost::mem_fn(&GpgME::Key::hasSecret));
-}
-
-template <typename T>
-void grep_can_encrypt(T &t)
-{
-    t.erase(std::remove_if(t.begin(), t.end(), !boost::bind(&GpgME::Key::canEncrypt, _1)), t.end());
-}
-
-}
-}
-
-#endif /* __QGPGME_PREDICATES_H__ */