Compare commits
1 Commits
| Author | SHA1 | Date | |
|---|---|---|---|
| b042ba608c |
@ -108,8 +108,6 @@ int main(void)
|
|||||||
{
|
{
|
||||||
UNITY_BEGIN();
|
UNITY_BEGIN();
|
||||||
|
|
||||||
printf("\n============================\n Bintree tests\n============================\n");
|
|
||||||
|
|
||||||
RUN_TEST(test_addToTree_single_element);
|
RUN_TEST(test_addToTree_single_element);
|
||||||
RUN_TEST(test_addToTree_multiple_elements_and_size);
|
RUN_TEST(test_addToTree_multiple_elements_and_size);
|
||||||
RUN_TEST(test_addToTree_duplicate_detection);
|
RUN_TEST(test_addToTree_duplicate_detection);
|
||||||
|
|||||||
@ -16,7 +16,9 @@ static void dublicateRandomEntry (unsigned int *numbers, unsigned int len)
|
|||||||
if (numbers && len > 2)
|
if (numbers && len > 2)
|
||||||
{
|
{
|
||||||
unsigned int dubIndx = rand() % (len - 1);
|
unsigned int dubIndx = rand() % (len - 1);
|
||||||
unsigned int copyIndx = rand() % len;
|
unsigned int copyIndx;
|
||||||
|
|
||||||
|
copyIndx = rand() % len;
|
||||||
|
|
||||||
numbers[len - 1] = numbers[dubIndx];
|
numbers[len - 1] = numbers[dubIndx];
|
||||||
|
|
||||||
@ -67,7 +69,7 @@ unsigned int *createNumbers(unsigned int len)
|
|||||||
// Duplicate one random entry
|
// Duplicate one random entry
|
||||||
dublicateRandomEntry(numbers, len);
|
dublicateRandomEntry(numbers, len);
|
||||||
|
|
||||||
clearTree(root);
|
clearTree(root); //Notwendigkeit muss noch restlichem Code entnommen werden
|
||||||
return numbers;
|
return numbers;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@ -61,8 +61,6 @@ int main(void)
|
|||||||
{
|
{
|
||||||
UNITY_BEGIN();
|
UNITY_BEGIN();
|
||||||
|
|
||||||
printf("\n============================\n Numbers tests\n============================\n");
|
|
||||||
|
|
||||||
RUN_TEST(test_createNumbers_no_null);
|
RUN_TEST(test_createNumbers_no_null);
|
||||||
RUN_TEST(test_createNumbers_has_exactly_one_duplicate);
|
RUN_TEST(test_createNumbers_has_exactly_one_duplicate);
|
||||||
RUN_TEST(test_createNumbers_has_correct_value_range);
|
RUN_TEST(test_createNumbers_has_correct_value_range);
|
||||||
|
|||||||
@ -15,10 +15,6 @@ StackNode *push(StackNode *stack, void *data)
|
|||||||
{
|
{
|
||||||
StackNode *newNode;
|
StackNode *newNode;
|
||||||
newNode = (StackNode *)malloc(sizeof(StackNode));
|
newNode = (StackNode *)malloc(sizeof(StackNode));
|
||||||
if (!newNode)
|
|
||||||
printf("Speicherfehler: nicht genug Speicher");
|
|
||||||
return stack;
|
|
||||||
|
|
||||||
newNode->data = data;
|
newNode->data = data;
|
||||||
|
|
||||||
// ,-→ bedeutet Liste war leer - das neue Element hat keinen Nachfolger (next = NULL)
|
// ,-→ bedeutet Liste war leer - das neue Element hat keinen Nachfolger (next = NULL)
|
||||||
|
|||||||
@ -1,6 +1,12 @@
|
|||||||
#include "timer.h"
|
#include "timer.h"
|
||||||
|
|
||||||
#if __APPLE__
|
#ifdef __linux__
|
||||||
|
// Defines strict posix compliance for CLOCK_MONOTONIC
|
||||||
|
#define _POSIX_C_SOURCE 199309L
|
||||||
|
#include <time.h>
|
||||||
|
#endif
|
||||||
|
|
||||||
|
#if __APPLE__ || __linux__
|
||||||
#include <sys/time.h>
|
#include <sys/time.h>
|
||||||
static struct timespec start = {0, 0};
|
static struct timespec start = {0, 0};
|
||||||
|
|
||||||
@ -21,7 +27,8 @@ double stopTimer()
|
|||||||
|
|
||||||
double measuredSeconds = (double)delta_us / 1000000.;
|
double measuredSeconds = (double)delta_us / 1000000.;
|
||||||
|
|
||||||
if(start.tv_nsec > 0) {
|
if (start.tv_nsec > 0)
|
||||||
|
{
|
||||||
start.tv_nsec = 0;
|
start.tv_nsec = 0;
|
||||||
start.tv_sec = 0;
|
start.tv_sec = 0;
|
||||||
}
|
}
|
||||||
|
|||||||
Loading…
x
Reference in New Issue
Block a user