summaryrefslogtreecommitdiff
path: root/src/01/01a/priority_queue_test.c
diff options
context:
space:
mode:
authormo khan <mo.khan@gmail.com>2020-06-29 14:47:42 -0600
committermo khan <mo.khan@gmail.com>2020-06-29 14:47:42 -0600
commit197a36f5a95a751bb42b86e7f02c7927c394e5e9 (patch)
treed7c8d922c5dff7899129b3485a6f1bfb7e504157 /src/01/01a/priority_queue_test.c
parent8c85cd6857a028579f483c45cb4aeb2d1fa3ffbb (diff)
Pass priority and data to add function
Diffstat (limited to 'src/01/01a/priority_queue_test.c')
-rw-r--r--src/01/01a/priority_queue_test.c16
1 files changed, 8 insertions, 8 deletions
diff --git a/src/01/01a/priority_queue_test.c b/src/01/01a/priority_queue_test.c
index 88245a2..02ae78e 100644
--- a/src/01/01a/priority_queue_test.c
+++ b/src/01/01a/priority_queue_test.c
@@ -36,7 +36,7 @@ Ensure(PriorityQueue, returns_size) {
Ensure(PriorityQueue, adds_a_node) {
PriorityQueue *queue = initialize();
- add(queue, create_node(1, 0));
+ add(queue, 1, 0);
assert_that(size(queue), is_equal_to(1));
@@ -46,9 +46,9 @@ Ensure(PriorityQueue, adds_a_node) {
Ensure(PriorityQueue, removes_the_node_with_the_lowest_priority){
PriorityQueue *queue = initialize();
- add(queue, create_node(3, 300));
- add(queue, create_node(1, 100));
- add(queue, create_node(2, 200));
+ add(queue, 3, 300);
+ add(queue, 1, 100);
+ add(queue, 2, 200);
assert_that(size(queue), is_equal_to(3));
assert_that(delete_min(queue)->data, is_equal_to(100));
@@ -70,7 +70,7 @@ Ensure(PriorityQueue, when_removing_node_from_empty_queue) {
Ensure(PriorityQueue, when_removing_it_decreases_the_size) {
PriorityQueue *queue = initialize();
- add(queue, create_node(1, 0));
+ add(queue, 1, 0);
delete_min(queue);
assert_that(size(queue), is_equal_to(0));
@@ -81,9 +81,9 @@ Ensure(PriorityQueue, when_removing_it_decreases_the_size) {
Ensure(PriorityQueue, when_removing_the_last_node_it_decrements_the_count_correctly) {
PriorityQueue *queue = initialize();
- add(queue, create_node(2, 200));
- add(queue, create_node(1, 100));
- add(queue, create_node(3, 300));
+ add(queue, 2, 200);
+ add(queue, 1, 100);
+ add(queue, 3, 300);
delete_min(queue);
delete_min(queue);