From: John E. Potter (jpotter_at_[hidden])
Date: 2000-01-13 15:46:33
> >> encapsulation of an ordering policy.
> I think we're trying to
> capture fifo queue, lifo queue, priority_queue, etc.
And the random queue. Pop removes and selects a random item to
become top. Should plug into the graph algorithms well to give
the some-path, some-spanning-tree, etc. algorithms.
The thing has an active policy for next out. It is queue-like.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk