Automatic generation produced by ISE Eiffel
class ARRAYED_QUEUE [G] General cluster: elks description: "Unbounded queues, implemented by resizable arrays" create: make Ancestors MISMATCH_CORRECTOR QUEUE* [G] RESIZABLE* [G] Queries additional_space: INTEGER_32 capacity: INTEGER_32 changeable_comparison_criterion: BOOLEAN count: INTEGER_32 extendible: BOOLEAN full: BOOLEAN Growth_percentage: INTEGER_32 has (v: [like item] G): BOOLEAN index_set: INTEGER_INTERVAL is_empty: BOOLEAN is_equal (other: [like Current] ARRAYED_QUEUE [G]): BOOLEAN is_inserted (v: G): BOOLEAN item: G linear_representation: ARRAYED_LIST [G] Minimal_increase: INTEGER_32 Mismatch_information: MISMATCH_INFORMATION new_cursor: ARRAYED_QUEUE_ITERATION_CURSOR [G] object_comparison: BOOLEAN occurrences (v: G): INTEGER_32 off: BOOLEAN prunable: BOOLEAN readable: BOOLEAN replaceable: BOOLEAN resizable: BOOLEAN writable: BOOLEAN Commands append (s: SEQUENCE [G]) automatic_grow compare_objects compare_references copy (other: [like Current] ARRAYED_QUEUE [G]) correct_mismatch extend (v: G) fill (other: CONTAINER [G]) force (v: G) grow (n: INTEGER_32) prune (v: G) prune_all (v: G) put (v: G) remove replace (v: [like item] G) trim wipe_out -- Generated by Eiffel Studio --
For more details: eiffel.org