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/07 Message-ID: #1/1 X-Deja-AN: 100070404 sender: news@inmet.camb.inmet.com (USENET news) x-nntp-posting-host: spock.camb.inmet.com references: <3m0r01$174b@watnews1.watson.ibm.com> organization: Intermetrics, Inc. newsgroups: comp.lang.ada Date: 1995-04-07T00:00:00+00:00 List-Id: Norman H. Cohen (ncohen@watson.ibm.com) wrote: : In article , stt@spock.camb.inmet.com : (Tucker Taft) writes: : |> 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." : No, mark/release is for FIFO deallocation. Oops, I bet you meant "LIFO". And I meant "mark/release with multiple heaps" which *is* essentially equivalent. In fact, M/R with multiple heaps is a bit more flexible, since you don't have to release an entire heap, but can instead release just part of a heap. : ... : Norman H. Cohen ncohen@watson.ibm.com -Tucker Taft stt@inmet.com