ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2025-12-06 17:27:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

LedgerEntrySet work.

Browse Source
This commit is contained in:
JoelKatz
2012-07-25 02:46:19 -07:00
parent e97c4a7d8e
commit 40c4d686fb
2 changed files with 38 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
src/LedgerEntrySet.cpp Normal file
View File

@@ -0,0 +1,21 @@
#include "LedgerEntrySet.h"
LedgerEntrySet LedgerEntrySet::duplicate()
{
return LedgerEntrySet(mEntries, mSeq + 1);
}
void LedgerEntrySet::setTo(LedgerEntrySet& e)
{
mEntries = e.mEntries;
mSeq = e.mSeq;
}
void LedgerEntrySet::swapWith(LedgerEntrySet& e)
{
std::swap(mSeq, e.mSeq);
mEntries.swap(e.mEntries);
}

24
src/LedgerEntrySet.h
View File

@@ -1,6 +1,8 @@
#ifndef __LEDGERENTRYSET__
#define __LEDGERENTRYSET__
#include <boost/unordered_map.hpp>
#include "SerializedLedger.h"
enum LedgerEntryAction
@@ -10,7 +12,8 @@ enum LedgerEntryAction
taaMODIFY, // Modifed, must have previously been taaCACHED.
taaDELETE, // Delete, must have previously been taaDELETE or taaMODIFY.
taaCREATE, // Newly created.
}
};
class LedgerEntrySetEntry
{
@@ -18,15 +21,17 @@ public:
SLE::pointer mEntry;
LedgerEntryAction mAction;
int mSeq;
};
class LedgerEntrySet
{
protected:
boost::unordered_map<uint256, LedgerEntrySetEntry> mEntries;
int mSeq;
LedgerEntrySet(const boost::unordered_map<uint256, LedgerEntrySetEntry> &e, int m) : mEntries(e), mSeq(m) { ; }
public:
LedgerEntrySet() : mSeq(0) { ; }
@@ -35,6 +40,9 @@ public:
void setTo(LedgerEntrySet&); // Set this set to have the same contents as another
void swapWith(LedgerEntrySet&); // Swap the contents of two sets
int getSeq() const { return mSeq; }
void bumpSeq() { ++mSeq; }
// basic entry functions
SLE::pointer getEntry(const uint256& index, LedgerEntryAction&);
LedgerEntryAction hasEntry(const uint256& index) const;
@@ -44,11 +52,13 @@ public:
void entryModify(SLE::pointer); // This entry will be modified
// iterator functions
bool isEmpty() const;
boost::unordered_map<uint256, LedgerEntrySetEntry>::const_iterator begin() const;
boost::unordered_map<uint256, LedgerEntrySetEntry>::const_iterator end() const;
boost::unordered_map<uint256, LedgerEntrySetEntry>::iterator begin();
boost::unordered_map<uint256, LedgerEntrySetEntry>::iterator end();
bool isEmpty() const { return mEntries.empty(); }
boost::unordered_map<uint256, LedgerEntrySetEntry>::const_iterator begin() const { return mEntries.begin(); }
boost::unordered_map<uint256, LedgerEntrySetEntry>::const_iterator end() const { return mEntries.end(); }
boost::unordered_map<uint256, LedgerEntrySetEntry>::iterator begin() { return mEntries.begin(); }
boost::unordered_map<uint256, LedgerEntrySetEntry>::iterator end() { return mEntries.end(); }
};
#endif
// vim:ts=4