>
> Is pattern-matching short strings (one or two characters) likely to be
> _vastly_ less efficient than matching against a single level of
> constructor? (Order of magnitude, plus.) Trying to make sense of some
> profiling numbers, here...
I believe it is. Currently I think we call the overloaded
list-equality function, passing it the Eq dictionary for Char.
This could be improved in several ways -- specialisation and
(more directly) spotting short strings, dealing with common prefixes,
and calling a specialised eqString fn.
Speak up, people, if you want to push this up the priority queue.
Simon
