def test_select_withArgumentOutOfBSTRange_shouldRaiseValueError(self):
bst = AVLTree()
for i in range(20):
bst.put(i, i)
for i in range(-20, 0):
with self.assertRaises(ValueError):
bst.select(i)
for i in range(20, 40):
with self.assertRaises(ValueError):
bst.select(i)
def test_select_withCompareFunctionAndArgumentOutOfBSTRange_shouldRaiseValueError(
self):
bst = AVLTree(self.cmp)
for i in range(20):
bst.put([i, 0], i)
for i in range(-20, 0):
with self.assertRaises(ValueError):
bst.select(i)
for i in range(20, 40):
with self.assertRaises(ValueError):
bst.select(i)
def select_withValidK_shouldReturnTheKthSmallestElementInBST(self):
bst = AVLTree()
for i in range(20):
bst.put(i, i)
for i in range(20):
self.assertEqual(i, bst.select(i))
def select_withCompareFunctionAndValidK_shouldReturnTheKthSmallestElementInBST(
self):
bst = AVLTree(self.cmp)
for i in range(20):
bst.put([i, 0], i)
for i in range(20):
self.assertEqual(i, bst.select(i))
def test_select_withCompareFunctionAndEmptyBST_shouldRaiseAttributeError(
self):
bst = AVLTree(self.cmp)
for i in range(-20, 20):
with self.assertRaises(AttributeError):
bst.select(i)
def test_select_withEmptyBST_shouldRaiseAttributeError(self):
bst = AVLTree()
for i in range(-20, 20):
with self.assertRaises(AttributeError):
bst.select(i)
class QueueFR:
def __init__(self):
self.__back = None
self.__front = None
self.__te = AVLTree()
self.__td = AVLTree()
self.__cur_time = 0
def front(self, time=None):
if time is None:
return self.__front
if self.size(time) == 0:
return None
if self.__td.empty():
return self.__te.get(self.__te.min())
time = self.__td.floor(time)
if time is None:
return self.__te.get(self.__te.select(0))
d = self.__td.rank(time)
return self.__te.get(self.__te.select(d + 1))
def back(self, time=None):
if time is None:
return self.__back
if self.__te.empty():
return None
if self.size(time) == 0:
return None
time = self.__te.floor(time)
if time is None:
return None
rank = self.__te.rank(time)
return self.__te.get(self.__te.select(rank))
def enqueue(self, val, time):
if val is None or \
time is None:
raise ValueError("Invalid argument of None Type")
self.__check_time(time)
if self.__update_time(time):
self.__back = val
if self.size() == 0:
self.__front = self.__back
self.__te.put(time, val)
def delete(self, time):
if time is None:
raise ValueError("Invalid 'time' argument of None Type")
if time in self.__te:
self.__te.delete(time)
elif time in self.__td:
self.__td.delete(time)
else:
raise ValueError("'time' argument does "
"not correspond to any operation")
self.__back = self.back(self.__cur_time)
self.__front = self.front(self.__cur_time)
def dequeue(self, time):
self.__check_time(time)
self.__td.put(time, time)
d = self.__td.rank(time)
res = self.__te.get(self.__te.select(d))
if self.__update_time(time):
size = self.size()
if size == 0:
self.__back = None
self.__front = None
elif size == 1:
self.__front = self.__back
else:
self.__front = self.__te.get(self.__te.select(d + 1))
return res
def print(self, time=None):
if time is None:
time = self.__cur_time
if self.size(time) == 0:
return "[]"
if self.__td.empty() or \
self.__td.floor(time) is None:
front_time = self.__te.min()
else:
d = self.__td.rank(self.__td.floor(time))
front_time = self.__te.select(d + 1)
rank = self.__te.rank(self.__te.floor(time))
back_time = self.__te.select(rank)
return str(self.__te.values(front_time, back_time))
def size(self, time=None):
if time is None:
time = self.__cur_time
size = self.__te.rank(time) - self.__td.rank(time)
if time in self.__te:
size += 1
elif time in self.__td:
size -= 1
if size < 0:
return 0
return size
def __check_time(self, time):
if time is None:
raise ValueError("Invalid argument 'time' of None Type")
if time in self.__te or \
time in self.__td:
raise ValueError("Given 'time' is already in use")
def __update_time(self, time):
if time >= self.__cur_time:
self.__cur_time = time
return True
return False
