xrpld
Toggle main menu visibility
Loading...
Searching...
No Matches
include
xrpl
shamap
SHAMapAddNode.h
1
#pragma once
2
3
#include <
string
>
4
5
namespace
xrpl
{
6
7
// results of adding nodes
8
class
SHAMapAddNode
9
{
10
private
:
11
int
good_
;
12
int
bad_
;
13
int
duplicate_
;
14
15
public
:
16
SHAMapAddNode
();
17
21
void
22
incInvalid
();
23
27
void
28
incUseful
();
29
35
void
36
incDuplicate
();
37
41
[[nodiscard]]
int
42
getGood
()
const
;
43
49
[[nodiscard]]
int
50
getBad
()
const
;
51
57
[[nodiscard]]
int
58
getDuplicate
()
const
;
59
66
[[nodiscard]]
bool
67
isGood
()
const
;
68
72
[[nodiscard]]
bool
73
isInvalid
()
const
;
74
78
[[nodiscard]]
bool
79
isUseful
()
const
;
80
84
static
SHAMapAddNode
85
duplicate
();
86
90
static
SHAMapAddNode
91
useful
();
92
96
static
SHAMapAddNode
97
invalid
();
98
102
void
103
reset
();
104
111
[[nodiscard]]
std::string
112
get
()
const
;
113
120
SHAMapAddNode
&
121
operator+=
(
SHAMapAddNode
const
& n);
122
123
private
:
124
SHAMapAddNode
(
int
good,
int
bad,
int
duplicate
);
125
};
126
127
inline
SHAMapAddNode::SHAMapAddNode
() :
good_
(0),
bad_
(0),
duplicate_
(0)
128
{
129
}
130
131
inline
SHAMapAddNode::SHAMapAddNode
(
int
good,
int
bad,
int
duplicate
)
132
:
good_
(good),
bad_
(bad),
duplicate_
(
duplicate
)
133
{
134
}
135
136
inline
void
137
SHAMapAddNode::incInvalid
()
138
{
139
++
bad_
;
140
}
141
142
inline
void
143
SHAMapAddNode::incUseful
()
144
{
145
++
good_
;
146
}
147
148
inline
void
149
SHAMapAddNode::incDuplicate
()
150
{
151
++
duplicate_
;
152
}
153
154
inline
int
155
SHAMapAddNode::getGood
()
const
156
{
157
return
good_
;
158
}
159
160
inline
int
161
SHAMapAddNode::getBad
()
const
162
{
163
return
bad_
;
164
}
165
166
inline
int
167
SHAMapAddNode::getDuplicate
()
const
168
{
169
return
duplicate_
;
170
}
171
172
inline
bool
173
SHAMapAddNode::isGood
()
const
174
{
175
return
(
good_
+
duplicate_
) >
bad_
;
176
}
177
178
inline
bool
179
SHAMapAddNode::isInvalid
()
const
180
{
181
return
bad_
> 0;
182
}
183
184
inline
bool
185
SHAMapAddNode::isUseful
()
const
186
{
187
return
good_
> 0;
188
}
189
190
inline
SHAMapAddNode
191
SHAMapAddNode::duplicate
()
192
{
193
return
SHAMapAddNode
(0, 0, 1);
194
}
195
196
inline
SHAMapAddNode
197
SHAMapAddNode::useful
()
198
{
199
return
SHAMapAddNode
(1, 0, 0);
200
}
201
202
inline
SHAMapAddNode
203
SHAMapAddNode::invalid
()
204
{
205
return
SHAMapAddNode
(0, 1, 0);
206
}
207
208
inline
void
209
SHAMapAddNode::reset
()
210
{
211
good_
=
bad_
=
duplicate_
= 0;
212
}
213
214
inline
std::string
215
SHAMapAddNode::get
()
const
216
{
217
std::string
ret;
218
if
(
good_
> 0)
219
{
220
ret.
append
(
"good:"
);
221
ret.
append
(
std::to_string
(
good_
));
222
}
223
if
(
bad_
> 0)
224
{
225
if
(!ret.
empty
())
226
ret.
append
(
" "
);
227
ret.
append
(
"bad:"
);
228
ret.
append
(
std::to_string
(
bad_
));
229
}
230
if
(
duplicate_
> 0)
231
{
232
if
(!ret.
empty
())
233
ret.
append
(
" "
);
234
ret.
append
(
"dupe:"
);
235
ret.
append
(
std::to_string
(
duplicate_
));
236
}
237
if
(ret.
empty
())
238
ret =
"no nodes processed"
;
239
return
ret;
240
}
241
242
inline
SHAMapAddNode
&
243
SHAMapAddNode::operator+=
(
SHAMapAddNode
const
& n)
244
{
245
good_
+= n.
good_
;
246
bad_
+= n.
bad_
;
247
duplicate_
+= n.
duplicate_
;
248
249
return
*
this
;
250
}
251
252
}
// namespace xrpl
std::string::append
T append(T... args)
std::string
xrpl::SHAMapAddNode
Definition
SHAMapAddNode.h:9
xrpl::SHAMapAddNode::getBad
int getBad() const
Definition
SHAMapAddNode.h:161
xrpl::SHAMapAddNode::getGood
int getGood() const
Definition
SHAMapAddNode.h:155
xrpl::SHAMapAddNode::incDuplicate
void incDuplicate()
Record one node that was not needed: the map already held it, or the map or its acquisition was no lo...
Definition
SHAMapAddNode.h:149
xrpl::SHAMapAddNode::operator+=
SHAMapAddNode & operator+=(SHAMapAddNode const &n)
Add another verdict's counts into this one.
Definition
SHAMapAddNode.h:243
xrpl::SHAMapAddNode::reset
void reset()
Clear every count back to zero.
Definition
SHAMapAddNode.h:209
xrpl::SHAMapAddNode::duplicate_
int duplicate_
Definition
SHAMapAddNode.h:13
xrpl::SHAMapAddNode::getDuplicate
int getDuplicate() const
Definition
SHAMapAddNode.h:167
xrpl::SHAMapAddNode::good_
int good_
Definition
SHAMapAddNode.h:11
xrpl::SHAMapAddNode::incUseful
void incUseful()
Record one node that produced a good result.
Definition
SHAMapAddNode.h:143
xrpl::SHAMapAddNode::bad_
int bad_
Definition
SHAMapAddNode.h:12
xrpl::SHAMapAddNode::duplicate
static SHAMapAddNode duplicate()
Definition
SHAMapAddNode.h:191
xrpl::SHAMapAddNode::useful
static SHAMapAddNode useful()
Definition
SHAMapAddNode.h:197
xrpl::SHAMapAddNode::isInvalid
bool isInvalid() const
Definition
SHAMapAddNode.h:179
xrpl::SHAMapAddNode::isGood
bool isGood() const
Whether nodes that produced a good result or were not needed outnumber the ones rejected.
Definition
SHAMapAddNode.h:173
xrpl::SHAMapAddNode::get
std::string get() const
Render the tally as a log line.
Definition
SHAMapAddNode.h:215
xrpl::SHAMapAddNode::SHAMapAddNode
SHAMapAddNode()
Definition
SHAMapAddNode.h:127
xrpl::SHAMapAddNode::incInvalid
void incInvalid()
Record one node that was rejected.
Definition
SHAMapAddNode.h:137
xrpl::SHAMapAddNode::invalid
static SHAMapAddNode invalid()
Definition
SHAMapAddNode.h:203
xrpl::SHAMapAddNode::isUseful
bool isUseful() const
Definition
SHAMapAddNode.h:185
std::string::empty
T empty(T... args)
xrpl
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition
algorithm.h:5
string
std::to_string
T to_string(T... args)
Generated by
1.17.0