blob: 8dbe68668e48f2348455e42b9be8957ccfff6f4a (
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
|
#include "level.h"
#include <stdlib.h>
void addRoom(LEVEL *lvl, ROOM *room) {
lvl->nRooms++;
lvl->rooms = realloc(lvl->rooms, lvl->nRooms*sizeof(ROOM));
lvl->rooms[lvl->nRooms-1] = *room;
}
void deleteRoom(LEVEL *lvl, unsigned int n) {
int i;
lvl->nRooms--;
for(i = n; i < lvl->nRooms; i++)
lvl->rooms[i] = lvl->rooms[i+1];
lvl->rooms = realloc(lvl->rooms, lvl->nRooms*sizeof(ROOM));
}
void addVertex(ROOM *room, VERTEX *v) {
room->nVertices++;
room->vertices = realloc(room->vertices, room->nVertices*sizeof(VERTEX));
room->vertices[room->nVertices-1] = *v;
}
void insertVertex(ROOM *room, VERTEX *v, unsigned int n) {
int i;
if(n > room->nVertices)
n = room->nVertices;
room->nVertices++;
room->vertices = realloc(room->vertices, room->nVertices*sizeof(VERTEX));
for(i = room->nVertices-1; i > n; i--)
room->vertices[i] = room->vertices[i-1];
room->vertices[n] = *v;
}
void deleteVertex(ROOM *room, unsigned int n) {
int i;
room->nVertices--;
for(i = n; i < room->nVertices; i++)
room->vertices[i] = room->vertices[i+1];
room->vertices = realloc(room->vertices, room->nVertices*sizeof(VERTEX));
}
void freeLevel(LEVEL *lvl) {
int i;
if(lvl) {
if(lvl->rooms) {
for(i = 0; i < lvl->nRooms; i++) {
if(lvl->rooms[i].vertices)
free(lvl->rooms[i].vertices);
}
free(lvl->rooms);
}
free(lvl);
}
}
|