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
|
/**
** Objiter.h - Game objects iterator.
**
** Written: 5/27/2002 - JSF
**/
/*
Copyright (C) 2002-2022 The Exult Team
This program 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 2
of the License, or (at your option) any later version.
This program 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, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#include "objiter.h"
#include "chunks.h"
#include "contain.h"
#include "gamewin.h"
/*
* Create to start after/before a given object within a chunk.
*/
template <class D>
D_Recursive_object_iterator<D>::D_Recursive_object_iterator(
Game_object* start // Start here.
)
: child(nullptr),
elems(start->get_outermost()->get_chunk()->get_objects()) {
// Get what obj. is in (or itself).
Game_object* owner = start->get_outermost();
Game_object* obj; // Find owner within its chunk.
while ((obj = get_next()) != nullptr && obj != owner)
;
if (!obj) {
return; // Bad. It wasn't found.
}
if (obj != start) { // Given object contained?
// Look within for it.
while ((obj = get_next()) != nullptr && obj != start)
;
}
}
/*
* Get next game object, going down recursively into containers.
*
* Output: Next in world, or nullptr if done.
*/
template <class D>
Game_object* D_Recursive_object_iterator<D>::get_next() {
Game_object* obj;
if (child) { // Going through container?
obj = child->get_next();
if (obj) {
return obj;
}
delete child;
child = nullptr; // Child done.
}
obj = elems.get_next(); // Get next from our list.
if (!obj) {
return nullptr; // All done.
}
// Is it a container?
Container_game_object* c = obj->as_container();
if (c) { // Container? Set to go through it.
child = new D_Recursive_object_iterator<D>(c->get_objects());
}
return obj;
}
|
