[REBOL] Re: Overhead for insert and blocks
From: joel:neely:fedex at: 30-Oct-2000 10:14
Hi, Chris,
[cpage--starforge--demon--co--uk] wrote:
...
> I chose this structure to make accessing, adding and
> removing records easier for me. The only problem I have
> is that I can't use append - new items must be inserted
> at the start of the list for reasons that would take too
> long to go into now.
>
In that case (without going into "too long" issues), how
about trying either list! storage or (it you can separate
the "build" from "use" phases of the blocks)...
typical-block: make block! big-enough-number
...
insert/only tail typical-block new-sub-block
...
Then, after the blocks are built...
typical-block: reverse typical-block
...
...use typical-block, which is now in chronological order...
-jn-
--
; Joel Neely [joel--neely--fedex--com] 901-263-4460 38017/HKA/9677
REBOL [] do [ do func [s] [ foreach [a b] s [prin b] ] sort/skip
do function [s] [t] [ t: "" foreach [a b] s [repend t [b a]] t ] {
| e s m!zauafBpcvekexEohthjJakwLrngohOqrlryRnsctdtiub} 2 ]
