From a66ce05a923034cd5f6f957d378192b092dd1f5e Mon Sep 17 00:00:00 2001
From: joseville1001 <66519798+joseville1001@users.noreply.github.com>
Date: Mon, 8 Nov 2021 15:20:43 -0500
Subject: [PATCH] re: sets, "subclass/superclass" should be "subset/superset"
 (#2138)

re: sets, "subclass/superclass" should be "subset/superset" when referring to the inequality operations on sets.
---
 pep-3119.txt | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/pep-3119.txt b/pep-3119.txt
index 16be3cf34..8cabce613 100644
--- a/pep-3119.txt
+++ b/pep-3119.txt
@@ -542,13 +542,13 @@ type ``frozenset`` derives from ``Set`` and ``Hashable``.
     those three classes is a set though!  Sets have the additional
     invariant that each element occurs only once (as can be determined
     by iteration), and in addition sets define concrete operators that
-    implement the inequality operations as subclass/superclass tests.
+    implement the inequality operations as subset/superset tests.
     In general, the invariants for finite sets in mathematics
     hold. [11]_
 
     Sets with different implementations can be compared safely,
     (usually) efficiently and correctly using the mathematical
-    definitions of the subclass/superclass operations for finite sets.
+    definitions of the subset/supeset operations for finite sets.
     The ordering operations have concrete implementations; subclasses
     may override these for speed but should maintain the semantics.
     Because ``Set`` derives from ``Sized``, ``__eq__`` may take a