summaryrefslogtreecommitdiff
path: root/src/01/01a/priority_queue_test.c
diff options
context:
space:
mode:
authormo khan <mo.khan@gmail.com>2020-07-05 14:01:59 -0600
committermo khan <mo.khan@gmail.com>2020-07-05 14:01:59 -0600
commit8bf32957fef23b85b1421c38b6416047bcba476e (patch)
tree3eece4d270f52c91a6c22e84b6eb636fd57326c1 /src/01/01a/priority_queue_test.c
parente27441426cd127c1f9969da1fcd2fde0ab415586 (diff)
run make fmt
Diffstat (limited to 'src/01/01a/priority_queue_test.c')
-rw-r--r--src/01/01a/priority_queue_test.c32
1 files changed, 21 insertions, 11 deletions
diff --git a/src/01/01a/priority_queue_test.c b/src/01/01a/priority_queue_test.c
index 877d956..c2bf2d7 100644
--- a/src/01/01a/priority_queue_test.c
+++ b/src/01/01a/priority_queue_test.c
@@ -1,10 +1,10 @@
+#include "priority_queue.h"
#include <cgreen/cgreen.h>
#include <string.h>
-#include "priority_queue.h"
Describe(PriorityQueue);
-BeforeEach(PriorityQueue){ }
-AfterEach(PriorityQueue){ }
+BeforeEach(PriorityQueue) {}
+AfterEach(PriorityQueue) {}
Ensure(PriorityQueue, returns_size) {
PriorityQueue *queue = initialize();
@@ -24,7 +24,7 @@ Ensure(PriorityQueue, adds_a_node) {
destroy(queue);
}
-Ensure(PriorityQueue, removes_the_node_with_the_lowest_priority){
+Ensure(PriorityQueue, removes_the_node_with_the_lowest_priority) {
PriorityQueue *queue = initialize();
add(queue, 3, 300);
@@ -59,7 +59,8 @@ Ensure(PriorityQueue, when_removing_it_decreases_the_size) {
destroy(queue);
}
-Ensure(PriorityQueue, when_removing_the_last_node_it_decrements_the_count_correctly) {
+Ensure(PriorityQueue,
+ when_removing_the_last_node_it_decrements_the_count_correctly) {
PriorityQueue *queue = initialize();
add(queue, 2, 200);
@@ -92,7 +93,9 @@ Ensure(PriorityQueue, when_adding_data_out_of_order) {
destroy(queue);
}
-Ensure(PriorityQueue, when_adding_random_values_with_random_priority_it_returns_the_minimum_priority_value_correctly) {
+Ensure(
+ PriorityQueue,
+ when_adding_random_values_with_random_priority_it_returns_the_minimum_priority_value_correctly) {
PriorityQueue *queue = initialize();
int n = 10;
@@ -110,13 +113,20 @@ TestSuite *priority_queue_tests() {
TestSuite *suite = create_test_suite();
add_test_with_context(suite, PriorityQueue, adds_a_node);
- add_test_with_context(suite, PriorityQueue, removes_the_node_with_the_lowest_priority);
+ add_test_with_context(suite, PriorityQueue,
+ removes_the_node_with_the_lowest_priority);
add_test_with_context(suite, PriorityQueue, returns_size);
add_test_with_context(suite, PriorityQueue, when_adding_data_out_of_order);
- add_test_with_context(suite, PriorityQueue, when_adding_random_values_with_random_priority_it_returns_the_minimum_priority_value_correctly);
- add_test_with_context(suite, PriorityQueue, when_removing_it_decreases_the_size);
- add_test_with_context(suite, PriorityQueue, when_removing_node_from_empty_queue);
- add_test_with_context(suite, PriorityQueue, when_removing_the_last_node_it_decrements_the_count_correctly);
+ add_test_with_context(
+ suite, PriorityQueue,
+ when_adding_random_values_with_random_priority_it_returns_the_minimum_priority_value_correctly);
+ add_test_with_context(suite, PriorityQueue,
+ when_removing_it_decreases_the_size);
+ add_test_with_context(suite, PriorityQueue,
+ when_removing_node_from_empty_queue);
+ add_test_with_context(
+ suite, PriorityQueue,
+ when_removing_the_last_node_it_decrements_the_count_correctly);
return suite;
}