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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include "main.h"
#include "list.h"
#include "index.h"
static int* index_newInt(int x)
{
int *new;
new = malloc( sizeof(int) );
*new = x;
return new;
}
static void printIndex(list_t *list)
{
int i;
printf("printIndex\n");
for( i = 0 ; i < list->count ; i++ )
{
int thisIndex;
thisIndex = *(int *)list->list[i];
printf("%d\n", thisIndex);
}
}
#ifdef CHECK_INDEX
static void checkIndex(list_t *list)
{
int index, thisIndex;
int i;
//printf("check index\n");
if( list->count == 0 )
{
printf("nothing\n");
return;
}
thisIndex = *(int *)list->list[0];
for( i = 1 ; i < list->count ; i++ )
{
index = *(int *)list->list[i];
//printf("check %d\n", index);
if( index <= thisIndex )
{
printIndex(list);
assert( ! "error" );
}
thisIndex = index;
}
}
#endif
list_t* newIndex()
{
return newList();
}
int addToIndex(list_t *list, int index)
{
int min, max;
int point;
int point_index;
int len;
len = list->count;
//printf("addToIndex (%p, %d)\n", list, index);
//printIndex(list);
min = 0;
max = len-1;
for(;;)
{
point = min + ( max - min ) / 2;
if( max < 0 )
{
insList(list, 0, index_newInt(index));
#ifdef CHECK_INDEX
checkIndex(list);
#endif
return 0;
}
if( min >= len )
{
addList(list, index_newInt(index) );
#ifdef CHECK_INDEX
checkIndex(list);
#endif
return len;
}
point_index = *(int *)list->list[point];
if( min > max )
{
insList(list, point, index_newInt(index) );
#ifdef CHECK_INDEX
checkIndex(list);
#endif
return point;
}
if( index > point_index )
{
min = point + 1;
continue;
}
if( index < point_index )
{
max = point - 1;
continue;
}
}
}
int getFormIndex(list_t *list, int index)
{
int point_index;
int len;
int min, max;
int point;
//printf("getFormIndex %d\n", index);
//printIndex(list);
len =list->count;
min = 0;
max = len-1;
for(;;)
{
point = min + ( max - min ) / 2;
if( max < 0 || point >= len || max < min )
{
return -1;
}
point_index = *(int *)list->list[point];
if( point_index == index )
{
return point;
}
if( index > point_index )
{
min = point + 1;
continue;
}
if( index < point_index )
{
max = point - 1;
continue;
}
}
}
void delFromIndex(list_t *list, int index)
{
int offset;
offset = getFormIndex(list, index);
assert( offset != -1 );
delListItem(list, offset, free);
}
void destroyIndex(list_t *list)
{
assert( list != NULL);
destroyListItem(list, free);
}
|