Object that is equal to anything. Used to test mixed type comparison.
+.. data:: NEVER_EQ
+
+ Object that is not equal to anything (even to :data:`ALWAYS_EQ`).
+ Used to test mixed type comparison.
+
+
.. data:: LARGEST
Object that is greater than anything (except itself).
from functools import cmp_to_key
from test import support, seq_tests
+from test.support import ALWAYS_EQ, NEVER_EQ
class CommonTest(seq_tests.CommonTest):
self.assertRaises(TypeError, a.remove)
+ a = self.type2test([1, 2])
+ self.assertRaises(ValueError, a.remove, NEVER_EQ)
+ self.assertEqual(a, [1, 2])
+ a.remove(ALWAYS_EQ)
+ self.assertEqual(a, [2])
+ a = self.type2test([ALWAYS_EQ])
+ a.remove(1)
+ self.assertEqual(a, [])
+ a = self.type2test([ALWAYS_EQ])
+ a.remove(NEVER_EQ)
+ self.assertEqual(a, [])
+ a = self.type2test([NEVER_EQ])
+ self.assertRaises(ValueError, a.remove, ALWAYS_EQ)
+
class BadExc(Exception):
pass
import sys
import pickle
from test import support
+from test.support import ALWAYS_EQ, NEVER_EQ
# Various iterables
# This is used for checking the constructor (here and in test_deque.py)
self.assertRaises(TypeError, u.__contains__)
def test_contains_fake(self):
- class AllEq:
- # Sequences must use rich comparison against each item
- # (unless "is" is true, or an earlier item answered)
- # So instances of AllEq must be found in all non-empty sequences.
- def __eq__(self, other):
- return True
- __hash__ = None # Can't meet hash invariant requirements
- self.assertNotIn(AllEq(), self.type2test([]))
- self.assertIn(AllEq(), self.type2test([1]))
+ # Sequences must use rich comparison against each item
+ # (unless "is" is true, or an earlier item answered)
+ # So ALWAYS_EQ must be found in all non-empty sequences.
+ self.assertNotIn(ALWAYS_EQ, self.type2test([]))
+ self.assertIn(ALWAYS_EQ, self.type2test([1]))
+ self.assertIn(1, self.type2test([ALWAYS_EQ]))
+ self.assertNotIn(NEVER_EQ, self.type2test([]))
+ self.assertNotIn(ALWAYS_EQ, self.type2test([NEVER_EQ]))
+ self.assertIn(NEVER_EQ, self.type2test([ALWAYS_EQ]))
def test_contains_order(self):
# Sequences must test in-order. If a rich comparison has side
self.assertEqual(a.count(1), 3)
self.assertEqual(a.count(3), 0)
+ self.assertEqual(a.count(ALWAYS_EQ), 9)
+ self.assertEqual(self.type2test([ALWAYS_EQ, ALWAYS_EQ]).count(1), 2)
+ self.assertEqual(self.type2test([ALWAYS_EQ, ALWAYS_EQ]).count(NEVER_EQ), 2)
+ self.assertEqual(self.type2test([NEVER_EQ, NEVER_EQ]).count(ALWAYS_EQ), 0)
+
self.assertRaises(TypeError, a.count)
class BadExc(Exception):
self.assertEqual(u.index(0, 3, 4), 3)
self.assertRaises(ValueError, u.index, 2, 0, -10)
+ self.assertEqual(u.index(ALWAYS_EQ), 0)
+ self.assertEqual(self.type2test([ALWAYS_EQ, ALWAYS_EQ]).index(1), 0)
+ self.assertEqual(self.type2test([ALWAYS_EQ, ALWAYS_EQ]).index(NEVER_EQ), 0)
+ self.assertRaises(ValueError, self.type2test([NEVER_EQ, NEVER_EQ]).index, ALWAYS_EQ)
+
self.assertRaises(TypeError, u.index)
class BadExc(Exception):
"run_with_locale", "swap_item",
"swap_attr", "Matcher", "set_memlimit", "SuppressCrashReport", "sortdict",
"run_with_tz", "PGO", "missing_compiler_executable", "fd_count",
- "ALWAYS_EQ", "LARGEST", "SMALLEST"
+ "ALWAYS_EQ", "NEVER_EQ", "LARGEST", "SMALLEST"
]
class Error(Exception):
ALWAYS_EQ = _ALWAYS_EQ()
+class _NEVER_EQ:
+ """
+ Object that is not equal to anything.
+ """
+ def __eq__(self, other):
+ return False
+ def __ne__(self, other):
+ return True
+
+NEVER_EQ = _NEVER_EQ()
+
@functools.total_ordering
class _LARGEST:
"""
import sys
import unittest
from test.support import run_unittest, TESTFN, unlink, cpython_only
-from test.support import check_free_after_iterating
+from test.support import check_free_after_iterating, ALWAYS_EQ, NEVER_EQ
import pickle
import collections.abc
def __iter__(self):
return BasicIterClass(self.n)
+class IteratorProxyClass:
+ def __init__(self, i):
+ self.i = i
+ def __next__(self):
+ return next(self.i)
+ def __iter__(self):
+ return self
+
class SequenceClass:
def __init__(self, n):
self.n = n
else:
raise IndexError
+class SequenceProxyClass:
+ def __init__(self, s):
+ self.s = s
+ def __getitem__(self, i):
+ return self.s[i]
+
class UnlimitedSequenceClass:
def __getitem__(self, i):
return i
for i in "abc", -1, 5, 42.42, (3, 4), [], {1: 1}, 3-12j, sc5:
self.assertNotIn(i, sc5)
+ self.assertIn(ALWAYS_EQ, IteratorProxyClass(iter([1])))
+ self.assertIn(ALWAYS_EQ, SequenceProxyClass([1]))
+ self.assertNotIn(ALWAYS_EQ, IteratorProxyClass(iter([NEVER_EQ])))
+ self.assertNotIn(ALWAYS_EQ, SequenceProxyClass([NEVER_EQ]))
+ self.assertIn(NEVER_EQ, IteratorProxyClass(iter([ALWAYS_EQ])))
+ self.assertIn(NEVER_EQ, SequenceProxyClass([ALWAYS_EQ]))
+
self.assertRaises(TypeError, lambda: 3 in 12)
self.assertRaises(TypeError, lambda: 3 not in map)
--- /dev/null
+Fixed minor inconsistency in :meth:`list.__contains__`,
+:meth:`tuple.__contains__` and a few other places. The collection's item is
+now always at the left and the needle is on the right of ``==``.
ENSURE_FUTURE_ALIVE(self)
if (self->fut_callback0 != NULL) {
- int cmp = PyObject_RichCompareBool(fn, self->fut_callback0, Py_EQ);
+ int cmp = PyObject_RichCompareBool(self->fut_callback0, fn, Py_EQ);
if (cmp == -1) {
return NULL;
}
if (len == 1) {
PyObject *cb_tup = PyList_GET_ITEM(self->fut_callbacks, 0);
int cmp = PyObject_RichCompareBool(
- fn, PyTuple_GET_ITEM(cb_tup, 0), Py_EQ);
+ PyTuple_GET_ITEM(cb_tup, 0), fn, Py_EQ);
if (cmp == -1) {
return NULL;
}
int ret;
PyObject *item = PyList_GET_ITEM(self->fut_callbacks, i);
Py_INCREF(item);
- ret = PyObject_RichCompareBool(fn, PyTuple_GET_ITEM(item, 0), Py_EQ);
+ ret = PyObject_RichCompareBool(PyTuple_GET_ITEM(item, 0), fn, Py_EQ);
if (ret == 0) {
if (j < len) {
PyList_SET_ITEM(newlist, j, item);
int cmp;
for (i = 0, cmp = 0 ; cmp == 0 && i < Py_SIZE(a); ++i)
- cmp = PyObject_RichCompareBool(el, PyList_GET_ITEM(a, i),
- Py_EQ);
+ cmp = PyObject_RichCompareBool(PyList_GET_ITEM(a, i), el, Py_EQ);
return cmp;
}
break;
}
- cmp = PyObject_RichCompareBool(obj, item, Py_EQ);
+ cmp = PyObject_RichCompareBool(item, obj, Py_EQ);
Py_DECREF(item);
if (cmp < 0)
goto Fail;
return 0;
}
Py_INCREF(found);
- result = PyObject_RichCompareBool(value, found, Py_EQ);
+ result = PyObject_RichCompareBool(found, value, Py_EQ);
Py_DECREF(found);
return result;
}
int cmp;
for (i = 0, cmp = 0 ; cmp == 0 && i < Py_SIZE(a); ++i)
- cmp = PyObject_RichCompareBool(el, PyList_GET_ITEM(a, i),
- Py_EQ);
+ cmp = PyObject_RichCompareBool(PyList_GET_ITEM(a, i), el, Py_EQ);
return cmp;
}
int cmp;
for (i = 0, cmp = 0 ; cmp == 0 && i < Py_SIZE(a); ++i)
- cmp = PyObject_RichCompareBool(el, PyTuple_GET_ITEM(a, i),
- Py_EQ);
+ cmp = PyObject_RichCompareBool(PyTuple_GET_ITEM(a, i), el, Py_EQ);
return cmp;
}