Date: 2000-01-12 19:02:38
The purpose of the concept is to explicitly state the commonality
between things like stacks and queues. For instance, in generic graph
algorithms many times you want to have a container to put nodes into,
but don't care at that level what the ordering is (LIFO, FIFO, by
John E. Potter writes:
> Hum: push, pop, top, empty ? classic stack
> Oh: put, take, look, empty ? any collection/container
> What is the concept? Then a name?
> Just me?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk