Automatic generation produced by ISE Eiffel
Classes ACTION_SEQUENCE [EVENT_DATA -> TUPLE create make end] -- A sequence of actions to be performed on call ACTIVE [G] -- `Active' data structures, which at every stage have -- a possibly undefined ``current item''. -- Basic access and modification operations apply to the current item. ACTIVE_INTEGER_INTERVAL -- Contiguous integer interval that calls an action sequence -- when it changes. ACTIVE_LIST [G] -- Sequential, one-way linked lists that call an action -- sequence when an item is removed or added. ANY -- Project-wide universal properties. -- This class is an ancestor to all developer-written classes. -- ANY may be customized for individual projects or teams. ARGUMENTS -- Access to command-line arguments. This class -- may be used as ancestor by classes needing its facilities. ARRAY [G] -- Sequences of values, all of the same type or of a conforming one, -- accessible through integer indices in a contiguous interval. ARRAY2 [G] -- Two-dimensional arrays ARRAYED_CIRCULAR [G] -- Circular chains implemented by resizable arrays ARRAYED_LIST [G] -- Lists implemented by resizable arrays ARRAYED_LIST_CURSOR -- Cursors for arrayed lists ARRAYED_QUEUE [G] -- Unbounded queues, implemented by resizable arrays ARRAYED_SET [G] -- Sets represented as arrayed lists ARRAYED_STACK [G] -- Stacks implemented by resizable arrays ARRAYED_TREE [G] -- Trees where the children of each node are kept in an array ASCII -- The ASCII character set. -- This class may be used as ancestor by classes needing its facilities. BAG [G] -- Collections of items, where each item may occur zero -- or more times, and the number of occurrences is meaningful. BASIC_ROUTINES -- Some useful facilities on objects of basic types BI_LINKABLE [G] -- Linkable cells with a reference to the left and right neighbors BILINEAR [G] -- Structures that may be traversed forward and backward BINARY_SEARCH_TREE [G -> COMPARABLE] -- Binary search trees; left child item is less than current item, -- right child item is greater BINARY_SEARCH_TREE_SET [G -> COMPARABLE] -- Sorted sets implemented as binary search trees BINARY_TREE [G] -- Binary tree: each node may have a left child and a right child BIT_REF -- Bit sequences of length count, with binary operations BOOL_STRING -- Packed boolean strings BOOLEAN -- Truth values, with the boolean operations BOOLEAN_REF -- References to objects containing a boolean value BOUNDED [G] -- Bounded data structures, with a notion of capacity. BOUNDED_QUEUE [G] -- Queues with a bounded physical size, implemented by arrays BOUNDED_STACK [G] -- Stacks with a bounded physical size, implemented by arrays BOX [G] -- Data structures of the most general kind, -- having the potential ability to become full, -- and characterized by their implementation properties. CELL [G] -- Cells containing an item CHAIN [G] -- Possibly circular sequences of items, -- without commitment to a particular representation CHARACTER -- Characters, with comparison operations and an ASCII code CHARACTER_REF -- References to objects containing a character value CIRCULAR [G] -- Circular chains, without commitment to a particular representation CIRCULAR_CURSOR -- Cursors for circular lists COLLECTION [G] -- General container data structures, -- characterized by the membership properties of their items. COMPACT_CURSOR_TREE [G] -- Compact trees as active structures that may be traversed using a cursor COMPACT_TREE_CURSOR -- Cursors for compact trees COMPARABLE -- Objects that may be compared according to a total order relation COMPARABLE_SET [G -> COMPARABLE] -- Sets whose items may be compared according to a total order relation COMPARABLE_STRUCT [G -> COMPARABLE] -- Data structures whose items may be compared -- according to a total order relation CONSOLE -- Commonly used console input and output mechanisms. -- This class may be used as ancestor by classes needing its facilities. CONTAINER [G] -- Data structures of the most general kind, -- used to hold zero or more items. COUNTABLE [G] -- Infinite containers whose items are in one-to-one -- correspondence with the integers. COUNTABLE_SEQUENCE [G] -- Infinite sequences, indexed by integers CURSOR -- Cursors for remembering positions in arbitrary data structures CURSOR_STRUCTURE [G] -- Active structures, which always have a current position -- accessible through a cursor. CURSOR_TREE [G] -- Trees as active structures that may be traversed using a cursor CURSOR_TREE_ITERATOR [G] -- Objects that are able to iterate over cursor trees, -- on which they can perform repeated actions and tests according -- to a number of predefined control structures such as `if', -- `until' and others. DECLARATOR -- Class used to ensure proper precompilation of EiffelBase. -- Not to be used otherwise." DIRECTORY -- Directories, in the Unix sense, with creation and exploration features DIRECTORY_NAME -- Directory name abstraction DISPENSER [G] -- Dispensers: containers for which clients have no say -- as to what item they can access at a given time. -- Examples include stacks and queues. DLL_32 -- DLL for Win32 DLL_32_ROUTINE -- 32 bit DLL routine for Windows DOUBLE -- Real values, double precision DOUBLE_MATH -- Basic mathematical operations, double-precision. -- This class may be used as ancestor by classes needing its facilities. DOUBLE_REF -- References to objects containing a double-precision real number DYNAMIC_CHAIN [G] -- Dynamically modifiable chains DYNAMIC_CIRCULAR [G] -- Dynamically modifiable circular chains DYNAMIC_LIST [G] -- Sequential, dynamically modifiable lists, -- without commitment to a particular representation DYNAMIC_TREE [G] -- Trees with a dynamically modifiable structure EXCEP_CONST -- Constants used for exception handling. -- This class may be used as ancestor by classes needing its facilities. EXCEPTIONS -- Facilities for adapting the exception handling mechanism. -- This class may be used as ancestor by classes needing its facilities. EXECUTION_ENVIRONMENT -- The objects available from the environment at time of execution FIBONACCI -- The Fibonacci number sequence FILE -- Sequential files, viewed as persistent sequences of characters FILE_NAME -- File name abstraction FINITE [G] -- Structures with a finite item count FIXED [G] -- Finite structures whose item count cannot be changed FIXED_LIST [G] -- Lists with fixed maximum numbers of items, implemented by arrays FIXED_TREE [G] -- Trees where each node has a fixed number of children -- (The number of children is arbitrary but cannot be -- changed once the node has been created FORMAT_DOUBLE -- Formatter for non-integral numbers FORMAT_INTEGER -- Formatter for integral numbers FUNCTION [BASE_TYPE, OPEN_ARGS -> TUPLE, RESULT_TYPE] -- Objects representing delayed calls to a function, -- with some arguments possibly still open. GC_INFO -- Garbage collector statistics. -- This class may be used as ancestor by classes needing its facilities. -- Time accounting is relevant only if enable_time_accounting -- (from MEMORY) has been called. HASH_TABLE [G, H -> HASHABLE] -- Hash tables, used to store items identified by hashable keys HASH_TABLE_CURSOR -- Cursors for hash table traversal HASHABLE -- Values that may be hashed into an integer index, -- for use as keys in hash tables HEAP_PRIORITY_QUEUE [G -> COMPARABLE] -- Priority queues implemented as heaps HEIR HIERARCHICAL [G] -- Hierarchical structures in which each item has zero or -- one immediate predecessor, and zero or more successors. IDENTIFIED -- Objects identified, uniquely during any session, by an integer IDENTIFIED_CONTROLLER -- Externals for managing the object id stack (see identified.e) INDEXABLE [G, H -> INTEGER] -- Tables whose keys are integers in a contiguous interval INFINITE [G] -- Infinite containers. INTEGER -- Integer values INTEGER_16 -- Integer values coded on 16 bits INTEGER_16_REF -- References to objects containing an integer value coded on 16 bits INTEGER_64 -- Integer values coded on 64 bits INTEGER_64_REF -- References to objects containing an integer value coded on 64 bits INTEGER_8 -- Integer values coded on 8 bits INTEGER_8_REF -- References to objects containing an integer value coded on 8 bits INTEGER_INTERVAL -- Contiguous integer intervals INTEGER_REF -- References to objects containing an integer value INTERACTIVE_LIST [G] -- Sequential, one-way linked lists that call add/remove features -- when an item is removed or added. INTERNAL -- Access to internal object properties. -- This class may be used as ancestor by classes needing its -- facilities. IO_MEDIUM -- Any medium that can perform input and/or output ITERATOR [G] -- Objects that are able to iterate over traversable structures, -- on which they can perform repeated actions and tests according -- to a number of predefined control structures such as `if', -- `until' and others. LINEAR [G] -- Structures whose items may be accessed sequentially, one-way LINEAR_ITERATOR [G] -- Objects that are able to iterate over linear structures LINEAR_SUBSET [G] -- Subsets that are traversable linearly without commitment to a concrete -- implementation. LINKABLE [G] -- Linkable cells containing a reference to their right neighbor LINKED_CIRCULAR [G] -- Circular chains implemented as linked lists LINKED_CURSOR_TREE [G] -- Cursor trees in linked representation LINKED_LIST [G] -- Sequential, one-way linked lists LINKED_LIST_CURSOR [G] -- Cursors for linked lists LINKED_PRIORITY_QUEUE [G -> COMPARABLE] -- Priority queues implemented as sorted lists LINKED_QUEUE [G] -- Unbounded queues implemented as linked lists LINKED_SET [G] -- Sets implemented by linked lists LINKED_STACK [G] -- Unbounded stacks implemented as linked lists LINKED_TREE [G] -- Trees implemented using a linked list representation LINKED_TREE_CURSOR [G] -- Cursors for linked trees LIST [G] -- Sequential lists, without commitment to a particular representation MATH_CONST -- Basic mathematical constants. -- This class may be used as ancestor by classes needing its facilities. MEM_CONST -- Constants used by memory management. -- This class may be used as ancestor by classes needing its facilities. MEM_INFO -- Properties of the memory management mechanism. -- This class may be used as ancestor by classes needing its facilities. MEMORY -- Facilities for tuning up the garbage collection mechanism. -- This class may be used as ancestor by classes needing its facilities. MULTAR_LIST_CURSOR [G] -- Cursors for multi-array trees MULTI_ARRAY_LIST [G] -- Lists implemented as sequences of arrays, the last of which may -- be non-full. No limit on size (a new array is allocated if list -- outgrows its initial allocation). NUMERIC -- Objects to which numerical operations are applicable OPERATING_ENVIRONMENT -- The objects available from the operating system PARENT PART_COMPARABLE -- Objects that may be compared according to a partial order relation PART_SORTED_LIST [G -> PART_COMPARABLE] -- Sequential lists whose items are sorted in ascending order -- according to the relational operators of PART_COMPARABLE PART_SORTED_SET [G -> PART_COMPARABLE] -- Sets whose items may be compared according to a partial order relation -- implemented as sorted two-way lists. PART_SORTED_TWO_WAY_LIST [G -> PART_COMPARABLE] -- Two-way lists, kept sorted PATH_NAME -- Path name abstraction PLAIN_TEXT_FILE -- Files viewed as persistent sequences of ASCII characters PLATFORM -- Platform-dependent properties. -- This class is an ancestor to all developer-written classes. POINTER -- References to objects meant to be exchanged with non-Eiffel software. POINTER_REF -- References to objects containing reference to object -- meant to be exchanged with non-Eiffel software. PRIMES -- Prime number properties PRIORITY_QUEUE [G -> PART_COMPARABLE] -- Priority queues, without commitment to a particular representation PROCEDURE [BASE_TYPE, OPEN_ARGS -> TUPLE] -- Objects representing delayed calls to a procedure. -- with some operands possibly still open. PROFILING_SETTING -- Objects that manage the Eiffel profiler. You can start and -- stop the Eiffel profiler whenever you want to. It only works -- if `profile (yes)' is enabled in your Ace file. QUEUE [G] -- Queues (first-in, first-out dispensers), without commitment -- to a particular representation RANDOM -- Pseudo-random number sequence, linear congruential method RAW_FILE -- Files, viewed as persistent sequences of bytes REAL -- Real values, single precision REAL_REF -- References to objects containing a real value RECURSIVE_CURSOR_TREE [G] -- Cursor trees with a recursive structure RECURSIVE_TREE_CURSOR [G] -- Cursors for recursive trees RESIZABLE [G] -- Finite structures whose item count is subject to change ROUTINE [BASE_TYPE, OPEN_ARGS -> TUPLE] -- Objects representing delayed calls to a routine, -- with some operands possibly still open SEQ_STRING SEQUENCE [G] -- Finite sequences: structures where existing items are arranged -- and accessed sequentially, and new ones can be added at the end. SET [G] -- Collection, where each element must be unique. SHARED_LIBRARY -- Platform independent abstraction of a shared library SHARED_LIBRARY_CONSTANTS -- Constants used by DESC (Dynamic External Shared Call) mechanism SHARED_LIBRARY_ROUTINE -- Platform independent abstraction of a shared library routine SINGLE_MATH -- Basic mathematical operations, single-precision. -- This class may be used as ancestor by classes needing its facilities SORTED_LIST [G -> COMPARABLE] -- Sequential lists where the cells are sorted in ascending order -- according to the relational operators of PART_COMPARABLE SORTED_STRUCT [G -> COMPARABLE] -- Structures whose items are sorted according to a total order relation SORTED_TWO_WAY_LIST [G -> COMPARABLE] -- Two-way lists, kept sorted. SPECIAL [T] -- Special objects: homogeneous sequences of values, -- used to represent arrays and strings STACK [G] -- Stacks (last-in, first-out dispensers), without commitment -- to a particular representation STD_FILES -- Commonly used input and output mechanisms. -- This class may be used as either ancestor or supplier -- by classes needing its facilities." STORABLE -- Objects that may be stored and retrieved along with all their dependents. -- This class may be used as ancestor by classes needing its facilities. STREAM -- Implementation of the STORABLE mechanism with streams. STRING -- Sequences of characters, accessible through integer indices -- in a contiguous range. STRING_HANDLER -- Objects that can access set_count from STRING SUBSET [G] -- Subsets with the associated operations, -- without commitment to a particular representation SUBSET_STRATEGY [G] -- Strategies for computing several features of subsets. The computing -- strategy is optimized depending on the type of elements contained in -- the set. SUBSET_STRATEGY_GENERIC [G] -- Strategies for calculating several features for subsets containing -- items of any type. SUBSET_STRATEGY_HASHABLE [G] -- Strategies for calculating several features for subsets containing -- HASHABLEs. SUBSET_STRATEGY_TREE [G -> COMPARABLE] -- Strategies for calculating several features for subsets represented -- by binary search trees. Contained items have to be COMPARABLE TABLE [G, H] -- Containers whose items are accessible through keys TESTROOT TO_SPECIAL [T] -- References to special objects, for direct access to arrays and strings TRAVERSABLE [G] -- Structures for which there exists a traversal policy -- that will visit every element exactly once. TRAVERSABLE_SUBSET [G] -- Subsets that are traversable sequentially TREE [G] -- Trees, without commitment to a particular representation TUPLE -- Implementation of TUPLE TWO_WAY_CHAIN_ITERATOR [G] -- Objects that are able to iterate over two-way chains, -- on which they can perform repeated actions and tests according -- to a number of predefined control structures such as `if', -- `until' and others. TWO_WAY_CIRCULAR [G] -- Circular chains implemented as two-way linked lists TWO_WAY_CURSOR_TREE [G] -- Cursor trees implemented in two-way linked representation TWO_WAY_LIST [G] -- Sequential, two-way linked lists TWO_WAY_SORTED_SET [G -> COMPARABLE] -- Sets whose items may be compared according to a total order relation; -- implemented as sorted two-way lists. TWO_WAY_TREE [G] -- Trees implemented using a two way linked list representation TWO_WAY_TREE_CURSOR [G] -- Cursors for two-way cursor trees UNBOUNDED [G] -- Finite structures whose item count is not bounded UNIX_FILE_INFO -- Internal file information UNIX_SIGNALS -- Constants used for signal handling. -- This class may be used as ancestor by classes needing its facilities. WIDE_CHARACTER -- Unicode characters, with comparison operations WIDE_CHARACTER_REF -- References to objects containing a character value -- Generated by ISE Eiffel --
For more details: www.eiffel.com