on Tue, 2 Dec 2003 23:46:33 +0100 I already wrote, regarding replacing
macro %rand[x]-[y] with random of random length ([x]-[y]).
Before, I had my own (slow!) procedure to find next occurence of the
macro and generated a new string, which was returned.
This took about 15 seconds for 10.000 addres
on 02 Dec 2003 18:56:28 -0500 Robert Cummings wrote:
RC> I missed the original post, and I'm too lazy to go looking, but the
RC> following code runs in approx. 2.75 seconds on my Athlon 2400 running
RC> linux:
it is 4.3 seconds on xp 1600+..
RC> $chars = '0123456789'
RC> .'abcdef
on Tue, 2 Dec 2003 23:33:47 + Richard Davey wrote:
RD> Just so we're clear on this - you're creating a string (an email
RD> address) of a million characters? I don't know my mail RFC's that well, but
RD> I'm sure this is well beyond what it considers "standard".
We're not clear.. ;)
the funct
On Tue, 2003-12-02 at 18:33, Richard Davey wrote:
> Hello Daniel,
>
> Tuesday, December 2, 2003, 10:46:33 PM, you wrote:
>
> dh> For generation of a random string with length 1.000.000 it takes about
> dh> 13 seconds on my xp 1600+.. that's quite a lot, imho, so suggestions
> dh> are very welcome
Hello Daniel,
Tuesday, December 2, 2003, 10:46:33 PM, you wrote:
dh> For generation of a random string with length 1.000.000 it takes about
dh> 13 seconds on my xp 1600+.. that's quite a lot, imho, so suggestions
dh> are very welcome..
Just so we're clear on this - you're creating a string (an e
5 matches
Mail list logo
