29         ShadowSymbol* shadow = symbol_pool[k];  in Rehash()  local
30         unsigned i = shadow -> Identity() -> index % hash_size;  in Rehash()
31         shadow -> next = base[i];  in Rehash()
32         base[i] = shadow;  in Rehash()
53             ShadowSymbol* shadow = symbol_pool[i];  in operator ==()  local
54             Symbol* symbol = shadow -> symbol;  in operator ==()
56                  symbol = (Symbol*) (k < shadow -> NumConflicts()  in operator ==()
57                                      ? shadow -> Conflict(k++) : NULL))  in operator ==()
77             ShadowSymbol* shadow = set.symbol_pool[i];  in Union()  local
78             Symbol* symbol = shadow -> symbol;  in Union()
80                  symbol = (Symbol*) (k < shadow -> NumConflicts()  in Union()
81                                      ? shadow -> Conflict(k++) : NULL))  in Union()
98             ShadowSymbol* shadow = symbol_pool[i];  in Intersection()  local
99             Symbol* symbol = shadow -> symbol;  in Intersection()
101                  symbol = (Symbol*) (k < shadow -> NumConflicts()  in Intersection()
102                                      ? shadow -> Conflict(k++) : NULL))  in Intersection()
125         ShadowSymbol* shadow = set.symbol_pool[i];  in Intersects()  local
126         Symbol* symbol = shadow -> symbol;  in Intersects()
128              symbol = (Symbol*) (k < shadow -> NumConflicts()  in Intersects()
129                                  ? shadow -> Conflict(k++) : NULL))  in Intersects()
145     ShadowSymbol* shadow;  in RemoveElement()  local
146     for (shadow = base[i]; shadow; previous = shadow, shadow = shadow -> next)  in RemoveElement()
148         if (shadow -> Identity() == name_symbol)  in RemoveElement()
150             Symbol* symbol = shadow -> symbol;  in RemoveElement()
153                  symbol = (Symbol*) (k < shadow -> NumConflicts()  in RemoveElement()
154                                      ? shadow -> Conflict(k++) : NULL))  in RemoveElement()
162                 if (shadow -> NumConflicts() == 0)  in RemoveElement()
164                 shadow -> RemoveConflict(k - 1);  in RemoveElement()
170     if (shadow) // element is the only object contained in shadow  in RemoveElement()
173              base[i] = shadow -> next;  in RemoveElement()
174         else previous -> next = shadow -> next;  in RemoveElement()
177         if (shadow -> pool_index != last_index)  in RemoveElement()
181             symbol_pool[last_index] -> pool_index = shadow -> pool_index;  in RemoveElement()
182             symbol_pool[shadow -> pool_index] = symbol_pool[last_index];  in RemoveElement()
186         delete shadow;  in RemoveElement()