69 lines
1.4 KiB
C
69 lines
1.4 KiB
C
#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);
|
|
}
|
|
}
|