biassociative-container-mixin | |
---|---|
concrete-container | Inherited by all container classes that can/should |
initial-element-mixin | |
key-value-iteratable-container-mixin | |
uses-contents-mixin |
contents | Reader:contents. |
---|---|
has-initial-element-p | Reader:has-initial-element-p. |
initial-element | Initargs::initial-element; Accessors:initial-element. |
initial-element-fn | Initargs::initial-element-fn,:initial-element-function; Readers:initial-element-fn, initial-element-function. |
test | Initform:(function equal), Initargs::test. |
delete-item-at | |
---|---|
empty! | Removes all items from the container and returns nil. |
initialize-container | |
item-at | Returns the item specified by the indexes. |
item-at! | [Destructively] modifies the item specified by the |
item-at-1 | |
item-at-1! | |
iterate-key-value | |
iterate-keys | |
iterate-nodes | Applies function to each node in the container. If the container doesn't have nodes, then this is... |
make-container-for-contents | Creates a sub-container to be used as contents for a |
reverse-find | Finds the key in the associative-container whose |
size | Returns the number of items currently in the container. |
sort-elements | |
sort-keys |
add-initial-contents | |
---|---|
base-class-for-iteratee | |
best-item | Returns the item in items with the 'best' value of function where |
collect-elements | Returns a possibly filtered and possibly transformed list of the elements in a container. If the ... |
collect-elements-stably | |
collect-key-value | Iterate over the keys and values of the container and |
collect-keys | |
collect-nodes | Returns a possibly filtered and possibly transformed list |
count-elements | |
count-elements-if | |
count-items | |
delete-item-if | |
element-position | Returns the position of element in container using test and |
every-element-p | |
every-item-p | Returns true if every item in the container satisfies the |
every-key-value-p | |
first-element | |
insert-initial-contents-p | Returns true if this container type should rely on the default behavior of basic-initial-contents... |
insert-new-item | Adds item to the container unless it is already there |
insert-sequence | Adds each item in the sequence to the container in an |
iteratable-p | Returns true if thing knows how to iterate-nodes. |
iterate-elements | |
key-exists-p | |
key-value-iteratable-p | Returns true if thing knows how to iterate-nodes. |
make-initial-element | |
nth-element | Returns the nth element in the container's 'natural' order. |
print-container | Prints the contents of container (using PRINT). Returns the container. |
reduce-container | |
reduce-elements | |
reduce-nodes | |
remove-items-if | Removes items from a container that satisfy the test. The |
samep | Compares two things and returns true if they are the same |
search-for-element | |
search-for-item | Hunt for the item in the container. Key and Test |
search-for-key | |
search-for-match | Hunt for an item in the container that satisfies |
search-for-matching-node | |
search-for-node | |
setffirst-element | |
some-element-p | |
some-item-p | Returns the first item in the container for which predicate |
some-key-value-p | |
sort-container | |
unique-elements | |
unique-nodes |