48 Interface to deque–like containers

The library (vicare containers ideques) implements a common API for deque–like containers: data structures representing sequences and capable of efficient insertion at both the front and rear. A data structure is deque–like if it implements the operations: ‘empty?’, ‘front’, ‘rear’, ‘push-front!’, ‘push-rear!’, ‘pop-front!’, ‘pop-rear!’.