:key → # | :test → # |
---|---|
:sorter → # |
concrete-container | Inherited by all container classes that can/should |
---|---|
container-uses-nodes-mixin | |
findable-container-mixin | |
initial-contents-mixin | |
iteratable-container-mixin | |
rooted-tree-container | Base class of all trees with roots. |
sorted-container-mixin |
red-black-tree | |
---|---|
splay-tree |
key | Initform:(quote identity), Initargs::key; Reader:key. |
---|---|
root | Initargs::root; Accessors:root. |
sorter | Initform:(function <), Initargs::sorter; Accessors:sorter. |
test | Initform:(function equal), Initargs::test. |
tree-size | Initform:0, Initargs::tree-size; Accessors:tree-size. |
delete-item | |
---|---|
delete-item-if | |
delete-node | |
empty! | Removes all items from the container and returns nil. |
empty-p | Returns t if there are no items in the container. |
find-item | Find item in container using the container's test |
find-node | Find node containing thing in container using the container's test |
first-element | |
first-node | |
height | |
inorder-walk | |
inorder-walk-nodes | |
insert-item | Adds item to the container |
item-at | Returns the item specified by the indexes. |
iterate-nodes | Applies function to each node in the container. If the container doesn't have nodes, then this is... |
last-element | |
make-node-for-container | |
postorder-walk | |
postorder-walk-nodes | |
predecessor | Return the item that comes before item in the container. Only makes sense for sorted containers... |
preorder-walk | |
preorder-walk-nodes | |
rotate-left | |
rotate-right | |
setffirst-element | |
setflast-element | |
size | Returns the number of items currently in the container. |
splay-tree-rotate | rotate the node (and maybe the parent) until the node is |
splay-tree-splay | Preform the splay operation on the tree about this node |
successor | Return the item that comes after item in the container. Only makes sense for sorted containers. R... |
update-element |
%operate-after-finding | |
---|---|
add-initial-contents | |
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-nodes | Returns a possibly filtered and possibly transformed list |
count-elements | |
count-elements-if | |
count-items | |
delete-element | |
delete-list | Deletes each item in the list from the container. |
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 |
find-element | For now, compare find-item. |
insert-initial-contents-p | Returns true if this container type should rely on the default behavior of basic-initial-contents... |
insert-list | Adds each item in the list to the container in an |
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 | |
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 |
reverse-container | Destructively alters the elements/nodes of an ordered container so that they are reversed. |
search-for-element | |
search-for-item | Hunt for the item in the container. Key and Test |
search-for-match | Hunt for an item in the container that satisfies |
search-for-matching-node | |
search-for-node | |
search-for-node* | |
some-element-p | |
some-item-p | Returns the first item in the container for which predicate |
unique-elements | |
unique-nodes |