int main()
{
int i;
int *array;
i = -1;
array = ft_range(0, 0);
while (++i < 10)
printf("%d\n", array[i]);
return (0);
}
int main(void)
{
int *t;
t = ft_range(6, 6);
if(t)
{
printf("%d", t[0]);
}
return (0);
}
int main()
{
int *res, i, max;
max = 5;
res = ft_range(1,max);
for (i = 0; i < max -1; i++){
ft_putnbr(res[i]);
ft_putchar('\n');
}
return 0;
}
int main()
{
int min = 5;
int max = 10;
int *tab1;
int i;
tab1 = ft_range(min, max);
for (i = 0; i < (max - min); i++)
printf(" %d,",tab1[i]);
return (0);
}
int main(int ac, char **av)
{
int min;
int max;
if (ac == 3)
{
min = ft_atoi(av[1]);
max = ft_atoi(av[2]);
if (max > min)
put_tab(ft_range(min, max), max - min);
}
return (0);
}
void test(char *t_min, char *t_max)
{
int min;
int max;
int len;
int *tab;
min = ft_atoi(t_min);
max = ft_atoi(t_max);
len = max - min;
tab = ft_range(min, max);
if (len > 0 && *tab)
ft_put_t_nbr(tab, len);
}
int main(void)
{
time_t start_t, end_t;
double diff_t;
int data[TEST_CASES][2];
int *tab;
int min;
int max;
int i;
int j;
ft_add_test_case(&data[0][0], 10, 100);
ft_add_test_case(&data[1][0], 50, 49);
ft_add_test_case(&data[2][0], 14, 374);
ft_add_test_case(&data[3][0], 0, 0);
ft_add_test_case(&data[4][0], 32, 8);
ft_add_test_case(&data[5][0], 3, 45);
i = 0;
while (i < TEST_CASES)
{
ft_get_values(&data[i][0], &min, &max);
time(&start_t);
tab = ft_range(min, max);
time(&end_t);
diff_t = difftime(end_t, start_t);
printf("min: %i, max: %i, tab_pointer: %p, execution time = %f\n", min, max, tab, diff_t);
if (min >= max && tab != 0)
{
printf("Pointer to tab is not NULL when min >= max !\n");
FAKE_N_GAY;
}
j = -1;
while (min < max)
if (tab[++j] != min++) FAKE_N_GAY;
if (diff_t >= 2.0)
SNAIL;
++i;
}
GOES;
}
