int_node           77 notes.c        		struct int_node *node, unsigned int n);
int_node           94 notes.c        static void **note_tree_search(struct notes_tree *t, struct int_node **tree,
int_node          140 notes.c        		struct int_node *tree, unsigned char n,
int_node          159 notes.c        static int note_tree_consolidate(struct int_node *tree,
int_node          160 notes.c        	struct int_node *parent, unsigned char index)
int_node          191 notes.c        		struct int_node *tree, unsigned char n,
int_node          195 notes.c        	struct int_node *parent_stack[20];
int_node          241 notes.c        static int note_tree_insert(struct notes_tree *t, struct int_node *tree,
int_node          245 notes.c        	struct int_node *new_node;
int_node          306 notes.c        	new_node = (struct int_node *) xcalloc(1, sizeof(struct int_node));
int_node          316 notes.c        static void note_tree_free(struct int_node *tree)
int_node          412 notes.c        		struct int_node *node, unsigned int n)
int_node          516 notes.c        static unsigned char determine_fanout(struct int_node *tree, unsigned char n,
int_node          557 notes.c        static int for_each_note_helper(struct notes_tree *t, struct int_node *tree,
int_node         1007 notes.c        	t->root = (struct int_node *) xcalloc(1, sizeof(struct int_node));
int_node           44 notes.h        	struct int_node *root;