From: Raymond Hettinger <rhettinger@users.noreply.github.com>
Date: Fri, 11 Jul 2025 19:36:17 +0000 (-0700)
Subject: Minor edit: Improve comment readability and ordering (gh-136557)
X-Git-Tag: v3.15.0a1~1008
X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=7f1e66ae0e7c6bfa26cc128291d8705abd1a3c93;p=thirdparty%2FPython%2Fcpython.git

Minor edit: Improve comment readability and ordering (gh-136557)
---

diff --git a/Lib/collections/__init__.py b/Lib/collections/__init__.py
index d2ddc1cd9ec2..b8653f40a942 100644
--- a/Lib/collections/__init__.py
+++ b/Lib/collections/__init__.py
@@ -776,23 +776,26 @@ class Counter(dict):
     # When the multiplicities are all zero or one, multiset operations
     # are guaranteed to be equivalent to the corresponding operations
     # for regular sets.
+    #
     #     Given counter multisets such as:
     #         cp = Counter(a=1, b=0, c=1)
     #         cq = Counter(c=1, d=0, e=1)
+    #
     #     The corresponding regular sets would be:
     #         sp = {'a', 'c'}
     #         sq = {'c', 'e'}
+    #
     #     All of the following relations would hold:
-    #         set(cp + cq) == sp | sq
-    #         set(cp - cq) == sp - sq
-    #         set(cp | cq) == sp | sq
-    #         set(cp & cq) == sp & sq
     #         (cp == cq) == (sp == sq)
     #         (cp != cq) == (sp != sq)
     #         (cp <= cq) == (sp <= sq)
     #         (cp < cq) == (sp < sq)
     #         (cp >= cq) == (sp >= sq)
     #         (cp > cq) == (sp > sq)
+    #         set(cp + cq) == sp | sq
+    #         set(cp - cq) == sp - sq
+    #         set(cp | cq) == sp | sq
+    #         set(cp & cq) == sp & sq
 
     def __eq__(self, other):
         'True if all counts agree. Missing counts are treated as zero.'