This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: [Patch] Regex bracket matcher cache optimization
- From: Paolo Carlini <paolo dot carlini at oracle dot com>
- To: Tim Shen <timshen91 at gmail dot com>, libstdc++ <libstdc++ at gcc dot gnu dot org>, gcc-patches <gcc-patches at gcc dot gnu dot org>
- Date: Sat, 04 Jan 2014 10:25:20 +0100
- Subject: Re: [Patch] Regex bracket matcher cache optimization
- Authentication-results: sourceware.org; auth=none
- References: <CAPrifDnXTpH6K2A6O41OOx34AVMKKm=-gXPh7J0Sjq9=9rM8+g at mail dot gmail dot com>
Hi,
On 01/04/2014 03:35 AM, Tim Shen wrote:
The data structure _BracketMatcher (storing regex like [123a-z]) could
be quite slow mainly because of regex_traits. So a result of cache for
small range of inputs (char) sounds reasonable. It iterates all 256
inputs and calculate them at regex compile time.
Good. Could we actually measure something in the performance testsuite?
Thanks,
Paolo.