/
tree.h
126 lines (99 loc) · 3.42 KB
/
tree.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
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
/*
Copyright (c) 2011, The Mineserver Project
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the The Mineserver Project nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef _TREE_H_
#define _TREE_H_
#include <stack>
#include "tr1.h"
#include TR1INCLUDE(memory)
#include TR1INCLUDE(array)
#include "constants.h"
#include "mineserver.h"
#include "map.h"
#include "vec.h"
enum { MAX_TRUNK = 13, MIN_TRUNK = 5, MAX_CANOPY = 4, MIN_CANOPY = 3 ,
BRANCHING_HEIGHT = 7, BRANCHING_CHANCE = 10,
MIN_TREE_SPACE = 5
};
class ITree
{
public:
ITree(int32_t x, int32_t y, int32_t z, int map, uint8_t block = BLOCK_AIR, char meta = 0)
: _x(x), _y(y), _z(z), _map(map), _type(block), _meta(meta)
{
}
virtual ~ITree() { }
inline virtual void update()
{
Mineserver::get()->map(_map)->setBlock(_x, _y, _z, _type, _meta);
Mineserver::get()->map(_map)->sendBlockChange(_x, _y, _z, _type, _meta);
}
int32_t _x;
int32_t _y;
int32_t _z;
protected:
int _map;
uint8_t _type;
char _meta;
};
class Trunk : public ITree
{
public:
Trunk(int32_t x, int32_t y, int32_t z, int map, char meta = 0)
: ITree(x, y, z, map, BLOCK_WOOD, meta)
{
update();
}
};
typedef std::tr1::shared_ptr<Trunk> TrunkPtr;
class Canopy : public ITree
{
public:
Canopy(int32_t x, int32_t y, int32_t z, int map, char meta = 0)
: ITree(x, y, z, map, BLOCK_LEAVES, meta)
{
update();
}
};
class Tree : public ITree
{
public:
Tree(int32_t x, int32_t y, int32_t z, int map, uint8_t limit = MAX_TRUNK)
: ITree(x, y, z, map), n_branches(0)
{
generate(limit);
}
void generate(uint8_t);
private:
void set(int32_t xloc, int32_t yloc, int32_t zloc, int blocktType, char metaData);
std::tr1::array<TrunkPtr, 256> m_Branch; // 1KB on x86 and 2KB on x86_64 Faster than stack or vector tho :)
// With full array of allocated classes it rounds up to...
// 3.6KB on x86 :F 4.6KB on x86_64
// it is a good enough buffer for absolutely MASSIVE MASSIVE TREES
// Like in Avatar *_*
uint8_t n_branches;
void generateCanopy();
void generateBranches(TrunkPtr);
};
#endif