dynamic_rtree.h File Reference

#include <algorithm>
#include <bit>
#include <cassert>
#include <climits>
#include <cstdint>
#include <cstring>
#include <functional>
#include <limits>
#include <queue>
#include <utility>
#include <vector>
#include <geometry/rtree/rtree_node.h>

Go to the source code of this file.

Classes
class	KIRTREE::DYNAMIC_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, TMAXNODES >
	Dynamic R*-tree with SoA node layout and stored insertion bounding boxes. More...
struct	KIRTREE::DYNAMIC_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, TMAXNODES >::BULK_ENTRY
	Entry type for bulk loading. More...
class	KIRTREE::DYNAMIC_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, TMAXNODES >::Iterator
	Iterator for traversing all data items in the tree. More...
struct	KIRTREE::DYNAMIC_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, TMAXNODES >::Iterator::STACK_ENTRY
class	KIRTREE::DYNAMIC_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, TMAXNODES >::SearchIterator
	Lazy iterator that traverses only nodes overlapping a query rectangle. More...
struct	KIRTREE::DYNAMIC_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, TMAXNODES >::SearchIterator::STACK_ENTRY
class	KIRTREE::DYNAMIC_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, TMAXNODES >::SearchRange
	Lazy range for iterating over items whose bounding boxes overlap a query rectangle. More...
struct	KIRTREE::DYNAMIC_RTREE< DATATYPE, ELEMTYPE, NUMDIMS, TMAXNODES >::SPLIT_ENTRY

Namespaces
namespace	KIRTREE