$Date: 2005/10/26 15:41:47 $
$Revision: 1.9 $
-- Create an empty table and allocate memory
-- space for at least default_capacity items.
-- Use = as comparison criterion for items.
-- Use equal as comparison criterion for keys.
-- (From DS_CONTAINER)
-- Create an empty table and allocate
-- memory space for at least n items.
-- Use = as comparison criterion for items.
-- Use equal as comparison criterion for keys.
-- (From DS_SPARSE_TABLE)
-- Routines that ought to be in class ANY
-- (From KL_IMPORTED_ANY_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)
-- Equality tester;
-- A void equality tester means that =
-- will be used as comparison criterion.
-- (From DS_SEARCHABLE)
-- Equality tester for keys;
-- A void equality tester means that =
-- will be used as comparison criterion.
-- (From DS_SPARSE_CONTAINER)
-- user's name
-- New external cursor for traversal
-- (From DS_TRAVERSABLE)
-- user's score
-- Maximum number of items in container
-- (From DS_RESIZABLE)
-- Number of items in container
-- (From DS_CONTAINER)
-- Initial capacity in make_default
-- (Default value: 10)
-- (From DS_RESIZABLE)
-- Number of times v appears in container
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SEARCHABLE)
-- Is table equal to other?
-- Do not take cursor positions, capacity
-- nor equality_tester into account.
-- (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?
-- (Default answer: True.)
-- (From DS_SEARCHABLE)
-- Did last call to search succeed?
-- (From DS_SPARSE_CONTAINER)
-- Does container include v?
-- (Use equality_tester's comparison criterion
-- if not void, use = criterion otherwise.)
-- (From DS_SEARCHABLE)
-- 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)
-- Can set_key_equality_tester be called with a_tester
-- as argument in current state of container?
-- (From DS_SPARSE_TABLE)
-- 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)
-- Associate v with key k. Put v at the end of table
-- if no item was already associated with k, or replace
-- existing item otherwise.
-- Resize table if necessary.
-- Do not move cursors.
-- (From DS_SPARSE_TABLE)
-- Associate v with key k. Put v at the end of table
-- if no item was already associated with k, or replace
-- existing item otherwise.
-- Do not move cursors.
-- (From DS_SPARSE_TABLE)
-- Replace item associated with
-- the key of found_item by v.
-- Do not move cursors.
-- (From DS_SPARSE_TABLE)
-- 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)
-- Set equality_tester to a_tester.
-- A void equality tester means that =
-- will be used as comparison criterion.
-- (From DS_SEARCHABLE)
-- Set key_equality_tester to a_tester.
-- A void key equality tester means that =
-- will be used as comparison criterion.
-- (From DS_SPARSE_TABLE)
-- 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 at key k.
-- If found, set found to true, and set
-- found_item to item associated with k.
-- (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)
-- Key at a_cursor position
-- (From DS_SPARSE_TABLE)
-- 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)
-- 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)
A highscore entry consists of a name, a score and possibly
other keys, which are accessible through a hash table.