mirror of
https://github.com/XRPLF/rippled.git
synced 2025-12-06 17:27:55 +00:00
1d42c4f6de
Per XLS-0095, we are taking steps to rename ripple(d) to xrpl(d). This change specifically removes all copyright notices referencing Ripple, XRPLF, and certain affiliated contributors upon mutual agreement, so the notice in the LICENSE.md file applies throughout. Copyright notices referencing external contributions remain as-is. Duplicate verbiage is also removed.
167 lines
2.5 KiB
C++
167 lines
2.5 KiB
C++
#ifndef XRPL_SHAMAP_SHAMAPADDNODE_H_INCLUDED
|
|
#define XRPL_SHAMAP_SHAMAPADDNODE_H_INCLUDED
|
|
|
|
#include <string>
|
|
|
|
namespace ripple {
|
|
|
|
// results of adding nodes
|
|
class SHAMapAddNode
|
|
{
|
|
private:
|
|
int mGood;
|
|
int mBad;
|
|
int mDuplicate;
|
|
|
|
public:
|
|
SHAMapAddNode();
|
|
void
|
|
incInvalid();
|
|
void
|
|
incUseful();
|
|
void
|
|
incDuplicate();
|
|
void
|
|
reset();
|
|
int
|
|
getGood() const;
|
|
bool
|
|
isGood() const;
|
|
bool
|
|
isInvalid() const;
|
|
bool
|
|
isUseful() const;
|
|
std::string
|
|
get() const;
|
|
|
|
SHAMapAddNode&
|
|
operator+=(SHAMapAddNode const& n);
|
|
|
|
static SHAMapAddNode
|
|
duplicate();
|
|
static SHAMapAddNode
|
|
useful();
|
|
static SHAMapAddNode
|
|
invalid();
|
|
|
|
private:
|
|
SHAMapAddNode(int good, int bad, int duplicate);
|
|
};
|
|
|
|
inline SHAMapAddNode::SHAMapAddNode() : mGood(0), mBad(0), mDuplicate(0)
|
|
{
|
|
}
|
|
|
|
inline SHAMapAddNode::SHAMapAddNode(int good, int bad, int duplicate)
|
|
: mGood(good), mBad(bad), mDuplicate(duplicate)
|
|
{
|
|
}
|
|
|
|
inline void
|
|
SHAMapAddNode::incInvalid()
|
|
{
|
|
++mBad;
|
|
}
|
|
|
|
inline void
|
|
SHAMapAddNode::incUseful()
|
|
{
|
|
++mGood;
|
|
}
|
|
|
|
inline void
|
|
SHAMapAddNode::incDuplicate()
|
|
{
|
|
++mDuplicate;
|
|
}
|
|
|
|
inline void
|
|
SHAMapAddNode::reset()
|
|
{
|
|
mGood = mBad = mDuplicate = 0;
|
|
}
|
|
|
|
inline int
|
|
SHAMapAddNode::getGood() const
|
|
{
|
|
return mGood;
|
|
}
|
|
|
|
inline bool
|
|
SHAMapAddNode::isInvalid() const
|
|
{
|
|
return mBad > 0;
|
|
}
|
|
|
|
inline bool
|
|
SHAMapAddNode::isUseful() const
|
|
{
|
|
return mGood > 0;
|
|
}
|
|
|
|
inline SHAMapAddNode&
|
|
SHAMapAddNode::operator+=(SHAMapAddNode const& n)
|
|
{
|
|
mGood += n.mGood;
|
|
mBad += n.mBad;
|
|
mDuplicate += n.mDuplicate;
|
|
|
|
return *this;
|
|
}
|
|
|
|
inline bool
|
|
SHAMapAddNode::isGood() const
|
|
{
|
|
return (mGood + mDuplicate) > mBad;
|
|
}
|
|
|
|
inline SHAMapAddNode
|
|
SHAMapAddNode::duplicate()
|
|
{
|
|
return SHAMapAddNode(0, 0, 1);
|
|
}
|
|
|
|
inline SHAMapAddNode
|
|
SHAMapAddNode::useful()
|
|
{
|
|
return SHAMapAddNode(1, 0, 0);
|
|
}
|
|
|
|
inline SHAMapAddNode
|
|
SHAMapAddNode::invalid()
|
|
{
|
|
return SHAMapAddNode(0, 1, 0);
|
|
}
|
|
|
|
inline std::string
|
|
SHAMapAddNode::get() const
|
|
{
|
|
std::string ret;
|
|
if (mGood > 0)
|
|
{
|
|
ret.append("good:");
|
|
ret.append(std::to_string(mGood));
|
|
}
|
|
if (mBad > 0)
|
|
{
|
|
if (!ret.empty())
|
|
ret.append(" ");
|
|
ret.append("bad:");
|
|
ret.append(std::to_string(mBad));
|
|
}
|
|
if (mDuplicate > 0)
|
|
{
|
|
if (!ret.empty())
|
|
ret.append(" ");
|
|
ret.append("dupe:");
|
|
ret.append(std::to_string(mDuplicate));
|
|
}
|
|
if (ret.empty())
|
|
ret = "no nodes processed";
|
|
return ret;
|
|
}
|
|
|
|
} // namespace ripple
|
|
|
|
#endif
|