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
|
/*
hierarchyanalyser.cpp
This file is part of Kleopatra, the KDE keymanager
Copyright (c) 2004 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 TQt library by Trolltech AS, Norway (or with modified versions
of TQt that use the same license as TQt), 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
TQt. 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.
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include "hierarchyanalyser.h"
#include <algorithm>
#include <iterator>
HierarchyAnalyser::HierarchyAnalyser( TQObject * tqparent, const char * name )
: TQObject( tqparent, name )
{
}
HierarchyAnalyser::~HierarchyAnalyser() {
}
void HierarchyAnalyser::slotNextKey( const GpgME::Key & key ) {
if ( key.isNull() )
return;
if ( key.isRoot() || !key.chainID() || !*key.chainID() )
// root keys have themselves as issuer - we don't want them to
// have tqparents, though:
mSubjectsByIssuer[0].push_back( key );
else
mSubjectsByIssuer[key.chainID()].push_back( key );
}
const std::vector<GpgME::Key> & HierarchyAnalyser::subjectsForIssuer( const char * issuer_dn ) const {
static const std::vector<GpgME::Key> empty;
std::map< TQCString, std::vector<GpgME::Key> >::const_iterator it =
mSubjectsByIssuer.find( issuer_dn );
return it == mSubjectsByIssuer.end() ? empty : it->second ;
}
std::vector<GpgME::Key> HierarchyAnalyser::subjectsForIssuerRecursive( const char * issuer_dn ) const {
std::vector<GpgME::Key> keys = subjectsForIssuer( issuer_dn );
for ( unsigned int i = 0 ; i < keys.size() ; ++i ) // can't use iterators here, since appending would tqinvalidate them
if ( const char * fpr = keys[i].primaryFingerprint() ) {
const std::vector<GpgME::Key> & tmp = subjectsForIssuer( fpr );
std::copy( tmp.begin(), tmp.end(), std::back_inserter( keys ) );
}
return keys;
}
#include "hierarchyanalyser.moc"
|
