<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta content="text/html; charset=ISO-8859-1"
http-equiv="Content-Type">
</head>
<body text="#000000" bgcolor="#ffffff">
<br>
<blockquote cite="mid:337B27C48DA04BF9B2B230C37DE03327@samsungPC"
type="cite">
<p><span lang="es"><font face="Courier New" size="2">At Thu, 29 Sep
2011 12:25:16 +0200, "Jos Koot" wrote:</font></span>
<br>
<span lang="es"></span><br>
<span lang="es"><font face="Courier New" size="2">> In my case I
have a case form which dispatches on a character, 86 different</font></span>
<br>
<span lang="es"><font face="Courier New" size="2">> ones.
Therefore I can dispatch by means of a vector. However, almost every</font></span>
<br>
<span lang="es"><font face="Courier New" size="2">> character has
its own clause and therefore dispatching on the index of the</font></span>
<br>
<span lang="es"><font face="Courier New" size="2">> character
would give no speed up.</font></span></p>
</blockquote>
<br>
Do I understand correctly that this jump-table-like vector-of-closures
is not fast enough?<br>
<br>
If this were assembler for a conventional architecture, and you were
doing a DFA-like lexer, I'd think that a jump table would be quite fast
(but with some bloated constant for code size).<br>
<br>
I wonder whether there's an optimization the compiler/JIT can make that
would be a big help, perhaps with additional hints from the Racket
code? And if so, would that optimization likely be useful for anything
other than optimizing "case" of characters?<br>
<br>
<div class="moz-signature">-- <br>
<a class="moz-txt-link-freetext" href="http://www.neilvandyke.org/">http://www.neilvandyke.org/</a>
</div>
</body>
</html>