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
|
/*
* boxvec.c
*
* Copyright © 2016 Thomas White <taw@bitwiz.org.uk>
*
* This file is part of Colloquium.
*
* Colloquium 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 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include "boxvec.h"
int bv_len(struct boxvec *vec)
{
return vec->n_boxes;
}
extern struct boxvec *bv_new()
{
struct boxvec *n = malloc(sizeof(struct boxvec));
if ( n == NULL ) return NULL;
n->n_boxes = 0;
n->max_boxes = 0;
n->boxes = NULL;
return n;
}
int bv_ensure_space(struct boxvec *vec, int n)
{
struct wrap_box **t;
if ( vec == NULL ) return 1;
if ( vec->max_boxes > n ) return 0;
n = (n/32)*32 + 32;
t = realloc(vec->boxes, n*sizeof(struct wrap_box *));
if ( t == NULL ) return 1;
vec->boxes = t;
return 0;
}
int bv_add(struct boxvec *vec, struct wrap_box *bx)
{
if ( vec == NULL ) return 1;
if ( bv_ensure_space(vec, vec->n_boxes+1) ) return 1;
vec->boxes[vec->n_boxes++] = bx;
return 0;
}
static int find_box(struct boxvec *vec, struct wrap_box *bx)
{
int i = 0;
while ( (i<vec->n_boxes) && (vec->boxes[i] != bx) ) i++;
return i;
}
void bv_del(struct boxvec *vec, struct wrap_box *bx)
{
int n = find_box(vec, bx);
if ( n == vec->n_boxes ) {
fprintf(stderr, "Couldn't find box to delete it!\n");
return;
}
assert(vec->boxes[n] == bx);
if ( n < vec->n_boxes-1 ) {
memmove(&vec->boxes[n], &vec->boxes[n+1],
(vec->n_boxes-n-1)*sizeof(struct wrap_box *));
}
vec->n_boxes--;
}
struct wrap_box *bv_box(struct boxvec *vec, int i)
{
assert(vec != NULL);
if ( i >= vec->n_boxes ) return NULL;
return vec->boxes[i];
}
struct wrap_box *bv_last(struct boxvec *vec)
{
if ( vec == NULL ) return NULL;
if ( vec->boxes == NULL ) return NULL;
return vec->boxes[vec->n_boxes-1];
}
void bv_free(struct boxvec *vec)
{
if ( vec == NULL ) return;
free(vec->boxes);
free(vec);
}
|
