summaryrefslogtreecommitdiff
path: root/src/ValueBase.cc
blob: 108bac4531568b733cc339b5961e4d8eabc5901e (plain)
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
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
/* <!-- copyright */
/*
 * aria2 - The high speed download utility
 *
 * Copyright (C) 2010 Tatsuhiro Tsujikawa
 *
 * 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) any later version.
 *
 * 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, 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 portions of this program with the
 * OpenSSL library under certain conditions as described in each
 * individual source file, 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 OpenSSL.  If you modify
 * file(s) with this exception, you may extend this exception to your
 * version of the file(s), but you are not obligated to do so.  If you
 * do not wish to do so, delete this exception statement from your
 * version.  If you delete this exception statement from all source
 * files in the program, then also delete it here.
 */
/* copyright --> */
#include "ValueBase.h"

namespace aria2 {

String::String(const ValueType& string):str_{string} {}
String::String(ValueType&& string):str_{std::move(string)} {}

String::String(const char* cstring):str_{cstring} {}

String::String(const char* data, size_t length)
  : str_{&data[0], &data[length]}
 {}

String::String(const unsigned char* data, size_t length)
  : str_{&data[0], &data[length]}
 {}

String::String() {}

const String::ValueType& String::s() const
{
  return str_;
}

String::ValueType String::popValue() const
{
  return std::move(str_);
}

const unsigned char* String::uc() const
{
  return reinterpret_cast<const unsigned char*>(str_.data());
}

std::unique_ptr<String> String::g(const ValueType& string)
{
  return make_unique<String>(string);
}

std::unique_ptr<String> String::g(ValueType&& string)
{
  return make_unique<String>(std::move(string));
}

std::unique_ptr<String> String::g(const unsigned char* data, size_t length)
{
  return make_unique<String>(data, length);
}

void String::accept(ValueBaseVisitor& v) const
{
  v.visit(*this);
}

Integer::Integer(ValueType integer) : integer_{integer} {}

Integer::Integer() : integer_{0} {}

Integer::ValueType Integer::i() const
{
  return integer_;
}

std::unique_ptr<Integer> Integer::g(ValueType integer)
{
  return make_unique<Integer>(integer);
}

void Integer::accept(ValueBaseVisitor& v) const
{
  v.visit(*this);
}

Bool::Bool(bool val):val_{val} {}

std::unique_ptr<Bool> Bool::gTrue()
{
  return make_unique<Bool>(true);
}

std::unique_ptr<Bool> Bool::gFalse()
{
  return make_unique<Bool>(false);
}

bool Bool::val() const
{
  return val_;
}

void Bool::accept(ValueBaseVisitor& v) const
{
  v.visit(*this);
}

Null::Null() {}

std::unique_ptr<Null> Null::g()
{
  return make_unique<Null>();
}

void Null::accept(ValueBaseVisitor& v) const
{
  v.visit(*this);
}

List::List() {}

ValueBase* List::get(size_t index) const
{
  return list_[index].get();
}

void List::set(size_t index, std::unique_ptr<ValueBase> v)
{
  list_[index] = std::move(v);
}

void List::pop_front()
{
  list_.pop_front();
}

void List::pop_back()
{
  list_.pop_back();
}

void List::append(std::unique_ptr<ValueBase> v)
{
  list_.push_back(std::move(v));
}

void List::append(String::ValueType string)
{
  list_.push_back(String::g(std::move(string)));
}

List& List::operator<<(std::unique_ptr<ValueBase> v)
{
  list_.push_back(std::move(v));
  return *this;
}

ValueBase* List::operator[](size_t index) const
{
  return list_[index].get();
}

List::ValueType::iterator List::begin()
{
  return list_.begin();
}

List::ValueType::iterator List::end()
{
  return list_.end();
}

List::ValueType::const_iterator List::begin() const
{
  return list_.begin();
}

List::ValueType::const_iterator List::end() const
{
  return list_.end();
}

List::ValueType::const_iterator List::cbegin() const
{
  return list_.cbegin();
}

List::ValueType::const_iterator List::cend() const
{
  return list_.cend();
}

size_t List::size() const
{
  return list_.size();
}

bool List::empty() const
{
  return list_.empty();
}

std::unique_ptr<List> List::g()
{
  return make_unique<List>();
}

void List::accept(ValueBaseVisitor& v) const
{
  v.visit(*this);
}

Dict::Dict() {}

void Dict::put(std::string key, std::unique_ptr<ValueBase> vlb)
{
  auto p = std::make_pair(std::move(key), std::move(vlb));
  auto r = dict_.insert(std::move(p));
  if(!r.second) {
    (*r.first).second = std::move(vlb);
  }
}

void Dict::put(std::string key, String::ValueType string)
{
  put(std::move(key), String::g(std::move(string)));
}

ValueBase* Dict::get(const std::string& key) const
{
  auto itr = dict_.find(key);
  if(itr == std::end(dict_)) {
    return nullptr;
  } else {
    return (*itr).second.get();
  }
}

ValueBase* Dict::operator[](const std::string& key) const
{
  return get(key);
}

bool Dict::containsKey(const std::string& key) const
{
  return dict_.count(key);
}

void Dict::removeKey(const std::string& key)
{
  dict_.erase(key);
}

std::unique_ptr<ValueBase> Dict::popValue(const std::string& key)
{
  auto i = dict_.find(key);
  if(i == std::end(dict_)) {
    return nullptr;
  } else {
    auto res = std::move((*i).second);
    dict_.erase(i);
    return res;
  }
}

Dict::ValueType::iterator Dict::begin()
{
  return dict_.begin();
}

Dict::ValueType::iterator Dict::end()
{
  return dict_.end();
}

Dict::ValueType::const_iterator Dict::begin() const
{
  return dict_.begin();
}

Dict::ValueType::const_iterator Dict::end() const
{
  return dict_.end();
}

Dict::ValueType::const_iterator Dict::cbegin() const
{
  return dict_.cbegin();
}

Dict::ValueType::const_iterator Dict::cend() const
{
  return dict_.cend();
}

size_t Dict::size() const
{
  return dict_.size();
}

bool Dict::empty() const
{
  return dict_.empty();
}

std::unique_ptr<Dict> Dict::g()
{
  return make_unique<Dict>();
}

void Dict::accept(ValueBaseVisitor& v) const
{
  v.visit(*this);
}

} // namespace aria2