The Unbounded Priority Balking Deque

  • Charles Lins
Part of the Springer Compass International book series (COMPASS)


This final chapter of Volume 2 concludes with the unbounded priority balking deque. The reader may wish to review Chapter 9 on the subject of deques and Chapter 2, Section 2.4.2 in the Module Guide for background information to this module.


Code Size Loop Index Match Item Tail Point Item Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms, Addison- Wesley, Reading, MA 1983, pp. 56–60.MATHGoogle Scholar
  2. [2]
    G. Booch, Software Components in Ada Structures, Tools, and Subsystems, Benjamin/Cummings, Menlo Park, CA 1987, pp. 92–93, 142–153.Google Scholar
  3. [3]
    K. John Gough, Writing Generic Utilities in Modula-2, Journal of Pascal, Ada, and Modula-2, Vol. 5(3), (May/June 1986 ), pp 53–62.Google Scholar
  4. [4]
    T.A. Standish, Data Structure Techniques, Chapter 2: Stacks and Queues, Addison-Wesley, Reading, MA 1980, pp. 20–23, 28–32.Google Scholar
  5. [5]
    R.S. Wiener and G.A. Ford, Modula-2 A Software Development Approach, John Wiley & Sons, New York, NY 1985, pp. 247–253.Google Scholar
  6. [6]
    R.S. Wiener and R.F. Sincovec, Data Structures Using Modula-2, John Wiley & Sons, New York, NY 1986, pp. 69–71.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1989

Authors and Affiliations

  • Charles Lins
    • 1
  1. 1.Apple Computer, Inc.CupertinoUSA

Personalised recommendations