#include <assert.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include "nav2d_localizer/pf_vector.h"
#include "nav2d_localizer/pf_kdtree.h"
Go to the source code of this file.
|  | 
| pf_kdtree_t * | pf_kdtree_alloc (int max_size) | 
|  | 
| void | pf_kdtree_clear (pf_kdtree_t *self) | 
|  | 
| void | pf_kdtree_cluster (pf_kdtree_t *self) | 
|  | 
| static void | pf_kdtree_cluster_node (pf_kdtree_t *self, pf_kdtree_node_t *node, int depth) | 
|  | 
| static int | pf_kdtree_equal (pf_kdtree_t *self, int key_a[], int key_b[]) | 
|  | 
| static pf_kdtree_node_t * | pf_kdtree_find_node (pf_kdtree_t *self, pf_kdtree_node_t *node, int key[]) | 
|  | 
| void | pf_kdtree_free (pf_kdtree_t *self) | 
|  | 
| int | pf_kdtree_get_cluster (pf_kdtree_t *self, pf_vector_t pose) | 
|  | 
| double | pf_kdtree_get_prob (pf_kdtree_t *self, pf_vector_t pose) | 
|  | 
| void | pf_kdtree_insert (pf_kdtree_t *self, pf_vector_t pose, double value) | 
|  | 
| static pf_kdtree_node_t * | pf_kdtree_insert_node (pf_kdtree_t *self, pf_kdtree_node_t *parent, pf_kdtree_node_t *node, int key[], double value) | 
|  | 
  
  | 
        
          | int pf_kdtree_equal | ( | pf_kdtree_t * | self, |  
          |  |  | int | key_a[], |  
          |  |  | int | key_b[] |  
          |  | ) |  |  |  | static |