def test_sort_func(self): """specify different sort function sort in reverse order""" l = sorted_set(self.normal_list, sort_func=lambda x, y: -1 * cmp(x, y)) # in reverse order for i in range(len(l) - 1): self.assertTrue(l[i] >= l[i + 1])
def test_insertion(self): l = sorted_set(self.normal_list) # insert existing existing = self.normal_list[0] l.insert(existing) self.assertEqual(len(l), len(set(self.normal_list))) l.insert(50) l.insert(20) self.assertEqual(len(l) - 2, len(set(self.normal_list))) # in reverse order l = sorted_set(self.normal_list, sort_func=lambda x, y: -1 * cmp(x, y)) l.insert(50) l.insert(20) self.assertEqual(len(l) - 2, len(set(self.normal_list))) for i in range(len(l) - 1): self.assertTrue(l[i] >= l[i + 1])
def test_insertion(self): l = sorted_set(self.normal_list) # insert existing existing = self.normal_list[0] l.insert(existing) self.assertEqual(len(l),len(set(self.normal_list))) l.insert(50) l.insert(20) self.assertEqual(len(l)-2,len(set(self.normal_list))) # in reverse order l = sorted_set(self.normal_list,sort_func=lambda x,y: -1*cmp(x,y)) l.insert(50) l.insert(20) self.assertEqual(len(l)-2,len(set(self.normal_list))) for i in range(len(l)-1): self.assertTrue(l[i]>=l[i+1])
def test_sort_func(self): """specify different sort function sort in reverse order""" l = sorted_set(self.normal_list,sort_func=lambda x,y: -1*cmp(x,y)) # in reverse order for i in range(len(l)-1): self.assertTrue(l[i]>=l[i+1])
def test_extension(self): l = sorted_set(self.normal_list) l.extend([10, 20, 30, 40]) self.assertEqual(len(l) - 4, len(set(self.normal_list))) self.assertTrue(40 in l) # extend with existing l.extend([10, 20, 30, 40]) self.assertEqual(len(l) - 4, len(set(self.normal_list)))
def test_initialization(self): """test that initializes and sorts""" l = sorted_set(self.normal_list) self.assertEqual(len(l), len(set(self.normal_list))) # in order for i in range(len(l) - 1): self.assertTrue(l[i] <= l[i + 1])
def test_extension(self): l = sorted_set(self.normal_list) l.extend([10,20,30,40]) self.assertEqual(len(l)-4,len(set(self.normal_list))) self.assertTrue(40 in l) # extend with existing l.extend([10,20,30,40]) self.assertEqual(len(l)-4,len(set(self.normal_list)))
def test_initialization(self): """test that initializes and sorts""" l = sorted_set(self.normal_list) self.assertEqual(len(l),len(set(self.normal_list))) # in order for i in range(len(l)-1): self.assertTrue(l[i]<=l[i+1])
def test_insert_to_empty(self): l = sorted_set([]) l.insert(3) self.assertTrue(3 in l)