Skip to content

Commit 9d04bfd

Browse files
committed
[benchmark] Fix typos
1 parent d5b4a17 commit 9d04bfd

File tree

4 files changed

+4
-4
lines changed

4 files changed

+4
-4
lines changed

benchmark/scripts/compare_perf_tests.py

+1-1
Original file line numberDiff line numberDiff line change
@@ -564,7 +564,7 @@ class TestComparator(object):
564564
It determines which tests were `added`, `removed` and which can be
565565
compared. It then splits the `ResultComparison`s into 3 groups according to
566566
the `delta_threshold` by the change in performance: `increased`,
567-
`descreased` and `unchanged`. Whole computation is performed during
567+
`decreased` and `unchanged`. Whole computation is performed during
568568
initialization and results are provided as properties on this object.
569569
570570
The lists of `added`, `removed` and `unchanged` tests are sorted

benchmark/scripts/test_compare_perf_tests.py

+1-1
Original file line numberDiff line numberDiff line change
@@ -629,7 +629,7 @@ def test_values(self):
629629
)
630630

631631
def test_justified_columns(self):
632-
"""Table columns are all formated with same width, defined by the
632+
"""Table columns are all formatted with same width, defined by the
633633
longest value.
634634
"""
635635
self.assert_markdown_contains(

benchmark/scripts/test_utils.py

+1-1
Original file line numberDiff line numberDiff line change
@@ -58,7 +58,7 @@ class Mock(object):
5858
"""
5959

6060
def __init__(self, responses=None):
61-
"""Optionaly initialized with a list of expected calls. See expect."""
61+
"""Optionally initialized with a list of expected calls. See expect."""
6262
self.calls = []
6363
self.expected = []
6464
self.respond = dict()

benchmark/single-source/SortIntPyramids.swift

+1-1
Original file line numberDiff line numberDiff line change
@@ -37,7 +37,7 @@ let pyramidTemplate: [Int] = (1...pH) + (1...pH).reversed()
3737
// A^R - reversed array A, + - array concatenation operator,
3838
// A indices are in range 1...A.length.
3939
// define adjacent pyramid as A + A^R + A + A^R,
40-
// defne adjacent pyramid hight as A[A.length].
40+
// defne adjacent pyramid height as A[A.length].
4141

4242

4343
// On 25% of following dataset stdlib sorting function will use heapSort.

0 commit comments

Comments
 (0)