summaryrefslogtreecommitdiffstats
path: root/Modules
diff options
context:
space:
mode:
Diffstat (limited to 'Modules')
-rw-r--r--Modules/_abc.c4
-rw-r--r--Modules/mathmodule.c2
2 files changed, 3 insertions, 3 deletions
diff --git a/Modules/_abc.c b/Modules/_abc.c
index 7233690..219ea0d 100644
--- a/Modules/_abc.c
+++ b/Modules/_abc.c
@@ -554,7 +554,7 @@ end:
}
-// Return -1 when exception occured.
+// Return -1 when exception occurred.
// Return 1 when result is set.
// Return 0 otherwise.
static int subclasscheck_check_registry(_abc_data *impl, PyObject *subclass,
@@ -666,7 +666,7 @@ _abc__abc_subclasscheck_impl(PyObject *module, PyObject *self,
/* 5. Check if it's a subclass of a registered class (recursive). */
if (subclasscheck_check_registry(impl, subclass, &result)) {
- // Exception occured or result is set.
+ // Exception occurred or result is set.
goto end;
}
diff --git a/Modules/mathmodule.c b/Modules/mathmodule.c
index a75a3c9..552cb78 100644
--- a/Modules/mathmodule.c
+++ b/Modules/mathmodule.c
@@ -1552,7 +1552,7 @@ prove that after that line is executed, we have
(a - 1)**2 < (n >> 2*(c - d)) < (a + 1)**2
-To faciliate the proof, we make some changes of notation. Write `m` for
+To facilitate the proof, we make some changes of notation. Write `m` for
`n >> 2*(c-d)`, and write `b` for the new value of `a`, so
b = (a << d - e - 1) + (n >> 2*c - e - d + 1) // a