Inherited by all container classes, this is a good place to
put those pesky superclasses you need...

A double-linked list

A node with many ordered children is a vector

A non associative container should implement at least empty-p,
empty, insert-item and delete-item...

A mixin for nodes with parent pointers

A persistently sorted double-linked list

Moves a windows of size window-size across the elements of container, stepping by `window-ste...

Counts stuff by applying the map-fn to the arguments. Assumes that
the map-fn signature has the f...

Try to find a class which is a subclass of root and all of the other classes as well. If no suc...

Moves a windows of size window-size across the elements of container, stepping by `window-ste...

Add an item to the end of an ordered container.

Returns a possibly filtered and possibly transformed list of the elements in a container. If the ...

Returns a possibly filtered and possibly transformed list
of the nodes in a container. If the con...

Deletes each item in the list from the container.

Returns the position of element in container using test and
key to match. Key defaults to identit...

Returns t if there are no items in the container.

This method ensures that the sorted-list-container is sorted,
and then returns the container.

Returns true if every item in the container satisfies the
predicate. Predicate should be a funct...

For now, compare find-item.

Find node containing thing in container using the container's test
method for comparisons. The te...

Tell Lisp that you are done with this iterator. Further calls to current-element, etc. will have ...

This method forces a sort on the next pertinent access of
the container.

Adds item to the container

Inserts item at the specified index, increasing the index of all following elements

Adds each item in the list to the container in an
upspecified order.

Adds each item in the sequence to the container in an
upspecified order.

[Destructively] modifies the item specified by the
indexes to the value.

Calls fn on every child of node.

Applies function to each node in the container. If the container doesn't have nodes, then this is...

Returns true if thing knows how to iterate-nodes.

Creates a new container of type class using the additional
arguments (args).

Returns the nth element in the container's 'natural' order.

Removes items from a container that satisfy the test. The
container is returned.

Destructively alters the elements/nodes of an ordered container so that they are reversed.

Hunt for the item in the container. Key and Test
are as in member.

Hunt for an item in the container that satisfies
the predicate. Key is as in count-if.