INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |
-- Allocate hash table for at least `n' items.
-- The table will be resized automatically
-- if more than `n' items are inserted.
-- Item associated with `key', if present
-- otherwise default value of type `G'
-- Is there an item in the table with key `key'?
-- Does structure include `v'?
-- (Reference or object equality,
-- based on `object_comparison'.)
-- Array of actually used keys, from 1 to `count'
-- Element at current iteration position
-- Key at current iteration position
-- Current cursor position
-- Does table contain the same information as `other'?
-- May items be removed? (Answer: yes.)
-- Did last operation cause a conflict?
-- Did last operation insert an item?
-- Did last operation replace an item?
-- Did last operation remove an item?
-- Did last operation find the item sought?
-- Is cursor past last item?
-- Can cursor be moved to position `c'?
-- Bring cursor to first position.
-- Advance cursor to next occupied position.
-- Move to position `c'.
-- Search for item of key `key'.
-- If found, set `found' to true and `search_item' to item for `key'.
-- Insert `new' with `key' if there is no other item
-- associated with the same key.
-- Make `inserted' true if and only if an insertion has
-- been made (i.e. `key' was not present).
-- If so, set `position' to the insertion position.
-- If `key' is present, replace corresponding item by `new',
-- if not, insert item `new' with key `key'.
-- Make `inserted' true.
-- Replace item at `key', if present,
-- with `new'; do not change associated key.
-- Make `replaced' true if and only if a replacement has
-- been made (i.e. `key' was present).
-- If there is an item of key `old_key' and no item of key
-- `new_key', replace the former's key by `new_key'
-- and set status to `replaced'.
-- Remove item associated with `key', if present.
-- Make `removed' true if and only if an item has been
-- removed (i.e. `key' was present).
-- If so, set `position' to index of removed element.
-- Reset all items to default values.
-- Representation as a linear structure
-- (order is same as original order of insertion)
-- Re-initialize from `other'.
-- Is `k' a valid key?
-- Answer: yes
INDEX | CLUSTER | FEATURES | SHORT | FRAMES | NO FRAMES |