Fortran has a computationally efficient called a 'computed goto'. The construct uses an index into a branch table to perform a direct goto. If I remember correctly the syntax is:
go to index (lable1, lable2, ...)
where the index is used to reference a code pointer (label) in the parenthesized list.
I have a case where a computed goto is a better solution than a switch statement and would like to construct one but can't figure out how.
Now before the jibes and slings arrive, it is possible for the compiler to optimize a computed goto, but I have no guarantee that it will.
Aucun commentaire:
Enregistrer un commentaire