25 #ifndef __PLUGINS_LASERHT_HT_ACCUM_H_
26 #define __PLUGINS_LASERHT_HT_ACCUM_H_
36 unsigned int insert(
int *values);
38 unsigned int num_nodes();
41 unsigned int filter(
int **values,
unsigned int min_count);
44 Node(
HoughTransform *ht, Node *parent,
unsigned int dims,
int value = 0);
47 void reinit(Node *parent,
unsigned int dims,
int value) {
49 __left = __right = __dim_next = 0;
54 Node *
filter(Node *tail,
unsigned int min_count);
55 unsigned int filtered_length();
80 void process(
int **values,
unsigned int num_values);
81 unsigned int max(
int *values)
const;
83 unsigned int filter(
int **values,
unsigned int min_count);
89 inline Node *
create_node(Node *parent,
unsigned int dims,
int value = 0)
91 if (__reuse_cur != 0) {
92 Node *rv = __reuse_cur;
93 rv->reinit(parent, dims, value);
94 __reuse_cur = __reuse_cur->__reuse_next;
97 Node *rv =
new Node(
this, parent, dims, value);
98 __reuse_tail->__reuse_next = rv;
110 unsigned int __num_dims;
111 unsigned int __max_count;