Compare commits
1
Commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
d591cef798 |
No files matched your search
@@ -107,6 +107,8 @@ void test_treeSize_returns_correct_size()
|
||||
int main(void)
|
||||
{
|
||||
UNITY_BEGIN();
|
||||
|
||||
printf("\n============================\n Bintree tests\n============================\n");
|
||||
|
||||
RUN_TEST(test_addToTree_single_element);
|
||||
RUN_TEST(test_addToTree_multiple_elements_and_size);
|
||||
|
||||
+4
-2
@@ -16,7 +16,9 @@ static void dublicateRandomEntry (unsigned int *numbers, unsigned int len)
|
||||
if (numbers && len > 2)
|
||||
{
|
||||
unsigned int dubIndx = rand() % (len - 1);
|
||||
unsigned int copyIndx = rand() % len;
|
||||
unsigned int copyIndx;
|
||||
|
||||
copyIndx = rand() % len;
|
||||
|
||||
numbers[len - 1] = numbers[dubIndx];
|
||||
|
||||
@@ -67,7 +69,7 @@ unsigned int *createNumbers(unsigned int len)
|
||||
// Duplicate one random entry
|
||||
dublicateRandomEntry(numbers, len);
|
||||
|
||||
clearTree(root);
|
||||
clearTree(root); //Notwendigkeit muss noch restlichem Code entnommen werden
|
||||
return numbers;
|
||||
}
|
||||
|
||||
|
||||
@@ -61,6 +61,8 @@ int main(void)
|
||||
{
|
||||
UNITY_BEGIN();
|
||||
|
||||
printf("\n============================\n Numbers tests\n============================\n");
|
||||
|
||||
RUN_TEST(test_createNumbers_no_null);
|
||||
RUN_TEST(test_createNumbers_has_exactly_one_duplicate);
|
||||
RUN_TEST(test_createNumbers_has_correct_value_range);
|
||||
|
||||
Reference in new issue
Block a user