On Sat, Feb 24, 2007 at 12:32:18AM +0000, Jon Harrop wrote:
> On Friday 23 February 2007 23:39, you wrote:
> > Because, at least what I think, comparing strings using a hash-table is way
> > faster than comparing them using pattern-matching.
> 
> I had always assumed that OCaml would build an optimal dispatch table when 
> pattern matching over strings but it seems you are quite right: it does the 
> worst possible linear string equality tests, not even O(log n) comparisons.
> 
> That seems like a great shame to me. Can someone implement this?
[...]

=> Feature-wish in Ocaml-Bug-Tracker?


Ciao,
   Oliver