{

prevout = prevoutIn;

scriptSig = scriptSigIn;

nSequence = nSequenceIn;

{

prevout = COutPoint(hashPrevTx, nOut);

scriptSig = scriptSigIn;

nSequence = nSequenceIn;

{

std::string str;

str += "CTxIn(";

str += prevout.ToString();

if (prevout.IsNull())

str += strprintf(", coinbase %s", HexStr(scriptSig).c_str());

else

str += strprintf(", scriptSig=%s", scriptSig.ToString().substr(0,24).c_str());

if (nSequence != std::numeric_limits<unsigned int>::max())

str += strprintf(", nSequence=%u", nSequence);

str += ")";

return str;

{

nValue = nValueIn;

scriptPubKey = scriptPubKeyIn;

{

if (vin.size() != old.vin.size())

return false;

for (unsigned int i = 0; i < vin.size(); i++)

if (vin[i].prevout != old.vin[i].prevout)

return false;

bool fNewer = false;

unsigned int nLowest = std::numeric_limits<unsigned int>::max();

for (unsigned int i = 0; i < vin.size(); i++)

{

if (vin[i].nSequence != old.vin[i].nSequence)

{

if (vin[i].nSequence <= nLowest)

{

fNewer = false;

nLowest = vin[i].nSequence;

}

if (old.vin[i].nSequence < nLowest)

{

fNewer = true;

nLowest = old.vin[i].nSequence;

}

}

}

return fNewer;

{

int64_t nValueOut = 0;

BOOST_FOREACH(const CTxOut& txout, vout)

{

nValueOut += txout.nValue;

if (!MoneyRange(txout.nValue) || !MoneyRange(nValueOut))

throw std::runtime_error("CTransaction::GetValueOut() : value out of range");

}

return nValueOut;

{

// In order to avoid disincentivizing cleaning up the UTXO set we don't count

// the constant overhead for each txin and up to 110 bytes of scriptSig (which

// is enough to cover a compressed pubkey p2sh redemption) for priority.

// Providing any more cleanup incentive than making additional inputs free would

// risk encouraging people to create junk outputs to redeem later.

if (nTxSize == 0)

nTxSize = ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION);

BOOST_FOREACH(const CTxIn& txin, vin)

{

unsigned int offset = 41U + std::min(110U, (unsigned int)txin.scriptSig.size());

if (nTxSize > offset)

nTxSize -= offset;

}

if (nTxSize == 0) return 0.0;

return dPriorityInputs / nTxSize;

{

std::string str;

str += strprintf("CTransaction(hash=%s, ver=%d, vin.size=%"PRIszu", vout.size=%"PRIszu", nLockTime=%u)\n",

GetHash().ToString().substr(0,10).c_str(),

nVersion,

vin.size(),

vout.size(),

nLockTime);

for (unsigned int i = 0; i < vin.size(); i++)

str += " " + vin[i].ToString() + "\n";

for (unsigned int i = 0; i < vout.size(); i++)

str += " " + vout[i].ToString() + "\n";

return str;

{

if (n == 0)

return 0;

int e = 0;

while (((n % 10) == 0) && e < 9) {

n /= 10;

e++;

}

if (e < 9) {

int d = (n % 10);

assert(d >= 1 && d <= 9);

n /= 10;

return 1 + (n*9 + d - 1)*10 + e;

} else {

return 1 + (n - 1)*10 + 9;

}

{

// x = 0 OR x = 1+10*(9*n + d - 1) + e OR x = 1+10*(n - 1) + 9

if (x == 0)

return 0;

x--;

// x = 10*(9*n + d - 1) + e

int e = x % 10;

x /= 10;

uint64_t n = 0;

if (e < 9) {

// x = 9*n + d - 1

int d = (x % 9) + 1;

x /= 9;

// x = n

n = x*10 + d;

} else {

n = x+1;

}

while (e) {

n *= 10;

e--;

}

return n;

{

vMerkleTree.clear();

BOOST_FOREACH(const CTransaction& tx, vtx)

vMerkleTree.push_back(tx.GetHash());

int j = 0;

for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)

{

for (int i = 0; i < nSize; i += 2)

{

int i2 = std::min(i+1, nSize-1);

vMerkleTree.push_back(Hash(BEGIN(vMerkleTree[j+i]), END(vMerkleTree[j+i]),

BEGIN(vMerkleTree[j+i2]), END(vMerkleTree[j+i2])));

}

j += nSize;

}

return (vMerkleTree.empty() ? 0 : vMerkleTree.back());

{

if (vMerkleTree.empty())

BuildMerkleTree();

std::vector<uint256> vMerkleBranch;

int j = 0;

for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)

{

int i = std::min(nIndex^1, nSize-1);

vMerkleBranch.push_back(vMerkleTree[j+i]);

nIndex >>= 1;

j += nSize;

}

return vMerkleBranch;

{

if (nIndex == -1)

return 0;

BOOST_FOREACH(const uint256& otherside, vMerkleBranch)

{

if (nIndex & 1)

hash = Hash(BEGIN(otherside), END(otherside), BEGIN(hash), END(hash));

else

hash = Hash(BEGIN(hash), END(hash), BEGIN(otherside), END(otherside));

nIndex >>= 1;

}

return hash;

{

LogPrintf("CBlock(hash=%s, ver=%d, hashPrevBlock=%s, hashMerkleRoot=%s, nTime=%u, nBits=%08x, nNonce=%u, vtx=%"PRIszu")\n",

GetHash().ToString().c_str(),

nVersion,

hashPrevBlock.ToString().c_str(),

hashMerkleRoot.ToString().c_str(),

nTime, nBits, nNonce,

vtx.size());

for (unsigned int i = 0; i < vtx.size(); i++)

{

LogPrintf(" ");

vtx[i].print();

}

LogPrintf(" vMerkleTree: ");

for (unsigned int i = 0; i < vMerkleTree.size(); i++)

LogPrintf("%s ", vMerkleTree[i].ToString().c_str());

LogPrintf("\n");