47 Interface to queue–like containers

The library (vicare containers iqueues) implements a common API for queue–like containers: data structure capable of first–in/first–out operations. A data structure is queue–like if it implements the operations: ‘empty?’, ‘top’, ‘push!’, ‘pop!’; the names are the same of the operations for a stack, but for a queue: ‘push!’ enqueues objects on the rear; ‘pop!’ dequeues objects from the front.