ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2025-11-25 13:35:54 +00:00
Code Issues Packages Projects Releases Wiki Activity

stray EOF and spelling

Browse Source
This commit is contained in:
jed
2013-03-07 23:19:22 -08:00
parent 0de583c553
commit 2b2e93eef6
1 changed files with 14 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
src/cpp/ripple/RippleCalc.cpp
View File

@@ -1,7 +1,7 @@
// TODO: // TODO:
// - Do automatic bridging via XRP. // - Do automatic bridging via XRP.
// //
// OPTIMIZE: When calculating path increment, note if increment consumes all liquidity. No need to revesit path in the future if // OPTIMIZE: When calculating path increment, note if increment consumes all liquidity. No need to revisit path in the future if
// all liquidity is used. // all liquidity is used.
// //
@@ -270,7 +270,7 @@ TER PathState::pushNode(
// Insert intermediary issuer account if needed. // Insert intermediary issuer account if needed.
terResult = pushImply( terResult = pushImply(
ACCOUNT_XRP, // Rippling, but offer's don't have an account. ACCOUNT_XRP, // Rippling, but offers don't have an account.
pnPrv.uCurrencyID, pnPrv.uCurrencyID,
pnPrv.uIssuerID); pnPrv.uIssuerID);
} }
@@ -384,7 +384,7 @@ void PathState::setExpanded(
if (tesSUCCESS == terStatus if (tesSUCCESS == terStatus
&& !!uOutCurrencyID // Next is not XRP && !!uOutCurrencyID // Next is not XRP
&& uOutIssuerID != uReceiverID // Out issuer is not reciever && uOutIssuerID != uReceiverID // Out issuer is not receiver
&& (pnPrv.uCurrencyID != uOutCurrencyID // Previous will be an offer. && (pnPrv.uCurrencyID != uOutCurrencyID // Previous will be an offer.
|| pnPrv.uAccountID != uOutIssuerID)) // Need the implied issuer. || pnPrv.uAccountID != uOutIssuerID)) // Need the implied issuer.
{ {
@@ -491,7 +491,7 @@ void PathState::setCanonical(
uint160 uCurrencyID = uMaxCurrencyID; uint160 uCurrencyID = uMaxCurrencyID;
uint160 uIssuerID = uMaxIssuerID; uint160 uIssuerID = uMaxIssuerID;
// Node 0 is a composit of the sending account and saInAct. // Node 0 is a composite of the sending account and saInAct.
++uNode; // skip node 0 ++uNode; // skip node 0
// Last node is implied: Always skip last node // Last node is implied: Always skip last node
@@ -531,8 +531,7 @@ void PathState::setCanonical(
} }
else else
{ {
// Node 1 must be an account // Node 1 must be an account
} }
} }
else else
@@ -2939,7 +2938,7 @@ void TransactionEngine::calcOfferBridgeNext(
{ {
// Offer fully funded. // Offer fully funded.
// Account transfering funds in to offer always pays inbound fees. // Account transferring funds in to offer always pays inbound fees.
saOfferIn = saOfferGets; // XXX Add in fees? saOfferIn = saOfferGets; // XXX Add in fees?
@@ -2978,26 +2977,26 @@ void TransactionEngine::calcOfferBridgeNext(
// - reverse: prv is maximum to pay in (including fee) - cur is what is wanted: generally, minimizing prv // - reverse: prv is maximum to pay in (including fee) - cur is what is wanted: generally, minimizing prv
// - forward: prv is actual amount to pay in (including fee) - cur is what is wanted: generally, minimizing cur // - forward: prv is actual amount to pay in (including fee) - cur is what is wanted: generally, minimizing cur
// Value in is may be rippled or credited from limbo. Value out is put in limbo. // Value in is may be rippled or credited from limbo. Value out is put in limbo.
// If next is an offer, the amount needed is in cur reedem. // If next is an offer, the amount needed is in cur redeem.
// XXX What about account mentioned multiple times via offers? // XXX What about account mentioned multiple times via offers?
void TransactionEngine::calcNodeOffer( void TransactionEngine::calcNodeOffer(
bool bForward, bool bForward,
bool bMultiQuality, // True, if this is the only active path: we can do multiple qualities in this pass. bool bMultiQuality, // True, if this is the only active path: we can do multiple qualities in this pass.
const uint160& uPrvAccountID, // If 0, then funds from previous offer's limbo const uint160& uPrvAccountID, // If 0, then funds from previous offers limbo
const uint160& uPrvCurrencyID, const uint160& uPrvCurrencyID,
const uint160& uPrvIssuerID, const uint160& uPrvIssuerID,
const uint160& uCurCurrencyID, const uint160& uCurCurrencyID,
const uint160& uCurIssuerID, const uint160& uCurIssuerID,
const STAmount& uPrvRedeemReq, // --> In limit. const STAmount& uPrvRedeemReq, // --> In limit.
STAmount& uPrvRedeemAct, // <-> In limit achived. STAmount& uPrvRedeemAct, // <-> In limit achieved.
const STAmount& uCurRedeemReq, // --> Out limit. Driver when uCurIssuerID == uNxtIssuerID (offer would redeem to next) const STAmount& uCurRedeemReq, // --> Out limit. Driver when uCurIssuerID == uNxtIssuerID (offer would redeem to next)
STAmount& uCurRedeemAct, // <-> Out limit achived. STAmount& uCurRedeemAct, // <-> Out limit achieved.
const STAmount& uCurIssueReq, // --> In limit. const STAmount& uCurIssueReq, // --> In limit.
STAmount& uCurIssueAct, // <-> In limit achived. STAmount& uCurIssueAct, // <-> In limit achieved.
const STAmount& uCurIssueReq, // --> Out limit. Driver when uCurIssueReq != uNxtIssuerID (offer would effectively issue or transfer to next) const STAmount& uCurIssueReq, // --> Out limit. Driver when uCurIssueReq != uNxtIssuerID (offer would effectively issue or transfer to next)
STAmount& uCurIssueAct, // <-> Out limit achived. STAmount& uCurIssueAct, // <-> Out limit achieved.
STAmount& saPay, STAmount& saPay,
STAmount& saGot STAmount& saGot
@@ -3051,13 +3050,13 @@ void TransactionEngine::calcNodeOffer(
bool bRedeeming = false; bool bRedeeming = false;
bool bIssuing = false; bool bIssuing = false;
// The price varies as we change between issuing and transfering, so unless bMultiQuality, we must stick with a mode once it // The price varies as we change between issuing and transferring, so unless bMultiQuality, we must stick with a mode once it
// is determined. // is determined.
if (bBridge && (bInNext || bOutNext)) if (bBridge && (bInNext || bOutNext))
{ {
// Bridging and need to calculate next bridge rate. // Bridging and need to calculate next bridge rate.
// A bridge can consist of multiple offers. As offer's are consumed, the effective rate changes. // A bridge can consist of multiple offers. As offers are consumed, the effective rate changes.
if (bInNext) if (bInNext)
{ {