blob: fd26a88cb9ac0ff2a1f75eabc470e3f2c0e3e163 (
plain)
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
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_is_set.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: cacharle <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2020/01/19 07:17:15 by cacharle #+# #+# */
/* Updated: 2020/04/04 22:33:03 by charles ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft_algo.h"
/*
** \brief Test whether array only contains unique elements
** \param base Array to test
** \param nel Number of element in the array
** \param width Size of an element
** \param compar Comparison function to test if 2 elements are equal
*/
bool ft_is_set(void *base, size_t nel, size_t width,
t_ftcompar_func compar)
{
size_t i;
if (nel < 2)
return (TRUE);
ft_qsort(base, nel, width, compar);
i = 0;
while (i < nel - 1)
{
if (compar(base + (i * width), base + ((i + 1) * width)) == 0)
return (FALSE);
i++;
}
return (TRUE);
}
|
