[go: up one dir, main page]

Menu

[dc7c97]: / src / grid-factory.cc  Maximize  Restore  History

Download this file

83 lines (72 with data), 2.5 kB

 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
/* -*- Mode: C; indent-tabs-mode: t; c-basic-offset: 4; tab-width: 4 -*- */
/*
* mazen-ng
* Copyright (C) Jacob Zimmermann 2009 <jacob@jzimm.net>
*
* mazen-ng is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* mazen-ng is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#pragma implementation
#include "grid-factory.h"
#include "grid-maze.h"
#include "grid-view.h"
GridMazeFactory::GridMazeFactory (int size, int n_trees, int n_floating_trees) {
this->size = size;
this->n_trees = n_trees;
this->n_floating_trees = n_floating_trees;
}
void GridMazeFactory::set_size (int n) {
if (size != n) {
int old_max_trees = get_max_trees ();
int old_max_floating_trees = get_max_floating_trees ();
size = n;
size_changed (n);
int new_max_trees = get_max_trees ();
if (new_max_trees != old_max_trees)
trees_max_changed(new_max_trees);
if (n_trees >= new_max_trees) {
n_trees = new_max_trees - 1;
trees_changed (n_trees);
}
int new_max_floating_trees = get_max_floating_trees ();
if (new_max_floating_trees != old_max_floating_trees)
floating_trees_max_changed (new_max_floating_trees);
if (n_floating_trees >= new_max_floating_trees) {
n_floating_trees = new_max_floating_trees - 1;
floating_trees_changed (n_floating_trees);
}
}
}
void GridMazeFactory::set_trees (int n) {
if (n_trees != n) {
int old_max_floating_trees = get_max_floating_trees ();
n_trees = n;
trees_changed (n);
int new_max_floating_trees = get_max_floating_trees ();
if (new_max_floating_trees != old_max_floating_trees)
floating_trees_max_changed (new_max_floating_trees);
if (n_floating_trees > new_max_floating_trees) {
n_floating_trees = new_max_floating_trees;
floating_trees_changed (n_floating_trees);
}
}
}
void GridMazeFactory::set_floating_trees (int n) {
if (n_floating_trees != n) {
n_floating_trees = n;
floating_trees_changed (n_floating_trees);
}
}
int GridMazeFactory::get_max_floating_trees () const {
return get_max_trees () - n_trees;
}