OpenEuphoria

Re: Faster Please .. The End

• Posted by "Euman" <euman at bellsouth.net> Jan 13, 2004
• 362 views

Actually, Tommy Carlier in his infinite wizdom did manage to beat that
routine by 0.01 sec run on my machine and 0.03 on a 2x slower machine.

Thanks go to Tommy

here is that code:

global function sNestDelimited(sequence s, integer x)
integer start
sequence dseq
dseq={}
start = 1
for i = 1 to length(s) do
if s[i] = x then
dseq = append(dseq, s[start..i-1])
start = i+1
end if
end for
return dseq
end function

Hopefully no 3D's this time...

Euman

----- Original Message ----- 
From: "Kat" <gertie at visionsix.com>
> On 12 Jan 2004, at 23:41, Euman wrote:
> > 
> > I think this one will be hard to beat, Kat can you with strtok.e?
> 
> Well, i figured you could run the tests, since you came up with the new 
> code, and you have strtok?
</snip>