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
|
#include "libft_test.h"
TEST_GROUP(ft_bsearch);
TEST_SETUP(ft_bsearch)
{}
TEST_TEAR_DOWN(ft_bsearch)
{}
TEST(ft_bsearch, basic)
{
int arr[] = {3, 4, 1, 2, 7, 189, -1, -134, 7, 1, 34};
t_ftsearch_const consts;
int a = 189;
consts.key = &a;
consts.compar = ft_compar_int;
size_t nelp = sizeof(arr) / sizeof(int);
qsort(arr, nelp, sizeof(int), ft_compar_int);
void *ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
TEST_ASSERT_EQUAL_PTR(bsearch(consts.key, arr, nelp, sizeof(int), consts.compar), ptr);
int b = 123;
consts.key = &b;
ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
TEST_ASSERT_NULL(ptr);
int c = -134;
consts.key = &c;
ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
TEST_ASSERT_EQUAL_PTR(bsearch(consts.key, arr, nelp, sizeof(int), consts.compar), ptr);
int e = 1;
consts.key = &e;
ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
TEST_ASSERT_EQUAL_PTR(bsearch(consts.key, arr, nelp, sizeof(int), consts.compar), ptr);
int d = -1;
consts.key = &d;
ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
TEST_ASSERT_EQUAL_PTR(bsearch(consts.key, arr, nelp, sizeof(int), consts.compar), ptr);
int f = 34;
consts.key = &f;
ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
TEST_ASSERT_EQUAL_PTR(bsearch(consts.key, arr, nelp, sizeof(int), consts.compar), ptr);
int g = 7;
consts.key = &g;
ptr = ft_bsearch(arr, nelp, sizeof(int), &consts);
TEST_ASSERT_EQUAL_PTR(bsearch(consts.key, arr, nelp, sizeof(int), consts.compar), ptr);
}
|
