diff options
Diffstat (limited to '3rdparty/include/glm/gtx/associated_min_max.inl')
| -rw-r--r-- | 3rdparty/include/glm/gtx/associated_min_max.inl | 384 |
1 files changed, 384 insertions, 0 deletions
diff --git a/3rdparty/include/glm/gtx/associated_min_max.inl b/3rdparty/include/glm/gtx/associated_min_max.inl new file mode 100644 index 0000000..41f08b4 --- /dev/null +++ b/3rdparty/include/glm/gtx/associated_min_max.inl @@ -0,0 +1,384 @@ +/////////////////////////////////////////////////////////////////////////////////// +/// OpenGL Mathematics (glm.g-truc.net) +/// +/// Copyright (c) 2005 - 2015 G-Truc Creation (www.g-truc.net) +/// Permission is hereby granted, free of charge, to any person obtaining a copy +/// of this software and associated documentation files (the "Software"), to deal +/// in the Software without restriction, including without limitation the rights +/// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell +/// copies of the Software, and to permit persons to whom the Software is +/// furnished to do so, subject to the following conditions: +/// +/// The above copyright notice and this permission notice shall be included in +/// all copies or substantial portions of the Software. +/// +/// Restrictions: +/// By making use of the Software for military purposes, you choose to make +/// a Bunny unhappy. +/// +/// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +/// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +/// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +/// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER +/// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, +/// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN +/// THE SOFTWARE. +/// +/// @ref gtx_associated_min_max +/// @file glm/gtx/associated_min_max.inl +/// @date 2008-03-10 / 2014-10-11 +/// @author Christophe Riccio +/////////////////////////////////////////////////////////////////////////////////////////////////// + +namespace glm{ + +// Min comparison between 2 variables +template<typename T, typename U, precision P> +GLM_FUNC_QUALIFIER U associatedMin(T x, U a, T y, U b) +{ + return x < y ? a : b; +} + +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER tvec2<U, P> associatedMin +( + vecType<T, P> const & x, vecType<U, P> const & a, + vecType<T, P> const & y, vecType<U, P> const & b +) +{ + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + Result[i] = x[i] < y[i] ? a[i] : b[i]; + return Result; +} + +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<U, P> associatedMin +( + T x, const vecType<U, P>& a, + T y, const vecType<U, P>& b +) +{ + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + Result[i] = x < y ? a[i] : b[i]; + return Result; +} + +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<U, P> associatedMin +( + vecType<T, P> const & x, U a, + vecType<T, P> const & y, U b +) +{ + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + Result[i] = x[i] < y[i] ? a : b; + return Result; +} + +// Min comparison between 3 variables +template<typename T, typename U> +GLM_FUNC_QUALIFIER U associatedMin +( + T x, U a, + T y, U b, + T z, U c +) +{ + U Result = x < y ? (x < z ? a : c) : (y < z ? b : c); + return Result; +} + +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<U, P> associatedMin +( + vecType<T, P> const & x, vecType<U, P> const & a, + vecType<T, P> const & y, vecType<U, P> const & b, + vecType<T, P> const & z, vecType<U, P> const & c +) +{ + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + Result[i] = x[i] < y[i] ? (x[i] < z[i] ? a[i] : c[i]) : (y[i] < z[i] ? b[i] : c[i]); + return Result; +} + +// Min comparison between 4 variables +template<typename T, typename U> +GLM_FUNC_QUALIFIER U associatedMin +( + T x, U a, + T y, U b, + T z, U c, + T w, U d +) +{ + T Test1 = min(x, y); + T Test2 = min(z, w);; + U Result1 = x < y ? a : b; + U Result2 = z < w ? c : d; + U Result = Test1 < Test2 ? Result1 : Result2; + return Result; +} + +// Min comparison between 4 variables +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<U, P> associatedMin +( + vecType<T, P> const & x, vecType<U, P> const & a, + vecType<T, P> const & y, vecType<U, P> const & b, + vecType<T, P> const & z, vecType<U, P> const & c, + vecType<T, P> const & w, vecType<U, P> const & d +) +{ + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + { + T Test1 = min(x[i], y[i]); + T Test2 = min(z[i], w[i]); + U Result1 = x[i] < y[i] ? a[i] : b[i]; + U Result2 = z[i] < w[i] ? c[i] : d[i]; + Result[i] = Test1 < Test2 ? Result1 : Result2; + } + return Result; +} + +// Min comparison between 4 variables +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<U, P> associatedMin +( + T x, vecType<U, P> const & a, + T y, vecType<U, P> const & b, + T z, vecType<U, P> const & c, + T w, vecType<U, P> const & d +) +{ + T Test1 = min(x, y); + T Test2 = min(z, w); + + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + { + U Result1 = x < y ? a[i] : b[i]; + U Result2 = z < w ? c[i] : d[i]; + Result[i] = Test1 < Test2 ? Result1 : Result2; + } + return Result; +} + +// Min comparison between 4 variables +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<U, P> associatedMin +( + vecType<T, P> const & x, U a, + vecType<T, P> const & y, U b, + vecType<T, P> const & z, U c, + vecType<T, P> const & w, U d +) +{ + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + { + T Test1 = min(x[i], y[i]); + T Test2 = min(z[i], w[i]);; + U Result1 = x[i] < y[i] ? a : b; + U Result2 = z[i] < w[i] ? c : d; + Result[i] = Test1 < Test2 ? Result1 : Result2; + } + return Result; +} + +// Max comparison between 2 variables +template<typename T, typename U> +GLM_FUNC_QUALIFIER U associatedMax(T x, U a, T y, U b) +{ + return x > y ? a : b; +} + +// Max comparison between 2 variables +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER tvec2<U, P> associatedMax +( + vecType<T, P> const & x, vecType<U, P> const & a, + vecType<T, P> const & y, vecType<U, P> const & b +) +{ + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + Result[i] = x[i] > y[i] ? a[i] : b[i]; + return Result; +} + +// Max comparison between 2 variables +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<T, P> associatedMax +( + T x, vecType<U, P> const & a, + T y, vecType<U, P> const & b +) +{ + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + Result[i] = x > y ? a[i] : b[i]; + return Result; +} + +// Max comparison between 2 variables +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<U, P> associatedMax +( + vecType<T, P> const & x, U a, + vecType<T, P> const & y, U b +) +{ + vecType<T, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + Result[i] = x[i] > y[i] ? a : b; + return Result; +} + +// Max comparison between 3 variables +template<typename T, typename U> +GLM_FUNC_QUALIFIER U associatedMax +( + T x, U a, + T y, U b, + T z, U c +) +{ + U Result = x > y ? (x > z ? a : c) : (y > z ? b : c); + return Result; +} + +// Max comparison between 3 variables +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<U, P> associatedMax +( + vecType<T, P> const & x, vecType<U, P> const & a, + vecType<T, P> const & y, vecType<U, P> const & b, + vecType<T, P> const & z, vecType<U, P> const & c +) +{ + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + Result[i] = x[i] > y[i] ? (x[i] > z[i] ? a[i] : c[i]) : (y[i] > z[i] ? b[i] : c[i]); + return Result; +} + +// Max comparison between 3 variables +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<T, P> associatedMax +( + T x, vecType<U, P> const & a, + T y, vecType<U, P> const & b, + T z, vecType<U, P> const & c +) +{ + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + Result[i] = x > y ? (x > z ? a[i] : c[i]) : (y > z ? b[i] : c[i]); + return Result; +} + +// Max comparison between 3 variables +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<U, P> associatedMax +( + vecType<T, P> const & x, U a, + vecType<T, P> const & y, U b, + vecType<T, P> const & z, U c +) +{ + vecType<T, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + Result[i] = x[i] > y[i] ? (x[i] > z[i] ? a : c) : (y[i] > z[i] ? b : c); + return Result; +} + +// Max comparison between 4 variables +template<typename T, typename U> +GLM_FUNC_QUALIFIER U associatedMax +( + T x, U a, + T y, U b, + T z, U c, + T w, U d +) +{ + T Test1 = max(x, y); + T Test2 = max(z, w);; + U Result1 = x > y ? a : b; + U Result2 = z > w ? c : d; + U Result = Test1 > Test2 ? Result1 : Result2; + return Result; +} + +// Max comparison between 4 variables +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<U, P> associatedMax +( + vecType<T, P> const & x, vecType<U, P> const & a, + vecType<T, P> const & y, vecType<U, P> const & b, + vecType<T, P> const & z, vecType<U, P> const & c, + vecType<T, P> const & w, vecType<U, P> const & d +) +{ + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + { + T Test1 = max(x[i], y[i]); + T Test2 = max(z[i], w[i]); + U Result1 = x[i] > y[i] ? a[i] : b[i]; + U Result2 = z[i] > w[i] ? c[i] : d[i]; + Result[i] = Test1 > Test2 ? Result1 : Result2; + } + return Result; +} + +// Max comparison between 4 variables +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<U, P> associatedMax +( + T x, vecType<U, P> const & a, + T y, vecType<U, P> const & b, + T z, vecType<U, P> const & c, + T w, vecType<U, P> const & d +) +{ + T Test1 = max(x, y); + T Test2 = max(z, w); + + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + { + U Result1 = x > y ? a[i] : b[i]; + U Result2 = z > w ? c[i] : d[i]; + Result[i] = Test1 > Test2 ? Result1 : Result2; + } + return Result; +} + +// Max comparison between 4 variables +template<typename T, typename U, precision P, template <typename, precision> class vecType> +GLM_FUNC_QUALIFIER vecType<U, P> associatedMax +( + vecType<T, P> const & x, U a, + vecType<T, P> const & y, U b, + vecType<T, P> const & z, U c, + vecType<T, P> const & w, U d +) +{ + vecType<U, P> Result(uninitialize); + for(detail::component_count_t i = 0; i < detail::component_count(Result); ++i) + { + T Test1 = max(x[i], y[i]); + T Test2 = max(z[i], w[i]);; + U Result1 = x[i] > y[i] ? a : b; + U Result2 = z[i] > w[i] ? c : d; + Result[i] = Test1 > Test2 ? Result1 : Result2; + } + return Result; +} +}//namespace glm |