A library of container classes and algorithms for Common Lisp.
| *current-iteratee* | |
|---|---|
| *rbt-empty-node* | |
| +empty-initial-element+ |
| +iterator-after-end+ | |
|---|---|
| +iterator-before-beginning+ | |
| +rbt-color-black+ | |
| +rbt-color-red+ |
| %operate-after-finding | |
|---|---|
| add-default-item | |
| add-initial-contents | |
| advance | |
| 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 |
| base-class-for-iteratee | |
| best-element | |
| best-node | |
| biggest-item | |
| bst-node-is-left-child | Is this node the left child of its parent? |
| bst-node-is-right-child | Is this node the right child of its parent? |
| bst-node-replace-child | Replace the child of this node. |
| bst-node-set-left-child | Set new-left as the left child of node |
| bst-node-set-right-child | Set new-right as the right child of node |
| characterize-element | Examines element in the context of iterator and returns a value describing how to treat it. This ... |
| children | |
| class-for-contents-as | |
| clean-up | |
| 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 | Collects the |
| collect-nodes | Returns a possibly filtered and possibly transformed list |
| combine-elements | |
| container->list | |
| container-difference | |
| container-dimension | |
| count-elements | |
| count-elements-if | |
| count-items | |
| 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-passes-p | |
| 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, |
| error-if-queue-empty | |
| every-element-p | |
| every-item-p | Returns true if every item in the container satisfies the |
| every-key-value-p | |
| exchange-heap-nodes | |
| 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 | |
| first-node | |
| force-sort | This method forces a sort on the next pertinent access of |
| graft-nodes | |
| has-children-p | |
| heap-node-parent | |
| heapify | |
| height | |
| increment-end | |
| initialize-container | |
| inorder-walk | |
| inorder-walk-nodes | |
| insert-initial-contents-p | Returns true if this container type should rely on the default behavior of basic-initial-contents... |
| 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! | |
| item-key | |
| iteratable-p | Returns true if thing knows how to iterate-nodes. |
| iterate-children | Calls |
| 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-nodes-about-node | |
| iterate-right | |
| iterate-right-nodes | |
| key-exists-p | |
| key-value-iteratable-p | Returns true if thing knows how to iterate-nodes. |
| l-child | |
| l-child-index | |
| last-element | |
| left-and-right-nodes-for-item | |
| left-node-for-item | |
| link-nodes | |
| make-container | Creates a new container of type class using the additional |
| make-container-for-contents | Creates a sub-container to be used as contents for a |
| make-initial-element | |
| make-internal-iterator | |
| make-iterator | |
| make-node-for-container | |
| make-set | |
| move | |
| move-forward | |
| move-forward-to-next-element | |
| move-internal | |
| move-p | |
| next-item | |
| node-empty-p | |
| node-parent-index | |
| 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. |
| open-file-for-iterator | |
| pop-item | |
| 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 | |
| print-container | Prints the contents of container (using PRINT). Returns the container. |
| print-container-summary | |
| print-iterator | |
| push-item | |
| r-child | |
| r-child-index | |
| rb-delete-fixup | |
| reduce-container | |
| reduce-elements | |
| reduce-nodes | |
| remove-items-if | Removes items from a container that satisfy the test. The |
| replace-item | |
| representative | |
| representative-node | |
| reset | |
| 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-most-child | Walk down the right side of the tree until a leaf node is |
| right-node-for-item | |
| rotate-left | |
| rotate-right | |
| 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* | |
| set-dirty-flag | |
| setup-initial-container | |
| some-element-p | |
| some-item-p | Returns the first item in the container for which predicate |
| some-key-value-p | |
| sort-container | |
| sort-elements | |
| sort-keys | |
| sort-update-left | |
| sort-update-right | |
| 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... |
| unique-elements | |
| unique-nodes | |
| update-element | |
| update-item | |
| walk-tree | |
| walk-tree-nodes | |
| weight | Returns the weight of an edge. This defaults to 1.0 |
| with-iterator |
|---|