Automatic generation produced by ISE Eiffel
expanded class INTEGER Ancestors INTEGER_REF Clients ACTION_SEQUENCE [EVENT_DATA -> TUPLE create make end] ARGUMENTS ARRAY [G] ARRAY2 [G] ARRAYED_CIRCULAR [G] ARRAYED_LIST [G] ARRAYED_QUEUE [G] ARRAYED_STACK [G] ARRAYED_TREE [G] BAG [G] BASIC_ROUTINES BINARY_SEARCH_TREE [G -> COMPARABLE] BINARY_TREE [G] BIT_REF BOOL_STRING BOUNDED [G] BOUNDED_QUEUE [G] BOUNDED_STACK [G] CHAIN [G] CHARACTER_REF CIRCULAR [G] COMPACT_CURSOR_TREE [G] COMPARABLE CONSOLE COUNTABLE [G] COUNTABLE_SEQUENCE [G] CURSOR_TREE [G] DIRECTORY DLL_32_ROUTINE DOUBLE_REF DYNAMIC_CHAIN [G] DYNAMIC_CIRCULAR [G] DYNAMIC_TREE [G] EXECUTION_ENVIRONMENT FIBONACCI FILE FILE_NAME FINITE [G] FIXED_LIST [G] FIXED_TREE [G] FORMAT_DOUBLE FORMAT_INTEGER HASH_TABLE [G, H -> HASHABLE] HASHABLE HEAP_PRIORITY_QUEUE [G -> COMPARABLE] HIERARCHICAL [G] IDENTIFIED_CONTROLLER INDEXABLE [G, H -> INTEGER] INTEGER_16_REF INTEGER_64_REF INTEGER_8_REF INTEGER_INTERVAL INTEGER_REF INTERACTIVE_LIST [G] INTERNAL LINEAR [G] LINEAR_ITERATOR [G] LINEAR_SUBSET [G] LINKED_CIRCULAR [G] LINKED_LIST [G] LINKED_STACK [G] LINKED_TREE [G] LIST [G] MEM_INFO MEMORY MULTI_ARRAY_LIST [G] PART_SORTED_SET [G -> PART_COMPARABLE] PART_SORTED_TWO_WAY_LIST [G -> PART_COMPARABLE] PATH_NAME POINTER_REF PRIMES PROFILING_SETTING RANDOM REAL_REF RECURSIVE_CURSOR_TREE [G] RESIZABLE [G] ROUTINE [BASE_TYPE, OPEN_ARGS -> TUPLE] SEQ_STRING SEQUENCE [G] SET [G] SHARED_LIBRARY_ROUTINE SORTED_LIST [G -> COMPARABLE] SORTED_TWO_WAY_LIST [G -> COMPARABLE] SPECIAL [T] STRING SUBSET [G] SUBSET_STRATEGY_HASHABLE [G] TO_SPECIAL [T] TRAVERSABLE_SUBSET [G] TREE [G] TUPLE TWO_WAY_LIST [G] TWO_WAY_SORTED_SET [G -> COMPARABLE] TWO_WAY_TREE [G] WIDE_CHARACTER_REF -- Generated by ISE Eiffel --
For more details: www.eiffel.com