Stores the k best values where best is defined by sorter. This
means that the item at the top of the heap is the worst item. So if you want the best
items to be the largest items, make sure sorter is '<'.
| :sorter → # | :k → # |
|---|---|
| :initial-size → # |
| bounded-container-mixin | |
|---|---|
| heap-container |
| contents | Reader:contents. |
|---|---|
| element-type | Initargs::element-type; Reader:element-type. |
| k | Initform:1, Initargs::k; Accessors:k-best-number. |
| key | Initform:(quote identity), Initargs::key; Reader:key. |
| sorter | Initform:(function <), Initargs::sorter; Accessors:sorter. |
| test | Initform:(function equal), Initargs::test. |
| insert-item | Adds item to the container |
|---|
| %operate-after-finding | |
|---|---|
| add-initial-contents | |
| base-class-for-iteratee | |
| best-item | Returns the item in items with the 'best' value of function where |
| biggest-item | |
| 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-biggest-item | |
| delete-element | |
| delete-first | Removes (and returns) the first item in an ordered |
| delete-item | |
| delete-item-at | |
| 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. |
| element-position | Returns the position of element in container using test and |
| empty! | Removes all items from the container and returns nil. |
| every-element-p | |
| every-item-p | Returns true if every item in the container satisfies the |
| exchange-heap-nodes | |
| find-element | For now, compare find-item. |
| find-item | Find item in container using the container's test |
| first-element | |
| heap-node-parent | |
| heapify | |
| insert-initial-contents-p | Returns true if this container type should rely on the default behavior of basic-initial-contents... |
| insert-item-at | Inserts item at the specified index, increasing the index of all following elements |
| 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 |
| iteratable-p | Returns true if thing knows how to iterate-nodes. |
| iterate-elements | |
| iterate-nodes | Applies function to each node in the container. If the container doesn't have nodes, then this is... |
| l-child | |
| last-element | |
| make-container-for-contents | Creates a sub-container to be used as contents for a |
| make-node-for-container | |
| nth-element | Returns the nth element in the container's 'natural' order. |
| predecessor | Return the item that comes before item in the container. Only makes sense for sorted containers... |
| print-container | Prints the contents of container (using PRINT). Returns the container. |
| r-child | |
| 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. |
| 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-match | Hunt for an item in the container that satisfies |
| search-for-matching-node | |
| search-for-node | |
| search-for-node* | |
| setffirst-element | |
| setflast-element | |
| size | Returns the number of items currently in the container. |
| some-element-p | |
| some-item-p | Returns the first item in the container for which predicate |
| sort-container | |
| successor | Return the item that comes after item in the container. Only makes sense for sorted containers. R... |
| total-size | |
| unique-elements | |
| unique-nodes |