55       set->list[i].free_next = i+1;      in setInit()
56       set->list[i].alloc_next = -1;  in setInit()
59     set->list[SET_SIZE-1].free_next = -1;  in setInit()
73     set->list[free].val = item;  in setAdd()
74     set->free = set->list[free].free_next;  in setAdd()
80   set->list[free].alloc_next = set->alloc;  in setAdd()
82   set->list[free].free_next = -1;      in setAdd()
93     if(set->list[alloc].val == item){  in setDel()
95         set->list[prev].alloc_next = set->list[alloc].alloc_next;   in setDel()
97         set->alloc = set->list[alloc].alloc_next;  in setDel()
101     alloc = set->list[alloc].alloc_next;        in setDel()
107   set->list[alloc].free_next = set->free;  in setDel()
109   set->list[alloc].alloc_next = -1;     in setDel()
121   *item = set->list[set->alloc].val;  in setFirst()
122   set->trace = set->list[set->alloc].alloc_next;   in setFirst()
132   *item = set->list[set->trace].val;  in setNext()
133   set->trace = set->list[set->trace].alloc_next;        in setNext()