summaryrefslogtreecommitdiffstats
path: root/deps/include/glm/gtx/matrix_query.inl
diff options
context:
space:
mode:
authoruntodesu <kirill@untode.su>2025-06-28 01:59:49 +0500
committeruntodesu <kirill@untode.su>2025-06-28 01:59:49 +0500
commit61e5bcef2629e2d68b805a956a96fff264d4f74d (patch)
treebca3a94bac79d34e3c0db57c77604f5a823ecbda /deps/include/glm/gtx/matrix_query.inl
parent88c01588aa0830e219eaa62588839e4d1e2883ce (diff)
downloadvoxelius-61e5bcef2629e2d68b805a956a96fff264d4f74d.tar.bz2
voxelius-61e5bcef2629e2d68b805a956a96fff264d4f74d.zip
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)
Diffstat (limited to 'deps/include/glm/gtx/matrix_query.inl')
-rw-r--r--deps/include/glm/gtx/matrix_query.inl119
1 files changed, 0 insertions, 119 deletions
diff --git a/deps/include/glm/gtx/matrix_query.inl b/deps/include/glm/gtx/matrix_query.inl
deleted file mode 100644
index dc3ec84..0000000
--- a/deps/include/glm/gtx/matrix_query.inl
+++ /dev/null
@@ -1,119 +0,0 @@
-/// @ref gtx_matrix_query
-
-namespace glm
-{
- template<typename T, qualifier Q>
- GLM_FUNC_QUALIFIER bool isNull(mat<2, 2, T, Q> const& m, T const& epsilon)
- {
- bool result = true;
- for(length_t i = 0; result && i < m.length() ; ++i)
- result = isNull(m[i], epsilon);
- return result;
- }
-
- template<typename T, qualifier Q>
- GLM_FUNC_QUALIFIER bool isNull(mat<3, 3, T, Q> const& m, T const& epsilon)
- {
- bool result = true;
- for(length_t i = 0; result && i < m.length() ; ++i)
- result = isNull(m[i], epsilon);
- return result;
- }
-
- template<typename T, qualifier Q>
- GLM_FUNC_QUALIFIER bool isNull(mat<4, 4, T, Q> const& m, T const& epsilon)
- {
- bool result = true;
- for(length_t i = 0; result && i < m.length() ; ++i)
- result = isNull(m[i], epsilon);
- return result;
- }
-
- template<length_t C, length_t R, typename T, qualifier Q>
- GLM_FUNC_QUALIFIER bool isIdentity(mat<C, R, T, Q> const& m, T const& epsilon)
- {
- bool result = true;
- for(length_t i = 0; result && i < m.length(); ++i)
- {
- for(length_t j = 0; result && j < glm::min(i, m[0].length()); ++j)
- result = abs(m[i][j]) <= epsilon;
- if(result && i < m[0].length())
- result = abs(m[i][i] - 1) <= epsilon;
- for(length_t j = i + 1; result && j < m[0].length(); ++j)
- result = abs(m[i][j]) <= epsilon;
- }
- return result;
- }
-
- template<typename T, qualifier Q>
- GLM_FUNC_QUALIFIER bool isNormalized(mat<2, 2, T, Q> const& m, T const& epsilon)
- {
- bool result(true);
- for(length_t i = 0; result && i < m.length(); ++i)
- result = isNormalized(m[i], epsilon);
- for(length_t i = 0; result && i < m.length(); ++i)
- {
- typename mat<2, 2, T, Q>::col_type v;
- for(length_t j = 0; j < m.length(); ++j)
- v[j] = m[j][i];
- result = isNormalized(v, epsilon);
- }
- return result;
- }
-
- template<typename T, qualifier Q>
- GLM_FUNC_QUALIFIER bool isNormalized(mat<3, 3, T, Q> const& m, T const& epsilon)
- {
- bool result(true);
- for(length_t i = 0; result && i < m.length(); ++i)
- result = isNormalized(m[i], epsilon);
- for(length_t i = 0; result && i < m.length(); ++i)
- {
- typename mat<3, 3, T, Q>::col_type v;
- for(length_t j = 0; j < m.length(); ++j)
- v[j] = m[j][i];
- result = isNormalized(v, epsilon);
- }
- return result;
- }
-
- template<typename T, qualifier Q>
- GLM_FUNC_QUALIFIER bool isNormalized(mat<4, 4, T, Q> const& m, T const& epsilon)
- {
- bool result(true);
- for(length_t i = 0; result && i < m.length(); ++i)
- result = isNormalized(m[i], epsilon);
- for(length_t i = 0; result && i < m.length(); ++i)
- {
- typename mat<4, 4, T, Q>::col_type v;
- for(length_t j = 0; j < m.length(); ++j)
- v[j] = m[j][i];
- result = isNormalized(v, epsilon);
- }
- return result;
- }
-
- template<length_t C, length_t R, typename T, qualifier Q>
- GLM_FUNC_QUALIFIER bool isOrthogonal(mat<C, R, T, Q> const& m, T const& epsilon)
- {
- bool result = true;
- for(length_t i(0); result && i < m.length(); ++i)
- {
- result = isNormalized(m[i], epsilon);
- for(length_t j(i + 1); result && j < m.length(); ++j)
- result = abs(dot(m[i], m[j])) <= epsilon;
- }
-
- if(result)
- {
- mat<C, R, T, Q> tmp = transpose(m);
- for(length_t i(0); result && i < m.length(); ++i)
- {
- result = isNormalized(tmp[i], epsilon);
- for(length_t j(i + 1); result && j < m.length(); ++j)
- result = abs(dot(tmp[i], tmp[j])) <= epsilon;
- }
- }
- return result;
- }
-}//namespace glm