[REBOL] Re: On mutability and sameness
From: jeff:rebol at: 22-Jun-2001 8:01
Howdy, Chris:
> Just to play devil's advocate for a moment...
> . . .
>
> What I think REBOL is lacking is a rigid language spec, or
> at least a document that tells REBOL hackers about the time
> and space complexity of major datatypes and
> operations. Without this sort of information, it is very
> easy to end up using something with linear or exponential
> cost, when a constant cost alternative is actually
> avilable.
Sure, good point-- and we've always been forthright about
the order magnitudes associated with different data
structures and operations (at least all that data has been
posted to this list at one time or another). What's not
been done is create a table of these specs and provide that
for the interested. Or really anyone could publish an order
analysis of REBOL at this point, using ml archive -- search
for O(*) If there's any gaps in the data, just ask! . That
or it can go into the RT TBD pile. :-) (To Be Done)
-jeff