Date: Mon, 9 May 2011 08:30:57 +0400 From: Lev Serebryakov <lev@FreeBSD.org> To: Bakul Shah <bakul@bitblocks.com> Cc: Gabor Kovesdan <gabor@kovesdan.org>, "Pedro F. Giffuni" <giffunip@yahoo.com>, hackers@FreeBSD.org, Brooks Davis <brooks@freebsd.org> Subject: Re: [RFC] Replacing our regex implementation Message-ID: <1164564191.20110509083057@serebryakov.spb.ru> In-Reply-To: <20110509011709.5455CB827@mail.bitblocks.com> References: <4DC7356C.20905@kovesdan.org> <20110509011709.5455CB827@mail.bitblocks.com>
next in thread | previous in thread | raw e-mail | index | archive | help
Hello, Bakul. You wrote 9 =EC=E0=FF 2011 =E3., 5:17:09: > 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 much faster at price of memory. I don't remember details now, but I've found (simple) situations when re2 consumes a HUGE amount of memory (read: hundreds of megabytes). It work faster than tre, yes. If you have this memory to RE engine alone. --=20 // Black Lion AKA Lev Serebryakov <lev@FreeBSD.org>
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?1164564191.20110509083057>