Date: Sun, 08 May 2011 18:17:09 -0700 From: Bakul Shah <bakul@bitblocks.com> To: Gabor Kovesdan <gabor@kovesdan.org> Cc: "Pedro F. Giffuni" <giffunip@yahoo.com>, hackers@FreeBSD.org, Brooks Davis <brooks@freebsd.org> Subject: Re: [RFC] Replacing our regex implementation Message-ID: <20110509011709.5455CB827@mail.bitblocks.com> In-Reply-To: Your message of "Mon, 09 May 2011 01:29:32 BST." <4DC7356C.20905@kovesdan.org> References: <4DC7356C.20905@kovesdan.org>
next in thread | previous in thread | raw e-mail | index | archive | help
As per the following URLs re2 is much faster than TRE (on the benchmarks they ran): http://lh3lh3.users.sourceforge.net/reb.shtml http://sljit.sourceforge.net/regex_perf.html re2 is in C++ & has a PCRE API, while TRE is in C & has a POSIX API. Both have BSD copyright. Is it worth considering making re2 posix compliant?
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20110509011709.5455CB827>