> So you'd like to ditch the giant switch statement and replace it with a > function table instead? A vector indexed by function number or a hash_map > perhaps? This is easy enough to implement. And could have some more advantages. You could 'register' new functions at run time. You do not need a monolithic 2MB+ binary when you use only 10% of the functionality. Just load 'modules' dynamically on demand... I'd even drop the kb_action enum and identify actions by name (i.e. a string instead) The speed penalty shouldn't be that high (especially when going from the linearly searched 'switch' statement to a map) and it would break quite a few dependencies... Andre' PS: If you trust your stomach, go and have a look at src/.deps ;-) -- André Pönitz ......................... [EMAIL PROTECTED]
- Re: Compilers, exceptions, code size, etc. [was: Re: ... Andre' Poenitz
- Re: Compilers, exceptions, code size, etc. [was:... Lars Gullik Bjønnes
- Re: Compilers, exceptions, code size, etc. [... Allan Rae
- Re: Compilers, exceptions, code size, et... Amir Karger
- Re: Compilers, exceptions, code size... Allan Rae
- Re: Compilers, exceptions, code... Lars Gullik Bjønnes
- Re: Compilers, exceptions, ... Allan Rae
- Re: Compilers, exceptio... Jean-Marc Lasgouttes
- Re: Compilers, exceptions, code size, et... Andre' Poenitz
- Re: Compilers, exceptions, code size... John Weiss
- Re: Compilers, exceptions, code... Andre Poenitz
- Re: Compilers, exceptions, code size, etc. [was:... Arnd Hanses
- Re: Compilers, exceptions, code size, etc. [was:... Lars Gullik Bjønnes
- Re: Compilers, exceptions, code size, etc. [was:... Arnd Hanses
- Re: Compilers, exceptions, code size, etc. [was:... Arnd Hanses