Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Text Flat Contracts Flat contracts Go to:
class LINKED_QUEUE [G] General cluster: base.structures.dispenser description: "Unbounded queues implemented as linked lists" create: make Ancestors LINKED_LIST [G] QUEUE [G] Queries changeable_comparison_criterion: BOOLEAN count: INTEGER duplicate (n: INTEGER): [like Current] LINKED_QUEUE [G] Extendible: BOOLEAN Full: BOOLEAN has (v: [like item] G): BOOLEAN is_empty: BOOLEAN is_equal (other: [like Current] LINKED_QUEUE [G]): BOOLEAN is_inserted (v: G): BOOLEAN item: G linear_representation: ARRAYED_LIST [G] object_comparison: BOOLEAN occurrences (v: [like item] G): INTEGER prunable: BOOLEAN readable: BOOLEAN writable: BOOLEAN Commands append (s: SEQUENCE [G]) compare_objects compare_references copy (other: [like Current] LINKED_QUEUE [G]) extend (v: G) fill (other: CONTAINER [G]) force (v: G) make put (v: G) remove replace (v: [like item] G) wipe_out Constraints is always after
Classes Clusters Cluster hierarchy Chart Relations Text Flat Contracts Flat contracts Go to:

-- Generated by ISE Eiffel --
For more details: www.eiffel.com