#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"
Go to the source code of this file.
Functions | |
void | compareResults (const std::list< OcTreeVolume > &list_iterator, const std::list< OcTreeVolume > &list_depr) |
compare two lists of octree nodes on equality | |
void | computeChildCenter (const unsigned int &pos, const float ¢er_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 | |
void | getVoxelsRecurs (std::list< OcTreeVolume > &voxels, unsigned int max_depth, OcTreeNode *node, unsigned int depth, const point3d &parent_center, const point3d &tree_center, double resolution) |
mimics old deprecated behavior to compare against | |
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) |
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.
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.
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.
void getVoxelsRecurs | ( | std::list< OcTreeVolume > & | voxels, |
unsigned int | max_depth, | ||
OcTreeNode * | node, | ||
unsigned int | depth, | ||
const point3d & | parent_center, | ||
const point3d & | tree_center, | ||
double | resolution | ||
) |
mimics old deprecated behavior to compare against
Definition at line 71 of file test_iterators.cpp.
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 126 of file test_iterators.cpp.
bool OcTreeVolumeSortPredicate | ( | const OcTreeVolume & | lhs, |
const OcTreeVolume & | rhs | ||
) |
Definition at line 112 of file test_iterators.cpp.
void printUsage | ( | char * | self | ) |
Definition at line 14 of file test_iterators.cpp.
double timediff | ( | const timeval & | start, |
const timeval & | stop | ||
) |
Definition at line 122 of file test_iterators.cpp.