This is the cl-containers Reference Manual, version 0.12.1, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 15 04:47:39 2024 GMT+0.
cl-containers/cl-containers.asdcl-containers/setup/package.lispcl-containers/setup/conditions.lispcl-containers/dev/container-api.lispcl-containers/dev/containers.lispcl-containers/dev/basic-operations.lispcl-containers/dev/queues.lispcl-containers/dev/stacks.lispcl-containers/dev/trees.lispcl-containers/dev/lists.lispcl-containers/dev/bags-and-sets.lispcl-containers/dev/ring-buffers.lispcl-containers/dev/miscellaneous.lispcl-containers/dev/associative.lispcl-containers/dev/compatibility.lispcl-containers/dev/vectors.lispcl-containers/dev/quad-tree.lispcl-containers/dev/heaps.lispcl-containers/dev/container-mixins.lispcl-containers/dev/union-find-container.lispcl-containers/dev/package-container.lispcl-containers/dev/iterator-api.lispcl-containers/dev/iterators.lispcl-containers/dev/file-iterators.lispcl-containers/dev/dynamic-classes.lispcl-containers/dev/dynamic-class-defs.lispThe main system appears first, followed by any subsystem dependency.
cl-containersA generic container library for Common Lisp
Gary Warren King <gwking@metabang.com>
Brendan Burns, Andrew Hannon, Brent Heeringa, Gary King, Joshua Moody, Charles Sutton, Louis Theran, David Westbrook, and other former students and staff of EKSL.
MIT Style License
0.12.1
metatilities-base (system)., at least version "0.6.6"
Modules are listed depth-first from the system components tree.
cl-containers/setupcl-containers (system).
package.lisp (file).
conditions.lisp (file).
cl-containers/devsetup (module).
cl-containers (system).
container-api.lisp (file).
containers.lisp (file).
basic-operations.lisp (file).
queues.lisp (file).
stacks.lisp (file).
trees.lisp (file).
lists.lisp (file).
bags-and-sets.lisp (file).
ring-buffers.lisp (file).
miscellaneous.lisp (file).
associative.lisp (file).
compatibility.lisp (file).
vectors.lisp (file).
quad-tree.lisp (file).
heaps.lisp (file).
container-mixins.lisp (file).
union-find-container.lisp (file).
package-container.lisp (file).
iterator-api.lisp (file).
iterators.lisp (file).
file-iterators.lisp (file).
dynamic-classes.lisp (file).
dynamic-class-defs.lisp (file).
cl-containers/websitecl-containers (system).
source (module).
Files are sorted by type and then listed depth-first from the systems components trees.
cl-containers/cl-containers.asdcl-containers/setup/package.lispcl-containers/setup/conditions.lispcl-containers/dev/container-api.lispcl-containers/dev/containers.lispcl-containers/dev/basic-operations.lispcl-containers/dev/queues.lispcl-containers/dev/stacks.lispcl-containers/dev/trees.lispcl-containers/dev/lists.lispcl-containers/dev/bags-and-sets.lispcl-containers/dev/ring-buffers.lispcl-containers/dev/miscellaneous.lispcl-containers/dev/associative.lispcl-containers/dev/compatibility.lispcl-containers/dev/vectors.lispcl-containers/dev/quad-tree.lispcl-containers/dev/heaps.lispcl-containers/dev/container-mixins.lispcl-containers/dev/union-find-container.lispcl-containers/dev/package-container.lispcl-containers/dev/iterator-api.lispcl-containers/dev/iterators.lispcl-containers/dev/file-iterators.lispcl-containers/dev/dynamic-classes.lispcl-containers/dev/dynamic-class-defs.lispcl-containers/setup/conditions.lisppackage.lisp (file).
setup (module).
container-error (condition).
element (reader method).
element-not-found-error (condition).
container (reader method).
container-condition (condition).
index (reader method).
index-out-of-range-error (condition).
key-does-not-exist-error (condition).
message (reader method).
queue-empty (condition).
record-not-found-error (condition).
table (reader method).
(setf table) (writer method).
value (reader method).
(setf value) (writer method).
cl-containers/dev/container-api.lispdev (module).
append-item (generic function).
append-new-item (generic function).
best-element (generic function).
best-node (generic function).
biggest-item (generic function).
children (generic function).
collect-elements (generic function).
collect-elements-stably (generic function).
collect-items (generic function).
collect-key-value (generic function).
collect-key-value-stably (generic function).
collect-keys (generic function).
collect-nodes (generic function).
container->array (generic function).
container->list (generic function).
count-elements (generic function).
count-elements-if (generic function).
current-item (generic function).
delete-biggest-item (generic function).
delete-element (generic function).
delete-first (generic function).
delete-item (generic function).
delete-item-after (generic function).
delete-item-at (generic function).
delete-item-before (generic function).
delete-item-if (generic function).
delete-last (generic function).
delete-list (generic function).
delete-node (generic function).
dequeue (generic function).
element-position (generic function).
empty! (generic function).
enqueue (generic function).
ensure-sorted (generic function).
every-element-p (generic function).
every-item-p (generic function).
every-key-value-p (generic function).
find-child-node (generic function).
find-element (generic function).
find-item (generic function).
find-node (generic function).
find-set (generic function).
find-value (generic function).
first-element (generic function).
(setf first-element) (generic function).
first-item (function).
force-sort (generic function).
graft-nodes (generic function).
inorder-walk (generic function).
insert-item (generic function).
insert-item-after (generic function).
insert-item-at (generic function).
insert-item-before (generic function).
insert-item-ordered (generic function).
insert-item-ordered-about-node (generic function).
insert-list (generic function).
insert-new-item (generic function).
insert-sequence (generic function).
item-at (generic function).
(setf item-at) (generic function).
item-at! (generic function).
item-at-1 (generic function).
(setf item-at-1) (generic function).
item-at-1! (generic function).
iteratable-p (generic function).
iterate-children (generic function).
iterate-container (generic function).
iterate-elements (generic function).
iterate-elements-stably (generic function).
iterate-key-value (generic function).
iterate-key-value-stably (generic function).
iterate-keys (generic function).
iterate-left (generic function).
iterate-left-nodes (generic function).
iterate-nodes (generic function).
iterate-right (generic function).
iterate-right-nodes (generic function).
iterate-value-key (generic function).
key-value-iteratable-p (generic function).
last-element (generic function).
(setf last-element) (generic function).
last-item (function).
left-and-right-nodes-for-item (generic function).
left-node-for-item (generic function).
make-node-for-container (generic function).
next-item (generic function).
nth-element (generic function).
nth-item (generic function).
(setf packages) (generic function).
pop-item (generic function).
postorder-walk (generic function).
predecessor (generic function).
preorder-walk (generic function).
print-container (generic function).
push-item (generic function).
reduce-container (generic function).
reduce-elements (generic function).
reduce-nodes (generic function).
remove-items-if (generic function).
replace-item (generic function).
representative (generic function).
representative-node (generic function).
reverse-container (generic function).
reverse-find (generic function).
right-node-for-item (generic function).
sample-element (generic function).
sample-elements (generic function).
sample-item (generic function).
sample-unique-elements (generic function).
search-for-element (generic function).
search-for-item (generic function).
search-for-key (generic function).
search-for-match (generic function).
search-for-matching-node (generic function).
search-for-node (generic function).
search-for-node* (generic function).
some-element-p (generic function).
some-item-p (generic function).
some-key-value-p (generic function).
sort-elements (generic function).
sort-keys (generic function).
successor (generic function).
unique-elements (generic function).
unique-nodes (generic function).
update-item (generic function).
%operate-after-finding (generic function).
add-default-item (generic function).
add-initial-contents (generic function).
clean-up (generic function).
combine-elements (generic function).
container-difference (generic function).
container-dimension (generic function).
count-items (generic function).
error-if-queue-empty (generic function).
exchange-heap-nodes (generic function).
first-node (generic function).
has-children-p (generic function).
heap-node-parent (generic function).
heapify (generic function).
height (generic function).
increment-end (generic function).
initialize-container (generic function).
inorder-walk-nodes (generic function).
insert-initial-contents-p (generic function).
item-key (generic function).
iterate-nodes-about-node (generic function).
l-child (generic function).
l-child-index (generic function).
link-nodes (generic function).
make-container-for-contents (generic function).
make-initial-element (generic function).
make-set (generic function).
node-empty-p (generic function).
node-parent-index (generic function).
postorder-walk-nodes (generic function).
preorder-walk-nodes (generic function).
print-container-contents (generic function).
print-container-summary (generic function).
r-child (generic function).
r-child-index (generic function).
rb-delete-fixup (generic function).
rotate-left (generic function).
rotate-right (generic function).
sample-key (generic function).
set-dirty-flag (generic function).
sort-container (generic function).
sort-update-left (generic function).
sort-update-right (generic function).
update-element (generic function).
walk-tree (generic function).
walk-tree-nodes (generic function).
cl-containers/dev/containers.lispdev (module).
abstract-container (class).
alist-container (class).
array-container (class).
associative-container (class).
associative-container-mixin (class).
biassociative-container-mixin (class).
collect-elements (method).
collect-items (method).
container-node-mixin (class).
container-uses-nodes-mixin (class).
contents (reader method).
contents (reader method).
contents (reader method).
contents (reader method).
contents (reader method).
(setf contents) (writer method).
(setf contents) (writer method).
(setf contents) (writer method).
(setf contents) (writer method).
contents-as-array-mixin (class).
contents-as-hashtable-mixin (class).
contents-as-list-mixin (class).
dimensions (reader method).
(setf element) (writer method).
element (reader method).
element-type (reader method).
i-know-my-node-mixin (class).
initial-contents-mixin (class).
initial-element (reader method).
(setf initial-element) (writer method).
initial-element-fn (reader method).
initialize-instance (method).
initialize-instance (method).
initialize-instance (method).
initialize-instance (method).
initialize-instance (method).
(setf item-at) (method).
iteratable-container-mixin (class).
iteratable-p (method).
iterate-container (method).
iterate-nodes (method).
key-value-iteratable-container-mixin (class).
key-value-iteratable-p (method).
list-container (class).
make-node-for-container (method).
my-node (reader method).
(setf my-node) (writer method).
non-associative-container-mixin (class).
(setf parent) (writer method).
parent (reader method).
(setf parent) (writer method).
parent (reader method).
parent-node-mixin (class).
simple-associative-container (class).
size (method).
sparse-array-container (class).
stable-associative-container (class).
test-container-mixin (class).
total-size (method).
+empty-initial-element+ (special variable).
array-container-abstract (class).
array-data (reader method).
associative-array (class).
basic-initial-contents-mixin (class).
bounded-container-mixin (class).
classified-container-mixin (class).
classifier (reader method).
(setf classifier) (writer method).
concrete-container (class).
contents-as-sequence-mixin (class).
counter (reader method).
findable-container-mixin (class).
has-initial-element-p (reader method).
indexed-container-mixin (class).
initial-contents-key-value-mixin (class).
initial-element-function (reader method).
initial-element-mixin (class).
insert-initial-contents-p (method).
insert-initial-contents-p (method).
key (reader method).
keyed-container-mixin (class).
left-child (reader method).
(setf left-child) (writer method).
make-container-for-contents (method).
make-container-for-contents (method).
make-initial-element (method).
ordered-container-mixin (class).
return-empty-initial-element (function).
right-child (reader method).
(setf right-child) (writer method).
searchable-container-mixin (class).
sorted-container-mixin (class).
sorter (reader method).
(setf sorter) (writer method).
test (reader method).
two-child-node (class).
typed-container-mixin (class).
unordered-container-mixin (class).
use-fixnums? (reader method).
uses-contents-mixin (class).
cl-containers/dev/basic-operations.lispcontainer-api.lisp (file).
containers.lisp (file).
dev (module).
append-item (method).
append-new-item (method).
best-element (method).
best-item (method).
best-node (method).
collect-elements (method).
collect-elements-stably (method).
collect-key-value (method).
collect-key-value-stably (method).
collect-keys (method).
collect-nodes (method).
collect-using (function).
count-using (function).
delete-element (method).
delete-item (method).
delete-item (method).
delete-item-if (method).
delete-list (method).
dimensions (method).
element-position (method).
element-position (method).
empty! (method).
empty! (method).
empty! (method).
empty! (method).
empty-p (generic function).
every-element-p (method).
every-item-p (method).
find-element (method).
find-item (method).
find-item (method).
find-item (method).
find-value (method).
first-element (method).
(setf first-element) (method).
insert-item (method).
insert-item (method).
insert-list (method).
insert-new-item (method).
insert-sequence (method).
insert-sequence (method).
insert-sequence (method).
item-at (method).
item-at (method).
item-at! (method).
item-at! (method).
iterate-elements (method).
iterate-elements (method).
iterate-elements-stably (method).
iterate-key-value (method).
iterate-key-value-stably (method).
iterate-keys (method).
iterate-keys (method).
iterate-nodes (method).
iterate-nodes (method).
iterate-nodes (method).
iterate-nodes (method).
make-container (generic function).
nth-element (method).
nth-element (method).
predecessor (method).
print-container (method).
reduce-container (method).
reduce-elements (method).
reduce-nodes (method).
reverse-container (method).
reverse-find (method).
samep (method).
samep (method).
samep (method).
search-for-element (method).
search-for-item (method).
search-for-item (method).
search-for-item (method).
search-for-item (method).
search-for-match (method).
search-for-matching-node (method).
search-for-node (method).
search-for-node (method).
search-for-node (method).
search-for-node* (method).
search-for-node* (method).
size (method).
size (method).
size (method).
some-element-p (method).
some-item-p (method).
sort-elements (method).
successor (method).
%best-helper (function).
%collect-key-value (function).
%every-thing-p (function).
%operate-after-finding (method).
%search-for-match (function).
%search-in-container (function).
%some-thing-p (function).
add-default-item (method).
add-initial-contents (method).
add-initial-contents (method).
add-initial-contents (method).
add-initial-contents-internal (function).
associative-container-p (function).
collector-internal (function).
container-difference (method).
container-dimension (method).
make-container-for-contents (method).
reduce-internal (function).
tuple-index (function).
cl-containers/dev/queues.lispbasic-operations.lisp (file).
dev (module).
abstract-queue (class).
basic-queue (class).
delete-element (method).
delete-first (method).
delete-first (method).
delete-first (method).
delete-item (method).
delete-item (method).
delete-item-if (method).
delete-node (method).
dequeue (method).
empty! (method).
empty! (method).
empty! (method).
empty-p (method).
empty-p (method).
enqueue (method).
find-element (method).
find-item (method).
find-node (method).
first-element (method).
first-element (method).
first-element (method).
(setf first-element) (method).
(setf first-element) (method).
initialize-instance (method).
insert-item (method).
insert-item (method).
iterate-elements (method).
iterate-nodes (method).
iterate-nodes (method).
priority-queue-on-container (class).
size (method).
size (method).
container (reader method).
error-if-queue-empty (method).
(setf front-of-queue) (setf expander).
front-of-queue (function).
front-of-queue! (function).
queue-header (reader method).
(setf queue-header) (writer method).
queue-queue (reader method).
(setf queue-queue) (writer method).
(setf tail-of-queue) (setf expander).
tail-of-queue (function).
tail-of-queue! (function).
cl-containers/dev/stacks.lispbasic-operations.lisp (file).
dev (module).
contents (reader method).
empty! (method).
empty-p (method).
first-element (method).
(setf first-element) (method).
(setf first-element) (method).
insert-item (method).
pop-item (method).
push-item (method).
search-for-item (method).
size (method).
stack-container (class).
abstract-stack (class).
container-type (reader method).
make-container-for-contents (method).
cl-containers/dev/trees.lispbasic-operations.lisp (file).
vectors.lisp (file).
dev (module).
binary-search-tree (class).
children (method).
contents (reader method).
(setf contents) (writer method).
delete-item (method).
delete-item (method).
delete-item (method).
delete-item-at (method).
delete-item-if (method).
delete-node (method).
delete-node (method).
delete-node (method).
delete-node (method).
empty! (method).
empty-p (method).
find-child-node (method).
find-item (method).
find-item (method).
find-node (method).
find-successor-node (method).
first-element (method).
first-element (method).
(setf first-element) (method).
(setf first-element) (method).
initialize-instance (method).
initialize-instance (method).
inorder-walk (method).
insert-item (method).
insert-item (method).
insert-item (method).
item-at (method).
item-at (method).
iterate-children (method).
iterate-nodes (method).
last-element (method).
last-element (method).
(setf last-element) (method).
(setf last-element) (method).
make-node-for-container (method).
make-node-for-container (method).
many-child-node (class).
many-ordered-child-node (class).
many-unordered-child-node (class).
postorder-walk (method).
predecessor (method).
preorder-walk (method).
print-object (method).
print-object (method).
red-black-tree (class).
(setf root) (writer method).
root (reader method).
rooted-tree-container (class).
size (method).
size (method).
successor (method).
+rbt-color-black+ (constant).
+rbt-color-red+ (constant).
abstract-tree-container (class).
bst-node (class).
bst-node-is-left-child (generic function).
bst-node-is-right-child (generic function).
bst-node-replace-child (generic function).
bst-node-set-left-child (generic function).
bst-node-set-right-child (generic function).
empty-node (reader method).
find-successor-item (method).
first-node (method).
first-node (method).
has-children-p (method).
height (method).
height (method).
inorder-walk-nodes (method).
last-node (method).
last-node (method).
node-empty-p (method).
node-empty-p (method).
node-empty-p (method).
postorder-walk-nodes (method).
preorder-walk-nodes (method).
rb-delete-fixup (method).
rbt-color (reader method).
(setf rbt-color) (writer method).
rbt-empty-node (class).
red-black-node (class).
right-most-child (generic function).
rotate-left (method).
rotate-right (method).
splay-tree (class).
splay-tree-rotate (generic function).
splay-tree-splay (generic function).
tree (reader method).
(setf tree) (writer method).
tree-size (reader method).
(setf tree-size) (writer method).
update-element (method).
update-element (method).
walk-tree (method).
walk-tree (method).
walk-tree (method).
walk-tree-nodes (method).
walk-tree-nodes (method).
walk-tree-nodes (method).
cl-containers/dev/lists.lispbasic-operations.lisp (file).
dev (module).
collect-elements (method).
delete-first (method).
delete-first (method).
delete-item (method).
delete-item (method).
delete-item (method).
delete-item (method).
delete-item (method).
delete-item (method).
delete-item-after (method).
delete-item-before (method).
dlist-container (class).
dlist-container-node (class).
empty! (method).
ensure-sorted (method).
ensure-sorted (method).
find-item (method).
first-element (reader method).
first-element (method).
first-element (method).
(setf first-element) (writer method).
(setf first-element) (method).
(setf first-element) (method).
force-sort (method).
force-sort (method).
insert-item (method).
insert-item (method).
insert-item (method).
insert-item-after (method).
insert-item-after (method).
insert-item-after (method).
insert-item-after (method).
insert-item-before (method).
insert-item-before (method).
insert-item-before (method).
insert-item-ordered (method).
insert-item-ordered (method).
insert-item-ordered-about-node (method).
insert-item-ordered-about-node (method).
insert-item-ordered-about-node (method).
insert-list (method).
insert-list (method).
item-at (method).
item-at (method).
item-at (method).
iterate-left (method).
iterate-left (method).
iterate-left (method).
iterate-left-nodes (method).
iterate-left-nodes (method).
iterate-left-nodes (method).
iterate-nodes (method).
iterate-nodes (method).
iterate-right (method).
iterate-right (method).
iterate-right (method).
iterate-right-nodes (method).
iterate-right-nodes (method).
iterate-right-nodes (method).
last-element (reader method).
last-element (method).
(setf last-element) (writer method).
(setf last-element) (method).
left-and-right-nodes-for-item (method).
left-node-for-item (method).
make-node-for-container (method).
next-item (reader method).
(setf next-item) (writer method).
nth-element (method).
predecessor (method).
previous-item (reader method).
(setf previous-item) (writer method).
print-container (method).
print-container (method).
print-object (method).
replace-item (method).
replace-item (method).
right-node-for-item (method).
(setf size) (writer method).
size (reader method).
sorted-dlist-container (class).
sorted-list-container (class).
stable? (reader method).
(setf stable?) (writer method).
successor (method).
update-item (method).
update-item (method).
update-item (method).
clean-up (method).
dirty? (reader method).
iterate-nodes-about-node (method).
iterate-nodes-about-node (method).
iterate-nodes-about-node (method).
set-dirty-flag (method).
sort-update-left (method).
sort-update-right (method).
cl-containers/dev/bags-and-sets.lispbasic-operations.lisp (file).
dev (module).
bag-container (class).
contents (reader method).
contents (reader method).
delete-item (method).
delete-item (method).
delete-item (method).
empty! (method).
empty-p (method).
find-item (method).
find-item (method).
find-item (method).
find-value (method).
initialize-instance (method).
insert-item (method).
insert-item (method).
insert-item (method).
insert-item (method).
iterate-nodes (method).
iterate-nodes (method).
keyed-bag/set-container (class).
search-for-item (method).
search-for-item (method).
search-for-match (method).
set-container (class).
size (method).
size (method).
abstract-bag/set-container (class).
bag/set-container (class).
key-map (reader method).
make-container-for-contents (method).
set-or-bag (reader method).
cl-containers/dev/ring-buffers.lispbasic-operations.lisp (file).
queues.lisp (file).
dev (module).
container->list (method).
contents (reader method).
current-item (method).
delete-first (method).
delete-first (method).
delete-item (method).
delete-item-at (method).
delete-last (method).
delete-last (method).
empty! (method).
first-element (method).
(setf first-element) (method).
insert-item (method).
item-at (method).
item-at! (method).
iterate-nodes (method).
last-element (method).
(setf last-element) (method).
make-container (method).
make-ring-buffer (function).
next-item (method).
ring-buffer (class).
ring-buffer-reverse (class).
size (method).
total-size (reader method).
%index (method).
%index (method).
buffer-end (reader method).
buffer-start (reader method).
increment-end (method).
cl-containers/dev/miscellaneous.lispbasic-operations.lisp (file).
dev (module).
collect-pairs (function).
collect-window-over-elements (function).
collect-window-over-nodes (function).
element-counts (function).
map-pairs (function).
map-window-over-elements (function).
map-window-over-nodes (function).
merge-elements (function).
merge-nodes (function).
node-counts (function).
unique-elements (method).
unique-elements (method).
unique-nodes (method).
unique-nodes (method).
%container-counts (function).
%merge-helper (function).
%unique-elements (function).
map-window-over-elements-helper (function).
cl-containers/dev/associative.lispbasic-operations.lisp (file).
dev (module).
collect-keys (method).
count-elements (method).
count-elements (method).
count-elements-if (method).
count-elements-if (method).
delete-item-at (method).
delete-item-at (method).
delete-item-at (method).
delete-item-at (method).
dimensions (method).
empty! (method).
every-key-value-p (method).
initialize-instance (method).
initialize-instance (method).
initialize-instance (method).
item-at (method).
item-at (method).
item-at (method).
item-at (method).
item-at (method).
item-at (method).
item-at! (method).
item-at! (method).
item-at! (method).
item-at! (method).
item-at! (method).
item-at! (method).
item-at-1 (method).
item-at-1 (method).
(setf item-at-1) (method).
item-at-1! (method).
item-at-1! (method).
iterate-key-value (method).
iterate-key-value (method).
iterate-key-value (method).
iterate-key-value (method).
iterate-keys (method).
iterate-nodes (method).
iterate-nodes (method).
key-exists-p (generic function).
keyed-associative-container (class).
make-container (method).
nth-element (method).
print-container (method).
print-container (method).
remove-items-if (method).
remove-items-if (method).
reverse-find (method).
samep (method).
search-for-key (method).
size (method).
some-key-value-p (method).
sort-elements (method).
sort-keys (method).
total-size (method).
count-items (method).
descend-ht (function).
find-or-create-ht (function).
identity-2 (function).
in-item-at? (reader method).
initialize-container (method).
item-key (method).
key-map (reader method).
(setf key-map) (writer method).
make-array-container (function).
make-container-for-contents (method).
make-container-for-contents (method).
make-container-for-contents (method).
maybe-set-initial-element (function).
print-container-summary (method).
sort-container (method).
sparse-array-row-major-index (function).
sparse-array-value-to-index (function).
cl-containers/dev/compatibility.lispbasic-operations.lisp (file).
associative.lisp (file).
dev (module).
collect-elements (method).
collect-elements (method).
collect-elements (method).
collect-elements (method).
collect-key-value (method).
collect-keys (method).
collect-keys (method).
delete-item-at (method).
element-position (method).
empty! (method).
empty-p (method).
empty-p (method).
empty-p (method).
every-element-p (method).
every-element-p (method).
every-element-p (method).
every-item-p (method).
every-item-p (method).
find-item (method).
first-element (method).
first-element (method).
first-element (method).
(setf first-element) (method).
(setf first-element) (method).
(setf first-element) (method).
item-at (method).
item-at (method).
item-at (method).
item-at! (method).
item-at! (method).
item-at-1 (method).
item-at-1 (method).
item-at-1! (method).
iteratable-p (method).
iteratable-p (method).
iteratable-p (method).
iteratable-p (method).
iterate-elements (method).
iterate-elements (method).
iterate-elements (method).
iterate-elements (method).
iterate-elements (method).
iterate-key-value (method).
iterate-key-value (method).
iterate-nodes (method).
iterate-nodes (method).
iterate-nodes (method).
iterate-nodes (method).
iterate-nodes (method).
last-element (method).
last-element (method).
last-element (method).
(setf last-element) (method).
(setf last-element) (method).
(setf last-element) (method).
nth-element (method).
nth-element (method).
nth-element (method).
print-container (method).
reduce-elements (method).
search-for-element (method).
search-for-item (method).
search-for-match (method).
search-for-match (method).
search-for-match (method).
some-element-p (method).
some-element-p (method).
some-element-p (method).
some-item-p (method).
some-item-p (method).
sort-elements (method).
cl-containers/dev/vectors.lispbasic-operations.lisp (file).
dev (module).
bounded-vector-container (class).
delete-first (method).
delete-item (method).
delete-item-at (method).
delete-last (method).
first-element (method).
(setf first-element) (method).
flexible-vector-container (class).
initialize-instance (method).
insert-item (method).
insert-item-at (method).
item-at (method).
item-at! (method).
item-at! (method).
last-element (method).
(setf last-element) (method).
nth-element (method).
samep (method).
size (method).
vector-container (class).
basic-vector-container (class).
resize-vector (function).
vector-container-mixin (class).
cl-containers/dev/quad-tree.lispbasic-operations.lisp (file).
trees.lisp (file).
dev (module).
empty! (method).
empty-p (method).
find-item (method).
insert-item (method).
make-node-for-container (method).
notify-element-of-child-status (generic function).
print-object (method).
quad-tree (class).
(setf size) (writer method).
size (reader method).
bottom-left-child (reader method).
(setf bottom-left-child) (writer method).
bottom-right-child (reader method).
(setf bottom-right-child) (writer method).
four-child-node (class).
node-empty-p (method).
quad-tree-node (class).
top-left-child (reader method).
(setf top-left-child) (writer method).
top-right-child (reader method).
(setf top-right-child) (writer method).
tree (reader method).
(setf tree) (writer method).
cl-containers/dev/heaps.lispbasic-operations.lisp (file).
dev (module).
biggest-item (method).
delete-biggest-item (method).
delete-item (method).
heap-container (class).
initialize-instance (method).
insert-item (method).
insert-item (method).
k-best-heap-container (class).
k-best-number (reader method).
(setf k-best-number) (writer method).
make-node-for-container (method).
print-object (method).
exchange-heap-nodes (method).
heap-node (class).
heap-node-parent (method).
heapify (method).
index (reader method).
(setf index) (writer method).
l-child (method).
l-child-index (method).
node-parent-index (method).
r-child (method).
r-child-index (method).
cl-containers/dev/container-mixins.lispbasic-operations.lisp (file).
dev (module).
collect-elements (method).
element-filter (reader method).
(setf element-filter) (writer method).
iterate-elements (method).
iterate-key-value (method).
filtered-container-mixin (class).
key-filter (reader method).
(setf key-filter) (writer method).
cl-containers/dev/union-find-container.lispbasic-operations.lisp (file).
dev (module).
find-set (method).
graft-nodes (method).
initialize-instance (method).
insert-item (method).
print-object (method).
representative (method).
representative-node (method).
union-find-container (class).
link-nodes (method).
make-set (method).
rank (reader method).
union-find-node (class).
cl-containers/dev/package-container.lispbasic-operations.lisp (file).
dev (module).
exported-symbols-only-p (reader method).
(setf exported-symbols-only-p) (writer method).
iterate-elements (method).
package-container (class).
packages (reader method).
(setf packages) (method).
(setf packages) (method).
present-symbols-only-p (reader method).
(setf present-symbols-only-p) (writer method).
size (method).
bound-symbols-in-package (function).
cl-containers/dev/iterator-api.lispdev (module).
current-element (generic function).
current-element-p (generic function).
finish (generic function).
iterate-forward (generic function).
make-iterator (generic function).
move (generic function).
move-forward (generic function).
move-p (generic function).
advance (generic function).
base-class-for-iteratee (generic function).
class-for-contents-as (generic function).
element-passes-p (generic function).
make-internal-iterator (generic function).
move-forward-to-next-element (generic function).
move-internal (generic function).
open-file-for-iterator (generic function).
print-iterator (generic function).
reset (generic function).
setup-initial-container (generic function).
cl-containers/dev/iterators.lispiterator-api.lisp (file).
basic-operations.lisp (file).
dev (module).
basic-iterator-condition (condition).
collect-containers (function).
current-element (method).
current-element (method).
current-element (method).
current-element (method).
current-element-p (method).
current-element-p (method).
element (method).
element (reader method).
element (method).
element (method).
empty-p (method).
filter (reader method).
filtered-iterator-mixin (class).
finish (method).
forward-iterator (class).
initialize-instance (method).
initialize-instance (method).
initialize-instance (method).
initialize-instance (method).
initialize-instance (method).
iterate-container (method).
iterate-forward (method).
iterate-nodes (method).
iterator (reader method).
list-iterator (class).
make-generator (function).
make-iterator (method).
make-iterator (method).
map-containers (function).
move (method).
move (method).
move (method).
move (method).
move (method).
move (method).
move-forward (method).
move-forward-p (function).
move-p (method).
move-p (method).
move-p (method).
move-p (method).
move-p (method).
move-p (method).
next-element (method).
no-current-element-error (condition).
print-object (method).
unique-value-iterator-mixin (class).
with-iterator (macro).
+iterator-after-end+ (constant).
+iterator-before-beginning+ (constant).
abstract-generator (class).
arithmetic-sequence-generator (class).
array-iterator (class).
basic-filtered-iterator-mixin (class).
basic-generator (class).
basic-iterator (class).
by (reader method).
circular-iterator-mixin (class).
compute-element? (reader method).
element-passes-p (method).
element-passes-p (method).
end (reader method).
finite-arithmetic-sequence-generator (class).
hash-table-iterator (class).
index (reader method).
initial-container (reader method).
iterating-container (reader method).
iterator-position (reader method).
move-forward-to-next-element (method).
print-iterator (method).
print-iterator (method).
reset (method).
reset (method).
reset (method).
reset (method).
setup-initial-container (method).
start (reader method).
transform (reader method).
transformed-element (reader method).
transforming-iterator-mixin (class).
visited (reader method).
cl-containers/dev/file-iterators.lispiterators.lisp (file).
dev (module).
current-element (method).
current-element (method).
current-element (method).
current-element (method).
current-element-p (method).
current-element-p (method).
current-element-p (method).
current-element-p (method).
finish (method).
initialize-instance (method).
initialize-instance (method).
iterator (reader method).
move (method).
move (method).
move (method).
move (method).
move-p (method).
move-p (method).
move-p (method).
move-p (method).
advance (method).
advance (method).
advance (method).
advance (method).
base-class-for-iteratee (method).
basic-stream-iterator (class).
cache (reader method).
characterize-element (generic function).
class-for-contents-as (method).
class-for-contents-as (method).
class-for-contents-as (method).
class-for-contents-as (method).
close? (reader method).
combine-elements (method).
current-char (reader method).
current-chunk (reader method).
current-form (reader method).
current-line (reader method).
delimited-iterator (class).
element-characterizer (reader method).
(setf element-characterizer) (writer method).
file-form-iterator (class).
file-iterator (class).
file-line-iterator (class).
internal-iterator (reader method).
internal-iterator-mixin (class).
iterator-stream (reader method).
line-iterator (class).
make-internal-iterator (method).
move-internal (method).
open-file-for-iterator (method).
open-file-for-iterator (method).
open-file-for-iterator (method).
skip-empty-chunks? (reader method).
(setf skip-empty-chunks?) (writer method).
starting-element (reader method).
(setf starting-element) (writer method).
word-iterator (class).
cl-containers/dev/dynamic-classes.lispdev (module).
add-parameter->dynamic-class (function).
determine-dynamic-class (function).
empty-add-parameter->dynamic-class (function).
empty-all-add-parameter->dynamic-class (function).
existing-subclass (generic function).
find-existing-subclass (function).
find-or-create-class (function).
include-class-dependencies (generic function).
parameter->dynamic-class (function).
(setf parameter->dynamic-class) (function).
*define-class-form* (special variable).
*parameter-dynamic-class-table* (special variable).
add-dynamic-class-for-parameters (function).
class-redundant-p (function).
define-class (function).
dynamic-class-information (function).
map-subclasses (function).
remove-redundant-classes (function).
simple-define-class (function).
simple-define-class-name (function).
superclasses (function).
table¶meter->dynamic-class (function).
type->parameter-table (function).
(setf type->parameter-table) (function).
cl-containers/dev/dynamic-class-defs.lispdynamic-classes.lisp (file).
containers.lisp (file).
dev (module).
existing-subclass (method).
existing-subclass (method).
include-class-dependencies (method).
make-container (method).
*current-iteratee* (special variable).
base-class-for-iteratee (method).
base-class-for-iteratee (method).
base-class-for-iteratee (method).
base-class-for-iteratee (method).
class-for-contents-as (method).
determine-generator-class (function).
determine-iterator-class (function).
Packages are listed by definition order.
metabang.cl-containersA library of container classes and algorithms for Common Lisp.
cl-containers
containers
common-lisp.
abstract-container (class).
abstract-queue (class).
add-parameter->dynamic-class (function).
alist-container (class).
append-item (generic function).
append-new-item (generic function).
array-container (class).
associative-container (class).
associative-container-mixin (class).
bag-container (class).
basic-iterator-condition (condition).
basic-queue (class).
best-element (generic function).
best-node (generic function).
biassociative-container-mixin (class).
biggest-item (generic function).
binary-search-tree (class).
bounded-vector-container (class).
children (generic function).
collect-containers (function).
collect-elements (generic function).
collect-elements-stably (generic function).
collect-items (generic function).
collect-key-value (generic function).
collect-key-value-stably (generic function).
collect-keys (generic function).
collect-nodes (generic function).
collect-pairs (function).
collect-using (function).
collect-window-over-elements (function).
collect-window-over-nodes (function).
container->array (generic function).
container->list (generic function).
container-error (condition).
container-node-mixin (class).
container-uses-nodes-mixin (class).
contents (generic reader).
(setf contents) (generic writer).
contents-as-array-mixin (class).
contents-as-hashtable-mixin (class).
contents-as-list-mixin (class).
count-elements (generic function).
count-elements-if (generic function).
count-using (function).
current-element (generic function).
current-element-p (generic function).
current-item (generic function).
delete-biggest-item (generic function).
delete-element (generic function).
delete-first (generic function).
delete-item (generic function).
delete-item-after (generic function).
delete-item-at (generic function).
delete-item-before (generic function).
delete-item-if (generic function).
delete-last (generic function).
delete-list (generic function).
delete-node (generic function).
dequeue (generic function).
determine-dynamic-class (function).
dimensions (generic function).
dlist-container (class).
dlist-container-node (class).
element-counts (function).
element-filter (generic reader).
(setf element-filter) (generic writer).
element-not-found-error (condition).
element-position (generic function).
empty! (generic function).
empty-add-parameter->dynamic-class (function).
empty-all-add-parameter->dynamic-class (function).
empty-p (generic function).
enqueue (generic function).
ensure-sorted (generic function).
every-element-p (generic function).
every-item-p (generic function).
every-key-value-p (generic function).
existing-subclass (generic function).
exported-symbols-only-p (generic reader).
(setf exported-symbols-only-p) (generic writer).
filtered-iterator-mixin (class).
find-child-node (generic function).
find-element (generic function).
find-existing-subclass (function).
find-item (generic function).
find-node (generic function).
find-or-create-class (function).
find-set (generic function).
find-successor-node (generic function).
find-value (generic function).
finish (generic function).
first-element (generic function).
(setf first-element) (generic function).
first-item (function).
flexible-vector-container (class).
force-sort (generic function).
forward-iterator (class).
graft-nodes (generic function).
heap-container (class).
i-know-my-node-mixin (class).
include-class-dependencies (generic function).
initial-contents-mixin (class).
initial-element (generic reader).
(setf initial-element) (generic writer).
initial-element-fn (generic reader).
inorder-walk (generic function).
insert-item (generic function).
insert-item-after (generic function).
insert-item-at (generic function).
insert-item-before (generic function).
insert-item-ordered (generic function).
insert-item-ordered-about-node (generic function).
insert-list (generic function).
insert-new-item (generic function).
insert-sequence (generic function).
item-at (generic function).
(setf item-at) (generic function).
item-at! (generic function).
item-at-1 (generic function).
(setf item-at-1) (generic function).
item-at-1! (generic function).
iteratable-container-mixin (class).
iteratable-p (generic function).
iterate-children (generic function).
iterate-container (generic function).
iterate-elements (generic function).
iterate-elements-stably (generic function).
iterate-forward (generic function).
iterate-key-value (generic function).
iterate-key-value-stably (generic function).
iterate-keys (generic function).
iterate-left (generic function).
iterate-left-nodes (generic function).
iterate-nodes (generic function).
iterate-right (generic function).
iterate-right-nodes (generic function).
iterate-value-key (generic function).
iterator (generic reader).
k-best-heap-container (class).
k-best-number (generic reader).
(setf k-best-number) (generic writer).
key-exists-p (generic function).
key-value-iteratable-container-mixin (class).
key-value-iteratable-p (generic function).
keyed-associative-container (class).
keyed-bag/set-container (class).
last-element (generic function).
(setf last-element) (generic function).
last-item (function).
left-and-right-nodes-for-item (generic function).
left-node-for-item (generic function).
list-container (class).
list-iterator (class).
make-container (generic function).
make-generator (function).
make-iterator (generic function).
make-node-for-container (generic function).
make-ring-buffer (function).
many-child-node (class).
many-ordered-child-node (class).
many-unordered-child-node (class).
map-containers (function).
map-pairs (function).
map-window-over-elements (function).
map-window-over-nodes (function).
merge-elements (function).
merge-nodes (function).
move (generic function).
move-forward (generic function).
move-forward-p (function).
move-p (generic function).
my-node (generic reader).
(setf my-node) (generic writer).
next-item (generic function).
(setf next-item) (generic writer).
no-current-element-error (condition).
node-counts (function).
non-associative-container-mixin (class).
notify-element-of-child-status (generic function).
nth-element (generic function).
nth-item (generic function).
package-container (class).
packages (generic reader).
(setf packages) (generic function).
parameter->dynamic-class (function).
(setf parameter->dynamic-class) (function).
parent-node-mixin (class).
pop-item (generic function).
postorder-walk (generic function).
predecessor (generic function).
preorder-walk (generic function).
present-symbols-only-p (generic reader).
(setf present-symbols-only-p) (generic writer).
previous-item (generic reader).
(setf previous-item) (generic writer).
print-container (generic function).
priority-queue-on-container (class).
push-item (generic function).
quad-tree (class).
red-black-tree (class).
reduce-container (generic function).
reduce-elements (generic function).
reduce-nodes (generic function).
remove-items-if (generic function).
replace-item (generic function).
representative (generic function).
representative-node (generic function).
reverse-container (generic function).
reverse-find (generic function).
right-node-for-item (generic function).
ring-buffer (class).
ring-buffer-reverse (class).
rooted-tree-container (class).
sample-element (generic function).
sample-elements (generic function).
sample-item (generic function).
sample-unique-elements (generic function).
search-for-element (generic function).
search-for-item (generic function).
search-for-key (generic function).
search-for-match (generic function).
search-for-matching-node (generic function).
search-for-node (generic function).
search-for-node* (generic function).
set-container (class).
simple-associative-container (class).
some-element-p (generic function).
some-item-p (generic function).
some-key-value-p (generic function).
sort-elements (generic function).
sort-keys (generic function).
sorted-dlist-container (class).
sorted-list-container (class).
sparse-array-container (class).
stable-associative-container (class).
stable? (generic reader).
(setf stable?) (generic writer).
stack-container (class).
successor (generic function).
test-container-mixin (class).
union-find-container (class).
unique-elements (generic function).
unique-nodes (generic function).
unique-value-iterator-mixin (class).
update-item (generic function).
vector-container (class).
with-iterator (macro).
%best-helper (function).
%collect-key-value (function).
%container-counts (function).
%every-thing-p (function).
%index (generic function).
%merge-helper (function).
%operate-after-finding (generic function).
%search-for-match (function).
%search-in-container (function).
%some-thing-p (function).
%unique-elements (function).
*current-iteratee* (special variable).
*define-class-form* (special variable).
*parameter-dynamic-class-table* (special variable).
+empty-initial-element+ (special variable).
+iterator-after-end+ (constant).
+iterator-before-beginning+ (constant).
+rbt-color-black+ (constant).
+rbt-color-red+ (constant).
abstract-bag/set-container (class).
abstract-generator (class).
abstract-stack (class).
abstract-tree-container (class).
add-default-item (generic function).
add-dynamic-class-for-parameters (function).
add-initial-contents (generic function).
add-initial-contents-internal (function).
advance (generic function).
arithmetic-sequence-generator (class).
array-container-abstract (class).
array-data (generic reader).
array-iterator (class).
associative-array (class).
associative-container-p (function).
bag/set-container (class).
base-class-for-iteratee (generic function).
basic-filtered-iterator-mixin (class).
basic-generator (class).
basic-initial-contents-mixin (class).
basic-iterator (class).
basic-stream-iterator (class).
basic-vector-container (class).
bottom-left-child (generic reader).
(setf bottom-left-child) (generic writer).
bottom-right-child (generic reader).
(setf bottom-right-child) (generic writer).
bound-symbols-in-package (function).
bounded-container-mixin (class).
bst-node (class).
bst-node-is-left-child (generic function).
bst-node-is-right-child (generic function).
bst-node-replace-child (generic function).
bst-node-set-left-child (generic function).
bst-node-set-right-child (generic function).
buffer-end (generic reader).
buffer-start (generic reader).
by (generic reader).
cache (generic reader).
characterize-element (generic function).
circular-iterator-mixin (class).
class-for-contents-as (generic function).
class-redundant-p (function).
classified-container-mixin (class).
classifier (generic reader).
(setf classifier) (generic writer).
clean-up (generic function).
close? (generic reader).
collector-internal (function).
combine-elements (generic function).
compute-element? (generic reader).
concrete-container (class).
container (generic reader).
container-condition (condition).
container-difference (generic function).
container-dimension (generic function).
container-type (generic reader).
contents-as-sequence-mixin (class).
count-items (generic function).
counter (generic reader).
current-char (generic reader).
current-chunk (generic reader).
current-form (generic reader).
current-line (generic reader).
define-class (function).
delimited-iterator (class).
descend-ht (function).
determine-generator-class (function).
determine-iterator-class (function).
dirty? (generic reader).
dynamic-class-information (function).
element-characterizer (generic reader).
(setf element-characterizer) (generic writer).
element-passes-p (generic function).
empty-node (generic reader).
end (generic reader).
error-if-queue-empty (generic function).
exchange-heap-nodes (generic function).
file-form-iterator (class).
file-iterator (class).
file-line-iterator (class).
filtered-container-mixin (class).
find-or-create-ht (function).
find-successor-item (generic function).
findable-container-mixin (class).
finite-arithmetic-sequence-generator (class).
first-node (generic function).
four-child-node (class).
(setf front-of-queue) (setf expander).
front-of-queue (function).
front-of-queue! (function).
has-children-p (generic function).
has-initial-element-p (generic reader).
hash-table-iterator (class).
heap-node (class).
heap-node-parent (generic function).
heapify (generic function).
height (generic function).
identity-2 (function).
in-item-at? (generic reader).
increment-end (generic function).
index (generic reader).
(setf index) (generic writer).
index-out-of-range-error (condition).
indexed-container-mixin (class).
initial-container (generic reader).
initial-contents-key-value-mixin (class).
initial-element-function (generic reader).
initial-element-mixin (class).
initialize-container (generic function).
inorder-walk-nodes (generic function).
insert-initial-contents-p (generic function).
internal-iterator (generic reader).
internal-iterator-mixin (class).
item-key (generic function).
iterate-nodes-about-node (generic function).
iterating-container (generic reader).
iterator-position (generic reader).
iterator-stream (generic reader).
key (generic reader).
key-does-not-exist-error (condition).
key-filter (generic reader).
(setf key-filter) (generic writer).
key-map (generic reader).
(setf key-map) (generic writer).
keyed-container-mixin (class).
l-child (generic function).
l-child-index (generic function).
last-node (generic function).
left-child (generic reader).
(setf left-child) (generic writer).
line-iterator (class).
link-nodes (generic function).
make-array-container (function).
make-container-for-contents (generic function).
make-initial-element (generic function).
make-internal-iterator (generic function).
make-set (generic function).
map-subclasses (function).
map-window-over-elements-helper (function).
maybe-set-initial-element (function).
message (generic reader).
move-forward-to-next-element (generic function).
move-internal (generic function).
node-empty-p (generic function).
node-parent-index (generic function).
open-file-for-iterator (generic function).
ordered-container-mixin (class).
postorder-walk-nodes (generic function).
preorder-walk-nodes (generic function).
print-container-contents (generic function).
print-container-summary (generic function).
print-iterator (generic function).
quad-tree-node (class).
queue-empty (condition).
queue-header (generic reader).
(setf queue-header) (generic writer).
queue-queue (generic reader).
(setf queue-queue) (generic writer).
r-child (generic function).
r-child-index (generic function).
rank (generic reader).
rb-delete-fixup (generic function).
rbt-color (generic reader).
(setf rbt-color) (generic writer).
rbt-empty-node (class).
record-not-found-error (condition).
red-black-node (class).
reduce-internal (function).
remove-redundant-classes (function).
reset (generic function).
resize-vector (function).
return-empty-initial-element (function).
right-child (generic reader).
(setf right-child) (generic writer).
right-most-child (generic function).
rotate-left (generic function).
rotate-right (generic function).
sample-key (generic function).
searchable-container-mixin (class).
set-dirty-flag (generic function).
set-or-bag (generic reader).
setup-initial-container (generic function).
simple-define-class (function).
simple-define-class-name (function).
skip-empty-chunks? (generic reader).
(setf skip-empty-chunks?) (generic writer).
sort-container (generic function).
sort-update-left (generic function).
sort-update-right (generic function).
sorted-container-mixin (class).
sorter (generic reader).
(setf sorter) (generic writer).
sparse-array-row-major-index (function).
sparse-array-value-to-index (function).
splay-tree (class).
splay-tree-rotate (generic function).
splay-tree-splay (generic function).
start (generic reader).
starting-element (generic reader).
(setf starting-element) (generic writer).
superclasses (function).
table (generic reader).
(setf table) (generic writer).
table¶meter->dynamic-class (function).
(setf tail-of-queue) (setf expander).
tail-of-queue (function).
tail-of-queue! (function).
test (generic reader).
top-left-child (generic reader).
(setf top-left-child) (generic writer).
top-right-child (generic reader).
(setf top-right-child) (generic writer).
transform (generic reader).
transformed-element (generic reader).
transforming-iterator-mixin (class).
tree (generic reader).
(setf tree) (generic writer).
tree-size (generic reader).
(setf tree-size) (generic writer).
tuple-index (function).
two-child-node (class).
type->parameter-table (function).
(setf type->parameter-table) (function).
typed-container-mixin (class).
union-find-node (class).
unordered-container-mixin (class).
update-element (generic function).
use-fixnums? (generic reader).
uses-contents-mixin (class).
value (generic reader).
(setf value) (generic writer).
vector-container-mixin (class).
visited (generic reader).
walk-tree (generic function).
walk-tree-nodes (generic function).
word-iterator (class).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Collects stuff by applying the map-fn to the arguments. Assumes that the map-fn signature has the function to be applied as its last argument.
Moves a windows of size ‘window-size‘ across the elements of ‘container‘, stepping by ‘window-step‘ each time. At each step, it applies function ‘fn‘ to the elements in the current window (as a list).
Moves a windows of size ‘window-size‘ across the elements of ‘container‘, stepping by ‘window-step‘ each time. At each step, it applies function ‘fn‘ to the elements in the current window (as a list).
Counts stuff by applying the map-fn to the arguments. Assumes that the map-fn signature has the function to be applied as its last argument.
Look through all the sub-classes of superclass and see if any of them descend from every class in superclasses.
Try to find a class which is a subclass of root and all of the other ‘classes‘ as well. If no such class exists, then it will be created and returned.
Moves a windows of size ‘window-size‘ across the elements of ‘container‘, stepping by ‘window-step‘ each time. At each step, it applies function ‘fn‘ to the elements in the current window (as a list).
Moves a windows of size ‘window-size‘ across the elements of ‘container‘, stepping by ‘window-step‘ each time. At each step, it applies function ‘fn‘ to the elements in the current window (as a list).
Add an item to the end of an ordered container.
contents-as-list-mixin) item) ¶Add an item to the end of an ordered container unless its already there.
contents-as-list-mixin) item &key test key) ¶heap-container)) ¶many-ordered-child-node)) ¶Returns a possibly filtered and possibly transformed list of the elements in a container. If the container uses nodes, then the elements are the things ’in’ the nodes. Warning: it is possible for the result to share structure with the original container.
filtered-container-mixin) &key filter transform) ¶hash-table) &key filter transform) ¶array) &key filter transform) ¶vector) &key filter transform) ¶list) &key filter transform) ¶sorted-list-container) &key filter transform) ¶iteratable-container-mixin) &key filter transform) ¶uses-contents-mixin) &rest args &key filter transform) ¶iteratable-container-mixin) &key filter transform) ¶Iterate over the keys and values of the container and
return a list of the ones that pass the filter function transformed by
the transform function.
list) &rest args &key filter transform) ¶key-value-iteratable-container-mixin) &rest args &key filter transform) ¶stable-associative-container)) ¶Collects the ‘keys‘ of a container into a list.
The ‘filter‘ and ‘transform‘ arguments should be ‘nil‘ or functions of one argument. If ‘filter‘ is non-nil, then the list returned will contain only ‘keys‘ that return true. If transform is non-nil, then it will be applied to each key that passes the filter.
list) &key filter transform) ¶If the list begins with an atom, then it is treated as a property list; otherwise, it is treated as an associative-list.
hash-table) &key filter transform) ¶associative-container-mixin) &key filter transform) ¶stable-associative-container) &rest args &key filter transform) ¶Returns a possibly filtered and possibly transformed list
of the nodes in a container. If the container uses nodes, then the items are
the nodes. If not, collect-nodes is equivalent to collect-elements.
iteratable-container-mixin) &key filter transform) ¶ring-buffer)) ¶Return list of items.
Items are ordered from oldest to newest if ‘ring-buffer’, or from newest to
oldest if ‘ring-buffer-reverse’.
ring-buffer)) ¶automatically generated reader method
set-container)) ¶automatically generated reader method
bag-container)) ¶automatically generated reader method
many-unordered-child-node)) ¶automatically generated reader method
stack-container)) ¶automatically generated reader method
array-container)) ¶automatically generated reader method
contents-as-hashtable-mixin)) ¶automatically generated reader method
contents-as-list-mixin)) ¶automatically generated reader method
contents-as-array-mixin)) ¶automatically generated reader method
uses-contents-mixin)) ¶automatically generated reader method
many-unordered-child-node)) ¶automatically generated writer method
array-container)) ¶automatically generated writer method
contents-as-hashtable-mixin)) ¶automatically generated writer method
contents-as-list-mixin)) ¶automatically generated writer method
contents-as-array-mixin)) ¶automatically generated writer method
list) item &key key test) ¶iteratable-container-mixin) item &key key test) ¶list) test &key key) ¶iteratable-container-mixin) test &key key) ¶delimited-iterator)) ¶file-form-iterator)) ¶file-line-iterator)) ¶file-iterator)) ¶arithmetic-sequence-generator)) ¶array-iterator)) ¶list-iterator)) ¶transforming-iterator-mixin)) ¶delimited-iterator)) ¶file-form-iterator)) ¶file-line-iterator)) ¶file-iterator)) ¶array-iterator)) ¶basic-iterator)) ¶ring-buffer)) ¶Last item in the ordered container.
For ‘ring-buffer’, it’s the newest item.
For ‘ring-buffer-reverse’, it’s the oldest item.
heap-container)) ¶priority-queue-on-container) item) ¶container-uses-nodes-mixin) thing) ¶Removes (and returns) the first item in an ordered
container.
Behavior is undefined if the container is empty.
ring-buffer-reverse)) ¶ring-buffer)) ¶sorted-list-container)) ¶list-container)) ¶vector-container)) ¶basic-queue)) ¶priority-queue-on-container)) ¶abstract-queue)) ¶heap-container) (node heap-node)) ¶ring-buffer) item) ¶keyed-bag/set-container) item) ¶bag/set-container) item) ¶abstract-bag/set-container) item) ¶sorted-dlist-container) (item i-know-my-node-mixin)) ¶sorted-dlist-container) item) ¶dlist-container) (node dlist-container-node)) ¶dlist-container) item) ¶sorted-list-container) item) ¶list-container) item) ¶splay-tree) item) ¶binary-search-tree) item) ¶binary-search-tree) (node bst-node)) ¶vector-container) item) ¶basic-queue) item) ¶priority-queue-on-container) item) ¶container-uses-nodes-mixin) (item i-know-my-node-mixin)) ¶container-uses-nodes-mixin) item) ¶dlist-container) (node dlist-container-node)) ¶list) &rest indexes) ¶keyed-associative-container) &rest indexes) ¶alist-container) &rest indexes) ¶associative-container) &rest indexes) ¶simple-associative-container) &rest indexes) ¶ring-buffer) &rest indexes) ¶Delete item using FIFO or LIFO index for ring-buffer. Warning: Only the first element of INDEXES is used.
splay-tree) &rest indexes) ¶vector-container) &rest indexes) ¶dlist-container) (node dlist-container-node)) ¶binary-search-tree)) ¶Iterate over the nodes of the tree, deleting them if they match test.
priority-queue-on-container)) ¶iteratable-container-mixin) test) ¶Removes (and returns) the last item in an ordered
container.
Behavior is undefined if the container is empty.
ring-buffer-reverse)) ¶ring-buffer)) ¶vector-container)) ¶Deletes each item in the list from the container.
non-associative-container-mixin) list) ¶splay-tree) (node bst-node)) ¶red-black-tree) (item red-black-node)) ¶binary-search-tree) (node bst-node)) ¶binary-search-tree) (node bst-node)) ¶priority-queue-on-container) item) ¶abstract-queue)) ¶array-container)) ¶associative-array)) ¶sparse-array-container)) ¶automatically generated reader method
filtered-container-mixin)) ¶automatically generated reader method
filtered-container-mixin)) ¶automatically generated writer method
Returns the position of element in container using test and key to match. Key defaults to identity and test defaults to eq.
list) element &key key test) ¶contents-as-sequence-mixin) element &key test key) ¶iteratable-container-mixin) element &key test key) ¶Removes all items from the container and returns nil.
hash-table)) ¶alist-container)) ¶ring-buffer)) ¶abstract-bag/set-container)) ¶dlist-container)) ¶binary-search-tree)) ¶stack-container)) ¶basic-queue)) ¶Empty a queue of all contents.
priority-queue-on-container)) ¶abstract-queue)) ¶stable-associative-container)) ¶contents-as-hashtable-mixin)) ¶contents-as-list-mixin)) ¶contents-as-array-mixin)) ¶Returns t if there are no items in the container.
forward-iterator)) ¶hash-table)) ¶vector)) ¶list)) ¶abstract-bag/set-container)) ¶binary-search-tree)) ¶stack-container)) ¶basic-queue)) ¶priority-queue-on-container)) ¶contents-as-list-mixin)) ¶contents-as-sequence-mixin)) ¶abstract-queue) item) ¶This method ensures that the sorted-list-container is sorted, and then returns the container.
sorted-dlist-container)) ¶sorted-list-container)) ¶array) predicate) ¶vector) predicate) ¶list) predicate) ¶iteratable-container-mixin) (predicate function)) ¶Returns true if every item in the container satisfies the
predicate. Predicate should be a function of one argument for iteratable containers
and a function of two arguments for associative containers.
vector) (predicate function)) ¶list) (predicate function)) ¶iteratable-container-mixin) (predicate function)) ¶associative-container-mixin) predicate) ¶package-container)) ¶automatically generated reader method
package-container)) ¶automatically generated writer method
many-child-node) child &key test key) ¶For now, compare find-item.
priority-queue-on-container) item) ¶container-uses-nodes-mixin) thing) ¶Find item in container using the container’s test
method for comparisons. The test method must take two parameters. The
first will be the item being searched for; the second will be an item
in the container. If the container has a key (keyed-container-mixin),
then the test is performed on the item and the key of each element
in the container. Find-item returns nil if the item is not found and it
returns the element in the container if it is.
quad-tree) (item quad-tree-node)) ¶list) item) ¶keyed-bag/set-container) item) ¶bag/set-container) item) ¶abstract-bag/set-container) item) ¶list-container) item) ¶splay-tree) (node bst-node)) ¶binary-search-tree) (item bst-node)) ¶priority-queue-on-container) item) ¶container-uses-nodes-mixin) item) ¶contents-as-hashtable-mixin) item) ¶contents-as-array-mixin) item) ¶Find node containing thing in container using the container’s test
method for comparisons. The test method must take two parameters. The
first will be the item being searched for; the second will be an item
in the container. If the container has a key (keyed-container-mixin),
then the test is performed on the item and the key of each element
in the container. Find-item returns nil if the thing is not found and it
returns the node in the container if it is. Find-node is the same as find-element
for containers that do not use nodes.
binary-search-tree) item) ¶priority-queue-on-container) item) ¶binary-search-tree) item) ¶bag/set-container) item) ¶contents-as-hashtable-mixin) item) ¶Tell Lisp that you are done with this iterator. Further calls to current-element, etc. will have unspecified behavior and may cause an error.
basic-stream-iterator)) ¶abstract-generator)) ¶array)) ¶vector)) ¶list)) ¶ring-buffer)) ¶Equivalent to ‘first-item’.
dlist-container)) ¶automatically generated reader method
sorted-list-container)) ¶list-container)) ¶binary-search-tree)) ¶vector-container-mixin)) ¶stack-container)) ¶basic-queue)) ¶Returns the first item in a queue without changing the queue.
priority-queue-on-container)) ¶abstract-queue)) ¶iteratable-container-mixin)) ¶array)) ¶vector)) ¶list)) ¶ring-buffer)) ¶dlist-container)) ¶automatically generated writer method
sorted-list-container)) ¶list-container)) ¶binary-search-tree)) ¶vector-container-mixin)) ¶stack-container)) ¶abstract-stack)) ¶basic-queue)) ¶Returns the first item in a queue without changing the queue.
priority-queue-on-container)) ¶iteratable-container-mixin)) ¶This method forces a sort on the next pertinent access of the container.
sorted-dlist-container)) ¶sorted-list-container)) ¶initial-element-mixin)) ¶automatically generated reader method
initial-element-mixin)) ¶automatically generated writer method
initial-element-mixin)) ¶automatically generated reader method
binary-search-tree) walk-fn) ¶Adds item to the container
union-find-container) item) ¶k-best-heap-container) item) ¶heap-container) (node heap-node)) ¶quad-tree) (item quad-tree-node)) ¶ring-buffer) item) ¶keyed-bag/set-container) item) ¶bag/set-container) item) ¶set-container) item) ¶bag-container) item) ¶sorted-dlist-container) (node dlist-container-node)) ¶dlist-container) (node dlist-container-node)) ¶sorted-list-container) item) ¶splay-tree) (node bst-node)) ¶red-black-tree) (item bst-node)) ¶binary-search-tree) (item bst-node)) ¶vector-container) item) ¶stack-container) item) ¶basic-queue) item) ¶Add an item to the queue.
priority-queue-on-container) item) ¶container-uses-nodes-mixin) item) ¶contents-as-list-mixin) item) ¶dlist-container) (node dlist-container-node) (new-node dlist-container-node)) ¶dlist-container) (node dlist-container-node) item) ¶dlist-container) node (new-node dlist-container-node)) ¶dlist-container) node item) ¶Inserts item at the specified index, increasing the index of all following elements
vector-container) item index) ¶dlist-container) (node dlist-container-node) (new-node dlist-container-node)) ¶dlist-container) (node dlist-container-node) item) ¶dlist-container) node item) ¶sorted-dlist-container) new-node) ¶sorted-dlist-container) (new-node dlist-container-node)) ¶sorted-dlist-container) node new-node) ¶sorted-dlist-container) node (new-node dlist-container-node)) ¶sorted-dlist-container) (node dlist-container-node) (new-node dlist-container-node)) ¶Adds each item in the list to the container in an upspecified order.
sorted-list-container) list) ¶list-container) list) ¶non-associative-container-mixin) list) ¶Adds item to the container unless it is already there
searchable-container-mixin) item &key test key) ¶Adds each item in the sequence to the container in an upspecified order.
ordered-container-mixin) (sequence iteratable-container-mixin)) ¶ordered-container-mixin) (sequence list)) ¶ordered-container-mixin) (sequence array)) ¶Returns the item specified by the indexes.
list) &rest indexes) ¶hash-table) &rest indexes) ¶array) &rest indexes) ¶keyed-associative-container) &rest indexes) ¶alist-container) &rest indexes) ¶associative-container) &rest indexes) ¶simple-associative-container) &rest indexes) ¶sparse-array-container) &rest indexes) ¶array-container) &rest indexes) ¶ring-buffer) &rest indexes) ¶Return the ring-buffer element corresponding to the given index.
The indexing is from oldest to newest with a ‘ring-buffer’ and from newest to
oldest with a ‘ring-buffer-reverse’.
Warning: Only the first element of INDEXES is used.
dlist-container) &rest indexes) ¶sorted-list-container) &rest indexes) ¶list-container) &rest indexes) ¶splay-tree) &rest indexes) ¶binary-search-tree) &rest indexes) ¶vector-container-mixin) &rest indices) ¶associative-array) &rest indexes) ¶stable-associative-container) &rest indexes) ¶[Destructively] modifies the item specified by the indexes to the value.
hash-table) &rest indexes) ¶array) value &rest indexes) ¶keyed-associative-container) value &rest indexes) ¶alist-container) value &rest indexes) ¶associative-container) value &rest indexes) ¶simple-associative-container) value &rest indexes) ¶sparse-array-container) value &rest indexes) ¶array-container) value &rest indexes) ¶ring-buffer) value &rest indexes) ¶flexible-vector-container) value &rest indices) ¶vector-container-mixin) value &rest indices) ¶associative-array) value &rest indexes) ¶stable-associative-container) value &rest indexes) ¶list) index) ¶hash-table) index) ¶alist-container) index) ¶simple-associative-container) index) ¶hash-table) value index) ¶alist-container) value index) ¶simple-associative-container) value index) ¶Returns true if thing knows how to iterate-nodes.
hash-table)) ¶array)) ¶vector)) ¶list)) ¶iteratable-container-mixin)) ¶Calls ‘fn‘ on every child of ‘node‘.
many-child-node) fn) ¶forward-iterator) fn) ¶package-container) fn) ¶filtered-container-mixin) fn) ¶hash-table) fn) ¶array) fn) ¶vector) fn) ¶list) fn) ¶null) fn) ¶priority-queue-on-container) fn) ¶container-uses-nodes-mixin) fn) ¶abstract-container) fn) ¶stable-associative-container) fn) ¶basic-iterator) function) ¶filtered-container-mixin) fn) ¶list) function) ¶hash-table) fn) ¶(eql nil)) fn) ¶alist-container) function) ¶contents-as-hashtable-mixin) function) ¶simple-associative-container) function) ¶stable-associative-container) fn) ¶stable-associative-container) fn) ¶alist-container) function) ¶stable-associative-container) fn) ¶contents-as-hashtable-mixin) function) ¶sorted-dlist-container) item fn &optional inclusive?) ¶sorted-dlist-container) (item i-know-my-node-mixin) fn &optional inclusive?) ¶sorted-dlist-container) (item dlist-container-node) fn &optional inclusive?) ¶sorted-dlist-container) item fn) ¶sorted-dlist-container) (item i-know-my-node-mixin) fn) ¶sorted-dlist-container) (item dlist-container-node) fn) ¶Applies function to each node in the container. If the container doesn’t have nodes, then this is equivalent to iterate-elements.
forward-iterator) fn) ¶hash-table) fn) ¶array) fn) ¶vector) fn) ¶list) fn) ¶null) fn) ¶alist-container) function) ¶array-container) fn) ¶ring-buffer) fn) ¶keyed-bag/set-container) fn) ¶bag/set-container) fn) ¶dlist-container) fn) ¶sorted-list-container) fn) ¶binary-search-tree) fn) ¶basic-queue) fn) ¶priority-queue-on-container) fn) ¶associative-array) fn) ¶stable-associative-container) fn) ¶contents-as-hashtable-mixin) fn) ¶contents-as-array-mixin) function) ¶uses-contents-mixin) fn) ¶sorted-dlist-container) item fn &optional inclusive?) ¶sorted-dlist-container) (item i-know-my-node-mixin) fn &optional inclusive?) ¶sorted-dlist-container) (item dlist-container-node) fn &optional inclusive?) ¶sorted-dlist-container) item fn) ¶sorted-dlist-container) (item i-know-my-node-mixin) fn) ¶sorted-dlist-container) (item dlist-container-node) fn) ¶internal-iterator-mixin)) ¶automatically generated reader method
basic-iterator-condition)) ¶k-best-heap-container)) ¶automatically generated reader method
k.
k-best-heap-container)) ¶automatically generated writer method
k.
associative-container-mixin) &rest indexes) ¶Returns true if thing knows how to iterate-nodes.
key-value-iteratable-container-mixin)) ¶array)) ¶vector)) ¶list)) ¶ring-buffer)) ¶Equivalent to ‘last-item’.
dlist-container)) ¶automatically generated reader method
list-container)) ¶binary-search-tree)) ¶vector-container-mixin)) ¶array)) ¶vector)) ¶list)) ¶ring-buffer)) ¶dlist-container)) ¶automatically generated writer method
list-container)) ¶binary-search-tree)) ¶vector-container-mixin)) ¶sorted-dlist-container) item) ¶sorted-dlist-container) item) ¶Creates a new container of type class using the additional arguments (args).
list) &rest args) ¶(eql metabang.cl-containers:array-container)) &rest args) ¶(eql metabang.cl-containers:ring-buffer)) &rest args) ¶symbol) &rest args) ¶basic-iterator) &rest args &key &allow-other-keys) ¶heap-container) element &key) ¶dlist-container) item &rest args) ¶red-black-tree) item &key) ¶binary-search-tree) item &key) ¶i-know-my-node-mixin) &key) ¶delimited-iterator) (direction (eql :forward))) ¶file-form-iterator) (direction (eql :forward))) ¶file-line-iterator) (direction (eql :forward))) ¶file-iterator) (direction (eql :forward))) ¶arithmetic-sequence-generator) (direction (eql :forward))) ¶array-iterator) (direction (eql :forward))) ¶list-iterator) (direction (eql :forward))) ¶basic-filtered-iterator-mixin) (direction (eql :forward))) ¶transforming-iterator-mixin) direction) ¶basic-iterator) direction) ¶forward-iterator)) ¶delimited-iterator) (direction (eql :forward))) ¶file-form-iterator) (direction (eql :forward))) ¶file-line-iterator) (direction (eql :forward))) ¶file-iterator) (direction (eql :forward))) ¶finite-arithmetic-sequence-generator) (direction (eql :forward))) ¶arithmetic-sequence-generator) (direction (eql :forward))) ¶array-iterator) (direction (eql :forward))) ¶list-iterator) (direction (eql :forward))) ¶circular-iterator-mixin) (direction (eql :forward))) ¶abstract-generator) direction) ¶i-know-my-node-mixin)) ¶automatically generated reader method
i-know-my-node-mixin)) ¶automatically generated writer method
ring-buffer)) ¶dlist-container-node)) ¶automatically generated reader method
dlist-container-node)) ¶automatically generated writer method
This is called to allow the element to know its
status as a child. Useful for quad tree elements, where an element’s position
relative to its parent could be relevant to the element. Status is one of:
:TOP-LEFT, :TOP-RIGHT, :BOTTOM-LEFT, :BOTTOM-RIGHT or :ROOT
Returns the nth element in the container’s ’natural’ order.
array) (index number)) ¶vector) (index number)) ¶list) (n integer)) ¶array-container) (index integer)) ¶list-container) (index integer)) ¶vector-container-mixin) (index integer)) ¶iteratable-container-mixin) (index integer)) ¶integer)) ¶Returns the nth item in the container’s ’natural’ order. This is the same as nth-element unless the contaienr is of type container-uses-nodes-mixin.
package-container)) ¶automatically generated reader method
package-container)) ¶package-container)) ¶stack-container)) ¶binary-search-tree) walk-fn) ¶Return the item that comes *before* item in the container. Only makes sense for sorted containers. Raises an element-not-found-error if the item isn’t present in the container.
dlist-container) (node dlist-container-node)) ¶binary-search-tree) (node bst-node)) ¶container-uses-nodes-mixin) item) ¶binary-search-tree) walk-fn) ¶package-container)) ¶automatically generated reader method
package-container)) ¶automatically generated writer method
dlist-container-node)) ¶automatically generated reader method
dlist-container-node)) ¶automatically generated writer method
Prints the contents of container (using PRINT). Returns the container.
hash-table) &optional stream) ¶stable-associative-container) &optional stream) ¶associative-container) &optional stream) ¶sorted-list-container) &optional stream) ¶list-container) &optional stream) ¶iteratable-container-mixin) &optional stream) ¶abstract-stack) item) ¶iteratable-container-mixin) function &rest args &key key initial-value start end) ¶list) function &key key initial-value start end) ¶iteratable-container-mixin) function &key key initial-value start end) ¶iteratable-container-mixin) function &key key initial-value start end) ¶Removes items from a container that satisfy the test. The container is returned.
associative-container-mixin) test) ¶iteratable-container-mixin) test) ¶dlist-container) (node dlist-container-node) (start-item dlist-container-node) &key length finish-item) ¶dlist-container) (node dlist-container-node) item &key length finish-item) ¶union-find-container) item) ¶union-find-container) item) ¶Destructively alters the elements/nodes of an ordered container so that they are reversed.
ordered-container-mixin)) ¶Finds the key in the associative-container whose value is VALUE.
alist-container) value &key test) ¶contents-as-hashtable-mixin) value &key test) ¶sorted-dlist-container) item) ¶Return an element of the container uniformly at random using the generator.
Return a list of count elements of the container uniformly at random using the generator. The sampling is done _with_ replacement.
Return an item of the container uniformly at random using
the generator. Same as sample-element unless container is of type container-uses-nodes-mixin.
Return a list of count elements from the container sampled uniformly at random without replacement.
list) item &key test key) ¶iteratable-container-mixin) item &key test key) ¶Hunt for the item in the container. Key and Test are as in member.
list) item &key test key) ¶bag/set-container) item &key test key) ¶abstract-bag/set-container) item &key test key) ¶stack-container) item &key test key) ¶contents-as-hashtable-mixin) item &key test key) ¶contents-as-list-mixin) item &key test key) ¶contents-as-array-mixin) item &key test key) ¶iteratable-container-mixin) item &key test key) ¶associative-container-mixin) key-to-find &key test key) ¶Hunt for an item in the container that satisfies the predicate. Key is as in count-if.
array) predicate &key key) ¶vector) predicate &key key) ¶list) predicate &key key) ¶abstract-bag/set-container) predicate &key key) ¶iteratable-container-mixin) predicate &key key) ¶iteratable-container-mixin) predicate &key key) ¶container-uses-nodes-mixin) (item container-node-mixin) &key test key) ¶container-uses-nodes-mixin) item &key test key) ¶iteratable-container-mixin) item &key test key) ¶container-uses-nodes-mixin) (item container-node-mixin) &key test key) ¶container-uses-nodes-mixin) item &key test key) ¶array) predicate) ¶vector) predicate) ¶list) predicate) ¶iteratable-container-mixin) (predicate function)) ¶Returns the first item in the container for which predicate
holds. Predicate should be a function of one argument for iteratable containers
and a function of two arguments for associative containers.
vector) (predicate function)) ¶list) (predicate function)) ¶iteratable-container-mixin) (predicate function)) ¶associative-container-mixin) predicate) ¶sequence) sorter &key key) ¶alist-container) sorter &key key) ¶contents-as-sequence-mixin) sorter &key key) ¶alist-container) sorter &key key) ¶sorted-list-container)) ¶automatically generated reader method
sorted-list-container)) ¶automatically generated writer method
Return the item that comes after item in the container. Only makes sense for sorted containers. Raises an element-not-found-error if the item isn’t present in the container.
dlist-container) (node dlist-container-node)) ¶binary-search-tree) (node bst-node)) ¶container-uses-nodes-mixin) item) ¶list) &key key) ¶iteratable-container-mixin) &key key) ¶list) &key key) ¶iteratable-container-mixin) &key key) ¶sorted-dlist-container) item) ¶sorted-dlist-container) (item i-know-my-node-mixin)) ¶sorted-dlist-container) (node dlist-container-node)) ¶iteratable-container-mixin) function &key key test filter) ¶metabang.utilities.
container-node-mixin)) ¶automatically generated writer method
metabang.utilities.
container-node-mixin)) ¶automatically generated reader method
metabang.utilities.
unique-value-iterator-mixin)) ¶metabang.utilities.
element-not-found-error)) ¶metabang.utilities.
arithmetic-sequence-generator)) ¶automatically generated reader method
metabang.utilities.
abstract-generator)) ¶metabang.utilities.
abstract-generator)) ¶metabang.utilities.
typed-container-mixin)) ¶automatically generated reader method
metabang.utilities.
filtered-iterator-mixin)) ¶automatically generated reader method
metabang.utilities.
heap-container) &key) ¶bounded-vector-container) &rest args &key size initial-size) ¶filtered-iterator-mixin) &key) ¶sparse-array-container) &key dimensions) ¶priority-queue-on-container) &rest args &key container-type &allow-other-keys) ¶red-black-tree) &key) ¶unique-value-iterator-mixin) &key) ¶keyed-bag/set-container) &key) ¶keyed-associative-container) &key) ¶associative-container) &key test) ¶stable-associative-container) &rest args &key container-type &allow-other-keys) ¶basic-initial-contents-mixin) &key initial-contents) ¶arithmetic-sequence-generator) &key) ¶red-black-node) &key parent left-child right-child empty-p) ¶initial-element-mixin) &key) ¶union-find-node) &key) ¶hash-table-iterator) &key) ¶uses-contents-mixin) &rest args &key &allow-other-keys) ¶associative-array) &key test dimensions max-size) ¶basic-iterator) &key &allow-other-keys) ¶basic-stream-iterator) &key container) ¶delimited-iterator) &key container &allow-other-keys) ¶abstract-generator)) ¶metabang.utilities.
parent-node-mixin)) ¶automatically generated writer method
metabang.utilities.
parent-node-mixin)) ¶automatically generated reader method
metabang.utilities.
two-child-node)) ¶automatically generated writer method
metabang.utilities.
two-child-node)) ¶automatically generated reader method
metabang.utilities.
dlist-container-node) stream) ¶quad-tree-node) stream) ¶red-black-node) stream) ¶union-find-node) stream) ¶abstract-generator) stream) ¶rooted-tree-container)) ¶automatically generated writer method
metabang.utilities.
root.
rooted-tree-container)) ¶automatically generated reader method
metabang.utilities.
root.
associative-container-mixin) (c2 associative-container-mixin)) ¶metabang.utilities.
list-container) (l2 list)) ¶metabang.utilities.
list) (l2 list-container)) ¶metabang.utilities.
list-container) (l2 list-container)) ¶metabang.utilities.
vector-container-mixin) (container-2 vector-container-mixin)) ¶metabang.utilities.
binary-search-tree)) ¶metabang.utilities.
quad-tree)) ¶automatically generated writer method
metabang.utilities.
size.
quad-tree)) ¶automatically generated reader method
metabang.utilities.
size.
contents-as-array-mixin)) ¶metabang.utilities.
package-container)) ¶metabang.utilities.
basic-queue)) ¶metabang.utilities.
contents-as-hashtable-mixin)) ¶metabang.utilities.
ring-buffer)) ¶metabang.utilities.
priority-queue-on-container)) ¶metabang.utilities.
stack-container)) ¶metabang.utilities.
alist-container)) ¶metabang.utilities.
stable-associative-container)) ¶metabang.utilities.
dlist-container)) ¶automatically generated writer method
metabang.utilities.
size.
dlist-container)) ¶automatically generated reader method
metabang.utilities.
size.
vector-container)) ¶metabang.utilities.
bag/set-container)) ¶metabang.utilities.
contents-as-sequence-mixin)) ¶metabang.utilities.
abstract-bag/set-container)) ¶metabang.utilities.
contents-as-array-mixin)) ¶metabang.utilities.
sparse-array-container)) ¶metabang.utilities.
ring-buffer)) ¶automatically generated reader method
metabang.utilities.
condition.
container-condition.
error.
basic-iterator-condition.
error.
Inherited by all container classes, this is a good place to put those pesky superclasses you need everyone to inherit.
abstract-tree-container.
basic-initial-contents-mixin.
bounded-container-mixin.
container-uses-nodes-mixin.
findable-container-mixin.
indexed-container-mixin.
initial-element-mixin.
keyed-container-mixin.
non-associative-container-mixin.
package-container.
searchable-container-mixin.
typed-container-mixin.
uses-contents-mixin.
vector-container-mixin.
iterate-elements.
make-load-form.
(function equal)
:test
A simple FIFO queue implemented as a list with extra bookkeeping for efficiency.
delete-item.
delete-item.
delete-item-if.
delete-node.
delete-node.
empty!.
empty-p.
find-item.
find-node.
find-successor-item.
find-successor-node.
(setf first-element).
first-element.
first-node.
height.
inorder-walk.
inorder-walk-nodes.
insert-item.
item-at.
iterate-nodes.
(setf last-element).
last-element.
last-node.
make-node-for-container.
postorder-walk.
postorder-walk-nodes.
predecessor.
preorder-walk.
preorder-walk-nodes.
rotate-left.
rotate-right.
size.
splay-tree-rotate.
splay-tree-rotate.
splay-tree-splay.
splay-tree-splay.
successor.
(setf tree-size).
tree-size.
update-element.
| Initarg | Value |
|---|---|
:key | (quote identity) |
:test | (quote eq) |
:sorter | (quote <) |
0
:tree-size
(setf element).
element.
make-load-form.
search-for-node.
search-for-node*.
metabang.utilities.
:element
(quote nil)
A double-linked list
delete-item.
delete-item.
delete-item-after.
delete-item-before.
empty!.
(setf first-element).
first-element.
insert-item.
insert-item-after.
insert-item-after.
insert-item-after.
insert-item-after.
insert-item-before.
insert-item-before.
insert-item-before.
item-at.
iterate-nodes.
(setf last-element).
last-element.
make-node-for-container.
predecessor.
replace-item.
replace-item.
(setf size).
size.
successor.
:first-element
:last-element
A double-linked list node
delete-item.
delete-item-after.
delete-item-before.
insert-item.
insert-item.
insert-item-after.
insert-item-after.
insert-item-after.
insert-item-before.
insert-item-before.
insert-item-ordered.
insert-item-ordered-about-node.
insert-item-ordered-about-node.
iterate-left.
iterate-left-nodes.
iterate-nodes-about-node.
iterate-right.
iterate-right-nodes.
(setf next-item).
next-item.
predecessor.
(setf previous-item).
previous-item.
print-object.
replace-item.
replace-item.
sort-update-left.
sort-update-right.
successor.
update-item.
:next-item
:previous-item
metabang.utilities.
| Initarg | Value |
|---|---|
:sorter | (function >) |
:initial-size | 0 |
:my-node
abstract-bag/set-container.
abstract-stack.
array-container.
basic-queue.
binary-search-tree.
contents-as-array-mixin.
contents-as-sequence-mixin.
dlist-container.
forward-iterator.
key-value-iteratable-container-mixin.
many-child-node.
package-container.
priority-queue-on-container.
quad-tree.
ring-buffer.
stable-associative-container.
add-initial-contents.
best-item.
collect-elements.
collect-elements-stably.
collect-nodes.
count-elements.
count-elements-if.
count-items.
delete-item-if.
element-position.
every-element-p.
every-item-p.
(setf first-element).
first-element.
insert-sequence.
iteratable-p.
nth-element.
print-container.
reduce-container.
reduce-elements.
reduce-nodes.
remove-items-if.
search-for-element.
search-for-item.
search-for-match.
search-for-matching-node.
search-for-node.
some-element-p.
some-item-p.
unique-elements.
unique-nodes.
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 ’<’.
| Initarg | Value |
|---|---|
:sorter | (function >) |
:k | 1 |
1
:k
| Initarg | Value |
|---|---|
:test | (function eq) |
:key | (function identity-2) |
metabang.cl-containers:associative-container
:in-item-at?
This slot is read-only.
A node with many ordered children is a vector
Children are unordered
:contents
A non associative container should implement at least empty-p, empty, insert-item and delete-item.
A mixin for nodes with parent pointers
metabang.utilities.
:parent
| Initarg | Value |
|---|---|
:container-type | (quote binary-search-tree) |
| Initarg | Value |
|---|---|
:key | (function identity) |
:test | (function eq) |
:sorter | (function <) |
metabang.cl-containers::red-black-node
:empty-node
This slot is read-only.
%index.
buffer-end.
buffer-start.
container->list.
contents.
current-item.
delete-first.
delete-item.
delete-item-at.
delete-last.
empty!.
(setf first-element).
first-element.
increment-end.
insert-item.
item-at.
item-at!.
iterate-nodes.
(setf last-element).
last-element.
next-item.
size.
total-size.
0
This slot is read-only.
0
This slot is read-only.
metabang.utilities.
:total-size
This slot is read-only.
Base class of all trees with roots.
A persistently sorted double-linked list
delete-item.
delete-item.
ensure-sorted.
force-sort.
insert-item.
insert-item-ordered.
insert-item-ordered.
insert-item-ordered-about-node.
insert-item-ordered-about-node.
insert-item-ordered-about-node.
iterate-left.
iterate-left.
iterate-left.
iterate-left-nodes.
iterate-left-nodes.
iterate-left-nodes.
iterate-right.
iterate-right.
iterate-right.
iterate-right-nodes.
iterate-right-nodes.
iterate-right-nodes.
left-and-right-nodes-for-item.
left-node-for-item.
right-node-for-item.
sort-update-left.
sort-update-right.
update-item.
update-item.
update-item.
| Initarg | Value |
|---|---|
:size | 0 |
A list container that keeps its items sorted as needed. This uses ’sort’ so it best for small containers.
clean-up.
collect-elements.
delete-first.
delete-item.
dirty?.
ensure-sorted.
(setf first-element).
first-element.
force-sort.
insert-item.
insert-list.
item-at.
iterate-nodes.
iterate-nodes-about-node.
iterate-nodes-about-node.
iterate-nodes-about-node.
print-container.
set-dirty-flag.
(setf stable?).
stable?.
:stable?
| Initarg | Value |
|---|---|
:container-type | (quote list-container) |
:container-type
This slot is read-only.
The name of the form used to define a class. Usually, this will be bound to ’defclass* but when we are using GBBOpen, it will probably be bound to define-class or define-class*.
front-of-queue (function).
front-of-queue! (function).
tail-of-queue (function).
tail-of-queue! (function).
Returns true if the container is associative. Tries to work for native Lisp containers too.
Define a class with all the bells and whistles on the fly... See simple-define-class for the simpler version.
Applies fn to each subclass of class. If proper? is true, then
the class itself is not included in the mapping. Proper? defaults to nil.
Define a class on the fly...
Returns a list of superclasses of thing. Thing can be a class, object or symbol naming a class. The list of classes returned is ’proper’; it does not include the class itself.
ring-buffer) index) ¶Return index converted to internal FIFO index, where items are ordered from oldest to newest.
ring-buffer-reverse) index) ¶Return index converted to internal LIFO index, where items are ordered from newest to oldest.
container-uses-nodes-mixin) element operation) ¶stable-associative-container) &rest indexes) ¶initial-contents-key-value-mixin) initial-contents) ¶initial-contents-mixin) (initial-contents iteratable-container-mixin)) ¶initial-contents-mixin) (initial-contents list)) ¶delimited-iterator)) ¶file-form-iterator)) ¶file-line-iterator)) ¶file-iterator)) ¶associative-array)) ¶automatically generated reader method
uses-contents-mixin)) ¶hash-table)) ¶array)) ¶list)) ¶pathname)) ¶four-child-node)) ¶automatically generated reader method
four-child-node)) ¶automatically generated writer method
four-child-node)) ¶automatically generated reader method
four-child-node)) ¶automatically generated writer method
Is this node the left child of its parent?
Is this node the right child of its parent?
Replace the child of this node.
Set new-left as the left child of node
Set new-right as the right child of node
ring-buffer)) ¶automatically generated reader method
ring-buffer)) ¶automatically generated reader method
arithmetic-sequence-generator)) ¶automatically generated reader method
by.
delimited-iterator)) ¶automatically generated reader method
Examines element in the context of iterator and returns a value describing how to treat it. This can be one of:
* nil or :appended - append element to the current chunk
* t or :delimiter - complete the current chunk and start a new one (ignore element)
* :ignored - act as if this element was never seen
* :start-new - complete the current chunk and start a new one with this element
delimited-iterator) thing) ¶(eql :words))) ¶(eql :lines))) ¶pathname) (as (eql :forms))) ¶pathname) (as (eql :lines))) ¶classified-container-mixin)) ¶automatically generated reader method
classified-container-mixin)) ¶automatically generated writer method
sorted-list-container)) ¶basic-stream-iterator)) ¶automatically generated reader method
delimited-iterator)) ¶transforming-iterator-mixin)) ¶automatically generated reader method
priority-queue-on-container)) ¶automatically generated reader method
container-condition)) ¶associative-array) dimension) ¶stack-container)) ¶automatically generated reader method
iteratable-container-mixin) item &key key test) ¶stable-associative-container)) ¶automatically generated reader method
file-iterator)) ¶automatically generated reader method
delimited-iterator)) ¶automatically generated reader method
file-form-iterator)) ¶automatically generated reader method
file-line-iterator)) ¶automatically generated reader method
sorted-list-container)) ¶automatically generated reader method
delimited-iterator)) ¶automatically generated reader method
delimited-iterator)) ¶automatically generated writer method
and.
:most-specific-first
unique-value-iterator-mixin)) ¶filtered-iterator-mixin)) ¶red-black-tree)) ¶automatically generated reader method
finite-arithmetic-sequence-generator)) ¶automatically generated reader method
end.
abstract-queue) &optional message &rest rest) ¶heap-node) (n2 heap-node) (heap heap-container)) ¶binary-search-tree) (item bst-node)) ¶Find the item equal to or the next greater than item
binary-search-tree)) ¶many-child-node)) ¶initial-element-mixin)) ¶automatically generated reader method
heap-node) (heap heap-container)) ¶heap-container) (node heap-node)) ¶binary-search-tree)) ¶two-child-node)) ¶keyed-associative-container)) ¶automatically generated reader method
ring-buffer)) ¶array-iterator)) ¶automatically generated reader method
heap-node)) ¶automatically generated reader method
index-out-of-range-error)) ¶basic-iterator)) ¶automatically generated reader method
initial-element-mixin)) ¶automatically generated reader method
alist-container)) ¶binary-search-tree) walk-fn) ¶Returns true if this container type should rely on the default behavior of basic-initial-contents-mixin.
basic-initial-contents-mixin)) ¶contents-as-array-mixin)) ¶delimited-iterator)) ¶automatically generated reader method
keyed-associative-container) &rest indexes) ¶sorted-list-container) item left-fn right-fn) ¶sorted-list-container) (item i-know-my-node-mixin) left-fn right-fn) ¶sorted-list-container) (node dlist-container-node) left-fn right-fn) ¶basic-iterator)) ¶automatically generated reader method
abstract-generator)) ¶automatically generated reader method
basic-stream-iterator)) ¶automatically generated reader method
keyed-container-mixin)) ¶automatically generated reader method
key.
filtered-container-mixin)) ¶automatically generated reader method
filtered-container-mixin)) ¶automatically generated writer method
keyed-associative-container)) ¶automatically generated reader method
keyed-bag/set-container)) ¶automatically generated reader method
keyed-associative-container)) ¶automatically generated writer method
heap-node) (heap heap-container)) ¶binary-search-tree)) ¶two-child-node)) ¶automatically generated reader method
two-child-node)) ¶automatically generated writer method
Creates a sub-container to be used as contents for a super-container.
alist-container) &rest args) ¶sparse-array-container) &rest args) ¶array-container) &rest args) ¶abstract-bag/set-container) &rest args) ¶stack-container) &rest args) ¶contents-as-hashtable-mixin) &rest args) ¶contents-as-list-mixin) &rest args) ¶contents-as-array-mixin) &rest args) ¶initial-element-mixin)) ¶delimited-iterator) container) ¶queue-empty)) ¶basic-iterator)) ¶delimited-iterator) (direction (eql :forward))) ¶quad-tree-node)) ¶red-black-node)) ¶(eql nil))) ¶basic-stream-iterator) (filename stream)) ¶basic-stream-iterator) (filename pathname)) ¶basic-stream-iterator) (filename string)) ¶binary-search-tree) walk-fn) ¶binary-search-tree) walk-fn) ¶array-container) stream) ¶basic-iterator) stream) ¶abstract-generator) stream) ¶basic-queue)) ¶automatically generated reader method
basic-queue)) ¶automatically generated writer method
basic-queue)) ¶automatically generated reader method
basic-queue)) ¶automatically generated writer method
heap-node) (heap heap-container)) ¶union-find-node)) ¶automatically generated reader method
rank.
red-black-tree) (x red-black-node)) ¶red-black-node)) ¶automatically generated reader method
red-black-node)) ¶automatically generated writer method
hash-table-iterator)) ¶array-iterator)) ¶list-iterator)) ¶abstract-generator)) ¶two-child-node)) ¶automatically generated reader method
two-child-node)) ¶automatically generated writer method
Walk down the right side of the tree until a leaf node is found, then return that node
binary-search-tree) (x two-child-node)) ¶binary-search-tree) (x two-child-node)) ¶Return an element from of the keys of the associative container uniformly at random using the generator.
sorted-list-container) flag) ¶bag/set-container)) ¶automatically generated reader method
basic-iterator)) ¶delimited-iterator)) ¶automatically generated reader method
delimited-iterator)) ¶automatically generated writer method
uses-contents-mixin) sorter key-fn) ¶sorted-dlist-container) (node dlist-container-node)) ¶sorted-dlist-container) (node dlist-container-node)) ¶sorted-container-mixin)) ¶automatically generated reader method
sorted-container-mixin)) ¶automatically generated writer method
rotate the node (and maybe the parent) until the node is the root of the tree
binary-search-tree) (node bst-node)) ¶binary-search-tree) item) ¶Preform the splay operation on the tree about this node rotating the node until it becomes the root
binary-search-tree) item) ¶binary-search-tree) (node bst-node)) ¶arithmetic-sequence-generator)) ¶automatically generated reader method
delimited-iterator)) ¶automatically generated reader method
delimited-iterator)) ¶automatically generated writer method
record-not-found-error)) ¶record-not-found-error)) ¶test-container-mixin)) ¶automatically generated reader method
test.
four-child-node)) ¶automatically generated reader method
four-child-node)) ¶automatically generated writer method
four-child-node)) ¶automatically generated reader method
four-child-node)) ¶automatically generated writer method
transforming-iterator-mixin)) ¶automatically generated reader method
transforming-iterator-mixin)) ¶automatically generated reader method
binary-search-tree)) ¶automatically generated reader method
binary-search-tree)) ¶automatically generated writer method
splay-tree) value &rest indexes) ¶binary-search-tree) value &rest indexes) ¶sparse-array-container)) ¶automatically generated reader method
record-not-found-error)) ¶record-not-found-error)) ¶unique-value-iterator-mixin)) ¶automatically generated reader method
rbt-empty-node) walk-fn &optional mode) ¶Special case...
(eql nil)) walk-fn &optional mode) ¶Special case...
rbt-empty-node) walk-fn &optional mode) ¶Special case...
(eql nil)) walk-fn &optional mode) ¶Special case...
condition.
metabang.cl-containers::+iterator-before-beginning+
This slot is read-only.
:set
:set-or-bag
This slot is read-only.
common-lisp.
:stream
This slot is read-only.
bst-node-is-left-child.
bst-node-is-right-child.
bst-node-replace-child.
bst-node-set-left-child.
bst-node-set-left-child.
bst-node-set-right-child.
bst-node-set-right-child.
delete-item.
delete-node.
delete-node.
delete-node.
find-item.
find-item.
find-successor-item.
(setf first-element).
first-element.
first-node.
insert-item.
insert-item.
insert-item.
(setf last-element).
last-element.
last-node.
node-empty-p.
predecessor.
print-object.
right-most-child.
size.
splay-tree-rotate.
splay-tree-splay.
successor.
(setf tree).
tree.
walk-tree.
walk-tree-nodes.
A classified container returns some value appropriate to the specific container class. For example, a quad tree is of the type classified-container-mixin, and the classifier returns one of :TOP-LEFT, :TOP-RIGHT, :BOTTOM-LEFT or :BOTTOM-RIGHT
(function <)
:classifier
Inherited by all container classes that can/should be instantiated using make-container.
alist-container.
array-container.
associative-array.
associative-container.
bag-container.
bag/set-container.
basic-queue.
binary-search-tree.
bounded-vector-container.
dlist-container.
list-container.
priority-queue-on-container.
quad-tree.
ring-buffer.
set-container.
simple-associative-container.
sorted-list-container.
sparse-array-container.
stack-container.
vector-container.
advance.
cache.
characterize-element.
combine-elements.
current-chunk.
current-element.
current-element-p.
(setf element-characterizer).
element-characterizer.
initialize-instance.
internal-iterator.
make-internal-iterator.
move.
move-internal.
move-p.
(setf skip-empty-chunks?).
skip-empty-chunks?.
(setf starting-element).
starting-element.
(make-array 20 :element-type (quote character) :fill-pointer 0 :adjustable t)
This slot is read-only.
This slot is read-only.
This slot is read-only.
(quote metabang.utilities:whitespacep)
:element-characterizer
t
:skip-empty-chunks?
This slot is read-only.
This slot is read-only.
This slot is read-only.
:index
:initial-element
:initial-element-fn, :initial-element-function
This slot is read-only.
This slot is read-only.
key.
| Initarg | Value |
|---|---|
:element-characterizer | (lambda (ch) (or (eq ch
) (eq ch
) (eq ch
))) |
Subclass the empty node so that it’s possible to quickly determine if a node is empty using TYPEP.
(function <)
:sorter
| Initarg | Value |
|---|---|
:key | (quote identity) |
:test | (quote eq) |
:sorter | (quote <) |
metabang.utilities.
:element-type
This slot is read-only.
| Initarg | Value |
|---|---|
:element-characterizer | (quote whitespacep) |
| Jump to: | %
(
A B C D E F G H I K L M N O P Q R S T U V W |
|---|
| Jump to: | %
(
A B C D E F G H I K L M N O P Q R S T U V W |
|---|
| Jump to: | *
+
A B C D E F H I K L M N P Q R S T U V |
|---|
| Jump to: | *
+
A B C D E F H I K L M N P Q R S T U V |
|---|
| Jump to: | A B C D E F H I K L M N O P Q R S T U V W |
|---|
| Jump to: | A B C D E F H I K L M N O P Q R S T U V W |
|---|