| abstract-container | Inherited by all container classes, this is a good place to |
|---|
| binary-search-tree | |
|---|---|
| dlist-container | A double-linked list |
| heap-container | |
| quad-tree |
| %operate-after-finding | |
|---|---|
| delete-element | |
| delete-item | |
| find-element | For now, compare find-item. |
| find-item | Find item in container using the container's test |
| insert-item | Adds item to the container |
| iterate-elements | |
| predecessor | Return the item that comes before item in the container. Only makes sense for sorted containers... |
| search-for-node | |
| search-for-node* | |
| successor | Return the item that comes after item in the container. Only makes sense for sorted containers. R... |