*container-print-association-separator* | Specify the string used to separate <key value> pairs when printing the contents of an associativ... |
---|---|
*container-print-association-string* | Specify the string used to separate keys and values when printing the contents of an associative-... |
*container-print-length* | Specifies the maximum number of container elements to print when *container-print-representation*... |
*container-print-representation* | Specifies the output format for container printing. This can be :contents or :summary. |
collect-containers | |
---|---|
collect-pairs | |
collect-using | Collects stuff by applying the map-fn to the arguments. Assumes that the map-fn signature has the... |
collect-window-over-elements | Moves a windows of size `window-size` across the elements of `container`, stepping by `window-ste... |
collect-window-over-nodes | Moves a windows of size `window-size` across the elements of `container`, stepping by `window-ste... |
count-using | Counts stuff by applying the map-fn to the arguments. Assumes that the map-fn signature has the f... |
element-counts | |
first-item | |
last-item | |
make-generator | |
make-iterator | |
map-containers | |
map-pairs | |
map-window-over-elements | Moves a windows of size `window-size` across the elements of `container`, stepping by `window-ste... |
map-window-over-nodes | Moves a windows of size `window-size` across the elements of `container`, stepping by `window-ste... |
merge-elements | |
merge-nodes | |
move-forward-p | |
node-counts |
append-item | Add an item to the end of an ordered container. |
---|---|
append-new-item | Add an item to the end of an ordered container unless its already there. |
best-element | |
best-node | |
biggest-item | |
children | |
collect-elements | Returns a possibly filtered and possibly transformed list of the elements in a container. If the ... |
collect-elements-stably | |
collect-items | |
collect-key-value | Iterate over the keys and values of the container and return a list of the ones that pass the fi... |
collect-key-value-stably | |
collect-keys | |
collect-nodes | Returns a possibly filtered and possibly transformed list of the nodes in a container. If the con... |
container->list | |
count-elements | |
count-elements-if | |
current-element | |
current-element-p | |
current-item | |
delete-biggest-item | |
delete-element | |
delete-first | Removes (and returns) the first item in an ordered container. Behavior is undefined if the conta... |
delete-item | |
delete-item-after | |
delete-item-at | |
delete-item-before | |
delete-item-if | |
delete-last | Removes (and returns) the last item in an ordered container. Behavior is undefined if the contai... |
delete-list | Deletes each item in the list from the container. |
delete-node | |
dequeue | |
dimensions | |
element-position | Returns the position of element in container using test and key to match. Key defaults to identit... |
empty! | Removes all items from the container and returns nil. |
empty-p | Returns t if there are no items in the container. |
enqueue | |
ensure-sorted | This method ensures that the sorted-list-container is sorted, and then returns the container. |
every-element-p | |
every-item-p | Returns true if every item in the container satisfies the predicate. Predicate should be a funct... |
every-key-value-p | |
find-child-node | |
find-element | For now, compare find-item. |
find-item | Find item in container using the container's test method for comparisons. The test method must ta... |
find-node | Find node containing thing in container using the container's test method for comparisons. The te... |
find-set | |
find-value | |
finish | Tell Lisp that you are done with this iterator. Further calls to current-element, etc. will have ... |
first-element | |
force-sort | This method forces a sort on the next pertinent access of the container. |
graft-nodes | |
inorder-walk | |
insert-item | Adds item to the container |
insert-item-after | |
insert-item-at | Inserts item at the specified index, increasing the index of all following elements |
insert-item-before | |
insert-item-ordered | |
insert-item-ordered-about-node | |
insert-list | Adds each item in the list to the container in an upspecified order. |
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 upspecified order. |
item-at | Returns the item specified by the indexes. |
item-at! | [Destructively] modifies the item specified by the indexes to the value. |
item-at-1 | |
item-at-1! | |
iteratable-p | Returns true if thing knows how to iterate-nodes. |
iterate-children | Calls fn on every vertex that is either connected to vertex by an undirected edge or is at the ta... |
iterate-container | |
iterate-elements | |
iterate-elements-stably | |
iterate-forward | |
iterate-key-value | |
iterate-key-value-stably | |
iterate-keys | |
iterate-left | |
iterate-left-nodes | |
iterate-nodes | Applies function to each node in the container. If the container doesn't have nodes, then this is... |
iterate-right | |
iterate-right-nodes | |
key-exists-p | |
last-element | |
left-and-right-nodes-for-item | |
left-node-for-item | |
make-container | Creates a new container of type class using the additional arguments (args). |
make-node-for-container | |
move | |
move-forward | |
move-p | |
next-item | |
notify-element-of-child-status | This is called to allow the element to know its status as a child. Useful for quad tree elements,... |
nth-element | Returns the nth element in the container's 'natural' order. |
pop-item | |
postorder-walk | |
predecessor | |
preorder-walk | |
print-container | Prints the contents of container (using PRINT). Returns the container. |
push-item | |
reduce-container | |
reduce-elements | |
reduce-nodes | |
remove-items-if | Removes items from a container that satisfy the test. The container is returned. |
replace-item | |
representative | |
representative-node | |
reverse-container | Destructively alters the elements/nodes of an ordered container so that they are reversed. |
reverse-find | Finds the key in the associative-container whose value is VALUE. |
right-node-for-item | |
search-for-element | |
search-for-item | Hunt for the item in the container. Key and Test are as in member. |
search-for-key | |
search-for-match | Hunt for an item in the container that satisfies the predicate. Key is as in count-if. |
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 holds. Predicate should be a function... |
some-key-value-p | |
sort-elements | |
sort-keys | |
successor | |
unique-elements | |
unique-nodes | |
update-item | |
weight | Returns the weight of an edge. This defaults to 1.0 and can only be altered if the edge is a sub-... |
with-iterator |
---|