def setUp(self):
self.s = SortedSet([7, 2, 1, 1, 9])
def test_type_mismatch(self):
self.assertTrue((SortedSet([4, 5, 6]) != [4, 5, 6]))
def test_default_empty(self):
s = SortedSet()
def test_type_mismatch(self):
self.assertFalse((SortedSet([4, 5, 6]) == [4, 5, 6]))
def test_positive_unequal(self):
self.assertTrue(SortedSet([4, 5, 6]) != SortedSet([1, 2, 3]))
def test_repr_empty(self):
s = SortedSet()
self.assertEqual(repr(s), "SortedSet()")
def test_positive_equal(self):
self.assertTrue(SortedSet([4, 5, 6]) == SortedSet([6, 5, 4]))
def test_slice_arbitrary(self):
self.assertEqual(self.s[2:4], SortedSet([9, 13]))
def test_with_duplicates(self):
s = SortedSet([8, 8, 8])
def test_slice_from_end(self):
self.assertEqual(self.s[3:], SortedSet([13, 15]))
def test_slice_empty(self):
self.assertEqual(self.s[10:], SortedSet())
def test_slice_from_start(self):
self.assertEqual(self.s[:3], SortedSet([1, 4, 9]))
def test_from_sequence(self):
s = SortedSet([7, 8, 3, 1])
def setUp(self):
self.s = SortedSet([1, 4, 9, 13, 15])
def test_repetition_zero(self):
s = SortedSet([4, 5, 6])
self.assertEqual(0 * s, SortedSet())
def test_index_positive(self):
s = SortedSet([1, 5, 8, 9])
self.assertEqual(s.index(8), 2)
def test_repetition_nonzero(self):
s = SortedSet([4, 5, 6])
self.assertEqual(100 * s, s)
def test_index_negative(self):
s = SortedSet([1, 5, 8, 9])
with self.assertRaises(ValueError):
s.index(15)
def test_repr_some(self):
s = SortedSet([42, 40, 19])
self.assertEqual(repr(s), "SortedSet([19, 40, 42])")
def test_count_zero(self):
s = SortedSet([1, 5, 7, 9])
self.assertEqual(s.count(11), 0)
def test_negative_equal(self):
self.assertFalse(SortedSet([4, 5, 6]) == SortedSet([1, 2, 3]))
def test_count_one(self):
s = SortedSet([1, 5, 7, 9])
self.assertEqual(s.count(7), 1)
def test_identical(self):
s = SortedSet([10, 11, 12])
self.assertTrue(s == s)
def test_concatenate_disjoint(self):
s = SortedSet([1, 2, 3])
t = SortedSet([4, 5, 6])
self.assertEqual(s + t, SortedSet([1, 2, 3, 4, 5, 6]))
def test_negative_unequal(self):
self.assertFalse(SortedSet([4, 5, 6]) != SortedSet([6, 5, 4]))
def test_concatenate_equal(self):
s = SortedSet([1, 2, 3])
self.assertEqual(s + s, s)
def test_identical(self):
s = SortedSet([10, 11, 12])
self.assertFalse(s != s)
def test_concatenate_intersecting(self):
s = SortedSet([1, 2, 3])
t = SortedSet([4, 5, 3])
self.assertEqual(s + t, SortedSet([1, 2, 3, 4, 5]))
def setUp(self):
self.s = SortedSet([6, -7, 3, 9])
def test_empty(self):
s = SortedSet([])
