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,b7e97aed46594dd9,start
X-Google-Attributes: gid103376,public
From: Matthew Heaney <matthew_heaney@acm.org>
Subject: ANNOUNCE: homogeneous, ref-counted list posted to patterns archive
Date: 1999/02/26
Message-ID: <m3k8x52h9v.fsf@mheaney.ni.net>#1/1
X-Deja-AN: 448787408
Sender: matt@mheaney.ni.net
NNTP-Posting-Date: Fri, 26 Feb 1999 09:39:29 PDT
Newsgroups: comp.lang.ada
Date: 1999-02-26T00:00:00+00:00
List-Id: <comp.lang.ada>

I have submitted an example of how to implement a reference-counted list
to the Feb 98 ACM patterns list archive.  A description appears below.

<http://www.acm.org/archives/patterns.html>

You can subscribe to the patterns list by sending the message 

subscribe patterns <your full name>

to the mail-list server at the ACM.

<mailto:listserv@acm.org>


Homogeneous, Reference-Counted Lists

Introduction

Here's an example of the canonical form of linked list, in which all the
items have the same type, and each node is automatically returned to
storage via a reference-counting scheme.

If you could get through the brain teaser that was my last post
(heterogeneous lists), then this one will be a breeze.

I also briefly explore list iteration issues, including a discussion of
how to visit list items in reverse order.