Scherrer, Chad wrote:
Sorry to drag this thread out, but here's one more thing you might try...
(This is the café, isn't it? :-)
Another option is perhaps to pack both char and count in one Int and use some kind of Set. This should save some space, and possibly time as well (presuming bitwise ops are less expensive than pointer dereferences, which I believe have been a safe assumption since the mid-90s), but requires a Set being searchable for ranges. (Do any of the implementations support this, BTW?)
-k _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
