summaryrefslogtreecommitdiff
path: root/glm-master/glm/gtx/matrix_query.inl
diff options
context:
space:
mode:
authorjjesswan <jessica_wan@brown.edu>2024-05-07 06:03:03 -0400
committerjjesswan <jessica_wan@brown.edu>2024-05-07 06:03:03 -0400
commit675391d07f50d0067e7bab983433c6d86f5f8256 (patch)
tree65a857125b91502974bceb40e24c1c7eff4bad59 /glm-master/glm/gtx/matrix_query.inl
parent6a45579dbbf991c0e12ce59958e3b533d19fc9d4 (diff)
remove glm
Diffstat (limited to 'glm-master/glm/gtx/matrix_query.inl')
-rw-r--r--glm-master/glm/gtx/matrix_query.inl113
1 files changed, 0 insertions, 113 deletions
diff --git a/glm-master/glm/gtx/matrix_query.inl b/glm-master/glm/gtx/matrix_query.inl
deleted file mode 100644
index b763c1a..0000000
--- a/glm-master/glm/gtx/matrix_query.inl
+++ /dev/null
@@ -1,113 +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() - 1; ++i)
- for(length_t j(i + 1); result && j < m.length(); ++j)
- result = areOrthogonal(m[i], m[j], epsilon);
-
- if(result)
- {
- mat<C, R, T, Q> tmp = transpose(m);
- for(length_t i(0); result && i < m.length() - 1 ; ++i)
- for(length_t j(i + 1); result && j < m.length(); ++j)
- result = areOrthogonal(tmp[i], tmp[j], epsilon);
- }
- return result;
- }
-}//namespace glm