UT/UT_RTree.C File Reference

#include "UT_RTree.h"
#include "UT_Assert.h"
#include <ostream>
#include <algorithm>

Go to the source code of this file.

Classes
struct	UT_BoxedItemT< T >
struct	UT_BoxedItemAxisOrderT< T >
class	UT_RNode< ORDER >
Defines
#define	NOMINMAX
Functions
template<typename T >
ostream &	operator<< (ostream &os, const UT_BoxT< T > &b)
template<typename T >
ostream &	operator<< (ostream &os, const UT_BoxedItemT< T > &bf)
template<typename T >
void	computeBoundingBox (UT_BoxT< T > &bounding_box, const UT_BoxT< T > *const begin, const UT_BoxT< T > *const end)
template<typename T >
void	computeBoundingBox (UT_BoxT< T > &bounding_box, const UT_BoxedItemT< T > *const begin, const UT_BoxedItemT< T > *const end)
template<int ORDER, typename T >
UT_RNode< ORDER > *	subtreeCreate (UT_BoxT< T > &bounding_box, UT_BoxT< T > shared_boxes[], UT_BoxedItemT< T > *const begin, UT_BoxedItemT< T > *const end, UT_RNode< ORDER > *const shared_nodes, UT_RNode< ORDER > *&shared_nodes_end)
template<int ORDER, typename T >
void	subtreeCreateBoxAssignment (UT_BoxT< T > &bounding_box, UT_BoxT< T > *const shared_boxes, const UT_RNode< ORDER > *const shared_nodes, const UT_RNode< ORDER > *const node, const UT_BoxT< T > item_boxes[])
template<int ORDER, typename T >
int *	subtreeGetIntersectingItems (const UT_RNode< ORDER > *const shared_nodes, const UT_BoxT< T > *const shared_boxes, const UT_RNode< ORDER > *const node, const UT_BoxT< T > &query_box, int *const items_begin)

---

Define Documentation

#define NOMINMAX

Definition at line 19 of file UT_RTree.C.

---

Function Documentation

template<typename T >

void computeBoundingBox	(	UT_BoxT< T > &	bounding_box,
		const UT_BoxedItemT< T > *const	begin,
		const UT_BoxedItemT< T > *const	end
	)			[inline]

Definition at line 246 of file UT_RTree.C.

template<typename T >

void computeBoundingBox	(	UT_BoxT< T > &	bounding_box,
		const UT_BoxT< T > *const	begin,
		const UT_BoxT< T > *const	end
	)			[inline]

Definition at line 227 of file UT_RTree.C.

template<typename T >

ostream& operator<<	(	ostream &	os,
		const UT_BoxedItemT< T > &	bf
	)			[inline]

Definition at line 213 of file UT_RTree.C.

template<typename T >

ostream& operator<<	(	ostream &	os,
		const UT_BoxT< T > &	b
	)			[inline]

Definition at line 187 of file UT_RTree.C.

template<int ORDER, typename T >

UT_RNode<ORDER>* subtreeCreate	(	UT_BoxT< T > &	bounding_box,
		UT_BoxT< T >	shared_boxes[],
		UT_BoxedItemT< T > *const	begin,
		UT_BoxedItemT< T > *const	end,
		UT_RNode< ORDER > *const	shared_nodes,
		UT_RNode< ORDER > *&	shared_nodes_end
	)			[inline]

Definition at line 410 of file UT_RTree.C.

template<int ORDER, typename T >

void subtreeCreateBoxAssignment	(	UT_BoxT< T > &	bounding_box,
		UT_BoxT< T > *const	shared_boxes,
		const UT_RNode< ORDER > *const	shared_nodes,
		const UT_RNode< ORDER > *const	node,
		const UT_BoxT< T >	item_boxes[]
	)			[inline]

Definition at line 513 of file UT_RTree.C.

template<int ORDER, typename T >

int* subtreeGetIntersectingItems	(	const UT_RNode< ORDER > *const	shared_nodes,
		const UT_BoxT< T > *const	shared_boxes,
		const UT_RNode< ORDER > *const	node,
		const UT_BoxT< T > &	query_box,
		int *const	items_begin
	)			[inline]

Definition at line 561 of file UT_RTree.C.