#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <octomap/octomap_timing.h>
#include <octomap/octomap.h>
#include <octomap/math/Utils.h>
#include "testing.h"

Include dependency graph for test_iterators.cpp:

Functions
void	boundingBoxTest (OcTree *tree)

void	compareResults (const std::list< OcTreeVolume > &list_iterator, const std::list< OcTreeVolume > &list_depr)
	compare two lists of octree nodes on equality More...

void	computeChildCenter (const unsigned int &pos, const float &center_offset, const point3d &parent_center, point3d &child_center)

void	getLeafNodesRecurs (std::list< OcTreeVolume > &voxels, unsigned int max_depth, OcTreeNode node, unsigned int depth, const point3d &parent_center, const point3d &tree_center, OcTree tree, bool occupied)
	mimics old deprecated behavior to compare against More...

void	getVoxelsRecurs (std::list< OcTreeVolume > &voxels, unsigned int max_depth, OcTreeNode node, unsigned int depth, const point3d &parent_center, const point3d &tree_center, OcTree tree)
	mimics old deprecated behavior to compare against More...

int	main (int argc, char **argv)

bool	OcTreeVolumeSortPredicate (const OcTreeVolume &lhs, const OcTreeVolume &rhs)

void	printUsage (char *self)

double	timediff (const timeval &start, const timeval &stop)

Function Documentation

◆ boundingBoxTest()

void boundingBoxTest ( OcTree * tree )

Definition at line 126 of file test_iterators.cpp.

◆ compareResults()

void compareResults	(	const std::list< OcTreeVolume > &	list_iterator,
		const std::list< OcTreeVolume > &	list_depr
	)

compare two lists of octree nodes on equality

Definition at line 98 of file test_iterators.cpp.

◆ computeChildCenter()

void computeChildCenter	(	const unsigned int &	pos,
		const float &	center_offset,
		const point3d &	parent_center,
		point3d &	child_center
	)

Definition at line 21 of file test_iterators.cpp.

◆ getLeafNodesRecurs()

void getLeafNodesRecurs	(	std::list< OcTreeVolume > &	voxels,
		unsigned int	max_depth,
		OcTreeNode *	node,
		unsigned int	depth,
		const point3d &	parent_center,
		const point3d &	tree_center,
		OcTree *	tree,
		bool	occupied
	)

mimics old deprecated behavior to compare against

Definition at line 38 of file test_iterators.cpp.

◆ getVoxelsRecurs()

void getVoxelsRecurs	(	std::list< OcTreeVolume > &	voxels,
		unsigned int	max_depth,
		OcTreeNode *	node,
		unsigned int	depth,
		const point3d &	parent_center,
		const point3d &	tree_center,
		OcTree *	tree
	)

mimics old deprecated behavior to compare against

Definition at line 71 of file test_iterators.cpp.

◆ main()

int main	(	int	argc,
		char **	argv
	)

get number of nodes:

get all occupied leafs

get all free leafs

get all volumes

bounding box tests

Definition at line 212 of file test_iterators.cpp.

◆ OcTreeVolumeSortPredicate()

bool OcTreeVolumeSortPredicate	(	const OcTreeVolume &	lhs,
		const OcTreeVolume &	rhs
	)

Definition at line 112 of file test_iterators.cpp.

◆ printUsage()

void printUsage ( char * self )

Definition at line 14 of file test_iterators.cpp.

◆ timediff()

double timediff	(	const timeval &	start,
		const timeval &	stop
	)

Definition at line 122 of file test_iterators.cpp.

Functions