Java’s N-way branch. In the JVM (Java Virtual Machine) there are two different ways of implementing a switch, tableswitch and lookupswitch. The efficient tableswitch is a jump table used when the switch values are reasonably dense e.g. numbered 0..N. The less efficient lookupswitch is a binary search used when the switch values all over the map. It thus pays to keep your switch values dense i.e. sequential.
The most common error with switch is to forget the break. Then one case falls through into the next.
// S W I T C H / C A S E switch ( n ) { case 1: System.out.println( "one" ); break; case 2: System.out.println( "two" ); break; default: System.out.println( "something else" ); }// end switch (n)
|
|
You can get the freshest copy of this page from: | or possibly from your local J: drive (Java virtual drive/mindprod.com website mirror) |
| http://mindprod.com/jgloss/switch.html | J:\mindprod\jgloss\switch.html | |
![]() | Please email your feedback for publication,
letters to the editor, errors, omissions, typos, formatting errors, ambiguities, unclear wording,
broken/redirected link reports, suggestions to improve this page or comments to
Roedy Green :
| |
| Canadian Mind Products | ||
| mindprod.com IP:[65.110.21.43] | ||
| view Blog | Your face IP:[38.107.179.211] | |
| Feedback | You are visitor number 24,540. | |