diff options
author | Damien George <damien@micropython.org> | 2023-03-08 14:10:02 +1100 |
---|---|---|
committer | Damien George <damien@micropython.org> | 2023-04-27 18:03:06 +1000 |
commit | b1229efbd1509654dec6053865ab828d769e29db (patch) | |
tree | e1a65606dd1f0a8cfe2af08f9c4ff821fb575b02 /tests/extmod/utimeq1.py | |
parent | e160fe7bc64212a3ce56f5478f208e2b4d343a8b (diff) |
all: Fix spelling mistakes based on codespell check.
Signed-off-by: Damien George <damien@micropython.org>
Diffstat (limited to 'tests/extmod/utimeq1.py')
-rw-r--r-- | tests/extmod/utimeq1.py | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/tests/extmod/utimeq1.py b/tests/extmod/utimeq1.py index ddbc969af..688e5b834 100644 --- a/tests/extmod/utimeq1.py +++ b/tests/extmod/utimeq1.py @@ -125,7 +125,7 @@ assert edge_case(MODULO_HALF - 1, -100) == diff # We expect diff to be always positive, per the definition of heappop() which should return # the smallest value. -# This is the edge case where this invariant breaks, due to assymetry of two's-complement +# This is the edge case where this invariant breaks, due to asymmetry of two's-complement # range - there's one more negative integer than positive, so heappushing values like below # will then make ticks_diff() return the minimum negative value. We could make heappop # return them in a different order, but ticks_diff() result would be the same. Conclusion: |