Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10.1 6/24/83; site ssc-bee.UUCP Path: utzoo!linus!vaxine!wjh12!genrad!decvax!ucbvax!ucbcad!tektronix!uw-beaver!ssc-vax!ssc-bee!david From: david@ssc-bee.UUCP Newsgroups: net.lang Subject: Ada and heap management Message-ID: <178@ssc-bee.UUCP> Date: Mon, 18-Jun-84 13:55:25 EDT Article-I.D.: ssc-bee.178 Posted: Mon Jun 18 13:55:25 1984 Date-Received: Wed, 20-Jun-84 01:10:49 EDT Organization: Boeing Aerospace, Seattle Lines: 14 Doug Alan: > To do a > good job with data abstraction, you really need heap-based allocation > with automatic garbage collection. Ada doesn't support this. Ada's access types are usually implemented via heap-based allocation using automatic garbage collection. Some control over the heap is obtained through unchecked_deallocation. Admittedly, Ada does not have C's power in pointer types, but Ada's access types bears some resemblance to Pascal's heap management features such as "new". -- David Norris :-) -- uw-beaver!ssc-vax!david