ARCHIVE/xahaud
3
0
Fork 0
mirror of https://github.com/Xahau/xahaud.git synced 2025-11-20 02:25:53 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix tabs and trailing whitespace.

Browse Source
This commit is contained in:
Tom Ritchford
2014-10-14 16:58:47 -04:00
parent 7eaca149c1
commit 5425a90f16
86 changed files with 200 additions and 200 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/ripple/app/consensus/LedgerConsensus.cpp
View File

@@ -1384,7 +1384,7 @@ private:
{
mOurPosition->bowOut();
propose();
}
}
mProposing = false;
}
}

28
src/ripple/app/shamap/SHAMapDelta.cpp
View File

@@ -175,7 +175,7 @@ bool SHAMap::compare (SHAMap::ref otherMap, Delta& differences, int maxCount)
else if (ourNode->isLeaf () && otherNode->isInner ())
{
if (!otherMap->walkBranch (otherNode, ourNode->peekItem (),
false, differences, maxCount))
false, differences, maxCount))
return false;
}
else if (ourNode->isInner () && otherNode->isInner ())
@@ -233,20 +233,20 @@ void SHAMap::walkMap (std::vector<SHAMapMissingNode>& missingNodes, int maxMissi
{
if (!node->isEmptyBranch (i))
{
SHAMapTreeNode::pointer nextNode = descendNoStore (node, i);
SHAMapTreeNode::pointer nextNode = descendNoStore (node, i);
if (nextNode)
{
if (nextNode->isInner ())
nodeStack.push (std::move (nextNode));
}
else
{
missingNodes.emplace_back (mType, node->getChildHash (i));
if (--maxMissing <= 0)
return;
}
}
if (nextNode)
{
if (nextNode->isInner ())
nodeStack.push (std::move (nextNode));
}
else
{
missingNodes.emplace_back (mType, node->getChildHash (i));
if (--maxMissing <= 0)
return;
}
}
}
}
}

4
src/ripple/overlay/impl/PeerImp.cpp
View File

@@ -1284,8 +1284,8 @@ PeerImp::on_message (std::shared_ptr <protocol::TMTransaction> const& m)
// For now, be paranoid and have each validator
// check each transaction, regardless of source
flags |= SF_SIGGOOD;
}
}
}
}
if (getApp().getJobQueue().getJobCount(jtTRANSACTION) > 100)
journal_.info << "Transaction queue is full";