-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdh_list_util.c
More file actions
72 lines (65 loc) · 2.12 KB
/
dh_list_util.c
File metadata and controls
72 lines (65 loc) · 2.12 KB
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
60
61
62
63
64
65
66
67
68
69
70
71
72
/* list_util - simple glist utilities
Copyright (C) 2022 Dream Helium
This file is part of litematica_reader_c.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>. */
#include "dh_list_util.h"
#include "dh_string_util.h"
static int strstr_to_int(gconstpointer element, gconstpointer user_data)
{
char* ret = strstr(element, user_data);
if(ret) return 0;
else return -1;
}
GList *dh_search_in_list(GList *list, const char *name)
{
GList* ret = NULL;
if(list == NULL)
return NULL;
else
{
while(list)
{
/* Find the first corresponding item */
list = g_list_find_custom(list, name, strstr_to_int);
if(list)
{
ret = g_list_append(ret, dh_strdup(list->data));
/* Force update */
list = list->next;
}
/* Else there's no corresponding item, finish */
}
return ret;
}
}
GList* dh_search_in_list_custom(GList* list, gconstpointer data, GCompareFunc func)
{
GList* ret = NULL;
if(list == NULL)
return NULL;
else
{
while(list)
{
/* Find the first corresponding item */
list = g_list_find_custom(list, data, func);
if(list)
{
ret = g_list_append(ret, list->data);
/* Force update */
list = list->next;
}
/* Else there's no corresponding item, finish */
}
return ret;
}
}