88 lines
2.8 KiB
C++
88 lines
2.8 KiB
C++
// =====================================================================================================================
|
|
// fennec, a free and open source game engine
|
|
// Copyright © 2025 Medusa Slockbower
|
|
//
|
|
// 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 3 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, see <https://www.gnu.org/licenses/>.
|
|
// =====================================================================================================================
|
|
|
|
#ifndef FENNEC_CORE_SCENE_H
|
|
#define FENNEC_CORE_SCENE_H
|
|
|
|
#include <fennec/containers/rdtree.h>
|
|
#include <fennec/lang/typed.h>
|
|
#include <fennec/langproc/strings/string.h>
|
|
#include <fennec/scene/scene_node.h>
|
|
|
|
|
|
namespace fennec
|
|
{
|
|
|
|
///
|
|
/// \brief Main Scene Hierarchy
|
|
/// \details This structure only contains the names of nodes and defers storage for components to
|
|
/// their respective systems. Simple components may be isolated, \see components.h for more info.
|
|
/// The hierarchy should be displayed using pre-order traversal.
|
|
class scene : public rdtree<scene_node*> {
|
|
|
|
// Access ==============================================================================================================
|
|
public:
|
|
///
|
|
/// \brief Find a node by name.
|
|
/// \details If multiple nodes have the same name, finds the first one in pre-order traversal.
|
|
/// \param name The name of the node to search for
|
|
/// \returns The id of the node, `npos` if not found.
|
|
size_t operator[](const cstring& name) const {
|
|
list<size_t> parse;
|
|
parse.push_back(root);
|
|
while (not parse.empty()) {
|
|
size_t n = parse.front();
|
|
if (_table[n].value->name == name) {
|
|
return n;
|
|
}
|
|
|
|
// Pre-Order traversal
|
|
parse.push_front(next(n));
|
|
parse.push_front(child(n));
|
|
parse.pop_front();
|
|
}
|
|
return npos;
|
|
}
|
|
|
|
///
|
|
/// \brief Find a node by name.
|
|
/// \details If multiple nodes have the same name, finds the first one in pre-order traversal.
|
|
/// \param name The name of the node to search for
|
|
/// \returns The id of the node, `npos` if not found.
|
|
size_t operator[](const string& name) const {
|
|
list<size_t> parse;
|
|
parse.push_back(root);
|
|
while (not parse.empty()) {
|
|
size_t n = parse.front();
|
|
if (_table[n].value->name == name) {
|
|
return n;
|
|
}
|
|
|
|
// Pre-Order traversal
|
|
parse.push_front(next(n));
|
|
parse.push_front(child(n));
|
|
parse.pop_front();
|
|
}
|
|
return npos;
|
|
}
|
|
};
|
|
|
|
}
|
|
|
|
#endif // FENNEC_CORE_SCENE_H
|