From 61e5bcef2629e2d68b805a956a96fff264d4f74d Mon Sep 17 00:00:00 2001
From: untodesu <kirill@untode.su>
Date: Sat, 28 Jun 2025 01:59:49 +0500
Subject: Restructure dependencies and update to C++20 - Nuked static_assert
 from almost everywhere in the project - Nuked binary dependency support.
 Might add one later though - Separated dependency headers into a separate
 include subdirectory - Grafted a thirdpartylegalnotices.txt generator from
 RITEG - Pushed development snapshot version to 2126 (26th week of 2025)

---
 deps/include/glm/detail/func_vector_relational.inl | 87 ----------------------
 1 file changed, 87 deletions(-)
 delete mode 100644 deps/include/glm/detail/func_vector_relational.inl

(limited to 'deps/include/glm/detail/func_vector_relational.inl')

diff --git a/deps/include/glm/detail/func_vector_relational.inl b/deps/include/glm/detail/func_vector_relational.inl
deleted file mode 100644
index 80c9e87..0000000
--- a/deps/include/glm/detail/func_vector_relational.inl
+++ /dev/null
@@ -1,87 +0,0 @@
-namespace glm
-{
-	template<length_t L, typename T, qualifier Q>
-	GLM_FUNC_QUALIFIER GLM_CONSTEXPR vec<L, bool, Q> lessThan(vec<L, T, Q> const& x, vec<L, T, Q> const& y)
-	{
-		vec<L, bool, Q> Result(true);
-		for(length_t i = 0; i < L; ++i)
-			Result[i] = x[i] < y[i];
-		return Result;
-	}
-
-	template<length_t L, typename T, qualifier Q>
-	GLM_FUNC_QUALIFIER GLM_CONSTEXPR vec<L, bool, Q> lessThanEqual(vec<L, T, Q> const& x, vec<L, T, Q> const& y)
-	{
-		vec<L, bool, Q> Result(true);
-		for(length_t i = 0; i < L; ++i)
-			Result[i] = x[i] <= y[i];
-		return Result;
-	}
-
-	template<length_t L, typename T, qualifier Q>
-	GLM_FUNC_QUALIFIER GLM_CONSTEXPR vec<L, bool, Q> greaterThan(vec<L, T, Q> const& x, vec<L, T, Q> const& y)
-	{
-		vec<L, bool, Q> Result(true);
-		for(length_t i = 0; i < L; ++i)
-			Result[i] = x[i] > y[i];
-		return Result;
-	}
-
-	template<length_t L, typename T, qualifier Q>
-	GLM_FUNC_QUALIFIER GLM_CONSTEXPR vec<L, bool, Q> greaterThanEqual(vec<L, T, Q> const& x, vec<L, T, Q> const& y)
-	{
-		vec<L, bool, Q> Result(true);
-		for(length_t i = 0; i < L; ++i)
-			Result[i] = x[i] >= y[i];
-		return Result;
-	}
-
-	template<length_t L, typename T, qualifier Q>
-	GLM_FUNC_QUALIFIER GLM_CONSTEXPR vec<L, bool, Q> equal(vec<L, T, Q> const& x, vec<L, T, Q> const& y)
-	{
-		vec<L, bool, Q> Result(true);
-		for(length_t i = 0; i < L; ++i)
-			Result[i] = x[i] == y[i];
-		return Result;
-	}
-
-	template<length_t L, typename T, qualifier Q>
-	GLM_FUNC_QUALIFIER GLM_CONSTEXPR vec<L, bool, Q> notEqual(vec<L, T, Q> const& x, vec<L, T, Q> const& y)
-	{
-		vec<L, bool, Q> Result(true);
-		for(length_t i = 0; i < L; ++i)
-			Result[i] = x[i] != y[i];
-		return Result;
-	}
-
-	template<length_t L, qualifier Q>
-	GLM_FUNC_QUALIFIER GLM_CONSTEXPR bool any(vec<L, bool, Q> const& v)
-	{
-		bool Result = false;
-		for(length_t i = 0; i < L; ++i)
-			Result = Result || v[i];
-		return Result;
-	}
-
-	template<length_t L, qualifier Q>
-	GLM_FUNC_QUALIFIER GLM_CONSTEXPR bool all(vec<L, bool, Q> const& v)
-	{
-		bool Result = true;
-		for(length_t i = 0; i < L; ++i)
-			Result = Result && v[i];
-		return Result;
-	}
-
-	template<length_t L, qualifier Q>
-	GLM_FUNC_QUALIFIER GLM_CONSTEXPR vec<L, bool, Q> not_(vec<L, bool, Q> const& v)
-	{
-		vec<L, bool, Q> Result(true);
-		for(length_t i = 0; i < L; ++i)
-			Result[i] = !v[i];
-		return Result;
-	}
-}//namespace glm
-
-#if GLM_CONFIG_SIMD == GLM_ENABLE
-#	include "func_vector_relational_simd.inl"
-#endif
-- 
cgit