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/gtx/associated_min_max.inl | 354 ----------------------------
 1 file changed, 354 deletions(-)
 delete mode 100644 deps/include/glm/gtx/associated_min_max.inl

(limited to 'deps/include/glm/gtx/associated_min_max.inl')

diff --git a/deps/include/glm/gtx/associated_min_max.inl b/deps/include/glm/gtx/associated_min_max.inl
deleted file mode 100644
index f09f5bb..0000000
--- a/deps/include/glm/gtx/associated_min_max.inl
+++ /dev/null
@@ -1,354 +0,0 @@
-/// @ref gtx_associated_min_max
-
-namespace glm{
-
-// Min comparison between 2 variables
-template<typename T, typename U>
-GLM_FUNC_QUALIFIER U associatedMin(T x, U a, T y, U b)
-{
-	return x < y ? a : b;
-}
-
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMin
-(
-	vec<L, T, Q> const& x, vec<L, U, Q> const& a,
-	vec<L, T, Q> const& y, vec<L, U, Q> const& b
-)
-{
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-		Result[i] = x[i] < y[i] ? a[i] : b[i];
-	return Result;
-}
-
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMin
-(
-	T x, const vec<L, U, Q>& a,
-	T y, const vec<L, U, Q>& b
-)
-{
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-		Result[i] = x < y ? a[i] : b[i];
-	return Result;
-}
-
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMin
-(
-	vec<L, T, Q> const& x, U a,
-	vec<L, T, Q> const& y, U b
-)
-{
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-		Result[i] = x[i] < y[i] ? a : b;
-	return Result;
-}
-
-// Min comparison between 3 variables
-template<typename T, typename U>
-GLM_FUNC_QUALIFIER U associatedMin
-(
-	T x, U a,
-	T y, U b,
-	T z, U c
-)
-{
-	U Result = x < y ? (x < z ? a : c) : (y < z ? b : c);
-	return Result;
-}
-
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMin
-(
-	vec<L, T, Q> const& x, vec<L, U, Q> const& a,
-	vec<L, T, Q> const& y, vec<L, U, Q> const& b,
-	vec<L, T, Q> const& z, vec<L, U, Q> const& c
-)
-{
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-		Result[i] = x[i] < y[i] ? (x[i] < z[i] ? a[i] : c[i]) : (y[i] < z[i] ? b[i] : c[i]);
-	return Result;
-}
-
-// Min comparison between 4 variables
-template<typename T, typename U>
-GLM_FUNC_QUALIFIER U associatedMin
-(
-	T x, U a,
-	T y, U b,
-	T z, U c,
-	T w, U d
-)
-{
-	T Test1 = min(x, y);
-	T Test2 = min(z, w);
-	U Result1 = x < y ? a : b;
-	U Result2 = z < w ? c : d;
-	U Result = Test1 < Test2 ? Result1 : Result2;
-	return Result;
-}
-
-// Min comparison between 4 variables
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMin
-(
-	vec<L, T, Q> const& x, vec<L, U, Q> const& a,
-	vec<L, T, Q> const& y, vec<L, U, Q> const& b,
-	vec<L, T, Q> const& z, vec<L, U, Q> const& c,
-	vec<L, T, Q> const& w, vec<L, U, Q> const& d
-)
-{
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-	{
-		T Test1 = min(x[i], y[i]);
-		T Test2 = min(z[i], w[i]);
-		U Result1 = x[i] < y[i] ? a[i] : b[i];
-		U Result2 = z[i] < w[i] ? c[i] : d[i];
-		Result[i] = Test1 < Test2 ? Result1 : Result2;
-	}
-	return Result;
-}
-
-// Min comparison between 4 variables
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMin
-(
-	T x, vec<L, U, Q> const& a,
-	T y, vec<L, U, Q> const& b,
-	T z, vec<L, U, Q> const& c,
-	T w, vec<L, U, Q> const& d
-)
-{
-	T Test1 = min(x, y);
-	T Test2 = min(z, w);
-
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-	{
-		U Result1 = x < y ? a[i] : b[i];
-		U Result2 = z < w ? c[i] : d[i];
-		Result[i] = Test1 < Test2 ? Result1 : Result2;
-	}
-	return Result;
-}
-
-// Min comparison between 4 variables
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMin
-(
-	vec<L, T, Q> const& x, U a,
-	vec<L, T, Q> const& y, U b,
-	vec<L, T, Q> const& z, U c,
-	vec<L, T, Q> const& w, U d
-)
-{
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-	{
-		T Test1 = min(x[i], y[i]);
-		T Test2 = min(z[i], w[i]);
-		U Result1 = x[i] < y[i] ? a : b;
-		U Result2 = z[i] < w[i] ? c : d;
-		Result[i] = Test1 < Test2 ? Result1 : Result2;
-	}
-	return Result;
-}
-
-// Max comparison between 2 variables
-template<typename T, typename U>
-GLM_FUNC_QUALIFIER U associatedMax(T x, U a, T y, U b)
-{
-	return x > y ? a : b;
-}
-
-// Max comparison between 2 variables
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMax
-(
-	vec<L, T, Q> const& x, vec<L, U, Q> const& a,
-	vec<L, T, Q> const& y, vec<L, U, Q> const& b
-)
-{
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-		Result[i] = x[i] > y[i] ? a[i] : b[i];
-	return Result;
-}
-
-// Max comparison between 2 variables
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, T, Q> associatedMax
-(
-	T x, vec<L, U, Q> const& a,
-	T y, vec<L, U, Q> const& b
-)
-{
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-		Result[i] = x > y ? a[i] : b[i];
-	return Result;
-}
-
-// Max comparison between 2 variables
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMax
-(
-	vec<L, T, Q> const& x, U a,
-	vec<L, T, Q> const& y, U b
-)
-{
-	vec<L, T, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-		Result[i] = x[i] > y[i] ? a : b;
-	return Result;
-}
-
-// Max comparison between 3 variables
-template<typename T, typename U>
-GLM_FUNC_QUALIFIER U associatedMax
-(
-	T x, U a,
-	T y, U b,
-	T z, U c
-)
-{
-	U Result = x > y ? (x > z ? a : c) : (y > z ? b : c);
-	return Result;
-}
-
-// Max comparison between 3 variables
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMax
-(
-	vec<L, T, Q> const& x, vec<L, U, Q> const& a,
-	vec<L, T, Q> const& y, vec<L, U, Q> const& b,
-	vec<L, T, Q> const& z, vec<L, U, Q> const& c
-)
-{
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-		Result[i] = x[i] > y[i] ? (x[i] > z[i] ? a[i] : c[i]) : (y[i] > z[i] ? b[i] : c[i]);
-	return Result;
-}
-
-// Max comparison between 3 variables
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, T, Q> associatedMax
-(
-	T x, vec<L, U, Q> const& a,
-	T y, vec<L, U, Q> const& b,
-	T z, vec<L, U, Q> const& c
-)
-{
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-		Result[i] = x > y ? (x > z ? a[i] : c[i]) : (y > z ? b[i] : c[i]);
-	return Result;
-}
-
-// Max comparison between 3 variables
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMax
-(
-	vec<L, T, Q> const& x, U a,
-	vec<L, T, Q> const& y, U b,
-	vec<L, T, Q> const& z, U c
-)
-{
-	vec<L, T, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-		Result[i] = x[i] > y[i] ? (x[i] > z[i] ? a : c) : (y[i] > z[i] ? b : c);
-	return Result;
-}
-
-// Max comparison between 4 variables
-template<typename T, typename U>
-GLM_FUNC_QUALIFIER U associatedMax
-(
-	T x, U a,
-	T y, U b,
-	T z, U c,
-	T w, U d
-)
-{
-	T Test1 = max(x, y);
-	T Test2 = max(z, w);
-	U Result1 = x > y ? a : b;
-	U Result2 = z > w ? c : d;
-	U Result = Test1 > Test2 ? Result1 : Result2;
-	return Result;
-}
-
-// Max comparison between 4 variables
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMax
-(
-	vec<L, T, Q> const& x, vec<L, U, Q> const& a,
-	vec<L, T, Q> const& y, vec<L, U, Q> const& b,
-	vec<L, T, Q> const& z, vec<L, U, Q> const& c,
-	vec<L, T, Q> const& w, vec<L, U, Q> const& d
-)
-{
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-	{
-		T Test1 = max(x[i], y[i]);
-		T Test2 = max(z[i], w[i]);
-		U Result1 = x[i] > y[i] ? a[i] : b[i];
-		U Result2 = z[i] > w[i] ? c[i] : d[i];
-		Result[i] = Test1 > Test2 ? Result1 : Result2;
-	}
-	return Result;
-}
-
-// Max comparison between 4 variables
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMax
-(
-	T x, vec<L, U, Q> const& a,
-	T y, vec<L, U, Q> const& b,
-	T z, vec<L, U, Q> const& c,
-	T w, vec<L, U, Q> const& d
-)
-{
-	T Test1 = max(x, y);
-	T Test2 = max(z, w);
-
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-	{
-		U Result1 = x > y ? a[i] : b[i];
-		U Result2 = z > w ? c[i] : d[i];
-		Result[i] = Test1 > Test2 ? Result1 : Result2;
-	}
-	return Result;
-}
-
-// Max comparison between 4 variables
-template<length_t L, typename T, typename U, qualifier Q>
-GLM_FUNC_QUALIFIER vec<L, U, Q> associatedMax
-(
-	vec<L, T, Q> const& x, U a,
-	vec<L, T, Q> const& y, U b,
-	vec<L, T, Q> const& z, U c,
-	vec<L, T, Q> const& w, U d
-)
-{
-	vec<L, U, Q> Result;
-	for(length_t i = 0, n = Result.length(); i < n; ++i)
-	{
-		T Test1 = max(x[i], y[i]);
-		T Test2 = max(z[i], w[i]);
-		U Result1 = x[i] > y[i] ? a : b;
-		U Result2 = z[i] > w[i] ? c : d;
-		Result[i] = Test1 > Test2 ? Result1 : Result2;
-	}
-	return Result;
-}
-}//namespace glm
-- 
cgit