Re: efficiently building a large list

2012-06-03 Thread Henrik Sarvell
Here's what I think, note I can't exude the same certainty as Alex, you have to wait for his comment to get the whole picture. See this cop paste of my terminal: : (de Func () (setq L 5)) - Func : (Func) - 5 : (println L) 5 - 5 Note how the L variable is set within the function and still holds

Re: Parallel command execution

2012-06-03 Thread Alexander Burger
HI Jorge, OK, if I understood 'task' correctly this runs entirely on the 'main' process (the one that will be accessing the database and queueing the commands). Yes. Looks like if the main process is busy in a very CPU-intensive task (no IO at all) it could be missing some chances to

Re: efficiently building a large list

2012-06-03 Thread Alexander Burger
Hi Joe, the core of the question is here what you actually stored in the index. Perhaps it helps if I try to explain the 'idx' structure. Each node in an 'idx' tree consists either of one (if it is a leaf node) or two (if it is an internal node) cells. The first cell holds the payload data in

Re: efficiently building a large list

2012-06-03 Thread Joe Bogner
Thank you. Very helpful. I was confused where the value was actually being stored. I was thinking that in my example it was being stored in the cell in the index. Then, I couldn't figure out how it retained it's value after I cleared out the index. Turns out that it actually stored it back on