Indeed, the binary-search lookup table is only created after the compilation is done... all the *find*identifier* functions should be rewritten to use hash tables anyways.
/ Fredrik (Naranek) Hubinette (Real Build Master)
Previous text:
2004-01-16 23:52: Subject: file limits
Checking if the symbol already exists using linear search? That would give compilation of this particular program O(n²) complexity.
/ Marcus Comstedt (ACROSS) (Hail Ilpalazzo!)