def test_contains(self): Q = FiniteBestSet(N=10) for x in self.ar: Q.add(x,x) for elem in self.max_set: self.assertTrue(Q.__contains__(elem)) for elem in self.min_set: self.assertFalse(Q.__contains__(elem))
def test_len(self): Q = FiniteBestSet(N=10) count = 0 self.assertEqual(Q.__len__(), 0) for x in self.ar: Q.add(x, x) count = min(count + 1, 10) self.assertEqual(Q.__len__(), count)
def test_contains(self): Q = FiniteBestSet(N=10) for x in self.ar: Q.add(x, x) for elem in self.max_set: self.assertTrue(Q.__contains__(elem)) for elem in self.min_set: self.assertFalse(Q.__contains__(elem))
def test_len(self): Q = FiniteBestSet(N=10) count = 0 self.assertEqual(Q.__len__(), 0) for x in self.ar: Q.add(x,x) count = min(count+1, 10) self.assertEqual(Q.__len__(), count)
def test_min(self): Q = FiniteBestSet(N=10, max=False) for x in self.ar: Q.add(x, x) self.assertTrue(set(Q.get_all()).issuperset(set(self.min_set))) self.assertTrue(set(Q.get_all()).issubset(set(self.min_set)))
def test_max(self): Q = FiniteBestSet(N=10) for x in self.ar: Q.add(x, x) self.assertTrue(set(Q.get_all()).issuperset(set(self.max_set))) self.assertTrue(set(Q.get_all()).issubset(set(self.max_set)))
def test_min(self): Q = FiniteBestSet(N=10, max=False) for x in self.ar: Q.add(x,x) self.assertTrue(set(Q.get_all()).issuperset( set(self.min_set))) self.assertTrue(set(Q.get_all()).issubset( set(self.min_set)))
def test_max(self): Q = FiniteBestSet(N=10) for x in self.ar: Q.add(x,x) self.assertTrue(set(Q.get_all()).issuperset( set(self.max_set))) self.assertTrue(set(Q.get_all()).issubset( set(self.max_set)))