Package Metabang.Cl-Containers uses the packages Common-Lisp. It is also known as Cl-Containers and Containers. It has 632 total symbols and 233 external ones.
basic-iterator-condition | |
---|---|
container-error | |
eksl-queue-empty | |
index-out-of-range-error | |
no-current-element-error |
*container-print-association-separator* | |
---|---|
*container-print-association-string* | |
*container-print-length* | |
*container-print-representation* | |
*container-readtable* | |
*current-iteratee* | |
*rbt-empty-node* | |
*samep-test* | |
+empty-initial-element+ |
+iterator-after-end+ | |
---|---|
+iterator-before-beginning+ | |
+rbt-color-black+ | |
+rbt-color-red+ |
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 already there. |
argmax | Returns the item in items with the biggest (#'>) value of function. See best-item for a generaliz... |
argmin | Returns the item in items with the smallest (#'<) value of function. |
base-class-for-iteratee | |
best-element | |
best-item | Returns the item in items with the 'best' value of function where 'best' is determined by test. Y... |
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 |
check-delimiter | |
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 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 | |
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 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 | |
element-passes-p | |
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. |
error-if-queue-empty | |
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 | |
exchange-heap-nodes | |
existing-subclass | |
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 | |
first-element | |
force-sort | This method forces a sort on the next pertinent access of the container. |
graft-nodes | |
has-children-p | |
heap-node-parent | |
heapify | |
height | |
include-class-dependencies | |
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 | |
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! | |
item-key | |
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-nodes-about-node | |
iterate-right | |
iterate-right-nodes | |
key-exists-p | |
l-child | |
l-child-index | |
last-element | |
left-and-right-nodes-for-item | |
left-node-for-item | |
length-at-least-p | Returns true if thing has no fewer than length elements in it. |
length-at-most-p | Returns true if thing has no more than length elements in it. |
link-nodes | |
make-container | Creates a new container of type class using the additional arguments (args). |
make-container-for-contents | Creates a sub-container to be used as contents for a super-container. |
make-initial-element | |
make-node-for-container | |
make-set | |
move | |
move-forward | |
move-forward-to-next-element | |
move-p | |
next-element | |
next-item | |
node-empty-p | |
node-parent-index | |
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. |
open-file-for-iterator | |
pop-item | |
postorder-walk | |
postorder-walk-nodes | |
predecessor | |
preorder-walk | |
preorder-walk-nodes | |
print-container | Prints the contents of container (using PRINT). Returns the container. |
print-container-contents | |
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 container is returned. |
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 value is VALUE. |
right-most-child | Walk down the right side of the tree until a leaf node is found, then return that node |
right-node-for-item | |
rotate-left | |
rotate-right | |
samep | Compares two things and returns true if they are the same in the sense of being interchangable. I... |
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* | |
set-dirty-flag | |
setup-initial-container | |
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 holds. Predicate should be a function... |
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 the root of the tree |
splay-tree-splay | Preform the splay operation on the tree about this node rotating the node until it becomes the ro... |
successor | |
total-size | |
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 and can only be altered if the edge is a sub-... |
defclass* | Like 'defclass-brief' but also provides the :MAKE-LOAD-FORM-P, :EXPORT-P, :EXPORT-SLOTS, :NO-COP... |
---|---|
defcondition | Defcondition is a handy shortcut for defining Common Lisp conditions. It supports all of #[H][def... |
deprecated | Wrap a function definition with `deprecated' to indicate that it should no longer be used. If the... |