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 // inserts result p into R
17 void setResult (results R, int p);
19 // clears all results p1..p2 in R
20 void clearRange (results R, int p1, int p2);
22 // returns pos of next(p) in R, or -1 if none
23 int nextResult (results R, int p);
25 // for debugging, prints the data structure
26 void printTree (results R);