From 15d3386f9e16c5dc07dbd396f2a2ddfddd929019 Mon Sep 17 00:00:00 2001
From: Florian Burgener <florian.brgnr@gmail.com>
Date: Fri, 10 Jun 2022 17:22:40 +0200
Subject: [PATCH] Change comments
---
src/tests/BPTreeTests.c | 6 +++---
1 file changed, 3 insertions(+), 3 deletions(-)
diff --git a/src/tests/BPTreeTests.c b/src/tests/BPTreeTests.c
index 589c7ca..18d0026 100644
--- a/src/tests/BPTreeTests.c
+++ b/src/tests/BPTreeTests.c
@@ -314,7 +314,7 @@ static void test_BPTree_insert_should_comply_with_BPTree_rules_using_BPTree_of_g
for (int i = 0; i < keys->size; i++) {
BPTree_insert(root, keys->items[i], transform_key_to_data(keys->items[i]));
- // After each insertion, we check that the B+ tree is compliant with the B+ Tree rules.
+ // After each insertion, is checked that the B+ tree conforms to the rules of the B+ tree.
TEST_ASSERT(check_BPTree_compliance(root));
}
@@ -376,7 +376,7 @@ void test_BPTree_delete_should_comply_with_BPTree_rules_using_BPTree_of_given_or
while (keys->size > 0) {
int index = rand() % keys->size;
BPTree_delete(root, keys->items[index]);
- // After each deletion, we check that the B+ tree conforms to the B+ Tree rules.
+ // After each deletion, is checked that the B+ tree conforms to the rules of the B+ tree.
TEST_ASSERT(check_BPTree_compliance(root));
IntegerArray_delete_at_index(keys, index);
}
@@ -437,7 +437,7 @@ void test_BPTree_search_should_find_the_keys_that_exist_in_the_BPTree_using_BPTr
uint64_t data;
bool is_found = BPTree_search(root, keys->items[i], &data);
- // After each search, we check that the key has been found and that the relationship between it and the data is correct.
+ // After each search, is checked that the key has been found and that the relationship between it and the data is correct.
TEST_ASSERT(is_found);
TEST_ASSERT_EQUAL_UINT64(transform_key_to_data(keys->items[i]), data);
}
--
GitLab