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,13d6cd0af0d0d769 X-Google-Attributes: gid103376,public From: stt@spock.camb.inmet.com (Tucker Taft) Subject: Re: Does memory leak? Date: 1995/04/05 Message-ID: #1/1 X-Deja-AN: 100939349 sender: news@inmet.camb.inmet.com (USENET news) x-nntp-posting-host: spock.camb.inmet.com references: <3ls2ku$qls@hacgate2.hac.com> organization: Intermetrics, Inc. newsgroups: comp.lang.ada Date: 1995-04-05T00:00:00+00:00 List-Id: John Baker (jbaker@thor.tu.hac.com) wrote: : The Lisp i programmed in (symbolics) had a really nice feature -- : allocation to *named* areas of memory. You could allocate : objects with differing life spans in different areas and then : (at the appropriate time), wipe a whole named area and start over : without having to destroy the objects individually. Very fast : and easy to control. I'd like to see a feature like that in C++ : and ADA. This is essentially equivalent to "mark/release." This is supported in Ada 95 via user-defined storage pools. There is an example in the Ada 95 Rationale on this (see section on "Storage Pool Management"). Similar things are possible in C++ by overloading the "new" operation. : JB -Tucker Taft stt@inmet.com Intermetrics, Inc.