[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: LISP Questions - random, random elements and memory management

From: Barry Margolin
Subject: Re: LISP Questions - random, random elements and memory management
Date: Thu, 19 Nov 2009 08:44:24 -0500
User-agent: MT-NewsWatcher/3.5.3b3 (Intel Mac OS X)

In article <address@hidden>,
 Jeff Clough <address@hidden> wrote:

> From: Kevin Rodgers <address@hidden>
> Date: Wed, 18 Nov 2009 20:03:51 -0700
> > The data *is* in memory.  The function is zippy because nth is fast,
> > in
> > turn because cdr is fast (and implemented in C).  And perhaps the cons
> > cells for the list are allocated in adjacent memory, if it is
> > constructed all at once.
> > 
> > Of course you can put the data (defconst forms) and function (defun)
> > in
> > the same .el file!
> Um, actually I was looking for a way that would allow me to keep the
> data *out* of memory until it was needed, then toss it on the floor
> when I was done, that way I'm only eating the RAM *some* of the time
> instead of all the time.  With my existing scheme, the data is in
> memory as soon as the .el file is loaded.

How about putting it in a text file that you load into a temporary 
buffer when you need it?  Then kill the buffer when you're done with it.

Barry Margolin, address@hidden
Arlington, MA
*** PLEASE post questions in newsgroups, not directly to me ***
*** PLEASE don't copy me on replies, I'll read them in the group ***

reply via email to

[Prev in Thread] Current Thread [Next in Thread]