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
|
/* Copyright 2008,2009,2010 Rolf Eike Beer <[email protected]>
*
* 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) version 3 or any later version
* accepted by the membership of KDE e.V. (or its successor approved
* by the membership of KDE e.V.), which shall act as a proxy
* defined in Section 14 of version 3 of the license.
*
* 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, see <http://www.gnu.org/licenses/>.
*/
#include "KGpgUidNode.h"
#include "KGpgKeyNode.h"
#include "convert.h"
class KGpgUidNodePrivate {
public:
KGpgUidNodePrivate(const unsigned int index, const QStringList &sl);
const QString m_index;
QString m_email;
QString m_name;
QString m_comment;
KgpgCore::KgpgKeyTrust m_trust;
bool m_valid;
};
KGpgUidNodePrivate::KGpgUidNodePrivate(const unsigned int index, const QStringList &sl)
: m_index(QString::number(index))
{
QString fullname(sl.at(9));
if (fullname.contains(QLatin1Char( '<' )) ) {
m_email = fullname;
if (fullname.contains(QLatin1Char( ')' )) )
m_email = m_email.section(QLatin1Char( ')' ), 1);
m_email = m_email.section(QLatin1Char( '<' ), 1);
m_email.truncate(m_email.length() - 1);
if (m_email.contains(QLatin1Char( '<' ))) {
// several email addresses in the same key
m_email = m_email.replace(QLatin1Char( '>' ), QLatin1Char( ';' ));
m_email.remove(QLatin1Char( '<' ));
}
}
m_name = fullname.section(QLatin1String( " <" ), 0, 0);
if (fullname.contains(QLatin1Char( '(' )) ) {
m_name = m_name.section(QLatin1String( " (" ), 0, 0);
m_comment = fullname.section(QLatin1Char( '(' ), 1, 1);
m_comment = m_comment.section(QLatin1Char( ')' ), 0, 0);
}
m_trust = KgpgCore::Convert::toTrust(sl.at(1));
m_valid = ((sl.count() <= 11) || !sl.at(11).contains(QLatin1Char( 'D' )));
}
KGpgUidNode::KGpgUidNode(KGpgKeyNode *parent, const unsigned int index, const QStringList &sl)
: KGpgSignableNode(parent),
d_ptr(new KGpgUidNodePrivate(index, sl))
{
}
KGpgUidNode::~KGpgUidNode()
{
delete d_ptr;
}
QString
KGpgUidNode::getName() const
{
const Q_D(KGpgUidNode);
return d->m_name;
}
QString
KGpgUidNode::getEmail() const
{
const Q_D(KGpgUidNode);
return d->m_email;
}
QString
KGpgUidNode::getId() const
{
const Q_D(KGpgUidNode);
return d->m_index;
}
KGpgKeyNode *
KGpgUidNode::getKeyNode(void)
{
return getParentKeyNode()->toKeyNode();
}
const KGpgKeyNode *
KGpgUidNode::getKeyNode(void) const
{
return getParentKeyNode()->toKeyNode();
}
KGpgKeyNode *
KGpgUidNode::getParentKeyNode() const
{
return m_parent->toKeyNode();
}
void
KGpgUidNode::readChildren()
{
}
KgpgCore::KgpgItemType
KGpgUidNode::getType() const
{
return KgpgCore::ITYPE_UID;
}
KgpgCore::KgpgKeyTrust
KGpgUidNode::getTrust() const
{
const Q_D(KGpgUidNode);
return d->m_trust;
}
QString
KGpgUidNode::getComment() const
{
const Q_D(KGpgUidNode);
return d->m_comment;
}
|
