#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "all_functions.h"

#define MAX_PRECIOUS pow(10, -6)

void test_u1()
{
    array begin = (array)calloc(5, sizeof(double));
    array end = begin + 5;
    begin[0] = 1;
    begin[1] = 2;
    begin[2] = 3;
    begin[3] = 4;
    begin[4] = 5;
    printf("Calculate_u1_test Test#1:  %d\n", fabs(2.605171 - calculate_u1(begin, end)) < MAX_PRECIOUS);
    free(begin);
}

void test_u2()
{
    array begin_f = (array)calloc(3, sizeof(double));
    array end_f = begin_f + 3;
    begin_f[0] = 3;
    begin_f[1] = 4;
    begin_f[2] = 5;
    printf("Calculate_u2_test Test#1:  %d\n", fabs(1.666667 - u2_calculate(begin_f, end_f)) < MAX_PRECIOUS);
    free(begin_f);
}

void delete_less_than_u1_test()
{
    array begin_f = (array)malloc(5 * sizeof(double));
    array end_f = begin_f + 5;
    begin_f[0] = 1;
    begin_f[1] = 2;
    begin_f[2] = 3;
    begin_f[3] = 4;
    begin_f[4] = 5;
    int result = 0, n = 5;
    delete_less_than_u1(begin_f, &end_f, 2.605171, n);
    if (end_f - begin_f == 3 && begin_f[0] == 3 && begin_f[1] == 4 && begin_f[2] == 5)
        result = 1;
    printf("Calculate_less_than_u1_deletion Test#1:  %d\n", result);
    end_f = begin_f + 5;
    n = 5;
    begin_f[0] = 1;
    begin_f[1] = 1;
    begin_f[2] = 1;
    begin_f[3] = 1;
    begin_f[4] = 1;
    printf("Calculate_less_than_u1_deletion Test#2:  %d\n", NO_ELEMENTS_DELETED == delete_less_than_u1(begin_f, &end_f, 1, n));
    end_f = begin_f + 5;
    begin_f[0] = -1;
    begin_f[1] = -1;
    begin_f[2] = -1;
    begin_f[3] = -1;
    begin_f[4] = -1;
    n = 5;
    printf("Calculate_less_than_u1_deletion Test#3:  %d\n", ALL_ELEMENTS_DELETED == delete_less_than_u1(begin_f, &end_f, 1, n));
    free(begin_f);
}

int main()
{
    test_u2();
    test_u1();
    delete_less_than_u1_test();
    return SUCCESS;
}