MrPiglr
9dddce666d
- Forked from Godot Engine 4.7-dev (MIT License) - Rebranded to AeThex Engine with cyan/purple theme - Added AI-powered development assistant module - Integrated Claude API for code completion & error fixing - Custom hexagon logo and branding - Multi-platform CI/CD (Windows, Linux, macOS) - Built Linux editor binary (151MB) - Complete source code with all customizations Tech Stack: - C++ game engine core - AI Module: Claude 3.5 Sonnet integration - Build: SCons, 14K+ source files - License: MIT (Godot) + Custom (AeThex features) Ready for Windows build via GitHub Actions!
95 lines
5.3 KiB
C++
95 lines
5.3 KiB
C++
/**************************************************************************/
|
|
/* pair.h */
|
|
/**************************************************************************/
|
|
/* This file is part of: */
|
|
/* GODOT ENGINE */
|
|
/* https://godotengine.org */
|
|
/**************************************************************************/
|
|
/* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */
|
|
/* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */
|
|
/* */
|
|
/* Permission is hereby granted, free of charge, to any person obtaining */
|
|
/* a copy of this software and associated documentation files (the */
|
|
/* "Software"), to deal in the Software without restriction, including */
|
|
/* without limitation the rights to use, copy, modify, merge, publish, */
|
|
/* distribute, sublicense, and/or sell copies of the Software, and to */
|
|
/* permit persons to whom the Software is furnished to do so, subject to */
|
|
/* the following conditions: */
|
|
/* */
|
|
/* The above copyright notice and this permission notice shall be */
|
|
/* included in all copies or substantial portions of the Software. */
|
|
/* */
|
|
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
|
|
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
|
|
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */
|
|
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
|
|
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
|
|
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
|
|
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
|
|
/**************************************************************************/
|
|
|
|
#pragma once
|
|
|
|
#include "core/typedefs.h"
|
|
|
|
template <typename F, typename S>
|
|
struct Pair {
|
|
F first{};
|
|
S second{};
|
|
|
|
constexpr Pair() = default;
|
|
constexpr Pair(const F &p_first, const S &p_second) :
|
|
first(p_first), second(p_second) {}
|
|
|
|
constexpr bool operator==(const Pair &p_other) const { return first == p_other.first && second == p_other.second; }
|
|
constexpr bool operator!=(const Pair &p_other) const { return first != p_other.first || second != p_other.second; }
|
|
constexpr bool operator<(const Pair &p_other) const { return first == p_other.first ? (second < p_other.second) : (first < p_other.first); }
|
|
constexpr bool operator<=(const Pair &p_other) const { return first == p_other.first ? (second <= p_other.second) : (first < p_other.first); }
|
|
constexpr bool operator>(const Pair &p_other) const { return first == p_other.first ? (second > p_other.second) : (first > p_other.first); }
|
|
constexpr bool operator>=(const Pair &p_other) const { return first == p_other.first ? (second >= p_other.second) : (first > p_other.first); }
|
|
};
|
|
|
|
template <typename F, typename S>
|
|
struct PairSort {
|
|
constexpr bool operator()(const Pair<F, S> &p_lhs, const Pair<F, S> &p_rhs) const {
|
|
return p_lhs < p_rhs;
|
|
}
|
|
};
|
|
|
|
// Pair is zero-constructible if and only if both constrained types are zero-constructible.
|
|
template <typename F, typename S>
|
|
struct is_zero_constructible<Pair<F, S>> : std::conjunction<is_zero_constructible<F>, is_zero_constructible<S>> {};
|
|
|
|
template <typename K, typename V>
|
|
struct KeyValue {
|
|
const K key{};
|
|
V value{};
|
|
|
|
KeyValue &operator=(const KeyValue &p_kv) = delete;
|
|
KeyValue &operator=(KeyValue &&p_kv) = delete;
|
|
|
|
constexpr KeyValue(const KeyValue &p_kv) = default;
|
|
constexpr KeyValue(KeyValue &&p_kv) = default;
|
|
constexpr KeyValue(const K &p_key, const V &p_value) :
|
|
key(p_key), value(p_value) {}
|
|
constexpr KeyValue(const Pair<K, V> &p_pair) :
|
|
key(p_pair.first), value(p_pair.second) {}
|
|
|
|
constexpr bool operator==(const KeyValue &p_other) const { return key == p_other.key && value == p_other.value; }
|
|
constexpr bool operator!=(const KeyValue &p_other) const { return key != p_other.key || value != p_other.value; }
|
|
constexpr bool operator<(const KeyValue &p_other) const { return key == p_other.key ? (value < p_other.value) : (key < p_other.key); }
|
|
constexpr bool operator<=(const KeyValue &p_other) const { return key == p_other.key ? (value <= p_other.value) : (key < p_other.key); }
|
|
constexpr bool operator>(const KeyValue &p_other) const { return key == p_other.key ? (value > p_other.value) : (key > p_other.key); }
|
|
constexpr bool operator>=(const KeyValue &p_other) const { return key == p_other.key ? (value >= p_other.value) : (key > p_other.key); }
|
|
};
|
|
|
|
template <typename K, typename V>
|
|
struct KeyValueSort {
|
|
constexpr bool operator()(const KeyValue<K, V> &p_lhs, const KeyValue<K, V> &p_rhs) const {
|
|
return p_lhs.key < p_rhs.key;
|
|
}
|
|
};
|
|
|
|
// KeyValue is zero-constructible if and only if both constrained types are zero-constructible.
|
|
template <typename K, typename V>
|
|
struct is_zero_constructible<KeyValue<K, V>> : std::conjunction<is_zero_constructible<K>, is_zero_constructible<V>> {};
|