costs of pick, inserting at head and this code:
for offset 0 9 1 [
if (start + offset) <= (length? buglist) [
entry: pick buglist (start + offset)
; throw out a table entry to show the bug summary..
]
]
:
1) you work sequentially here? so, why picking?
list! should be better in this manner:
loop[do-something-with list list: next list]
which should be as fast as blocks.
like:
;hoping start is very near the buglist-position, otherwise blocks are
better
list: at buglist start
for offset 0 9 1 [
if (start + offset) <= (length? buglist) [
;not: entry: pick buglist (start + offset)
;but:
entry: first list
list: next list
; throw out a table entry to show the bug summary..
]
]
2) list-positions after insertions works a bit different to blocks,
you would need some 'head more.
usually i find blocks everywhere more surprise-free
volker
>>>>>>>>>>>was:
[REBOL] Block! v List! dilema...
From: Chris (view other messages by this author)
Date: Fri, 6 Apr 2001 12:56:55
--
To unsubscribe from this list, please send an email to
[EMAIL PROTECTED] with "unsubscribe" in the
subject, without the quotes.
