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
|
#include "songvec.h"
#include "utils.h"
/* Only used for sorting/searchin a songvec, not general purpose compares */
static int songvec_cmp(const void *s1, const void *s2)
{
const Song *a = ((const Song * const *)s1)[0];
const Song *b = ((const Song * const *)s2)[0];
return strcmp(a->url, b->url);
}
static size_t sv_size(struct songvec *sv)
{
return sv->nr * sizeof(Song *);
}
void songvec_sort(struct songvec *sv)
{
qsort(sv->base, sv->nr, sizeof(Song *), songvec_cmp);
}
Song *songvec_find(struct songvec *sv, const char *url)
{
int i;
for (i = sv->nr; --i >= 0; )
if (!strcmp(sv->base[i]->url, url))
return sv->base[i];
return NULL;
}
int songvec_delete(struct songvec *sv, Song *del)
{
int i;
for (i = sv->nr; --i >= 0; ) {
if (sv->base[i] != del)
continue;
/* we _don't_ call freeSong() here */
if (!--sv->nr) {
free(sv->base);
sv->base = NULL;
} else {
memmove(&sv->base[i], &sv->base[i + 1],
(sv->nr - i + 1) * sizeof(Song *));
sv->base = xrealloc(sv->base, sv_size(sv));
}
return i;
}
return -1; /* not found */
}
void songvec_add(struct songvec *sv, Song *add)
{
++sv->nr;
sv->base = xrealloc(sv->base, sv_size(sv));
sv->base[sv->nr - 1] = add;
}
void songvec_free(struct songvec *sv)
{
if (sv->base) {
free(sv->base);
sv->base = NULL;
}
sv->nr = 0;
}
|
