Re: Re: Re: Memory operations
- To: mathgroup at smc.vnet.net
- Subject: [mg65121] Re: [mg65072] Re: [mg64988] Re: [mg64895] Memory operations
- From: Daniel Lichtblau <danl at wolfram.com>
- Date: Wed, 15 Mar 2006 06:28:41 -0500 (EST)
- References: <200603071111.GAA08475@smc.vnet.net> <200603101015.FAA22032@smc.vnet.net> <200603141059.FAA24067@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
sir_puding at tut.by wrote: >>I vote for changing the way you work. >>From my experience, For is the slowest loop in Mathematica. >>Add it to the way that mathematica manage memory with apend, and I think you >>will find it hard to make a less efficient program. >>regards >>yehuda > > > So, i think you can suggest best how to organize FIFO (or LIFO) query in > Mathematica(TM). > > Problem is that i do not know how many results from operations I'll > get (for example multiple root finding). > > > TNX. > Sergey Use Sow/Reap. If you really need to work with stacks, queues, and the like, I showed Mathematica code for some of this in a conference talk/notebook several years ago. It should be located at: http://library.wolfram.com/infocenter/Conferences/321/ So far as I can tell, alas, it is not there. I'll see if I can find out why it faded from sight. Ahhh, here it is. http://library.wolfram.com/conferences/devconf99/lichtblau/ Daniel Lichtblau Wolfram Research
- References:
- Memory operations
- From: sir_puding@tut.by
- Re: Memory operations
- From: yehuda <bsyehuda@gmail.com>
- Re: Re: Memory operations
- From: sir_puding@tut.by
- Memory operations