def test_positive_unequal(self):
self.assertTrue(SortedSet([4, 5, 6]) != SortedSet([1, 2, 3]))
def test_ten(self):
s = SortedSet(range(10))
self.assertEqual(len(s), 10)
def test_empty(self):
s = SortedSet([])
def test_isdisjoint_positive(self):
s = SortedSet({1, 2, 3})
t = [4, 5, 6]
self.assertTrue(s.isdisjoint(t))
def test_empty(self):
s = SortedSet()
self.assertEqual(len(s), 0)
def test_intersection(self):
s = SortedSet({1, 2, 3})
t = [2, 3, 4]
self.assertEqual(s.intersection(t), SortedSet({2, 3}))
def test_symmetric_difference(self):
s = SortedSet({1, 2, 3})
t = [2, 3, 4]
self.assertEqual(s.symmetric_difference(t), SortedSet({1, 4}))
def test_default_empty(self):
s = SortedSet()
def test_gt_positive(self):
s = SortedSet({1, 2, 3})
t = SortedSet({1, 2})
self.assertTrue(s > t)
def test_lt_negative(self):
s = SortedSet({1, 2, 3})
t = SortedSet({1, 2, 3})
self.assertFalse(s < t)
def test_le_lt_positive(self):
s = SortedSet({1, 2})
t = SortedSet({1, 2, 3})
self.assertTrue(s <= t)
def test_identical(self):
s = SortedSet([10, 11, 12])
self.assertFalse(s != s)
def test_type_mismatch(self):
self.assertTrue(SortedSet([1, 2, 3]) != [1, 2, 3])
def test_negative_unequal(self):
self.assertFalse(SortedSet([4, 5, 6]) != SortedSet([6, 5, 4]))
def test_symmetric_difference(self):
s = SortedSet({1, 2, 3})
t = SortedSet({2, 3, 4})
self.assertEqual(s ^ t, SortedSet({1, 4}))
def test_ge_eq_positive(self):
s = SortedSet({1, 2, 3})
t = SortedSet({1, 2, 3})
self.assertTrue(s >= t)
def test_difference(self):
s = SortedSet({1, 2, 3})
t = SortedSet({2, 3, 4})
self.assertEqual(s - t, SortedSet({1}))
def test_ge_negative(self):
s = SortedSet({1, 2})
t = SortedSet({1, 2, 3})
self.assertFalse(s >= t)
def test_union(self):
s = SortedSet({1, 2, 3})
t = [2, 3, 4]
self.assertEqual(s.union(t), SortedSet({1, 2, 3, 4}))
def test_issuperset_positive(self):
s = SortedSet({1, 2, 3})
t = [1, 2, 3]
self.assertTrue(s.issuperset(t))
def test_difference(self):
s = SortedSet({1, 2, 3})
t = [2, 3, 4]
self.assertEqual(s.difference(t), SortedSet({1}))
def setUp(self):
self.s = SortedSet([6, 7, 3, 9])
def test_isdisjoint_negative(self):
s = SortedSet({1, 2, 3})
t = [3, 4, 5]
self.assertFalse(s.isdisjoint(t))
def test_issuperset_negative(self):
s = SortedSet({1, 2})
t = [1, 2, 3]
self.assertFalse(s.issuperset(t))
def test_one(self):
s = SortedSet([42])
self.assertEqual(len(s), 1)
def test_intersection(self):
s = SortedSet({1, 2, 3})
t = SortedSet({2, 3, 4})
self.assertEqual(s & t, SortedSet({2, 3}))
def test_with_duplicates(self):
s = SortedSet([5, 5, 5])
self.assertEqual(len(s), 1)
def test_union(self):
s = SortedSet({1, 2, 3})
t = SortedSet({2, 3, 4})
self.assertEqual(s | t, SortedSet({1, 2, 3, 4}))
def setUp(self):
self.s = SortedSet([7, 2, 1, 1, 9])
def test_identical(self):
s = SortedSet([10, 11, 12])
self.assertTrue(s == s)
