mirror of
https://github.com/XRPLF/rippled.git
synced 2025-12-06 17:27:55 +00:00
4b79e7dca8
CanonicalTXSet acts much like a map, but sorts the transactions in a simple order that makes them take fewer passed.
54 lines
1.4 KiB
C++
54 lines
1.4 KiB
C++
|
|
#include "CanonicalTXSet.h"
|
|
|
|
bool CanonicalTXKey::operator<(const CanonicalTXKey& key) const
|
|
{
|
|
if (mAccount < key.mAccount) return true;
|
|
if (mAccount > key.mAccount) return false;
|
|
if (mSeq < key.mSeq) return true;
|
|
if (mSeq > key.mSeq) return false;
|
|
return mTXid < key.mTXid;
|
|
}
|
|
|
|
bool CanonicalTXKey::operator>(const CanonicalTXKey& key) const
|
|
{
|
|
if (mAccount > key.mAccount) return true;
|
|
if (mAccount < key.mAccount) return false;
|
|
if (mSeq > key.mSeq) return true;
|
|
if (mSeq < key.mSeq) return false;
|
|
return mTXid > key.mTXid;
|
|
}
|
|
|
|
bool CanonicalTXKey::operator<=(const CanonicalTXKey& key) const
|
|
{
|
|
if (mAccount < key.mAccount) return true;
|
|
if (mAccount > key.mAccount) return false;
|
|
if (mSeq < key.mSeq) return true;
|
|
if (mSeq > key.mSeq) return false;
|
|
return mTXid <= key.mTXid;
|
|
}
|
|
|
|
bool CanonicalTXKey::operator>=(const CanonicalTXKey& key)const
|
|
{
|
|
if (mAccount > key.mAccount) return true;
|
|
if (mAccount < key.mAccount) return false;
|
|
if (mSeq > key.mSeq) return true;
|
|
if (mSeq < key.mSeq) return false;
|
|
return mTXid >= key.mTXid;
|
|
}
|
|
|
|
void CanonicalTXSet::push_back(SerializedTransaction::pointer txn)
|
|
{
|
|
uint256 effectiveAccount = mSetHash;
|
|
effectiveAccount ^= txn->getSourceAccount().getAccountID().to256();
|
|
mMap.insert(std::make_pair(CanonicalTXKey(effectiveAccount, txn->getSequence(), txn->getTransactionID()), txn));
|
|
}
|
|
|
|
void CanonicalTXSet::eraseInc(iterator& it)
|
|
{
|
|
iterator tmp = it++;
|
|
mMap.erase(tmp);
|
|
}
|
|
|
|
|