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
|
#ifndef MULTI_TILE_PATTERN_HPP_INCLUDED
#define MULTI_TILE_PATTERN_HPP_INCLUDED
#include <boost/regex.hpp>
#include <boost/shared_ptr.hpp>
#include <deque>
#include <string>
#include <vector>
#include "geometry.hpp"
#include "level_object.hpp"
#include "variant.hpp"
const boost::regex& get_regex_from_pool(const std::string& key);
class multi_tile_pattern
{
public:
//all multi tile patterns loaded. This is a deque meaning callers can
//save pointers to members, knowing they will never be destroyed.
static const std::deque<multi_tile_pattern>& get_all();
static void init(variant node);
static void load(variant node, const std::string& tile_id);
multi_tile_pattern(variant node, const std::string& tile_id);
struct tile_entry {
level_object_ptr tile;
int zorder;
};
struct tile_info {
const boost::regex* re;
std::vector<tile_entry> tiles;
};
const std::string& id() const { return id_; }
const tile_info& tile_at(int x, int y) const;
int width() const;
int height() const;
int chance() const { return chance_; }
const multi_tile_pattern& choose_random_alternative(int seed) const;
struct match_cell {
point loc;
int run_length;
};
//the order to try matches in, optimized to eliminate things as soon
//as we possibly can.
const std::vector<match_cell>& try_order() const { return try_order_; }
private:
std::string default_tile_id_;
std::string id_;
std::vector<tile_info> tiles_;
std::vector<boost::shared_ptr<multi_tile_pattern> > alternatives_;
std::vector<match_cell> try_order_;
int width_, height_;
int chance_;
};
#endif
|
