Re: Minimum & Maximum
Noah Smith wrote:
> function minimum(object a, object b)
snip
> end function
> I have no idea if this is faster (or works),
ummm... it doesn't handle nested sequences, sumfin i
have learned the very hard way, cuz ralf keeps
beating it into my head to make sure i write code
that fully enters all dimensions of a sequence. :)
(hush ralf, i'm kidding... well... okay...
so i'm not... ;)
>but it seems less confusin,
it is...
>and ain't recursive which cuts down on
>function call time.
actually, after the thread on abs, a few things
were gleaned from rob about recursion... that
EU is actually the only language i have come across
(as i think most of us) that can really handle
recursion. jiri once mentioned an interview held
by the father of programming, and how he was going
to code a language that was kinder and gentler
to recursion... rob has gone far towards that...
>Potential prolems: how fast is repeat?
repeat is faster than successive appending...
(for larger sequences or ones you think may get big)
extremely fast in fact... not that appending is
slow... it can be faster if you aren't doing
that much appending (like a few dozen) since
rob always allocates a wee bit extra at the tail
of a sequence.
>and repeat also has a max, sumthin like 175,000.
i hadn't noticed that, is that confirmable?
cuz that is one of those things that needs
documenting if it's true...
thanks for the time you spent and the help...
--Hawke'
|
Not Categorized, Please Help
|
|
