Title:        queue
Version:      1
Submitted:    Dec 21 1993
Author:       bostic@cs.berkeley.edu (Keith Bostic)
Submittor:    bostic@cs.berkeley.edu (Keith Bostic)
Description:  implementations of lists, tail queues, and circular queues

[ from the manpage...

  DESCRIPTION
     These macros define and operate on three types of data structures: lists,
     tail queues, and circular queues.  All three structures support the fol-
     lowing functionality:
           1.   Insertion of a new entry at the head of the list.
           2.   Insertion of a new entry after any element in the list.
           3.   Removal of any entry in the list.
           4.   Forward traversal through the list.

  --vix ]