summaryrefslogtreecommitdiff
path: root/themes/TreeShape.h~
blob: 14ea76565a7b4a50bf87d90e38a97a842739b8ca (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
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
#include "Renderer2d.h"
#include "types.h"
#include "mathlib.h"

struct TreeBranch {
	float32 width = 0.f;
	float32 height = 0.f;
	Vector2 position; // Center point
	Vector2 direction = Vector2 { 1.f, 0.f };
	Vector4 color = Vector4 { 1.f, 0.f, 0.f, 1.f };

	void fillVertices(Renderer2dVertex* vertices) {
		vertices[0] = {
			Vector2 { position.x - width / 2.f, position.y },
			color
		};
		vertices[1] = {
			Vector2 { position.x + width / 2.f, position.y },
			color
		};
		vertices[2] = {
			Vector2 { position.x - width / 2.f, position.y + height },
			color
		};
		vertices[3] = {
			Vector2 { position.x - width / 2.f, position.y + height },
			color
		};
		vertices[4] = {
			Vector2 { position.x + width / 2.f, position.y + height },
			color
		};
		vertices[5] = {
			Vector2 { position.x + width / 2.f, position.y },
			color
		};
	}
};

struct TreeShape {
	Renderer2dShape shape;

	float32 height             = 100.f; // Height of the whole tree
	float32 width              = 50.f;  // Width of the whole tree
    int32 divisionsPerBranch   = 2;     // How many branches to split into at each branch split
    int32 numBranchLevels      = 8;     // How many branch levels to display
	float32 animateTimeSeconds = 2.f;   // How long it takes the tree to form

	void load(Renderer2d* renderer) {
		int32 numBranches = divisionsPerBranch * numBranchLevels;
		TreeBranch* branches = new TreeBranch[numBranches];
		TreeBranch trunk = branches[0];

		int32 numVertices = 6 * numBranches;
		Renderer2dVertex* vertices = new Renderer2dVertex[numVertices];

		

		trunk.width = width;
		trunk.height = height;
		trunk.position = Vector2 { 0.f, 0.f };
		trunk.direction = Vector2 { 1.f, 0.f };
		trunk.fillVertices(&vertices[0]);

		shape.load(vertices, numVertices, renderer);

		delete[] branches;
		delete[] vertices;
	}

	void createBranch(TreeBranch* branchList, int32 numBranches, int32* branchIndex, int32 branchLevel, float32 width, float32 height, Vector2 position, Vector2 direction, Renderer2dVertex* vertices) {
		branch->width = width;
		branch->height = height;
		branch->position = position;
		branch->direction = direction;
		branch->fillIinVertices(&vertices[&branchIndex * 6]);

		if (branchLevel == numBranchLevels) {
			return;
		}

		float32 branchWidth = width / divisionsPerBranch;
		float32 branchHeight = height / divisionsPerBranch;
		Vector2 branchPosition = branch->position + (height * branch->direction);
		
		for (int division = 0; division < divisionsPerBranch; division++) {
			(*branchIndex)++;
			createBranch(branchList, numBranches, branchIndex, branchLevel + 1, branchWidth, branchHeight, 
		}
	}

	void update(float32 dtSeconds) {

	}
	
	void render(Renderer2d* renderer) {
		shape.render(renderer);
	}
	
	void unload() {
		shape.unload();
	}
};