2011-06-23 22:04:51 +10:00
|
|
|
/*
|
2018-08-04 15:14:06 +10:00
|
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
2011-06-23 22:04:51 +10:00
|
|
|
*
|
2018-04-16 15:54:08 +10:00
|
|
|
* Copyright 2011-2018 Danny Robson <danny@nerdcruft.net>
|
2011-06-23 22:04:51 +10:00
|
|
|
*/
|
|
|
|
|
2017-11-22 16:49:37 +11:00
|
|
|
#include "point.hpp"
|
2011-06-23 22:04:51 +10:00
|
|
|
|
2017-11-22 16:49:37 +11:00
|
|
|
#include "debug.hpp"
|
2011-10-18 21:45:55 +11:00
|
|
|
|
2014-12-15 20:10:56 +11:00
|
|
|
#include <cstdlib>
|
2011-06-23 22:04:51 +10:00
|
|
|
|
2015-04-15 14:14:01 +10:00
|
|
|
using util::point;
|
2011-06-23 22:04:51 +10:00
|
|
|
|
2011-10-18 21:45:55 +11:00
|
|
|
|
2015-03-07 03:20:07 +11:00
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
2016-10-25 19:58:19 +11:00
|
|
|
namespace util::debug {
|
|
|
|
template <size_t S, typename T>
|
|
|
|
struct validator<point<S,T>> {
|
|
|
|
static bool is_valid (const point<S,T> &p)
|
|
|
|
{
|
|
|
|
// ensure we don't have a nan anywhere
|
|
|
|
return std::all_of (p.cbegin (), p.cend (), [] (auto i) {
|
|
|
|
return !(std::is_floating_point<T>::value && std::isnan (i));
|
|
|
|
});
|
|
|
|
}
|
|
|
|
};
|
2011-10-18 21:45:55 +11:00
|
|
|
}
|
2011-09-13 16:49:10 +10:00
|
|
|
|
2016-11-17 18:43:32 +11:00
|
|
|
|
2018-04-18 21:44:36 +10:00
|
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
template <size_t S, typename T>
|
|
|
|
std::pair<
|
|
|
|
util::point<S,T>,
|
|
|
|
util::point<S,T>
|
|
|
|
>
|
|
|
|
util::furthest (util::view<const util::point<S,T>*> src)
|
|
|
|
{
|
|
|
|
CHECK_GE (src.size (), 2u);
|
|
|
|
|
2018-04-23 15:40:51 +10:00
|
|
|
size_t a = 0;
|
|
|
|
size_t b = 1;
|
2018-04-18 21:44:36 +10:00
|
|
|
auto d = distance2 (src[a],src[b]);
|
|
|
|
|
|
|
|
for (size_t i = 0; i < src.size (); ++i) {
|
|
|
|
for (size_t j = i + 1; j < src.size (); ++j) {
|
|
|
|
if (auto d2 = distance2 (src[i], src[j]); d2 > d) {
|
|
|
|
a = i;
|
|
|
|
b = j;
|
|
|
|
d = d2;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return { src[a], src[b] };
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-01-21 23:36:22 +11:00
|
|
|
//-----------------------------------------------------------------------------
|
2016-03-11 12:48:19 +11:00
|
|
|
#define INSTANTIATE_S_T(S,T) \
|
2016-10-25 19:58:19 +11:00
|
|
|
template struct util::point<S,T>; \
|
2016-11-17 18:43:32 +11:00
|
|
|
template bool util::debug::is_valid (const point<S,T>&); \
|
2018-04-18 21:44:36 +10:00
|
|
|
template std::pair<util::point<S,T>,util::point<S,T>> util::furthest (util::view<const util::point<S,T>*>); \
|
2016-11-17 18:43:32 +11:00
|
|
|
template struct util::debug::validator<point<S,T>>;
|
2015-01-21 23:36:22 +11:00
|
|
|
|
|
|
|
#define INSTANTIATE(T) \
|
|
|
|
INSTANTIATE_S_T(1,T) \
|
|
|
|
INSTANTIATE_S_T(2,T) \
|
|
|
|
INSTANTIATE_S_T(3,T) \
|
|
|
|
INSTANTIATE_S_T(4,T)
|
2012-06-08 16:45:39 +10:00
|
|
|
|
|
|
|
|
2015-09-22 17:24:16 +10:00
|
|
|
INSTANTIATE(int16_t)
|
2014-12-15 20:10:56 +11:00
|
|
|
INSTANTIATE(int32_t)
|
|
|
|
INSTANTIATE(int64_t)
|
2016-10-25 17:47:08 +11:00
|
|
|
|
|
|
|
INSTANTIATE(uint16_t)
|
|
|
|
INSTANTIATE(uint32_t)
|
2014-12-15 20:10:56 +11:00
|
|
|
INSTANTIATE(uint64_t)
|
2016-10-25 17:47:08 +11:00
|
|
|
|
2014-12-15 20:10:56 +11:00
|
|
|
INSTANTIATE(float)
|
|
|
|
INSTANTIATE(double)
|