diff options
| author | Wladimir J. van der Laan <[email protected]> | 2016-01-18 10:41:27 +0100 |
|---|---|---|
| committer | Wladimir J. van der Laan <[email protected]> | 2016-01-18 10:41:32 +0100 |
| commit | a8bd616fea62e0b15c6041d687230f5d9dd47bf9 (patch) | |
| tree | 0e86fd376821825e0d50e56bcc7c6a0f38680a24 /src/policy/fees.cpp | |
| parent | Merge pull request #7363 (diff) | |
| parent | Typo fixes in comments (diff) | |
| download | discoin-a8bd616fea62e0b15c6041d687230f5d9dd47bf9.tar.xz discoin-a8bd616fea62e0b15c6041d687230f5d9dd47bf9.zip | |
Merge pull request #7329
9d263bd Typo fixes in comments (Chris Wheeler)
Diffstat (limited to 'src/policy/fees.cpp')
| -rw-r--r-- | src/policy/fees.cpp | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/policy/fees.cpp b/src/policy/fees.cpp index 980ecf10d..de3c060d6 100644 --- a/src/policy/fees.cpp +++ b/src/policy/fees.cpp @@ -87,7 +87,7 @@ double TxConfirmStats::EstimateMedianVal(int confTarget, double sufficientTxVal, int maxbucketindex = buckets.size() - 1; // requireGreater means we are looking for the lowest fee/priority such that all higher - // values pass, so we start at maxbucketindex (highest fee) and look at succesively + // values pass, so we start at maxbucketindex (highest fee) and look at successively // smaller buckets until we reach failure. Otherwise, we are looking for the highest // fee/priority such that all lower values fail, and we go in the opposite direction. unsigned int startbucket = requireGreater ? maxbucketindex : 0; |