hyperoctree.hpp File Reference

#include <engine/math/compile.hpp>
#include <algorithm>
#include <array>
#include <bit>
#include <concepts>
#include <cstddef>
#include <set>
#include <type_traits>
#include <unordered_set>

Go to the source code of this file.

Classes
class	geom::hyperoctree< T, N, Order >
	Hashed linear hyperoctree. More...

Namespaces
	geom
	Geometric algorithms.

Typedefs
template<std::unsigned_integral T, std::size_t N>
using	geom::unordered_hyperoctree = hyperoctree< T, N, hyperoctree_order::unordered >
	Hyperoctree with unordered node storage and traversal. More...

Enumerations
enum class	geom::hyperoctree_order { geom::unordered , geom::dfs_pre , geom::bfs }
	Orders in which hyperoctree nodes can be stored and traversed. More...