#include <vfer_btree_delay.h>
| Data Fields | |
| int | height | 
| node * | left | 
| node * | parent | 
| node * | right | 
| timeval | stamp | 
| int32_t | val | 
A node in a tree maintains a time stamp which determines how fresh the value is, an index for the tree->nodes array (see optimization above), left,right,parent pointers, and a height which is dynamically maintained
Definition at line 36 of file vfer_btree_delay.h.
| int node::height | 
Definition at line 43 of file vfer_btree_delay.h.
| struct node* node::left | 
Definition at line 40 of file vfer_btree_delay.h.
| struct node* node::parent | 
Definition at line 42 of file vfer_btree_delay.h.
| struct node* node::right | 
Definition at line 41 of file vfer_btree_delay.h.
| struct timeval node::stamp | 
Definition at line 38 of file vfer_btree_delay.h.
| int32_t node::val | 
Definition at line 37 of file vfer_btree_delay.h.
 1.4.7
 1.4.7