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,119ab7dd2c524aca,start
X-Google-Attributes: gid103376,public
X-Google-Thread: 115aec,119ab7dd2c524aca,start
X-Google-Attributes: gid115aec,public
From: Matthew Heaney <matthew_heaney@acm.org>
Subject: ANNOUNCE: bounded buffer posted to ACM patterns archive
Date: 1999/04/04
Message-ID: <m3yak8ja7p.fsf@mheaney.ni.net>#1/1
X-Deja-AN: 462693023
NNTP-Posting-Date: Sun, 04 Apr 1999 16:20:05 PDT
Newsgroups: comp.lang.ada,comp.realtime
Date: 1999-04-04T00:00:00+00:00
List-Id: <comp.lang.ada>

I have posted the article "Bounded Buffer - Alternate Implementation" to
the April 1999 ACM patterns archive.

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


The example implements a classic bounded buffer using a protected
object.  The novelty here is that it allows the producer to indicate
that no more items are coming, which unblocks the waiting consumer.

I have translated every C++ example in the GoF Design Patterns book to
Ada95, and have now started documenting concurrency idioms.

You can subscribe to the ACM patterns list by sending the message (body)

subscribe patterns <your full name>

to the ACM mailing list server.

<mailto:listserv@acm.org>


Matt