Path: utzoo!news-server.csri.toronto.edu!rpi!usc!cs.utexas.edu!rice!uw-beaver!ubc-cs!alberta!herald.usask.ca!weyr!f72.n140.z1.FIDONET.ORG!Bruce.Mcara
From: Bruce.Mcara@f72.n140.z1.FIDONET.ORG (Bruce Mcara)
Newsgroups: comp.lang.pascal
Subject: More data than I can fit in an array
Message-ID: <119.27E45888@weyr.FIDONET.ORG>
Date: 17 Mar 91 17:31:00 GMT
Sender: ufgate@weyr.FIDONET.ORG (newsout1.26)
Organization: FidoNet node 1:140/72 - DataForce, Regina Sask
Lines: 12

Look up the GetMem procedure in your Reference Manual.  What this procedure
does is allocate memory on the heap for whatever size variable or structure
you need and returns a pointer to this memory.  GetMem can allocate up to
64K per pointer so now what you need is a way of keeping track of pointers.
This is where linked lists come in.  For a good, easy-to-read discussion of
linked lists get a copy of Turbo Tutor.  
 
--  
Bruce Mcara - via FidoNet node 1:140/22
UUCP: ...!herald!weyr!72!Bruce.Mcara
Domain: Bruce.Mcara@f72.n140.z1.FIDONET.ORG
Standard Disclaimers Apply...