On Apr 11, 2011, at 11:21 AM, Nicola Pero wrote:
> This patch rewrites the ObjC interface hashtable for speed, saving
> in excess of 100k function calls per typical compilation run in my
> benchmarks.
Does this change a log n lookup to a linear search look up?
This patch rewrites the ObjC interface hashtable for speed, saving
in excess of 100k function calls per typical compilation run in my
benchmarks.
I did extensively benchmark this solution (and other solutions) while
developing it a few months ago. trunk has changed substantially in
the meanwhile,
