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
73
74
75
76
77
78
79
80
|
/*
* This file is part of the MLV Library.
*
* Copyright (C) 2012 Adrien Boussicault, Marc Zipstein
*
*
* This Library is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This Library 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this Library. If not, see <http://www.gnu.org/licenses/>.
*/
#include "list.h"
#include "memory_management.h"
MLV_List* MLV_prepend_list( MLV_List* list, void* data ){
MLV_List* result = MLV_MALLOC( 1, MLV_List );
if( list ){
list->previous = result;
}
result->previous = NULL;
result->next = list;
result->data = data;
return result;
}
void MLV_free_list( MLV_List* list ){
if( list ){
MLV_free_list( list->next );
MLV_FREE( list, MLV_List );
}
}
void MLV_foreach_list(
MLV_List* list,
void (* function )( void* data, void* user_data ),
void* user_data
){
while( list ){
function( list->data, user_data );
list = list->next;
}
}
MLV_List* MLV_find_list( MLV_List* list, void* data ){
while( list ){
if( list->data == data ){
break;
}
list = list->next;
}
return list;
}
MLV_List* MLV_remove_list( MLV_List* list, void* data ){
MLV_List* result;
MLV_List* elem = MLV_find_list( list, data );
if( elem->previous ){
elem->previous->next = elem->next;
}
if( elem->next ){
elem->next->previous = elem->previous;
}
if( elem==list ){
result = elem->next;
}else{
result = list;
}
MLV_FREE( elem, MLV_List );
return result;
}
|
