summaryrefslogtreecommitdiff
path: root/glm-master/glm/detail/func_vector_relational.inl
diff options
context:
space:
mode:
authorjjesswan <jessica_wan@brown.edu>2024-05-07 06:02:29 -0400
committerjjesswan <jessica_wan@brown.edu>2024-05-07 06:02:29 -0400
commit6a45579dbbf991c0e12ce59958e3b533d19fc9d4 (patch)
tree83ad11d63c0a1d1c89b9469455ecbda4531fe6ac /glm-master/glm/detail/func_vector_relational.inl
parentcb868acadcae4e3f497ecdabeca507f3e73e01c7 (diff)
rotating skyboxgit add -A
Diffstat (limited to 'glm-master/glm/detail/func_vector_relational.inl')
-rw-r--r--glm-master/glm/detail/func_vector_relational.inl87
1 files changed, 87 insertions, 0 deletions
diff --git a/glm-master/glm/detail/func_vector_relational.inl b/glm-master/glm/detail/func_vector_relational.inl
new file mode 100644
index 0000000..80c9e87
--- /dev/null
+++ b/glm-master/glm/detail/func_vector_relational.inl
@@ -0,0 +1,87 @@
+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