* conventional bounded queues, which either block or reject new elements when full.
 *
 * <p>This implementation is based on the <a
 * href="http://portal.acm.org/citation.cfm?id=6621">min-max heap</a> developed by Atkinson, et al.
 * Unlike many other double-ended priority queues, it stores elements in a single array, as compact
 * as the traditional heap data structure used in {@link PriorityQueue}.
 *

    <glob pattern="*.COB"/>
    <sub-class-of type="text/plain"/>
  </mime-type>

  <mime-type type="text/x-coldfusion" interpreted="true">
    <_comment>ColdFusion source code</_comment>
    <glob pattern="*.cfm"/>
    <glob pattern="*.cfml"/>
    <glob pattern="*.cfc"/>
    <sub-class-of type="text/plain"/>
  </mime-type>

  <mime-type type="text/x-common-lisp">
    <_comment>Common Lisp source code</_comment>