def test_pop2(base_pqueue):
top_priority = QNode(9000, priority=0)
length = len(base_pqueue)
base_pqueue.insert(top_priority)
base_pqueue.pop()
base_pqueue.pop()
assert base_pqueue.pop() == 5
def test_insert_item_QNode_to_empty():
node1 = QNode(10, priority=0)
pqueue = PriorityQ()
pqueue.insert(node1)
assert len(pqueue) == 1
assert pqueue[0].val == 10
assert pqueue[0].priority == 0
def test_insert_QNode_to_filled(base_pqueue):
node1 = QNode(10, priority=0)
base_pqueue.insert(node1)
assert len(base_pqueue) == 4
assert base_pqueue[0].val == 10
assert base_pqueue[0].order == 3
assert base_pqueue[0].priority == 0
def test_peek5(base_pqueue):
top_priority = QNode(9000, priority=0)
base_pqueue.insert(top_priority)
base_pqueue.pop()
base_pqueue.pop()
base_pqueue.pop()
base_pqueue.pop()
with pytest.raises(IndexError):
base_pqueue.peek()
def test_pop4(base_pqueue):
top_priority = QNode(9000, priority=0)
length = len(base_pqueue)
base_pqueue.insert(top_priority)
base_pqueue.pop()
base_pqueue.pop()
base_pqueue.pop()
base_pqueue.pop()
with pytest.raises(IndexError):
base_pqueue.pop()
def test_QNode_priority_comparison():
node1 = QNode(10, priority=0)
node2 = QNode(10)
assert node1 < node2
def test_QNode_order_comparison():
node1 = QNode(10, order=1)
node2 = QNode(5, order=2)
assert node1 < node2
def QNode_list():
QNode_list = [QNode(10), QNode(5, priority=2), QNode(100, priority=1)]
return QNode_list
def test_QNode_init_with_priority():
node1 = QNode(10, priority=0)
assert node1.val == 10
assert node1.priority == 0
def test_QNode_init_no_priority():
node1 = QNode(10)
assert node1.val == 10
assert node1.priority is None
def test_invalid_number_args_qnode():
with pytest.raises(TypeError):
tpq = QNode(1, 2, 3, 4)
def test_peek4(base_pqueue):
top_priority = QNode(9000, priority=0)
base_pqueue.insert(top_priority)
base_pqueue.pop()
base_pqueue.pop()
assert base_pqueue.peek() == base_pqueue.pop()
def test_peek1(base_pqueue):
top_priority = QNode(9000, priority=0)
base_pqueue.insert(top_priority)
assert base_pqueue.peek() == top_priority.val
assert base_pqueue[0] is top_priority
def test_pop1(base_pqueue):
top_priority = QNode(9000, priority=0)
length = len(base_pqueue)
base_pqueue.insert(top_priority)
assert base_pqueue.pop() == top_priority.val
assert len(base_pqueue) == length
def test_QNode_equal_priority_comparison():
node1 = QNode(10, priority=1, order=1)
node2 = QNode(5, priority=1, order=2)
assert node1 < node2
def test_QNode_equality_comparison():
node1 = QNode(10, priority=10)
node2 = QNode(10, priority=10)
assert node1 == node2
from dtypes.priorityq import PriorityQ, QNode
@pytest.fixture()
def QNode_list():
QNode_list = [QNode(10), QNode(5, priority=2), QNode(100, priority=1)]
return QNode_list
@pytest.fixture()
def base_pqueue(QNode_list):
return PriorityQ(QNode_list)
valid_instantiation_args = [[QNode(1, 0),
QNode(1, 1),
QNode(2, 2)], [1, 2, 3, 4, 5, 6, 7, 8, 9, 10],
[(1, 2), (2, 3), (3, 4), (4, 5), (5, 6)],
[QNode(1, 0),
QNode(1, 1), 1, 2, 3, 4, 5, 6],
[QNode(1, 0),
QNode(1, 1), (1, 2), (2, 3), (3, 4)],
[
1, 2, 3, 4, 5, 6, 7, (1, 2), (2, 3), (3, 4),
(4, 5)
]]
invalid_instantiation_args = [[(1, 2, 3), (2, 3), (3, 4), (4, 5), (5, 6)],
[(1, 2), (2, 3), (3, 4), (4, 5, 1), (5, 6)]]
