def test_get(self): tm = TreeMap([(1, 2), (2, 3), (3, 4)]) assert tm.get(1) == 2 assert tm.get(2) == 3 assert tm.get(3) == 4 with self.assertRaises(ValueError): cb.get(4)
def test_set(self): tree = TreeMap() tree.set(2, 'B') assert tree.contains(2) assert tree.get(2) == 'B' tree.set(1, 'A') assert tree.contains(1) assert tree.get(1) == 'A' tree.set(3, 'C') assert tree.contains(3) assert tree.get(3) == 'C'
def test_set_and_get(self): ht = TreeMap() ht.set('I', 1) ht.set('V', 5) ht.set('X', 10) assert ht.get('I') == 1 assert ht.get('V') == 5 assert ht.get('X') == 10 assert ht.length() == 3 assert ht.size == 3 with self.assertRaises(KeyError): ht.get('A') # Key does not exist
def test_set_twice_and_get(self): ht = TreeMap() ht.set('I', 1) ht.set('V', 4) ht.set('X', 9) assert ht.length() == 3 assert ht.size == 3 ht.set('V', 5) # Update value ht.set('X', 10) # Update value assert ht.get('I') == 1 assert ht.get('V') == 5 assert ht.get('X') == 10 assert ht.length() == 3 # Check length is not overcounting assert ht.size == 3 # Check size is not overcounting
def test_set(self): treemap = TreeMap() treemap.set('A', 3) assert treemap.size == 1 assert treemap.get('A') == 3 treemap.set('A', 3) assert treemap.size == 1
def test_get(self): tree = TreeMap([(2, 'B'), (1, 'A'), (3, 'C')]) assert tree.get(2) == 'B' assert tree.get(1) == 'A' assert tree.get(3) == 'C'