From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-0.9 required=5.0 tests=BAYES_00,FORGED_GMAIL_RCVD, FREEMAIL_FROM autolearn=no autolearn_force=no version=3.4.4 X-Google-Thread: 103376,f4006c440754467b X-Google-Attributes: gid103376,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!postnews.google.com!v65g2000hsc.googlegroups.com!not-for-mail From: braver Newsgroups: comp.lang.ada Subject: Re: Wide Finder in Ada? Date: Mon, 12 Nov 2007 01:55:07 -0800 Organization: http://groups.google.com Message-ID: <1194861307.660307.244010@v65g2000hsc.googlegroups.com> References: <1194831460.619945.188980@v3g2000hsg.googlegroups.com> <47380779$1@news.post.ch> NNTP-Posting-Host: 85.30.231.120 Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" X-Trace: posting.google.com 1194861307 29333 127.0.0.1 (12 Nov 2007 09:55:07 GMT) X-Complaints-To: groups-abuse@google.com NNTP-Posting-Date: Mon, 12 Nov 2007 09:55:07 +0000 (UTC) In-Reply-To: <47380779$1@news.post.ch> User-Agent: G2/1.0 X-HTTP-UserAgent: Opera/9.24 (Macintosh; Intel Mac OS X; U; en),gzip(gfe),gzip(gfe) Complaints-To: groups-abuse@google.com Injection-Info: v65g2000hsc.googlegroups.com; posting-host=85.30.231.120; posting-account=ps2QrAMAAAA6_jCuRt2JEIpn5Otqf_w0 Xref: g2news1.google.com comp.lang.ada:18301 Date: 2007-11-12T01:55:07-08:00 List-Id: On Nov 12, 10:57 am, Martin Krischik wrote: > First things First: Any Splitbool specialist which can turn the Ruby > regex into splitbool? The best solutions there went from regexes to custom parsers/field extractors. I wonder whether your excellent SAR is applicable, or Dmitry Kazakov's SNOBOL matching? Here's what top Python things look like: http://effbot.org/zone/wide-finder.htm They use a Python toolkit replacing regexen, which is faster: http://www.egenix.com/products/python/mxBase/mxTextTools/ Apparently regexen are not needed and something custom/simpler will do, like splitting lines in Ada -- what's the fastest way to do that? Cheers, Alexy