-
Notifications
You must be signed in to change notification settings - Fork 0
/
Maze.h
39 lines (25 loc) · 953 Bytes
/
Maze.h
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
#ifndef MAZELIB_H
#define MAZELIB_H
/* Overarching Maze class; controls all features of generating a maze. */
#include "MazeSpace.h"
#include "MazeFloor.h"
#include "MazeAlgorithm.h"
#include <map>
namespace Maze {
class Maze {
private:
typedef unsigned short ushort;
// Floors will be regarded as descending (level 0 goes down to level 1, etc)
std::vector<Floor> floors;
public:
// There will be no concept of predefined edge spaces, i.e. walls or
// something, by default. The maze spans the entire area.
Maze(ushort width, ushort height, ushort numFloors);
void GenerateMaze(const Algorithm* alg);
void GenerateMaze(const std::vector<Algorithm*> algs);
// TODO: have a RenderAsText version that doesn't take the map, isn't
// intended for structures, and will show any structures as * or something
void RenderAsText(uchar spacing, std::map<ushort, char> structviews);
};
}
#endif