| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
eq?
eq?
eqv?
eqv?
equal?
equal?
string=?
string=?. Key must be a string.
If type is omitted, eq? is assumed.
#t if obj is a hash table.
#t if a hash table hash has a key key.
#t if the entry has exist, or #f if the entry
hasn't exist. The same function is called hash-table-remove! in STk
(except that it returns an undefined value); I use `delete' for consistency
to SRFI-1, SRFI-13 and other parts of the libraries.
(list value).
Works the same as the following code, except that this function only looks up the key once, thus it's more efficient.
(hash-table-put! hash key
(cons value (hash-table-get hash key '())))
|
During the operation the key is looked for only once, thus runs efficiently.
| [ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |