You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and dots ('.'), can be up to 35 characters long. Letters must be lowercase.
112 lines
3.0 KiB
112 lines
3.0 KiB
/// @ref core |
|
/// @file glm/detail/func_vector_relational.inl |
|
|
|
#include "compute_vector_relational.hpp" |
|
|
|
// Bug #782: Warning C4701: potentially uninitialized local variable 'Result' used |
|
#if ((GLM_COMPILER & GLM_COMPILER_VC) && (GLM_COMPILER >= GLM_COMPILER_VC12)) |
|
# define GLM_BUG_VC_INIT (false) |
|
#else |
|
# define GLM_BUG_VC_INIT |
|
#endif |
|
|
|
namespace glm |
|
{ |
|
template<length_t L, typename T, qualifier Q> |
|
GLM_FUNC_QUALIFIER vec<L, bool, Q> lessThan(vec<L, T, Q> const& x, vec<L, T, Q> const& y) |
|
{ |
|
assert(x.length() == y.length()); |
|
|
|
vec<L, bool, Q> Result GLM_BUG_VC_INIT; |
|
for(length_t i = 0; i < x.length(); ++i) |
|
Result[i] = x[i] < y[i]; |
|
|
|
return Result; |
|
} |
|
|
|
template<length_t L, typename T, qualifier Q> |
|
GLM_FUNC_QUALIFIER vec<L, bool, Q> lessThanEqual(vec<L, T, Q> const& x, vec<L, T, Q> const& y) |
|
{ |
|
assert(x.length() == y.length()); |
|
|
|
vec<L, bool, Q> Result GLM_BUG_VC_INIT; |
|
for(length_t i = 0; i < x.length(); ++i) |
|
Result[i] = x[i] <= y[i]; |
|
return Result; |
|
} |
|
|
|
template<length_t L, typename T, qualifier Q> |
|
GLM_FUNC_QUALIFIER vec<L, bool, Q> greaterThan(vec<L, T, Q> const& x, vec<L, T, Q> const& y) |
|
{ |
|
assert(x.length() == y.length()); |
|
|
|
vec<L, bool, Q> Result GLM_BUG_VC_INIT; |
|
for(length_t i = 0; i < x.length(); ++i) |
|
Result[i] = x[i] > y[i]; |
|
return Result; |
|
} |
|
|
|
template<length_t L, typename T, qualifier Q> |
|
GLM_FUNC_QUALIFIER vec<L, bool, Q> greaterThanEqual(vec<L, T, Q> const& x, vec<L, T, Q> const& y) |
|
{ |
|
assert(x.length() == y.length()); |
|
|
|
vec<L, bool, Q> Result GLM_BUG_VC_INIT; |
|
for(length_t i = 0; i < x.length(); ++i) |
|
Result[i] = x[i] >= y[i]; |
|
return Result; |
|
} |
|
|
|
template<length_t L, typename T, qualifier Q> |
|
GLM_FUNC_QUALIFIER vec<L, bool, Q> equal(vec<L, T, Q> const& x, vec<L, T, Q> const& y) |
|
{ |
|
assert(x.length() == y.length()); |
|
|
|
vec<L, bool, Q> Result GLM_BUG_VC_INIT; |
|
for(length_t i = 0; i < x.length(); ++i) |
|
Result[i] = detail::compute_equal<T, std::numeric_limits<T>::is_iec559>::call(x[i], y[i]); |
|
return Result; |
|
} |
|
|
|
template<length_t L, typename T, qualifier Q> |
|
GLM_FUNC_QUALIFIER vec<L, bool, Q> notEqual(vec<L, T, Q> const& x, vec<L, T, Q> const& y) |
|
{ |
|
assert(x.length() == y.length()); |
|
|
|
vec<L, bool, Q> Result GLM_BUG_VC_INIT; |
|
for(length_t i = 0; i < x.length(); ++i) |
|
Result[i] = !detail::compute_equal<T, std::numeric_limits<T>::is_iec559>::call(x[i], y[i]); |
|
return Result; |
|
} |
|
|
|
template<length_t L, qualifier Q> |
|
GLM_FUNC_QUALIFIER bool any(vec<L, bool, Q> const& v) |
|
{ |
|
bool Result = false; |
|
for(length_t i = 0; i < v.length(); ++i) |
|
Result = Result || v[i]; |
|
return Result; |
|
} |
|
|
|
template<length_t L, qualifier Q> |
|
GLM_FUNC_QUALIFIER bool all(vec<L, bool, Q> const& v) |
|
{ |
|
bool Result = true; |
|
for(length_t i = 0; i < v.length(); ++i) |
|
Result = Result && v[i]; |
|
return Result; |
|
} |
|
|
|
template<length_t L, qualifier Q> |
|
GLM_FUNC_QUALIFIER vec<L, bool, Q> not_(vec<L, bool, Q> const& v) |
|
{ |
|
vec<L, bool, Q> Result; |
|
for(length_t i = 0; i < v.length(); ++i) |
|
Result[i] = !v[i]; |
|
return Result; |
|
} |
|
}//namespace glm |
|
|
|
#if GLM_CONFIG_SIMD == GLM_ENABLE |
|
# include "func_vector_relational_simd.inl" |
|
#endif
|
|
|