[MUD-Dev] Re: Question on c++ switch optimization, and parsers i

Jon A. Lambert jlsysinc at ix.netcom.com
Mon Feb 8 00:55:53 New Zealand Daylight Time 1999

On  7 Feb 99, Ben Greear wrote:
> Basically, I'll have a bunch of classes hashed into an array
> that will contain the keywords mapped to an enum.
> Now, I get the enum, and then I need to call the various commands
> that the enum maps to.
> Currently, I'm using a huge (~400 cases) switch statement.
> So, the question is:  Is that efficient?  Does the compiler
> generate code that does better than a linear search down the
> case statements?  If not, I can manually hack a sort of n-ary
> tree performance into it, but I'd wrather not if I can help it.
> Also, I'll be curious if anyone wants to spew forth their own ideas
> on how to parse user's commands into callable methods.

Instead of the array mapping to enums, why not map to funtion pointers?

--*     Jon A. Lambert - TychoMUD       Email:jlsysinc at .ix.netcom.com      *--
--*     Mud Server Developer's Page <http://pw1.netcom.com/~jlsysinc>      *--
--* I am the Dragon of Grindly Grund, but my lunches aren't very much fun, *--
--* For I like my damsels medium rare, And they always come out well done. *--

More information about the MUD-Dev mailing list