/usr/include/KF5/libkleo/predicates.h is in libkf5libkleo-dev 4:17.12.3-0ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 | /* -*- 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
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 __KLEOPATRA_MODELS_PREDICATES_H__
#define __KLEOPATRA_MODELS_PREDICATES_H__
#include <gpgme++/key.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <iterator>
#include <functional>
namespace Kleo
{
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(),
[proto](const GpgME::Key &key) {
return key.protocol() != proto;
}), t.end());
}
template <typename T>
bool any_protocol(const T &t, GpgME::Protocol proto)
{
return std::any_of(t.cbegin(), t.cend(),
[proto](const GpgME::Key &key) {
return key.protocol() == proto;
});
}
template <typename T>
bool all_protocol(const T &t, GpgME::Protocol proto)
{
return std::all_of(t.cbegin(), t.cend(),
[proto](const GpgME::Key &key) {
return key.protocol() == proto;
});
}
template <typename T>
bool none_of_protocol(const T &t, GpgME::Protocol proto)
{
return std::none_of(t.cbegin(), t.cend(),
[proto](const GpgME::Key &key) {
return key.protocol() == proto;
});
}
template <typename T>
void grep_secret(T &t)
{
t.erase(std::remove_if(t.begin(), t.end(), std::mem_fn(&GpgME::Key::hasSecret)), t.end());
}
template <typename T>
bool any_secret(const T &t)
{
return std::any_of(t.cbegin(), t.cend(), std::mem_fn(&GpgME::Key::hasSecret));
}
template <typename T>
bool all_secret(const T &t)
{
return std::all_of(t.cbegin(), t.cend(), std::mem_fn(&GpgME::Key::hasSecret));
}
template <typename T>
bool none_of_secret(const T &t)
{
return std::none_of(t.cbegin(), t.cend(), std::mem_fn(&GpgME::Key::hasSecret));
}
template <typename T>
void grep_can_encrypt(T &t)
{
t.erase(std::remove_if(t.begin(), t.end(),
[](const GpgME::Key &key) {
return !key.canEncrypt();
}), t.end());
}
}
}
#endif /* __KLEOPATRA_MODELS_PREDICATES_H__ */
|