Artifact 67bf0fb47dd0d715bdeb62354e27c8d4aea5e129890e998fea960c9e67090753:

• Executable file r37/lisp/csl/html/r37_0130.html — part of check-in [f2fda60abd] at 2011-09-02 18:13:33 on branch master — Some historical releases purely for archival purposes

  git-svn-id: https://svn.code.sf.net/p/reduce-algebra/code/trunk/historical@1375 2bfe0521-f11c-4a00-b80e-6202646ff360 (user: arthurcnorman@users.sourceforge.net, size: 862) [annotate] [blame] [check-ins using] [more...]

<A NAME=RECLAIM>

<TITLE>RECLAIM</TITLE></A>
<b><a href=r37_idx.html>INDEX</a></b><p><p>



<B>RECLAIM</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
 <P>
<P>
REDUCE's memory is in a storage structure called a heap. As REDUCE 
statements execute, chunks of memory are used up. When these chunks are no 
longer needed, they remain idle. When the memory is almost full, 
the system executes a garbage collection, reclaiming space that is no 
longer needed, and putting all the free space at one end. Depending on 
the size of the image REDUCE is using, 
garbage collection needs to be done more or less often. A 
larger image means fewer but longer garbage collections. 
Regardless of memory size, 
if you ask REDUCE to do something ridiculous, like <em>factorial(2000)</em>, it 
may 
garbage collect many times. 
<P>
<P>
<P>