[REBOL] Re: Overhead for insert and blocks

2000-10-31 Thread Chris

Andrew Martin wrote:
 
  Internally the files look like:
snip

  ...how are blocks stored?
 
  ...is the data arranged in a single continuos memory area?
 
snip

 
 Watch carefully...

But that doesn't actually answer my question. I'm not talking 
about the representation the user sees, but how the data is
actually held in memory. Is it a simple memory block, single
or double linked list, how are nested blocks handled: are 
they interleaved or does the parent block contain pointers
to the memory containing the nested blocks? What exactly happens
when a block is inserted into a block with /only? 

These implementation issues can have a huge effect on the 
speed of the script. I guess I shouldn't really be worrying
about such things but I'm an unrepentant C programmer and
habits are hard to break ;)

Chris
--
New sig in the works
Explorer2260 Designer and Coder
http://www.starforge.co.uk
--
-- 
To unsubscribe from this list, please send an email to
[EMAIL PROTECTED] with "unsubscribe" in the 
subject, without the quotes.




[REBOL] Re: Overhead for insert and blocks

2000-10-31 Thread Chris

Gabriele Santilli wrote:

 Inserting at the head means shifting all the pointers, but not all
 the data.
 
 HTH,

Just what I was looking for :) Thanks

Chris
--
New sig in the works
Explorer2260 Designer and Coder
http://www.starforge.co.uk
--
-- 
To unsubscribe from this list, please send an email to
[EMAIL PROTECTED] with "unsubscribe" in the 
subject, without the quotes.