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.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,a6c65cbc407987fe X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-11-19 03:18:04 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!news-FFM2.ecrc.net!news.iks-jena.de!not-for-mail From: Lutz Donnerhacke Newsgroups: comp.lang.ada Subject: Re: dynamic multithreading Date: Tue, 19 Nov 2002 11:18:04 +0000 (UTC) Organization: IKS GmbH Jena Message-ID: References: <3DD3D841.CD16A4CB@canal-plus.fr> <8MCB9.8643$8o1.1371873@news.xtra.co.nz> <3DD8AEAC.241AD1F8@canal-plus.fr> NNTP-Posting-Host: taranis.iks-jena.de X-Trace: branwen.iks-jena.de 1037704684 27194 217.17.192.37 (19 Nov 2002 11:18:04 GMT) X-Complaints-To: usenet@iks-jena.de NNTP-Posting-Date: Tue, 19 Nov 2002 11:18:04 +0000 (UTC) User-Agent: slrn/0.9.7.4 (Linux) Xref: archiver1.google.com comp.lang.ada:31102 Date: 2002-11-19T11:18:04+00:00 List-Id: * Preben Randhol wrote: > Lutz Donnerhacke wrote: >> Of course, you can implement such thing, but IMHO Ada takes the way to >> storage pools. > > Also for a linked list? A linked list is something more persitent than locally scoped access types. Therefore you have to manage the storage over the long term. And you will do this by a combination of the following methods: a Storage Pool for access-to-item. b Locally scoped generic instantiation. c Private data types with specialized interface to the package. a and b does guarantee that the memory leak is bounded and will disappear when the list type is not longer needed. c ensures definite access to the allocated memory and therefore it provides a infrastructure for correct implementation of memory management. You might free the data or manage your own pool of allocated objects.