2 Copyright (C) 2001-2006, William Joseph.
5 This file is part of GtkRadiant.
7 GtkRadiant is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2 of the License, or
10 (at your option) any later version.
12 GtkRadiant is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GtkRadiant; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22 #include "scenegraph.h"
24 #include "debugging/debugging.h"
30 #include "string/string.h"
31 #include "signal/signal.h"
33 #include "instancelib.h"
34 #include "treemodel.h"
36 template<std::size_t SIZE>
38 typedef const char *TypeName;
39 typedef TypeName TypeNames[SIZE];
40 TypeNames m_typeNames;
41 TypeName *m_typeNamesEnd;
44 TypeIdMap() : m_typeNamesEnd(m_typeNames)
48 TypeId getTypeId(const char *name)
50 TypeName *i = std::find_if(m_typeNames, m_typeNamesEnd, [&](const char *other) {
51 return string_equal(name, other);
53 if (i == m_typeNamesEnd) {
54 ASSERT_MESSAGE(m_typeNamesEnd != m_typeNames + SIZE,
55 "reached maximum number of type names supported (" << Unsigned(SIZE) << ")");
56 *m_typeNamesEnd++ = name;
58 return i - m_typeNames;
62 class CompiledGraph : public scene::Graph, public scene::Instantiable::Observer {
63 typedef std::map<PathConstReference, scene::Instance *> InstanceMap;
65 InstanceMap m_instances;
66 scene::Instantiable::Observer *m_observer;
67 Signal0 m_boundsChanged;
68 scene::Path m_rootpath;
69 Signal0 m_sceneChangedCallbacks;
71 TypeIdMap<NODETYPEID_MAX> m_nodeTypeIds;
72 TypeIdMap<INSTANCETYPEID_MAX> m_instanceTypeIds;
76 CompiledGraph(scene::Instantiable::Observer *observer)
77 : m_observer(observer)
81 void addSceneChangedCallback(const SignalHandler &handler)
83 m_sceneChangedCallbacks.connectLast(handler);
88 m_sceneChangedCallbacks();
93 ASSERT_MESSAGE(!m_rootpath.empty(), "scenegraph root does not exist");
94 return m_rootpath.top();
97 void insert_root(scene::Node &root)
99 //globalOutputStream() << "insert_root\n";
101 ASSERT_MESSAGE(m_rootpath.empty(), "scenegraph root already exists");
105 Node_traverseSubgraph(root, InstanceSubgraphWalker(this, scene::Path(), 0));
107 m_rootpath.push(makeReference(root));
112 //globalOutputStream() << "erase_root\n";
114 ASSERT_MESSAGE(!m_rootpath.empty(), "scenegraph root does not exist");
116 scene::Node &root = m_rootpath.top();
120 Node_traverseSubgraph(root, UninstanceSubgraphWalker(this, scene::Path()));
130 void traverse(const Walker &walker)
132 traverse_subgraph(walker, m_instances.begin());
135 void traverse_subgraph(const Walker &walker, const scene::Path &start)
137 if (!m_instances.empty()) {
138 traverse_subgraph(walker, m_instances.find(PathConstReference(start)));
142 scene::Instance *find(const scene::Path &path)
144 InstanceMap::iterator i = m_instances.find(PathConstReference(path));
145 if (i == m_instances.end()) {
151 void insert(scene::Instance *instance)
153 m_instances.insert(InstanceMap::value_type(PathConstReference(instance->path()), instance));
155 m_observer->insert(instance);
158 void erase(scene::Instance *instance)
160 m_observer->erase(instance);
162 m_instances.erase(PathConstReference(instance->path()));
165 SignalHandlerId addBoundsChangedCallback(const SignalHandler &boundsChanged)
167 return m_boundsChanged.connectLast(boundsChanged);
170 void removeBoundsChangedCallback(SignalHandlerId id)
172 m_boundsChanged.disconnect(id);
175 TypeId getNodeTypeId(const char *name)
177 return m_nodeTypeIds.getTypeId(name);
180 TypeId getInstanceTypeId(const char *name)
182 return m_instanceTypeIds.getTypeId(name);
187 bool pre(const Walker &walker, const InstanceMap::iterator &i)
189 return walker.pre(i->first, *i->second);
192 void post(const Walker &walker, const InstanceMap::iterator &i)
194 walker.post(i->first, *i->second);
197 void traverse_subgraph(const Walker &walker, InstanceMap::iterator i)
199 Stack<InstanceMap::iterator> stack;
200 if (i != m_instances.end()) {
201 const std::size_t startSize = (*i).first.get().size();
203 if (i != m_instances.end()
204 && stack.size() < ((*i).first.get().size() - startSize + 1)) {
207 if (!pre(walker, stack.top())) {
209 while (i != m_instances.end()
210 && stack.size() < ((*i).first.get().size() - startSize + 1)) {
215 post(walker, stack.top());
218 } while (!stack.empty());
224 CompiledGraph *g_sceneGraph;
225 GraphTreeModel *g_tree_model;
228 GraphTreeModel *scene_graph_get_tree_model()
234 class SceneGraphObserver : public scene::Instantiable::Observer {
236 void insert(scene::Instance *instance)
238 g_sceneGraph->sceneChanged();
239 graph_tree_model_insert(g_tree_model, *instance);
242 void erase(scene::Instance *instance)
244 g_sceneGraph->sceneChanged();
245 graph_tree_model_erase(g_tree_model, *instance);
249 SceneGraphObserver g_SceneGraphObserver;
251 void SceneGraph_Construct()
253 g_tree_model = graph_tree_model_new();
255 g_sceneGraph = new CompiledGraph(&g_SceneGraphObserver);
258 void SceneGraph_Destroy()
262 graph_tree_model_delete(g_tree_model);
266 #include "modulesystem/singletonmodule.h"
267 #include "modulesystem/moduleregistry.h"
269 class SceneGraphAPI {
270 scene::Graph *m_scenegraph;
272 typedef scene::Graph Type;
274 STRING_CONSTANT(Name, "*");
278 SceneGraph_Construct();
280 m_scenegraph = g_sceneGraph;
285 SceneGraph_Destroy();
288 scene::Graph *getTable()
294 typedef SingletonModule<SceneGraphAPI> SceneGraphModule;
295 typedef Static<SceneGraphModule> StaticSceneGraphModule;
296 StaticRegisterModule staticRegisterSceneGraph(StaticSceneGraphModule::instance());