Re: OCCAM programming probs

[cjames@stout.entertain.com (Colin James III)]

In article <792175283snz@joino.demon.co.uk>,
huey <huey@joino.demon.co.uk> 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.)