ARCHIVE/xahaud
3
0
Fork 0
mirror of https://github.com/Xahau/xahaud.git synced 2025-12-06 17:27:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

More work on the ledger/SHAMap sync code.

Browse Source
This commit is contained in:
JoelKatz
2012-01-30 20:56:38 -08:00
parent 6e11bfbb81
commit 5a52d6fec3
6 changed files with 164 additions and 14 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
SHAMapNodes.cpp
View File

@@ -282,13 +282,13 @@ void SHAMapLeafNode::dump()
std::cerr << " " << mItems.size() << " items" << std::endl;
}
SHAMapInnerNode::SHAMapInnerNode(const SHAMapNode& id, uint32 seq) : SHAMapNode(id), mSeq(seq)
SHAMapInnerNode::SHAMapInnerNode(const SHAMapNode& id, uint32 seq) : SHAMapNode(id), mSeq(seq), mFullBelow(false)
{ // can be root
assert(id.getDepth()<SHAMapNode::leafDepth);
}
SHAMapInnerNode::SHAMapInnerNode(const SHAMapNode& id, const std::vector<unsigned char>& contents, uint32 seq)
: SHAMapNode(id), mSeq(seq)
: SHAMapNode(id), mSeq(seq), mFullBelow(false)
{
assert(!id.isLeaf());
assert(contents.size()==32*256/8);
@@ -298,7 +298,7 @@ SHAMapInnerNode::SHAMapInnerNode(const SHAMapNode& id, const std::vector<unsigne
}
SHAMapInnerNode::SHAMapInnerNode(const SHAMapInnerNode& node, uint32 seq) : SHAMapNode(node), mHash(node.mHash),
mSeq(seq)
mSeq(seq), mFullBelow(false)
{
assert(!node.isLeaf());
memcpy(mHashes, node.mHashes, sizeof(mHashes));