Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!sdd.hp.com!uakari.primate.wisc.edu!uflorida!haven!adm!news
From: CDCKAB%EMUVM1.BITNET@cunyvm.cuny.edu ( Karl Brendel)
Newsgroups: comp.lang.pascal
Subject: (R)Re: Quick Directories/Better Sorts
Message-ID: <25082@adm.brl.mil>
Date: 21 Nov 90 14:59:40 GMT
Sender: news@adm.brl.mil
Lines: 42


In article <19739@oolong.la.locus.com>, Jon Rosen <jfr@locus.com> writes

[stuff deleted]
>Here is the changes to the code you wrote to allocate your array on
>the Heap:
>
>>Type   Index = Record Of
>>              Name   :  String[12];
>>              Recnum :  Longint;
>>       End;
>>
>>Var    IndexList := ^Array[1.5000] Of Index;   { Add ^ to make IndexList }
>>                                               { a pointer to the array  }
[stuff deleted]

Unfortunately, if

        Array[1..5000]of index

gives "structure too large" (leading to the original message in this
thread), then

        ^Array[1..5000]of index

will also give "structure too large". 5000*SizeOf(Index) = 85000 bytes.

You subsequently proposed a solution which _will_ work: the array of
pointers (or pointer to an array of pointers).

(I'm not trying to be a "know-it-all", I just wanted to clear this up
for the sake of those readers who know less about pointer usage than you
do.)

+-------------------------------------------------------------------------+
| Karl Brendel                                Centers for Disease Control |
| Internet: CDCKAB@EMUVM1.BITNET              Epidemiology Program Office |
| Bitnet: CDCKAB@EMUVM1                       Atlanta, GA, USA            |
| ILink/RIME: KARL BRENDEL                    phone 404/639-2709          |
| CIS  : 73307,3101                           fts       236-2709          |
| GEnie: K.BRENDEL                            Home of Epi Info 5.0        |
+-------------------------------------------------------------------------+