Electroneum
set.h
Go to the documentation of this file.
1 // Copyright (c) 2014-2017, The Monero Project
2 //
3 // All rights reserved.
4 //
5 // Redistribution and use in source and binary forms, with or without modification, are
6 // permitted provided that the following conditions are met:
7 //
8 // 1. Redistributions of source code must retain the above copyright notice, this list of
9 // conditions and the following disclaimer.
10 //
11 // 2. Redistributions in binary form must reproduce the above copyright notice, this list
12 // of conditions and the following disclaimer in the documentation and/or other
13 // materials provided with the distribution.
14 //
15 // 3. Neither the name of the copyright holder nor the names of its contributors may be
16 // used to endorse or promote products derived from this software without specific
17 // prior written permission.
18 //
19 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
20 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
21 // MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
22 // THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
24 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
25 // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
26 // STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
27 // THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 //
29 // Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers
30 
31 #pragma once
32 
33 #include "serialization.h"
34 
35 template <template <bool> class Archive, class T>
36 bool do_serialize(Archive<false> &ar, std::set<T> &v);
37 template <template <bool> class Archive, class T>
38 bool do_serialize(Archive<true> &ar, std::set<T> &v);
39 template <template <bool> class Archive, class T>
40 bool do_serialize(Archive<false> &ar, std::unordered_set<T> &v);
41 template <template <bool> class Archive, class T>
42 bool do_serialize(Archive<true> &ar, std::unordered_set<T> &v);
43 
44 namespace serialization
45 {
46  namespace detail
47  {
48  template <typename Archive, class T>
49  bool serialize_set_element(Archive& ar, T& e)
50  {
51  return ::do_serialize(ar, e);
52  }
53 
54  template <typename Archive>
55  bool serialize_set_element(Archive& ar, uint32_t& e)
56  {
57  ar.serialize_varint(e);
58  return true;
59  }
60 
61  template <typename Archive>
62  bool serialize_set_element(Archive& ar, uint64_t& e)
63  {
64  ar.serialize_varint(e);
65  return true;
66  }
67  }
68 }
69 
70 template <template <bool> class Archive, class T>
71 bool do_serialize_set(Archive<false> &ar, T &v)
72 {
73  size_t cnt;
74  ar.begin_array(cnt);
75  if (!ar.stream().good())
76  return false;
77  v.clear();
78 
79  // very basic sanity check
80  if (ar.remaining_bytes() < cnt) {
81  ar.stream().setstate(std::ios::failbit);
82  return false;
83  }
84 
85  for (size_t i = 0; i < cnt; i++) {
86  if (i > 0)
87  ar.delimit_array();
88  typename T::key_type k;
90  return false;
91  v.insert(std::move(k));
92  if (!ar.stream().good())
93  return false;
94  }
95  ar.end_array();
96  return true;
97 }
98 
99 template <template <bool> class Archive, class T>
100 bool do_serialize_set(Archive<true> &ar, T &v)
101 {
102  size_t cnt = v.size();
103  ar.begin_array(cnt);
104  bool first = true;
105  for (const typename T::key_type &k: v) {
106  if (!ar.stream().good())
107  return false;
108  if (!first)
109  ar.delimit_array();
110  if(!::serialization::detail::serialize_set_element(ar, const_cast<typename T::key_type&>(k)))
111  return false;
112  if (!ar.stream().good())
113  return false;
114  first = false;
115  }
116  ar.end_array();
117  return true;
118 }
119 
120 template <template <bool> class Archive, class T>
121 bool do_serialize(Archive<false> &ar, std::set<T> &v) { return do_serialize_set(ar, v); }
122 template <template <bool> class Archive, class T>
123 bool do_serialize(Archive<true> &ar, std::set<T> &v) { return do_serialize_set(ar, v); }
124 template <template <bool> class Archive, class T>
125 bool do_serialize(Archive<false> &ar, std::unordered_set<T> &v) { return do_serialize_set(ar, v); }
126 template <template <bool> class Archive, class T>
127 bool do_serialize(Archive<true> &ar, std::unordered_set<T> &v) { return do_serialize_set(ar, v); }
Definition: binary_utils.h:37
const uint32_t T[512]
Definition: groestl_tables.h:34
bool do_serialize(Archive< false > &ar, std::set< T > &v)
Definition: set.h:121
Simple DSL AAPI based on.
declaration and default definition for the functions used the API
bool do_serialize_set(Archive< false > &ar, T &v)
Definition: set.h:71
bool serialize_set_element(Archive &ar, T &e)
Definition: set.h:49