Merge pull request #75021 from Sajjon/cyon_typo_batch__Benchmark

Typos: `benchmark` folder

Author: eeckstein

benchmark/scripts/compare_perf_tests.py

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

benchmark/scripts/test_compare_perf_tests.py

@@ -629,7 +629,7 @@ def test_values(self):
         )
 
     def test_justified_columns(self):
-        """Table columns are all formated with same width, defined by the
+        """Table columns are all formatted with same width, defined by the
         longest value.
         """
         self.assert_markdown_contains(

benchmark/scripts/test_utils.py

@@ -58,7 +58,7 @@ class Mock(object):
     """
 
     def __init__(self, responses=None):
-        """Optionaly initialized with a list of expected calls. See expect."""
+        """Optionally initialized with a list of expected calls. See expect."""
         self.calls = []
         self.expected = []
         self.respond = dict()

benchmark/single-source/SortIntPyramids.swift

@@ -37,7 +37,7 @@ let pyramidTemplate: [Int] = (1...pH) + (1...pH).reversed()
 // A^R - reversed array A, + - array concatenation operator,
 // A indices are in range 1...A.length.
 // define adjacent pyramid as A + A^R + A + A^R,
-// defne adjacent pyramid hight as A[A.length].
+// define adjacent pyramid height as A[A.length].
 
 
 // On 25% of following dataset stdlib sorting function will use heapSort.