Medusa Slockbower
992a02db3e
- Began new overarching window interface - Began outlining renderer interfaces - Began a binary tree implementation in bintree.h, this will act as a generalized binary tree, then red-black tree will be implemented on top of it for sequences (ordered sets)
48 lines
1.5 KiB
C++
48 lines
1.5 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/>.
|
|
// =====================================================================================================================
|
|
|
|
#include <fennec/platform/interface/platform.h>
|
|
|
|
namespace fennec
|
|
{
|
|
|
|
template<typename CtorT>
|
|
static constexpr void insert_driver(list<platform::driver<CtorT>>& drvrs, CtorT ctor, int priority) {
|
|
using list_t = list<platform::driver<CtorT>>;
|
|
using iter_t = typename list_t::iterator;
|
|
|
|
iter_t it = drvrs.begin();
|
|
while (it != drvrs.end()) {
|
|
if (priority >= it->priority) {
|
|
break;
|
|
}
|
|
}
|
|
drvrs.insert(it, { priority, ctor });
|
|
}
|
|
|
|
void platform::initialize() {
|
|
}
|
|
|
|
void platform::shutdown() {
|
|
}
|
|
|
|
window* platform::create_window(const window::config& config) {
|
|
|
|
}
|
|
|
|
} |