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.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,c801c83579cfd38b X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 1995-02-08 05:29:33 PST Path: nntp.gmd.de!newsserver.jvnc.net!yale.edu!yale!gumby!newsxfer.itd.umich.edu!news.cic.net!infoserv.illinois.net!news.mci.net!lamarck.sura.net!howland.reston.ans.net!gatech!swrinde!news.uh.edu!uuneo.neosoft.com!stout.entertain.com!nobody From: cjames@stout.entertain.com (Colin James III) Newsgroups: comp.lang.ada Subject: Re: OCCAM programming probs Date: 8 Feb 1995 13:29:33 -0000 Organization: /etc/organization Message-ID: <3hagvt$qf@stout.entertain.com> References: <792175283snz@joino.demon.co.uk> NNTP-Posting-Host: stout.entertain.com Date: 1995-02-08T13:29:33+00:00 List-Id: In article <792175283snz@joino.demon.co.uk>, huey wrote: >Can any one help with a small program that operates numerous functions >CONCURRENTLY using the SPOOL technique ? > ... >[a] buffer acts as a queue. > >The only functions reqd are to Append, Remove or reorder the queue. > >email to Dan@joino.demon.co.uk >-- >huey Please see: _Reusable_software_The_Base_object-oriented_component_libraries by Bertrand Meyer, 1994, Prentice Hall UK. Of particular interest to your question is pages 340/7 in the dispenser class section which includes CLASS _QUEUE_, _ARRAYED_QUEUE_, _LINKED_QUEUE_, and _BOUNDED_QUEUE_. This is a much clearer implementation of the algorithm (in Eiffel) than anything else I've seen, including Ada textbooks and Booch's components in Ada83 (or in C), which usually suffer from bounded/unbounded / constrained/unconstrained generic considerations which are not issues in Eiffel 3 *ever*. cjames@stout.entertain.com (I'm a six time winner: Continuing Episcopalian, Old Line Republican, Eiffel and BON aficionado, PC clone user, and not a professor.)