blob: 0755889e20614bf8a93dc694abc56c06f90940d7 (
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
40
41
42
43
44
45
46
47
48
49
50
51
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_htset.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: cacharle <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2020/01/30 08:41:52 by cacharle #+# #+# */
/* Updated: 2020/02/28 12:11:00 by cacharle ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft.h"
#include "libft_ht.h"
/*
** Create/Update a entry in an hash table.
** If `key` already exist in `ht`, updates only the list element content.
** else create a new list node in addition the list content.
** Return a pointer to the created entry, NULL if an allocation failed.
*/
t_ftht_content *ft_htset(t_ftht *ht, char *key, void *value,
void (*del)(t_ftht_content*))
{
t_ftht_digest digest;
t_ftht_content *content;
t_ftht_entry entry;
t_ftlst *tmp;
if (ht == NULL || key == NULL)
return (NULL);
if ((content = ft_htcontent_new(key, value)) == NULL)
return (NULL);
digest = ft_hthash(ht, key);
tmp = ft_lstlfind(ht->entries[digest], ft_inter_htkey_cmp, key);
if (tmp != NULL)
{
if (del != NULL)
del(tmp->content);
tmp->content = content;
return ((t_ftht_content*)tmp->content);
}
if ((entry = ft_lstnew(content)) == NULL)
{
del(content);
return (NULL);
}
ft_lstadd_front(ht->entries + digest, entry);
return (content);
}
|
