Fix typos

This commit is contained in:
Dimitris Apostolou 2022-11-25 23:09:48 +02:00
parent 60a43b96c3
commit 0994282019
No known key found for this signature in database
GPG Key ID: 4B5D20E938204A8A
3 changed files with 3 additions and 3 deletions

View File

@ -14,7 +14,7 @@ from decimal import Decimal
def get_sub_array_from_array(object_array, to_match):
'''
Finds and returns a sub array from an array of arrays.
to_match should be a unique idetifier of a sub array
to_match should be a unique identifier of a sub array
'''
for item in object_array:
all_match = True

View File

@ -281,7 +281,7 @@ private:
*
* First, epoch_check decrements and checks the cheap heuristic, and then does
* a more expensive scan if the cheap heuristic runs out. If the expensive
* scan suceeds, the epochs are aged and old elements are allow_erased. The
* scan succeeds, the epochs are aged and old elements are allow_erased. The
* cheap heuristic is reset to retrigger after the worst case growth of the
* current epoch's elements would exceed the epoch_size.
*/

View File

@ -235,7 +235,7 @@ BOOST_AUTO_TEST_CASE(merkle_test)
// If no mutation was done (once for every ntx value), try up to 16 branches.
if (mutate == 0) {
for (int loop = 0; loop < std::min(ntx, 16); loop++) {
// If ntx <= 16, try all branches. Otherise, try 16 random ones.
// If ntx <= 16, try all branches. Otherwise, try 16 random ones.
int mtx = loop;
if (ntx > 16) {
mtx = InsecureRandRange(ntx);