- Function: remassoc key alist
This function deletes by side effect any associations with key KEY
- in ALIST - i.e. it removes any elements from ALIST whose `car' is
+ in ALIST--i.e. it removes any elements from ALIST whose `car' is
`equal' to KEY. The modified ALIST is returned.
If the first member of ALIST has a `car' that is `equal' to KEY,
- Function: remassq key alist
This function deletes by side effect any associations with key KEY
- in ALIST - i.e. it removes any elements from ALIST whose `car' is
+ in ALIST--i.e. it removes any elements from ALIST whose `car' is
`eq' to KEY. The modified ALIST is returned.
This function is exactly like `remassoc', but comparisons between
- Function: remrassoc value alist
This function deletes by side effect any associations with value
- VALUE in ALIST - i.e. it removes any elements from ALIST whose
+ VALUE in ALIST--i.e. it removes any elements from ALIST whose
`cdr' is `equal' to VALUE. The modified ALIST is returned.
If the first member of ALIST has a `car' that is `equal' to VALUE,
- Function: remrassq value alist
This function deletes by side effect any associations with value
- VALUE in ALIST - i.e. it removes any elements from ALIST whose
+ VALUE in ALIST--i.e. it removes any elements from ALIST whose
`cdr' is `eq' to VALUE. The modified ALIST is returned.
This function is exactly like `remrassoc', but comparisons between
done with the elements, they will automatically disappear from the list.
Weak lists are used internally, for example, to manage the list
-holding the children of an extent - an extent that is unused but has a
+holding the children of an extent--an extent that is unused but has a
parent will still be reclaimed, and will automatically be removed from
its parent's list of children.