7 // creates empty results data structure for n nodes numbered 0..n-1
8 results createResults (int n);
11 void freeResults (results R);
13 // returns 0/1 telling whether result p is not/is present in R
14 int readResult (results R, int p);
16 unsigned int countResult (results R);
18 // inserts result p into R
19 void setResult (results R, int p);
21 // clears all results p1..p2 in R
22 void clearRange (results R, int p1, int p2);
24 // returns pos of next(p) in R, or -1 if none
25 int nextResult (results R, int p);
27 // for debugging, prints the data structure
28 void printTree (results R);