[1488] in java-interest
lookupswitch byte code
daemon@ATHENA.MIT.EDU (Erik Corry)
Tue Sep 5 23:43:21 1995
From: erik@kroete2.freinet.de (Erik Corry)
To: java-interest@java.sun.com
Date: Wed, 6 Sep 1995 01:35:24 +0100 (MET DST)
Reply-To: ehcorry@inet.uni-c.dk (Erik Corry)
Looking at the description of the 'lookupswitch' byte code on
http://java.sun.com/1.0alpha3/doc/vmspec/vmspec_28.html#HEADING177
(which is presumably designed to implement sparse switch statements,)
I notice that the match-offset pairs are not guaranteed to be sorted
by match. This means that a binary chop search is not possible. Is
this an omission in the docs, in the definition, or is there a good
reason for it?
--
Erik Corry ehcorry@inet.uni-c.dk
-
Note to Sun employees: this is an EXTERNAL mailing list!
Info: send 'help' to java-interest-request@java.sun.com
