rsive function A,
split it into function B and C, so that A is equivalent to { B();
return C(); }, where B should be easy to inline (e.g. no recursive
calls) and C may not.
Is it possible/reasonable to do such an optimization? I hope it can help. :)
Thanks!
--
Regards,
Tim Shen
those two specializations?
Thanks!
--
Tim Shen
I in
the right direction?
Thanks!
--
Tim Shen
Completing C++11 regex
* The Project
This proposal aims to implement regex interfaces required by the C++11 standard
as much as the student can.
Besides, I get a clear status
here(http://stackoverflow.com/questions/12530406/is-gcc4-7-bugg
earch algo as a final solution :)
On Wed, Apr 24, 2013 at 4:30 PM, Florian Weimer wrote:
> On 04/23/2013 07:21 PM, Tim Shen wrote:
>>
>> I've made a proposal under the guide of application. Is it detailed
>> and realistic?
>
>
> Out of curiosity, do you pla
2013 at 6:56 PM, Florian Weimer wrote:
> On 04/24/2013 12:45 PM, Tim Shen wrote:
>>
>> I'm very interested in implementing a NFA->DFA module(does that mean a
>> Thompson automaton?) so that the exponential searching algorithm can
>> be reduced to a linear state
