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=0.1 required=5.0 tests=AC_FROM_MANY_DOTS,BAYES_00, INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,effb80d4bb7716dd X-Google-Attributes: gid103376,public From: Jeff Carter Subject: Re: Wanted: Ada STL. Reward: Ada's Future Date: 1999/02/01 Message-ID: <36B5C7F3.963F841F@spam.innocon.com>#1/1 X-Deja-AN: 439387398 Content-Transfer-Encoding: 7bit References: <790f4q$3l@bgtnsc01.worldnet.att.net> <7931ej$qqf@bgtnsc02.worldnet.att.net> Content-Type: text/plain; charset=us-ascii Organization: Innovative Concepts, Inc. Mime-Version: 1.0 Newsgroups: comp.lang.ada Date: 1999-02-01T00:00:00+00:00 List-Id: Matthew Heaney and Alexy V Khrabrov have been arguing about the need for sets. Heaney never uses them and Khrabrov considers them essential. I've recently used sets for a communications protocol. The task needs to wait for one of a set of events; at other times it needs to wait for one of another set of events. The sets of events overlap. This mapped nicely to a protected object with a current event component. Each Wait_ entry has a barrier of the form when Member (Current_Event, Set_Of_Events_For_This_Kind_Of_Wait) is Another task calls a Signal entry to set Current_Event. This worked very well. These are small, simple, discrete sets, as in Pascal, implemented as arrays of Boolean, as opposed to the set-of-anything components I often see discussed. I've never needed a set of anything except discrete values, but I have needed bags of anything. -- Jeff Carter E-mail: carter commercial-at innocon [period | full stop] com "We call your door-opening request a silly thing." Monty Python & the Holy Grail