From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,c7ec20d43aed6e2c X-Google-Attributes: gid103376,public From: "Matthew Heaney" Subject: Re: Newbie in distress :-) Date: 1999/10/23 Message-ID: <38128122_1@news1.prserv.net>#1/1 X-Deja-AN: 539839041 Content-transfer-encoding: 7bit References: <7urnh6$4ov$1@news2.inter.net.il> <7usf0h$du2$1@ash.prod.itd.earthlink.net> Content-Type: text/plain; charset="US-ASCII" X-Complaints-To: abuse@prserv.net X-Trace: 24 Oct 1999 03:46:42 GMT, 32.101.8.120 Organization: Global Network Services - Remote Access Mail & News Services Mime-version: 1.0 Newsgroups: comp.lang.ada Date: 1999-10-23T00:00:00+00:00 List-Id: In article , Ehud Lamm wrote: > However, if Guy wants to really explore interesting ways of controlling > memory allocation/deallocation I would suggest exploring Controlled types > and Storage Pools... There is an example of a linked list, implemented using reference counts and type Controlled, in the patterns archive: Use the search engine to find "list" in the subject line. The article was titled "homogeneous lists", or something like that. Matt