Class Name

---

  MGH_Queue

Purpose

---

  A first-in-first-out (FIFO) queue, currently implemented as a
  singly linked list.

Category

---

  Miscellaneous.
  IMPLEMENTATION:
  The implementation is very straightforard. Items are added to the
  tail of the queue via the Add method and retrieved from the head
  of the queue via the Get method. Retrieving a value removes it
  from the stack. The number of values is returned by the COUNT
  property or the Count method.
  PERFORMANCE:
  Adequate: the time taken to create a queue, add 1,000,000 real
  numbers, retrieve them all then destroy the queue is 9.4 s on my
  PC (Compaq Deskpro with Pentium II 400 MHz).
###########################################################################
  This software is provided subject to the following conditions:
  1. NIWA makes no representations or warranties regarding the
    accuracy of the software, the use to which the software may
    be put or the results to be obtained from the use of the
    software. Accordingly NIWA accepts no liability for any loss
    or damage (whether direct of indirect) incurred by any person
    through the use of or reliance on the software.
  2. NIWA is to be acknowledged as the original author of the
    software where the software is used or presented in any form.
###########################################################################

Modification History

---

  Mark Hadfield, Oct 1999:
      Written.