This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: Regex instantiation
- From: Tim Shen <timshen91 at gmail dot com>
- To: Paolo Carlini <paolo dot carlini at oracle dot com>
- Cc: Marc Glisse <marc dot glisse at inria dot fr>, "libstdc++" <libstdc++ at gcc dot gnu dot org>
- Date: Thu, 9 Jan 2014 11:32:28 -0500
- Subject: Re: Regex instantiation
- Authentication-results: sourceware.org; auth=none
- References: <CAPrifDnbuYcMBSwZChRz7cE6ZfhPT55YRxJ8nLDHadMKe=L-hA at mail dot gmail dot com> <alpine dot DEB dot 2 dot 10 dot 1401090740190 dot 3666 at laptop-mg dot saclay dot inria dot fr> <CAPrifDmUaJayAucrHigb1231v6qdn=_mbzPpqWUTMi=z2_me=A at mail dot gmail dot com> <52CE762E dot 7050800 at oracle dot com>
On Thu, Jan 9, 2014 at 5:13 AM, Paolo Carlini <paolo.carlini@oracle.com> wrote:
> We could maybe compute the length and dispatch to two different strategies?
The length is at run-time, while the dispatch must be done at compile-time.
How can I calculate the binary file size cost of basic_string inst? If
it is not that much, it could be worthy. After all, the standard
specified some typedefs about basic_string (ssub_match, smatch,
sregex_iterator, sregex_token_iterator).
--
Regards,
Tim Shen