diff --git a/AMMBid_8cpp_source.html b/AMMBid_8cpp_source.html index efad45a434..8ed4cda590 100644 --- a/AMMBid_8cpp_source.html +++ b/AMMBid_8cpp_source.html @@ -475,7 +475,7 @@ $(function() {
ripple::ApplyContext::view
ApplyView & view()
Definition: ApplyContext.h:78
ripple::ApplyContext::journal
beast::Journal const journal
Definition: ApplyContext.h:75
ripple::ApplyContext::tx
STTx const & tx
Definition: ApplyContext.h:72
-
ripple::Expected
Definition: Expected.h:142
+
ripple::Expected
Definition: Expected.h:132
ripple::Issue
A currency issued by an account.
Definition: Issue.h:33
ripple::Number
Definition: Number.h:36
ripple::ReadView::read
virtual std::shared_ptr< SLE const > read(Keylet const &k) const =0
Return the state item associated with a key.
@@ -494,7 +494,7 @@ $(function() {
ripple::Transactor::account_
AccountID const account_
Definition: Transactor.h:143
ripple::Transactor::j_
beast::Journal const j_
Definition: Transactor.h:141
ripple::Transactor::ctx_
ApplyContext & ctx_
Definition: Transactor.h:140
-
ripple::Unexpected
Definition: Expected.h:92
+
ripple::Unexpected
Definition: Expected.h:82
ripple::base_uint< 160, detail::AccountIDTag >
ripple::detail::ApplyViewBase::update
void update(std::shared_ptr< SLE > const &sle) override
Indicate changes to a peeked SLE.
Definition: ApplyViewBase.cpp:145
ripple::detail::ApplyViewBase::read
std::shared_ptr< SLE const > read(Keylet const &k) const override
Return the state item associated with a key.
Definition: ApplyViewBase.cpp:70
diff --git a/AMMInfo_8cpp_source.html b/AMMInfo_8cpp_source.html index 22ec24c12e..61783514ac 100644 --- a/AMMInfo_8cpp_source.html +++ b/AMMInfo_8cpp_source.html @@ -357,11 +357,11 @@ $(function() {
Json::Value::isMember
bool isMember(char const *key) const
Return true if the object has a member named key.
Definition: json_value.cpp:962
beast::Journal
A generic endpoint for log messages.
Definition: Journal.h:60
beast::Journal::debug
Stream debug() const
Definition: Journal.h:328
-
ripple::Expected
Definition: Expected.h:142
+
ripple::Expected
Definition: Expected.h:132
ripple::Issue
A currency issued by an account.
Definition: Issue.h:33
ripple::LedgerMaster::isValidated
bool isValidated(ReadView const &ledger)
Definition: LedgerMaster.cpp:499
ripple::STObject
Definition: STObject.h:57
-
ripple::Unexpected
Definition: Expected.h:92
+
ripple::Unexpected
Definition: Expected.h:82
ripple::base_uint< 160, detail::AccountIDTag >
std::chrono::duration
Json::arrayValue
@ arrayValue
array value (ordered list)
Definition: json_value.h:44
diff --git a/AMMUtils_8cpp_source.html b/AMMUtils_8cpp_source.html index b48efbe331..e2c9fe78e2 100644 --- a/AMMUtils_8cpp_source.html +++ b/AMMUtils_8cpp_source.html @@ -609,7 +609,7 @@ $(function() {
ripple::STObject::setFieldU32
void setFieldU32(SField const &field, std::uint32_t)
Definition: STObject.cpp:741
ripple::STObject::peekAtField
STBase const & peekAtField(SField const &field) const
Definition: STObject.cpp:429
ripple::Sandbox
Discardable, editable view to a ledger.
Definition: Sandbox.h:35
-
ripple::Unexpected
Definition: Expected.h:92
+
ripple::Unexpected
Definition: Expected.h:82
ripple::base_uint< 160, detail::AccountIDTag >
ripple::detail::ApplyViewBase::erase
void erase(std::shared_ptr< SLE > const &sle) override
Remove a peeked SLE.
Definition: ApplyViewBase.cpp:133
ripple::detail::ApplyViewBase::update
void update(std::shared_ptr< SLE > const &sle) override
Indicate changes to a peeked SLE.
Definition: ApplyViewBase.cpp:145
diff --git a/AmendmentTable__test_8cpp_source.html b/AmendmentTable__test_8cpp_source.html index 37a298afaa..496ea33fd1 100644 --- a/AmendmentTable__test_8cpp_source.html +++ b/AmendmentTable__test_8cpp_source.html @@ -1468,7 +1468,7 @@ $(function() {
std::set::insert
T insert(T... args)
std::map
std::memcpy
T memcpy(T... args)
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
ripple::test::jtx::envconfig
std::unique_ptr< Config > envconfig()
creates and initializes a default configuration for jtx::Env
Definition: envconfig.h:54
ripple::test::jtx::testable_amendments
FeatureBitset testable_amendments()
Definition: Env.h:74
ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition: algorithm.h:25
diff --git a/Book_8h_source.html b/Book_8h_source.html index f195f6640d..b6a9bc19db 100644 --- a/Book_8h_source.html +++ b/Book_8h_source.html @@ -281,7 +281,7 @@ $(function() {
ripple::base_uint< 256 >::hasher
hardened_hash<> hasher
Value hashing function.
Definition: base_uint.h:170
ripple::hardened_hash
Seed functor once per construction.
Definition: hardened_hash.h:93
std::hash
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
boost
Definition: IPAddress.h:101
ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition: algorithm.h:25
ripple::hash_append
void hash_append(Hasher &h, Slice const &v)
Definition: Slice.h:199
diff --git a/Expected_8h_source.html b/Expected_8h_source.html index 420fee31ab..1dfc692d3c 100644 --- a/Expected_8h_source.html +++ b/Expected_8h_source.html @@ -100,268 +100,258 @@ $(function() {
22
23#include <xrpl/basics/contract.h>
24
-
25#if defined(__clang__)
-
26#pragma clang diagnostic push
-
27#pragma clang diagnostic ignored "-Wdeprecated"
-
28#pragma clang diagnostic ignored "-Wdeprecated-declarations"
-
29#endif
+
25#include <boost/outcome.hpp>
+
26
+
27#include <stdexcept>
+
28
+
29namespace ripple {
30
-
31#include <boost/outcome.hpp>
-
32
-
33#if defined(__clang__)
-
34#pragma clang diagnostic pop
-
35#endif
-
36
-
37#include <stdexcept>
-
38
-
39namespace ripple {
-
40
-
48// Exception thrown by an invalid access to Expected.
-
49struct bad_expected_access : public std::runtime_error
+
38// Exception thrown by an invalid access to Expected.
+
39struct bad_expected_access : public std::runtime_error
+
40{
+
41 bad_expected_access() : runtime_error("bad expected access")
+
42 {
+
43 }
+
44};
+
45
+
46namespace detail {
+
47
+
48// Custom policy for Expected. Always throw on an invalid access.
+
49struct throw_policy : public boost::outcome_v2::policy::base
50{
-
51 bad_expected_access() : runtime_error("bad expected access")
-
52 {
-
53 }
-
54};
-
55
-
56namespace detail {
-
57
-
58// Custom policy for Expected. Always throw on an invalid access.
-
59struct throw_policy : public boost::outcome_v2::policy::base
-
60{
-
61 template <class Impl>
-
62 static constexpr void
-
63 wide_value_check(Impl&& self)
-
64 {
-
65 if (!base::_has_value(std::forward<Impl>(self)))
-
66 Throw<bad_expected_access>();
-
67 }
-
68
-
69 template <class Impl>
-
70 static constexpr void
-
71 wide_error_check(Impl&& self)
-
72 {
-
73 if (!base::_has_error(std::forward<Impl>(self)))
-
74 Throw<bad_expected_access>();
-
75 }
-
76
-
77 template <class Impl>
-
78 static constexpr void
-
79 wide_exception_check(Impl&& self)
-
80 {
-
81 if (!base::_has_exception(std::forward<Impl>(self)))
-
82 Throw<bad_expected_access>();
-
83 }
-
84};
+
51 template <class Impl>
+
52 static constexpr void
+
53 wide_value_check(Impl&& self)
+
54 {
+
55 if (!base::_has_value(std::forward<Impl>(self)))
+
56 Throw<bad_expected_access>();
+
57 }
+
58
+
59 template <class Impl>
+
60 static constexpr void
+
61 wide_error_check(Impl&& self)
+
62 {
+
63 if (!base::_has_error(std::forward<Impl>(self)))
+
64 Throw<bad_expected_access>();
+
65 }
+
66
+
67 template <class Impl>
+
68 static constexpr void
+
69 wide_exception_check(Impl&& self)
+
70 {
+
71 if (!base::_has_exception(std::forward<Impl>(self)))
+
72 Throw<bad_expected_access>();
+
73 }
+
74};
+
75
+
76} // namespace detail
+
77
+
78// Definition of Unexpected, which is used to construct the unexpected
+
79// return type of an Expected.
+
80template <class E>
+
81class Unexpected
+
82{
+
83public:
+
84 static_assert(!std::is_same<E, void>::value, "E must not be void");
85
-
86} // namespace detail
+
86 Unexpected() = delete;
87
-
88// Definition of Unexpected, which is used to construct the unexpected
-
89// return type of an Expected.
-
90template <class E>
-
91class Unexpected
-
92{
-
93public:
-
94 static_assert(!std::is_same<E, void>::value, "E must not be void");
+
88 constexpr explicit Unexpected(E const& e) : val_(e)
+
89 {
+
90 }
+
91
+
92 constexpr explicit Unexpected(E&& e) : val_(std::move(e))
+
93 {
+
94 }
95
-
96 Unexpected() = delete;
-
97
-
98 constexpr explicit Unexpected(E const& e) : val_(e)
-
99 {
+
96 constexpr E const&
+
97 value() const&
+
98 {
+
99 return val_;
100 }
101
-
102 constexpr explicit Unexpected(E&& e) : val_(std::move(e))
-
103 {
-
104 }
-
105
-
106 constexpr E const&
-
107 value() const&
-
108 {
-
109 return val_;
-
110 }
-
111
-
112 constexpr E&
-
113 value() &
-
114 {
-
115 return val_;
-
116 }
-
117
-
118 constexpr E&&
-
119 value() &&
-
120 {
-
121 return std::move(val_);
-
122 }
+
102 constexpr E&
+
103 value() &
+
104 {
+
105 return val_;
+
106 }
+
107
+
108 constexpr E&&
+
109 value() &&
+
110 {
+
111 return std::move(val_);
+
112 }
+
113
+
114 constexpr E const&&
+
115 value() const&&
+
116 {
+
117 return std::move(val_);
+
118 }
+
119
+
120private:
+
121 E val_;
+
122};
123
-
124 constexpr E const&&
-
125 value() const&&
-
126 {
-
127 return std::move(val_);
-
128 }
-
129
-
130private:
-
131 E val_;
-
132};
-
133
-
134// Unexpected deduction guide that converts array to const*.
-
135template <typename E, std::size_t N>
-
136Unexpected(E (&)[N]) -> Unexpected<E const*>;
-
137
-
138// Definition of Expected. All of the machinery comes from boost::result.
-
139template <class T, class E>
-
140class [[nodiscard]] Expected
-
141 : private boost::outcome_v2::result<T, E, detail::throw_policy>
-
142{
-
143 using Base = boost::outcome_v2::result<T, E, detail::throw_policy>;
-
144
-
145public:
-
146 template <typename U>
-
147 requires std::convertible_to<U, T>
-
148 constexpr Expected(U&& r)
-
149 : Base(boost::outcome_v2::in_place_type_t<T>{}, std::forward<U>(r))
-
150 {
-
151 }
-
152
-
153 template <typename U>
-
154 requires std::convertible_to<U, E> && (!std::is_reference_v<U>)
-
155 constexpr Expected(Unexpected<U> e)
-
156 : Base(boost::outcome_v2::in_place_type_t<E>{}, std::move(e.value()))
-
157 {
-
158 }
-
159
-
160 constexpr bool
-
161 has_value() const
-
162 {
-
163 return Base::has_value();
-
164 }
-
165
-
166 constexpr T const&
-
167 value() const
-
168 {
-
169 return Base::value();
-
170 }
-
171
-
172 constexpr T&
-
173 value()
-
174 {
-
175 return Base::value();
-
176 }
-
177
-
178 constexpr E const&
-
179 error() const
-
180 {
-
181 return Base::error();
-
182 }
-
183
-
184 constexpr E&
-
185 error()
-
186 {
-
187 return Base::error();
-
188 }
-
189
-
190 constexpr explicit
-
191 operator bool() const
-
192 {
-
193 return has_value();
-
194 }
-
195
-
196 // Add operator* and operator-> so the Expected API looks a bit more like
-
197 // what std::expected is likely to look like. See:
-
198 // http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p0323r10.html
-
199 [[nodiscard]] constexpr T&
-
200 operator*()
-
201 {
-
202 return this->value();
-
203 }
-
204
-
205 [[nodiscard]] constexpr T const&
-
206 operator*() const
-
207 {
-
208 return this->value();
-
209 }
-
210
-
211 [[nodiscard]] constexpr T*
-
212 operator->()
-
213 {
-
214 return &this->value();
-
215 }
-
216
-
217 [[nodiscard]] constexpr T const*
-
218 operator->() const
-
219 {
-
220 return &this->value();
-
221 }
-
222};
-
223
-
224// Specialization of Expected<void, E>. Allows returning either success
-
225// (without a value) or the reason for the failure.
-
226template <class E>
-
227class [[nodiscard]] Expected<void, E>
-
228 : private boost::outcome_v2::result<void, E, detail::throw_policy>
-
229{
-
230 using Base = boost::outcome_v2::result<void, E, detail::throw_policy>;
-
231
-
232public:
-
233 // The default constructor makes a successful Expected<void, E>.
-
234 // This aligns with std::expected behavior proposed in P0323R10.
-
235 constexpr Expected() : Base(boost::outcome_v2::success())
-
236 {
-
237 }
-
238
-
239 template <typename U>
-
240 requires std::convertible_to<U, E> && (!std::is_reference_v<U>)
-
241 constexpr Expected(Unexpected<U> e) : Base(E(std::move(e.value())))
-
242 {
-
243 }
-
244
-
245 constexpr E const&
-
246 error() const
-
247 {
-
248 return Base::error();
-
249 }
-
250
-
251 constexpr E&
-
252 error()
-
253 {
-
254 return Base::error();
-
255 }
-
256
-
257 constexpr explicit
-
258 operator bool() const
-
259 {
-
260 return Base::has_value();
-
261 }
-
262};
-
263
-
264} // namespace ripple
-
265
-
266#endif // RIPPLE_BASICS_EXPECTED_H_INCLUDED
-
ripple::Expected< void, E >::error
constexpr E const & error() const
Definition: Expected.h:246
-
ripple::Expected< void, E >::Expected
constexpr Expected(Unexpected< U > e)
Definition: Expected.h:241
-
ripple::Expected< void, E >::error
constexpr E & error()
Definition: Expected.h:252
-
ripple::Expected< void, E >::Base
boost::outcome_v2::result< void, E, detail::throw_policy > Base
Definition: Expected.h:230
-
ripple::Expected< void, E >::Expected
constexpr Expected()
Definition: Expected.h:235
-
ripple::Expected
Definition: Expected.h:142
-
ripple::Expected::operator->
constexpr T const * operator->() const
Definition: Expected.h:218
-
ripple::Expected::value
constexpr T const & value() const
Definition: Expected.h:167
-
ripple::Expected::has_value
constexpr bool has_value() const
Definition: Expected.h:161
-
ripple::Expected::operator*
constexpr T const & operator*() const
Definition: Expected.h:206
-
ripple::Expected::error
constexpr E const & error() const
Definition: Expected.h:179
-
ripple::Expected::value
constexpr T & value()
Definition: Expected.h:173
-
ripple::Expected::Expected
constexpr Expected(Unexpected< U > e)
Definition: Expected.h:155
-
ripple::Expected::Base
boost::outcome_v2::result< T, E, detail::throw_policy > Base
Definition: Expected.h:143
-
ripple::Expected::error
constexpr E & error()
Definition: Expected.h:185
-
ripple::Expected::operator*
constexpr T & operator*()
Definition: Expected.h:200
-
ripple::Expected::Expected
constexpr Expected(U &&r)
Definition: Expected.h:148
-
ripple::Expected::operator->
constexpr T * operator->()
Definition: Expected.h:212
-
ripple::Unexpected
Definition: Expected.h:92
-
ripple::Unexpected::val_
E val_
Definition: Expected.h:131
-
ripple::Unexpected::value
constexpr E && value() &&
Definition: Expected.h:119
-
ripple::Unexpected::Unexpected
constexpr Unexpected(E const &e)
Definition: Expected.h:98
-
ripple::Unexpected::value
constexpr E const && value() const &&
Definition: Expected.h:125
+
124// Unexpected deduction guide that converts array to const*.
+
125template <typename E, std::size_t N>
+
126Unexpected(E (&)[N]) -> Unexpected<E const*>;
+
127
+
128// Definition of Expected. All of the machinery comes from boost::result.
+
129template <class T, class E>
+
130class [[nodiscard]] Expected
+
131 : private boost::outcome_v2::result<T, E, detail::throw_policy>
+
132{
+
133 using Base = boost::outcome_v2::result<T, E, detail::throw_policy>;
+
134
+
135public:
+
136 template <typename U>
+
137 requires std::convertible_to<U, T>
+
138 constexpr Expected(U&& r)
+
139 : Base(boost::outcome_v2::in_place_type_t<T>{}, std::forward<U>(r))
+
140 {
+
141 }
+
142
+
143 template <typename U>
+
144 requires std::convertible_to<U, E> && (!std::is_reference_v<U>)
+
145 constexpr Expected(Unexpected<U> e)
+
146 : Base(boost::outcome_v2::in_place_type_t<E>{}, std::move(e.value()))
+
147 {
+
148 }
+
149
+
150 constexpr bool
+
151 has_value() const
+
152 {
+
153 return Base::has_value();
+
154 }
+
155
+
156 constexpr T const&
+
157 value() const
+
158 {
+
159 return Base::value();
+
160 }
+
161
+
162 constexpr T&
+
163 value()
+
164 {
+
165 return Base::value();
+
166 }
+
167
+
168 constexpr E const&
+
169 error() const
+
170 {
+
171 return Base::error();
+
172 }
+
173
+
174 constexpr E&
+
175 error()
+
176 {
+
177 return Base::error();
+
178 }
+
179
+
180 constexpr explicit
+
181 operator bool() const
+
182 {
+
183 return has_value();
+
184 }
+
185
+
186 // Add operator* and operator-> so the Expected API looks a bit more like
+
187 // what std::expected is likely to look like. See:
+
188 // http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p0323r10.html
+
189 [[nodiscard]] constexpr T&
+
190 operator*()
+
191 {
+
192 return this->value();
+
193 }
+
194
+
195 [[nodiscard]] constexpr T const&
+
196 operator*() const
+
197 {
+
198 return this->value();
+
199 }
+
200
+
201 [[nodiscard]] constexpr T*
+
202 operator->()
+
203 {
+
204 return &this->value();
+
205 }
+
206
+
207 [[nodiscard]] constexpr T const*
+
208 operator->() const
+
209 {
+
210 return &this->value();
+
211 }
+
212};
+
213
+
214// Specialization of Expected<void, E>. Allows returning either success
+
215// (without a value) or the reason for the failure.
+
216template <class E>
+
217class [[nodiscard]] Expected<void, E>
+
218 : private boost::outcome_v2::result<void, E, detail::throw_policy>
+
219{
+
220 using Base = boost::outcome_v2::result<void, E, detail::throw_policy>;
+
221
+
222public:
+
223 // The default constructor makes a successful Expected<void, E>.
+
224 // This aligns with std::expected behavior proposed in P0323R10.
+
225 constexpr Expected() : Base(boost::outcome_v2::success())
+
226 {
+
227 }
+
228
+
229 template <typename U>
+
230 requires std::convertible_to<U, E> && (!std::is_reference_v<U>)
+
231 constexpr Expected(Unexpected<U> e) : Base(E(std::move(e.value())))
+
232 {
+
233 }
+
234
+
235 constexpr E const&
+
236 error() const
+
237 {
+
238 return Base::error();
+
239 }
+
240
+
241 constexpr E&
+
242 error()
+
243 {
+
244 return Base::error();
+
245 }
+
246
+
247 constexpr explicit
+
248 operator bool() const
+
249 {
+
250 return Base::has_value();
+
251 }
+
252};
+
253
+
254} // namespace ripple
+
255
+
256#endif // RIPPLE_BASICS_EXPECTED_H_INCLUDED
+
ripple::Expected< void, E >::error
constexpr E const & error() const
Definition: Expected.h:236
+
ripple::Expected< void, E >::Expected
constexpr Expected(Unexpected< U > e)
Definition: Expected.h:231
+
ripple::Expected< void, E >::error
constexpr E & error()
Definition: Expected.h:242
+
ripple::Expected< void, E >::Base
boost::outcome_v2::result< void, E, detail::throw_policy > Base
Definition: Expected.h:220
+
ripple::Expected< void, E >::Expected
constexpr Expected()
Definition: Expected.h:225
+
ripple::Expected
Definition: Expected.h:132
+
ripple::Expected::operator->
constexpr T const * operator->() const
Definition: Expected.h:208
+
ripple::Expected::value
constexpr T const & value() const
Definition: Expected.h:157
+
ripple::Expected::has_value
constexpr bool has_value() const
Definition: Expected.h:151
+
ripple::Expected::operator*
constexpr T const & operator*() const
Definition: Expected.h:196
+
ripple::Expected::error
constexpr E const & error() const
Definition: Expected.h:169
+
ripple::Expected::value
constexpr T & value()
Definition: Expected.h:163
+
ripple::Expected::Expected
constexpr Expected(Unexpected< U > e)
Definition: Expected.h:145
+
ripple::Expected::Base
boost::outcome_v2::result< T, E, detail::throw_policy > Base
Definition: Expected.h:133
+
ripple::Expected::error
constexpr E & error()
Definition: Expected.h:175
+
ripple::Expected::operator*
constexpr T & operator*()
Definition: Expected.h:190
+
ripple::Expected::Expected
constexpr Expected(U &&r)
Definition: Expected.h:138
+
ripple::Expected::operator->
constexpr T * operator->()
Definition: Expected.h:202
+
ripple::Unexpected
Definition: Expected.h:82
+
ripple::Unexpected::val_
E val_
Definition: Expected.h:121
+
ripple::Unexpected::value
constexpr E && value() &&
Definition: Expected.h:109
+
ripple::Unexpected::Unexpected
constexpr Unexpected(E const &e)
Definition: Expected.h:88
+
ripple::Unexpected::value
constexpr E const && value() const &&
Definition: Expected.h:115
ripple::Unexpected::Unexpected
Unexpected()=delete
-
ripple::Unexpected::value
constexpr E const & value() const &
Definition: Expected.h:107
-
ripple::Unexpected::Unexpected
constexpr Unexpected(E &&e)
Definition: Expected.h:102
-
ripple::Unexpected::value
constexpr E & value() &
Definition: Expected.h:113
+
ripple::Unexpected::value
constexpr E const & value() const &
Definition: Expected.h:97
+
ripple::Unexpected::Unexpected
constexpr Unexpected(E &&e)
Definition: Expected.h:92
+
ripple::Unexpected::value
constexpr E & value() &
Definition: Expected.h:103
std::is_same
boost
Definition: IPAddress.h:101
ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition: algorithm.h:25
@@ -369,12 +359,12 @@ $(function() {
std
STL namespace.
std::runtime_error
stdexcept
-
ripple::bad_expected_access
Expected is an approximation of std::expected (hoped for in C++23)
Definition: Expected.h:50
-
ripple::bad_expected_access::bad_expected_access
bad_expected_access()
Definition: Expected.h:51
-
ripple::detail::throw_policy
Definition: Expected.h:60
-
ripple::detail::throw_policy::wide_exception_check
static constexpr void wide_exception_check(Impl &&self)
Definition: Expected.h:79
-
ripple::detail::throw_policy::wide_value_check
static constexpr void wide_value_check(Impl &&self)
Definition: Expected.h:63
-
ripple::detail::throw_policy::wide_error_check
static constexpr void wide_error_check(Impl &&self)
Definition: Expected.h:71
+
ripple::bad_expected_access
Expected is an approximation of std::expected (hoped for in C++23)
Definition: Expected.h:40
+
ripple::bad_expected_access::bad_expected_access
bad_expected_access()
Definition: Expected.h:41
+
ripple::detail::throw_policy
Definition: Expected.h:50
+
ripple::detail::throw_policy::wide_exception_check
static constexpr void wide_exception_check(Impl &&self)
Definition: Expected.h:69
+
ripple::detail::throw_policy::wide_value_check
static constexpr void wide_value_check(Impl &&self)
Definition: Expected.h:53
+
ripple::detail::throw_policy::wide_error_check
static constexpr void wide_error_check(Impl &&self)
Definition: Expected.h:61
diff --git a/Expected__test_8cpp_source.html b/Expected__test_8cpp_source.html index 5f8abb90d0..baf7ff87cd 100644 --- a/Expected__test_8cpp_source.html +++ b/Expected__test_8cpp_source.html @@ -328,9 +328,9 @@ $(function() {
beast::unit_test::suite
A testsuite class.
Definition: suite.h:55
- + - +
ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition: algorithm.h:25
diff --git a/HashPrefix_8h_source.html b/HashPrefix_8h_source.html index ace6734d7c..7f03d683c7 100644 --- a/HashPrefix_8h_source.html +++ b/HashPrefix_8h_source.html @@ -157,7 +157,7 @@ $(function() {
106#endif
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
ripple::detail::make_hash_prefix
constexpr std::uint32_t make_hash_prefix(char a, char b, char c)
Definition: HashPrefix.h:32
ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition: algorithm.h:25
ripple::hash_append
void hash_append(Hasher &h, Slice const &v)
Definition: Slice.h:199
diff --git a/IPAddress_8h_source.html b/IPAddress_8h_source.html index cce6f319ce..8fb9eefa3b 100644 --- a/IPAddress_8h_source.html +++ b/IPAddress_8h_source.html @@ -194,7 +194,7 @@ $(function() {
beast::IP::is_private
bool is_private(Address const &addr)
Returns true if the address is a private unroutable address.
Definition: IPAddress.h:71
beast::IP::to_string
std::string to_string(Address const &addr)
Returns the address represented as a string.
Definition: IPAddress.h:43
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
diff --git a/Issue_8h_source.html b/Issue_8h_source.html index 4203bee701..748c06e47e 100644 --- a/Issue_8h_source.html +++ b/Issue_8h_source.html @@ -214,7 +214,7 @@ $(function() {
ripple::Issue::setJson
void setJson(Json::Value &jv) const
Definition: Issue.cpp:58
ripple::Issue::Issue
Issue(Currency const &c, AccountID const &a)
Definition: Issue.h:40
ripple::base_uint< 160, detail::CurrencyTag >
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition: algorithm.h:25
ripple::xrpIssue
Issue const & xrpIssue()
Returns an asset specifier that represents XRP.
Definition: Issue.h:115
ripple::noAccount
AccountID const & noAccount()
A placeholder for empty accounts.
Definition: AccountID.cpp:185
diff --git a/MPTokenIssuanceCreate_8cpp_source.html b/MPTokenIssuanceCreate_8cpp_source.html index 2dfaed8e05..382c8d7fea 100644 --- a/MPTokenIssuanceCreate_8cpp_source.html +++ b/MPTokenIssuanceCreate_8cpp_source.html @@ -247,7 +247,7 @@ $(function() {
ripple::ApplyView::insert
virtual void insert(std::shared_ptr< SLE > const &sle)=0
Insert a new state SLE.
ripple::ApplyView::dirInsert
std::optional< std::uint64_t > dirInsert(Keylet const &directory, uint256 const &key, std::function< void(std::shared_ptr< SLE > const &)> const &describe)
Insert an entry to a directory.
Definition: ApplyView.h:318
ripple::ApplyView::peek
virtual std::shared_ptr< SLE > peek(Keylet const &k)=0
Prepare to modify the SLE associated with key.
- +
ripple::MPTokenIssuanceCreate::create
static Expected< MPTID, TER > create(ApplyView &view, beast::Journal journal, MPTCreateArgs const &args)
Definition: MPTokenIssuanceCreate.cpp:86
ripple::MPTokenIssuanceCreate::preflight
static NotTEC preflight(PreflightContext const &ctx)
Definition: MPTokenIssuanceCreate.cpp:29
@@ -262,7 +262,7 @@ $(function() {
ripple::Transactor::j_
beast::Journal const j_
Definition: Transactor.h:141
ripple::Transactor::mPriorBalance
XRPAmount mPriorBalance
Definition: Transactor.h:144
ripple::Transactor::ctx_
ApplyContext & ctx_
Definition: Transactor.h:140
- +
ripple::keylet::mptIssuance
Keylet mptIssuance(std::uint32_t seq, AccountID const &issuer) noexcept
Definition: Indexes.cpp:526
ripple::keylet::account
Keylet account(AccountID const &id) noexcept
AccountID root.
Definition: Indexes.cpp:184
ripple::keylet::ownerDir
Keylet ownerDir(AccountID const &id) noexcept
The root page of an account's directory.
Definition: Indexes.cpp:374
diff --git a/MPTokenIssuanceCreate_8h_source.html b/MPTokenIssuanceCreate_8h_source.html index 42324cedd5..d641aa5cb6 100644 --- a/MPTokenIssuanceCreate_8h_source.html +++ b/MPTokenIssuanceCreate_8h_source.html @@ -143,7 +143,7 @@ $(function() {
beast::Journal
A generic endpoint for log messages.
Definition: Journal.h:60
ripple::ApplyContext
State information when applying a tx.
Definition: ApplyContext.h:37
ripple::ApplyView
Writeable view to a ledger, for applying a transaction.
Definition: ApplyView.h:144
- +
ripple::MPTokenIssuanceCreate::ConsequencesFactory
static constexpr ConsequencesFactoryType ConsequencesFactory
Definition: MPTokenIssuanceCreate.h:46
ripple::MPTokenIssuanceCreate::MPTokenIssuanceCreate
MPTokenIssuanceCreate(ApplyContext &ctx)
Definition: MPTokenIssuanceCreate.h:48
diff --git a/NFTokenMint_8cpp_source.html b/NFTokenMint_8cpp_source.html index 5c1dff97e0..3eeeb82a91 100644 --- a/NFTokenMint_8cpp_source.html +++ b/NFTokenMint_8cpp_source.html @@ -442,7 +442,7 @@ $(function() {
ripple::ApplyView::update
virtual void update(std::shared_ptr< SLE > const &sle)=0
Indicate changes to a peeked SLE.
ripple::ApplyView::peek
virtual std::shared_ptr< SLE > peek(Keylet const &k)=0
Prepare to modify the SLE associated with key.
- +
ripple::InnerObjectFormats::findSOTemplateBySField
SOTemplate const * findSOTemplateBySField(SField const &sField) const
Definition: InnerObjectFormats.cpp:185
ripple::InnerObjectFormats::getInstance
static InnerObjectFormats const & getInstance()
Definition: InnerObjectFormats.cpp:178
ripple::NFTokenMint::preflight
static NotTEC preflight(PreflightContext const &ctx)
Definition: NFTokenMint.cpp:42
@@ -465,7 +465,7 @@ $(function() {
ripple::Transactor::j_
beast::Journal const j_
Definition: Transactor.h:141
ripple::Transactor::mPriorBalance
XRPAmount mPriorBalance
Definition: Transactor.h:144
ripple::Transactor::ctx_
ApplyContext & ctx_
Definition: Transactor.h:140
- +
ripple::base_uint< 256 >
ripple::base_uint< 256 >::fromVoid
static base_uint fromVoid(void const *data)
Definition: base_uint.h:319
ripple::base_uint::data
pointer data()
Definition: base_uint.h:125
diff --git a/PeerReservationTable_8h_source.html b/PeerReservationTable_8h_source.html index c26e958104..9ffbed9d51 100644 --- a/PeerReservationTable_8h_source.html +++ b/PeerReservationTable_8h_source.html @@ -209,7 +209,7 @@ $(function() {
Json
JSON (JavaScript Object Notation).
Definition: json_errors.h:25
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition: algorithm.h:25
diff --git a/RCLCxPeerPos_8h_source.html b/RCLCxPeerPos_8h_source.html index 143363f1bd..8b55f9375f 100644 --- a/RCLCxPeerPos_8h_source.html +++ b/RCLCxPeerPos_8h_source.html @@ -216,7 +216,7 @@ $(function() {
ripple::base_uint< 256 >
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition: algorithm.h:25
ripple::proposalUniqueId
uint256 proposalUniqueId(uint256 const &proposeHash, uint256 const &previousLedger, std::uint32_t proposeSeq, NetClock::time_point closeTime, Slice const &publicKey, Slice const &signature)
Calculate a unique identifier for a signed proposal.
Definition: RCLCxPeerPos.cpp:66
ripple::uint256
base_uint< 256 > uint256
Definition: base_uint.h:558
diff --git a/SHAMapInnerNode_8cpp_source.html b/SHAMapInnerNode_8cpp_source.html index a487f8f895..f390617a3a 100644 --- a/SHAMapInnerNode_8cpp_source.html +++ b/SHAMapInnerNode_8cpp_source.html @@ -630,7 +630,7 @@ $(function() {
ripple::SHAMapTreeNode::cowid
std::uint32_t cowid() const
Returns the SHAMap that owns this node.
Definition: SHAMapTreeNode.h:118
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition: algorithm.h:25
ripple::hash_append
void hash_append(Hasher &h, Slice const &v)
Definition: Slice.h:199
ripple::wireTypeCompressedInner
static constexpr unsigned char const wireTypeCompressedInner
Definition: SHAMapTreeNode.h:41
diff --git a/STTx_8cpp_source.html b/STTx_8cpp_source.html index e24f815f13..4460ec8424 100644 --- a/STTx_8cpp_source.html +++ b/STTx_8cpp_source.html @@ -897,7 +897,7 @@ $(function() {
Json::Value
Represents a JSON value.
Definition: json_value.h:149
- +
ripple::KnownFormats::findByType
Item const * findByType(KeyType type) const
Retrieve a format based on its type.
Definition: KnownFormats.h:129
ripple::PublicKey
A public key.
Definition: PublicKey.h:61
@@ -980,7 +980,7 @@ $(function() {
ripple::Serializer::getDataLength
int getDataLength() const
Definition: Serializer.h:218
ripple::Slice
An immutable linear range of bytes.
Definition: Slice.h:46
ripple::TxFormats::getInstance
static TxFormats const & getInstance()
Definition: TxFormats.cpp:70
- +
ripple::base_uint< 160, detail::AccountIDTag >
diff --git a/STTx_8h_source.html b/STTx_8h_source.html index c9543b9fab..e481fbf036 100644 --- a/STTx_8h_source.html +++ b/STTx_8h_source.html @@ -287,7 +287,7 @@ $(function() {
Json::Value
Represents a JSON value.
Definition: json_value.h:149
ripple::CountedObject
Tracks the number of instances of an object.
Definition: CountedObject.h:126
- +
ripple::PublicKey
A public key.
Definition: PublicKey.h:61
ripple::Rules
Rules controlling protocol behavior.
Definition: Rules.h:38
ripple::STBase
A type which can be exported to a well known binary format.
Definition: STBase.h:135
diff --git a/SignerEntries_8cpp_source.html b/SignerEntries_8cpp_source.html index 3e072bd338..a8eaae384b 100644 --- a/SignerEntries_8cpp_source.html +++ b/SignerEntries_8cpp_source.html @@ -156,7 +156,7 @@ $(function() {
ripple::STTx::maxMultiSigners
static std::size_t maxMultiSigners(Rules const *rules=0)
Definition: STTx.h:57
ripple::SignerEntries::deserialize
static Expected< std::vector< SignerEntry >, NotTEC > deserialize(STObject const &obj, beast::Journal journal, std::string_view annotation)
Definition: SignerEntries.cpp:32
- +
ripple::base_uint< 160, detail::AccountIDTag >
std::vector::emplace_back
T emplace_back(T... args)
diff --git a/SignerEntries_8h_source.html b/SignerEntries_8h_source.html index 0d7840a05c..71adfd14f8 100644 --- a/SignerEntries_8h_source.html +++ b/SignerEntries_8h_source.html @@ -171,7 +171,7 @@ $(function() {
93#endif // RIPPLE_TX_IMPL_SIGNER_ENTRIES_H_INCLUDED
beast::Journal
A generic endpoint for log messages.
Definition: Journal.h:60
- +
ripple::SignerEntries::deserialize
static Expected< std::vector< SignerEntry >, NotTEC > deserialize(STObject const &obj, beast::Journal journal, std::string_view annotation)
Definition: SignerEntries.cpp:32
diff --git a/Simulate_8cpp_source.html b/Simulate_8cpp_source.html index a58fe9d8ea..3760ab7fe4 100644 --- a/Simulate_8cpp_source.html +++ b/Simulate_8cpp_source.html @@ -471,7 +471,7 @@ $(function() {
ripple::TxQ::nextQueuableSeq
SeqProxy nextQueuableSeq(std::shared_ptr< SLE const > const &sleAccount) const
Return the next sequence that would go in the TxQ for an account.
Definition: TxQ.cpp:1609
ripple::TxQ::apply
ApplyResult apply(Application &app, OpenView &view, std::shared_ptr< STTx const > const &tx, ApplyFlags flags, beast::Journal j)
Add a new transaction to the open ledger, hold it in the queue, or reject it.
Definition: TxQ.cpp:730
- +
Json::objectValue
@ objectValue
object value (collection of name/value pairs).
Definition: json_value.h:45
ripple::RPC::make_error
Json::Value make_error(error_code_i code)
Returns a new json object that reflects the error code.
Definition: ErrorCodes.cpp:188
diff --git a/Tx_8h_source.html b/Tx_8h_source.html index 7c6877d6a5..93eba797cd 100644 --- a/Tx_8h_source.html +++ b/Tx_8h_source.html @@ -332,7 +332,7 @@ $(function() {
ripple::test::csf::Tx::Tx
Tx(T const *t)
Definition: Tx.h:51
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
ripple::test::csf::operator<<
std::ostream & operator<<(std::ostream &o, Tx const &t)
Definition: Tx.h:191
ripple::test::csf::TxSetType
boost::container::flat_set< Tx > TxSetType
Definition: Tx.h:79
ripple::test::csf::to_string
std::string to_string(TxSetType const &txs)
Definition: Tx.h:215
diff --git a/ValidatorList_8h_source.html b/ValidatorList_8h_source.html index db4dab6841..2d83a82296 100644 --- a/ValidatorList_8h_source.html +++ b/ValidatorList_8h_source.html @@ -746,7 +746,7 @@ $(function() { -
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
protocol::hash_append
void hash_append(Hasher &h, TMValidatorList const &msg)
Definition: ValidatorList.h:955
ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition: algorithm.h:25
diff --git a/View_8cpp_source.html b/View_8cpp_source.html index 1c8e399dfb..fb308118b3 100644 --- a/View_8cpp_source.html +++ b/View_8cpp_source.html @@ -3243,7 +3243,7 @@ $(function() {
ripple::STVector256::size
std::size_t size() const
Definition: STVector256.h:168
- +
ripple::base_uint< 256 >
diff --git a/XChainBridge_8cpp_source.html b/XChainBridge_8cpp_source.html index c57048e50f..5919b60e5e 100644 --- a/XChainBridge_8cpp_source.html +++ b/XChainBridge_8cpp_source.html @@ -2303,7 +2303,7 @@ $(function() {
ripple::BridgeModify::preclaim
static TER preclaim(PreclaimContext const &ctx)
Definition: XChainBridge.cpp:1614
ripple::BridgeModify::preflight
static NotTEC preflight(PreflightContext const &ctx)
Definition: XChainBridge.cpp:1561
ripple::BridgeModify::doApply
TER doApply() override
Definition: XChainBridge.cpp:1631
- +
ripple::Number::getround
static rounding_mode getround()
Definition: Number.cpp:47
ripple::Number::setround
static rounding_mode setround(rounding_mode mode)
Definition: Number.cpp:53
@@ -2337,7 +2337,7 @@ $(function() {
ripple::Transactor::mSourceBalance
XRPAmount mSourceBalance
Definition: Transactor.h:145
ripple::Transactor::ctx_
ApplyContext & ctx_
Definition: Transactor.h:140
ripple::TxConsequences
Class describing the consequences to the account of applying a transaction if the transaction consume...
Definition: applySteps.h:59
- +
ripple::XChainAddAccountCreateAttestation::preclaim
static TER preclaim(PreclaimContext const &ctx)
Definition: XChainBridge.cpp:2164
ripple::XChainAddAccountCreateAttestation::preflight
static NotTEC preflight(PreflightContext const &ctx)
Definition: XChainBridge.cpp:2158
diff --git a/base__uint_8h_source.html b/base__uint_8h_source.html index ed4b9e03ae..858b0a2374 100644 --- a/base__uint_8h_source.html +++ b/base__uint_8h_source.html @@ -725,9 +725,9 @@ $(function() {
std::string_view::begin
T begin(T... args)
ripple::Dir::const_iterator
Definition: Dir.h:63
- +
ripple::Slice
An immutable linear range of bytes.
Definition: Slice.h:46
- +
ripple::base_uint
Integers of any length that is a multiple of 32-bits.
Definition: base_uint.h:86
ripple::base_uint::next
base_uint next() const
Definition: base_uint.h:455
ripple::base_uint::operator^=
base_uint & operator^=(base_uint const &b)
Definition: base_uint.h:377
@@ -824,7 +824,7 @@ $(function() {
beast::Zero
Zero allows classes to offer efficient comparisons to zero.
Definition: Zero.h:43
beast::is_uniquely_represented< ripple::base_uint< Bits, Tag > >::is_uniquely_represented
is_uniquely_represented()=default
-
beast::is_uniquely_represented
Definition: hash_append.h:123
+
beast::is_uniquely_represented
Definition: hash_append.h:98
ripple::base_uint::VoidHelper
Construct from a raw pointer.
Definition: base_uint.h:183
ripple::base_uint::VoidHelper::VoidHelper
VoidHelper()=default
ripple::detail::is_contiguous_container
Definition: base_uint.h:51
diff --git a/classripple_1_1Expected.html b/classripple_1_1Expected.html index 643f11da4c..bfd6177ed6 100644 --- a/classripple_1_1Expected.html +++ b/classripple_1_1Expected.html @@ -140,7 +140,7 @@ Private Types

Detailed Description

template<class T, class E>
class ripple::Expected< T, E >
-

Definition at line 140 of file Expected.h.

+

Definition at line 130 of file Expected.h.

Member Typedef Documentation

◆ Base

@@ -164,7 +164,7 @@ template<class T , class E >
-

Definition at line 143 of file Expected.h.

+

Definition at line 133 of file Expected.h.

@@ -198,7 +198,7 @@ requires std::convertible_to<U, T>
-

Definition at line 148 of file Expected.h.

+

Definition at line 138 of file Expected.h.

@@ -231,7 +231,7 @@ requires std::convertible_to<U, E> && (! -

Definition at line 155 of file Expected.h.

+

Definition at line 145 of file Expected.h.

@@ -261,7 +261,7 @@ template<class T , class E >
-

Definition at line 161 of file Expected.h.

+

Definition at line 151 of file Expected.h.

@@ -290,7 +290,7 @@ template<class T , class E >
-

Definition at line 167 of file Expected.h.

+

Definition at line 157 of file Expected.h.

@@ -319,7 +319,7 @@ template<class T , class E >
-

Definition at line 173 of file Expected.h.

+

Definition at line 163 of file Expected.h.

@@ -348,7 +348,7 @@ template<class T , class E >
-

Definition at line 179 of file Expected.h.

+

Definition at line 169 of file Expected.h.

@@ -377,7 +377,7 @@ template<class T , class E >
-

Definition at line 185 of file Expected.h.

+

Definition at line 175 of file Expected.h.

@@ -406,7 +406,7 @@ template<class T , class E >
-

Definition at line 191 of file Expected.h.

+

Definition at line 181 of file Expected.h.

@@ -435,7 +435,7 @@ template<class T , class E >
-

Definition at line 200 of file Expected.h.

+

Definition at line 190 of file Expected.h.

@@ -464,7 +464,7 @@ template<class T , class E >
-

Definition at line 206 of file Expected.h.

+

Definition at line 196 of file Expected.h.

@@ -493,7 +493,7 @@ template<class T , class E >
-

Definition at line 212 of file Expected.h.

+

Definition at line 202 of file Expected.h.

@@ -522,7 +522,7 @@ template<class T , class E >
-

Definition at line 218 of file Expected.h.

+

Definition at line 208 of file Expected.h.

diff --git a/classripple_1_1Expected_3_01void_00_01E_01_4.html b/classripple_1_1Expected_3_01void_00_01E_01_4.html index e3dbf771f5..dc176ea9fb 100644 --- a/classripple_1_1Expected_3_01void_00_01E_01_4.html +++ b/classripple_1_1Expected_3_01void_00_01E_01_4.html @@ -124,7 +124,7 @@ Private Types

Detailed Description

template<class E>
class ripple::Expected< void, E >
-

Definition at line 227 of file Expected.h.

+

Definition at line 217 of file Expected.h.

Member Typedef Documentation

◆ Base

@@ -148,7 +148,7 @@ template<class E >
-

Definition at line 230 of file Expected.h.

+

Definition at line 220 of file Expected.h.

@@ -178,7 +178,7 @@ template<class E >
-

Definition at line 235 of file Expected.h.

+

Definition at line 225 of file Expected.h.

@@ -211,7 +211,7 @@ requires std::convertible_to<U, E> && (! -

Definition at line 241 of file Expected.h.

+

Definition at line 231 of file Expected.h.

@@ -241,7 +241,7 @@ template<class E >
-

Definition at line 246 of file Expected.h.

+

Definition at line 236 of file Expected.h.

@@ -270,7 +270,7 @@ template<class E >
-

Definition at line 252 of file Expected.h.

+

Definition at line 242 of file Expected.h.

@@ -299,7 +299,7 @@ template<class E >
-

Definition at line 258 of file Expected.h.

+

Definition at line 248 of file Expected.h.

diff --git a/classripple_1_1Unexpected.html b/classripple_1_1Unexpected.html index 09227146ed..11d021fad2 100644 --- a/classripple_1_1Unexpected.html +++ b/classripple_1_1Unexpected.html @@ -108,7 +108,7 @@ Private Attributes

Detailed Description

template<class E>
class ripple::Unexpected< E >
-

Definition at line 91 of file Expected.h.

+

Definition at line 81 of file Expected.h.

Constructor & Destructor Documentation

◆ Unexpected() [1/3]

@@ -163,7 +163,7 @@ template<class E >
-

Definition at line 98 of file Expected.h.

+

Definition at line 88 of file Expected.h.

@@ -193,7 +193,7 @@ template<class E >
-

Definition at line 102 of file Expected.h.

+

Definition at line 92 of file Expected.h.

@@ -223,7 +223,7 @@ template<class E >
-

Definition at line 107 of file Expected.h.

+

Definition at line 97 of file Expected.h.

@@ -252,7 +252,7 @@ template<class E >
-

Definition at line 113 of file Expected.h.

+

Definition at line 103 of file Expected.h.

@@ -281,7 +281,7 @@ template<class E >
-

Definition at line 119 of file Expected.h.

+

Definition at line 109 of file Expected.h.

@@ -310,7 +310,7 @@ template<class E >
-

Definition at line 125 of file Expected.h.

+

Definition at line 115 of file Expected.h.

@@ -337,7 +337,7 @@ template<class E >
-

Definition at line 131 of file Expected.h.

+

Definition at line 121 of file Expected.h.

diff --git a/classripple_1_1hardened__hash.html b/classripple_1_1hardened__hash.html index a440639676..ff2b723caf 100644 --- a/classripple_1_1hardened__hash.html +++ b/classripple_1_1hardened__hash.html @@ -141,7 +141,7 @@ class ripple::hardened_hash< HashAlgorithm >

hash_append (h, t.member2);

// ...
}
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
ripple::hash_append
void hash_append(Hasher &h, Slice const &v)
Definition: Slice.h:199

Do not use any version of Murmur or CityHash for the Hasher template parameter (the hashing algorithm). For details see https://131002.net/siphash/#at

diff --git a/digest_8h_source.html b/digest_8h_source.html index aeb23dd014..df5b4b2b1b 100644 --- a/digest_8h_source.html +++ b/digest_8h_source.html @@ -281,7 +281,7 @@ $(function() {
ripple::base_uint< 256 >
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition: algorithm.h:25
ripple::sha512Half_s
sha512_half_hasher_s::result_type sha512Half_s(Args const &... args)
Returns the SHA512-Half of a series of objects.
Definition: digest.h:240
ripple::hash_append
void hash_append(Hasher &h, Slice const &v)
Definition: Slice.h:199
diff --git a/hardened__hash__test_8cpp_source.html b/hardened__hash__test_8cpp_source.html index c9fd8ed532..048699df42 100644 --- a/hardened__hash__test_8cpp_source.html +++ b/hardened__hash__test_8cpp_source.html @@ -371,7 +371,7 @@ $(function() { -
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition: algorithm.h:25
std::setfill
T setfill(T... args)
std::setw
T setw(T... args)
diff --git a/hash__append_8h_source.html b/hash__append_8h_source.html index ab4c4f3ae5..929f1104f1 100644 --- a/hash__append_8h_source.html +++ b/hash__append_8h_source.html @@ -102,467 +102,442 @@ $(function() {
24#include <boost/container/flat_set.hpp>
25#include <boost/endian/conversion.hpp>
26
-
27/*
-
28
-
29Workaround for overzealous clang warning, which trips on libstdc++ headers
-
30
-
31 In file included from
-
32 /usr/lib/gcc/x86_64-linux-gnu/12/../../../../include/c++/12/bits/stl_algo.h:61:
-
33 /usr/lib/gcc/x86_64-linux-gnu/12/../../../../include/c++/12/bits/stl_tempbuf.h:263:8:
-
34 error: 'get_temporary_buffer<std::pair<ripple::Quality, const
-
35 std::vector<std::unique_ptr<ripple::Step>> *>>' is deprecated
-
36 [-Werror,-Wdeprecated-declarations] 263 |
-
37 std::get_temporary_buffer<value_type>(_M_original_len));
-
38 ^
-
39*/
+
27#include <array>
+
28#include <chrono>
+
29#include <cstring>
+
30#include <functional>
+
31#include <memory>
+
32#include <string>
+
33#include <system_error>
+
34#include <tuple>
+
35#include <type_traits>
+
36#include <unordered_map>
+
37#include <unordered_set>
+
38#include <utility>
+
39#include <vector>
40
-
41#if defined(__clang__)
-
42#pragma clang diagnostic push
-
43#pragma clang diagnostic ignored "-Wdeprecated"
-
44#pragma clang diagnostic ignored "-Wdeprecated-declarations"
-
45#endif
-
46
-
47#include <functional>
-
48
-
49#if defined(__clang__)
-
50#pragma clang diagnostic pop
-
51#endif
-
52
-
53#include <array>
-
54#include <chrono>
-
55#include <cstring>
-
56#include <memory>
-
57#include <string>
-
58#include <system_error>
-
59#include <tuple>
-
60#include <type_traits>
-
61#include <unordered_map>
-
62#include <unordered_set>
-
63#include <utility>
-
64#include <vector>
-
65
-
66namespace beast {
-
67
-
68namespace detail {
-
69
-
70template <class T>
-
71/*constexpr*/
-
72inline void
-
73reverse_bytes(T& t)
-
74{
-
75 unsigned char* bytes = static_cast<unsigned char*>(
-
76 std::memmove(std::addressof(t), std::addressof(t), sizeof(T)));
-
77 for (unsigned i = 0; i < sizeof(T) / 2; ++i)
-
78 std::swap(bytes[i], bytes[sizeof(T) - 1 - i]);
-
79}
-
80
-
81template <class T>
-
82/*constexpr*/
-
83inline void
-
84maybe_reverse_bytes(T& t, std::false_type)
-
85{
-
86}
-
87
-
88template <class T>
-
89/*constexpr*/
-
90inline void
-
91maybe_reverse_bytes(T& t, std::true_type)
-
92{
-
93 reverse_bytes(t);
-
94}
-
95
-
96template <class T, class Hasher>
-
97/*constexpr*/
-
98inline void
-
99maybe_reverse_bytes(T& t, Hasher&)
-
100{
-
101 maybe_reverse_bytes(
-
102 t,
-
103 std::integral_constant<
-
104 bool,
-
105 Hasher::endian != boost::endian::order::native>{});
-
106}
+
41namespace beast {
+
42
+
43namespace detail {
+
44
+
45template <class T>
+
46/*constexpr*/
+
47inline void
+
48reverse_bytes(T& t)
+
49{
+
50 unsigned char* bytes = static_cast<unsigned char*>(
+
51 std::memmove(std::addressof(t), std::addressof(t), sizeof(T)));
+
52 for (unsigned i = 0; i < sizeof(T) / 2; ++i)
+
53 std::swap(bytes[i], bytes[sizeof(T) - 1 - i]);
+
54}
+
55
+
56template <class T>
+
57/*constexpr*/
+
58inline void
+
59maybe_reverse_bytes(T& t, std::false_type)
+
60{
+
61}
+
62
+
63template <class T>
+
64/*constexpr*/
+
65inline void
+
66maybe_reverse_bytes(T& t, std::true_type)
+
67{
+
68 reverse_bytes(t);
+
69}
+
70
+
71template <class T, class Hasher>
+
72/*constexpr*/
+
73inline void
+
74maybe_reverse_bytes(T& t, Hasher&)
+
75{
+
76 maybe_reverse_bytes(
+
77 t,
+
78 std::integral_constant<
+
79 bool,
+
80 Hasher::endian != boost::endian::order::native>{});
+
81}
+
82
+
83} // namespace detail
+
84
+
85// is_uniquely_represented<T>
+
86
+
87// A type T is contiguously hashable if for all combinations of two values of
+
88// a type, say x and y, if x == y, then it must also be true that
+
89// memcmp(addressof(x), addressof(y), sizeof(T)) == 0. I.e. if x == y,
+
90// then x and y have the same bit pattern representation.
+
91
+
92template <class T>
+
93struct is_uniquely_represented
+
94 : public std::integral_constant<
+
95 bool,
+
96 std::is_integral<T>::value || std::is_enum<T>::value ||
+
97 std::is_pointer<T>::value>
+
98{
+
99 explicit is_uniquely_represented() = default;
+
100};
+
101
+
102template <class T>
+
103struct is_uniquely_represented<T const> : public is_uniquely_represented<T>
+
104{
+
105 explicit is_uniquely_represented() = default;
+
106};
107
-
108} // namespace detail
-
109
-
110// is_uniquely_represented<T>
-
111
-
112// A type T is contiguously hashable if for all combinations of two values of
-
113// a type, say x and y, if x == y, then it must also be true that
-
114// memcmp(addressof(x), addressof(y), sizeof(T)) == 0. I.e. if x == y,
-
115// then x and y have the same bit pattern representation.
-
116
-
117template <class T>
-
118struct is_uniquely_represented
-
119 : public std::integral_constant<
-
120 bool,
-
121 std::is_integral<T>::value || std::is_enum<T>::value ||
-
122 std::is_pointer<T>::value>
-
123{
-
124 explicit is_uniquely_represented() = default;
-
125};
-
126
-
127template <class T>
-
128struct is_uniquely_represented<T const> : public is_uniquely_represented<T>
-
129{
-
130 explicit is_uniquely_represented() = default;
-
131};
-
132
-
133template <class T>
-
134struct is_uniquely_represented<T volatile> : public is_uniquely_represented<T>
-
135{
-
136 explicit is_uniquely_represented() = default;
-
137};
-
138
-
139template <class T>
-
140struct is_uniquely_represented<T const volatile>
-
141 : public is_uniquely_represented<T>
+
108template <class T>
+
109struct is_uniquely_represented<T volatile> : public is_uniquely_represented<T>
+
110{
+
111 explicit is_uniquely_represented() = default;
+
112};
+
113
+
114template <class T>
+
115struct is_uniquely_represented<T const volatile>
+
116 : public is_uniquely_represented<T>
+
117{
+
118 explicit is_uniquely_represented() = default;
+
119};
+
120
+
121// is_uniquely_represented<std::pair<T, U>>
+
122
+
123template <class T, class U>
+
124struct is_uniquely_represented<std::pair<T, U>>
+
125 : public std::integral_constant<
+
126 bool,
+
127 is_uniquely_represented<T>::value &&
+
128 is_uniquely_represented<U>::value &&
+
129 sizeof(T) + sizeof(U) == sizeof(std::pair<T, U>)>
+
130{
+
131 explicit is_uniquely_represented() = default;
+
132};
+
133
+
134// is_uniquely_represented<std::tuple<T...>>
+
135
+
136template <class... T>
+
137struct is_uniquely_represented<std::tuple<T...>>
+
138 : public std::integral_constant<
+
139 bool,
+
140 std::conjunction_v<is_uniquely_represented<T>...> &&
+
141 sizeof(std::tuple<T...>) == (sizeof(T) + ...)>
142{
-
143 explicit is_uniquely_represented() = default;
+
143 explicit is_uniquely_represented() = default;
144};
145
-
146// is_uniquely_represented<std::pair<T, U>>
+
146// is_uniquely_represented<T[N]>
147
-
148template <class T, class U>
-
149struct is_uniquely_represented<std::pair<T, U>>
-
150 : public std::integral_constant<
-
151 bool,
-
152 is_uniquely_represented<T>::value &&
-
153 is_uniquely_represented<U>::value &&
-
154 sizeof(T) + sizeof(U) == sizeof(std::pair<T, U>)>
-
155{
-
156 explicit is_uniquely_represented() = default;
-
157};
-
158
-
159// is_uniquely_represented<std::tuple<T...>>
-
160
-
161template <class... T>
-
162struct is_uniquely_represented<std::tuple<T...>>
-
163 : public std::integral_constant<
-
164 bool,
-
165 std::conjunction_v<is_uniquely_represented<T>...> &&
-
166 sizeof(std::tuple<T...>) == (sizeof(T) + ...)>
-
167{
-
168 explicit is_uniquely_represented() = default;
-
169};
-
170
-
171// is_uniquely_represented<T[N]>
-
172
-
173template <class T, std::size_t N>
-
174struct is_uniquely_represented<T[N]> : public is_uniquely_represented<T>
-
175{
-
176 explicit is_uniquely_represented() = default;
-
177};
-
178
-
179// is_uniquely_represented<std::array<T, N>>
-
180
-
181template <class T, std::size_t N>
-
182struct is_uniquely_represented<std::array<T, N>>
-
183 : public std::integral_constant<
-
184 bool,
-
185 is_uniquely_represented<T>::value &&
-
186 sizeof(T) * N == sizeof(std::array<T, N>)>
+
148template <class T, std::size_t N>
+
149struct is_uniquely_represented<T[N]> : public is_uniquely_represented<T>
+
150{
+
151 explicit is_uniquely_represented() = default;
+
152};
+
153
+
154// is_uniquely_represented<std::array<T, N>>
+
155
+
156template <class T, std::size_t N>
+
157struct is_uniquely_represented<std::array<T, N>>
+
158 : public std::integral_constant<
+
159 bool,
+
160 is_uniquely_represented<T>::value &&
+
161 sizeof(T) * N == sizeof(std::array<T, N>)>
+
162{
+
163 explicit is_uniquely_represented() = default;
+
164};
+
165
+
180template <class T, class HashAlgorithm>
+
181struct is_contiguously_hashable
+
182 : public std::integral_constant<
+
183 bool,
+
184 is_uniquely_represented<T>::value &&
+
185 (sizeof(T) == 1 ||
+
186 HashAlgorithm::endian == boost::endian::order::native)>
187{
-
188 explicit is_uniquely_represented() = default;
+
188 explicit is_contiguously_hashable() = default;
189};
190
-
205template <class T, class HashAlgorithm>
-
206struct is_contiguously_hashable
-
207 : public std::integral_constant<
-
208 bool,
-
209 is_uniquely_represented<T>::value &&
-
210 (sizeof(T) == 1 ||
-
211 HashAlgorithm::endian == boost::endian::order::native)>
-
212{
-
213 explicit is_contiguously_hashable() = default;
-
214};
-
215
-
216template <class T, std::size_t N, class HashAlgorithm>
-
217struct is_contiguously_hashable<T[N], HashAlgorithm>
-
218 : public std::integral_constant<
-
219 bool,
-
220 is_uniquely_represented<T[N]>::value &&
-
221 (sizeof(T) == 1 ||
-
222 HashAlgorithm::endian == boost::endian::order::native)>
-
223{
-
224 explicit is_contiguously_hashable() = default;
-
225};
-
228//------------------------------------------------------------------------------
-
229
-
255// scalars
-
256
-
257template <class Hasher, class T>
-
258inline std::enable_if_t<is_contiguously_hashable<T, Hasher>::value>
-
259hash_append(Hasher& h, T const& t) noexcept
-
260{
-
261 h(std::addressof(t), sizeof(t));
-
262}
-
263
-
264template <class Hasher, class T>
-
265inline std::enable_if_t<
-
266 !is_contiguously_hashable<T, Hasher>::value &&
-
267 (std::is_integral<T>::value || std::is_pointer<T>::value ||
-
268 std::is_enum<T>::value)>
-
269hash_append(Hasher& h, T t) noexcept
-
270{
-
271 detail::reverse_bytes(t);
-
272 h(std::addressof(t), sizeof(t));
-
273}
+
191template <class T, std::size_t N, class HashAlgorithm>
+
192struct is_contiguously_hashable<T[N], HashAlgorithm>
+
193 : public std::integral_constant<
+
194 bool,
+
195 is_uniquely_represented<T[N]>::value &&
+
196 (sizeof(T) == 1 ||
+
197 HashAlgorithm::endian == boost::endian::order::native)>
+
198{
+
199 explicit is_contiguously_hashable() = default;
+
200};
+
203//------------------------------------------------------------------------------
+
204
+
230// scalars
+
231
+
232template <class Hasher, class T>
+
233inline std::enable_if_t<is_contiguously_hashable<T, Hasher>::value>
+
234hash_append(Hasher& h, T const& t) noexcept
+
235{
+
236 h(std::addressof(t), sizeof(t));
+
237}
+
238
+
239template <class Hasher, class T>
+
240inline std::enable_if_t<
+
241 !is_contiguously_hashable<T, Hasher>::value &&
+
242 (std::is_integral<T>::value || std::is_pointer<T>::value ||
+
243 std::is_enum<T>::value)>
+
244hash_append(Hasher& h, T t) noexcept
+
245{
+
246 detail::reverse_bytes(t);
+
247 h(std::addressof(t), sizeof(t));
+
248}
+
249
+
250template <class Hasher, class T>
+
251inline std::enable_if_t<std::is_floating_point<T>::value>
+
252hash_append(Hasher& h, T t) noexcept
+
253{
+
254 if (t == 0)
+
255 t = 0;
+
256 detail::maybe_reverse_bytes(t, h);
+
257 h(&t, sizeof(t));
+
258}
+
259
+
260template <class Hasher>
+
261inline void
+
262hash_append(Hasher& h, std::nullptr_t) noexcept
+
263{
+
264 void const* p = nullptr;
+
265 detail::maybe_reverse_bytes(p, h);
+
266 h(&p, sizeof(p));
+
267}
+
268
+
269// Forward declarations for ADL purposes
+
270
+
271template <class Hasher, class T, std::size_t N>
+
272std::enable_if_t<!is_contiguously_hashable<T, Hasher>::value>
+
273hash_append(Hasher& h, T (&a)[N]) noexcept;
274
-
275template <class Hasher, class T>
-
276inline std::enable_if_t<std::is_floating_point<T>::value>
-
277hash_append(Hasher& h, T t) noexcept
-
278{
-
279 if (t == 0)
-
280 t = 0;
-
281 detail::maybe_reverse_bytes(t, h);
-
282 h(&t, sizeof(t));
-
283}
-
284
-
285template <class Hasher>
-
286inline void
-
287hash_append(Hasher& h, std::nullptr_t) noexcept
-
288{
-
289 void const* p = nullptr;
-
290 detail::maybe_reverse_bytes(p, h);
-
291 h(&p, sizeof(p));
-
292}
-
293
-
294// Forward declarations for ADL purposes
-
295
-
296template <class Hasher, class T, std::size_t N>
-
297std::enable_if_t<!is_contiguously_hashable<T, Hasher>::value>
-
298hash_append(Hasher& h, T (&a)[N]) noexcept;
-
299
-
300template <class Hasher, class CharT, class Traits, class Alloc>
-
301std::enable_if_t<!is_contiguously_hashable<CharT, Hasher>::value>
-
302hash_append(
-
303 Hasher& h,
-
304 std::basic_string<CharT, Traits, Alloc> const& s) noexcept;
-
305
-
306template <class Hasher, class CharT, class Traits, class Alloc>
-
307std::enable_if_t<is_contiguously_hashable<CharT, Hasher>::value>
-
308hash_append(
-
309 Hasher& h,
-
310 std::basic_string<CharT, Traits, Alloc> const& s) noexcept;
-
311
-
312template <class Hasher, class T, class U>
-
313std::enable_if_t<!is_contiguously_hashable<std::pair<T, U>, Hasher>::value>
-
314hash_append(Hasher& h, std::pair<T, U> const& p) noexcept;
-
315
-
316template <class Hasher, class T, class Alloc>
-
317std::enable_if_t<!is_contiguously_hashable<T, Hasher>::value>
-
318hash_append(Hasher& h, std::vector<T, Alloc> const& v) noexcept;
-
319
-
320template <class Hasher, class T, class Alloc>
-
321std::enable_if_t<is_contiguously_hashable<T, Hasher>::value>
-
322hash_append(Hasher& h, std::vector<T, Alloc> const& v) noexcept;
-
323
-
324template <class Hasher, class T, std::size_t N>
-
325std::enable_if_t<!is_contiguously_hashable<std::array<T, N>, Hasher>::value>
-
326hash_append(Hasher& h, std::array<T, N> const& a) noexcept;
-
327
-
328template <class Hasher, class... T>
-
329std::enable_if_t<!is_contiguously_hashable<std::tuple<T...>, Hasher>::value>
-
330hash_append(Hasher& h, std::tuple<T...> const& t) noexcept;
-
331
-
332template <class Hasher, class Key, class T, class Hash, class Pred, class Alloc>
-
333void
-
334hash_append(Hasher& h, std::unordered_map<Key, T, Hash, Pred, Alloc> const& m);
-
335
-
336template <class Hasher, class Key, class Hash, class Pred, class Alloc>
-
337void
-
338hash_append(Hasher& h, std::unordered_set<Key, Hash, Pred, Alloc> const& s);
-
339
-
340template <class Hasher, class Key, class Compare, class Alloc>
-
341std::enable_if_t<!is_contiguously_hashable<Key, Hasher>::value>
-
342hash_append(
-
343 Hasher& h,
-
344 boost::container::flat_set<Key, Compare, Alloc> const& v) noexcept;
-
345template <class Hasher, class Key, class Compare, class Alloc>
-
346std::enable_if_t<is_contiguously_hashable<Key, Hasher>::value>
-
347hash_append(
-
348 Hasher& h,
-
349 boost::container::flat_set<Key, Compare, Alloc> const& v) noexcept;
-
350template <class Hasher, class T0, class T1, class... T>
-
351void
-
352hash_append(Hasher& h, T0 const& t0, T1 const& t1, T const&... t) noexcept;
-
353
-
354// c-array
-
355
-
356template <class Hasher, class T, std::size_t N>
-
357std::enable_if_t<!is_contiguously_hashable<T, Hasher>::value>
-
358hash_append(Hasher& h, T (&a)[N]) noexcept
-
359{
-
360 for (auto const& t : a)
-
361 hash_append(h, t);
-
362}
+
275template <class Hasher, class CharT, class Traits, class Alloc>
+
276std::enable_if_t<!is_contiguously_hashable<CharT, Hasher>::value>
+
277hash_append(
+
278 Hasher& h,
+
279 std::basic_string<CharT, Traits, Alloc> const& s) noexcept;
+
280
+
281template <class Hasher, class CharT, class Traits, class Alloc>
+
282std::enable_if_t<is_contiguously_hashable<CharT, Hasher>::value>
+
283hash_append(
+
284 Hasher& h,
+
285 std::basic_string<CharT, Traits, Alloc> const& s) noexcept;
+
286
+
287template <class Hasher, class T, class U>
+
288std::enable_if_t<!is_contiguously_hashable<std::pair<T, U>, Hasher>::value>
+
289hash_append(Hasher& h, std::pair<T, U> const& p) noexcept;
+
290
+
291template <class Hasher, class T, class Alloc>
+
292std::enable_if_t<!is_contiguously_hashable<T, Hasher>::value>
+
293hash_append(Hasher& h, std::vector<T, Alloc> const& v) noexcept;
+
294
+
295template <class Hasher, class T, class Alloc>
+
296std::enable_if_t<is_contiguously_hashable<T, Hasher>::value>
+
297hash_append(Hasher& h, std::vector<T, Alloc> const& v) noexcept;
+
298
+
299template <class Hasher, class T, std::size_t N>
+
300std::enable_if_t<!is_contiguously_hashable<std::array<T, N>, Hasher>::value>
+
301hash_append(Hasher& h, std::array<T, N> const& a) noexcept;
+
302
+
303template <class Hasher, class... T>
+
304std::enable_if_t<!is_contiguously_hashable<std::tuple<T...>, Hasher>::value>
+
305hash_append(Hasher& h, std::tuple<T...> const& t) noexcept;
+
306
+
307template <class Hasher, class Key, class T, class Hash, class Pred, class Alloc>
+
308void
+
309hash_append(Hasher& h, std::unordered_map<Key, T, Hash, Pred, Alloc> const& m);
+
310
+
311template <class Hasher, class Key, class Hash, class Pred, class Alloc>
+
312void
+
313hash_append(Hasher& h, std::unordered_set<Key, Hash, Pred, Alloc> const& s);
+
314
+
315template <class Hasher, class Key, class Compare, class Alloc>
+
316std::enable_if_t<!is_contiguously_hashable<Key, Hasher>::value>
+
317hash_append(
+
318 Hasher& h,
+
319 boost::container::flat_set<Key, Compare, Alloc> const& v) noexcept;
+
320template <class Hasher, class Key, class Compare, class Alloc>
+
321std::enable_if_t<is_contiguously_hashable<Key, Hasher>::value>
+
322hash_append(
+
323 Hasher& h,
+
324 boost::container::flat_set<Key, Compare, Alloc> const& v) noexcept;
+
325template <class Hasher, class T0, class T1, class... T>
+
326void
+
327hash_append(Hasher& h, T0 const& t0, T1 const& t1, T const&... t) noexcept;
+
328
+
329// c-array
+
330
+
331template <class Hasher, class T, std::size_t N>
+
332std::enable_if_t<!is_contiguously_hashable<T, Hasher>::value>
+
333hash_append(Hasher& h, T (&a)[N]) noexcept
+
334{
+
335 for (auto const& t : a)
+
336 hash_append(h, t);
+
337}
+
338
+
339// basic_string
+
340
+
341template <class Hasher, class CharT, class Traits, class Alloc>
+
342inline std::enable_if_t<!is_contiguously_hashable<CharT, Hasher>::value>
+
343hash_append(
+
344 Hasher& h,
+
345 std::basic_string<CharT, Traits, Alloc> const& s) noexcept
+
346{
+
347 for (auto c : s)
+
348 hash_append(h, c);
+
349 hash_append(h, s.size());
+
350}
+
351
+
352template <class Hasher, class CharT, class Traits, class Alloc>
+
353inline std::enable_if_t<is_contiguously_hashable<CharT, Hasher>::value>
+
354hash_append(
+
355 Hasher& h,
+
356 std::basic_string<CharT, Traits, Alloc> const& s) noexcept
+
357{
+
358 h(s.data(), s.size() * sizeof(CharT));
+
359 hash_append(h, s.size());
+
360}
+
361
+
362// pair
363
-
364// basic_string
-
365
-
366template <class Hasher, class CharT, class Traits, class Alloc>
-
367inline std::enable_if_t<!is_contiguously_hashable<CharT, Hasher>::value>
-
368hash_append(
-
369 Hasher& h,
-
370 std::basic_string<CharT, Traits, Alloc> const& s) noexcept
-
371{
-
372 for (auto c : s)
-
373 hash_append(h, c);
-
374 hash_append(h, s.size());
-
375}
-
376
-
377template <class Hasher, class CharT, class Traits, class Alloc>
-
378inline std::enable_if_t<is_contiguously_hashable<CharT, Hasher>::value>
-
379hash_append(
-
380 Hasher& h,
-
381 std::basic_string<CharT, Traits, Alloc> const& s) noexcept
-
382{
-
383 h(s.data(), s.size() * sizeof(CharT));
-
384 hash_append(h, s.size());
-
385}
-
386
-
387// pair
-
388
-
389template <class Hasher, class T, class U>
-
390inline std::enable_if_t<
-
391 !is_contiguously_hashable<std::pair<T, U>, Hasher>::value>
-
392hash_append(Hasher& h, std::pair<T, U> const& p) noexcept
-
393{
-
394 hash_append(h, p.first, p.second);
-
395}
-
396
-
397// vector
-
398
-
399template <class Hasher, class T, class Alloc>
-
400inline std::enable_if_t<!is_contiguously_hashable<T, Hasher>::value>
-
401hash_append(Hasher& h, std::vector<T, Alloc> const& v) noexcept
-
402{
-
403 for (auto const& t : v)
-
404 hash_append(h, t);
-
405 hash_append(h, v.size());
-
406}
-
407
-
408template <class Hasher, class T, class Alloc>
-
409inline std::enable_if_t<is_contiguously_hashable<T, Hasher>::value>
-
410hash_append(Hasher& h, std::vector<T, Alloc> const& v) noexcept
-
411{
-
412 h(v.data(), v.size() * sizeof(T));
-
413 hash_append(h, v.size());
-
414}
-
415
-
416// array
-
417
-
418template <class Hasher, class T, std::size_t N>
-
419std::enable_if_t<!is_contiguously_hashable<std::array<T, N>, Hasher>::value>
-
420hash_append(Hasher& h, std::array<T, N> const& a) noexcept
-
421{
-
422 for (auto const& t : a)
-
423 hash_append(h, t);
-
424}
-
425
-
426template <class Hasher, class Key, class Compare, class Alloc>
-
427std::enable_if_t<!is_contiguously_hashable<Key, Hasher>::value>
-
428hash_append(
-
429 Hasher& h,
-
430 boost::container::flat_set<Key, Compare, Alloc> const& v) noexcept
-
431{
-
432 for (auto const& t : v)
-
433 hash_append(h, t);
-
434}
-
435template <class Hasher, class Key, class Compare, class Alloc>
-
436std::enable_if_t<is_contiguously_hashable<Key, Hasher>::value>
-
437hash_append(
+
364template <class Hasher, class T, class U>
+
365inline std::enable_if_t<
+
366 !is_contiguously_hashable<std::pair<T, U>, Hasher>::value>
+
367hash_append(Hasher& h, std::pair<T, U> const& p) noexcept
+
368{
+
369 hash_append(h, p.first, p.second);
+
370}
+
371
+
372// vector
+
373
+
374template <class Hasher, class T, class Alloc>
+
375inline std::enable_if_t<!is_contiguously_hashable<T, Hasher>::value>
+
376hash_append(Hasher& h, std::vector<T, Alloc> const& v) noexcept
+
377{
+
378 for (auto const& t : v)
+
379 hash_append(h, t);
+
380 hash_append(h, v.size());
+
381}
+
382
+
383template <class Hasher, class T, class Alloc>
+
384inline std::enable_if_t<is_contiguously_hashable<T, Hasher>::value>
+
385hash_append(Hasher& h, std::vector<T, Alloc> const& v) noexcept
+
386{
+
387 h(v.data(), v.size() * sizeof(T));
+
388 hash_append(h, v.size());
+
389}
+
390
+
391// array
+
392
+
393template <class Hasher, class T, std::size_t N>
+
394std::enable_if_t<!is_contiguously_hashable<std::array<T, N>, Hasher>::value>
+
395hash_append(Hasher& h, std::array<T, N> const& a) noexcept
+
396{
+
397 for (auto const& t : a)
+
398 hash_append(h, t);
+
399}
+
400
+
401template <class Hasher, class Key, class Compare, class Alloc>
+
402std::enable_if_t<!is_contiguously_hashable<Key, Hasher>::value>
+
403hash_append(
+
404 Hasher& h,
+
405 boost::container::flat_set<Key, Compare, Alloc> const& v) noexcept
+
406{
+
407 for (auto const& t : v)
+
408 hash_append(h, t);
+
409}
+
410template <class Hasher, class Key, class Compare, class Alloc>
+
411std::enable_if_t<is_contiguously_hashable<Key, Hasher>::value>
+
412hash_append(
+
413 Hasher& h,
+
414 boost::container::flat_set<Key, Compare, Alloc> const& v) noexcept
+
415{
+
416 h(&(v.begin()), v.size() * sizeof(Key));
+
417}
+
418// tuple
+
419
+
420namespace detail {
+
421
+
422inline void
+
423for_each_item(...) noexcept
+
424{
+
425}
+
426
+
427template <class Hasher, class T>
+
428inline int
+
429hash_one(Hasher& h, T const& t) noexcept
+
430{
+
431 hash_append(h, t);
+
432 return 0;
+
433}
+
434
+
435template <class Hasher, class... T, std::size_t... I>
+
436inline void
+
437tuple_hash(
438 Hasher& h,
-
439 boost::container::flat_set<Key, Compare, Alloc> const& v) noexcept
-
440{
-
441 h(&(v.begin()), v.size() * sizeof(Key));
-
442}
-
443// tuple
+
439 std::tuple<T...> const& t,
+
440 std::index_sequence<I...>) noexcept
+
441{
+
442 for_each_item(hash_one(h, std::get<I>(t))...);
+
443}
444
-
445namespace detail {
+
445} // namespace detail
446
-
447inline void
-
448for_each_item(...) noexcept
-
449{
-
450}
-
451
-
452template <class Hasher, class T>
-
453inline int
-
454hash_one(Hasher& h, T const& t) noexcept
-
455{
-
456 hash_append(h, t);
-
457 return 0;
-
458}
-
459
-
460template <class Hasher, class... T, std::size_t... I>
-
461inline void
-
462tuple_hash(
-
463 Hasher& h,
-
464 std::tuple<T...> const& t,
-
465 std::index_sequence<I...>) noexcept
-
466{
-
467 for_each_item(hash_one(h, std::get<I>(t))...);
-
468}
-
469
-
470} // namespace detail
-
471
-
472template <class Hasher, class... T>
-
473inline std::enable_if_t<
-
474 !is_contiguously_hashable<std::tuple<T...>, Hasher>::value>
-
475hash_append(Hasher& h, std::tuple<T...> const& t) noexcept
-
476{
-
477 detail::tuple_hash(h, t, std::index_sequence_for<T...>{});
-
478}
-
479
-
480// shared_ptr
+
447template <class Hasher, class... T>
+
448inline std::enable_if_t<
+
449 !is_contiguously_hashable<std::tuple<T...>, Hasher>::value>
+
450hash_append(Hasher& h, std::tuple<T...> const& t) noexcept
+
451{
+
452 detail::tuple_hash(h, t, std::index_sequence_for<T...>{});
+
453}
+
454
+
455// shared_ptr
+
456
+
457template <class Hasher, class T>
+
458inline void
+
459hash_append(Hasher& h, std::shared_ptr<T> const& p) noexcept
+
460{
+
461 hash_append(h, p.get());
+
462}
+
463
+
464// chrono
+
465
+
466template <class Hasher, class Rep, class Period>
+
467inline void
+
468hash_append(Hasher& h, std::chrono::duration<Rep, Period> const& d) noexcept
+
469{
+
470 hash_append(h, d.count());
+
471}
+
472
+
473template <class Hasher, class Clock, class Duration>
+
474inline void
+
475hash_append(
+
476 Hasher& h,
+
477 std::chrono::time_point<Clock, Duration> const& tp) noexcept
+
478{
+
479 hash_append(h, tp.time_since_epoch());
+
480}
481
-
482template <class Hasher, class T>
-
483inline void
-
484hash_append(Hasher& h, std::shared_ptr<T> const& p) noexcept
-
485{
-
486 hash_append(h, p.get());
-
487}
-
488
-
489// chrono
-
490
-
491template <class Hasher, class Rep, class Period>
-
492inline void
-
493hash_append(Hasher& h, std::chrono::duration<Rep, Period> const& d) noexcept
-
494{
-
495 hash_append(h, d.count());
-
496}
-
497
-
498template <class Hasher, class Clock, class Duration>
-
499inline void
-
500hash_append(
-
501 Hasher& h,
-
502 std::chrono::time_point<Clock, Duration> const& tp) noexcept
-
503{
-
504 hash_append(h, tp.time_since_epoch());
-
505}
-
506
-
507// variadic
-
508
-
509template <class Hasher, class T0, class T1, class... T>
-
510inline void
-
511hash_append(Hasher& h, T0 const& t0, T1 const& t1, T const&... t) noexcept
-
512{
-
513 hash_append(h, t0);
-
514 hash_append(h, t1, t...);
-
515}
-
516
-
517// error_code
-
518
-
519template <class HashAlgorithm>
-
520inline void
-
521hash_append(HashAlgorithm& h, std::error_code const& ec)
-
522{
-
523 hash_append(h, ec.value(), &ec.category());
-
524}
-
525
-
526} // namespace beast
-
527
-
528#endif
+
482// variadic
+
483
+
484template <class Hasher, class T0, class T1, class... T>
+
485inline void
+
486hash_append(Hasher& h, T0 const& t0, T1 const& t1, T const&... t) noexcept
+
487{
+
488 hash_append(h, t0);
+
489 hash_append(h, t1, t...);
+
490}
+
491
+
492// error_code
+
493
+
494template <class HashAlgorithm>
+
495inline void
+
496hash_append(HashAlgorithm& h, std::error_code const& ec)
+
497{
+
498 hash_append(h, ec.value(), &ec.category());
+
499}
+
500
+
501} // namespace beast
+
502
+
503#endif
std::addressof
T addressof(T... args)
@@ -580,13 +555,13 @@ $(function() {
std::memmove
T memmove(T... args)
-
beast::detail::reverse_bytes
void reverse_bytes(T &t)
Definition: hash_append.h:73
-
beast::detail::hash_one
int hash_one(Hasher &h, T const &t) noexcept
Definition: hash_append.h:454
-
beast::detail::maybe_reverse_bytes
void maybe_reverse_bytes(T &t, std::false_type)
Definition: hash_append.h:84
-
beast::detail::tuple_hash
void tuple_hash(Hasher &h, std::tuple< T... > const &t, std::index_sequence< I... >) noexcept
Definition: hash_append.h:462
-
beast::detail::for_each_item
void for_each_item(...) noexcept
Definition: hash_append.h:448
+
beast::detail::reverse_bytes
void reverse_bytes(T &t)
Definition: hash_append.h:48
+
beast::detail::hash_one
int hash_one(Hasher &h, T const &t) noexcept
Definition: hash_append.h:429
+
beast::detail::maybe_reverse_bytes
void maybe_reverse_bytes(T &t, std::false_type)
Definition: hash_append.h:59
+
beast::detail::tuple_hash
void tuple_hash(Hasher &h, std::tuple< T... > const &t, std::index_sequence< I... >) noexcept
Definition: hash_append.h:437
+
beast::detail::for_each_item
void for_each_item(...) noexcept
Definition: hash_append.h:423
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
std
STL namespace.
@@ -594,7 +569,7 @@ $(function() {
beast::is_contiguously_hashable< T[N], HashAlgorithm >::is_contiguously_hashable
is_contiguously_hashable()=default
-
beast::is_contiguously_hashable
Metafunction returning true if the type can be hashed in one call.
Definition: hash_append.h:212
+
beast::is_contiguously_hashable
Metafunction returning true if the type can be hashed in one call.
Definition: hash_append.h:187
beast::is_contiguously_hashable::is_contiguously_hashable
is_contiguously_hashable()=default
beast::is_uniquely_represented< T const >::is_uniquely_represented
is_uniquely_represented()=default
beast::is_uniquely_represented< T const volatile >::is_uniquely_represented
is_uniquely_represented()=default
@@ -603,7 +578,7 @@ $(function() {
beast::is_uniquely_represented< std::array< T, N > >::is_uniquely_represented
is_uniquely_represented()=default
beast::is_uniquely_represented< std::pair< T, U > >::is_uniquely_represented
is_uniquely_represented()=default
beast::is_uniquely_represented< std::tuple< T... > >::is_uniquely_represented
is_uniquely_represented()=default
-
beast::is_uniquely_represented
Definition: hash_append.h:123
+
beast::is_uniquely_represented
Definition: hash_append.h:98
beast::is_uniquely_represented::is_uniquely_represented
is_uniquely_represented()=default
std::swap
T swap(T... args)
diff --git a/ledgers_8h_source.html b/ledgers_8h_source.html index df52ba2f4f..0ef30ade24 100644 --- a/ledgers_8h_source.html +++ b/ledgers_8h_source.html @@ -404,7 +404,7 @@ $(function() {
std::set::emplace
T emplace(T... args)
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
ripple::test::csf::TxSetType
boost::container::flat_set< Tx > TxSetType
Definition: Tx.h:79
ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition: algorithm.h:25
ripple::ledgerDefaultTimeResolution
auto constexpr ledgerDefaultTimeResolution
Initial resolution of ledger close time.
Definition: LedgerTiming.h:44
diff --git a/namespacebeast.html b/namespacebeast.html index 655bc69906..e9766d8575 100644 --- a/namespacebeast.html +++ b/namespacebeast.html @@ -1449,7 +1449,7 @@ Throws: Effect: Returns the reslting hash of all the input data. -

Definition at line 259 of file hash_append.h.

+

Definition at line 234 of file hash_append.h.

@@ -1489,7 +1489,7 @@ template<class Hasher , class T >
-

Definition at line 269 of file hash_append.h.

+

Definition at line 244 of file hash_append.h.

@@ -1529,7 +1529,7 @@ template<class Hasher , class T >
-

Definition at line 277 of file hash_append.h.

+

Definition at line 252 of file hash_append.h.

@@ -1569,7 +1569,7 @@ template<class Hasher >
-

Definition at line 287 of file hash_append.h.

+

Definition at line 262 of file hash_append.h.

@@ -1609,7 +1609,7 @@ template<class Hasher , class T , -

Definition at line 358 of file hash_append.h.

+

Definition at line 333 of file hash_append.h.

@@ -1649,7 +1649,7 @@ template<class Hasher , class CharT , class Traits , class Alloc >
-

Definition at line 368 of file hash_append.h.

+

Definition at line 343 of file hash_append.h.

@@ -1689,7 +1689,7 @@ template<class Hasher , class CharT , class Traits , class Alloc >
-

Definition at line 379 of file hash_append.h.

+

Definition at line 354 of file hash_append.h.

@@ -1729,7 +1729,7 @@ template<class Hasher , class T , class U >
-

Definition at line 392 of file hash_append.h.

+

Definition at line 367 of file hash_append.h.

@@ -1769,7 +1769,7 @@ template<class Hasher , class T , class Alloc >
-

Definition at line 401 of file hash_append.h.

+

Definition at line 376 of file hash_append.h.

@@ -1809,7 +1809,7 @@ template<class Hasher , class T , class Alloc >
-

Definition at line 410 of file hash_append.h.

+

Definition at line 385 of file hash_append.h.

@@ -1849,7 +1849,7 @@ template<class Hasher , class T , -

Definition at line 420 of file hash_append.h.

+

Definition at line 395 of file hash_append.h.

@@ -1889,7 +1889,7 @@ template<class Hasher , class... T>
-

Definition at line 475 of file hash_append.h.

+

Definition at line 450 of file hash_append.h.

@@ -1989,7 +1989,7 @@ template<class Hasher , class Key , class Compare , class Alloc >
-

Definition at line 428 of file hash_append.h.

+

Definition at line 403 of file hash_append.h.

@@ -2029,7 +2029,7 @@ template<class Hasher , class Key , class Compare , class Alloc >
-

Definition at line 437 of file hash_append.h.

+

Definition at line 412 of file hash_append.h.

@@ -2081,7 +2081,7 @@ template<class Hasher , class T0 , class T1 , class... T>
-

Definition at line 511 of file hash_append.h.

+

Definition at line 486 of file hash_append.h.

@@ -2121,7 +2121,7 @@ template<class Hasher , class T , class U >
-

Definition at line 392 of file hash_append.h.

+

Definition at line 367 of file hash_append.h.

@@ -2161,7 +2161,7 @@ template<class Hasher , class... T>
-

Definition at line 475 of file hash_append.h.

+

Definition at line 450 of file hash_append.h.

@@ -2201,7 +2201,7 @@ template<class Hasher , class T >
-

Definition at line 484 of file hash_append.h.

+

Definition at line 459 of file hash_append.h.

@@ -2241,7 +2241,7 @@ template<class Hasher , class Rep , class Period >
-

Definition at line 493 of file hash_append.h.

+

Definition at line 468 of file hash_append.h.

@@ -2281,7 +2281,7 @@ template<class Hasher , class Clock , class Duration >
-

Definition at line 500 of file hash_append.h.

+

Definition at line 475 of file hash_append.h.

@@ -2313,7 +2313,7 @@ template<class HashAlgorithm >
-

Definition at line 521 of file hash_append.h.

+

Definition at line 496 of file hash_append.h.

diff --git a/namespacebeast_1_1detail.html b/namespacebeast_1_1detail.html index c0cac3fb1a..e42417e7ad 100644 --- a/namespacebeast_1_1detail.html +++ b/namespacebeast_1_1detail.html @@ -191,7 +191,7 @@ template<class T >
-

Definition at line 73 of file hash_append.h.

+

Definition at line 48 of file hash_append.h.

@@ -223,7 +223,7 @@ template<class T >
-

Definition at line 84 of file hash_append.h.

+

Definition at line 59 of file hash_append.h.

@@ -255,7 +255,7 @@ template<class T >
-

Definition at line 91 of file hash_append.h.

+

Definition at line 66 of file hash_append.h.

@@ -287,7 +287,7 @@ template<class T , class Hasher >
-

Definition at line 99 of file hash_append.h.

+

Definition at line 74 of file hash_append.h.

@@ -315,7 +315,7 @@ template<class T , class Hasher >
-

Definition at line 448 of file hash_append.h.

+

Definition at line 423 of file hash_append.h.

@@ -355,7 +355,7 @@ template<class Hasher , class T >
-

Definition at line 454 of file hash_append.h.

+

Definition at line 429 of file hash_append.h.

@@ -401,7 +401,7 @@ template<class Hasher , class... T, std::size_t... I>
-

Definition at line 462 of file hash_append.h.

+

Definition at line 437 of file hash_append.h.

diff --git a/structbeast_1_1is__contiguously__hashable.html b/structbeast_1_1is__contiguously__hashable.html index ea2afe5d1a..3875d53118 100644 --- a/structbeast_1_1is__contiguously__hashable.html +++ b/structbeast_1_1is__contiguously__hashable.html @@ -114,7 +114,7 @@ struct beast::is_contiguously_hashable< T, HashAlgorithm >

Metafu

For is_contiguously_hashable<T>::value to be true, then for every combination of possible values of T held in x and y, if x == y, then it must be true that memcmp(&x, &y, sizeof(T)) return 0; i.e. that x and y are represented by the same bit pattern.

For example: A two's complement int should be contiguously hashable. Every bit pattern produces a unique value that does not compare equal to any other bit pattern's value. A IEEE floating point should not be contiguously hashable because -0. and 0. have different bit patterns, though they compare equal.

-

Definition at line 206 of file hash_append.h.

+

Definition at line 181 of file hash_append.h.

Constructor & Destructor Documentation

◆ is_contiguously_hashable()

diff --git a/structbeast_1_1is__contiguously__hashable_3_01T_0fN_0e_00_01HashAlgorithm_01_4.html b/structbeast_1_1is__contiguously__hashable_3_01T_0fN_0e_00_01HashAlgorithm_01_4.html index 181afc72d4..23959d08ae 100644 --- a/structbeast_1_1is__contiguously__hashable_3_01T_0fN_0e_00_01HashAlgorithm_01_4.html +++ b/structbeast_1_1is__contiguously__hashable_3_01T_0fN_0e_00_01HashAlgorithm_01_4.html @@ -108,7 +108,7 @@ Public Member Functions

Detailed Description

template<class T, std::size_t N, class HashAlgorithm>
struct beast::is_contiguously_hashable< T[N], HashAlgorithm >
-

Definition at line 217 of file hash_append.h.

+

Definition at line 192 of file hash_append.h.

Constructor & Destructor Documentation

◆ is_contiguously_hashable()

diff --git a/structbeast_1_1is__uniquely__represented.html b/structbeast_1_1is__uniquely__represented.html index 874bb1d9d3..3b87e94c03 100644 --- a/structbeast_1_1is__uniquely__represented.html +++ b/structbeast_1_1is__uniquely__represented.html @@ -112,7 +112,7 @@ Public Member Functions

Detailed Description

template<class T>
struct beast::is_uniquely_represented< T >
-

Definition at line 118 of file hash_append.h.

+

Definition at line 93 of file hash_append.h.

Constructor & Destructor Documentation

◆ is_uniquely_represented()

diff --git a/structbeast_1_1is__uniquely__represented_3_01T_01const_01_4.html b/structbeast_1_1is__uniquely__represented_3_01T_01const_01_4.html index 51fc496402..ce83fa25ed 100644 --- a/structbeast_1_1is__uniquely__represented_3_01T_01const_01_4.html +++ b/structbeast_1_1is__uniquely__represented_3_01T_01const_01_4.html @@ -110,7 +110,7 @@ Public Member Functions

Detailed Description

template<class T>
struct beast::is_uniquely_represented< T const >
-

Definition at line 128 of file hash_append.h.

+

Definition at line 103 of file hash_append.h.

Constructor & Destructor Documentation

◆ is_uniquely_represented()

diff --git a/structbeast_1_1is__uniquely__represented_3_01T_01const_01volatile_01_4.html b/structbeast_1_1is__uniquely__represented_3_01T_01const_01volatile_01_4.html index a899d78e6f..05542e35f2 100644 --- a/structbeast_1_1is__uniquely__represented_3_01T_01const_01volatile_01_4.html +++ b/structbeast_1_1is__uniquely__represented_3_01T_01const_01volatile_01_4.html @@ -110,7 +110,7 @@ Public Member Functions

Detailed Description

template<class T>
struct beast::is_uniquely_represented< T const volatile >
-

Definition at line 140 of file hash_append.h.

+

Definition at line 115 of file hash_append.h.

Constructor & Destructor Documentation

◆ is_uniquely_represented()

diff --git a/structbeast_1_1is__uniquely__represented_3_01T_01volatile_01_4.html b/structbeast_1_1is__uniquely__represented_3_01T_01volatile_01_4.html index 6d9ab5777e..26f02a42ab 100644 --- a/structbeast_1_1is__uniquely__represented_3_01T_01volatile_01_4.html +++ b/structbeast_1_1is__uniquely__represented_3_01T_01volatile_01_4.html @@ -110,7 +110,7 @@ Public Member Functions

Detailed Description

template<class T>
struct beast::is_uniquely_represented< T volatile >
-

Definition at line 134 of file hash_append.h.

+

Definition at line 109 of file hash_append.h.

Constructor & Destructor Documentation

◆ is_uniquely_represented()

diff --git a/structbeast_1_1is__uniquely__represented_3_01T_0fN_0e_4.html b/structbeast_1_1is__uniquely__represented_3_01T_0fN_0e_4.html index 520ab384af..eacfa3726f 100644 --- a/structbeast_1_1is__uniquely__represented_3_01T_0fN_0e_4.html +++ b/structbeast_1_1is__uniquely__represented_3_01T_0fN_0e_4.html @@ -110,7 +110,7 @@ Public Member Functions

Detailed Description

template<class T, std::size_t N>
struct beast::is_uniquely_represented< T[N]>
-

Definition at line 174 of file hash_append.h.

+

Definition at line 149 of file hash_append.h.

Constructor & Destructor Documentation

◆ is_uniquely_represented()

diff --git a/structbeast_1_1is__uniquely__represented_3_01std_1_1array_3_01T_00_01N_01_4_01_4.html b/structbeast_1_1is__uniquely__represented_3_01std_1_1array_3_01T_00_01N_01_4_01_4.html index 21a979849a..2eb4229ffd 100644 --- a/structbeast_1_1is__uniquely__represented_3_01std_1_1array_3_01T_00_01N_01_4_01_4.html +++ b/structbeast_1_1is__uniquely__represented_3_01std_1_1array_3_01T_00_01N_01_4_01_4.html @@ -108,7 +108,7 @@ Public Member Functions

Detailed Description

template<class T, std::size_t N>
struct beast::is_uniquely_represented< std::array< T, N > >
-

Definition at line 182 of file hash_append.h.

+

Definition at line 157 of file hash_append.h.

Constructor & Destructor Documentation

◆ is_uniquely_represented()

diff --git a/structbeast_1_1is__uniquely__represented_3_01std_1_1pair_3_01T_00_01U_01_4_01_4.html b/structbeast_1_1is__uniquely__represented_3_01std_1_1pair_3_01T_00_01U_01_4_01_4.html index 0ac261cffd..6a5b16add2 100644 --- a/structbeast_1_1is__uniquely__represented_3_01std_1_1pair_3_01T_00_01U_01_4_01_4.html +++ b/structbeast_1_1is__uniquely__represented_3_01std_1_1pair_3_01T_00_01U_01_4_01_4.html @@ -108,7 +108,7 @@ Public Member Functions

Detailed Description

template<class T, class U>
struct beast::is_uniquely_represented< std::pair< T, U > >
-

Definition at line 149 of file hash_append.h.

+

Definition at line 124 of file hash_append.h.

Constructor & Destructor Documentation

◆ is_uniquely_represented()

diff --git a/structbeast_1_1is__uniquely__represented_3_01std_1_1tuple_3_01T_8_8_8_01_4_01_4.html b/structbeast_1_1is__uniquely__represented_3_01std_1_1tuple_3_01T_8_8_8_01_4_01_4.html index 8f5e37c8ff..2cc8f21549 100644 --- a/structbeast_1_1is__uniquely__represented_3_01std_1_1tuple_3_01T_8_8_8_01_4_01_4.html +++ b/structbeast_1_1is__uniquely__represented_3_01std_1_1tuple_3_01T_8_8_8_01_4_01_4.html @@ -108,7 +108,7 @@ Public Member Functions

Detailed Description

template<class... T>
struct beast::is_uniquely_represented< std::tuple< T... > >
-

Definition at line 162 of file hash_append.h.

+

Definition at line 137 of file hash_append.h.

Constructor & Destructor Documentation

◆ is_uniquely_represented()

diff --git a/structripple_1_1bad__expected__access.html b/structripple_1_1bad__expected__access.html index 038da13bb6..679c9546cc 100644 --- a/structripple_1_1bad__expected__access.html +++ b/structripple_1_1bad__expected__access.html @@ -117,7 +117,7 @@ Public Member Functions

See: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p0323r10.html

The implementation is entirely based on boost::outcome_v2::result.

-

Definition at line 49 of file Expected.h.

+

Definition at line 39 of file Expected.h.

Constructor & Destructor Documentation

◆ bad_expected_access()

@@ -134,7 +134,7 @@ Public Member Functions
-

Definition at line 51 of file Expected.h.

+

Definition at line 41 of file Expected.h.

diff --git a/structripple_1_1detail_1_1throw__policy.html b/structripple_1_1detail_1_1throw__policy.html index ffb457e7bc..906f66692a 100644 --- a/structripple_1_1detail_1_1throw__policy.html +++ b/structripple_1_1detail_1_1throw__policy.html @@ -114,7 +114,7 @@ Static Public Member Functions

Detailed Description

-

Definition at line 59 of file Expected.h.

+

Definition at line 49 of file Expected.h.

Member Function Documentation

◆ wide_value_check()

@@ -142,7 +142,7 @@ template<class Impl >
-

Definition at line 63 of file Expected.h.

+

Definition at line 53 of file Expected.h.

@@ -172,7 +172,7 @@ template<class Impl >
-

Definition at line 71 of file Expected.h.

+

Definition at line 61 of file Expected.h.

@@ -202,7 +202,7 @@ template<class Impl >
-

Definition at line 79 of file Expected.h.

+

Definition at line 69 of file Expected.h.

diff --git a/tagged__integer_8h_source.html b/tagged__integer_8h_source.html index 1d8b40fd4f..2ed0b57973 100644 --- a/tagged__integer_8h_source.html +++ b/tagged__integer_8h_source.html @@ -318,7 +318,7 @@ $(function() {
ripple::operator&=
constexpr HashRouterFlags & operator&=(HashRouterFlags &lhs, HashRouterFlags rhs)
Definition: HashRouter.h:76
ripple::operator|=
constexpr HashRouterFlags & operator|=(HashRouterFlags &lhs, HashRouterFlags rhs)
Definition: HashRouter.h:61
beast::is_contiguously_hashable< ripple::tagged_integer< Int, Tag >, HashAlgorithm >::is_contiguously_hashable
is_contiguously_hashable()=default
-
beast::is_contiguously_hashable
Metafunction returning true if the type can be hashed in one call.
Definition: hash_append.h:212
+
beast::is_contiguously_hashable
Metafunction returning true if the type can be hashed in one call.
Definition: hash_append.h:187
std::to_string
T to_string(T... args)
diff --git a/tokens_8h_source.html b/tokens_8h_source.html index eec272d8f4..fad869004a 100644 --- a/tokens_8h_source.html +++ b/tokens_8h_source.html @@ -202,7 +202,7 @@ $(function() {
135#endif
- +
ripple::base_uint< 160, detail::AccountIDTag >
diff --git a/uhash_8h_source.html b/uhash_8h_source.html index 80a2879abf..b16d015829 100644 --- a/uhash_8h_source.html +++ b/uhash_8h_source.html @@ -126,7 +126,7 @@ $(function() {
48
49#endif
-
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:259
+
beast::hash_append
std::enable_if_t< is_contiguously_hashable< T, Hasher >::value > hash_append(Hasher &h, T const &t) noexcept
Logically concatenate input data to a Hasher.
Definition: hash_append.h:234
beast::uhash::uhash
uhash()=default
beast::uhash::operator()
result_type operator()(T const &t) const noexcept
Definition: uhash.h:39