Gobo Eiffel Structure Library
Copyright (c) 1999-2001, Eric Bezault and others
Eiffel Forum License v2 (see forum.txt)
$Date: 2005/06/29 15:20:30 $
$Revision: 1.10 $
-- Routines that ought to be in class ANY
-- (From KL_IMPORTED_ANY_ROUTINES)
-- Routines that ought to be in class ARRAY
-- (From KL_IMPORTED_ARRAY_ROUTINES)
-- Routines that ought to be in class ARRAY
-- (From KL_IMPORTED_ARRAY_ROUTINES)
-- Routines that ought to be in class ARRAY
-- (From KL_IMPORTED_ARRAY_ROUTINES)
-- Routines that ought to be in class ARRAY
-- (From KL_IMPORTED_ARRAY_ROUTINES)
-- Routines that ought to be in class SPECIAL
-- (From KL_IMPORTED_SPECIAL_ROUTINES)
-- Routines that ought to be in class SPECIAL
-- (From KL_IMPORTED_SPECIAL_ROUTINES)
-- Routines that ought to be in class SPECIAL
-- (From KL_IMPORTED_SPECIAL_ROUTINES)
-- Routines that ought to be in class SPECIAL
-- (From KL_IMPORTED_SPECIAL_ROUTINES)
-- Routines that ought to be in class SPECIAL
-- (From KL_IMPORTED_SPECIAL_ROUTINES)
-- Routines that ought to be in class ARRAY
-- (From KL_IMPORTED_ARRAY_ROUTINES)
-- Equality tester;
-- A void equality tester means that =
-- will be used as comparison criterion.
-- (From DS_SEARCHABLE)
-- Item equal to v held in set
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SET)
-- Clone of current set from with all items
-- not included in other have been removed
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SET)
-- Item equal to v held in set
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SET)
-- New external cursor for traversal
-- (From DS_TRAVERSABLE)
-- Clone of current set from which all items
-- also included in other have been removed
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SET)
-- Clone of current clone to which items of other
-- which are not included in current set have been
-- added and from which those which are current set
-- have been removed
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SET)
-- Clone of current set to which all items
-- of other have been added
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SET)
-- Maximum number of items in container
-- (From DS_RESIZABLE)
-- Size of array chunks
-- Number of items in container
-- (From DS_CONTAINER)
-- Initial capacity in make_default
-- (Default value: 10)
-- (From DS_RESIZABLE)
-- Default value for chunk_size
-- (Default vale: 30000)
-- Number of times v appears in set
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SEARCHABLE)
-- Is set equal to other?
-- Do not take cursor positions, and capacity into
-- account, but equality_tester should be the same.
-- (From ANY)
-- Is there no valid position to left of internal cursor?
-- (From DS_BILINEAR)
-- Can set_equality_tester be called with a_tester
-- as argument in current state of container?
-- (Answer: the set has to be empty.)
-- (From DS_SEARCHABLE)
-- Did last call to search succeed?
-- (From DS_SPARSE_CONTAINER)
-- Does set include v?
-- (Use equality_tester's comparison criterion
-- if not Void, use = criterion otherwise.)
-- (From DS_SEARCHABLE)
-- Are none of the items of current set included in other?
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SET)
-- Is container empty?
-- (From DS_CONTAINER)
-- Is internal cursor on first item?
-- (From DS_LINEAR)
-- Is container full?
-- (From DS_RESIZABLE)
-- Is internal cursor on last item?
-- (From DS_BILINEAR)
-- Are all items of current set included in other?
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SET)
-- Does current set include all items of other?
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SET)
-- Is there no item at internal cursor position?
-- (From DS_TRAVERSABLE)
-- Does container use the same comparison
-- criterion as other?
-- (From DS_SEARCHABLE)
-- Are v and u considered equal?
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SEARCHABLE)
-- Is internal cursor at same position as a_cursor?
-- (From DS_TRAVERSABLE)
-- Move internal cursor to last position.
-- (From DS_BILINEAR)
-- Move internal cursor to first position at or before current
-- position where item_for_iteration and v are equal.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Move before if not found.
-- (From DS_BILINEAR)
-- Move internal cursor to first position at or after current
-- position where item_for_iteration and v are equal.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Move after if not found.
-- (From DS_LINEAR)
-- Add items of other to set, replacing any existing item.
-- Add other.first first, etc.
-- Resize set if necessary.
-- Do not move cursors.
-- (From DS_SET)
-- Add items of other to set, replacing any existing item.
-- Add other.first first, etc.
-- If items of other were not included yet, insert
-- them at last position if implementation permits.
-- Resize set if necessary.
-- Do not move cursors.
-- (From DS_EXTENDIBLE)
-- Add items of other to set, replacing any existing item.
-- Add other.first first, etc.
-- Do not move cursors.
-- (From DS_SET)
-- Add items of other to set, replacing any existing item.
-- Add other.first first, etc.
-- If items of other were not included yet, insert
-- them at last position if implementation permits.
-- Do not move cursors.
-- (From DS_EXTENDIBLE)
-- Add v to set, replacing any existing item.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Resize set if necessary.
-- Do not move cursors.
-- (From DS_SET)
-- Add v at the end of set if not already included,
-- or replace it otherwise.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Resize set if necessary.
-- Do not move cursors.
-- (From DS_EXTENDIBLE)
-- Add v to set, replacing any existing item.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Do not move cursors.
-- (From DS_SET)
-- Add v at the end of set if not already included,
-- or replace it otherwise.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Do not move cursors.
-- (From DS_EXTENDIBLE)
-- Add v to set.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Do not move cursors.
-- (From DS_SET)
-- Resize container so that it can contain
-- at least n items. Do not lose any item.
-- Do not move cursors.
-- (From DS_RESIZABLE)
-- Clone of current object
-- (From KL_CLONABLE)
-- Remove all items not included in other.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Move all cursors off.
-- (From DS_SET)
-- Add all items of other to current set.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Do not move cursors.
-- (From DS_SET)
-- Remove all items also included in other.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Move all cursors off.
-- (From DS_SET)
-- Add items of other which are not included
-- in current set and remove those which are.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Move all cursors off.
-- (From DS_SET)
-- Remove holes between stored items. May avoid
-- resizing when calling force_last for example.
-- Do not lose any item. Do not move cursors.
-- (From DS_SPARSE_CONTAINER)
-- Search for item equal to v.
-- (Use equality_tester's comparison criterion
-- if not Void, use = criterion otherwise.)
-- If found, set found to true, and make that
-- item available in found_item.
-- (From DS_SPARSE_CONTAINER)
-- Add a_cursor to the list of traversing cursors
-- (i.e. cursors associated with current container
-- and which are not currently off).
-- (From DS_TRAVERSABLE)
-- Special values for before and after cursor positions
-- (From DS_SPARSE_CONTAINER)
-- (From DS_SPARSE_CONTAINER)
-- Is there no valid position to right of a_cursor?
-- (From DS_LINEAR)
-- Move a_cursor to previous position.
-- (From DS_BILINEAR)
-- Is there no valid position to left of a_cursor?
-- (From DS_BILINEAR)
-- Move a_cursor to last position.
-- (From DS_BILINEAR)
-- Move a_cursor to next position.
-- (From DS_LINEAR)
-- Move a_cursor to other's position.
-- (From DS_TRAVERSABLE)
-- Is a_cursor on first item?
-- (From DS_LINEAR)
-- Is a_cursor on last item?
-- (From DS_BILINEAR)
-- Item at a_cursor position
-- (From DS_TRAVERSABLE)
-- Is there no item at a_cursor position?
-- (From DS_TRAVERSABLE)
-- Is a_cursor at same position as other?
-- (From DS_TRAVERSABLE)
-- Move a_cursor to first position at or before its current
-- position where cursor_item (a_cursor) and v are equal.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Move before if not found.
-- (From DS_BILINEAR)
-- Move a_cursor to first position at or after its current
-- position where cursor_item (a_cursor) and v are equal.
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- Move after if not found.
-- (From DS_LINEAR)
-- Move a_cursor to first position.
-- (From DS_LINEAR)
-- Remove a_cursor from the list of traversing cursors
-- (i.e. cursors associated with current container
-- and which are not currently off).
-- (From DS_TRAVERSABLE)
-- Set equality_tester to a_tester.
-- A void equality tester means that =
-- will be used as comparison criterion.
-- (From DS_SEARCHABLE)
-- Item at position i in clashes
-- (From DS_SPARSE_CONTAINER)
-- Item at position i in items
-- (From DS_SPARSE_CONTAINER)
-- Item at position i in keys
-- (From DS_SPARSE_CONTAINER)
-- All slots to the right of this position
-- are guaranteed to be free
-- (From DS_SPARSE_CONTAINER)
-- Is there a slot at position i?
-- (From DS_SPARSE_CONTAINER)
-- Is there an item at position i?
-- (From DS_SPARSE_CONTAINER)
Sparse sets implemented with multi-arrays. Ancestor of %
%hash sets which should supply its hashing mechanism.