Antkeeper  0.0.1
octree.hpp
Go to the documentation of this file.
1 /*
2  * Copyright (C) 2023 Christopher J. Howard
3  *
4  * This file is part of Antkeeper source code.
5  *
6  * Antkeeper source code is free software: you can redistribute it and/or modify
7  * it under the terms of the GNU General Public License as published by
8  * the Free Software Foundation, either version 3 of the License, or
9  * (at your option) any later version.
10  *
11  * Antkeeper source code is distributed in the hope that it will be useful,
12  * but WITHOUT ANY WARRANTY; without even the implied warranty of
13  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14  * GNU General Public License for more details.
15  *
16  * You should have received a copy of the GNU General Public License
17  * along with Antkeeper source code. If not, see <http://www.gnu.org/licenses/>.
18  */
19 
20 #ifndef ANTKEEPER_GEOM_OCTREE_HPP
21 #define ANTKEEPER_GEOM_OCTREE_HPP
22 
24 #include <cstdint>
25 
26 namespace geom {
27 
29 template <std::unsigned_integral T, hyperoctree_order Order>
31 
33 template <hyperoctree_order Order>
35 
37 template <hyperoctree_order Order>
39 
41 template <hyperoctree_order Order>
43 
45 template <hyperoctree_order Order>
47 
49 template <std::unsigned_integral T>
51 
54 
57 
60 
63 
64 } // namespace geom
65 
66 #endif // ANTKEEPER_GEOM_OCTREE_HPP
Hashed linear hyperoctree.
Definition: hyperoctree.hpp:99
Geometric algorithms.
unordered_octree< std::uint32_t > unordered_octree32
Unordered octree with a 32-bit node type (9 depth levels).
Definition: octree.hpp:59
unordered_octree< std::uint64_t > unordered_octree64
Unordered octree with a 64-bit node type (19 depth levels).
Definition: octree.hpp:62
unordered_octree< std::uint8_t > unordered_octree8
Unordered octree with an 8-bit node type (2 depth levels).
Definition: octree.hpp:53
unordered_octree< std::uint16_t > unordered_octree16
Unordered octree with a 16-bit node type (4 depth levels).
Definition: octree.hpp:56