On 11/20/2011 03:28 PM, David Woodhouse wrote: > On Sun, 2011-11-20 at 15:26 -0800, H. Peter Anvin wrote: >> If we're going to do this at build time, I would suggest using a >> collisionless hash instead. The lookup time for those are O(1), but >> they definitely need to be done at build time. > > Is the lookup time really an issue? > Probably not a big one (in most scenarios), but with better exception handling it might stretch the usability of exceptions. The bigger thing is that once you're doing a build-time special handler for this *anyway*, you might as well drive the cost of the lookup to functionally zero. -hpa
