summaryrefslogtreecommitdiff
path: root/engine-ocean/External/glm-master/glm/detail/func_vector_relational.inl
diff options
context:
space:
mode:
authorjjesswan <jessica_wan@brown.edu>2024-04-22 21:56:26 -0400
committerjjesswan <jessica_wan@brown.edu>2024-04-22 21:56:26 -0400
commita556b45abf18f1bd509daaf63b66b7d55e9fd291 (patch)
treebc9b8a2d184c12aee236e7f9f276a34b84ca552d /engine-ocean/External/glm-master/glm/detail/func_vector_relational.inl
parentcd7c76017a12bb548036571c1ff13e551369d06d (diff)
add engine version
Diffstat (limited to 'engine-ocean/External/glm-master/glm/detail/func_vector_relational.inl')
-rw-r--r--engine-ocean/External/glm-master/glm/detail/func_vector_relational.inl87
1 files changed, 87 insertions, 0 deletions
diff --git a/engine-ocean/External/glm-master/glm/detail/func_vector_relational.inl b/engine-ocean/External/glm-master/glm/detail/func_vector_relational.inl
new file mode 100644
index 0000000..80c9e87
--- /dev/null
+++ b/engine-ocean/External/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