Hallo Michael, Du schriebst am Tue, 19 Nov 2013 12:55:50 +0100:
> How the "jump" is done is up to the compiler optimization not of the > syntax. Not quite - if you allow such complicated constructs, the compiler has to be complicated - and thus error prone - as well, because it has to be able to tell different requirements apart and handle them appropriately. Or it might be implemented in a simple, all comprising and ridiculously inefficient way. > For only a few cases it might use just do multiple compares, > For a sequence of numbers with not too many gaps it might do a direct > calculation > For a sequence of numbers with large gaps it might search a table of > constants and do a calculated jump afterwards. Yes, as does gcc, e.g. It's documented so, and they say so that you _know_ it isn't a "classical" jump table based case implementation. So you can simply forgo any possibly introduced inefficiencies by letting the _compiler_ do some guesswork as to what you might have wanted and can implement an if cascade or whatever you think appropriate yourself. -- -- (Weitergabe von Adressdaten, Telefonnummern u.ä. ohne Zustimmung nicht gestattet, ebenso Zusendung von Werbung oder ähnlichem) ----------------------------------------------------------- Mit freundlichen Grüßen, S. Schicktanz ----------------------------------------------------------- ------------------------------------------------------------------------------ Shape the Mobile Experience: Free Subscription Software experts and developers: Be at the forefront of tech innovation. Intel(R) Software Adrenaline delivers strategic insight and game-changing conversations that shape the rapidly evolving mobile landscape. Sign up now. http://pubads.g.doubleclick.net/gampad/clk?id=63431311&iu=/4140/ostg.clktrk _______________________________________________ mseide-msegui-talk mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/mseide-msegui-talk
