blob: 9538a35055c69e3397859bb883d16625afdeacb3 (
plain)
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
|
/*
* boxvec.h
*
* 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/>.
*
*/
#ifndef BOXVEC_H
#define BOXVEC_H
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <stdlib.h>
#include <string.h>
#include <assert.h>
/* A vector of boxes */
struct boxvec
{
int n_boxes;
int max_boxes;
struct wrap_box **boxes;
};
/* Length of a boxvec */
extern int bv_len(struct boxvec *vec);
/* Create a bxvec or boxvec */
extern struct boxvec *bv_new(void);
/* Ensure space in a bxvec or boxvec */
extern int bv_ensure_space(struct boxvec *vec, int n);
/* Add to a bxvec or boxvec */
extern int bv_add(struct boxvec *vec, struct wrap_box *bx);
/* (Find and then) delete a box from a boxvec */
extern void bv_del(struct boxvec *vec, struct wrap_box *bx);
/* Add a new box after the specified one */
extern int bv_add_after(struct boxvec *vec, struct wrap_box *bx,
struct wrap_box *add);
/* Get a box from a boxvec or bxvec */
extern struct wrap_box *bv_box(struct boxvec *vec, int i);
extern struct wrap_box *bv_last(struct boxvec *vec);
/* Free a bxvec or boxvec */
extern void bv_free(struct boxvec *vec);
#endif /* BOXVEC_H */
|
