FORM 4.3
|
#include <structs.h>
Data Fields | |
int | parent |
int | left |
int | right |
int | value |
int | blnce |
int | usage |
The subexpressions in the compiler are kept track of in a (balanced) tree to reduce the need for subexpressions and hence save much space in large rhs expressions (like when we have xxxxxxx occurrences of objects like f(x+1,x+1) in which each x+1 becomes a subexpression. The struct that controls this tree is COMPTREE.
int parent |
int left |
int right |
int value |
The object to be sorted and searched
Definition at line 297 of file structs.h.
Referenced by IniFbuffer().
int blnce |
int usage |
Number of uses in some types of trees
Definition at line 299 of file structs.h.
Referenced by CleanupArgCache(), and IniFbuffer().