Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!ucsd!ucbvax!SOPHIST.UCHICAGO.EDU!goer
From: goer@SOPHIST.UCHICAGO.EDU (Richard Goerwitz)
Newsgroups: comp.lang.icon
Subject: tables, efficiency
Message-ID: <8909261711.AA21032@sophist.uchicago.edu>
Date: 26 Sep 89 17:11:08 GMT
Sender: daemon@ucbvax.BERKELEY.EDU
Distribution: inet
Organization: The Internet
Lines: 11

Could someone familiar with the implementation of tables explain
how efficient use can be made of storage when the ultimate size
of the table is unknown?  Or does the interpreter indeed check
to see how big the various regions are, and adjust the algorithm
to make maximum use of a given memory space?

Just dunno, but would like t'know.

                                        -Richard L. Goerwitz
                                        goer@sophist.uchicago.edu
                                        rutgers!oddjob!gide!sophist!goer