A library of container classes and algorithms for Common Lisp.
| collect-containers | |
|---|---|
| collect-pairs | |
| collect-using | Collects stuff by applying the map-fn to the arguments. Assumes that |
| collect-window-over-elements | Moves a windows of size |
| collect-window-over-nodes | Moves a windows of size |
| count-using | Counts stuff by applying the map-fn to the arguments. Assumes that |
| element-counts | |
| first-item | |
| last-item | |
| make-generator | |
| make-iterator | |
| map-containers | |
| map-pairs | |
| map-window-over-elements | Moves a windows of size |
| map-window-over-nodes | Moves a windows of size |
| 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 |
| 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 |
| collect-key-value-stably | |
| collect-keys | |
| collect-nodes | Returns a possibly filtered and possibly transformed list |
| 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 |
| 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 |
| 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 |
| 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, |
| every-element-p | |
| every-item-p | Returns true if every item in the container satisfies the |
| 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 |
| find-node | Find node containing thing in container using the container's test |
| 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 |
| 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 |
| 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 |
| item-at | Returns the item specified by the indexes. |
| item-at! | [Destructively] modifies the item specified by the |
| 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 |
| 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 |
| nth-element | Returns the nth element in the container's 'natural' order. |
| pop-item | |
| postorder-walk | |
| predecessor | Return the item that comes before item in the container. Only makes sense for sorted containers... |
| 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 |
| 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 |
| right-node-for-item | |
| 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 | |
| search-for-node* | |
| some-element-p | |
| some-item-p | Returns the first item in the container for which predicate |
| some-key-value-p | |
| sort-elements | |
| sort-keys | |
| successor | Return the item that comes after item in the container. Only makes sense for sorted containers. R... |
| 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 |
|---|