Since I have very little experience with Haskell and am not used to Haskell-think yet, I don't quite understand your statement that regexes are seen as foreign to Haskell-think. Could you elaborate? What would a more "native" solution look like? From what I have learned so far, it seems to me that Haskell is a lot about clear, concise, and well structured code. I find regexes extremely compact and powerful, allowing for very concise code, which should fit the bill perfectly, or shouldn't it?
Thanks, nick On Wed, Feb 13, 2013 at 8:12 AM, Brandon Allbery <allber...@gmail.com>wrote: > On Tue, Feb 12, 2013 at 11:32 PM, <bri...@aracnet.com> wrote: > >> actualy native code compiler. Can't regex be done effectively in haskell >> ? Is it something that can't be done, or is it just such minimal effort to >> link to pcre that it's not worth the trouble ? >> > > PCRE is pretty heavily optimized. POSIX regex engines generally rely on > vendor regex libraries which my not be well optimized; there is a native > Haskell implementation as well, but that one runs into a different issue, > namely a lack of interest (regexes are often seen as "foreign" to > Haskell-think, so there's little interest in making them work well; people > who *do* need them for some reason usually punt to pcre). > > -- > brandon s allbery kf8nh sine nomine > associates > allber...@gmail.com > ballb...@sinenomine.net > unix, openafs, kerberos, infrastructure, xmonad > http://sinenomine.net >
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe