summaryrefslogtreecommitdiff
path: root/Lib/functools.py
diff options
context:
space:
mode:
authorRaymond Hettinger <rhettinger@users.noreply.github.com>2017-09-05 09:40:44 -0700
committerGitHub <noreply@github.com>2017-09-05 09:40:44 -0700
commit15ce0bee973596f02983f39e1a1b172b91e9cdda (patch)
tree1b515fa18ae1bdbb7efe4e25504e27b84ad91fed /Lib/functools.py
parent75b961869a1184895c9d5bf41a57f3c985622662 (diff)
downloadcpython-git-15ce0bee973596f02983f39e1a1b172b91e9cdda.tar.gz
Conceptually, roots is a set. Also searching it as a set is a tiny bit faster (#3338)
Diffstat (limited to 'Lib/functools.py')
-rw-r--r--Lib/functools.py2
1 files changed, 1 insertions, 1 deletions
diff --git a/Lib/functools.py b/Lib/functools.py
index 0873f20715..23ad160930 100644
--- a/Lib/functools.py
+++ b/Lib/functools.py
@@ -193,7 +193,7 @@ _convert = {
def total_ordering(cls):
"""Class decorator that fills in missing ordering methods"""
# Find user-defined comparisons (not those inherited from object).
- roots = [op for op in _convert if getattr(cls, op, None) is not getattr(object, op, None)]
+ roots = {op for op in _convert if getattr(cls, op, None) is not getattr(object, op, None)}
if not roots:
raise ValueError('must define at least one ordering operation: < > <= >=')
root = max(roots) # prefer __lt__ to __le__ to __gt__ to __ge__