libcruft-util/extent.hpp

203 lines
5.5 KiB
C++
Raw Normal View History

2011-10-26 21:43:38 +11: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-10-26 21:43:38 +11:00
*
* Copyright 2010-2017 Danny Robson <danny@nerdcruft.net>
2011-10-26 21:43:38 +11:00
*/
#ifndef CRUFT_UTIL_EXTENT_HPP
#define CRUFT_UTIL_EXTENT_HPP
2011-10-26 21:43:38 +11:00
#include "coord/fwd.hpp"
#include "coord/base.hpp"
2015-01-16 14:42:04 +11:00
#include "vector.hpp"
2015-09-16 02:26:00 +10:00
#include "point.hpp"
2018-05-30 14:34:48 +10:00
#include "random.hpp"
2015-09-16 02:26:00 +10:00
#include <cstddef>
2015-02-20 21:53:51 +11:00
namespace cruft {
2011-10-26 21:43:38 +11:00
/**
* A pure n-dimensional size, without positioning
2011-10-26 21:43:38 +11:00
*/
template <size_t S, typename T>
struct extent : public ::cruft::coord::base<S,T,::cruft::extent<S,T>>
{
using ::cruft::coord::base<S,T,::cruft::extent<S,T>>::base;
2015-01-28 14:57:55 +11:00
extent () = default;
explicit extent (::cruft::vector<S,T>);
2011-10-26 21:43:38 +11:00
constexpr T
area (void) const
{
return std::accumulate (std::begin (this->data),
std::end (this->data),
T {1},
std::multiplies<T> ());
}
constexpr T
diameter (void) const
{
return static_cast<T> (
std::sqrt (
std::accumulate (std::begin (this->data),
std::end (this->data),
T {0},
[] (auto a, auto b) { return a + b * b; })
)
);
}
2011-10-26 21:43:38 +11:00
template <typename U = float>
constexpr
U aspect (void) const
{
return static_cast<U> (this->w) / this->h;
}
/// tests whether a point would lie within:
/// region { origin, *this }, inclusive of borders.
///
/// included for parity with cruft::region.
constexpr bool
inclusive (cruft::point<S,T> p) const
{
return all (p >= T{0} && p <= *this);
}
/// tests whether a point would like within:
/// region { origin, *this }, exclusive of the bottom-right border
/// included for parity with cruft::region
constexpr bool
exclusive (point<S,T> p) const
{
return all (p >= T{0} && p < *this);
}
2015-09-16 02:26:00 +10:00
::cruft::extent<S,T> expanded (::cruft::vector<S,T>) const;
::cruft::extent<S,T> expanded (T) const;
::cruft::extent<S,T> contracted (::cruft::vector<S,T>) const;
::cruft::extent<S,T> contracted (T) const;
2015-01-16 14:42:04 +11:00
2011-10-26 21:43:38 +11:00
bool empty (void) const;
static constexpr
::cruft::extent<S,T> max (void)
{
return extent<S,T> {
std::numeric_limits<T>::max ()
};
}
static constexpr
::cruft::extent<S,T> min (void)
{
return extent<S,T> { 0 };
}
///////////////////////////////////////////////////////////////////////
class iterator {
public:
using iterator_category = std::forward_iterator_tag;
using value_type = point<S,T>;
using difference_type = size_t;
using pointer = value_type*;
using reference = value_type&;
iterator (point<S,T> _cursor, extent<S,T> _target):
m_cursor (_cursor),
m_target (_target)
{ ; }
point<S,T>& operator* () & { return m_cursor; }
const point<S,T>& operator* () const & { return m_cursor; }
iterator& operator++ (void)&
{
++m_cursor[0];
for (size_t i = 0; i < S - 1; ++i) {
if (m_cursor[i] < m_target[i])
break;
m_cursor[i] = 0;
m_cursor[i+1]++;
}
return *this;
}
bool operator!= (const iterator &rhs) const { return m_cursor != rhs.m_cursor; }
bool operator== (const iterator &rhs) const { return m_cursor == rhs.m_cursor; }
private:
point<S,T> m_cursor;
extent<S,T> m_target;
};
auto step (void) const
{
point<S,T> last {0};
last[S-1] = this->data[S-1];
return cruft::view {
iterator {point<S,T> {0}, *this},
iterator {last, *this}
};
}
};
2018-05-30 14:34:48 +10:00
template <size_t S, typename T>
cruft::point<S,T>
sample (cruft::extent<S,T> shape)
2018-05-30 14:34:48 +10:00
{
return sample (shape, cruft::random::generator ());
2018-05-30 14:34:48 +10:00
}
template <size_t S, typename T, typename GeneratorT>
cruft::point<S,T>
sample (cruft::extent<S,T> shape, GeneratorT &&gen)
2018-05-30 14:34:48 +10:00
{
cruft::point<S,T> p;
2018-05-30 14:34:48 +10:00
for (size_t i = 0; i < S; ++i)
p[i] = cruft::random::uniform (0, shape[i], gen);
2018-05-30 14:34:48 +10:00
return p;
}
///////////////////////////////////////////////////////////////////////////
2015-07-24 01:34:44 +10:00
// convenience typedefs
template <typename T> using extent2 = extent<2,T>;
template <typename T> using extent3 = extent<3,T>;
template <size_t S> using extentu = extent<S,unsigned>;
template <size_t S> using extenti = extent<S,int>;
2015-10-19 17:09:00 +11:00
template <size_t S> using extentf = extent<S,float>;
template <size_t S> using extentd = extent<S,double>;
typedef extent2<int> extent2i;
typedef extent2<unsigned> extent2u;
2015-07-24 01:34:44 +10:00
typedef extent2<float> extent2f;
typedef extent2<double> extent2d;
typedef extent3<unsigned> extent3u;
2015-08-28 20:34:58 +10:00
typedef extent3<float> extent3f;
2011-10-26 21:43:38 +11:00
}
2014-07-02 15:43:59 +10:00
#endif