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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
/*
Copyright (C) 2005 Ricardo Pescuma Domenecci
This is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This 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
Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this file; see the file license.txt. If
not, write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.
*/
#include "mir_dblists.h"
#include "mir_memory.h"
#include <stdio.h>
#include <newpluginapi.h>
#include <m_system.h>
void List_DestroyFreeContents( SortedList* p_list )
{
if ( p_list == NULL )
return;
if ( p_list->items != NULL )
{
int i;
for ( i = 0 ; i < p_list->realCount ; i++ )
{
if ( p_list->items[i] != NULL )
{
mir_free( p_list->items[i] );
}
}
}
List_Destroy( p_list );
}
int List_Append( SortedList* p_list, void* p_value )
{
return List_Insert( p_list, p_value, p_list->realCount );
}
int List_InsertOrdered( SortedList* p_list, void* p_value )
{
int index;
List_GetIndex( p_list, p_value, &index );
List_Insert( p_list, p_value, index );
return index;
}
int List_RemoveByValue( SortedList* p_list, void* p_value )
{
int ret = 0;
if ( p_list->items != NULL )
{
int i;
for ( i = p_list->realCount - 1 ; i >= 0 ; i-- )
{
if ( p_list->items[ i ] == p_value )
ret += List_Remove( p_list, i );
}
}
return ret;
}
int List_RemoveByValueFreeContents( SortedList* p_list, void* p_value )
{
int ret = 0;
if ( p_list->items != NULL )
{
int i;
for ( i = p_list->realCount - 1 ; i >= 0 ; i-- )
{
if ( p_list->items[ i ] == p_value )
{
mir_free( p_list->items[ i ] );
ret += List_Remove( p_list, i );
}
}
}
return ret;
}
void List_Push( SortedList* p_list, void* p_value )
{
List_Insert( p_list, p_value, p_list->realCount );
}
void* List_Pop( SortedList* p_list )
{
void *ret;
if ( p_list->realCount <= 0 )
return NULL;
ret = p_list->items[ p_list->realCount - 1 ];
List_Remove( p_list, p_list->realCount - 1 );
return ret;
}
void* List_Peek( SortedList* p_list )
{
if ( p_list->realCount <= 0 )
return NULL;
return p_list->items[ p_list->realCount - 1 ];
}
BOOL List_HasItens( SortedList* p_list )
{
return p_list->realCount > 0;
}
|
