36 lines
1019 B
Plaintext
36 lines
1019 B
Plaintext
|
namespace glm
|
||
|
|
{
|
||
|
|
template<typename T, qualifier Q>
|
||
|
|
GLM_FUNC_QUALIFIER vec<4, bool, Q> equal(qua<T, Q> const& x, qua<T, Q> const& y)
|
||
|
|
{
|
||
|
|
vec<4, bool, Q> Result;
|
||
|
|
for(length_t i = 0; i < x.length(); ++i)
|
||
|
|
Result[i] = x[i] == y[i];
|
||
|
|
return Result;
|
||
|
|
}
|
||
|
|
|
||
|
|
template<typename T, qualifier Q>
|
||
|
|
GLM_FUNC_QUALIFIER vec<4, bool, Q> equal(qua<T, Q> const& x, qua<T, Q> const& y, T epsilon)
|
||
|
|
{
|
||
|
|
vec<4, T, Q> v(x.x - y.x, x.y - y.y, x.z - y.z, x.w - y.w);
|
||
|
|
return lessThan(abs(v), vec<4, T, Q>(epsilon));
|
||
|
|
}
|
||
|
|
|
||
|
|
template<typename T, qualifier Q>
|
||
|
|
GLM_FUNC_QUALIFIER vec<4, bool, Q> notEqual(qua<T, Q> const& x, qua<T, Q> const& y)
|
||
|
|
{
|
||
|
|
vec<4, bool, Q> Result;
|
||
|
|
for(length_t i = 0; i < x.length(); ++i)
|
||
|
|
Result[i] = x[i] != y[i];
|
||
|
|
return Result;
|
||
|
|
}
|
||
|
|
|
||
|
|
template<typename T, qualifier Q>
|
||
|
|
GLM_FUNC_QUALIFIER vec<4, bool, Q> notEqual(qua<T, Q> const& x, qua<T, Q> const& y, T epsilon)
|
||
|
|
{
|
||
|
|
vec<4, T, Q> v(x.x - y.x, x.y - y.y, x.z - y.z, x.w - y.w);
|
||
|
|
return greaterThanEqual(abs(v), vec<4, T, Q>(epsilon));
|
||
|
|
}
|
||
|
|
}//namespace glm
|
||
|
|
|