tree Struct Reference

A btree maitaining min delay history in an AVL balancing algorithmic fashion. More...

#include <vfer_btree_delay.h>

Data Fields
node_t	last_val
node_t *	root
timeval	window

---

Detailed Description

A btree maitaining min delay history in an AVL balancing algorithmic fashion.

a tree has a root pointer, a nodes array (see optimization above), a nodes_free counter and free_nodes array (also for optimization) and a window which determines the freshness of data values in the tree (ie. when to expire them)

Definition at line 53 of file vfer_btree_delay.h.

---

Field Documentation

node_t tree::last_val

Definition at line 55 of file vfer_btree_delay.h.

node_t* tree::root

Definition at line 54 of file vfer_btree_delay.h.

struct timeval tree::window

Definition at line 64 of file vfer_btree_delay.h.

---

The documentation for this struct was generated from the following file:

• src/vfer_btree_delay.h

---