On Mon, 14 Jan 2013 22:55:33 +0100, Gustavo Lopes
wrote:
OK, so now the plan is to merge this onto 5.4:
https://github.com/cataphract/php-src/compare/php:PHP-5.4...cataphract:strtr_wu94_54
And this to 5.5:
https://github.com/cataphract/php-src/compare/php:PHP-5.5...cataphract:strtr_wu94_55
Hi!
> OK, so now the plan is to merge this onto 5.4:
>
> https://github.com/cataphract/php-src/compare/php:PHP-5.4...cataphract:strtr_wu94_54
This one looks mostly harmless, so if all strtr tests still pass I think
it's OK for 5.4.
--
Stanislav Malyshev, Software Architect
SugarCRM: http://www
On 01/14/2013 01:55 PM, Gustavo Lopes wrote:
On Wed, 09 Jan 2013 23:45:03 +0100, Gustavo Lopes
wrote:
On Thu, 03 Jan 2013 11:40:31 +0100, Gustavo Lopes
wrote:
The algorithm behaves very poorly in this case because at each position of the
text, all the substrings starting there and with
On Wed, 09 Jan 2013 23:45:03 +0100, Gustavo Lopes
wrote:
On Thu, 03 Jan 2013 11:40:31 +0100, Gustavo Lopes
wrote:
The algorithm behaves very poorly in this case because at each position
of the text, all the substrings starting there and with size between m
and n (where m is the size o
Em 2013-01-11 0:32, Christopher Jones escreveu:
How does this compare with your baseline results?
I ran some benchmarks.
Configure line:
CC=gcc-mp-4.8 CFLAGS="-O3 -march=native" ./configure --disable-all
--host=x86_64-apple-darwin10 --build=x86_64-apple-darwin10
CPU: Intel(R) Core(TM) i5-25
On 01/09/2013 02:45 PM, Gustavo Lopes wrote:
On Thu, 03 Jan 2013 11:40:31 +0100, Gustavo Lopes
wrote:
The algorithm behaves very poorly in this case because at each position of the
text, all the substrings starting there and with size between m and n (where m
is the size of the smallest p
Hi!
On 9 January 2013 23:45, Gustavo Lopes wrote:
> On Thu, 03 Jan 2013 11:40:31 +0100, Gustavo Lopes
> wrote:
>
> The algorithm behaves very poorly in this case because at each position
>> of the text, all the substrings starting there and with size between m and
>> n (where m is the size of
On Thu, 03 Jan 2013 11:40:31 +0100, Gustavo Lopes
wrote:
The algorithm behaves very poorly in this case because at each position
of the text, all the substrings starting there and with size between m
and n (where m is the size of the smallest pattern and n is the largest)
are checked, ev
Hi!
On 3 January 2013 11:40, Gustavo Lopes wrote:
> Em 2013-01-02 16:53, Nicolai Scheer escreveu:
>
>
>> I might have chosen the wrong tool for what I'm trying to achieve in the
>> first place, but can anyone comment on the algorithmic complexity of
>> strtr?
>> This is definitely not the expect
Em 2013-01-02 16:53, Nicolai Scheer escreveu:
I might have chosen the wrong tool for what I'm trying to achieve in
the
first place, but can anyone comment on the algorithmic complexity of
strtr?
This is definitely not the expected behaviour for such small inputs.
Since
the inputs varied and
10 matches
Mail list logo