test/src/runner/test_runner_algo.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   test_runner_algo.c                                 :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: cacharle <marvin@42.fr>                    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2020/02/13 21:25:52 by cacharle          #+#    #+#             */
/*   Updated: 2020/02/13 21:37:15 by cacharle         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "libft_test.h"


TEST_GROUP_RUNNER(ft_bsearch)
{
	RUN_TEST_CASE(ft_bsearch, basic);
}

TEST_GROUP_RUNNER(ft_compar_int)
{
	RUN_TEST_CASE(ft_compar_int, basic);
}

TEST_GROUP_RUNNER(ft_heapsort)
{
	RUN_TEST_CASE(ft_heapsort, basic);
}

TEST_GROUP_RUNNER(ft_is_set)
{
	RUN_TEST_CASE(ft_is_set, basic);
}

TEST_GROUP_RUNNER(ft_lfind)
{
	RUN_TEST_CASE(ft_lfind, basic);
}

TEST_GROUP_RUNNER(ft_lsearch)
{
	RUN_TEST_CASE(ft_lsearch, basic);
}

TEST_GROUP_RUNNER(ft_mergesort)
{
	RUN_TEST_CASE(ft_mergesort, basic);
}

TEST_GROUP_RUNNER(ft_qsort)
{
	RUN_TEST_CASE(ft_qsort, basic);
}

TEST_GROUP_RUNNER(ft_reverse)
{
	RUN_TEST_CASE(ft_reverse, basic);
}