Skip to content

Commit ff58b1c

Browse files
author
MarcoFalke
committed
Merge #9610: [Trivial] Grammar and typo correction (laudaa)
5c66d41 [Trivial] Grammar and typo correction (Lauda)
2 parents 0b96abc + 5c66d41 commit ff58b1c

File tree

6 files changed

+7
-7
lines changed

6 files changed

+7
-7
lines changed

src/test/cuckoocache_tests.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@
1515
* with deterministic seeds)
1616
* 2) Some test methods are templated to allow for easier testing
1717
* against new versions / comparing
18-
* 3) Results should be treated as a regression test, ie, did the behavior
18+
* 3) Results should be treated as a regression test, i.e., did the behavior
1919
* change significantly from what was expected. This can be OK, depending on
2020
* the nature of the change, but requires updating the tests to reflect the new
2121
* expected behavior. For example improving the hit rate may cause some tests

src/test/dbwrapper_tests.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -76,7 +76,7 @@ BOOST_AUTO_TEST_CASE(dbwrapper_batch)
7676
BOOST_CHECK(dbw.Read(key2, res));
7777
BOOST_CHECK_EQUAL(res.ToString(), in2.ToString());
7878

79-
// key3 never should've been written
79+
// key3 should've never been written
8080
BOOST_CHECK(dbw.Read(key3, res) == false);
8181
}
8282
}

src/test/limitedmap_tests.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -27,7 +27,7 @@ BOOST_AUTO_TEST_CASE(limitedmap_test)
2727
// make sure that the size is updated
2828
BOOST_CHECK(map.size() == 1);
2929

30-
// make sure that the new items is in the map
30+
// make sure that the new item is in the map
3131
BOOST_CHECK(map.count(-1) == 1);
3232

3333
// insert 10 new items

src/test/scheduler_tests.cpp

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -47,8 +47,8 @@ BOOST_AUTO_TEST_CASE(manythreads)
4747
//
4848
// So... ten shared counters, which if all the tasks execute
4949
// properly will sum to the number of tasks done.
50-
// Each task adds or subtracts from one of the counters a
51-
// random amount, and then schedules another task 0-1000
50+
// Each task adds or subtracts a random amount from one of the
51+
// counters, and then schedules another task 0-1000
5252
// microseconds in the future to subtract or add from
5353
// the counter -random_amount+1, so in the end the shared
5454
// counters should sum to the number of initial tasks performed.

src/test/script_tests.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -465,7 +465,7 @@ class TestBuilder
465465
std::string JSONPrettyPrint(const UniValue& univalue)
466466
{
467467
std::string ret = univalue.write(4);
468-
// Workaround for libunivalue pretty printer, which puts a space between comma's and newlines
468+
// Workaround for libunivalue pretty printer, which puts a space between commas and newlines
469469
size_t pos = 0;
470470
while ((pos = ret.find(" \n", pos)) != std::string::npos) {
471471
ret.replace(pos, 2, "\n");

src/test/test_bitcoin.cpp

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -147,7 +147,7 @@ CTxMemPoolEntry TestMemPoolEntryHelper::FromTx(const CMutableTransaction &tx, CT
147147
}
148148

149149
CTxMemPoolEntry TestMemPoolEntryHelper::FromTx(const CTransaction &txn, CTxMemPool *pool) {
150-
// Hack to assume either its completely dependent on other mempool txs or not at all
150+
// Hack to assume either it's completely dependent on other mempool txs or not at all
151151
CAmount inChainValue = pool && pool->HasNoInputsOf(txn) ? txn.GetValueOut() : 0;
152152

153153
return CTxMemPoolEntry(MakeTransactionRef(txn), nFee, nTime, dPriority, nHeight,

0 commit comments

Comments
 (0)