- Basic RTTI type data with inheritance.

source/core/event.cpp

@@ -39,7 +39,7 @@ void event::remove_listener(event_listener* listener) {
 }
 
 void event::dispatch(event* event) {
-	for (auto& it : listeners[event->type]) {
+	for (auto& it : listeners[event->get_type().id()]) {
 		it->handle_event(event);
 	}
 }

source/lang/filesystem/file.cpp

@@ -21,8 +21,8 @@
 #include <stdlib.h>
 #include <bits/posix2_lim.h>
 
-#include <fennec/langproc/filesystem/file.h>
-#include <fennec/langproc/filesystem/path.h>
+#include <fennec/lang/filesystem/file.h>
+#include <fennec/lang/filesystem/path.h>
 
 
 #ifdef FENNEC_COMPILER_MSVC

source/lang/filesystem/path.cpp

@@ -17,7 +17,7 @@
 // =====================================================================================================================
 
 
-#include <fennec/langproc/filesystem/path.h>
+#include <fennec/lang/filesystem/path.h>
 
 namespace fennec
 {

source/langcpp/assert.cpp

@@ -16,7 +16,7 @@
 //  along with this program.  If not, see <https://www.gnu.org/licenses/>.
 // =====================================================================================================================
 
-#include <fennec/lang/detail/_stdlib.h>
+#include <fennec/langcpp/detail/_stdlib.h>
 
 using assert_handler = void (*)(const char *, const char *, int , const char *);
 

source/memory/new.cpp

@@ -16,7 +16,7 @@
 //  along with this program.  If not, see <https://www.gnu.org/licenses/>.
 // =====================================================================================================================
 
-#include <fennec/lang/detail/_stdlib.h>
+#include <fennec/langcpp/detail/_stdlib.h>
 
 #include <fennec/memory/new.h>
 

source/platform/linux/platform.cpp

@@ -16,10 +16,10 @@
 //  along with this program.  If not, see <https://www.gnu.org/licenses/>.
 // =====================================================================================================================
 
-#include <fennec/langproc/filesystem/file.h>
+#include <fennec/lang/filesystem/file.h>
 #include <fennec/platform/linux/platform.h>
 
-#include <fennec/lang/startup.h>
+#include <fennec/langcpp/startup.h>
 
 namespace fennec
 {

source/scene/scene.cpp

@@ -0,0 +1,71 @@
+// =====================================================================================================================
+//  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/>.
+// =====================================================================================================================
+
+///
+/// \file scene.h
+/// \brief
+///
+///
+/// \details
+/// \author Medusa Slockbower
+///
+/// \copyright Copyright © 2025 Medusa Slockbower ([GPLv3](https://www.gnu.org/licenses/gpl-3.0.en.html))
+///
+///
+
+#include <fennec/scene/scene.h>
+#include <fennec/scene/scene_node.h>
+
+namespace fennec
+{
+
+scene_node* scene::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 _table[n].value;
+		}
+
+		// Pre-Order traversal
+		parse.push_front(next(n));
+		parse.push_front(child(n));
+		parse.pop_front();
+	}
+	return nullptr;
+}
+
+scene_node* scene::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 _table[n].value;
+		}
+
+		// Pre-Order traversal
+		parse.push_front(next(n));
+		parse.push_front(child(n));
+		parse.pop_front();
+	}
+	return nullptr;
+}
+
+}