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
|
/*
* Data Store
* (C) 1999-2007 Jack Lloyd
*
* Distributed under the terms of the Botan license
*/
#include <botan/datastor.h>
#include <botan/exceptn.h>
#include <botan/parsing.h>
#include <botan/hex.h>
#include <botan/internal/stl_util.h>
namespace Botan {
/*
* Data_Store Equality Comparison
*/
bool Data_Store::operator==(const Data_Store& other) const
{
return (contents == other.contents);
}
/*
* Check if this key has at least one value
*/
bool Data_Store::has_value(const std::string& key) const
{
return (contents.lower_bound(key) != contents.end());
}
/*
* Search based on an arbitrary predicate
*/
std::multimap<std::string, std::string> Data_Store::search_for(
std::function<bool (std::string, std::string)> predicate) const
{
std::multimap<std::string, std::string> out;
for(auto i = contents.begin(); i != contents.end(); ++i)
if(predicate(i->first, i->second))
out.insert(std::make_pair(i->first, i->second));
return out;
}
/*
* Search based on key equality
*/
std::vector<std::string> Data_Store::get(const std::string& looking_for) const
{
std::vector<std::string> out;
auto range = contents.equal_range(looking_for);
for(auto i = range.first; i != range.second; ++i)
out.push_back(i->second);
return out;
}
/*
* Get a single atom
*/
std::string Data_Store::get1(const std::string& key) const
{
std::vector<std::string> vals = get(key);
if(vals.empty())
throw Invalid_State("Data_Store::get1: No values set for " + key);
if(vals.size() > 1)
throw Invalid_State("Data_Store::get1: More than one value for " + key);
return vals[0];
}
std::string Data_Store::get1(const std::string& key,
const std::string& default_value) const
{
std::vector<std::string> vals = get(key);
if(vals.size() > 1)
throw Invalid_State("Data_Store::get1: More than one value for " + key);
if(vals.empty())
return default_value;
return vals[0];
}
/*
* Get a single std::vector atom
*/
std::vector<byte>
Data_Store::get1_memvec(const std::string& key) const
{
std::vector<std::string> vals = get(key);
if(vals.empty())
return std::vector<byte>();
if(vals.size() > 1)
throw Invalid_State("Data_Store::get1_memvec: Multiple values for " +
key);
return hex_decode(vals[0]);
}
/*
* Get a single u32bit atom
*/
u32bit Data_Store::get1_u32bit(const std::string& key,
u32bit default_val) const
{
std::vector<std::string> vals = get(key);
if(vals.empty())
return default_val;
else if(vals.size() > 1)
throw Invalid_State("Data_Store::get1_u32bit: Multiple values for " +
key);
return to_u32bit(vals[0]);
}
/*
* Insert a single key and value
*/
void Data_Store::add(const std::string& key, const std::string& val)
{
multimap_insert(contents, key, val);
}
/*
* Insert a single key and value
*/
void Data_Store::add(const std::string& key, u32bit val)
{
add(key, std::to_string(val));
}
/*
* Insert a single key and value
*/
void Data_Store::add(const std::string& key, const secure_vector<byte>& val)
{
add(key, hex_encode(&val[0], val.size()));
}
void Data_Store::add(const std::string& key, const std::vector<byte>& val)
{
add(key, hex_encode(&val[0], val.size()));
}
/*
* Insert a mapping of key/value pairs
*/
void Data_Store::add(const std::multimap<std::string, std::string>& in)
{
std::multimap<std::string, std::string>::const_iterator i = in.begin();
while(i != in.end())
{
contents.insert(*i);
++i;
}
}
}
|
