The cl-data-structures Reference Manual

This is the cl-data-structures Reference Manual, version 1.3.0, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Sep 15 03:52:55 2024 GMT+0.

Table of Contents


1 Introduction


2 Systems

The main system appears first, followed by any subsystem dependency.


2.1 cl-data-structures

Data structures, ranges, ranges algorithms.

Maintainer

Marek Kochanowicz

Author

Marek Kochanowicz

Home Page

https://github.com/sirherrbatka/cl-data-structures

License

BSD simplified

Version

1.3.0

Dependencies
  • iterate (system).
  • alexandria (system).
  • serapeum (system).
  • documentation-utils-extensions (system).
  • more-conditions (system).
  • closer-mop (system).
  • lparallel (system).
  • flexichain (system).
  • metabang-bind (system).
  • bordeaux-threads (system).
  • uiop (system).
  • cl-ppcre (system).
  • trivial-garbage (system).
Source

cl-data-structures.asd.

Child Components

3 Modules

Modules are listed depth-first from the system components tree.


3.1 cl-data-structures/utils

Dependency

package.lisp (file).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.2 cl-data-structures/api

Dependency

utils (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.3 cl-data-structures/adapters

Dependency

api (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.4 cl-data-structures/common

Dependency

adapters (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.5 cl-data-structures/common/abstract

Source

cl-data-structures.asd.

Parent Component

common (module).

Child Components

3.6 cl-data-structures/common/2-3-tree

Source

cl-data-structures.asd.

Parent Component

common (module).

Child Components

3.7 cl-data-structures/common/hamt

Source

cl-data-structures.asd.

Parent Component

common (module).

Child Components

3.8 cl-data-structures/common/rrb

Source

cl-data-structures.asd.

Parent Component

common (module).

Child Components

3.9 cl-data-structures/common/skip-list

Source

cl-data-structures.asd.

Parent Component

common (module).

Child Components

3.10 cl-data-structures/common/egnat

Source

cl-data-structures.asd.

Parent Component

common (module).

Child Components

3.11 cl-data-structures/dicts

Dependency

common (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.12 cl-data-structures/dicts/skip-list

Source

cl-data-structures.asd.

Parent Component

dicts (module).

Child Component

api.lisp (file).


3.13 cl-data-structures/dicts/hamt

Source

cl-data-structures.asd.

Parent Component

dicts (module).

Child Components

3.14 cl-data-structures/dicts/srrb

Source

cl-data-structures.asd.

Parent Component

dicts (module).

Child Components

3.15 cl-data-structures/sequences

Dependency

dicts (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.16 cl-data-structures/sequences/rrb

Source

cl-data-structures.asd.

Parent Component

sequences (module).

Child Components

3.17 cl-data-structures/queues

Dependency

sequences (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.18 cl-data-structures/queues/2-3-tree

Source

cl-data-structures.asd.

Parent Component

queues (module).

Child Components

3.19 cl-data-structures/sets

Dependency

queues (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.20 cl-data-structures/sets/qp-trie

Source

cl-data-structures.asd.

Parent Component

sets (module).

Child Components

3.21 cl-data-structures/sets/skip-list

Source

cl-data-structures.asd.

Parent Component

sets (module).

Child Components

3.22 cl-data-structures/metric-space

Dependency

sets (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.23 cl-data-structures/metric-space/egnat

Source

cl-data-structures.asd.

Parent Component

metric-space (module).

Child Component

api.lisp (file).


3.24 cl-data-structures/composite

Dependency

metric-space (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.25 cl-data-structures/algorithms

Dependency

composite (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.26 cl-data-structures/algorithms/meta

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Child Components

3.27 cl-data-structures/file-system

Dependency

algorithms (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.28 cl-data-structures/threads

Dependency

file-system (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.29 cl-data-structures/math

Dependency

threads (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

3.30 cl-data-structures/streaming-algorithms

Dependency

math (module).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Child Components

4 Files

Files are sorted by type and then listed depth-first from the systems components trees.


4.1 Lisp


4.1.1 cl-data-structures/cl-data-structures.asd

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

ASDF Systems

cl-data-structures.


4.1.2 cl-data-structures/aux-package.lisp

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Packages
Public Interface

defpackage (macro).


4.1.3 cl-data-structures/package.lisp

Dependency

aux-package.lisp (file).

Source

cl-data-structures.asd.

Parent Component

cl-data-structures (system).

Packages

4.1.4 cl-data-structures/utils/package.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Packages

cl-data-structures.utils.


4.1.5 cl-data-structures/utils/macros.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface
Internals

4.1.6 cl-data-structures/utils/types.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface

4.1.7 cl-data-structures/utils/higher-order.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface

4.1.8 cl-data-structures/utils/cartesian.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface

4.1.9 cl-data-structures/utils/ordered-algorithms.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface

4.1.10 cl-data-structures/utils/lists.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface

4.1.11 cl-data-structures/utils/trivial.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface

todo (symbol macro).


4.1.12 cl-data-structures/utils/modification-algorithms.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface

4.1.13 cl-data-structures/utils/distances.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface
Internals

4.1.14 cl-data-structures/utils/lazy-shuffle.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface

4.1.15 cl-data-structures/utils/arrays.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface
Internals

4.1.16 cl-data-structures/utils/trees.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface

4.1.17 cl-data-structures/utils/bind.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).


4.1.18 cl-data-structures/utils/parallel-tools.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface
Internals

4.1.19 cl-data-structures/utils/lambda-lists.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface

4.1.20 cl-data-structures/utils/embedding.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Internals

bourgain-embedding (function).


4.1.21 cl-data-structures/utils/cloning.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface
Internals

4.1.22 cl-data-structures/utils/numbers.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface

square (function).


4.1.23 cl-data-structures/utils/bucket-sort.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface

bucket-sort (function).


4.1.24 cl-data-structures/utils/hashing.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).

Public Interface
Internals

4.1.25 cl-data-structures/utils/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

utils (module).


4.1.26 cl-data-structures/api/meta.lisp

Source

cl-data-structures.asd.

Parent Component

api (module).

Public Interface
Internals

4.1.27 cl-data-structures/api/meta-docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

api (module).


4.1.29 cl-data-structures/api/trait-classes.lisp

Source

cl-data-structures.asd.

Parent Component

api (module).

Public Interface

4.1.30 cl-data-structures/api/generics.lisp

Source

cl-data-structures.asd.

Parent Component

api (module).

Public Interface

4.1.31 cl-data-structures/api/conditions.lisp

Source

cl-data-structures.asd.

Parent Component

api (module).

Public Interface
Internals

4.1.32 cl-data-structures/api/expression-wrapper.lisp

Source

cl-data-structures.asd.

Parent Component

api (module).

Public Interface
Internals

4.1.33 cl-data-structures/api/delay.lisp

Source

cl-data-structures.asd.

Parent Component

api (module).

Public Interface
Internals

read-callback (reader method).


4.1.34 cl-data-structures/api/macros.lisp

Source

cl-data-structures.asd.

Parent Component

api (module).

Public Interface

4.1.35 cl-data-structures/api/functions.lisp

Source

cl-data-structures.asd.

Parent Component

api (module).

Public Interface

4.1.36 cl-data-structures/api/field.lisp

Source

cl-data-structures.asd.

Parent Component

api (module).

Public Interface
Internals

4.1.37 cl-data-structures/api/auxilary.lisp

Source

cl-data-structures.asd.

Parent Component

api (module).

Public Interface

4.1.38 cl-data-structures/api/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

api (module).


4.1.39 cl-data-structures/adapters/package.lisp

Source

cl-data-structures.asd.

Parent Component

adapters (module).

Packages

cl-data-structures.adapters.


4.1.40 cl-data-structures/adapters/hash-table.lisp

Source

cl-data-structures.asd.

Parent Component

adapters (module).

Public Interface

at (method).


4.1.41 cl-data-structures/adapters/vector.lisp

Source

cl-data-structures.asd.

Parent Component

adapters (module).

Public Interface
Internals

4.1.42 cl-data-structures/adapters/list.lisp

Source

cl-data-structures.asd.

Parent Component

adapters (module).

Public Interface
Internals

4.1.43 cl-data-structures/common/package.lisp

Source

cl-data-structures.asd.

Parent Component

common (module).

Packages

cl-data-structures.common.


4.1.44 cl-data-structures/common/modification-operation-status.lisp

Source

cl-data-structures.asd.

Parent Component

common (module).

Public Interface
Internals

4.1.45 cl-data-structures/common/eager-modification-operation-status.lisp

Source

cl-data-structures.asd.

Parent Component

common (module).

Public Interface

4.1.46 cl-data-structures/common/lazy-box.lisp

Source

cl-data-structures.asd.

Parent Component

common (module).

Public Interface
Internals

4.1.47 cl-data-structures/common/lazy-range.lisp

Source

cl-data-structures.asd.

Parent Component

common (module).

Public Interface
Internals

4.1.48 cl-data-structures/common/content-tuple.lisp

Source

cl-data-structures.asd.

Parent Component

common (module).

Public Interface
Internals

4.1.49 cl-data-structures/common/ranges.lisp

Source

cl-data-structures.asd.

Parent Component

common (module).

Public Interface
Internals

4.1.50 cl-data-structures/common/sequence-window.lisp

Source

cl-data-structures.asd.

Parent Component

common (module).

Public Interface
Internals

4.1.51 cl-data-structures/common/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

common (module).


4.1.52 cl-data-structures/common/abstract/package.lisp

Source

cl-data-structures.asd.

Parent Component

abstract (module).

Packages

cl-data-structures.common.abstract.


4.1.53 cl-data-structures/common/abstract/common.lisp

Source

cl-data-structures.asd.

Parent Component

abstract (module).

Public Interface
Internals

4.1.54 cl-data-structures/common/2-3-tree/package.lisp

Source

cl-data-structures.asd.

Parent Component

2-3-tree (module).

Packages

cl-data-structures.common.2-3-tree.


4.1.55 cl-data-structures/common/2-3-tree/common.lisp

Source

cl-data-structures.asd.

Parent Component

2-3-tree (module).

Public Interface
Internals

4.1.56 cl-data-structures/common/hamt/package.lisp

Source

cl-data-structures.asd.

Parent Component

hamt (module).

Packages

cl-data-structures.common.hamt.


4.1.57 cl-data-structures/common/hamt/common.lisp

Source

cl-data-structures.asd.

Parent Component

hamt (module).

Public Interface
Internals

4.1.58 cl-data-structures/common/rrb/package.lisp

Source

cl-data-structures.asd.

Parent Component

rrb (module).

Packages

cl-data-structures.common.rrb.


4.1.59 cl-data-structures/common/rrb/common.lisp

Source

cl-data-structures.asd.

Parent Component

rrb (module).

Public Interface
Internals

4.1.60 cl-data-structures/common/skip-list/package.lisp

Source

cl-data-structures.asd.

Parent Component

skip-list (module).

Packages

cl-data-structures.common.skip-list.


4.1.61 cl-data-structures/common/skip-list/common.lisp

Source

cl-data-structures.asd.

Parent Component

skip-list (module).

Public Interface
Internals

4.1.62 cl-data-structures/common/egnat/package.lisp

Source

cl-data-structures.asd.

Parent Component

egnat (module).

Packages

cl-data-structures.common.egnat.


4.1.63 cl-data-structures/common/egnat/classes.lisp

Source

cl-data-structures.asd.

Parent Component

egnat (module).

Public Interface
Internals

4.1.64 cl-data-structures/common/egnat/generics.lisp

Source

cl-data-structures.asd.

Parent Component

egnat (module).

Public Interface
Internals

next-elements (generic function).


4.1.65 cl-data-structures/common/egnat/common.lisp

Source

cl-data-structures.asd.

Parent Component

egnat (module).

Public Interface
Internals

4.1.66 cl-data-structures/common/egnat/methods.lisp

Source

cl-data-structures.asd.

Parent Component

egnat (module).

Public Interface
Internals

4.1.67 cl-data-structures/common/egnat/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

egnat (module).


4.1.68 cl-data-structures/common/qp-trie.lisp

Source

cl-data-structures.asd.

Parent Component

common (module).

Packages

cl-data-structures.common.qp-trie.

Public Interface
Internals

4.1.69 cl-data-structures/common/meta.lisp

Source

cl-data-structures.asd.

Parent Component

common (module).

Public Interface

4.1.72 cl-data-structures/dicts/common.lisp

Source

cl-data-structures.asd.

Parent Component

dicts (module).

Public Interface
Internals

lazy-box-dictionary (class).


4.1.73 cl-data-structures/dicts/api.lisp

Source

cl-data-structures.asd.

Parent Component

dicts (module).

Public Interface

4.1.74 cl-data-structures/dicts/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

dicts (module).


4.1.75 cl-data-structures/dicts/skip-list/api.lisp

Source

cl-data-structures.asd.

Parent Component

skip-list (module).

Public Interface
Internals

mutable-skip-list-dictionary-range (class).


4.1.76 cl-data-structures/dicts/hamt/internal.lisp

Source

cl-data-structures.asd.

Parent Component

hamt (module).

Internals

4.1.77 cl-data-structures/dicts/hamt/api.lisp

Source

cl-data-structures.asd.

Parent Component

hamt (module).

Public Interface

4.1.78 cl-data-structures/dicts/hamt/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

hamt (module).


4.1.79 cl-data-structures/dicts/srrb/types.lisp

Source

cl-data-structures.asd.

Parent Component

srrb (module).

Public Interface
Internals

fundamental-sparse-rrb-vector (class).


4.1.80 cl-data-structures/dicts/srrb/internal.lisp

Source

cl-data-structures.asd.

Parent Component

srrb (module).

Public Interface
Internals

4.1.81 cl-data-structures/dicts/srrb/api.lisp

Source

cl-data-structures.asd.

Parent Component

srrb (module).

Public Interface
Internals

4.1.82 cl-data-structures/dicts/srrb/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

srrb (module).


4.1.83 cl-data-structures/sequences/packages.lisp

Source

cl-data-structures.asd.

Parent Component

sequences (module).

Packages

4.1.84 cl-data-structures/sequences/common.lisp

Source

cl-data-structures.asd.

Parent Component

sequences (module).

Public Interface
Internals

lazy-box-sequence (class).


4.1.85 cl-data-structures/sequences/rrb/api.lisp

Source

cl-data-structures.asd.

Parent Component

rrb (module).

Public Interface
Internals

4.1.86 cl-data-structures/sequences/rrb/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

rrb (module).


4.1.87 cl-data-structures/queues/packages.lisp

Source

cl-data-structures.asd.

Parent Component

queues (module).

Packages

4.1.88 cl-data-structures/queues/common.lisp

Source

cl-data-structures.asd.

Parent Component

queues (module).

Public Interface

4.1.89 cl-data-structures/queues/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

queues (module).


4.1.90 cl-data-structures/queues/2-3-tree/api.lisp

Source

cl-data-structures.asd.

Parent Component

2-3-tree (module).

Public Interface
Internals

4.1.91 cl-data-structures/queues/2-3-tree/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

2-3-tree (module).


4.1.93 cl-data-structures/sets/common.lisp

Source

cl-data-structures.asd.

Parent Component

sets (module).

Public Interface

4.1.94 cl-data-structures/sets/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

sets (module).


4.1.95 cl-data-structures/sets/qp-trie/api.lisp

Source

cl-data-structures.asd.

Parent Component

qp-trie (module).

Public Interface
Internals

4.1.96 cl-data-structures/sets/qp-trie/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

qp-trie (module).


4.1.97 cl-data-structures/sets/skip-list/api.lisp

Source

cl-data-structures.asd.

Parent Component

skip-list (module).

Public Interface
Internals

mutable-skip-list-set-range (class).


4.1.98 cl-data-structures/sets/skip-list/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

skip-list (module).


4.1.100 cl-data-structures/metric-space/trait-classes.lisp

Source

cl-data-structures.asd.

Parent Component

metric-space (module).

Public Interface
Internals

read-metric-fn (reader method).


4.1.101 cl-data-structures/metric-space/common.lisp

Source

cl-data-structures.asd.

Parent Component

metric-space (module).

Public Interface

distance (generic function).


4.1.102 cl-data-structures/metric-space/api.lisp

Source

cl-data-structures.asd.

Parent Component

metric-space (module).

Public Interface

4.1.103 cl-data-structures/metric-space/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

metric-space (module).


4.1.104 cl-data-structures/metric-space/egnat/api.lisp

Source

cl-data-structures.asd.

Parent Component

egnat (module).

Public Interface

4.1.105 cl-data-structures/composite/package.lisp

Source

cl-data-structures.asd.

Parent Component

composite (module).

Packages

cl-data-structures.composite.


4.1.106 cl-data-structures/composite/implementation.lisp

Source

cl-data-structures.asd.

Parent Component

composite (module).

Public Interface
Internals

4.1.108 cl-data-structures/algorithms/meta/macros.lisp

Source

cl-data-structures.asd.

Parent Component

meta (module).

Public Interface
Internals

4.1.109 cl-data-structures/algorithms/meta/classes.lisp

Source

cl-data-structures.asd.

Parent Component

meta (module).

Public Interface

4.1.110 cl-data-structures/algorithms/meta/generics.lisp

Source

cl-data-structures.asd.

Parent Component

meta (module).

Public Interface
Internals

4.1.111 cl-data-structures/algorithms/meta/methods.lisp

Source

cl-data-structures.asd.

Parent Component

meta (module).

Public Interface

4.1.112 cl-data-structures/algorithms/meta/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

meta (module).


4.1.113 cl-data-structures/algorithms/common.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.114 cl-data-structures/algorithms/array-elementwise.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.115 cl-data-structures/algorithms/hash-table-elementwise.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.116 cl-data-structures/algorithms/on-each.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.117 cl-data-structures/algorithms/translation.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface

translation (generic function).

Internals

translation-function (class).


4.1.118 cl-data-structures/algorithms/count.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface

4.1.119 cl-data-structures/algorithms/to-vector.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

to-vector-function (class).


4.1.120 cl-data-structures/algorithms/to-list.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

to-list-function (class).


4.1.121 cl-data-structures/algorithms/rate.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

rate-function (class).


4.1.122 cl-data-structures/algorithms/to-hash-table.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

to-hash-table-function (class).


4.1.123 cl-data-structures/algorithms/enumerate.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

enumerate-function (class).


4.1.124 cl-data-structures/algorithms/shuffled-range.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.125 cl-data-structures/algorithms/filtering.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.126 cl-data-structures/algorithms/common-range-category.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Internals

4.1.127 cl-data-structures/algorithms/summary.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.128 cl-data-structures/algorithms/accumulate.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

accumulate-function (class).


4.1.129 cl-data-structures/algorithms/group-by.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.130 cl-data-structures/algorithms/without.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.131 cl-data-structures/algorithms/multiplex.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.132 cl-data-structures/algorithms/only.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.133 cl-data-structures/algorithms/only-different.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.134 cl-data-structures/algorithms/cartesian.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.135 cl-data-structures/algorithms/restrain-size.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.136 cl-data-structures/algorithms/reservoir-sample.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.137 cl-data-structures/algorithms/repeat.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.138 cl-data-structures/algorithms/latch.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.139 cl-data-structures/algorithms/establish-special.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.140 cl-data-structures/algorithms/extrema.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

extrema-function (class).


4.1.141 cl-data-structures/algorithms/extremum.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

extremum-function (class).


4.1.142 cl-data-structures/algorithms/cumulative-accumulate.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.143 cl-data-structures/algorithms/chain.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.144 cl-data-structures/algorithms/frequency.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

frequency-function (class).


4.1.145 cl-data-structures/algorithms/zip.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.146 cl-data-structures/algorithms/flatten-lists.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.147 cl-data-structures/algorithms/partition-if.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.148 cl-data-structures/algorithms/distinct.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.149 cl-data-structures/algorithms/first-element.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.150 cl-data-structures/algorithms/in-batches.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.151 cl-data-structures/algorithms/sliding-window.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.152 cl-data-structures/algorithms/with-previous-element.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).

Public Interface
Internals

4.1.153 cl-data-structures/algorithms/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

algorithms (module).


4.1.154 cl-data-structures/file-system/package.lisp

Source

cl-data-structures.asd.

Parent Component

file-system (module).

Packages

cl-data-structures.file-system.


4.1.155 cl-data-structures/file-system/common.lisp

Source

cl-data-structures.asd.

Parent Component

file-system (module).

Public Interface
Internals

4.1.156 cl-data-structures/file-system/line-by-line.lisp

Source

cl-data-structures.asd.

Parent Component

file-system (module).

Public Interface
Internals

4.1.157 cl-data-structures/file-system/tokenize.lisp

Source

cl-data-structures.asd.

Parent Component

file-system (module).

Public Interface
Internals

4.1.158 cl-data-structures/file-system/find.lisp

Source

cl-data-structures.asd.

Parent Component

file-system (module).

Public Interface
Internals

4.1.159 cl-data-structures/file-system/unix.lisp

Source

cl-data-structures.asd.

Parent Component

file-system (module).

Public Interface
Internals

read-command-string (reader method).


4.1.160 cl-data-structures/file-system/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

file-system (module).


4.1.161 cl-data-structures/threads/package.lisp

Source

cl-data-structures.asd.

Parent Component

threads (module).

Packages

cl-data-structures.threads.


4.1.162 cl-data-structures/threads/parallel-multiplex.lisp

Source

cl-data-structures.asd.

Parent Component

threads (module).

Public Interface
Internals

4.1.163 cl-data-structures/threads/parallel-group-by.lisp

Source

cl-data-structures.asd.

Parent Component

threads (module).

Public Interface
Internals

4.1.164 cl-data-structures/threads/parallel-on-each.lisp

Source

cl-data-structures.asd.

Parent Component

threads (module).

Public Interface
Internals

4.1.165 cl-data-structures/threads/buffer-range.lisp

Source

cl-data-structures.asd.

Parent Component

threads (module).

Public Interface
Internals

4.1.166 cl-data-structures/threads/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

threads (module).


4.1.167 cl-data-structures/math/package.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Packages

cl-data-structures.math.


4.1.168 cl-data-structures/math/absolute-value-norm.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

absolute-value-norm-function (class).


4.1.169 cl-data-structures/math/average.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

4.1.170 cl-data-structures/math/variance.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

variance-function (class).


4.1.171 cl-data-structures/math/mutual-information.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

4.1.172 cl-data-structures/math/simple-linear-regression.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

4.1.173 cl-data-structures/math/median-absolute-deviation.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

median-absolute-deviation-function (class).


4.1.174 cl-data-structures/math/hodges-lehmann.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

4.1.175 cl-data-structures/math/co-occurence-table.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

co-occurence-table-function (class).


4.1.176 cl-data-structures/math/standard-deviation.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

standard-deviation-function (class).


4.1.177 cl-data-structures/math/moments.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

moments-function (class).


4.1.178 cl-data-structures/math/bootstrap.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

4.1.179 cl-data-structures/math/moving-average.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

4.1.180 cl-data-structures/math/hmm.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface

hidden-markov-model-generator (function).

Internals

4.1.181 cl-data-structures/math/gini-impurity.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

gini-impurity-function (class).


4.1.182 cl-data-structures/math/entropy.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

entropy-function (class).


4.1.183 cl-data-structures/math/fast-map.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

4.1.184 cl-data-structures/math/sum.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).

Public Interface
Internals

4.1.185 cl-data-structures/math/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

math (module).


4.1.186 cl-data-structures/streaming-algorithms/hyperloglog.lisp

Source

cl-data-structures.asd.

Parent Component

streaming-algorithms (module).

Packages

cl-data-structures.streaming-algorithms.hyperloglog.

Public Interface
Internals

4.1.187 cl-data-structures/streaming-algorithms/polynomial-hashing.lisp

Source

cl-data-structures.asd.

Parent Component

streaming-algorithms (module).

Packages

cl-data-structures.streaming-algorithms.polynomial-hashing.

Public Interface
Internals

+long-prime+ (constant).


4.1.188 cl-data-structures/streaming-algorithms/package.lisp

Source

cl-data-structures.asd.

Parent Component

streaming-algorithms (module).

Packages

cl-data-structures.streaming-algorithms.


4.1.189 cl-data-structures/streaming-algorithms/common.lisp

Source

cl-data-structures.asd.

Parent Component

streaming-algorithms (module).

Public Interface
Internals

4.1.190 cl-data-structures/streaming-algorithms/approximated-histogram.lisp

Source

cl-data-structures.asd.

Parent Component

streaming-algorithms (module).

Public Interface
Internals

4.1.191 cl-data-structures/streaming-algorithms/approximated-set-cardinality.lisp

Source

cl-data-structures.asd.

Parent Component

streaming-algorithms (module).

Public Interface
Internals

4.1.192 cl-data-structures/streaming-algorithms/approximated-counts.lisp

Source

cl-data-structures.asd.

Parent Component

streaming-algorithms (module).

Public Interface
Internals

4.1.193 cl-data-structures/streaming-algorithms/approximated-top-k.lisp

Source

cl-data-structures.asd.

Parent Component

streaming-algorithms (module).

Public Interface
Internals

4.1.194 cl-data-structures/streaming-algorithms/bloom-filter.lisp

Source

cl-data-structures.asd.

Parent Component

streaming-algorithms (module).

Public Interface
Internals

4.1.195 cl-data-structures/streaming-algorithms/minhash.lisp

Source

cl-data-structures.asd.

Parent Component

streaming-algorithms (module).

Public Interface
Internals

4.1.196 cl-data-structures/streaming-algorithms/docstrings.lisp

Source

cl-data-structures.asd.

Parent Component

streaming-algorithms (module).


5 Packages

Packages are listed by definition order.


5.1 cl-data-structures.common.2-3-tree

Source

package.lisp.

Nickname

cl-ds.common.2-3

Use List
Public Interface
Internals

5.2 cl-data-structures.queues.2-3-tree

Source

packages.lisp.

Nickname

cl-ds.queues.2-3-tree

Use List
Public Interface
Internals

5.3 cl-data-structures.streaming-algorithms

Source

package.lisp.

Nickname

cl-ds.sa

Use List
Public Interface
Internals

5.4 cl-data-structures.fancy

Source

aux-package.lisp.

Nickname

cl-ds.fancy

Public Interface

defpackage (macro).


5.5 cl-data-structures.meta

Source

package.lisp.

Nickname

cl-ds.meta

Use List
Public Interface
Internals

5.7 cl-data-structures.sets.qp-trie

Source

packages.lisp.

Nickname

cl-ds.sets.qp-trie

Use List
Public Interface
Internals

5.8 cl-data-structures.metric-space

Source

packages.lisp.

Nickname

cl-ds.ms

Use List
Public Interface
Internals

read-metric-fn (generic reader).


5.9 cl-data-structures.dicts.skip-list

Source

packages.lisp.

Nickname

cl-ds.dicts.skip-list

Use List
Public Interface
Internals

mutable-skip-list-dictionary-range (class).


5.10 cl-data-structures.math

Source

package.lisp.

Nickname

cl-ds.math

Use List
Public Interface
Internals

5.11 cl-data-structures.common.hamt

Source

package.lisp.

Nickname

cl-ds.common.hamt

Use List
Used By List

cl-data-structures.dicts.hamt.

Public Interface
Internals

5.12 cl-data-structures.common.rrb

Source

package.lisp.

Nickname

cl-ds.common.rrb

Use List
Used By List

cl-data-structures.sequences.rrb-vector.

Public Interface
Internals

5.13 cl-data-structures.common

Source

package.lisp.

Nickname

cl-ds.common

Use List
Public Interface
Internals

5.14 cl-data-structures.common.egnat

Source

package.lisp.

Nickname

cl-ds.common.egnat

Use List
Public Interface
Internals

5.15 cl-data-structures.sets

Source

packages.lisp.

Nickname

cl-ds.sets

Use List
Public Interface

5.16 cl-data-structures.utils

Source

package.lisp.

Nickname

cl-ds.utils

Use List
Public Interface
Internals

5.17 cl-data-structures.file-system

Source

package.lisp.

Nickname

cl-ds.fs

Use List
Public Interface
Internals

5.18 cl-data-structures.metric-space.egnat

Source

packages.lisp.

Nickname

cl-ds.ms.egnat

Use List
Public Interface

5.19 cl-data-structures.dicts.srrb

Source

packages.lisp.

Nickname

cl-ds.dicts.srrb

Use List
Public Interface
Internals

5.20 cl-data-structures.adapters

Source

package.lisp.

Nickname

cl-ds.adapters

Use List
Public Interface
Internals

5.21 cl-data-structures.common.qp-trie

Source

qp-trie.lisp.

Nickname

cl-ds.common.qp-trie

Use List
Public Interface
Internals

5.23 cl-data-structures

Source

package.lisp.

Nickname

cl-ds

Use List
Used By List
Public Interface
Internals

5.24 cl-data-structures.common.skip-list

Source

package.lisp.

Nickname

cl-ds.common.skip-list

Use List
Used By List

cl-data-structures.dicts.skip-list.

Public Interface
Internals

5.25 cl-data-structures.composite

Source

package.lisp.

Nickname

cl-ds.composite

Use List
Public Interface
Internals

5.26 cl-data-structures.threads

Source

package.lisp.

Nickname

cl-ds.threads

Use List
Public Interface
Internals

5.27 cl-data-structures.dicts.hamt

Source

packages.lisp.

Nickname

cl-ds.dicts.hamt

Use List
Public Interface
Internals

5.28 cl-data-structures.algorithms.meta

Source

package.lisp.

Nickname

cl-ds.alg.meta

Use List
Used By List

cl-data-structures.algorithms.

Public Interface
Internals

5.29 cl-data-structures.sequences

Source

packages.lisp.

Nickname

cl-ds.seqs

Use List
Public Interface
Internals

lazy-box-sequence (class).


5.30 cl-data-structures.queues

Source

packages.lisp.

Nickname

cl-ds.queues

Use List
Public Interface

5.32 cl-data-structures.algorithms

Source

package.lisp.

Nickname

cl-ds.alg

Use List
Public Interface
Internals

5.33 cl-data-structures.sets.skip-list

Source

packages.lisp.

Nickname

cl-ds.sets.skip-list

Use List
Public Interface
Internals

mutable-skip-list-set-range (class).


5.34 cl-data-structures.streaming-algorithms.polynomial-hashing

Source

polynomial-hashing.lisp.

Use List
Public Interface
Internals

+long-prime+ (constant).


5.35 cl-data-structures.sequences.rrb-vector

Source

packages.lisp.

Nickname

cl-ds.seqs.rrb

Use List
Public Interface
Internals

5.36 cl-data-structures.streaming-algorithms.hyperloglog

Source

hyperloglog.lisp.

Use List
Public Interface
Internals

6 Definitions

Definitions are sorted by export status, category, package, and then by lexicographic order.


6.1 Public Interface


6.1.1 Constants

Constant: +bit-count+
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Constant: +depth+
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Constant: +hash-level+
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Constant: +max-64-bits+
Package

cl-data-structures.streaming-algorithms.polynomial-hashing.

Source

polynomial-hashing.lisp.

Constant: +maximal-shift+
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Constant: +maximum-children-count+
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Constant: +maximum-children-count+
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Constant: +tail-mask+
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Constant: null-bucket
Package

cl-data-structures.meta.

Source

meta.lisp.


6.1.2 Special variables

Special Variable: *current-key*

Description:
KEY for the current group when aggregating by the GROUP-BY or PARTITION-IF function.

Package

cl-data-structures.algorithms.

Source

common.lisp.

Special Variable: *previous-element*
Package

cl-data-structures.algorithms.

Source

with-previous-element.lisp.


6.1.3 Symbol macros

Symbol Macro: empty-changed-eager-modification-operation-status
Package

cl-data-structures.common.

Source

eager-modification-operation-status.lisp.

Symbol Macro: empty-eager-modification-operation-status
Package

cl-data-structures.common.

Source

eager-modification-operation-status.lisp.

Symbol Macro: todo
Package

cl-data-structures.utils.

Source

trivial.lisp.


6.1.4 Macros

Macro: assert-one-dimension (more)
Package

cl-data-structures.

Source

macros.lisp.

Macro: bind-lambda (fn &rest args)

Curry function. For instance (bin-lambda #’+ 2 :_) is like (curry #+ 2). However this can be used to bind more arguments. For instance (bind-lambda #’/ 5 :_ 3 :_ 4 :_ 2 :_ :_ 12)

Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: call-constructor (constructor)
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Macro: cases (all-cases &body form)

Macro, used for elemination of code branches by duplicating code.

Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: check-argument-bounds (argument expression)
Package

cl-data-structures.

Source

macros.lisp.

Macro: check-value (value &body body)
Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: cond+ (tests &body forms)

If else ladder generator.

@b(Values and arguments:)
@begin(list)
@item(tests – list of conditions)
@item(forms – list of clauses that are supposed to be checked against conditions) @end(list)

Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: cond-compare ((a b) < = >)
Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: copy-slots ((from to) &body slot-names)
Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: define-aggregation-function (function-name function-class (&rest generic-lambda-list) (&rest method-lambda-list) (&rest function-state) init-form aggregate-form result-form)

Description:
Defines all required methods and classes for aggregation functions.

Package

cl-data-structures.algorithms.meta.

Source

macros.lisp.

Macro: define-list-of-slots (id (&rest inherited) &body slots)
Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: define-tagged-untagged-node (name &body slots)
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Macro: define-validation-for-fields ((fn accepted-field-arguments) &body body)
Package

cl-data-structures.

Source

field.lisp.

Macro: defmethod-with-peek-stack ((method-name lambda-list stack init) &body body)
Package

cl-data-structures.common.

Source

ranges.lisp.

Macro: defmethod-with-stack ((method-name lambda-list stack stack-place) &body body)
Package

cl-data-structures.common.

Source

ranges.lisp.

Macro: defpackage (package &rest options)
Package

cl-data-structures.fancy.

Source

aux-package.lisp.

Macro: delay (&body body)

Description:
Simple lazy evaluated value. Used to eleminate costly creation of elements in the container by update-if.

Package

cl-data-structures.

Source

delay.lisp.

Macro: hash-do ((node index &optional count) (root hash) &key on-leaf on-nil on-every)

Macro used for writing code going down into hash tree.

Package

cl-data-structures.common.hamt.

Source

common.lisp.

Macro: import-all-package-symbols (from-package to-package)

Macro. Will import all internal symbols from package to package. For tests.

Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: lazy-let (bindings &body body)

Like LET but bind variable only once it is accessed. Does that by replacing calls to variable by calls to local function so variables are not seen when introspecting lexical enviorement.

Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: let-aggregator (bindings ((element) &body pass) (&body extract) &body cleanup)
Package

cl-data-structures.algorithms.meta.

Source

macros.lisp.

Macro: let-generator (forms send-finish finish recur send-recur &body body)

Poor man’s generator (no continuations, no code-walking).

Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: lolol (variables &body body)
Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: lparallel-future (variables &body body)
Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: make-lazy-range (class container range)
Package

cl-data-structures.common.

Source

lazy-range.lisp.

Macro: mod-bind ((first &optional found value changed) form &body body)

Syntax:
mod-bind (first &optional found value) values-form body

Arguments:
–FIRST, Symbol, will be bound to the first value returned by values-form.
–FOUND, Symbol, this macro will construct symbol-macrolet that will expand to the call (found status)
–VALUE, Symbol, this macro will construct symbol-macrolet that will expand to the call (value status)
–CHANGED, Symbol, this macro will construct symbol-macrolet that will expand to the call (changed status)

Description:
This macro attempts to mimic multiple-value-bind syntax for modification operations performed on the containers. All of those operations will return a secondary object representing operation status that shall be bound in the lexical environment. Next, symbol-macrolets will be established, inlining found, value and changed function calls on the operation status (like with-accessors).

Package

cl-data-structures.

Source

macros.lisp.

Macro: optimize-value ((&rest bindings) &body body)
Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: qp-trie-insert! (qp-trie bytes new-node-form)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Macro: quasi-clone* (instance &body arguments)
Package

cl-data-structures.utils.

Source

cloning.lisp.

Macro: summary (range &body functions)

Arguments:
–RANGE, Range to aggregate.
–FORMS, Description of function invocation in the form of the plist. Key is a label used to identify value in the result range, a value is an aggregation function form (function and the function arguments). The range will be inserted as the first argument in the aggregation function call by default, or in the place of any symbol with name ’_’ if such symbol is present.

Examples:
(let ((result (cl-ds.alg:summary (cl-ds:iota-range :to 250)
:min (cl-ds.alg:accumulate #’min)
:max (cl-ds.alg:accumulate #’max))))
(prove:is (cl-ds:at result :min) 0)
(prove:is (cl-ds:at result :max) 249))

Description:
The summary is a macro allowing performance of multiple aggregations in one function call.

Returns:
Range of results. Use cl-ds:at with label to extract result of each individual aggregation form.

Notes:
–Currently, this macro does support only the single stage aggregation functions.
–This macro expands to %SUMMARY call. Programmer may opt to write %SUMMARY call directly despite extra boilerplate required.
–Particularly useful when the iteration over the range requires considerable time alone and therefore repeating it should be avoided for efficiency sake.

Package

cl-data-structures.algorithms.

Source

summary.lisp.

Macro: with-destructive-erase-hamt (node container hash &key on-leaf on-nil)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Macro: with-file-ranges (bindings &body body)
Package

cl-data-structures.file-system.

Source

common.lisp.

Macro: with-hamt-path (node hash root &key on-leaf on-nil operation)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Macro: with-hash-tree-functions ((container &key cases) &body body)

Simple macro adding local functions (all forwards to the container closures).

Package

cl-data-structures.common.hamt.

Source

api.lisp.

Macro: with-keys (forms &body body)
Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: with-rebind (variables &body body)
Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: with-slots-for ((object id) &body body)
Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: with-sparse-rrb-node (node &body body)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Macro: with-sparse-rrb-node-path ((tree index shift path indexes length &optional all-present) &body body)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Macro: with-vectors (vector-bindings &body body)

Macro for simpler vector usage. Will expand into local functions that act as accessors for vectors so you will not have to write stuff like (aref vector 0), instead you can write (vector 0)

Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: xpr (arguments &body body)

Syntax:
xpr arguments => expression

Arguments:
–ARGUMENTS, Lambda list of the expression, in the form of the plist
–BODY, Body of the expression.

Examples:
(let ((iota (cl-ds:xpr (:i 0) ; this will construct iota range with elements 0, 1, 2, 3, 4
(when (< i 5) ; check the stop condition
(cl-ds:send-recur i :i (1+ i)))))) ; yield i and bind (1+ i) to i
(prove:is (cl-ds:consume-front iota) 0)
(prove:is (cl-ds:consume-front iota) 1)
(prove:is (cl-ds:consume-front iota) 2)
(prove:is (cl-ds:consume-front iota) 3)
(prove:is (cl-ds:consume-front iota) 4))

Description:
Constructs expression. Expression is a forward range build around the function closed over the state. State can be modified with SEND-RECUR and RECUR forms. SEND-RECUR modifies state and returns the value. RECUR modifies state but does not return the value.

Notes:
Objects used as part of the state should be immutable to support RESET! and CLONE operations properly.

Package

cl-data-structures.

Source

expression-wrapper.lisp.


6.1.5 Ordinary functions

Function: acquire-ownership (node ownership-tag)
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Function: add-hash (sketch x)
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: add-to-list (list data &optional function)
Package

cl-data-structures.utils.

Source

lists.lisp.

Function: adjust-size-to-fill-pointer (array)
Package

cl-data-structures.utils.

Source

modification-algorithms.lisp.

Function: all-parents (root children-fn)

Description:
Scans tree with CHILDREN-FN (is supposed to return children of the PARENT as CL:SEQUENCE). Will return ALIST mapping node to list of all parents of nodes. Resulting data structure is useful as a way to lookup for partial order in the tree.

Package

cl-data-structures.utils.

Source

trees.lisp.

Function: ancestor-p (all-ancestors-vector test-fn child ancestor)

Description:
Checks if ANCESTOR is ancestor of CHILD in tree represented as ALL-ANCESTORS-VECTOR. ALL-ANCESTORS-VECTOR should be constructed by ALL-PARENTS function.

Package

cl-data-structures.utils.

Source

trees.lisp.

Function: and* (&rest functions)
Package

cl-data-structures.utils.

Source

higher-order.lisp.

Function: approximated-counts-distance (a-sketch b-sketch)

Description:
Estimates bhattacharyya-distance from two count-min-sketches.

Returns:
SINGLE-FLOAT

Exceptional situations:
–Will signal a TYPE-ERROR if either A-SKETCH or B-SKETCH are not of the type APPROXIMATED-COUNTS. –Will signal a INCOMPATIBLE-ARGUMENTS if sketches are not compatible.

Notes:
Result is biased toward the higher values.

Package

cl-data-structures.streaming-algorithms.

Source

approximated-counts.lisp.

Function: approximated-histogram-add (histogram value)

Description:
Adds a single element to the distribution.

Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Reader: approximated-histogram-bin-count (instance)
Writer: (setf approximated-histogram-bin-count) (instance)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Target Slot

count.

Function: approximated-histogram-bin-position (histogram value)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-bin-sum (bin)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Reader: approximated-histogram-bin-value (instance)
Writer: (setf approximated-histogram-bin-value) (instance)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Target Slot

value.

Function: approximated-histogram-bins (histogram)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-bounds (histogram)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-count (histogram)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-count-lower (histogram value &rest other-values)

Description:
How many elements with value lower then the specified there is?

Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-counts (histogram)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-cumulant-sum (histogram)

Description:
Returns vector of cumulant sums at bin.

Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-mean (histogram)

Description:
Estimates mean of the distribution.

Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-median (histogram)

Description:
Estimate median of the approximated distribution.

Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-quantile (histogram quantile &rest other-quantiles)

Examples:
(let ((q (approximated-histogram-quantile (approximated-histogram
(cl-ds.alg:on-each (cl-ds:iota-range :from 1 :to 100) (alexandria:rcurry #’coerce ’double-float))) 0.5
0.95)))
(prove:ok (< 49 (first q) 51)) (prove:ok (< 94 (second q) 96)))

Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-rank-order (histogram value &rest other-values)

Description:
What is the percantage of element in the histogram with value lower then the specified there is?

Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-standard-deviation (histogram)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-sum (histogram)

Description:
Estimates total sum of all elements passed to the histogram.

Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-trim (histogram)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-truncated-mean (histogram fraction)

Description:
Estimate mean of the approximated distribution. Truncates outliers by the fraction.

Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-values (histogram)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-variance (histogram)

Description:
Estimates variance of the distribution.

Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: array-to-half-byte-array (array)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: as-cons-tree (root children-fn)

Description:
Scans tree of arbitrary objects (CHILDREN-FN is supposed to return CL:SEQUENCE of children nodes) and returns it as a tree composed of cons cells.

Package

cl-data-structures.utils.

Source

trees.lisp.

Reader: assoc-skip-list-node-value (instance)
Writer: (setf assoc-skip-list-node-value) (instance)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Target Slot

value.

Function: binary-search (element vector lower test &key key start end)
Package

cl-data-structures.utils.

Source

ordered-algorithms.lisp.

Function: bucket-sort (vector predicate &key start end key parallel buckets-count)
Package

cl-data-structures.utils.

Source

bucket-sort.lisp.

Function: build-node (index content ownership-tag)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: build-rehashed-node (container depth content ownership-tag)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: cardinality (sketch)
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: cartesian (sequence-of-sequences result-callback)
Package

cl-data-structures.utils.

Source

cartesian.lisp.

Function: cartesian (function range &rest more-ranges)

Arguments:
–FUNCTION, Function used to combine input ranges.
–RANGE, First input range.
–MORE-RANGES, All other ranges.

Description:
Combines RANGES into a singular range that contains results of FUNCTION application on cartesian combination of all elements in the input RANGES.

Returns:
FUNDAMENTAL-FORWARD-RANGE instance.

Exceptional situations:
Will raise a TYPE-ERROR if any of the RANGES is of a wrong type.

Package

cl-data-structures.algorithms.

Source

cartesian.lisp.

Function: cartesian-table (sequence-of-sequences fn)
Package

cl-data-structures.utils.

Source

cartesian.lisp.

Function: chain (&rest ranges)

Examples:
(prove:is (cl-ds.alg:to-vector (cl-ds.alg:chain ’(1 2 3) ’(4 5 6)))
#(1 2 3 4 5 6)
:test #’equalp)

Description:
Concatenate multiple ranges into one.

Returns:
FUNDAMENTAL-FORWARD-RANGE instance.

Exceptional situations:
–Raises TYPE-ERROR if any of the input ranges is not (OR CL:SEQUENCE FUNDAMENTAL-FORWARD-RANGE).

Package

cl-data-structures.algorithms.

Source

chain.lisp.

Function: cleanup (aggregator)
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Function: clone (instance)
Package

cl-data-structures.utils.

Source

cloning.lisp.

Function: cloning-list (instance)
Package

cl-data-structures.utils.

Source

cloning.lisp.

Function: close-stream (range)
Package

cl-data-structures.file-system.

Source

common.lisp.

Function: command (format-control-string &rest format-arguments)

Description:
This function contructs COMMAND object which can be then passed to functions in this package expecting name, for instance LINE-BY-LINE. Passed argumement will be passed to UIOP:LAUNCH-PROGRAM and the process-info-output stream will be used as it would point to a normal file.

Returns:
COMMAND instance.

Exceptional situations:
–Signals the type error if format-control-string is not of the type STRING.

Notes:
–This is particulary useful in conjuction with LINE-BY-LINE, unix tools, and aggreation functions in CL-DS as it allows to combine useful tools present in the unix system (like for instance xz) with CL-DS.ALG:ON-EACH, CL-DS.ALG:GROUP-BY, and different kinds of aggregation functions to quickly handle data processing tasks. –Returned COMMAND instance is immutable and can be safely passed as input multiple times

Package

cl-data-structures.file-system.

Source

unix.lisp.

Function: connect (range &rest ranges)
Package

cl-data-structures.algorithms.

Source

zip.lisp.

Function: connect-traversable (ranges)
Package

cl-data-structures.algorithms.

Source

zip.lisp.

Function: construct-aggregator (range function arguments)
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Function: copy-node (node &key node-mask ownership-tag content)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: copy-on-write (container ownership-tag indexes path depth conflict)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: copy-on-write (path indexes shift ownership-tag tail)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: copy-without (vector &rest indexes)
Package

cl-data-structures.utils.

Source

modification-algorithms.lisp.

Function: cycle-over-address (dimensions &rest pinned)
Package

cl-data-structures.utils.

Source

higher-order.lisp.

Function: deep-copy-sparse-rrb-node (node &optional size-change tag)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: delete-back-from-tree (tree)
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Function: delete-back-from-tree! (tree)
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Function: delete-node-between! (pointers prev-pointers)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: descend-into-tree (rrb-container location continue)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: destructive-write (path indexes shift ownership-tag tail)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Reader: dict-content-location (instance)
Writer: (setf dict-content-location) (instance)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Target Slot

location.

Reader: dict-content-value (instance)
Writer: (setf dict-content-value) (instance)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Target Slot

value.

Function: draw-random-vector (input size &optional result)
Package

cl-data-structures.utils.

Source

lazy-shuffle.lisp.

Function: draw-sample-vector (input size &optional result)
Package

cl-data-structures.utils.

Source

lazy-shuffle.lisp.

Function: ensure-call-ahead-of (function)
Package

cl-data-structures.utils.

Source

parallel-tools.lisp.

Function: ensure-stream (range)
Package

cl-data-structures.file-system.

Source

common.lisp.

Function: erase-from-vector (vector &rest indexes)

Remove elements under indexes from vector, preserving order of elements.

@b(Side effects:) Reduces fill pointer. Removes elements from vector and shifts elements that are left.

Package

cl-data-structures.utils.

Source

modification-algorithms.lisp.

Function: extract-result (aggregator)

Description:
Extract final result of aggregation.

Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Function: field (&rest arguments &key &allow-other-keys)
Package

cl-data-structures.

Source

field.lisp.

Function: fill-distance-matrix-from-vector (matrix function sequence &key key)
Package

cl-data-structures.utils.

Source

distances.lisp.

Function: fill-sparse-rrb-node-with-new (new-node old-node new-index new-element)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: fixnum-hash (a)
Package

cl-data-structures.utils.

Source

hashing.lisp.

Function: force (obj)
Package

cl-data-structures.

Source

delay.lisp.

Function: force-version (instance)
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Function: functional-sparse-rrb-vector-grow (operation structure container position all value)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: generator (function initial-state)
Package

cl-data-structures.utils.

Source

higher-order.lisp.

Function: go-down-on-path (container hash on-leaf on-nil after)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: half-byte-list-to-array (list &key key)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: hamt-dictionary-at (container location)

Implementation of AT

Package

cl-data-structures.dicts.hamt.

Source

api.lisp.

Function: hamt-dictionary-size (container)

Implementation of SIZE

Package

cl-data-structures.dicts.hamt.

Source

api.lisp.

Reader: hash-content-hash (instance)
Writer: (setf hash-content-hash) (instance)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Target Slot

hash.

Reader: hash-content-location (instance)
Writer: (setf hash-content-location) (instance)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Target Slot

location.

Reader: hash-dict-content-value (instance)
Writer: (setf hash-dict-content-value) (instance)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Target Slot

value.

Function: hash-integer (n &optional multi)

Attempts to randomize bits. Uses xorshift* algorithm.

Package

cl-data-structures.utils.

Source

hashing.lisp.

Function: hash-node-access (hash-node index)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-contains (hash-node index)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-contains-node (hash-node index)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-content (argument)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: (setf hash-node-content) (argument)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-deep-copy (node ownership-tag)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-insert! (node content index)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-insert-into-copy (hash-node content index ownership-tag)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-p (node)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-remove! (node index)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-remove-from-the-copy (node index ownership-tag)

Returns copy of node, but without element under index. Not safe, does not check if element is actually present.

Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-replace! (node content index)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-replace-in-the-copy (hash-node item index ownership-tag)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-size (node)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-to-masked-index (hash-node index)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-whole-mask (node)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hashval (hashes depth j hash)
Package

cl-data-structures.streaming-algorithms.polynomial-hashing.

Source

polynomial-hashing.lisp.

Function: hashval-no-depth (hashes j hash)
Package

cl-data-structures.streaming-algorithms.polynomial-hashing.

Source

polynomial-hashing.lisp.

Function: hidden-markov-model-generator (observations trans-table observation-table &key initial-state)
Package

cl-data-structures.math.

Source

hmm.lisp.

Function: homogenousp (sequence &key test key)
Package

cl-data-structures.utils.

Source

lists.lisp.

Function: hyperloglog-jaccard (a b)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-set-cardinality.lisp.

Function: if-else (predicate true false)

Description:
Construct function out of PREDICATE function, TRUE function and FALSE function. Checks if PREDICATE returns true, if yes: pass arguments to the TRUE function, if no: pass arguments to the FALSE function.

Returns:
Function.

Package

cl-data-structures.utils.

Source

higher-order.lisp.

Function: ignore-errors* (function)
Package

cl-data-structures.utils.

Source

higher-order.lisp.

Function: insert-front-into-tree (tree new)
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Function: insert-front-into-tree! (tree new)
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Function: insert-node-between! (pointers previous-pointers test skip-list-node)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: insert-or (structure location callback)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: insert-or-replace (list element &key test list-key item-key preserve-order)

Insert element into set if it is not already here.

@b(Returns three values:)
@begin(list)
@item(first – new list)
@item(second – was any item replaced?)
@item(third – old value that was replaced (or nil if there was no such value)) @end(list)

Package

cl-data-structures.utils.

Source

lists.lisp.

Function: insert-tail (rrb-container ownership-tag continue tail)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: insert-tail (structure)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: insert-tail! (structure)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: intersection-cardinality (a b)
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: inverted-hash-table (table &key test)
Package

cl-data-structures.utils.

Source

modification-algorithms.lisp.

Function: iota-range (&key from to by)
Package

cl-data-structures.

Source

functions.lisp.

Function: jaccard (a b)
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: lambda-list-to-bindings (lambda-list)
Package

cl-data-structures.utils.

Source

lambda-lists.lisp.

Function: lambda-list-to-call-form (function-symbol lambda-list)
Package

cl-data-structures.utils.

Source

lambda-lists.lisp.

Function: lazy-shuffle (from to)
Package

cl-data-structures.utils.

Source

lazy-shuffle.lisp.

Function: lexicographic-compare (compare same av bv &key key)
Package

cl-data-structures.utils.

Source

lists.lisp.

Function: line-by-line (path)

Description:
Opens a text file, and allows reading it line by line.

Returns:
Forward range. Provides access to each line in the file stored as a string.

Exceptional situations:
–Signalling error from a callback during traverse will close the inner stream automaticly.
–Signals errors just as CL:OPEN does or UIOP:LAUNCH-PROGRAM (if instead of file path COMMAND object has been passed.

Notes:
Stream is opened lazily. Calling either TRAVERSE or ACROSS on the line-by-line range will automaticly close the inner file (in exception safe way). This makes it suitable to use with the aggregation functions without additional code.

Package

cl-data-structures.file-system.

Source

line-by-line.lisp.

Function: locate-node (pointers item test)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: lower-bound (vector element comparsion &key key start end)

Description:
Find position in the VECTOR of the first element not larger then ELEMENT.

Package

cl-data-structures.utils.

Source

ordered-algorithms.lisp.

Function: make-approximated-histogram (&key maximal-bins-count initial-content)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: make-delay (callback)
Package

cl-data-structures.

Source

delay.lisp.

Function: make-dict-content (&key location value)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: make-distance-matrix-from-vector (type function sequence &key key query-key initial-element)
Package

cl-data-structures.utils.

Source

distances.lisp.

Function: make-eager-modification-operation-status (found value changed)
Package

cl-data-structures.common.

Source

eager-modification-operation-status.lisp.

Function: make-egnat-tree (container operation extra-arguments data &optional parallel)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: make-functional-2-3-queue (&key element-type)

Returns:
Empty functional-2-3-queue

Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Function: make-functional-composite-container (root &rest make-bucket-callbacks)
Package

cl-data-structures.composite.

Source

implementation.lisp.

Function: make-functional-hamt-dictionary (hash-fn equal-fn)

Syntax:
make-functional-hamt-dictionary hash-fn equal-fn &key max-depth => functional-hamt-dictionary

Description:
Constructs and return new functional-hamt-dictionary

Returns:
new instance of functional-hamt-dictionary.

Notes:
In theory HAMT can use infinite length of hash but this implementation uses 60 oldest bits at most.

Package

cl-data-structures.dicts.hamt.

Source

api.lisp.

Function: make-functional-rrb-vector (&rest all &key element-type)

Description:
Creates and returns a new instance of functiona-rrb-vector

Package

cl-data-structures.sequences.rrb-vector.

Source

api.lisp.

Function: make-functional-sparse-rrb-vector (&key element-type)

Description:
Constructs and returns a functional variant of the sparse rrb vector.

Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Function: make-future-carousel (function &optional count)
Package

cl-data-structures.utils.

Source

parallel-tools.lisp.

Function: make-half-matrix (type size &key query-key initial-element)
Package

cl-data-structures.utils.

Source

distances.lisp.

Function: make-hash-array (count)
Package

cl-data-structures.streaming-algorithms.polynomial-hashing.

Source

polynomial-hashing.lisp.

Function: make-hash-content (&key hash location)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: make-hash-dict-content (&key hash location value)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: make-hash-table-range (hash-table)
Package

cl-data-structures.algorithms.

Source

common.lisp.

Function: make-minhash (k &key mode hash-function hash-array xors seeds)
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Function: make-mutable-2-3-queue (&key element-type)

Returns:
Empty mutable-2-3-queue

Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Function: make-mutable-composite-container (root &rest make-bucket-callbacks)
Package

cl-data-structures.composite.

Source

implementation.lisp.

Function: make-mutable-egnat-metric-set (distance-function distance-type &key branching-factor node-size samples-count &allow-other-keys)
Package

cl-data-structures.metric-space.egnat.

Source

api.lisp.

Function: make-mutable-hamt-dictionary (hash-fn equal-fn)

Syntax:
make-mutable-hamt-dictionary hash-fn equal-fn &key max-depth => mutable-hamt-dictionary

Description:
Constructs and returns a new mutable-hamt-dictionary

Returns:
new instance of mutable-hamt-dictionary.

Notes:
In theory HAMT can use infinite length of hash but this implementation uses 60 oldest bits at most.

Package

cl-data-structures.dicts.hamt.

Source

api.lisp.

Function: make-mutable-qp-trie-set ()

Description:
Constructs and returns a new instance of the mutable-qp-trie-set

Package

cl-data-structures.sets.qp-trie.

Source

api.lisp.

Function: make-mutable-rrb-vector (&rest all &key element-type)

Description:
Creates and returns a new instance of mutable-rrb-vector.

Package

cl-data-structures.sequences.rrb-vector.

Source

api.lisp.

Function: make-mutable-skip-list-dictionary (ordering test &key maximum-level)
Package

cl-data-structures.dicts.skip-list.

Source

api.lisp.

Function: make-mutable-skip-list-set (ordering test &key maximum-level)

Description:
Constructs and returns a new instance of mutable-skip-list.

Package

cl-data-structures.sets.skip-list.

Source

api.lisp.

Function: make-mutable-sparse-rrb-vector (&key element-type)

Description:
Constructs and returns a mutable variant of the sparse rrb vector.

Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Function: make-node-content (&optional element-type)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: make-one-bit-minhash (k &key mode hash-function hash-array xors seeds)
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Function: make-ownership-tag ()
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Function: make-pipe-fragment (operation &key queue-size sinks end-on-empty)
Package

cl-data-structures.utils.

Source

parallel-tools.lisp.

Function: make-qp-trie-node (&key bitmask content ownership-tag)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: make-reservoir-sampling (sample-size)
Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Function: make-rrb-node (&key content ownership-tag)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: make-skip-list-node (&key pointers content)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: make-skip-list-node-of-level (level &optional value assoc)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: make-skip-list-node-of-random-level (maximum-level &optional value)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: make-sparse-rrb-node (&key content bitmask ownership-tag)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: make-synchronized-mutable-2-3-queue (&key element-type capacity)
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Function: make-synchronized-transactional-2-3-queue (&key element-type capacity)
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Function: make-transactional-2-3-queue (&key element-type)

Returns:
Empty transactional-2-3-queue

Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Function: make-transactional-hamt-dictionary (hash-fn equal-fn)

Syntax:
make-transactional-hamt-dictionary hash-fn equal-fn &key max-depth => mutable-hamt-dictionary

Description:
Constructs and returns a new mutable-hamt-dictionary

Returns:
new instance of transactional-hamt-dictionary.

Notes:
In theory HAMT can use infinite length of hash but this implementation uses 60 oldest bits at most.

Package

cl-data-structures.dicts.hamt.

Source

api.lisp.

Function: make-transactional-rrb-vector (&rest all &key element-type)

Description:
Creates and returns a new instance of transactional-rrb-vector

Package

cl-data-structures.sequences.rrb-vector.

Source

api.lisp.

Function: make-transactional-sparse-rrb-vector (&key element-type)

Description:
Constructs and returns a transactional variant of the sparse rrb vector.

Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Function: map-qp-trie-nodes (function node &optional ac)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: merge-ordered-vectors (result compare-fn vector &rest vectors)

Take few ordered vectors (by function compare-fn) and create new vector of element-type RESULT-TYPE by copying values from vectors in such way that it is also ordered. Return new vector.

@b(Arguments and values:)
@begin(list)
@item(result-type – element-type of result vector)
@item(compare-fn – function that describes ordering of vectors)
@item(vector) – ordered vector that is about to be merged
@item(vectors – more ordered vectors that are about to be merged)
@end(list)

@b(Side effects:) none.

Package

cl-data-structures.utils.

Source

ordered-algorithms.lisp.

Function: method-lambda-list-to-function-lambda-list (lambda-list)
Package

cl-data-structures.utils.

Source

lambda-lists.lisp.

Function: minhash-jaccard/double-float (a b)

Description:
Calculates Jaccard distance as a double-float between two minhash vectors.

Returns:
Jaccard distance between two minhash vectors (as a DOUBLE-FLOAT).

Exceptional situations:
–Will signal INCOMPATIBLE-ARGUMENTS when input vectors are of a different lengths.
–Will signal TYPE-ERROR if either A or B is not of the type (SIMPLE-ARRAY FIXNUM (*)).

Notes:
–Minhashes by it’s very nature are just efficient approximation of the sets, and so the Jaccard distance calculated between minhashes may differ from the precise Jaccard distance between sets.

Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Function: minhash-jaccard/fixnum (a b)

Description:
Calculates distance between two minhash vectors.

Returns:
Number of positions in the vectors that hold different values (as a FIXNUM).

Exceptional situations:
–Will signal INCOMPATIBLE-ARGUMENTS when input vectors are of a different lengths.
–Will signal TYPE-ERROR if either A or B is not of the type (SIMPLE-ARRAY FIXNUM (*)).

Notes:
–Although function is called Jaccard, technically it does not calculate the Jaccard distance because Jaccard distance is bound between 0 and 1.
–Minhashes by it’s very nature are just efficient approximation of the sets, and so the Jaccard distance calculated between minhashes may differ from the precise Jaccard distance between sets.

Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Function: minhash-jaccard/single-float (a b)

Description:
Calculates Jaccard distance as a single-float between two minhash vectors.

Returns:
Jaccard distance between two minhash vectorsa (as a SINGLE-FLOAT).

Exceptional situations:
–Will signal INCOMPATIBLE-ARGUMENTS when input vectors are of a different lengths.
–Will signal TYPE-ERROR if either A or B is not of the type (SIMPLE-ARRAY FIXNUM (*)).

Notes:
–Minhashes by it’s very nature are just efficient approximation of the sets, and so the Jaccard distance calculated between minhashes may differ from the precise Jaccard distance between sets.

Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Function: modulo-range (size &key start by)
Package

cl-data-structures.

Source

functions.lisp.

Function: mref (matrix from to)

Description:
Matrix reference. Accessor for values in matrices.

Package

cl-data-structures.utils.

Source

distances.lisp.

Function: (setf mref) (matrix from to)
Package

cl-data-structures.utils.

Source

distances.lisp.

Function: mutable-sparse-rrb-vector-grow (operation structure container position all value)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: new-cell (node)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: new-node-update-pointers! (test spliced-node pointers)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: new-sketch ()
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: normalize-sequence-to-span (sequence min max)

Description:
Normalizes SEQUENCE of numbers so every element is between MIN and MAX

Returns:
SEQUENCE

Exceptional situations:
Assert: (< MIN MAX)

Side Effects:
Mutates SEQUENCE.

Package

cl-data-structures.utils.

Source

lists.lisp.

Function: normalize-sequence-to-sum (sequence sum)

Description:
Normalizes SEQUENCE of numbers so sum of elements is equal to SUM.

Returns:
SEQUENCE

Side Effects:
Mutates SEQUENCE.

Package

cl-data-structures.utils.

Source

lists.lisp.

Function: nref (node position)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: (setf nref) (node position)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: null-bucket-p (bucket)
Package

cl-data-structures.meta.

Source

meta.lisp.

Function: obtain-value (pull push)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: on-ordered-intersection (function first-order second-order &key on-first-missing on-second-missing key first-key second-key same less)
Package

cl-data-structures.utils.

Source

ordered-algorithms.lisp.

Function: one-bit-minhash-jaccard/double-float (a b)
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Function: one-bit-minhash-jaccard/fixnum (a b)
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Function: one-bit-minhash-jaccard/single-float (a b)
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Function: or* (&rest functions)
Package

cl-data-structures.utils.

Source

higher-order.lisp.

Function: ordered-exclusion (compare-fn test-fn vector &rest more-vectors)
Package

cl-data-structures.utils.

Source

ordered-algorithms.lisp.

Function: ordered-intersection (compare-fn test-fn vector &rest more-vectors)
Package

cl-data-structures.utils.

Source

ordered-algorithms.lisp.

Function: ordered-p (sequence fn &key key)

Predictate. Checks if SEQUENCE is ordered by FN (that is, if call to (fn prev current) always returns T).

@b(Side Effects:) none.

Package

cl-data-structures.utils.

Source

ordered-algorithms.lisp.

Function: parallel-fill-distance-matrix-from-vector (matrix function sequence &key key key-context function-context)
Package

cl-data-structures.utils.

Source

distances.lisp.

Function: parallel-make-distance-matrix-from-vector (type function sequence &key key key-context function-context query-key)
Package

cl-data-structures.utils.

Source

distances.lisp.

Function: pass-to-aggregation (aggregator element)

Arguments:
–AGGREGATOR, Instance of aggregator.
–ELEMENT, Element that is supposed to be aggregated.

Description:
Passes ELEMENT to the AGGREGATOR.

Affected by
Class of AGGREGATOR.

Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Function: path-scaner (path &key flatten-lists flatten-vectors)
Package

cl-data-structures.

Source

expression-wrapper.lisp.

Function: pop-last (vector)

If fill pointer is larger than zero reduce fill pointer and @b(returns) last vector element.

@b(Side effects:) reduce fill pointer of vector.

@b(Exceptional situations:) will return nil if fill pointer is equal 0.

Package

cl-data-structures.utils.

Source

modification-algorithms.lisp.

Function: position-modification (operations container locations value &rest all)
Package

cl-data-structures.composite.

Source

implementation.lisp.

Function: position-modification! (operations container locations value &rest all)
Package

cl-data-structures.composite.

Source

implementation.lisp.

Function: prevent-duplicates (&key test key)
Package

cl-data-structures.utils.

Source

higher-order.lisp.

Function: prune-subtrees (container trees close-range distant-range value margin)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: qp-trie-delete! (qp-trie bytes)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-find (qp-trie bytes)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-bitmask (argument)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: (setf qp-trie-node-bitmask) (argument)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-children-bitmask (node)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: (setf qp-trie-node-children-bitmask) (node)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-clone (node &optional ownership-tag)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-content (argument)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: (setf qp-trie-node-content) (argument)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-delete! (node index)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-leaf-present-p (node half-byte)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-present-p (node index)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-ref (node index)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-store-bitmask (node)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: (setf qp-trie-node-store-bitmask) (node)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-unmark-leaf! (node index)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: quasi-clone (instance initarg initval)
Package

cl-data-structures.utils.

Source

cloning.lisp.

Function: random-level (maximum-level)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: rebuild-rehashed-node (container depth conflict ownership-tag)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: rehash (conflict level cont)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: remove-fill-pointer (vector)

Description:
Accepts vector. Will return vector with the same content, but without fill-pointer.

Returns:
VECTOR

Exceptional situations:
TYPE-ERROR if VECTOR is not of type CL:VECTOR.

Package

cl-data-structures.utils.

Source

arrays.lisp.

Function: remove-tail (rrb-container)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: replica (object isolate)
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Function: reservoir-sampling-push (reservoir-sampling element)
Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Reader: reservoir-sampling-result (instance)
Writer: (setf reservoir-sampling-result) (instance)
Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Target Slot

result.

Function: rol64 (x k)
Package

cl-data-structures.utils.

Source

hashing.lisp.

Function: rrb-at (container index)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: rrb-node-content (node)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: rrb-node-push! (node position element)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: rrb-node-push-into-copy (node position element ownership-tag)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: scan (function sequence &rest args &key key from-end start initial-value)
Package

cl-data-structures.utils.

Source

lists.lisp.

Function: scan-index-bound (structure)

Returns index-bound from the tree.

Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: select-top (vector count predicate &key key)

Description:
Selects top elements from the vector, using heap select algorithm.

Returns:
Vector containing COUNT of top elements from the vector.

Side Effects:
Will mutate orderd of elements in the VECTOR.

Package

cl-data-structures.utils.

Source

arrays.lisp.

Function: shift-for-position (position)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: shuffled-range (from to)

Arguments:
–FROM, The lowest integer.
–TO, The highest integer.

Description:
Creates a range of shuffled integers from FROM, to TO.

Returns:
FUNDAMENTAL-FORWARD-RANGE instance.

Exceptional situations:
–Raises TYPE-ERROR if FROM or TO is not an integer.
–TO must be equal or greater than FROM, otherwise the incompatible-arguments error is signaled.

Package

cl-data-structures.algorithms.

Source

shuffled-range.lisp.

Function: single-element-p (seq)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: skip-list-locate-node (skip-list item)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: skip-list-node-at (skip-list-node index)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: (setf skip-list-node-at) (skip-list-node index)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: skip-list-node-compare (test node1 node2)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Reader: skip-list-node-content (instance)
Writer: (setf skip-list-node-content) (instance)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Target Slot

content.

Function: skip-list-node-level (skip-list-node)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Reader: skip-list-node-pointers (instance)
Writer: (setf skip-list-node-pointers) (instance)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Target Slot

pointers.

Function: skip-list-node-update-pointers! (skip-list-node new-pointers)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: sparse-nref (node index)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: (setf sparse-nref) (node index)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: sparse-rrb-node-bitmask (argument)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: (setf sparse-rrb-node-bitmask) (argument)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: sparse-rrb-node-contains (node index)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: sparse-rrb-node-content (argument)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: (setf sparse-rrb-node-content) (argument)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: sparse-rrb-node-erase (node i &optional ownership-tag)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: sparse-rrb-node-erase! (node i)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: sparse-rrb-node-size (node)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: sparse-rrb-tree-map (tree depth &key tree-function leaf-function)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: sparse-rrb-tree-size (tree depth)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: sparse-rrb-vector-at (vect position)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Function: square (number)
Package

cl-data-structures.utils.

Source

numbers.lisp.

Function: swap-if (vector test &key key start end)
Package

cl-data-structures.utils.

Source

modification-algorithms.lisp.

Function: swapop (vector index)

Swaps element under INDEX with last element of VECTOR. Pops last element and returns removed element.

@b(Values and parameters:)
@begin(list)
@item(vector – input vector)
@item(index – under which index element will be removed?)
@end(list)

@b(Side Effects:) changes element under INDEX to last element in the vector, reduces fill-pointer.

Package

cl-data-structures.utils.

Source

modification-algorithms.lisp.

Function: tokenize (path regex &key case-insensitive-mode)
Package

cl-data-structures.file-system.

Source

tokenize.lisp.

Function: transactional-copy-on-write (container ownership-tag indexes path depth conflict)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: transactional-copy-on-write (path indexes shift ownership-tag tail)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: transactional-delete-back-from-tree! (tree)
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Function: transactional-insert-front-into-tree! (tree new)
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Function: transactional-insert-tail! (structure ownership-tag)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: transactional-sparse-rrb-vector-grow (operation structure container position all value)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: transform (function sequence &rest more-sequences)
Package

cl-data-structures.utils.

Source

lists.lisp.

Function: traverse-impl (container function)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: traverse-multiple (function range &rest more)
Package

cl-data-structures.

Source

functions.lisp.

Function: try-find (item list &key test key)

@b(Returns) first matching elements as first value and boolean telling if it was found as second

Package

cl-data-structures.utils.

Source

lists.lisp.

Function: try-find-cell (item list &key test key)

@b(Returns) first matching sublist

Package

cl-data-structures.utils.

Source

lists.lisp.

Function: try-remove (item list &key test key preserve-order)

Try to remove first item matching from the list.

@b(Returns three values:)
@begin(list)
@item(first – new list)
@item(second – did anything was removed?)
@item(third – value that was removed (or nil if nothing was removed)) @end(list)

Package

cl-data-structures.utils.

Source

lists.lisp.

Function: unfold-table (table)
Package

cl-data-structures.utils.

Source

arrays.lisp.

Function: union (sketch &rest more-sketches)
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: update-head-pointers! (skip-list skip-list-node)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: validate-fields (function fields)
Package

cl-data-structures.

Source

field.lisp.

Function: xorshift (n i)
Package

cl-data-structures.utils.

Source

hashing.lisp.

Function: zip (function range &rest ranges)

Arguments:
–FUNCTION, Function used to join contents of the RANGES.
–RANGES, Input.

Examples:
(prove:is (cl-ds.alg:to-vector (cl-ds.alg:zip #’list ’(1 2 3) ’(4 5 6)))
#((1 4) (2 5) (3 6))
:test #’equalp)

Description:
Combines multiple ranges into a single range by applying FUNCTION elementwise.

Returns:
New fundamental-forward-range instance.

Exceptional situations:
–Raises TYPE-ERROR if any of the input ranges is not (OR CL:SEQUENCE FUNDAMENTAL-FORWARD-RANGE). –Will raise TYPE-ERROR if FUNCTION is not FUNCALLABLE.

Notes:
Can be considered to be lazy variant of CL:MAP function called on multiple sequences.

Package

cl-data-structures.algorithms.

Source

zip.lisp.

Function: zip-traversable (function ranges)
Package

cl-data-structures.algorithms.

Source

zip.lisp.


6.1.6 Generic functions

Generic Function: %summary (range ids constructors)
Package

cl-data-structures.algorithms.

Source

summary.lisp.

Methods
Method: %summary (range ids constructors)
Generic Function: absolute-value-norm (range &key key)
Package

cl-data-structures.math.

Source

absolute-value-norm.lisp.

Methods
Method: absolute-value-norm (range &key key)
Generic Reader: access-content (object)
Package

cl-data-structures.common.

Methods
Reader Method: access-content ((box-container box-container))

automatically generated reader method

Source

lazy-box.lisp.

Target Slot

%content.

Generic Writer: (setf access-content) (object)
Package

cl-data-structures.common.

Methods
Writer Method: (setf access-content) ((box-container box-container))

automatically generated writer method

Source

lazy-box.lisp.

Target Slot

%content.

Generic Reader: access-current-position (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: access-current-position ((file-range-mixin file-range-mixin))

automatically generated reader method

Source

common.lisp.

Target Slot

%current-position.

Generic Writer: (setf access-current-position) (object)
Package

cl-data-structures.file-system.

Methods
Writer Method: (setf access-current-position) ((file-range-mixin file-range-mixin))

automatically generated writer method

Source

common.lisp.

Target Slot

%current-position.

Generic Reader: access-functor (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: access-functor ((proxy-box-range proxy-box-range))

automatically generated reader method

Source

on-each.lisp.

Target Slot

%functor.

Generic Writer: (setf access-functor) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf access-functor) ((proxy-box-range proxy-box-range))

automatically generated writer method

Source

on-each.lisp.

Target Slot

%functor.

Generic Reader: access-index-bound (object)
Package

cl-data-structures.dicts.srrb.

Methods
Reader Method: access-index-bound ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated reader method

Source

types.lisp.

Target Slot

%index-bound.

Generic Writer: (setf access-index-bound) (object)
Package

cl-data-structures.dicts.srrb.

Methods
Writer Method: (setf access-index-bound) ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated writer method

Source

types.lisp.

Target Slot

%index-bound.

Generic Reader: access-last-size (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: access-last-size ((rrb-range rrb-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%last-size.

Generic Writer: (setf access-last-size) (object)
Package

cl-data-structures.common.rrb.

Methods
Writer Method: (setf access-last-size) ((rrb-range rrb-range))

automatically generated writer method

Source

common.lisp.

Target Slot

%last-size.

Generic Reader: access-left (object)
Package

cl-data-structures.common.2-3-tree.

Methods
Reader Method: access-left ((3-node 3-node))

automatically generated reader method

Source

common.lisp.

Target Slot

%left.

Reader Method: access-left ((2-node 2-node))

automatically generated reader method

Source

common.lisp.

Target Slot

%left.

Generic Writer: (setf access-left) (object)
Package

cl-data-structures.common.2-3-tree.

Methods
Writer Method: (setf access-left) ((3-node 3-node))

automatically generated writer method

Source

common.lisp.

Target Slot

%left.

Writer Method: (setf access-left) ((2-node 2-node))

automatically generated writer method

Source

common.lisp.

Target Slot

%left.

Generic Reader: access-lower-bound (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: access-lower-bound ((rrb-range rrb-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%lower-bound.

Generic Writer: (setf access-lower-bound) (object)
Package

cl-data-structures.common.rrb.

Methods
Writer Method: (setf access-lower-bound) ((rrb-range rrb-range))

automatically generated writer method

Source

common.lisp.

Target Slot

%lower-bound.

Generic Reader: access-maximum-level (object)
Package

cl-data-structures.common.skip-list.

Methods
Reader Method: access-maximum-level ((fundamental-skip-list fundamental-skip-list))

automatically generated reader method

Source

common.lisp.

Target Slot

%maximum-level.

Generic Writer: (setf access-maximum-level) (object)
Package

cl-data-structures.common.skip-list.

Methods
Writer Method: (setf access-maximum-level) ((fundamental-skip-list fundamental-skip-list))

automatically generated writer method

Source

common.lisp.

Target Slot

%maximum-level.

Generic Reader: access-middle (object)
Package

cl-data-structures.common.2-3-tree.

Methods
Reader Method: access-middle ((3-node 3-node))

automatically generated reader method

Source

common.lisp.

Target Slot

%middle.

Generic Writer: (setf access-middle) (object)
Package

cl-data-structures.common.2-3-tree.

Methods
Writer Method: (setf access-middle) ((3-node 3-node))

automatically generated writer method

Source

common.lisp.

Target Slot

%middle.

Generic Reader: access-reached-end (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: access-reached-end ((file-range-mixin file-range-mixin))

automatically generated reader method

Source

common.lisp.

Target Slot

%reached-end.

Generic Writer: (setf access-reached-end) (object)
Package

cl-data-structures.file-system.

Methods
Writer Method: (setf access-reached-end) ((file-range-mixin file-range-mixin))

automatically generated writer method

Source

common.lisp.

Target Slot

%reached-end.

Generic Reader: access-right (object)
Package

cl-data-structures.common.2-3-tree.

Methods
Reader Method: access-right ((3-node 3-node))

automatically generated reader method

Source

common.lisp.

Target Slot

%right.

Reader Method: access-right ((2-node 2-node))

automatically generated reader method

Source

common.lisp.

Target Slot

%right.

Generic Writer: (setf access-right) (object)
Package

cl-data-structures.common.2-3-tree.

Methods
Writer Method: (setf access-right) ((3-node 3-node))

automatically generated writer method

Source

common.lisp.

Target Slot

%right.

Writer Method: (setf access-right) ((2-node 2-node))

automatically generated writer method

Source

common.lisp.

Target Slot

%right.

Generic Reader: access-root (object)
Package

cl-data-structures.common.2-3-tree.

Methods
Reader Method: access-root ((tree tree))

automatically generated reader method

Source

common.lisp.

Target Slot

%root.

Generic Writer: (setf access-root) (object)
Package

cl-data-structures.common.2-3-tree.

Methods
Writer Method: (setf access-root) ((tree tree))

automatically generated writer method

Source

common.lisp.

Target Slot

%root.

Generic Reader: access-root (object)
Generic Writer: (setf access-root) (object)
Package

cl-data-structures.common.hamt.

Methods
Reader Method: access-root ((hamt-container hamt-container))
Writer Method: (setf access-root) ((hamt-container hamt-container))

Hash node pointing to root of the whole hash tree.

Source

common.lisp.

Target Slot

%root.

Generic Reader: access-root (object)
Generic Writer: (setf access-root) (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: access-root ((rrb-container rrb-container))
Writer Method: (setf access-root) ((rrb-container rrb-container))

root of the tree

Source

common.lisp.

Target Slot

%root.

Generic Reader: access-root (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: access-root ((fundamental-egnat-container fundamental-egnat-container))

automatically generated reader method

Source

classes.lisp.

Target Slot

%root.

Generic Writer: (setf access-root) (object)
Package

cl-data-structures.common.egnat.

Methods
Writer Method: (setf access-root) ((fundamental-egnat-container fundamental-egnat-container))

automatically generated writer method

Source

classes.lisp.

Target Slot

%root.

Generic Reader: access-root (object)
Package

cl-data-structures.common.qp-trie.

Methods
Reader Method: access-root ((qp-trie qp-trie))

automatically generated reader method

Source

qp-trie.lisp.

Target Slot

%root.

Generic Writer: (setf access-root) (object)
Package

cl-data-structures.common.qp-trie.

Methods
Writer Method: (setf access-root) ((qp-trie qp-trie))

automatically generated writer method

Source

qp-trie.lisp.

Target Slot

%root.

Generic Reader: access-shift (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: access-shift ((rrb-container rrb-container))

automatically generated reader method

Source

common.lisp.

Target Slot

%shift.

Generic Writer: (setf access-shift) (object)
Package

cl-data-structures.common.rrb.

Methods
Writer Method: (setf access-shift) ((rrb-container rrb-container))

automatically generated writer method

Source

common.lisp.

Target Slot

%shift.

Generic Reader: access-shift (object)
Package

cl-data-structures.dicts.srrb.

Methods
Reader Method: access-shift ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated reader method

Source

types.lisp.

Target Slot

%shift.

Generic Writer: (setf access-shift) (object)
Package

cl-data-structures.dicts.srrb.

Methods
Writer Method: (setf access-shift) ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated writer method

Source

types.lisp.

Target Slot

%shift.

Generic Reader: access-size (object)
Generic Writer: (setf access-size) (object)
Package

cl-data-structures.common.hamt.

Methods
Reader Method: access-size ((hamt-container hamt-container))
Writer Method: (setf access-size) ((hamt-container hamt-container))

How many elements are in there?

Source

common.lisp.

Target Slot

%size.

Generic Reader: access-size (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: access-size ((rrb-container rrb-container))

automatically generated reader method

Source

common.lisp.

Target Slot

%size.

Generic Writer: (setf access-size) (object)
Package

cl-data-structures.common.rrb.

Methods
Writer Method: (setf access-size) ((rrb-container rrb-container))

automatically generated writer method

Source

common.lisp.

Target Slot

%size.

Generic Reader: access-size (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: access-size ((fundamental-egnat-container fundamental-egnat-container))

automatically generated reader method

Source

classes.lisp.

Target Slot

%size.

Generic Writer: (setf access-size) (object)
Package

cl-data-structures.common.egnat.

Methods
Writer Method: (setf access-size) ((fundamental-egnat-container fundamental-egnat-container))

automatically generated writer method

Source

classes.lisp.

Target Slot

%size.

Generic Reader: access-size (object)
Package

cl-data-structures.queues.

Methods
Reader Method: access-size ((fundamental-queue fundamental-queue))

automatically generated reader method

Source

common.lisp.

Target Slot

%size.

Generic Writer: (setf access-size) (object)
Package

cl-data-structures.queues.

Methods
Writer Method: (setf access-size) ((fundamental-queue fundamental-queue))

automatically generated writer method

Source

common.lisp.

Target Slot

%size.

Generic Reader: access-start (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: access-start ((rrb-range rrb-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%start.

Generic Writer: (setf access-start) (object)
Package

cl-data-structures.common.rrb.

Methods
Writer Method: (setf access-start) ((rrb-range rrb-range))

automatically generated writer method

Source

common.lisp.

Target Slot

%start.

Generic Reader: access-tail (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: access-tail ((rrb-container rrb-container))

automatically generated reader method

Source

common.lisp.

Target Slot

%tail.

Generic Writer: (setf access-tail) (object)
Package

cl-data-structures.common.rrb.

Methods
Writer Method: (setf access-tail) ((rrb-container rrb-container))

automatically generated writer method

Source

common.lisp.

Target Slot

%tail.

Generic Reader: access-tail (object)
Package

cl-data-structures.dicts.srrb.

Methods
Reader Method: access-tail ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated reader method

Source

types.lisp.

Target Slot

%tail.

Generic Writer: (setf access-tail) (object)
Package

cl-data-structures.dicts.srrb.

Methods
Writer Method: (setf access-tail) ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated writer method

Source

types.lisp.

Target Slot

%tail.

Generic Reader: access-tail-mask (object)
Package

cl-data-structures.dicts.srrb.

Methods
Reader Method: access-tail-mask ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated reader method

Source

types.lisp.

Target Slot

%tail-mask.

Generic Writer: (setf access-tail-mask) (object)
Package

cl-data-structures.dicts.srrb.

Methods
Writer Method: (setf access-tail-mask) ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated writer method

Source

types.lisp.

Target Slot

%tail-mask.

Generic Reader: access-tail-size (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: access-tail-size ((rrb-container rrb-container))

automatically generated reader method

Source

common.lisp.

Target Slot

%tail-size.

Generic Writer: (setf access-tail-size) (object)
Package

cl-data-structures.common.rrb.

Methods
Writer Method: (setf access-tail-size) ((rrb-container rrb-container))

automatically generated writer method

Source

common.lisp.

Target Slot

%tail-size.

Generic Reader: access-test-function (object)
Package

cl-data-structures.common.skip-list.

Methods
Reader Method: access-test-function ((fundamental-skip-list fundamental-skip-list))

automatically generated reader method

Source

common.lisp.

Target Slot

%test-function.

Generic Writer: (setf access-test-function) (object)
Package

cl-data-structures.common.skip-list.

Methods
Writer Method: (setf access-test-function) ((fundamental-skip-list fundamental-skip-list))

automatically generated writer method

Source

common.lisp.

Target Slot

%test-function.

Generic Reader: access-tree (object)
Package

cl-data-structures.dicts.srrb.

Methods
Reader Method: access-tree ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated reader method

Source

types.lisp.

Target Slot

%tree.

Generic Writer: (setf access-tree) (object)
Package

cl-data-structures.dicts.srrb.

Methods
Writer Method: (setf access-tree) ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated writer method

Source

types.lisp.

Target Slot

%tree.

Generic Reader: access-tree-index-bound (object)
Package

cl-data-structures.dicts.srrb.

Methods
Reader Method: access-tree-index-bound ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated reader method

Source

types.lisp.

Target Slot

%tree-index-bound.

Generic Writer: (setf access-tree-index-bound) (object)
Package

cl-data-structures.dicts.srrb.

Methods
Writer Method: (setf access-tree-index-bound) ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated writer method

Source

types.lisp.

Target Slot

%tree-index-bound.

Generic Reader: access-tree-size (object)
Package

cl-data-structures.dicts.srrb.

Methods
Reader Method: access-tree-size ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated reader method

Source

types.lisp.

Target Slot

%tree-size.

Generic Writer: (setf access-tree-size) (object)
Package

cl-data-structures.dicts.srrb.

Methods
Writer Method: (setf access-tree-size) ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated writer method

Source

types.lisp.

Target Slot

%tree-size.

Generic Reader: access-upper-bound (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: access-upper-bound ((rrb-range rrb-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%upper-bound.

Generic Writer: (setf access-upper-bound) (object)
Package

cl-data-structures.common.rrb.

Methods
Writer Method: (setf access-upper-bound) ((rrb-range rrb-range))

automatically generated writer method

Source

common.lisp.

Target Slot

%upper-bound.

Generic Function: across (object function)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: across ((range moving-average-range) function)
Source

moving-average.lisp.

Method: across ((range line-by-line-range) function)
Source

line-by-line.lisp.

Method: across ((range file-range-mixin) function)
Source

common.lisp.

Method: across ((range abstract-sliding-window-proxy) function)
Source

sliding-window.lisp.

Method: across ((range distinct-proxy) function)
Source

distinct.lisp.

Method: across ((range forward-partition-if-proxy) function)
Source

partition-if.lisp.

Method: across ((range flatten-proxy) function)
Source

flatten-lists.lisp.

Method: across ((range forward-chain-of-ranges) function)
Source

chain.lisp.

Method: across ((range cumulative-accumulate-range) function)
Source

cumulative-accumulate.lisp.

Method: across ((range forward-establish-special-proxy-range) function)
Source

establish-special.lisp.

Method: across ((range latch-proxy) function)
Source

latch.lisp.

Method: across ((range repeat-proxy) function)
Source

repeat.lisp.

Method: across ((range restrain-size-proxy) function)
Source

restrain-size.lisp.

Method: across ((range multiplex-proxy) function)
Source

multiplex.lisp.

Method: across ((range filtering-proxy) function)
Source

filtering.lisp.

Method: across ((range forward-proxy-box-range) function)
Source

on-each.lisp.

Method: across ((range proxy-range) function)
Source

common.lisp.

Method: across ((range mutable-skip-list-set-range) function)
Source

api.lisp.

Method: across ((object qp-trie-set-range) function)
Source

api.lisp.

Method: across ((object fundamental-qp-trie-set) function)
Source

api.lisp.

Method: across ((container synchronization-primitives-mixin) function)
Source

api.lisp.

Method: across ((range 2-3-queue-range) function)
Source

api.lisp.

Method: across ((container 2-3-queue) function)
Source

api.lisp.

Method: across ((vector fundamental-sparse-rrb-vector) function)
Source

api.lisp.

Method: across ((container hamt-dictionary) function)
Source

api.lisp.

Method: across ((range mutable-skip-list-dictionary-range) function)
Source

api.lisp.

Method: across ((container fundamental-egnat-container) function)
Source

methods.lisp.

Method: across ((range egnat-range) function)
Source

methods.lisp.

Method: across ((object fundamental-skip-list) function)
Source

common.lisp.

Method: across ((object fundamental-skip-list-range) function)
Source

common.lisp.

Method: across ((range rrb-range) function)
Source

common.lisp.

Method: across ((container sequence-window) function)
Source

sequence-window.lisp.

Method: across ((range forward-tree-range) function)
Source

ranges.lisp.

Method: across ((range lazy-forward-range) function)
Source

lazy-range.lisp.

Method: across :before ((range lazy-range) function)
Source

lazy-range.lisp.

Method: across ((obj list-range) function)
Source

list.lisp.

Method: across ((range vector-range) function)
Source

vector.lisp.

Method: across ((range empty-range) function)
Source

auxilary.lisp.

Method: across ((obj expression) function)
Source

expression-wrapper.lisp.

Method: across ((range chunked-range) function)
Method: across ((object sequence) function)
Method: across ((object fundamental-container) function)
Method: across ((object fundamental-range) function)
Generic Function: across-aggregate (range function)
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Methods
Method: across-aggregate ((range cumulative-accumulate-function) function)
Source

cumulative-accumulate.lisp.

Method: across-aggregate ((range latch-proxy) function)
Source

latch.lisp.

Method: across-aggregate ((range multiplex-proxy) function)
Source

multiplex.lisp.

Method: across-aggregate ((range proxy-range) function)
Source

common.lisp.

Method: across-aggregate ((range traversable) function)
Method: across-aggregate ((range sequence) function)
Generic Function: add (container location new-value)

Examples:
(let* ((_ (cl-ds.dicts.hamt:make-functional-hamt-dictionary #’sxhash #’eq))
(_ (cl-ds:add _ 0 ’a))
(_ (cl-ds:add _ 0 ’b))
(_ (cl-ds:add _ 1 ’c))
(_ (cl-ds:insert _ 1 ’d))
(_ (cl-ds.alg:to-vector _ ))
(_ (sort _ #’< :key #’car)))
(prove:is _ ’#((0 . a) (1 . d)) :test #’equalp))

Description:
Add NEW-VALUE into the CONTAINER at the LOCATION. Will not replace a value at LOCATION if it was already occupied.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: add ((container functional-sparse-vector) location new-value)
Source

api.lisp.

Method: add ((container functional-dictionary) location new-value)
Source

api.lisp.

Generic Function: add! (container location new-value)

Syntax:
add! container location new-value => same-container status

Arguments:
–CONTAINER, Instance that we intend to destructivly modify
–LOCATION, Place in the CONTAINER that we intend to change
–NEW-VALUE, Value that we intend to add into CONTAINER

Description:
Destructively add the NEW-VALUE into the CONTAINER at the LOCATION. Will not replace a value at LOCATION if it was already occupied.

Returns:
–CONTAINER
–Modification status object

Side Effects:
If item was not found in the CONTAINER, destructivly transform CONTAINER.

Notes:
This is the destructive counterpart to the ADD function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: add! ((container mutable-dictionary) location new-value)
Source

api.lisp.

Method: add! ((container mutable-sparse-vector) location new-value)
Source

api.lisp.

Generic Function: add-into-queue (pipe x)
Package

cl-data-structures.utils.

Source

parallel-tools.lisp.

Methods
Method: add-into-queue ((obj pipe-fragment) x)
Generic Function: add-sinks (pipe sink &rest sinks)
Package

cl-data-structures.utils.

Source

parallel-tools.lisp.

Methods
Method: add-sinks ((pipe pipe-fragment) sink &rest sinks)
Generic Function: aggregator-constructor (range outer-constructor function arguments)
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Methods
Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 gather-corpus-function) (!arguments5 list))
Source

minhash.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 gather-corpus-function) (!arguments5 list))
Source

minhash.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 bloom-filter-function) (!arguments5 list))
Source

bloom-filter.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 bloom-filter-function) (!arguments5 list))
Source

bloom-filter.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 approximated-top-k-function) (!arguments5 list))
Source

approximated-top-k.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 approximated-top-k-function) (!arguments5 list))
Source

approximated-top-k.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 approximated-counts-function) (!arguments5 list))
Source

approximated-counts.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 approximated-counts-function) (!arguments5 list))
Source

approximated-counts.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 approximated-set-cardinality-function) (!arguments5 list))
Source

approximated-set-cardinality.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 approximated-set-cardinality-function) (!arguments5 list))
Source

approximated-set-cardinality.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 approximated-histogram-function) (!arguments5 list))
Source

approximated-histogram.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 approximated-histogram-function) (!arguments5 list))
Source

approximated-histogram.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 array-sum-function) (!arguments5 list))
Source

sum.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 array-sum-function) (!arguments5 list))
Source

sum.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 sum-function) (!arguments5 list))
Source

sum.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 sum-function) (!arguments5 list))
Source

sum.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 fast-map-function) (!arguments5 list))
Source

fast-map.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 fast-map-function) (!arguments5 list))
Source

fast-map.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 entropy-function) (!arguments5 list))
Source

entropy.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 entropy-function) (!arguments5 list))
Source

entropy.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 gini-impurity-function) (!arguments5 list))
Source

gini-impurity.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 gini-impurity-function) (!arguments5 list))
Source

gini-impurity.lisp.

Method: aggregator-constructor ((range bootstrap-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

bootstrap.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 moments-function) (!arguments5 list))
Source

moments.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 moments-function) (!arguments5 list))
Source

moments.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 standard-deviation-function) (!arguments5 list))
Source

standard-deviation.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 standard-deviation-function) (!arguments5 list))
Source

standard-deviation.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 co-occurence-table-function) (!arguments5 list))
Source

co-occurence-table.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 co-occurence-table-function) (!arguments5 list))
Source

co-occurence-table.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 hodges-lehmann-estimator-function) (!arguments5 list))
Source

hodges-lehmann.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 hodges-lehmann-estimator-function) (!arguments5 list))
Source

hodges-lehmann.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 median-absolute-deviation-function) (!arguments5 list))
Source

median-absolute-deviation.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 median-absolute-deviation-function) (!arguments5 list))
Source

median-absolute-deviation.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 simple-linear-regression-function) (!arguments5 list))
Source

simple-linear-regression.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 simple-linear-regression-function) (!arguments5 list))
Source

simple-linear-regression.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 optimal-split-point-function) (!arguments5 list))
Source

mutual-information.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 optimal-split-point-function) (!arguments5 list))
Source

mutual-information.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 harmonic-average-mutual-information-function) (!arguments5 list))
Source

mutual-information.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 harmonic-average-mutual-information-function) (!arguments5 list))
Source

mutual-information.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 mutual-information-matrix-function) (!arguments5 list))
Source

mutual-information.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 mutual-information-matrix-function) (!arguments5 list))
Source

mutual-information.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 mutual-information-function) (!arguments5 list))
Source

mutual-information.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 mutual-information-function) (!arguments5 list))
Source

mutual-information.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 variance-function) (!arguments5 list))
Source

variance.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 variance-function) (!arguments5 list))
Source

variance.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 array-harmonic-average-function) (!arguments5 list))
Source

average.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 array-harmonic-average-function) (!arguments5 list))
Source

average.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 array-geometric-average-function) (!arguments5 list))
Source

average.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 array-geometric-average-function) (!arguments5 list))
Source

average.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 array-average-function) (!arguments5 list))
Source

average.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 array-average-function) (!arguments5 list))
Source

average.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 geometric-average-function) (!arguments5 list))
Source

average.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 geometric-average-function) (!arguments5 list))
Source

average.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 harmonic-average-function) (!arguments5 list))
Source

average.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 harmonic-average-function) (!arguments5 list))
Source

average.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 average-function) (!arguments5 list))
Source

average.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 average-function) (!arguments5 list))
Source

average.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 absolute-value-norm-function) (!arguments5 list))
Source

absolute-value-norm.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 absolute-value-norm-function) (!arguments5 list))
Source

absolute-value-norm.lisp.

Method: aggregator-constructor ((range buffer-range) outer-constructor (function aggregation-function) (arguments list))
Source

buffer-range.lisp.

Method: aggregator-constructor ((range parallel-on-each-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

parallel-on-each.lisp.

Method: aggregator-constructor ((range parallel-group-by-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

parallel-group-by.lisp.

Method: aggregator-constructor ((range parallel-forward-multiplex-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

parallel-multiplex.lisp.

Method: aggregator-constructor ((range with-previous-element-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

with-previous-element.lisp.

Method: aggregator-constructor ((range abstract-sliding-window-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

sliding-window.lisp.

Method: aggregator-constructor ((range abstract-in-batches-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

in-batches.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 last-element-function) (!arguments5 list))
Source

first-element.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 last-element-function) (!arguments5 list))
Source

first-element.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 first-element-function) (!arguments5 list))
Source

first-element.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 first-element-function) (!arguments5 list))
Source

first-element.lisp.

Method: aggregator-constructor ((range distinct-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

distinct.lisp.

Method: aggregator-constructor ((range partition-if-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

partition-if.lisp.

Method: aggregator-constructor ((range flatten-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

flatten-lists.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 frequency-function) (!arguments5 list))
Source

frequency.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 frequency-function) (!arguments5 list))
Source

frequency.lisp.

Method: aggregator-constructor ((range cumulative-accumulate-range) outer-constructor (function aggregation-function) (arguments list))
Source

cumulative-accumulate.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 extremum-function) (!arguments5 list))
Source

extremum.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 extremum-function) (!arguments5 list))
Source

extremum.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 extrema-function) (!arguments5 list))
Source

extrema.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 extrema-function) (!arguments5 list))
Source

extrema.lisp.

Method: aggregator-constructor ((range establish-special-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

establish-special.lisp.

Method: aggregator-constructor ((range repeat-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

repeat.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 reservoir-sample-function) (!arguments5 list))
Source

reservoir-sample.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 reservoir-sample-function) (!arguments5 list))
Source

reservoir-sample.lisp.

Method: aggregator-constructor ((range restrain-size-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

restrain-size.lisp.

Method: aggregator-constructor ((range only-different-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

only-different.lisp.

Method: aggregator-constructor ((range only-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

only.lisp.

Method: aggregator-constructor ((range multiplex-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

multiplex.lisp.

Method: aggregator-constructor ((range without-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

without.lisp.

Method: aggregator-constructor ((range group-by-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

group-by.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 accumulate-function) (!arguments5 list))
Source

accumulate.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 accumulate-function) (!arguments5 list))
Source

accumulate.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 %summary-function) (!arguments5 list))
Source

summary.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 %summary-function) (!arguments5 list))
Source

summary.lisp.

Method: aggregator-constructor ((range filtering-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

filtering.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 enumerate-function) (!arguments5 list))
Source

enumerate.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 enumerate-function) (!arguments5 list))
Source

enumerate.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 to-hash-table-function) (!arguments5 list))
Source

to-hash-table.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 to-hash-table-function) (!arguments5 list))
Source

to-hash-table.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 rate-function) (!arguments5 list))
Source

rate.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 rate-function) (!arguments5 list))
Source

rate.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 to-list-function) (!arguments5 list))
Source

to-list.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 to-list-function) (!arguments5 list))
Source

to-list.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 to-vector-function) (!arguments5 list))
Source

to-vector.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 to-vector-function) (!arguments5 list))
Source

to-vector.lisp.

Method: aggregator-constructor ((!range1 sequence) (!outer-constructor2 (eql nil)) (!function3 count-elements-function) (!arguments5 list))
Source

count.lisp.

Method: aggregator-constructor ((!range1 traversable) (!outer-constructor2 (eql nil)) (!function3 count-elements-function) (!arguments5 list))
Source

count.lisp.

Method: aggregator-constructor ((range proxy-box-range) outer-constructor (function aggregation-function) (arguments list))
Source

on-each.lisp.

Method: aggregator-constructor ((range hash-table-elementwise-forward-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

hash-table-elementwise.lisp.

Method: aggregator-constructor ((range array-elementwise-forward-proxy) outer-constructor (function aggregation-function) (arguments list))
Source

array-elementwise.lisp.

Method: aggregator-constructor ((range sequence) (outer-constructor function) (function aggregation-function) (arguments list))
Method: aggregator-constructor ((range traversable) (outer-constructor function) (function aggregation-function) (arguments list))
Generic Function: alter-bucket (container operation value bucket &rest all &key composite-container-operations composite-container-make-bucket-callbacks composite-container-rest-arguments composite-container-arguments composite-container-locations condition-fn &allow-other-keys)
Package

cl-data-structures.meta.

Source

meta.lisp.

Methods
Method: alter-bucket ((container functional-composite-container) operation value bucket &rest all &key composite-container-operations composite-container-make-bucket-callbacks composite-container-rest-arguments composite-container-arguments composite-container-locations)
Source

implementation.lisp.

Method: alter-bucket (container (operation erase-if-function) value bucket &rest all &key condition-fn)
Source

meta.lisp.

Method: alter-bucket (container (operation take-out-function) value bucket &rest all)
Source

meta.lisp.

Method: alter-bucket (container (operation erase-function) value bucket &rest all)
Source

meta.lisp.

Method: alter-bucket (container (operation add-function) value bucket &rest all)
Source

meta.lisp.

Method: alter-bucket (container (operation insert-function) value bucket &rest all)
Source

meta.lisp.

Method: alter-bucket (container (operation update-function) value bucket &rest all)
Source

meta.lisp.

Generic Function: alter-bucket! (container operation value bucket &rest all &key composite-container-operations composite-container-make-bucket-callbacks composite-container-rest-arguments composite-container-arguments composite-container-locations condition-fn &allow-other-keys)
Package

cl-data-structures.meta.

Source

meta.lisp.

Methods
Method: alter-bucket! ((container mutable-composite-container) operation value bucket &rest all &key composite-container-operations composite-container-make-bucket-callbacks composite-container-rest-arguments composite-container-arguments composite-container-locations)
Source

implementation.lisp.

Method: alter-bucket! (container (operation take-out!-function) value bucket &rest all)
Source

meta.lisp.

Method: alter-bucket! (container (operation update-if!-function) value bucket &rest all &key condition-fn)
Source

meta.lisp.

Method: alter-bucket! (container (operation add!-function) value bucket &rest all)
Source

meta.lisp.

Method: alter-bucket! (container (operation insert!-function) value bucket &rest all)
Source

meta.lisp.

Method: alter-bucket! (container (operation erase-if!-function) value bucket &rest all &key condition-fn)
Source

meta.lisp.

Method: alter-bucket! (container (operation erase!-function) value bucket &rest all)
Source

meta.lisp.

Method: alter-bucket! (container (operation update!-function) value bucket &rest all)
Source

meta.lisp.

Generic Function: apply-aggregation-function (range function arguments)

Arguments:
–RANGE, Varies. Sometimes actually range, sometimes object of different class. –FUNCTION, Instance of AGGREGATION-FUNCTION class.
–KEY, Key used on each element to obtain object passed to aggregation. –ALL, Gathers all options required by make-state.

Description:
Entry point to common aggregation function logic.

Affected by
Class of range.

See also:
–APPLY-AGGREGATION-FUNCTION-WITH-AGGREGATOR

Notes:
–Always pass KEY.

Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Methods
Method: apply-aggregation-function (range (function aggregation-function) all)
Source

methods.lisp.

Generic Function: apply-layer (range function arguments)

Arguments:
–RANGE, Instance of FUNDAMENTAL-RANGE. –FUNCTION, Instance of LAYER-FUNCTION.

Description:
Entry point to common layer function logic.

Affected by
Class of RANGE.

Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Methods
Method: apply-layer ((range fundamental-forward-range) (fn moving-average-function) all)
Source

moving-average.lisp.

Method: apply-layer ((range fundamental-random-access-range) (fn bootstrap-function) all)
Source

bootstrap.lisp.

Method: apply-layer ((range fundamental-bidirectional-range) (fn bootstrap-function) all)
Source

bootstrap.lisp.

Method: apply-layer ((range fundamental-forward-range) (fn bootstrap-function) all)
Source

bootstrap.lisp.

Method: apply-layer ((range fundamental-bidirectional-range) (fn thread-buffer-function) arguments)
Source

buffer-range.lisp.

Method: apply-layer ((range fundamental-random-access-range) (fn thread-buffer-function) arguments)
Source

buffer-range.lisp.

Method: apply-layer ((range traversable) (fn thread-buffer-function) arguments)
Source

buffer-range.lisp.

Method: apply-layer ((range traversable) (fn parallel-on-each-function) all)
Source

parallel-on-each.lisp.

Method: apply-layer ((range fundamental-random-access-range) (fn parallel-group-by-function) all)
Source

parallel-group-by.lisp.

Method: apply-layer ((range fundamental-bidirectional-range) (fn parallel-group-by-function) all)
Source

parallel-group-by.lisp.

Method: apply-layer ((range fundamental-forward-range) (fn parallel-group-by-function) all)
Source

parallel-group-by.lisp.

Method: apply-layer ((range traversable) (fn parallel-group-by-function) all)
Source

parallel-group-by.lisp.

Method: apply-layer ((range traversable) (fn parallel-multiplex-function) all)
Source

parallel-multiplex.lisp.

Method: apply-layer ((range fundamental-random-access-range) (fn with-previous-element-function) all)
Source

with-previous-element.lisp.

Method: apply-layer ((range fundamental-bidirectional-range) (fn with-previous-element-function) all)
Source

with-previous-element.lisp.

Method: apply-layer ((range fundamental-forward-range) (fn with-previous-element-function) all)
Source

with-previous-element.lisp.

Method: apply-layer ((range traversable) (fn with-previous-element-function) all)
Source

with-previous-element.lisp.

Method: apply-layer ((range traversable) (fn sliding-window-function) all)
Source

sliding-window.lisp.

Method: apply-layer ((range fundamental-random-access-range) (fn in-batches-function) all)
Source

in-batches.lisp.

Method: apply-layer ((range fundamental-bidirectional-range) (fn in-batches-function) all)
Source

in-batches.lisp.

Method: apply-layer ((range traversable) (fn in-batches-function) all)
Source

in-batches.lisp.

Method: apply-layer ((range fundamental-forward-range) (function distinct-function) all)
Source

distinct.lisp.

Method: apply-layer ((range traversable) (fn partition-if-function) all)
Source

partition-if.lisp.

Method: apply-layer ((range traversable) (function flatten-lists-function) all)
Source

flatten-lists.lisp.

Method: apply-layer ((range fundamental-forward-range) (fn cumulative-accumulate-function) all)
Source

cumulative-accumulate.lisp.

Method: apply-layer ((range fundamental-random-access-range) (fn establish-special-function) all)
Source

establish-special.lisp.

Method: apply-layer ((range fundamental-bidirectional-range) (fn establish-special-function) all)
Source

establish-special.lisp.

Method: apply-layer ((range traversable) (fn establish-special-function) all)
Source

establish-special.lisp.

Method: apply-layer ((range fundamental-forward-range) (function latch-function) all)
Source

latch.lisp.

Method: apply-layer ((range fundamental-range) (fn repeat-function) all)
Source

repeat.lisp.

Method: apply-layer ((range fundamental-range) (fn restrain-size-function) all)
Source

restrain-size.lisp.

Method: apply-layer ((range traversable) (function only-different-function) all)
Source

only-different.lisp.

Method: apply-layer ((range traversable) (function only-function) all)
Source

only.lisp.

Method: apply-layer ((range fundamental-bidirectional-range) (function only-function) all)
Source

only.lisp.

Method: apply-layer ((range traversable) (fn multiplex-function) all)
Source

multiplex.lisp.

Method: apply-layer ((range traversable) (function without-function) all)
Source

without.lisp.

Method: apply-layer ((range fundamental-bidirectional-range) (function without-function) all)
Source

without.lisp.

Method: apply-layer ((range fundamental-random-access-range) (fn group-by-function) all)
Source

group-by.lisp.

Method: apply-layer ((range fundamental-bidirectional-range) (fn group-by-function) all)
Source

group-by.lisp.

Method: apply-layer ((range fundamental-forward-range) (fn group-by-function) all)
Source

group-by.lisp.

Method: apply-layer ((range traversable) (fn group-by-function) all)
Source

group-by.lisp.

Method: apply-layer ((range traversable) (fn on-each-function) all)
Source

on-each.lisp.

Method: apply-layer ((range traversable) (function hash-table-elementwise-function) arguments)
Source

hash-table-elementwise.lisp.

Method: apply-layer ((range traversable) (function array-elementwise-function) arguments)
Source

array-elementwise.lisp.

Generic Function: apply-range-function (range function arguments)
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Methods
Method: apply-range-function ((range fundamental-container) (function layer-function) all)
Source

methods.lisp.

Method: apply-range-function ((range sequence) (function layer-function) all)
Source

methods.lisp.

Method: apply-range-function ((range hash-table) (function layer-function) all)
Source

methods.lisp.

Method: apply-range-function ((range fundamental-range) (function layer-function) all)
Source

methods.lisp.

Method: apply-range-function ((range traversable) (function layer-function) all)
Source

methods.lisp.

Method: apply-range-function (range (function aggregation-function) all)
Source

methods.lisp.

Method: apply-range-function ((object sequence) (function aggregation-function) all)
Source

methods.lisp.

Method: apply-range-function ((object fundamental-container) (function aggregation-function) all)
Source

methods.lisp.

Generic Function: approximated-counts (range &key hash-fn depth width key hashes data-sketch)

Arguments:
–RANGE, Object to aggregate.
–HASH-FN, Hashing function. SXHASH will do for strings.
–SPACE, Positive integer. Size of the counters array
–COUNT, Number of hashing functions used.
–DATA-SKETCH, Instead of the bits and the hash-fn, the user can pass a data-sketch argument.

Description:
Calculates estimated counts using Min-Count sketch algorithm. This requires only a constant amount of memory.

Returns:
Instance of the fundamental-data-sketch class. Use CL-DS:AT to extract count estimate for element from it.

Exceptional situations:
–Will signal a TYPE-ERROR when either COUNT or SPACE is not integer.
–Will signal a TYPE-ERROR when HASH-FN is not funcallable.
–Will signal a TYPE-ERROR when HASHES is not either NIL or (SIMPLE-ARRAY FIXNUM (*)).
–Will signal a CL-DS:ARGUMENT-VALUE-OUT-OF-BOUNDS if either COUNT or SPACE is not above zero.

Notes:
–Quality of the estimate directly depends on DEPTH and WIDTH.
–Sensitive to a hash function. Large avalanche factor is very helpful.

Package

cl-data-structures.streaming-algorithms.

Source

approximated-counts.lisp.

Methods
Method: approximated-counts (range &key hash-fn depth width key hashes data-sketch)
Generic Function: approximated-histogram (range &key key maximal-bins-count data-sketch)

Arguments:
–RANGE, Input for the creation of the histogram.
–MAXIMAL-BINS-COUNT, The maximal number of bins allowed for the histogram to create.
–KEY, Function used to extract value for the histogram.
–DATA-SKETCH, Instead of maximal-bins-count, the user can pass a data-sketch argument.

Description:
Creates approximated histogram, as described in A Streaming Parallel Decision Tree Algorithm article.

Returns:
Instance of APPROXIMATED-HISTOGRAM. Use cl-ds:at to check for quantile value and obtain approximation of statistical summaries using dedicated functions with the APPROXIMATED-HISTOGRAM prefix.

Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Methods
Method: approximated-histogram (range &key key maximal-bins-count data-sketch)
Generic Function: approximated-set-cardinality (range &key hash-fn key data-sketch)

Arguments:
–RANGE, Object to aggregate.
–HASH-FN, Hashing function. SXHASH will do for strings.
–DATA-SKETCH, Instead of the bits and the hash-fn, the user can pass a data-sketch argument.
–KEY, A function used to extract value from each element.

Examples:
(let ((data (cl-ds:xpr (:i 0)
(when (< i 500000)
(cl-ds:send-recur (random 99999999999) :i (1+ i))))))
(prove:ok (< 490000
(cl-ds:value
(cl-data-structures.streaming-algorithms:approximated-set-cardinality
data
:hash-fn #’cl-data-structures.utils:hash-integer))
510000)))

Description:
Calculates the estimated set cardinality using the HyperLogLog algorithm. This requires only a constant (and modest) amount of memory.

Returns:
Instance of the fundamental-data-sketch class. Use CL-DS:VALUE to extract estimate from it.

Exceptional situations:
–Will signal a TYPE-ERROR if HASH-FN is not funcallable.

Notes:
–This algorithm gives a solid estimate for large sets, not so good for small sets.
–Sensitive to a hash function. Large avalanche factor is very helpful. Needs all 64 bits so sxhash won’t be fine.
–Can be used to (for instance) estimate number of keys before creating a hash table. A good estimate of size minimizes rehashing and therefore reduces both memory allocation and time required to fill the hash table.

Package

cl-data-structures.streaming-algorithms.

Source

approximated-set-cardinality.lisp.

Methods
Method: approximated-set-cardinality (range &key hash-fn key data-sketch)
Generic Function: approximated-top-k (range k &key hash-fn width depth key hashes test data-sketch)

Arguments:
–RANGE, Input for scanning.
–K, Determines the maximum size of the result.
–HASHES, Optional hashes vector. Needs to be supplied in order to ensure that the same hash values are generated between different filters.
–TEST, Test to check elements equality.
–HASH-FN, Hashing function, defaults to sxhash.
–DEPTH, Depth for count min sketch (APPROXIMATED-COUNTS). Higher value increases confidence.
–WIDTH, Width for count min sketch (APPROXIMATED-COUNTS). Higher value decreases error.

Description:
Attempts to find the top most common elements in a stream. Uses count-min sketch to accomplish that, so it will need only constant memory.

Returns:
Range of pairs. CAR of pair is the object, CDR of pair is estimated count. Range is ordered, with the most frequent element at zero and at most it has K values.

Package

cl-data-structures.streaming-algorithms.

Source

approximated-top-k.lisp.

Methods
Method: approximated-top-k (range k &key hash-fn width depth key hashes test data-sketch)
Generic Function: array-average (range &key key sum count after)

Arguments:
–RANGE, Object to aggregate.
–KEY, Function used to extract value from element that shall be passed to average function.

Description:
Calculate element wise average of arrays in the range.

Returns:
SIMPLE-ARRAY holding results.

Package

cl-data-structures.math.

Source

average.lisp.

Methods
Method: array-average (range &key key after sum count)
Generic Function: array-elementwise (range)
Package

cl-data-structures.algorithms.

Source

array-elementwise.lisp.

Methods
Method: array-elementwise (range)
Generic Function: array-geometric-average (range &key key total count after)

Arguments:
–RANGE, Object to aggregate.
–KEY, Function used to extract array from RANGE element.

Description:
Calculate element wise geometric average of arrays in the range.

Returns:
SIMPLE-ARRAY holding results.

Package

cl-data-structures.math.

Source

average.lisp.

Methods
Method: array-geometric-average (range &key key after total count)
Generic Function: array-harmonic-average (range &key key sum count)

Arguments:
–RANGE, Object to aggregate.
–KEY, Function used to extract array from RANGE element.

Description:
Calculate element wise harmonic average of arrays in the range.

Returns:
SIMPLE-ARRAY holding results.

Package

cl-data-structures.math.

Source

average.lisp.

Methods
Method: array-harmonic-average (range &key key sum count)
Generic Function: array-sum (range &key key sum after)

Description:
Calculates elementwise sum of all arrays in the range.

Package

cl-data-structures.math.

Source

sum.lisp.

Methods
Method: array-sum (range &key key sum after)
Generic Function: at (container location &rest more-locations)

Syntax:
–for dictionary containers: at dictionary key => value found
–for everything else: at sequence location => value

Arguments:
–CONTAINER, Instance of subclass of fundamental-container.
–LOCATION, Where are we looking at? Key in hashtable, index of vector, etc.

Examples:
(let ((table (cl-ds.dicts.hamt:make-mutable-hamt-dictionary #’sxhash #’eq)))
(multiple-value-bind (value found) (cl-ds:at table ’a)
(prove:is value nil)
(prove:is found nil))
(setf (cl-ds:at table ’a) 1)
(multiple-value-bind (value found) (cl-ds:at table ’a)
(prove:is value 1)
(prove:is found t)))

Description:
Obtain element stored at LOCATION in the CONTAINER.

Returns:
In case of associative containers, second value informs if LOCATION was found in the CONTAINER (first value is NIL if element was not found).
In case of non-associtive containers (e.g. vectors), the function returns value under LOCATION if LOCATION is valid, otherwise condition of type ARGUMENT-VALUE-OUT-OF-BOUNDS will be raised.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: at ((container bloom-filter) location &rest more-locations)
Source

bloom-filter.lisp.

Method: at ((container approximated-counts) location &rest more-locations)
Source

approximated-counts.lisp.

Method: at ((object approximated-histogram) location &rest more-locations)
Source

approximated-histogram.lisp.

Method: at ((range zipping-mixin) location &rest more-locations)
Source

zip.lisp.

Method: at ((range random-access-connecting-range) location &rest more-locations)
Source

zip.lisp.

Method: at ((range random-access-chain-of-ranges) location &rest more-locations)
Source

chain.lisp.

Method: at ((range bidirectional-proxy-box-range) location &rest more-locations)
Source

on-each.lisp.

Method: at ((range hash-table-range) location &rest more)
Source

common.lisp.

Method: at ((range random-access-proxy-range) location &rest more)
Source

common.lisp.

Method: at ((container composite-container) location &rest more-locations)
Source

implementation.lisp.

Method: at ((container mutable-skip-list-set) location &rest more-locations)
Source

api.lisp.

Method: at ((container fundamental-qp-trie-set) location &rest more-locations)
Source

api.lisp.

Method: at ((container 2-3-queue) (position (eql :back)) &rest more)
Source

api.lisp.

Method: at ((container 2-3-queue) (position (eql :front)) &rest more)
Source

api.lisp.

Method: at ((container lazy-box-sequence) location &rest more-locations)
Source

common.lisp.

Method: at ((vect fundamental-sparse-rrb-vector) position &rest more-positions)
Source

api.lisp.

Method: at ((container hamt-dictionary) location &rest more-locations)
Source

api.lisp.

Method: at ((container mutable-skip-list-dictionary) location &rest more-locations)
Source

api.lisp.

Method: at ((container lazy-box-dictionary) location &rest more-locations)
Source

common.lisp.

Method: at ((range rrb-range) index &rest more)
Source

common.lisp.

Method: at ((container rrb-container) index &rest more)
Source

common.lisp.

Method: at ((window sequence-window) index &rest more)
Source

sequence-window.lisp.

Method: at ((container sequence) index &rest more-locations)
Source

list.lisp.

Method: at ((container vector) index &rest more-locations)
Source

vector.lisp.

Method: at ((range offset-vector-range) location &rest more-locations)
Source

vector.lisp.

Method: at ((range vector-range) location &rest more)
Source

vector.lisp.

Method: at ((container hash-table) location &rest more-locations)
Source

hash-table.lisp.

Method: at ((container field) location &rest more)
Source

field.lisp.

Generic Function: (setf at) (container location &rest more-locations)

Arguments:
–NEW-VALUE, Value that shall be inserted into the container.
–CONTAINER, Container that shall be modified.
–LOCATION, Location where container shall be modified.

Description:
Destructively insert/replace a element in the CONTAINER at LOCATION with the NEW-VALUE.

Returns:
–NEW-VALUE
–modification-status object as second value.

Notes:
This is the destructive counterpart to the INSERT function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: (setf at) ((container mutable-sequence) location &rest more-locations)
Source

common.lisp.

Method: (setf at) ((container mutable-dictionary) location &rest more-locations)
Source

api.lisp.

Method: (setf at) ((container mutable-sparse-vector) location &rest more-locations)
Source

api.lisp.

Method: (setf at) ((range mutable-rrb-range) index &rest more)
Source

common.lisp.

Method: (setf at) ((container field) location &rest more)
Source

field.lisp.

Generic Function: average (range &key key sum count after weight)

Arguments:
–RANGE, Object to aggregate.
–KEY, Function used to extract value from RANGE element.

Description:
Calculate average of elements in the range.

Package

cl-data-structures.math.

Source

average.lisp.

Methods
Method: average (range &key key sum count after weight)
Generic Function: become-functional (container)

Syntax:
become-functional container => functional-container

Arguments:
–container, Container that we want to transform into functional container.

Description:
Transforms CONTAINER into functional variant.

Returns:
A instance implementing functional API. Content of returned instance is identical to the content of input CONTAINER.

Side Effects:
May vary, depending on type of the CONTAINER. Also, some (or all) parts of a internal representation can be shared between both the CONTAINER and a returned instance. Side effects from the mutable CONTAINER may leak into a returned instance.

See also:
–BECOME-TRANSACTIONAL
–BECOME-MUTABLE

Notes:
–Side effects from the destructive operations on the CONTAINER may leak into returned instance.
–Not all containers implement this function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: become-functional ((container mutable-2-3-queue))
Source

api.lisp.

Method: become-functional ((container transactional-rrb-vector))
Source

api.lisp.

Method: become-functional ((container mutable-rrb-vector))
Source

api.lisp.

Method: become-functional ((container fundamental-sparse-rrb-vector))
Source

api.lisp.

Method: become-functional ((container transactional-hamt-dictionary))
Source

api.lisp.

Method: become-functional ((container mutable-hamt-dictionary))
Source

api.lisp.

Method: become-functional ((container lazy-box-container))
Source

lazy-box.lisp.

Method: become-functional :around ((container functional))
Generic Function: become-lazy (container)

Syntax:
become-lazy container => lazy-container

Arguments:
–CONTAINER, Container that we want to transform into an lazy container.

Description:
Transforms CONTAINER into lazy variant.

Returns:
instance implementing functional, lazy API. Content of returned instance is identical to the content of input CONTAINER.

Side Effects:
May vary, depending on type of the CONTAINER. Also, some (or all) parts of internal representation can be shared between both the CONTAINER and a returned instance. Side effects from the mutable CONTAINER may leak into the returned instance.

Notes:
–Side effects from destructive operations on CONTAINER may leak into returned instance.
–All containers that implement become-transactional, also implement become-lazy

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: become-lazy ((container fundamental-sequence))
Source

common.lisp.

Method: become-lazy ((container fundamental-dictionary))
Source

common.lisp.

Generic Function: become-mutable (container)

Syntax:
become-mutable container => mutable-container

Arguments:
–CONTAINER, Container that we want to transform into mutable container.

Description:
Transforms the CONTAINER into a mutable variant.

Returns:
An instance implementing mutable API. The content of the returned instance is identical to the content of the input CONTAINER.

Side Effects:
May vary, depending on type of the CONTAINER. Also, some (or all) parts of a internal representation can be shared between both the CONTAINER and a returned instance. Side effects from the mutable CONTAINER may leak into the returned instance.

See also:
–BECOME-TRANSACTIONAL
–BECOME-FUNCTIONAL

Notes:
–Side effects from destructive operations on CONTAINER may leak into returned instance.
–Not all containers implement this function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: become-mutable ((container fixed-capacity-synchronized-transactional-2-3-queue))
Source

api.lisp.

Method: become-mutable ((container synchronized-transactional-2-3-queue))
Source

api.lisp.

Method: become-mutable ((container transactional-2-3-queue))
Source

api.lisp.

Method: become-mutable ((container functional-2-3-queue))
Source

api.lisp.

Method: become-mutable ((container transactional-rrb-vector))
Source

api.lisp.

Method: become-mutable ((container functional-rrb-vector))
Source

api.lisp.

Method: become-mutable ((container fundamental-sparse-rrb-vector))
Source

api.lisp.

Method: become-mutable ((container transactional-hamt-dictionary))
Source

api.lisp.

Method: become-mutable ((container functional-hamt-dictionary))
Source

api.lisp.

Method: become-mutable ((container lazy-box-container))
Source

lazy-box.lisp.

Method: become-mutable :around ((container mutable))
Generic Function: become-transactional (container)

Syntax:
become-transactional container => transactional-container

Arguments:
–CONTAINER, Container that we want to transform into the transactional container.

Description:
Transforms CONTAINER into transactional variant.

Returns:
instance implementing mutable API. Content of returned instance is identical to the content of the input CONTAINER.

Side Effects:
May vary, depending on type of the CONTAINER. Also, some (or all) parts of internal representation can be shared between both the CONTAINER and a returned instance. Side effects from the mutable CONTAINER may leak into the returned instance.

See also:
–BECOME-FUNCTIONAL
–BECOME-MUTABLE
–REPLICA

Notes:
–Side effects from destructive operations on CONTAINER may leak into returned instance.
–Not all containers implement this function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: become-transactional ((container synchronized-mutable-2-3-queue))
Source

api.lisp.

Method: become-transactional ((container fixed-capacity-synchronized-mutable-2-3-queue))
Source

api.lisp.

Method: become-transactional ((container synchronized-transactional-2-3-queue))
Source

api.lisp.

Method: become-transactional ((container fixed-capacity-synchronized-transactional-2-3-queue))
Source

api.lisp.

Method: become-transactional ((container 2-3-queue))
Source

api.lisp.

Method: become-transactional ((container rrb-vector))
Source

api.lisp.

Method: become-transactional ((container fundamental-sparse-rrb-vector))
Source

api.lisp.

Method: become-transactional ((container transactional-sparse-rrb-vector))
Source

api.lisp.

Method: become-transactional ((container hamt-dictionary))
Source

api.lisp.

Method: become-transactional ((container lazy-box-container))
Source

lazy-box.lisp.

Generic Reader: beta0 (object)
Package

cl-data-structures.math.

Methods
Reader Method: beta0 ((linear-regression-fit linear-regression-fit))

automatically generated reader method

Source

simple-linear-regression.lisp.

Target Slot

%beta0.

Generic Writer: (setf beta0) (object)
Package

cl-data-structures.math.

Methods
Writer Method: (setf beta0) ((linear-regression-fit linear-regression-fit))

automatically generated writer method

Source

simple-linear-regression.lisp.

Target Slot

%beta0.

Generic Reader: beta1 (object)
Package

cl-data-structures.math.

Methods
Reader Method: beta1 ((linear-regression-fit linear-regression-fit))

automatically generated reader method

Source

simple-linear-regression.lisp.

Target Slot

%beta1.

Generic Writer: (setf beta1) (object)
Package

cl-data-structures.math.

Methods
Writer Method: (setf beta1) ((linear-regression-fit linear-regression-fit))

automatically generated writer method

Source

simple-linear-regression.lisp.

Target Slot

%beta1.

Generic Function: between* (container &key low high)

Arguments:
–CONTAINER, Container searched for elements.
–LOW, Lower boundry.
–HIGH, High boundry.

Examples:
(prove:is (cl-ds.alg:to-list (cl-ds:between* (cl-ds:make-from-traversable (cl-ds:iota-range :to 500) ’cl-ds.sets.skip-list:mutable-skip-list-set #’< #’=)
:low 10
:high 20))
(alexandria:iota 10 :start 10))

Description:
Searches the ordered CONTAINER for elements between LOW and HIGH. Returns range.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: between* ((container fundamental-qp-trie-set) &key low high)
Source

api.lisp.

Method: between* ((container fundamental-skip-list) &key low high)
Source

common.lisp.

Generic Function: bloom-filter (range &key hash-fn width depth key hashes data-sketch)

Arguments:
–RANGE, Input for the creation of the bloom filter.
–WIDTH, What is the inner size?
–HEIGHT, What is the inner size?
–HASH-FN, Hashing function. SXHASH will do for strings.
–COUNT, How many bits are used for each item?
–KEY, Function used to extract value for hashing.
–HASHES, Optional hashes vector. Needs to be supplied in order to ensure that the same hash values are generated between different filters.
–DATA-SKETCH, Instead of the bits and the hash-fn, the user can pass a data-sketch argument.

Description:
Creates bloom filter out of elements in the range. Bloom filter is a memory efficient data structure allowing to check if an item is absent from the range. If AT returns nil, the item is certainly absent. If AT returns T item either present or not.

Returns:
Instance of the fundamental-data-sketch class. Use cl-ds:at to check if element is present. False positives are possible, false negatives are not possible.

Exceptional situations:
–Will signal a TYPE-ERROR if either SPACE or COUNT is not integer.
–Will signal a CL-DS:ARGUMENT-VALUE-OUT-OF-BOUNDS if either width, heigh, or COUNT is not above 0.
–Will signal a TYPE-ERROR if HASH-FN is not funcallable.
–Will signal a TYPE-ERROR if HASHES is not (OR NULL (SIMPLE-ARRAY FIXNUM (* 2)).

Package

cl-data-structures.streaming-algorithms.

Source

bloom-filter.lisp.

Methods
Method: bloom-filter (range &key hash-fn width depth key hashes data-sketch)
Generic Function: bootstrap (range sample-size samples-count &key confidence key compare parallel context-function)

Arguments:
–RANGE, Data for aggregation.
–SAMPLE-SIZE, Size of the single sample.
–SAMPLES-COUNT, Total number of samples drawn.
–CONFIDENCE, Confidence value. High confidence results in wide estimate bounds.
–KEY, Key passed to SORT function.
–COMPARE, Function passed to SORT function.
–PARALLEL, Will use lparallel to evaluate samples if T. Defaults to T.

Description:
Changes aggregation into bootstrapping schema using percentail method. Reduces the ammount of resources needed to obtain the value.

Thread Safety:
Will process each sample in the lparallel task if PARALLEL is T.

Notes:
Don’t attempt to mix lparallel used in bootstrap with lparallel used in the aggregation function

Package

cl-data-structures.math.

Source

bootstrap.lisp.

Methods
Method: bootstrap (range sample-size samples-count &key confidence key compare parallel context-function)
Generic Function: changed (status)

Syntax:
changed status => boolean

Arguments:
–STATUS, instance of the modification status class

Returns:
T if operation changed the container.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: changed ((status lazy-modification-operation-status))
Source

lazy-box.lisp.

Reader Method: changed ((implementation-modification-operation-status implementation-modification-operation-status))

automatically generated reader method

Source

modification-operation-status.lisp.

Target Slot

%changed.

Generic Function: chunked (range &optional chunk-size-hint)

Description:
Returns either nil or forward range of sub-ranges that in total contain all elements of the RANGE. This function can be used to implement multithreaded functions, however, implementation of this is optional.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: chunked ((range transparent-to-chunking-mixin) &optional chunk-size-hint)
Source

common.lisp.

Method: chunked ((range proxy-range) &optional chunk-size-hint)
Source

common.lisp.

Method: chunked ((range rrb-range) &optional chunk-size-hint)
Source

common.lisp.

Method: chunked ((range chunking-mixin) &optional chunk-size-hint)
Method: chunked :before ((range fundamental-range) &optional chunk-size-hint)
Method: chunked ((range fundamental-range) &optional chunk-size-hint)
Generic Function: clean-sketch (function &rest arguments &key hashes hash-fn depth width maximal-bins-count &allow-other-keys)

Description:
Creates a new, empty data-sketch that would be produced by the function. New data-sketch can be cloned and passed as :data-sketch. This allows to keep compatibility between results of call to the streaming function.

Package

cl-data-structures.streaming-algorithms.

Source

common.lisp.

Methods
Method: clean-sketch ((function bloom-filter-function) &rest all &key hashes hash-fn depth width)
Source

bloom-filter.lisp.

Method: clean-sketch ((function approximated-counts-function) &rest all &key hashes hash-fn depth width)
Source

approximated-counts.lisp.

Method: clean-sketch ((function approximated-set-cardinality-function) &rest all &key hash-fn)
Source

approximated-set-cardinality.lisp.

Method: clean-sketch ((function approximated-histogram-function) &rest all &key maximal-bins-count)
Source

approximated-histogram.lisp.

Generic Function: clone (range)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: clone ((object callback-minhash))
Source

minhash.lisp.

Method: clone ((object minhash-corpus))
Source

minhash.lisp.

Method: clone ((object bloom-filter))
Source

bloom-filter.lisp.

Method: clone ((sketch approximated-counts))
Source

approximated-counts.lisp.

Method: clone ((object approximated-set-cardinality))
Source

approximated-set-cardinality.lisp.

Method: clone ((object approximated-histogram))
Source

approximated-histogram.lisp.

Method: clone ((range find-range))
Source

find.lisp.

Method: clone ((range tokenizing-range))
Source

tokenize.lisp.

Method: clone ((range line-by-line-range))
Source

line-by-line.lisp.

Method: clone ((range abstract-sliding-window-proxy))
Source

sliding-window.lisp.

Method: clone ((range abstract-in-batches-proxy))
Source

in-batches.lisp.

Method: clone ((range distinct-proxy))
Source

distinct.lisp.

Method: clone ((range abstract-partition-if-proxy))
Source

partition-if.lisp.

Method: clone ((range forward-connecting-range))
Source

zip.lisp.

Method: clone ((range forward-chain-of-ranges))
Source

chain.lisp.

Method: clone ((range cumulative-accumulate-range))
Source

cumulative-accumulate.lisp.

Method: clone ((range latch-proxy))
Source

latch.lisp.

Method: clone ((range repeat-proxy))
Source

repeat.lisp.

Method: clone ((range forward-cartesian-range))
Source

cartesian.lisp.

Method: clone ((range multiplex-proxy))
Source

multiplex.lisp.

Method: clone ((range filtering-proxy))
Source

filtering.lisp.

Method: clone ((object shuffled-range))
Source

shuffled-range.lisp.

Method: clone ((range hash-table-range))
Source

common.lisp.

Method: clone ((range proxy-range))
Source

common.lisp.

Method: clone ((range qp-trie-set-range))
Source

api.lisp.

Method: clone ((object fundamental-qp-trie-set))
Source

api.lisp.

Method: clone ((range 2-3-queue-range))
Source

api.lisp.

Method: clone ((container fundamental-egnat-container))
Source

methods.lisp.

Method: clone ((range egnat-range-around))
Source

methods.lisp.

Method: clone ((range egnat-range))
Source

methods.lisp.

Method: clone ((container fundamental-skip-list))
Source

common.lisp.

Method: clone ((range fundamental-skip-list-range))
Source

common.lisp.

Method: clone ((obj rrb-range))
Source

common.lisp.

Method: clone ((range chunked-rrb-range))
Source

common.lisp.

Method: clone ((cell hamt-range-stack-cell))
Source

common.lisp.

Method: clone ((container sequence-window))
Source

sequence-window.lisp.

Method: clone ((range forward-tree-range))
Source

ranges.lisp.

Method: clone ((obj list-range))
Source

list.lisp.

Method: clone ((range offset-vector-range))
Source

vector.lisp.

Method: clone ((range vector-range))
Source

vector.lisp.

Method: clone ((range empty-range))
Source

auxilary.lisp.

Method: clone ((obj expression))
Source

expression-wrapper.lisp.

Method: clone ((range chunked-range))
Generic Function: cloning-information (object)
Package

cl-data-structures.utils.

Source

cloning.lisp.

Method Combination

append.

Options

:most-specific-last

Methods
Method: cloning-information append ((sketch bloom-filter))
Source

bloom-filter.lisp.

Method: cloning-information append ((sketch approximated-counts))
Source

approximated-counts.lisp.

Method: cloning-information append ((sketch approximated-set-cardinality))
Source

approximated-set-cardinality.lisp.

Method: cloning-information append ((sketch fundamental-data-sketch))
Source

common.lisp.

Method: cloning-information append ((range moving-average-range))
Source

moving-average.lisp.

Method: cloning-information append ((range bootstrap-proxy))
Source

bootstrap.lisp.

Method: cloning-information append ((range buffer-range))
Source

buffer-range.lisp.

Method: cloning-information append ((range parallel-on-each-proxy))
Source

parallel-on-each.lisp.

Method: cloning-information append ((range parallel-group-by-proxy))
Source

parallel-group-by.lisp.

Method: cloning-information append ((range parallel-forward-multiplex-proxy))
Source

parallel-multiplex.lisp.

Method: cloning-information append ((object find-range))
Source

find.lisp.

Method: cloning-information append ((object file-range-mixin))
Source

common.lisp.

Method: cloning-information append ((proxy with-previous-element-proxy))
Source

with-previous-element.lisp.

Method: cloning-information append ((range distinct-proxy))
Source

distinct.lisp.

Method: cloning-information append ((range flatten-proxy))
Source

flatten-lists.lisp.

Method: cloning-information append ((range zipping-mixin))
Source

zip.lisp.

Method: cloning-information append ((range forward-connecting-range))
Source

zip.lisp.

Method: cloning-information append ((object cumulative-state))
Source

cumulative-accumulate.lisp.

Method: cloning-information append ((range establish-special-proxy))
Source

establish-special.lisp.

Method: cloning-information append ((range restrain-size-proxy))
Source

restrain-size.lisp.

Method: cloning-information append ((range forward-cartesian-range))
Source

cartesian.lisp.

Method: cloning-information append ((proxy only-different-proxy))
Source

only-different.lisp.

Method: cloning-information append ((proxy only-proxy))
Source

only.lisp.

Method: cloning-information append ((range multiplex-proxy))
Source

multiplex.lisp.

Method: cloning-information append ((proxy without-proxy))
Source

without.lisp.

Method: cloning-information append ((range group-by-proxy))
Source

group-by.lisp.

Method: cloning-information append ((range filtering-proxy))
Source

filtering.lisp.

Method: cloning-information append ((range proxy-box-range))
Source

on-each.lisp.

Method: cloning-information append ((range hash-table-range))
Source

common.lisp.

Method: cloning-information append ((range proxy-range))
Source

common.lisp.

Method: cloning-information append ((vector fundamental-sparse-rrb-vector))
Source

types.lisp.

Method: cloning-information append ((object egnat-subtree))
Source

classes.lisp.

Method: cloning-information append ((object egnat-node))
Source

classes.lisp.

Method: cloning-information append ((object fundamental-skip-list-range))
Source

common.lisp.

Method: cloning-information append ((object fundamental-skip-list))
Source

common.lisp.

Method: cloning-information append ((object forward-tree-range))
Source

ranges.lisp.

Generic Function: close-inner-stream (range)
Package

cl-data-structures.file-system.

Source

common.lisp.

Methods
Method: close-inner-stream :around ((error file-releated-error))
Method: close-inner-stream ((range fundamental-forward-range))
Method: close-inner-stream ((range file-range-mixin))
Generic Function: co-occurence-table (range test-functions &key key after)
Package

cl-data-structures.math.

Source

co-occurence-table.lisp.

Methods
Method: co-occurence-table (range test-functions &key key after)
Generic Function: consume-back (range)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: consume-back ((range zipping-mixin))
Source

zip.lisp.

Method: consume-back ((range bidirectional-connecting-range))
Source

zip.lisp.

Method: consume-back ((range bidirectional-chain-of-ranges))
Source

chain.lisp.

Method: consume-back ((range bidirectional-filtering-proxy))
Source

filtering.lisp.

Method: consume-back ((range bidirectional-proxy-box-range))
Source

on-each.lisp.

Method: consume-back ((range hash-table-range))
Source

common.lisp.

Method: consume-back ((range bidirectional-proxy-range))
Source

common.lisp.

Method: consume-back ((range rrb-range))
Source

common.lisp.

Method: consume-back ((container sequence-window))
Source

sequence-window.lisp.

Method: consume-back ((range lazy-bidirectional-range))
Source

lazy-range.lisp.

Method: consume-back :before ((range lazy-range))
Source

lazy-range.lisp.

Method: consume-back ((range vector-range))
Source

vector.lisp.

Generic Function: consume-front (range)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: consume-front ((range moving-average-range))
Source

moving-average.lisp.

Method: consume-front ((range find-range))
Source

find.lisp.

Method: consume-front ((range tokenizing-range))
Source

tokenize.lisp.

Method: consume-front ((range line-by-line-range))
Source

line-by-line.lisp.

Method: consume-front ((range file-range-mixin))
Source

common.lisp.

Method: consume-front ((range abstract-sliding-window-proxy))
Source

sliding-window.lisp.

Method: consume-front ((range forward-distinct-proxy))
Source

distinct.lisp.

Method: consume-front ((range forward-partition-if-proxy))
Source

partition-if.lisp.

Method: consume-front ((range forward-flatten-proxy))
Source

flatten-lists.lisp.

Method: consume-front ((range zipping-mixin))
Source

zip.lisp.

Method: consume-front ((range forward-connecting-range))
Source

zip.lisp.

Method: consume-front ((range forward-chain-of-ranges))
Source

chain.lisp.

Method: consume-front ((range cumulative-accumulate-range))
Source

cumulative-accumulate.lisp.

Method: consume-front ((range forward-latch-proxy))
Source

latch.lisp.

Method: consume-front ((range repeat-proxy))
Source

repeat.lisp.

Method: consume-front ((range restrain-size-proxy))
Source

restrain-size.lisp.

Method: consume-front ((range forward-cartesian-range))
Source

cartesian.lisp.

Method: consume-front ((range multiplex-proxy))
Source

multiplex.lisp.

Method: consume-front ((range forward-filtering-proxy))
Source

filtering.lisp.

Method: consume-front ((object shuffled-range))
Source

shuffled-range.lisp.

Method: consume-front ((range forward-proxy-box-range))
Source

on-each.lisp.

Method: consume-front ((range hash-table-range))
Source

common.lisp.

Method: consume-front ((range forward-proxy-range))
Source

common.lisp.

Method: consume-front ((range chunked-proxy-range))
Source

common.lisp.

Method: consume-front ((range mutable-skip-list-set-range))
Source

api.lisp.

Method: consume-front ((range qp-trie-set-range))
Source

api.lisp.

Method: consume-front ((range 2-3-queue-range))
Source

api.lisp.

Method: consume-front ((range mutable-skip-list-dictionary-range))
Source

api.lisp.

Method: consume-front ((range egnat-range))
Source

methods.lisp.

Method: consume-front ((object fundamental-skip-list-range))
Source

common.lisp.

Method: consume-front ((range rrb-range))
Source

common.lisp.

Method: consume-front ((range chunked-rrb-range))
Source

common.lisp.

Method: consume-front ((container sequence-window))
Source

sequence-window.lisp.

Method: consume-front ((range forward-tree-range))
Source

ranges.lisp.

Method: consume-front ((range lazy-forward-range))
Source

lazy-range.lisp.

Method: consume-front :before ((range lazy-range))
Source

lazy-range.lisp.

Method: consume-front ((obj list-range))
Source

list.lisp.

Method: consume-front ((range vector-range))
Source

vector.lisp.

Method: consume-front ((range empty-range))
Source

auxilary.lisp.

Method: consume-front ((obj expression))
Source

expression-wrapper.lisp.

Method: consume-front ((range chunked-range))
Generic Function: count-elements (range &key after)

Arguments:
–RANGE, Input range.

Examples:
(let ((data #(1 2 3 4 5)))
(prove:is (length data) (cl-ds.alg:count-elements data))
(prove:is 3 (cl-ds:at (cl-ds.alg:count-elements (cl-ds.alg:group-by data :key #’evenp)) nil)))

Description:
Counts the number of elements. Useful mostly in conjunction with a GROUP-BY.

Returns:
Integer.

See also:
–GROUP-BY

Package

cl-data-structures.algorithms.

Source

count.lisp.

Methods
Method: count-elements (range &key after)
Generic Function: cumulative-accumulate (range function &key key result initial-value)

Description:
Like ACCUMULATE, but produces range with all intermediate accumulation states.

See also:
–ACCUMULATE

Notes:
–Can be considered to be lazy version of SERAPEUM:SCAN.

Package

cl-data-structures.algorithms.

Source

cumulative-accumulate.lisp.

Methods
Method: cumulative-accumulate (range function &key key result initial-value)
Generic Function: destructive-counterpart (operation)

Syntax:
destructive-counterpart operation => destructive-operation

Arguments:
–OPERATION, Instance of the modification API function.

Description:
Low level function that returns an instance of the destrutive api modification function that serves the same purpose as the OPERATION. Will, for instance, return #’UPDATE! when OPERATION is #’UPDATE Will return original the OPERATION if OPERATION is already part of the functional API.

Returns:
The instance of api function.

Notes:
This function is low level, and therefore should be rarely (if ever) used by the user of this library.

Package

cl-data-structures.meta.

Source

meta.lisp.

Methods
Method: destructive-counterpart ((operation functional-update-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation functional-put-back-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation functional-put-front-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation functional-take-out-front-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation functional-take-out-back-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation functional-take-out-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation functional-insert-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation functional-put-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation functional-add-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation functional-update-if-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation functional-erase-if-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation functional-erase-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation destructive-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation put-back!-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation put-front!-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation take-out-front!-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation erase*-function))
Source

generics.lisp.

Method: destructive-counterpart ((operation take-out-back!-function))
Source

generics.lisp.

Generic Function: dimensionality (object)

Description:
Number of dimensions in the object.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: dimensionality ((container array))
Source

vector.lisp.

Method: dimensionality ((object fundamental-container))
Method: dimensionality ((object fundamental-range))
Generic Function: distance (container bucket element)
Package

cl-data-structures.metric-space.

Source

common.lisp.

Methods
Method: distance ((container metric-space-set) bucket element)
Generic Function: distance (container bucket element)
Package

cl-data-structures.common.egnat.

Source

generics.lisp.

Methods
Method: distance ((container egnat-metric-set) bucket item)
Source

api.lisp.

Generic Function: distinct (range &key key test hash-function)

Arguments:
–RANGE, Input range.
–TEST, Function used to compare elements. Defaults to EQL.
–HASH-FUNCTION, Function used for hashing. Defaults to #’sxhash.
–KEY, Key function, used to extract values for test.

Description:
Returns forward range that skips elements that were already seen.

Returns:
FUNDAMENTAL-FORWARD-RANGE instance.

Exceptional situations:
Will signal a TYPE-ERROR if either TEST, HASH-FUNCTION or KEY is not funcallable.

Package

cl-data-structures.algorithms.

Source

distinct.lisp.

Methods
Method: distinct (range &key key test hash-function)
Generic Function: drop-back (range count)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: drop-back ((range bidirectional-proxy-box-range) count)
Source

on-each.lisp.

Method: drop-back ((range hash-table-range) count)
Source

common.lisp.

Method: drop-back ((range lazy-bidirectional-range) count)
Source

lazy-range.lisp.

Method: drop-back :before ((range lazy-range) count)
Source

lazy-range.lisp.

Method: drop-back ((range fundamental-bidirectional-range) count)
Generic Function: drop-front (range count)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: drop-front ((range distinct-proxy) count)
Source

distinct.lisp.

Method: drop-front ((range forward-proxy-box-range) count)
Source

on-each.lisp.

Method: drop-front ((range hash-table-range) count)
Source

common.lisp.

Method: drop-front ((object fundamental-skip-list-range) count)
Source

common.lisp.

Method: drop-front ((range forward-tree-range) count)
Source

ranges.lisp.

Method: drop-front ((range lazy-forward-range) count)
Source

lazy-range.lisp.

Method: drop-front :before ((range lazy-range) count)
Source

lazy-range.lisp.

Method: drop-front ((obj expression) count)
Source

expression-wrapper.lisp.

Method: drop-front ((range fundamental-forward-range) count)
Generic Function: each-in-matrix (fn matrix)
Package

cl-data-structures.utils.

Source

distances.lisp.

Methods
Method: each-in-matrix (fn (matrix half-matrix))
Generic Function: empty-clone (container)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: empty-clone ((range forward-chain-of-ranges))
Source

chain.lisp.

Method: empty-clone ((container fundamental-qp-trie-set))
Source

api.lisp.

Method: empty-clone ((container fixed-capacity-synchronization-mixin))
Source

api.lisp.

Method: empty-clone ((container transactional-2-3-queue))
Source

api.lisp.

Method: empty-clone ((container 2-3-queue))
Source

api.lisp.

Method: empty-clone ((container rrb-vector))
Source

api.lisp.

Method: empty-clone ((vector fundamental-sparse-rrb-vector))
Source

api.lisp.

Method: empty-clone ((container hamt-dictionary))
Source

api.lisp.

Method: empty-clone ((container fundamental-skip-list))
Source

common.lisp.

Generic Function: end-execution (pipe)
Package

cl-data-structures.utils.

Source

parallel-tools.lisp.

Methods
Method: end-execution ((obj future-carousel))
Method: end-execution ((pipe pipe-fragment))
Generic Function: entropy (range &key key test count-fn size after)

Arguments:
–RANGE, Object to aggregate.
–KEY, Function used to extract value from element.
–SIZE, Size passed to MAKE-HASH-TABLE function.
–TEST, Test for the hash table.
–COUNT-FN, Function used to extract number of elements. Defaults to constantly 1.

Description:
Calculates Shannon information entropy of the elements in the range (using natural logarithm).

Returns:
Numerical value represting Shannon entropy.

Exceptional situations:
–Will signal TYPE-ERROR when KEY is not a function.
–Will signal TYPE-ERROR when COUNT-FN is not a function.
–Will signal exception as would CL:MAKE-HASH-TABLE function when TEST is invalid.

Notes:
–Uses e as a logarithm base.

Package

cl-data-structures.math.

Source

entropy.lisp.

Methods
Method: entropy (range &key key test size after count-fn)
Generic Function: enumerate (range &key key test size number)

Arguments:
–KEY, Key function used to extract value to the result vector.
–NUMBER, Start of the enumeration.
–TEST, Test fo the MAKE-HASH-TABLE.
–SIZE, Size for the MAKE-HASH-TABLE.

Description:
Gathers unique elements in the RANGE and assigns a number to each (starting with NUMBER, incrementing by 1).

Returns:
CL:HASH-TABLE, unique elements used as keys, numbers stored as values.

Exceptional situations:
–Will signal a TYPE-ERROR if either KEY is not funcallable.
–Will signal a TYPE-ERROR if TABLE is not of type CL:HASH-TABLE.
–Will signal a TYPE-ERROR if NUMBER is not of type CL:INTEGER
–Will signal conditions just like MAKE-HASH-TABLE would if either SIZE or TEST is invalid.

Package

cl-data-structures.algorithms.

Source

enumerate.lisp.

Methods
Method: enumerate (range &key test key number size)
Generic Function: erase (container location)

Syntax:
erase container location => new-instance status

Arguments:
–CONTAINER, Container that shall be modified.
–LOCATION, Designates place in returned instance that will be changed.

Examples:
(let* ((table (cl-ds.dicts.hamt::make-functional-hamt-dictionary #’sxhash #’eq)) (next-table (cl-ds:insert table ’a 5)))
(prove:is (cl-ds:at next-table ’a) 5)
(prove:is (cl-ds:at table ’a) 5 :test (alexandria:compose #’null #’eql)) (cl-ds:mod-bind (erased-table found value) (cl-ds:erase next-table ’a) (prove:ok found)
(prove:is value 5)
(prove:is (cl-ds:at erased-table ’a) nil)
(prove:is (cl-ds:at next-table ’a) 5)))

Description:
Functional API: non-destructively remove an element at the LOCATION from the CONTAINER.

Returns:
–Instance of the same type as CONTAINER, without value at the LOCATION. –Modification status object.

Notes:
This is the functional counterpart to the ERASE! function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: erase ((container functional-dictionary) location)
Source

api.lisp.

Method: erase ((container functional-sparse-vector) location)
Source

api.lisp.

Generic Function: erase! (container location)

Syntax:
erase! container location => same-instance status

Arguments:
–container, Instance that is intended to be destructivly modified. –location, Location in the container that we want to modify by removing value.

Description:
Mutable API: destructively remove a element at the LOCATION from the CONTAINER.

Returns:
–CONTAINER
–Modification status object

Side Effects:
If erase took place, destructivly transform CONTAINER.

Notes:
This is the destrucive counterpart to the ERASE function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: erase! ((container mutable-metric-space-set) item)
Source

api.lisp.

Method: erase! ((container mutable-set) location)
Source

common.lisp.

Method: erase! ((container mutable-dictionary) location)
Source

api.lisp.

Method: erase! ((container mutable-sparse-vector) location)
Source

api.lisp.

Generic Function: erase* (container range)
Package

cl-data-structures.

Source

generics.lisp.

Generic Function: erase*! (container range)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: erase*! ((container mutable-set) range)
Source

common.lisp.

Generic Function: erase-if (container location condition-fn)

Syntax:
erase-if container location condition => new-instance status

Arguments:
–CONTAINER, Container that shall be modified.
–LOCATION, Designates place in returned instance that will be changed.
–CONDITION, Function of one arguments, should return boolean.

Examples:
(let* ((table (cl-ds.dicts.hamt::make-functional-hamt-dictionary #’sxhash #’eq))
(next-table (cl-ds:insert (cl-ds:insert table ’a 5) ’b 6)))
(prove:is (cl-ds:at next-table ’a) 5)
(prove:is (cl-ds:at table ’a) 5 :test (alexandria:compose #’null #’eql))
(cl-ds:mod-bind (erased-table found value changed)
(cl-ds:erase-if next-table ’a
(lambda (value)
(evenp value)))
(prove:ok found)
(prove:is value 5)
(prove:is changed nil)
(prove:is (cl-ds:at erased-table ’a) 5)
(prove:is (cl-ds:at next-table ’a) 5))
(cl-ds:mod-bind (erased-table found value)
(cl-ds:erase-if next-table ’b (lambda (value) (evenp value)))
(prove:ok found)
(prove:is value 6)
(prove:is (cl-ds:at erased-table ’b) nil)
(prove:is (cl-ds:at next-table ’b) 6)))

Description:
Functional API: non-destructively removes an element at LOCATION from the CONTAINER, but only when the CONDITION function returns true. The CONDITION will be called with with a value.

Returns:
–Instance of the same type as CONTAINER, without value at LOCATION
–Modification status object.

Notes:
This is the functional counterpart to the ERASE-IF! function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: erase-if ((container functional-dictionary) location condition-fn)
Source

api.lisp.

Generic Function: erase-if! (container location condition-fn)

Syntax:
erase-if! container location condition => same-instance status

Arguments:
–CONTAINER, Container that shall be modified.
–LOCATION, Designates place in returned instance that will be changed.
–CONDITION, Function of one argument, should return boolean.

Examples:
(let* ((table (cl-ds.dicts.hamt::make-mutable-hamt-dictionary #’sxhash #’eq)))
(setf (cl-ds:at table ’a) 5
(cl-ds:at table ’b) 6)
(prove:is (cl-ds:at table ’a) 5)
(cl-ds:mod-bind (erased-table found value changed) (cl-ds:erase-if! table ’a (lambda (value) (evenp value)))
(prove:ok found)
(prove:is value 5)
(prove:is changed nil)
(prove:is erased-table table)
(prove:is (cl-ds:at erased-table ’a) 5))
(cl-ds:mod-bind (erased-table found value) (cl-ds:erase-if! table ’b (lambda (value) (evenp value)))
(prove:ok found)
(prove:is value 6)
(prove:is erased-table table)
(prove:is (cl-ds:at erased-table ’b) nil)))

Description:
Functional API: destructively remove element at LOCATION from the CONTAINER, only when CONDITION function returns true. CONDITION will be called with with value.

Returns:
–CONTAINER
–Modification status object.

Notes:
This is the destructive counterpart to the ERASE-IF function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: erase-if! ((container mutable-dictionary) location condition-fn)
Source

api.lisp.

Generic Function: establish-special (range bindings &key key)
Package

cl-data-structures.algorithms.

Source

establish-special.lisp.

Methods
Method: establish-special (range bindings &key key)
Generic Function: extrema (range fn &key key value-key after)

Arguments:
–RANGE, Input range.
–FN, Comparsion function.
–KEY, Function used to extract values from the elements in the RANGE.
–VALUE-KEY, Like KEY, but using this instead will preserve the complete element in the result. This argument can be used in combination with KEY, in which case KEY is applied before the VALUE-KEY.

Description:
An aggregation function. Finds extrema (both minimum and maximum) in the RANGE, according to the FN comparsion function.

Returns:
Dotted pair. The first value is the extremum that would occur as the first element in the sequence sorted according to the FN, second value is an element that would occur as the last.

Exceptional situations:
Will signal a TYPE-ERROR if either FN, KEY or VALUE-KEY is not funcallable.

Notes:
–Shadows SERAPEUM:EXTREMA.

Package

cl-data-structures.algorithms.

Source

extrema.lisp.

Methods
Method: extrema (range fn &key key value-key after)
Generic Function: extremum (range fn &key key value-key after)

Arguments:
–RANGE, Input range.
–FN, Comparsion function.
–KEY, Function used to extract values from the elements in the RANGE.
–VALUE-KEY, Like KEY, but using this instead will preserve the complete element in the result. This argument can be used in combination with KEY, in which case KEY is applied before the VALUE-KEY.

Description:
An aggregation function. Finds the extremum (the first value that would occur if the whole range was sorted according to the FN). This can be used to find either the maximum or the minimum.

Returns:
Single extremum value.

Exceptional situations:
Will signal a TYPE-ERROR if either FN, KEY or VALUE-KEY is not funcallable.

Notes:
–Shadows ALEXANDRIA:EXTREMUM.

Package

cl-data-structures.algorithms.

Source

extremum.lisp.

Methods
Method: extremum (range fn &key key value-key after)
Generic Function: fast-map (range metric-function dimensions iterations &key key parallel)

Description:
Embedds finite metric set into euclid space using fast-map algorithm..

Returns:
SIMPLE-ARRAY containing with embeddings with all elements.

Package

cl-data-structures.math.

Source

fast-map.lisp.

Methods
Method: fast-map (range metric-function dimensions iterations &key key parallel)
Generic Function: find (description)

Description:
A function somewhat similar to the posix find tool. Depending on the filesystem content and the DESCRIPTION list, returns a forward-range containing pathnames matching the DESCRIPTION list. DESCRIPTION list supports :directory, :regex-file, :regex-directory, :file, :all-directories and :all-files filters. Type of the filter is supplied as the first element, rest of the specifies the additional options in the form of the plist (:PATH, :PREDICATE etc.). Each of those filters selects matching nodes in the file system and handles it to the next filter. The complete DESCRIPTION list usually looks ‘((:directory :path

Returns:
Forward range. Contains paths to the matched files.

Notes:
–DIRECTORY, This filter is used to specify directory by :PATH.
–REGEX-DIRECTORY, This filter is used to specify directory by PPCRE in the :PATH. Directories with a maching name will be accepted. Can enter directories recursivly and the argument controlling behavior is :TIMES. By default 1, meaning it enters into directories once. Can be set to NIL in order for a unlimited recursive descent.
–FILE, This filter is used to specify file by name supplied in :PATH.
–REGEX-FILE, This filter is used to specify file by PPCRE in the :PATH. Files with a matching name will be accepted.
–ALL-DIRECTORIES, Recursivly selects all directories in the directory returned by the previous filter. Follows symlinks.
–ALL-FILES, Selects all files in the directory returned by the previous filter. :PREDICATE can be used to supply filtering function.

Package

cl-data-structures.file-system.

Source

find.lisp.

Methods
Method: find ((description list))
Generic Function: first-element (range &key key)
Package

cl-data-structures.algorithms.

Source

first-element.lisp.

Methods
Method: first-element (range &key key)
Generic Function: flatten-lists (range &key key)

Arguments:
–RANGE, Input range.
–KEY, Function used to extract lists from elements of the RANGE. Defaults to CL:IDENTITY.

Description:
A layer function. Flattens each list in the input range to the atoms.

Returns:
FUNDAMENTAL-FORWARD-RANGE instance.

Exceptional situations:
Will signal a TYPE-ERROR if KEY is not funcallable.

See also:
–MULTIPLEX

Notes:
–Pretty much the same purpose as for ALEXANDRIA:FLATTEN, but FLATTEN-LISTS is lazy.

Package

cl-data-structures.algorithms.

Source

flatten-lists.lisp.

Methods
Method: flatten-lists (range &key key)
Generic Function: forward-call (object function)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: forward-call ((range forward-chain-of-ranges) function)
Source

chain.lisp.

Method: forward-call ((range proxy-range) function)
Source

common.lisp.

Method: forward-call ((object fundamental-forward-range) function)
Generic Function: found (status)

Syntax:
found status => boolean

Arguments:
–STATUS, instance of modification status class.

Returns:
T if LOCATION was occupied before operation took place, NIL otherwise.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: found ((status lazy-modification-operation-status))
Source

lazy-box.lisp.

Reader Method: found ((implementation-modification-operation-status implementation-modification-operation-status))

automatically generated reader method

Source

modification-operation-status.lisp.

Target Slot

%found.

Generic Function: frequency (range &key key test normalize)
Package

cl-data-structures.algorithms.

Source

frequency.lisp.

Methods
Method: frequency (range &key key test normalize)
Generic Function: fresh-bucket-status (operation value)
Package

cl-data-structures.meta.

Source

meta.lisp.

Methods
Method: fresh-bucket-status (operation value)
Source

meta.lisp.

Method: fresh-bucket-status ((operation update-if!-function) value)
Source

meta.lisp.

Method: fresh-bucket-status ((operation update!-function) value)
Source

meta.lisp.

Method: fresh-bucket-status ((operation update-if-function) value)
Source

meta.lisp.

Method: fresh-bucket-status ((operation update-function) value)
Source

meta.lisp.

Generic Function: functional-counterpart (operation)

Syntax:
functional-counterpart operation => functional-operation

Arguments:
–OPERATION, Instance of the modification API function.

Description:
Low level function that returns an instance of the functional api modification function that serves the same purpose as the OPERATION. Will, for instance, return #’UPDATE when OPERATION is #’UPDATE! Will return original the OPERATION if OPERATION is already part of the functional API.

Returns:
The instance of api function.

Notes:
This function is low level, and therefore should be rarely (if ever) used by the user of this library.

Package

cl-data-structures.meta.

Source

meta.lisp.

Methods
Method: functional-counterpart ((operation update!-function))
Source

generics.lisp.

Method: functional-counterpart ((operation take-out!-function))
Source

generics.lisp.

Method: functional-counterpart ((operation insert!-function))
Source

generics.lisp.

Method: functional-counterpart ((operation add!-function))
Source

generics.lisp.

Method: functional-counterpart ((operation put!-function))
Source

generics.lisp.

Method: functional-counterpart ((operation erase-if!-function))
Source

generics.lisp.

Method: functional-counterpart ((operation update-if!-function))
Source

generics.lisp.

Method: functional-counterpart ((operation erase*!-function))
Source

generics.lisp.

Method: functional-counterpart ((operation erase!-function))
Source

generics.lisp.

Method: functional-counterpart ((operation functional-function))
Source

generics.lisp.

Generic Function: functionalp (container)

Syntax:
–(functionalp mutable-container) -> nil
–(functionalp functional-container) -> t

Arguments:
–container, A subclass of the fundamental-container

Examples:
(progn
(let ((mutable (cl-ds.dicts.hamt:make-mutable-hamt-dictionary #’sxhash #’eq))) (prove:ok (cl-ds:mutablep mutable))
(prove:ok (not (cl-ds:functionalp mutable))))
(let ((functional (cl-ds.dicts.hamt:make-functional-hamt-dictionary #’sxhash #’eq))) (prove:ok (not (cl-ds:mutablep functional)))
(prove:ok (cl-ds:functionalp functional))))

Returns:
T if CONTAINER exposes functional API and NIL if not.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: functionalp ((container functional))
Method: functionalp ((container fundamental-container))
Generic Function: gather-minhash-corpus (range k &key key corpus)

Arguments:
–RANGE, Object to aggregate.
–K, What is the length of the minhash vectors? Should be the positive-fixnum.
–KEY, Function used to extract value for aggregation.

Description:
Constructs the MINHASH-CORPUS by gathering all objects in the input range. Corpus can be then used in the MINHASH function to calculate minhash vectors.

Returns:
Instance of the MINHASH-CORPUS class.

Exceptional situations:
–Will signal TYPE-ERROR wthen K is not of the type POSITIVE-FIXNUM.

Notes:
–Larger K values usually allow for higher precision of the Jaccard distance estimation.
–Uses HASH-TABLE with EQUAL :TEST underneath to gather elements. Therefore it is required fore elements in the RANGE to be comparable with EQUAL function. –To produce stream of elements from individual sets in a range you can use either FLATTEN-LISTS or MULTIPLEX functions.

Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Methods
Method: gather-minhash-corpus (range k &key key corpus)
Generic Function: geometric-average (range &key key count total after)

Arguments:
–RANGE, Object to aggregate.
–KEY, Function used to extract value from RANGE element.

Description:
Calculate geometric average of elements in the range

Package

cl-data-structures.math.

Source

average.lisp.

Methods
Method: geometric-average (range &key key count total after)
Generic Function: get-range-key-function (container)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Methods
Method: get-range-key-function ((container hamt-dictionary))
Source

api.lisp.

Generic Function: gini-impurity (range &key key test size count-fn)

Arguments:
–RANGE, Object to aggregate.
–KEY, Function used to extract value from element.
–SIZE, Size passed to the MAKE-HASH-TABLE function.
–TEST, Test for the hash table.
–COUNT-FN, Function used to extract count of elements from the element in the RANGE.

Description:
Calculates Gini impurity of the content range.

Returns:
Numerical value representing the Gini impurity.

Exceptional situations:
–Will signal TYPE-ERROR when HASH-TABLE is not of the type CL:HASH-TABLE.
–Will signal TYPE-ERROR when KEY is not a function.
–Will signal TYPE-ERROR when COUNT-FN is not a function.
–Will signal exception as would CL:MAKE-HASH-TABLE function when TEST is invalid.

Package

cl-data-structures.math.

Source

gini-impurity.lisp.

Methods
Method: gini-impurity (range &key key test size count-fn)
Generic Function: group-by (range &key test key groups transform having)

Arguments:
–RANGE, Range that is supposed to be groupped.
–TRANSFORM, This function will be called with each constructed group and the result will be placed in the result range in place of the original group. Defaults to IDENTITY. –HAVING, This function will called with each constructed group (before calling TRANSFORM). If true is returned; group is kept in the result range, otherwise group is discarded. –KEY, Key function, used to extract value for TEST.
–GROUPS, HASH-TABLE groups prototype. Passing this will cause :TEST to be discarded. This argument is useful for using non-portable HASH-TABLE extension.
–TEST, Test for the inner hashtable (either eq, eql or equal).

Examples:
(let* ((data #(1 2 3 4 5 6 7 8 9 10))
(sums (cl-ds.alg:accumulate (cl-ds.alg:group-by data :key #’evenp) #’+)))
(prove:is (cl-ds:size sums) 2)
(prove:is (cl-ds:at sums t) 30)
(prove:is (cl-ds:at sums nil) 25))

Description:
Groups RANGE into partitions according to the TEST. This does not change the content of the RANGE, but will force aggregation to be performed on every group independently.

Returns:
GROUP-BY-RANGE instance (either forward, bidirectional or random access, based on the class of the RANGE).

Exceptional situations:
–Will signal a TYPE-ERROR if KEY is not funcallable.
–Will pass TEST to MAKE-HASH-TABLE and therefore will signal same conditions as MAKE-HASH-TABLE.

Notes:
–There is also parallel version of this function called parallel-group-by.
–Uses hash-table underneath, you can extract internal hash-table out of the aggregation result with READ-HASH-TABLE.

Package

cl-data-structures.algorithms.

Source

group-by.lisp.

Methods
Method: group-by (range &key test key groups transform having)
Generic Function: harmonic-average (range &key key count sum after)

Arguments:
–RANGE, Object to aggregate.
–KEY, Function used to extract value from RANGE element.

Description:
Calculate harmonic average of elements in the range

Exceptional situations:
Will return 0 if at least one elements is zero.

Package

cl-data-structures.math.

Source

average.lisp.

Methods
Method: harmonic-average (range &key key after count sum)
Generic Function: harmonic-average-mutual-information (range fields &key key)
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Methods
Method: harmonic-average-mutual-information (range fields &key key)
Generic Function: hash-table-elementwise (range)
Package

cl-data-structures.algorithms.

Source

hash-table-elementwise.lisp.

Methods
Method: hash-table-elementwise (range)
Generic Function: hodges-lehmann-estimator (range &key key parallel after)

Arguments:
–RANGE, Object to aggregate
–KEY, Function used to extract value from element. –PARALLEL, Will use lparallel for calculations if T.

Description:
Calculates Hodges-Lehman estimator for range.

Thread Safety:
Will ues lparallel if PARALLEL is T.

See also:
–BOOTSTRAP

Notes:
–This estimator has high breakdown point.
–Roboost expected value estimator.
–Time complexity greater then cubic. Memory complexity quadratic. –Use bootstrapping for more scalable solution.

Package

cl-data-structures.math.

Source

hodges-lehmann.lisp.

Methods
Method: hodges-lehmann-estimator (range &key key parallel after)
Generic Function: in-batches (range batch-size)

Arguments:
–RANGE, Input range.
–BATCH-SIZE, Maximum size of the batch.

Description:
Groups RANGE elementwise into partitions of up to the size BATCH-SIZE. This does not change the content of the RANGE, but will force aggregation to be performed on every group independently.

Exceptional situations:
–Will signal a TYPE-ERROR if BATCH-SIZE is not of the type POSITIVE-INTEGER.

Package

cl-data-structures.algorithms.

Source

in-batches.lisp.

Methods
Method: in-batches (range batch-size)
Generic Function: insert (container location new-value)

Syntax:
insert container location new-value => new-instance status

Arguments:
–container, Instance of container.
–location, Designates place in returned instance that will be changed
–new-value, Value that will be inserted into returned instance

Examples:
(let* ((table (cl-ds.dicts.hamt::make-functional-hamt-dictionary #’sxhash #’eq))
(next-table (cl-ds:insert table ’a 5)))
(prove:is (cl-ds:at next-table ’a) 5)
(prove:is (cl-ds:at table ’a) 5 :test (alexandria:compose #’null #’eql)))

Description:
Functional API: non-destructively insert the NEW-VALUE into the CONTAINER at the LOCATION. Will replace a value at the LOCATION if it was already occupied.

Returns:
–Instance of the same type as CONTAINER, with NEW-VALUE at LOCATION
–Modification status object.

Notes:
This is the functional counterpart to the (SETF AT) function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: insert ((container functional-dictionary) location new-value)
Source

api.lisp.

Method: insert ((container functional-sparse-vector) location new-value)
Source

api.lisp.

Generic Function: insert! (container location value)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: insert! ((container mutable-sparse-vector) location value)
Source

api.lisp.

Method: insert! ((container mutable-dictionary) location value)
Source

api.lisp.

Generic Reader: internal-array (sketch)
Package

cl-data-structures.streaming-algorithms.

Source

common.lisp.

Methods
Reader Method: internal-array ((bloom-filter bloom-filter))

automatically generated reader method

Source

bloom-filter.lisp.

Target Slot

%counters.

Reader Method: internal-array ((approximated-counts approximated-counts))

automatically generated reader method

Source

approximated-counts.lisp.

Target Slot

%counters.

Reader Method: internal-array ((approximated-set-cardinality approximated-set-cardinality))

automatically generated reader method

Source

approximated-set-cardinality.lisp.

Target Slot

%registers.

Generic Function: last-element (range &key key)
Package

cl-data-structures.algorithms.

Source

first-element.lisp.

Methods
Method: last-element (range &key key)
Generic Function: latch (range latch &rest more-latches)

Arguments:
–RANGE, Primary input range.
–LATCH, Range with boolean values.
–MORE-LATCHES, Ranges with boolean values.

Examples:
(prove:is ’(1 4) (cl-ds.alg:to-list (cl-ds.alg:latch (cl-ds:iota-range :from 0 :to 5) (list nil t nil nil t))))

Description:
Combines primary range with multiple latch ranges. The returned range contains elements picked from the primary range, where, on corresponding positions, each of the latch ranges contains a non-nil value.

Returns:
FUNDAMENTAL-FORWARD-RANGE instance.

Package

cl-data-structures.algorithms.

Source

latch.lisp.

Methods
Method: latch (range latch &rest more-latches)
Generic Function: layer-aggregator-constructor (function outer-constructor arguments)
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Methods
Method: layer-aggregator-constructor ((function sliding-window-function) outer-fn arguments)
Source

sliding-window.lisp.

Method: layer-aggregator-constructor ((function in-batches-function) outer-constructor arguments)
Source

in-batches.lisp.

Method: layer-aggregator-constructor ((function distinct-function) outer-fn arguments)
Source

distinct.lisp.

Method: layer-aggregator-constructor ((function partition-if-function) outer-fn arguments)
Source

partition-if.lisp.

Method: layer-aggregator-constructor ((function cumulative-accumulate-function) outer-fn arguments)
Source

cumulative-accumulate.lisp.

Method: layer-aggregator-constructor ((function hash-table-elementwise-function) outer-constructor arguments)
Source

hash-table-elementwise.lisp.

Method: layer-aggregator-constructor ((function array-elementwise-function) outer-constructor arguments)
Source

array-elementwise.lisp.

Generic Function: lower-bound (container location)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: lower-bound ((container mutable-skip-list-set) location)
Source

api.lisp.

Method: lower-bound ((container mutable-skip-list-dictionary) location)
Source

api.lisp.

Generic Function: make-bucket (container operation value &rest all &key composite-container-operations composite-container-make-bucket-callbacks composite-container-rest-arguments composite-container-arguments composite-container-locations &allow-other-keys)

Description:
Constructs abstract bucket.

Returns:
–New or passed bucket. May return nil as empty bucket. –Instance of position modification status.

Side Effects:
Can modify bucket.

Package

cl-data-structures.meta.

Source

meta.lisp.

Methods
Method: make-bucket ((container composite-container) operation value &rest all &key composite-container-operations composite-container-make-bucket-callbacks composite-container-rest-arguments composite-container-arguments composite-container-locations)
Source

implementation.lisp.

Method: make-bucket ((container fundamental-container) (operation shrink-function) value &rest all)
Source

meta.lisp.

Method: make-bucket ((container fundamental-container) (operation grow-function) value &rest all)
Source

meta.lisp.

Generic Function: make-bucket-from-multiple (operation container data &rest all &key &allow-other-keys)
Package

cl-data-structures.meta.

Source

meta.lisp.

Methods
Method: make-bucket-from-multiple (operation container data &rest all)
Generic Function: make-from-traversable (traversable class &rest arguments)

Arguments:
–CLASS, Class of resulting container.
–ARGUMENTS, Arguments, as passed to usual make function.
–TRAVERSABLE, Data that should be put in the result container.

Description:
Creates the container of CLASS with the content from the TRAVERSABLE. Additional arguments needed for construction of the new instance are passed as ARGUMENTS list.

Returns:
Instance of CLASS.

Exceptional situations:
Varies, depending on the CLASS argument.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: make-from-traversable ((sequence fundamental-forward-range) (class (eql cl-data-structures.metric-space.egnat:mutable-egnat-metric-set)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable ((sequence fundamental-random-access-range) (class (eql cl-data-structures.metric-space.egnat:mutable-egnat-metric-set)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable ((sequence vector) (class (eql cl-data-structures.metric-space.egnat:mutable-egnat-metric-set)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable (traversable (class (eql cl-data-structures.sets.skip-list:mutable-skip-list-set)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable (traversable (class (eql cl-data-structures.sets.qp-trie:mutable-qp-trie-set)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable (traversable (class (eql cl-data-structures.queues.2-3-tree:functional-2-3-queue)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable (traversable (class (eql cl-data-structures.queues.2-3-tree:synchronized-mutable-2-3-queue)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable (traversable (class (eql cl-data-structures.queues.2-3-tree:mutable-2-3-queue)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable (traversable (class (eql cl-data-structures.sequences.rrb-vector:transactional-rrb-vector)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable (traversable (class (eql cl-data-structures.sequences.rrb-vector:functional-rrb-vector)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable (traversable (class (eql cl-data-structures.sequences.rrb-vector:mutable-rrb-vector)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable ((class (eql cl-data-structures.dicts.srrb:transactional-sparse-rrb-vector)) traversable &rest arguments)
Source

api.lisp.

Method: make-from-traversable ((class (eql cl-data-structures.dicts.srrb:functional-sparse-rrb-vector)) traversable &rest arguments)
Source

api.lisp.

Method: make-from-traversable ((class (eql cl-data-structures.dicts.srrb:mutable-sparse-rrb-vector)) traversable &rest arguments)
Source

api.lisp.

Method: make-from-traversable (traversable (class (eql cl-data-structures.dicts.hamt:transactional-hamt-dictionary)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable (traversable (class (eql cl-data-structures.dicts.hamt:functional-hamt-dictionary)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable (traversable (class (eql cl-data-structures.dicts.hamt:mutable-hamt-dictionary)) &rest arguments)
Source

api.lisp.

Method: make-from-traversable (traversable (class (eql cl-data-structures.dicts.skip-list:mutable-skip-list-dictionary)) &rest arguments)
Source

api.lisp.

Generic Function: make-of-size (class size &rest more)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: make-of-size ((class (eql cl-data-structures.sequences.rrb-vector:transactional-rrb-vector)) size &rest arguments)
Source

api.lisp.

Method: make-of-size ((class (eql cl-data-structures.sequences.rrb-vector:functional-rrb-vector)) size &rest arguments)
Source

api.lisp.

Method: make-of-size ((class (eql cl-data-structures.sequences.rrb-vector:mutable-rrb-vector)) size &rest arguments)
Source

api.lisp.

Generic Function: make-proxy (range class &rest all &key &allow-other-keys)
Package

cl-data-structures.algorithms.

Source

common.lisp.

Methods
Method: make-proxy ((range traversable) class &rest all &key &allow-other-keys)
Generic Function: make-range (container current-node last-node)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Methods
Method: make-range ((container mutable-skip-list-set) current-node last-node)
Source

api.lisp.

Method: make-range ((container mutable-skip-list-dictionary) current-node last-node)
Source

api.lisp.

Method: make-range ((container fundamental-skip-list) current-node last-node)
Generic Function: map-bucket (container bucket function)
Package

cl-data-structures.meta.

Source

meta.lisp.

Methods
Method: map-bucket ((container fundamental-sparse-vector) bucket function)
Source

common.lisp.

Method: map-bucket ((container fundamental-hashing-dictionary) bucket function)
Source

common.lisp.

Method: map-bucket (container (bucket (eql cl-data-structures.meta:null-bucket)) function)
Method: map-bucket (container bucket function)
Method: map-bucket (container (bucket sequence) function)
Generic Function: median-absolute-deviation (range &key key)

Arguments:
–RANGE, Object to aggregate
–KEY, Function used to extract array from RANGE element.

Description:
Calculates MAD estimator for element in the RANGE.

Notes:
Roboost scale estimator.

Package

cl-data-structures.math.

Source

median-absolute-deviation.lisp.

Methods
Method: median-absolute-deviation (range &key key)
Generic Function: minhash (corpus elements)

Arguments:
–CORPUS, Object constructed with the GATHER-MINHASH-CORPUS function.
–ELEMENTS, List of objects that need are being hashed.

Description:
Calculates minhash for the ELEMENTS with the use of the CORPUS

Returns:
An one dimensional SIMPLE-ARRAY specialized for FIXNUM of the size equal to the K parameter passed to the GATHER-MINHASH-CORPUS function.

Exceptional situations:
–Objects in the ELEMENTS that can’t be find in the CORPUS are ignored.
–Will signal TYPE-ERROR when CORPUS is not of the type MINHASH-CORPUS or ELEMENTS is not of the type CL:LIST.

Notes:
–Think about minhash as a fingerprint function.
–Returned minhash vector can be used to quickly calculate approximated Jaccard distance.
–Can be used for near duplicate detection.
–Empty set will be hashed to array of MOST-POSITIVE-FIXNUMs.

Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Methods
Method: minhash ((corpus one-bit-minhash) elements)
Method: minhash ((corpus fundamental-minhash) elements)
Method: minhash ((corpus minhash-corpus) elements)
Generic Function: moments (range from count about &key key after)

Arguments:
–RANGE, Object to aggregate.
–FROM, Positive number. Lowest moment to calculate.
–COUNT, Positive number. How many moments to calculate.
–ABOUT, Number. Value around which moments are calculated.
–KEY, Function used to extract values from elements.

Description:
Calculate statistical moments in the range.

Returns:
Range. Query it with CL-DS:AT function passing rank of moment that you want to obtain.

Package

cl-data-structures.math.

Source

moments.lisp.

Methods
Method: moments (range from count about &key key after)
Generic Function: moving-average (range &key key)

Arguments:
–RANGE, Object to process.
–KEY, Function used to extract values from the RANGE.

Description:
Calculates moving-average for elements in the RANGE.

Returns:
Range of all moving-averages.

Package

cl-data-structures.math.

Source

moving-average.lisp.

Methods
Method: moving-average (range &key key)
Generic Function: multiplex (range &key key function)

Description:
Transforms input RANGE by extracting elements from it, applying FUNCTION and chaining resulting ranges.

Returns:
Instance of MULTIPLEX-PROXY

Notes:
–Chaining process is not recursive.
–To completly flatten lists use FLATTEN-LISTS instead.
–There is a parallelized version of this function called parallel-multiplex.

Package

cl-data-structures.algorithms.

Source

multiplex.lisp.

Methods
Method: multiplex (range &key key function)
Generic Function: mutablep (container)

Syntax:
–mutablep mutable-container => t
–mutablep functional-container => nil

Arguments:
–CONTAINER, Any subclass of fundamental-container

Examples:
(progn (let ((mutable (cl-ds.dicts.hamt:make-mutable-hamt-dictionary #’sxhash #’eq))) (prove:ok (cl-ds:mutablep mutable))
(prove:ok (not (cl-ds:functionalp mutable))))
(let ((functional (cl-ds.dicts.hamt:make-functional-hamt-dictionary #’sxhash #’eq))) (prove:ok (not (cl-ds:mutablep functional)))
(prove:ok (cl-ds:functionalp functional))))

Returns:
T if CONTAINER exposes mutable API and NIL if not.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: mutablep ((container mutable))
Method: mutablep ((container fundamental-container))
Generic Function: mutate-matrix (destination fn m1 &rest more)
Package

cl-data-structures.utils.

Source

distances.lisp.

Methods
Method: mutate-matrix ((destination half-matrix) fn m1 &rest more)
Generic Function: mutual-information (range fields &key key)

Description:
Calculates mutual-information between FIELD and COMPARATIVE-FIELDS. Elements in each FIELD should be EQUAL comparable.

Returns:
Range. Provides access to values for each field by quering cl-ds:at with label of field.

Package

cl-data-structures.math.

Source

mutual-information.lisp.

Methods
Method: mutual-information (range fields &key key)
Generic Function: mutual-information-matrix (range fields &key key)
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Methods
Method: mutual-information-matrix (range fields &key key)
Generic Function: near (container item maximal-distance)

Arguments:
–CONTAINER, Container searched for element.
–ITEM, Item to search around.
–MAXIMAL-DISTANCE, Don’t yield elements longer

Examples:
(let* ((data #(10 20 40 5 11 12 50 30 20 1 6 7 8 18 21 51 52 80 78))
(set (cl-ds:make-from-traversable
data
’cl-ds.ms.egnat:mutable-egnat-metric-set
(alexandria:compose #’abs #’-)
’fixnum))
(near (cl-ds.alg:to-vector (cl-ds:near set 10 7))))
(prove:ok (every (lambda (x) (< 3 x 17)) near)))

Description:
Searches the CONTAINER for elements that are at most a MAXIMAL-DISTANCE away from the ITEM. Returns a range of elements.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: near ((container fundamental-egnat-container) item maximal-distance)
Source

methods.lisp.

Generic Function: on-each (range function &key key functor-constructor)

Arguments:
–RANGE, Input range.
–FUNCTION, Function called on the RANGE content.
–KEY, Function used to extract content for the FUNCTION. Defaults to the CL:IDENTITY.

Description:
Creates a new range by applying the FUNCTION to each element of the RANGE.

Returns:
FUNDAMENTAL-FORWARD-RANGE instance.

Exceptional situations:
Will signal a TYPE-ERROR if KEY or FUNCTION is not funcallable.

Notes:
–Works almost like cl:map-and-friends, but lazily evaluates content.
–There is also parallel version of this function: parallel-on-each.

Package

cl-data-structures.algorithms.

Source

on-each.lisp.

Methods
Method: on-each (range function &key key functor-constructor)
Generic Function: only (range predicate &key key)

Arguments:
–RANGE, Input range.
–PREDICATE, Test used to check if element should be skipped.
–KEY, Key function used to extract a value for predicate.

Description:
A layer function. Creates a range that skips elements that PREDICATE (KEY element) => NIL.

Returns:
Either forward, bidirectional or random-access range, depending on the RANGE.

Exceptional situations:
Will signal a TYPE-ERROR if either PREDICATE or KEY is not funcallable.

Package

cl-data-structures.algorithms.

Source

only.lisp.

Methods
Method: only (range predicate &key key)
Generic Function: only-different (range &key test initial-value key)

Description:
A layer function. Creates a range that skips ELEMENT if it is the same as the previous in the range (according to the TEST function).

Returns:
A forward range.

Package

cl-data-structures.algorithms.

Source

only-different.lisp.

Methods
Method: only-different (range &key test initial-value key)
Generic Function: open-stream-designator (designator)
Package

cl-data-structures.file-system.

Methods
Method: open-stream-designator ((designator command))
Source

unix.lisp.

Method: open-stream-designator ((designator string))
Source

common.lisp.

Method: open-stream-designator ((designator pathname))
Source

common.lisp.

Generic Function: optimal-split-point (range fields &key key)
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Methods
Method: optimal-split-point (range fields &key key)
Generic Function: parallel-group-by (range &key test key groups chunk-size maximum-queue-size having transform)
Package

cl-data-structures.threads.

Source

parallel-group-by.lisp.

Methods
Method: parallel-group-by (range &key test key chunk-size having transform maximum-queue-size groups)
Generic Function: parallel-multiplex (range &key key function chunk-size maximum-queue-size)

Description:
Like CL-DS.ALG:MULTIPLEX but when aggregation is performed, multiplexing function is applied in parallel. Obtained results are then passed with a queue into the original thread.

Returns:
Instance of PARALLEL-FORWARD-MULTIPLEX-PROXY.

Exceptional situations:
–Will raise a TYPE-ERROR when MAXIMAL-QUEUE-SIZE is not integer.
–Will raise CL-DS:ARGUMENT-VALUE-OUT-OF-BOUNDS when MAXIMAL-QUEUE-SIZE is not at least 16.
–Will raise a TYPE-ERROR when FUNCTION is not funcallable.
–Will raise a TYPE-ERROR when FUNCTION is not key.

See also:
–MULTIPLEX

Notes:
–Outside of aggregation behaves exactly like MULTIPLEX.

Package

cl-data-structures.threads.

Source

parallel-multiplex.lisp.

Methods
Method: parallel-multiplex (range &key function key chunk-size maximum-queue-size)
Generic Function: parallel-on-each (range function &key key maximum-queue-size chunk-size functor-constructor)

Description:
Like on-each but when performing aggregation FUNCTION will be applied in parallel, on lparallel worker threads. To reduce overhead of scheduling lparallel task, use large CHUNK-SIZE.

Returns:
Instance of PARALLEL-ON-EACH-PROXY.

Exceptional situations:
–Will raise a TYPE-ERROR when MAXIMAL-QUEUE-SIZE is not integer.
–Will raise a TYPE-ERROR when FUNCTION is not a (OR FUNCTION SYMBOL).
–Will raise a TYPE-ERROR when KEY is not a (OR FUNCTION SYMBOL).
–Will raise a TYPE-ERROR when CHUNK-SIZE is not integer.
–Will raise CL-DS:ARGUMENT-VALUE-OUT-OF-BOUNDS when CHUNK-SIZE is not at least 1.
–Will raise CL-DS:ARGUMENT-VALUE-OUT-OF-BOUNDS when MAXIMAL-QUEUE-SIZE is not at least 16.
–Exceptions raised during aggregation or when funcalling the callback will be transfered to the original thread.

Notes:
This function is unsuited for aggregations that depend on the order of the elements.

Package

cl-data-structures.threads.

Source

parallel-on-each.lisp.

Methods
Method: parallel-on-each (range function &key key maximum-queue-size chunk-size functor-constructor)
Generic Function: partition-if (range test &key key on-first)

Arguments:
–RANGE, An input range.
–TEST, A function of two arguments used to check if elements belong to the same partition.

Examples:
(let* ((data ’((1 "w") (1 "o") (1 "r") (1 "d") (2 "a") (2 "s") (3 "l") (3 "a") (3 "w")))
(partitioned (cl-ds.alg:partition-if data (lambda (prev next) (= (first prev) (first next)))))
(aggregated (cl-ds.alg:to-vector partitioned :key (lambda (x) (map ’string (alexandria:compose #’alexandria:first-elt #’second) x)))))
(prove:is aggregated #("word" "as" "law") :test #’equalp))

Description:
Groups consecutive elements in the range into a partition if TEST called on the previous value in the range and the current value in the range returns non-NIL, creates new partition otherwise. This does not change the content of the RANGE, but it will force aggregation to be performed on every group independently. Order of the groups is preserved in the aggregation result.

Returns:
ABSTRACT-PARTITION-IF-PROXY instance.

Notes:
–Aggregation on the returned range is performed eagerly.
–Can be considered to be alternative to the GROUP-BY, suitable for the ordered data.

Package

cl-data-structures.algorithms.

Source

partition-if.lisp.

Methods
Method: partition-if (range test &key key on-first)
Generic Function: pass-bucket-operation (operation container &rest arguments)
Package

cl-data-structures.meta.

Source

meta.lisp.

Generic Function: pass-bucket-query (container &rest arguments)
Package

cl-data-structures.meta.

Source

meta.lisp.

Generic Reader: path (condition)
Package

cl-data-structures.

Methods
Reader Method: path ((condition file-releated-error))
Source

conditions.lisp.

Target Slot

%path.

Generic Function: peek-back (range)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: peek-back ((range zipping-mixin))
Source

zip.lisp.

Method: peek-back ((range bidirectional-connecting-range))
Source

zip.lisp.

Method: peek-back ((range bidirectional-chain-of-ranges))
Source

chain.lisp.

Method: peek-back ((range bidirectional-filtering-proxy))
Source

filtering.lisp.

Method: peek-back ((range bidirectional-proxy-box-range))
Source

on-each.lisp.

Method: peek-back ((range hash-table-range))
Source

common.lisp.

Method: peek-back ((range bidirectional-proxy-range))
Source

common.lisp.

Method: peek-back ((range rrb-range))
Source

common.lisp.

Method: peek-back ((container sequence-window))
Source

sequence-window.lisp.

Method: peek-back ((range lazy-bidirectional-range))
Source

lazy-range.lisp.

Method: peek-back :before ((range lazy-range))
Source

lazy-range.lisp.

Method: peek-back ((range vector-range))
Source

vector.lisp.

Generic Function: (setf peek-back) (range)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: (setf peek-back) ((range mutable-rrb-range))
Source

common.lisp.

Generic Function: peek-front (range)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: peek-front ((range moving-average-range))
Source

moving-average.lisp.

Method: peek-front ((range find-range))
Source

find.lisp.

Method: peek-front ((range tokenizing-range))
Source

tokenize.lisp.

Method: peek-front ((range line-by-line-range))
Source

line-by-line.lisp.

Method: peek-front ((range forward-distinct-proxy))
Source

distinct.lisp.

Method: peek-front ((range forward-partition-if-proxy))
Source

partition-if.lisp.

Method: peek-front ((range forward-flatten-proxy))
Source

flatten-lists.lisp.

Method: peek-front ((range zipping-mixin))
Source

zip.lisp.

Method: peek-front ((range forward-connecting-range))
Source

zip.lisp.

Method: peek-front ((range forward-chain-of-ranges))
Source

chain.lisp.

Method: peek-front ((range cumulative-accumulate-range))
Source

cumulative-accumulate.lisp.

Method: peek-front ((range forward-latch-proxy))
Source

latch.lisp.

Method: peek-front ((range repeat-proxy))
Source

repeat.lisp.

Method: peek-front ((range restrain-size-proxy))
Source

restrain-size.lisp.

Method: peek-front ((range forward-cartesian-range))
Source

cartesian.lisp.

Method: peek-front ((range multiplex-proxy))
Source

multiplex.lisp.

Method: peek-front ((range forward-filtering-proxy))
Source

filtering.lisp.

Method: peek-front ((object shuffled-range))
Source

shuffled-range.lisp.

Method: peek-front ((range forward-proxy-box-range))
Source

on-each.lisp.

Method: peek-front ((range hash-table-range))
Source

common.lisp.

Method: peek-front ((range forward-proxy-range))
Source

common.lisp.

Method: peek-front ((range mutable-skip-list-set-range))
Source

api.lisp.

Method: peek-front ((object qp-trie-set-range))
Source

api.lisp.

Method: peek-front ((range 2-3-queue-range))
Source

api.lisp.

Method: peek-front ((range mutable-skip-list-dictionary-range))
Source

api.lisp.

Method: peek-front ((range egnat-range))
Source

methods.lisp.

Method: peek-front ((object fundamental-skip-list-range))
Source

common.lisp.

Method: peek-front ((range rrb-range))
Source

common.lisp.

Method: peek-front ((range chunked-rrb-range))
Source

common.lisp.

Method: peek-front ((container sequence-window))
Source

sequence-window.lisp.

Method: peek-front ((range forward-tree-range))
Source

ranges.lisp.

Method: peek-front ((range lazy-forward-range))
Source

lazy-range.lisp.

Method: peek-front :before ((range lazy-range))
Source

lazy-range.lisp.

Method: peek-front ((obj list-range))
Source

list.lisp.

Method: peek-front ((range vector-range))
Source

vector.lisp.

Method: peek-front ((range empty-range))
Source

auxilary.lisp.

Method: peek-front ((obj expression))
Source

expression-wrapper.lisp.

Method: peek-front ((range chunked-range))
Generic Function: (setf peek-front) (range)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: (setf peek-front) ((range mutable-rrb-range))
Source

common.lisp.

Method: (setf peek-front) ((range assignable-forward-tree-range))
Source

ranges.lisp.

Generic Function: position-modification (operation container structure location &rest all &key value &allow-other-keys)

Syntax:
position-modification operation container location more-args => container status

Arguments:
–OPERATION, Instance of API function.
–CONTAINER, Instance of container class
–LOCATION, Where modification is supposed to happen?

Description:
A low level function used as de facto implementation point of all API modification functions (INSERT, ADD, UPDATE).

Returns:
–Container (new or the same instance)
–Modification status

Notes:
Implementations of this generic function are multimethods dispatched on the class of the OPERATION and on the CONTAINER.

Package

cl-data-structures.meta.

Source

meta.lisp.

Methods
Method: position-modification ((function put!-function) container (structure mutable-skip-list-set) location &rest all)
Source

api.lisp.

Method: position-modification ((function erase*!-function) container (structure mutable-qp-trie-set) (location qp-trie-set-range) &rest all)
Source

api.lisp.

Method: position-modification ((function erase!-function) container (structure mutable-qp-trie-set) location &rest all)
Source

api.lisp.

Method: position-modification ((function put!-function) container (structure mutable-qp-trie-set) location &rest all)
Source

api.lisp.

Method: position-modification ((operation take-out!-function) container (structure fixed-capacity-synchronization-mixin) location &rest all)
Source

api.lisp.

Method: position-modification ((operation put!-function) container (structure fixed-capacity-synchronization-mixin) location &rest all)
Source

api.lisp.

Method: position-modification ((operation put!-function) container (structure synchronization-mixin) location &rest all)
Source

api.lisp.

Method: position-modification ((operation take-out!-function) container (structure synchronization-mixin) location &rest all)
Source

api.lisp.

Method: position-modification ((operation take-out!-function) container (structure mutable-2-3-queue) location &rest all)
Source

api.lisp.

Method: position-modification ((operation take-out!-function) container (structure transactional-2-3-queue) location &rest all)
Source

api.lisp.

Method: position-modification ((operation take-out-function) container (structure functional-2-3-queue) location &rest all)
Source

api.lisp.

Method: position-modification ((operation put!-function) container (structure transactional-2-3-queue) location &rest all)
Source

api.lisp.

Method: position-modification ((operation put!-function) container (structure mutable-2-3-queue) location &rest all)
Source

api.lisp.

Method: position-modification ((operation put-function) container (structure functional-2-3-queue) location &rest all)
Source

api.lisp.

Method: position-modification ((operation grow-function) container (structure functional-rrb-vector) index &rest rest &key value &allow-other-keys)
Source

api.lisp.

Method: position-modification ((operation grow-function) container (structure transactional-rrb-vector) index &rest rest &key value &allow-other-keys)
Source

api.lisp.

Method: position-modification ((operation take-out-function) container (structure functional-rrb-vector) location &rest rest &key &allow-other-keys)
Source

api.lisp.

Method: position-modification ((operation put!-function) container (structure transactional-rrb-vector) location &rest rest &key value &allow-other-keys)
Source

api.lisp.

Method: position-modification ((operation functional-put-function) container (structure functional-rrb-vector) location &rest rest &key value &allow-other-keys)
Source

api.lisp.

Method: position-modification ((operation put!-function) container (structure mutable-rrb-vector) location &rest rest &key value &allow-other-keys)
Source

api.lisp.

Method: position-modification ((operation grow-function) (structure mutable-rrb-vector) container index &rest rest &key value &allow-other-keys)
Source

api.lisp.

Method: position-modification ((operation take-out!-function) container (structure mutable-rrb-vector) location &rest rest &key &allow-other-keys)
Source

api.lisp.

Method: position-modification ((operation take-out!-function) container (structure transactional-rrb-vector) location &rest rest &key &allow-other-keys)
Source

api.lisp.

Method: position-modification ((function take-out-back!-function) container (structure mutable-sequence) location &key value)
Source

common.lisp.

Method: position-modification ((function functional-take-out-back-function) container (structure functional-sequence) location &key value)
Source

common.lisp.

Method: position-modification ((function functional-put-back-function) container (structure functional-sequence) location &key value)
Source

common.lisp.

Method: position-modification ((function put-back!-function) container (structure mutable-sequence) location &key value)
Source

common.lisp.

Method: position-modification ((operation shrink-function) container (structure functional-sparse-rrb-vector) position &rest all)
Source

api.lisp.

Method: position-modification ((operation shrink-function) container (structure transactional-sparse-rrb-vector) position &rest all)
Source

api.lisp.

Method: position-modification ((operation shrink-function) container (structure mutable-sparse-rrb-vector) position &rest all)
Source

api.lisp.

Method: position-modification ((operation grow-function) container (structure functional-sparse-rrb-vector) position &rest all &key value)
Source

api.lisp.

Method: position-modification ((operation grow-function) container (structure mutable-sparse-rrb-vector) position &rest all &key value)
Source

api.lisp.

Method: position-modification ((operation grow-function) container (structure transactional-sparse-rrb-vector) position &rest all &key value)
Source

api.lisp.

Method: position-modification ((operation grow-function) container (structure mutable-hamt-dictionary) location &rest all &key value)
Source

api.lisp.

Method: position-modification ((operation shrink-function) container (structure mutable-hamt-dictionary) location &rest all &key)
Source

api.lisp.

Method: position-modification ((operation shrink-function) container (structure transactional-hamt-dictionary) location &rest all &key)
Source

api.lisp.

Method: position-modification ((operation shrink-function) container (structure functional-hamt-dictionary) location &rest all &key)
Source

api.lisp.

Method: position-modification ((operation grow-function) container (structure transactional-hamt-dictionary) location &rest all &key value)
Source

api.lisp.

Method: position-modification ((operation grow-function) container (structure functional-hamt-dictionary) location &rest all &key value)
Source

api.lisp.

Method: position-modification ((function shrink-function) container (structure mutable-skip-list-dictionary) location &rest all)
Source

api.lisp.

Method: position-modification ((operation grow-function) container (structure mutable-skip-list-dictionary) location &rest all &key value)
Source

api.lisp.

Method: position-modification ((operation grow-function) container (structure mutable-egnat-container) location &rest all)
Source

methods.lisp.

Method: position-modification ((function erase*!-function) container (structure fundamental-skip-list) (location fundamental-skip-list-range) &rest all)
Source

common.lisp.

Method: position-modification ((function erase!-function) container (structure fundamental-skip-list) location &rest all)
Source

common.lisp.

Method: position-modification (operation container (structure lazy-box-container) location &rest args &key &allow-other-keys)
Source

lazy-box.lisp.

Generic Function: put (container item)

Arguments:
–CONTAINER, A subclass of fundamental-container
–ITEM, Object that should be added into CONTAINER

Description:
Functional API. Inserts new the ITEM into a new version of the CONTAINER. Relevant to sets and sequences.

Returns:
Modified container.

Notes:
This is the functional counterpart to the PUT! function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: put ((container fundamental-functional-queue) item)
Source

common.lisp.

Method: put ((container functional-sequence) item)
Source

common.lisp.

Generic Function: put! (container item)

Arguments:
–CONTAINER, A subclass of fundamental-container
–ITEM, Object that should be added into CONTAINER

Description:
Destructive API. Inserts new the ITEM into the CONTAINER. Relevant to sets and sequences.

Returns:
CONTAINER

Notes:
This is the destructive counterpart to the PUT function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: put! ((container mutable-metric-space-set) item)
Source

api.lisp.

Method: put! ((container mutable-set) item)
Source

common.lisp.

Method: put! ((container fundamental-transactional-queue) item)
Source

common.lisp.

Method: put! ((container fundamental-mutable-queue) item)
Source

common.lisp.

Method: put! ((container mutable-sequence) item)
Source

common.lisp.

Generic Function: put-back (container item)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: put-back ((container functional-sequence) item)
Source

common.lisp.

Generic Function: put-back! (container item)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: put-back! ((container mutable-sequence) item)
Source

common.lisp.

Generic Function: put-front (container item)
Package

cl-data-structures.

Source

generics.lisp.

Generic Function: put-front! (container item)
Package

cl-data-structures.

Source

generics.lisp.

Generic Function: rate (range test &key key positive total after)
Package

cl-data-structures.algorithms.

Source

rate.lisp.

Methods
Method: rate (range test &key key positive total after)
Generic Reader: read-arguments (object)
Package

cl-data-structures.

Methods
Reader Method: read-arguments ((field field))

automatically generated reader method

Source

field.lisp.

Target Slot

%arguments.

Reader Method: read-arguments ((expression expression))

automatically generated reader method

Source

expression-wrapper.lisp.

Target Slot

%arguments.

Generic Reader: read-bounds (condition)
Package

cl-data-structures.

Methods
Reader Method: read-bounds ((condition out-of-bounds))
Source

conditions.lisp.

Target Slot

%bounds.

Generic Reader: read-class (condition)
Package

cl-data-structures.

Methods
Reader Method: read-class ((condition initialization-error))
Source

conditions.lisp.

Target Slot

%class.

Generic Reader: read-element-type (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: read-element-type ((rrb-container rrb-container))

automatically generated reader method

Source

common.lisp.

Target Slot

%element-type.

Generic Reader: read-element-type (object)
Package

cl-data-structures.dicts.srrb.

Methods
Reader Method: read-element-type ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated reader method

Source

types.lisp.

Target Slot

%element-type.

Generic Reader: read-equal-fn (object)
Package

cl-data-structures.dicts.

Methods
Reader Method: read-equal-fn ((fundamental-hashing-dictionary fundamental-hashing-dictionary))

automatically generated reader method

Source

trait-classes.lisp.

Target Slot

%equal-fn.

Generic Reader: read-found (object)
Package

cl-data-structures.common.

Methods
Reader Method: read-found ((implementation-modification-operation-status implementation-modification-operation-status))

automatically generated reader method

Source

modification-operation-status.lisp.

Target Slot

%found.

Generic Reader: read-function (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-function ((zipping-mixin zipping-mixin))

automatically generated reader method

Source

zip.lisp.

Target Slot

%function.

Reader Method: read-function ((cumulative-state cumulative-state))

automatically generated reader method

Source

cumulative-accumulate.lisp.

Target Slot

%function.

Reader Method: read-function ((forward-cartesian-range forward-cartesian-range))

automatically generated reader method

Source

cartesian.lisp.

Target Slot

%function.

Reader Method: read-function ((multiplex-proxy multiplex-proxy))

automatically generated reader method

Source

multiplex.lisp.

Target Slot

%function.

Generic Reader: read-functor-constructor (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-functor-constructor ((proxy-box-range proxy-box-range))

automatically generated reader method

Source

on-each.lisp.

Target Slot

%functor-constructor.

Generic Reader: read-functor-prototype (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-functor-prototype ((proxy-box-range proxy-box-range))

automatically generated reader method

Source

on-each.lisp.

Target Slot

%functor-prototype.

Generic Reader: read-hash-fn (object)
Package

cl-data-structures.dicts.

Methods
Reader Method: read-hash-fn ((fundamental-hashing-dictionary fundamental-hashing-dictionary))

automatically generated reader method

Source

trait-classes.lisp.

Target Slot

%hash-fn.

Generic Reader: read-hash-table (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-hash-table ((hash-table-range hash-table-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%hash-table.

Generic Reader: read-key (object)
Package

cl-data-structures.algorithms.meta.

Methods
Reader Method: read-key ((with-previous-element-proxy with-previous-element-proxy))

automatically generated reader method

Source

with-previous-element.lisp.

Target Slot

%key.

Reader Method: read-key ((distinct-proxy distinct-proxy))

automatically generated reader method

Source

distinct.lisp.

Target Slot

%key.

Reader Method: read-key ((abstract-partition-if-proxy abstract-partition-if-proxy))

automatically generated reader method

Source

partition-if.lisp.

Target Slot

%key.

Reader Method: read-key ((flatten-proxy flatten-proxy))

automatically generated reader method

Source

flatten-lists.lisp.

Target Slot

%key.

Reader Method: read-key ((establish-special-proxy establish-special-proxy))

automatically generated reader method

Source

establish-special.lisp.

Target Slot

%key.

Reader Method: read-key ((multiplex-proxy multiplex-proxy))

automatically generated reader method

Source

multiplex.lisp.

Target Slot

%key.

Reader Method: read-key ((group-by-proxy group-by-proxy))

automatically generated reader method

Source

group-by.lisp.

Target Slot

%key.

Reader Method: read-key ((filtering-proxy filtering-proxy))

automatically generated reader method

Source

filtering.lisp.

Target Slot

%key.

Reader Method: read-key ((proxy-box-range proxy-box-range))

automatically generated reader method

Source

on-each.lisp.

Target Slot

%key.

Generic Reader: read-keys (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-keys ((hash-table-range hash-table-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%keys.

Generic Reader: read-margin (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: read-margin ((egnat-range-around egnat-range-around))

automatically generated reader method

Source

classes.lisp.

Target Slot

%margin.

Generic Reader: read-near (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: read-near ((egnat-range-around egnat-range-around))

automatically generated reader method

Source

classes.lisp.

Target Slot

%near.

Generic Reader: read-ordering-function (object)
Package

cl-data-structures.common.skip-list.

Methods
Reader Method: read-ordering-function ((fundamental-skip-list fundamental-skip-list))

automatically generated reader method

Source

common.lisp.

Target Slot

%ordering-function.

Generic Reader: read-original-range (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-original-range ((proxy-range proxy-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%original-range.

Generic Reader: read-ownership-tag (object)
Package

cl-data-structures.common.abstract.

Methods
Reader Method: read-ownership-tag ((tagged-node tagged-node))

automatically generated reader method

Source

common.lisp.

Target Slot

%ownership-tag.

Reader Method: read-ownership-tag ((fundamental-ownership-tagged-object fundamental-ownership-tagged-object))

automatically generated reader method

Source

common.lisp.

Target Slot

%ownership-tag.

Generic Reader: read-path (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: read-path ((fundamental-file-range-stack-cell fundamental-file-range-stack-cell))

automatically generated reader method

Source

find.lisp.

Target Slot

%path.

Reader Method: read-path ((tokenizing-range tokenizing-range))

automatically generated reader method

Source

tokenize.lisp.

Target Slot

%path.

Reader Method: read-path ((file-range-mixin file-range-mixin))

automatically generated reader method

Source

common.lisp.

Target Slot

%path.

Generic Reader: read-pointers (object)
Package

cl-data-structures.common.skip-list.

Methods
Reader Method: read-pointers ((fundamental-skip-list fundamental-skip-list))

automatically generated reader method

Source

common.lisp.

Target Slot

%pointers.

Generic Reader: read-size (object)
Package

cl-data-structures.utils.

Methods
Reader Method: read-size ((half-matrix half-matrix))

automatically generated reader method

Source

distances.lisp.

Target Slot

%size.

Generic Reader: read-store-value (object)
Package

cl-data-structures.common.

Methods
Reader Method: read-store-value ((assignable-forward-tree-range assignable-forward-tree-range))

automatically generated reader method

Source

ranges.lisp.

Target Slot

%store-value.

Generic Reader: read-value (object)
Package

cl-data-structures.common.

Methods
Reader Method: read-value ((implementation-modification-operation-status implementation-modification-operation-status))

automatically generated reader method

Source

modification-operation-status.lisp.

Target Slot

%value.

Generic Reader: read-value (condition)
Package

cl-data-structures.

Methods
Reader Method: read-value ((condition invalid-value))
Source

conditions.lisp.

Target Slot

%value.

Generic Function: replica (container &optional isolate)

Syntax:
replica transactioanl-container-container boolean => transactional-container

Arguments:
–CONTAINER, Container that will be replicated.
–ISOLATE, Should changes in the CONTAINER be prevented from leaking into result instances

Description:
Creates a new instance of transactional container from the existing transactional CONTAINER. Therefore: behaves like BECOME-TRANSACTIONAL, but is implemented only for the transactional containers. Furthermore: when ISOLATE is true, prevents side effects from the original CONTAINER to leak into the new container.

Returns:
instance implementing mutable API. Content of returned instance is identical to the content of the input CONTAINER.

Side Effects:
May very, depending on the type of the CONTAINER.

See also:
–BECOME-TRANSACTIONAL

Notes:
–(replica container t) can be understood as a creation of two new transactional instances and discarding the original CONTAINER.
–Because of the above, total cost of creating isolated replica and mutating both the original and the replica can eventually outgrow cost of simply creating the clone.
–It is adviced to use replica for the sake explicitly when working with transactional instances.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: replica ((container transactional-2-3-queue) &optional isolate)
Source

api.lisp.

Method: replica ((container transactional-rrb-vector) &optional isolate)
Source

api.lisp.

Method: replica ((container transactional-sparse-rrb-vector) &optional isolate)
Source

api.lisp.

Method: replica ((container hamt-dictionary) &optional isolate)
Source

api.lisp.

Generic Function: reservoir-sample (range sample-size &key key after)

Description:
Draws sample in the form of the vector from the range.

Returns:
VECTOR of the size equal to the SAMPLE-SIZE and with the fill pointer up to the sample-size.

Exceptional situations:
–Will signal TYPE-ERROR if SAMPLE-SIZE is not of the type POSITIVE-FIXNUM.

Notes:
This function implements the L algorithm.

Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Methods
Method: reservoir-sample (range sample-size &key key after)
Generic Function: reset! (obj)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: reset! ((range moving-average-range))
Source

moving-average.lisp.

Method: reset! ((range find-range))
Source

find.lisp.

Method: reset! ((range line-by-line-range))
Source

line-by-line.lisp.

Method: reset! ((range file-range-mixin))
Source

common.lisp.

Method: reset! ((range abstract-sliding-window-proxy))
Source

sliding-window.lisp.

Method: reset! ((range distinct-proxy))
Source

distinct.lisp.

Method: reset! ((range forward-partition-if-proxy))
Source

partition-if.lisp.

Method: reset! ((range flatten-proxy))
Source

flatten-lists.lisp.

Method: reset! ((range forward-connecting-range))
Source

zip.lisp.

Method: reset! ((range forward-chain-of-ranges))
Source

chain.lisp.

Method: reset! ((range cumulative-accumulate-range))
Source

cumulative-accumulate.lisp.

Method: reset! ((range latch-proxy))
Source

latch.lisp.

Method: reset! ((range repeat-proxy))
Source

repeat.lisp.

Method: reset! ((range restrain-size-proxy))
Source

restrain-size.lisp.

Method: reset! ((range forward-cartesian-range))
Source

cartesian.lisp.

Method: reset! ((range only-different-proxy))
Source

only-different.lisp.

Method: reset! ((range multiplex-proxy))
Source

multiplex.lisp.

Method: reset! ((object shuffled-range))
Source

shuffled-range.lisp.

Method: reset! ((range proxy-box-range))
Source

on-each.lisp.

Method: reset! ((range hash-table-range))
Source

common.lisp.

Method: reset! ((range proxy-range))
Source

common.lisp.

Method: reset! ((range qp-trie-set-range))
Source

api.lisp.

Method: reset! ((object mutable-qp-trie-set))
Source

api.lisp.

Method: reset! ((container fixed-capacity-synchronization-mixin))
Source

api.lisp.

Method: reset! ((container synchronization-mixin))
Source

api.lisp.

Method: reset! ((range 2-3-queue-range))
Source

api.lisp.

Method: reset! ((queue transactional-2-3-queue))
Source

api.lisp.

Method: reset! ((queue mutable-2-3-queue))
Source

api.lisp.

Method: reset! ((obj transactional-rrb-vector))
Source

api.lisp.

Method: reset! ((obj mutable-rrb-vector))
Source

api.lisp.

Method: reset! ((vector transactional-sparse-rrb-vector))
Source

api.lisp.

Method: reset! ((vector mutable-sparse-rrb-vector))
Source

api.lisp.

Method: reset! ((obj mutable-hamt-dictionary))
Source

api.lisp.

Method: reset! ((range egnat-range))
Source

methods.lisp.

Method: reset! ((container fundamental-skip-list))
Source

common.lisp.

Method: reset! ((object fundamental-skip-list-range))
Source

common.lisp.

Method: reset! ((instance rrb-range))
Source

common.lisp.

Method: reset! ((instance sequence-window))
Source

sequence-window.lisp.

Method: reset! ((range forward-tree-range))
Source

ranges.lisp.

Method: reset! ((container lazy-box-container))
Source

lazy-box.lisp.

Method: reset! ((obj list-range))
Source

list.lisp.

Method: reset! ((range vector-range))
Source

vector.lisp.

Method: reset! ((range empty-range))
Source

auxilary.lisp.

Method: reset! ((obj expression))
Source

expression-wrapper.lisp.

Generic Function: restrain-size (range size)

Arguments:
–RANGE, Input range used to construct the result.
–SIZE, What should be the limit on the new range?

Description:
A layer function. Constructs new range from the RANGE. New range contains a limit on how many times consume-front can be called on it before returning (values nil nil), effectively reducing size of the RANGE.

Returns:
FUNDAMENTAL-FORWARD-RANGE instance.

Exceptional situations:
–Will raise a TYPE-ERROR when the SIZE is not of the type INTEGER.
–Will raise ARGUMENT-VALUE-OUT-OF-BOUNDS when the SIZE is negative.

Package

cl-data-structures.algorithms.

Source

restrain-size.lisp.

Methods
Method: restrain-size (range size)
Generic Function: select-children (range node)
Package

cl-data-structures.common.egnat.

Source

generics.lisp.

Methods
Method: select-children ((range egnat-range) (node egnat-subtree))
Method: select-children ((range egnat-range-around) (node egnat-subtree))
Generic Function: sequence-window (sequence from to)

Arguments:
–SEQUENCE, Object with content.
–FROM, Lower bound of resulting window.
–TO, Upper bound of resulting window.

Description:
Creates sequence window out of sequence or other sequence-window.

Returns:
Sequence-window object.

Package

cl-data-structures.common.

Source

sequence-window.lisp.

Methods
Method: sequence-window ((sequence list) from to)
Method: sequence-window ((sequence vector) from to)
Method: sequence-window ((sequence sequence-window) from to)
Method: sequence-window :before ((sequence sequence) from to)
Method: sequence-window ((sequence fundamental-random-access-range) from to)
Generic Function: should-skip (range element can-mutate)
Package

cl-data-structures.algorithms.

Source

filtering.lisp.

Methods
Method: should-skip ((range only-different-proxy) element can-mutate)
Source

only-different.lisp.

Method: should-skip ((range only-proxy) element can-mutate)
Source

only.lisp.

Method: should-skip ((range without-proxy) element can-mutate)
Source

without.lisp.

Generic Function: simple-linear-regression (range x-key average-x y-key average-y &key key)

Arguments:
–X-KEY, Function used to extract argument from range.
–Y-KEY, Function used to extract result from range.

Description:
Matches linear function to RANGE using least squares method.

Returns:
Function object. Call with argument to obtain expected result. Pass to beta0 function to obtain beta0 value. Pass to beta1 to obtain beta1 value.

Package

cl-data-structures.math.

Source

simple-linear-regression.lisp.

Methods
Method: simple-linear-regression (range x-key average-x y-key average-y &key key)
Generic Function: size (container)

Syntax:
size container => count

Arguments:
–container, instance that will be checked.

Examples:
(let ((container (cl-ds.dicts.hamt:make-mutable-hamt-dictionary #’sxhash #’eq))) (prove:is (cl-ds:size container) 0)
(setf (cl-ds:at container ’a) 1)
(prove:is (cl-ds:size container) 1))

Description:
How many elements the CONTAINER holds currently?

Returns:
The number of elements in the container.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: size ((range random-access-connecting-range))
Source

zip.lisp.

Method: size ((range random-access-chain-of-ranges))
Source

chain.lisp.

Method: size ((range hash-table-range))
Source

common.lisp.

Method: size ((set fundamental-qp-trie-set))
Source

api.lisp.

Method: size ((container synchronization-primitives-mixin))
Source

api.lisp.

Reader Method: size ((fundamental-queue fundamental-queue))

automatically generated reader method

Source

common.lisp.

Target Slot

%size.

Method: size ((vect fundamental-sparse-rrb-vector))
Source

api.lisp.

Method: size ((container hamt-dictionary))
Source

api.lisp.

Reader Method: size ((fundamental-egnat-container fundamental-egnat-container))

automatically generated reader method

Source

classes.lisp.

Target Slot

%size.

Method: size ((container fundamental-skip-list))
Source

common.lisp.

Method: size ((obj rrb-range))
Source

common.lisp.

Method: size ((container rrb-container))
Source

common.lisp.

Method: size ((range sequence-window))
Source

sequence-window.lisp.

Method: size ((range lazy-random-access-range))
Source

lazy-range.lisp.

Method: size :before ((range lazy-random-access-range))
Source

lazy-range.lisp.

Method: size ((container lazy-box-container))
Source

lazy-box.lisp.

Method: size ((seq list))
Source

list.lisp.

Method: size ((container vector))
Source

vector.lisp.

Method: size ((range vector-range))
Source

vector.lisp.

Generic Function: skip-list-node-clone (node)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Methods
Method: skip-list-node-clone ((skip-list-node skip-list-node))
Method: skip-list-node-clone ((skip-list-node (eql nil)))
Generic Function: sliding-window (range batch-size)

Arguments:
–RANGE, Input range.
–WINDOW-SIZE, Size of the sliding window.

Examples:
(progn
(prove:is (cl-ds.alg:to-list (cl-ds.alg:sliding-window ’(1 2 3) 3))
’((1 2 3))
:test ’equal)
(prove:is (cl-ds.alg:to-list (cl-ds.alg:sliding-window ’(1 2 3 4) 3))
’((1 2 3) (2 3 4))
:test ’equal))

Description:
Groups RANE elementwise using sliding window of the the size WINDOW-SIZE.

Exceptional situations:
–Will signal a TYPE-ERROR if WINDOW-SIZE is not of the type POSITIVE-INTEGER.

Notes:
–Windows are always of the length of WINDOW-SIZE. If there is not enough elements to form window, range will act as it would be empty.

Package

cl-data-structures.algorithms.

Source

sliding-window.lisp.

Methods
Method: sliding-window (range window-size)
Generic Function: standard-deviation (range around &key key after)
Package

cl-data-structures.math.

Source

standard-deviation.lisp.

Methods
Method: standard-deviation (range around &key key after)
Generic Function: start-execution (pipe)
Package

cl-data-structures.utils.

Source

parallel-tools.lisp.

Methods
Method: start-execution ((pipe pipe-fragment))
Generic Function: state-result (function state)

Arguments:
–FUNCTION, Instance of aggregation-function.
–STATE, Object returned by make-state function

Description:
Extracts result of aggregation function out of state argument.

Affected by
Class of function.

See also:
–AGGREGATION-FUNCTION
–AGGREGATE
–MAKE-STATE

Notes:
Specialization for this generic function is required for each aggregation-function.

Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Methods
Method: state-result ((function aggregation-function) state)
Generic Function: stream-designator-p (designator)
Package

cl-data-structures.file-system.

Source

common.lisp.

Methods
Method: stream-designator-p ((designator command))
Source

unix.lisp.

Method: stream-designator-p ((designator string))
Method: stream-designator-p ((designator pathname))
Generic Function: take-out (container)

Arguments:
–CONTAINER, Container that is about to be modified.

Description:
Functional API. Removes one element from the CONTAINER. Relevant to sequences.

Returns:
–New version of the container, without one element.
–Modification status.

Notes:
This is the functional counterpart to the TAKE-OUT! function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: take-out ((container fundamental-functional-queue))
Source

common.lisp.

Method: take-out ((container functional-sequence))
Source

common.lisp.

Generic Function: take-out! (container)

Arguments:
–CONTAINER, Container that is about to be modified

Description:
Destructive API: removes one element from the CONTAINER. Relevant to sequences.

Returns:
–CONTAINER
–Modification status.

Notes:
This is the destructive counterpart to the TAKE-OUT function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: take-out! ((container fundamental-functional-queue))
Source

common.lisp.

Method: take-out! ((container fundamental-transactional-queue))
Source

common.lisp.

Method: take-out! ((container fundamental-mutable-queue))
Source

common.lisp.

Method: take-out! ((container mutable-sequence))
Source

common.lisp.

Generic Function: take-out-back (container)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: take-out-back ((container functional-sequence))
Source

common.lisp.

Generic Function: take-out-back! (container)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: take-out-back! ((container mutable-sequence))
Source

common.lisp.

Generic Function: take-out-front (container)
Package

cl-data-structures.

Source

generics.lisp.

Generic Function: take-out-front! (container)
Package

cl-data-structures.

Source

generics.lisp.

Generic Function: thread-buffer (range &key maximum-queue-size chunk-size)

Description:
Creates a proxy range that will present exactly the same content as the original range. However, when calling an aggregation function internal thread with queue will created. This allows operations performed before and after thread-buffer to run in parallel.

Returns:
Instance of BUFFER-RANGE subclass. Depending on the class of the RANGE it may be a FORWARD-BUFFER-RANGE, BIDIRECTIONAL-BUFFER-RANGE or RANDOM-ACCESS-BUFFER-RANGE.

Exceptional situations:
–Will raise a TYPE-ERROR when MAXIMAL-QUEUE-SIZE is not integer.
–Will raise a TYPE-ERROR when CHUNK-SIZE is not integer.
–Will raise CL-DS:ARGUMENT-VALUE-OUT-OF-BOUNDS when CHUNK-SIZE is not at least 1.
–Will raise CL-DS:ARGUMENT-VALUE-OUT-OF-BOUNDS when MAXIMAL-QUEUE-SIZE is not at least 16.
–Exceptions raised during aggregation will be transfered to the original thread.

Notes:
–Thread buffer only changes the aggregation process.
–For optimal performance results, operations performed before and after THREAD-BUFFER should take approximately the same ammount of time.
–Unlike PARALLEL-ON-EACH or PARALLEL-MULTIPLEX, THREAD-BUFFER does not use lparallel workers.
–Because of the above, be cautious when using THREAD-BUFFER in conjuction with GROUP-BY.

Package

cl-data-structures.threads.

Source

buffer-range.lisp.

Methods
Method: thread-buffer (range &key maximum-queue-size chunk-size)
Generic Function: to-hash-table (range &key key test size hash-table-key hash-table-value after)

Arguments:
–KEY, Key function used to extract value to the result vector.
–TEST, Test fo the MAKE-HASH-TABLE.
–SIZE, Size for the MAKE-HASH-TABLE.
–TABLE, Optional, initial HASH-TABLE.
–HASH-TABLE-KEY, Function used to extract key for the HASH-TABLE. Defaults to IDENTITY. –HASH-TABLE-VALUE, Function used to extract value for the HASH-TABLE. Defaults to IDENTITY.

Description:
Collects all elements into a CL:HASH-TABLE.

Returns:
CL:HASH-TABLE with the content of the RANGE.

Exceptional situations:
–Will signal a TYPE-ERROR if either KEY, HASH-TABLE-VALUE, HASH-TABLE-KEY is not funcallable. –Will signal a TYPE-ERROR if TABLE is not of type CL:HASH-TABLE.
–Will signal conditions just like MAKE-HASH-TABLE would if either SIZE or TEST is invalid.

Package

cl-data-structures.algorithms.

Source

to-hash-table.lisp.

Methods
Method: to-hash-table (range &key test key hash-table-key hash-table-value after size)
Generic Function: to-list (range &key key after)

Description:
Collects all elements into a CL:LIST.

Returns:
CL:LIST with the content of the RANGE.

Exceptional situations:
–Will signal a TYPE-ERROR if KEY is not funcallable.

Package

cl-data-structures.algorithms.

Source

to-list.lisp.

Methods
Method: to-list (range &key key after)
Generic Function: to-vector (range &key key element-type size after)

Arguments:
–RANGE, Object to aggregate.
–KEY, Key function used to extract value to the result vector.
–ELEMENT-TYPE, :ELEMENT-TYPE for the result vector.
–SIZE, Initial size of the internal vector. Supplie to minimize memory allocations count.
–FORCE-COPY, When false, TO-VECTOR called with CL:VECTOR is allowed to return the input.

Description:
Collects all elements into a CL:VECTOR.

Returns:
CL:VECTOR with the content of the RANGE.

Exceptional situations:
–Will signal a TYPE-ERROR if KEY is not funcallable.
–Will signal same conditions as make-array would when ELEMENT-TYPE or SIZE are invalid.

Notes:
–There is no way to know ahead of time how large vector will be created, and therefore multiple reallocations may be performed during aggregation. A user can supply :SIZE to mitigate that. –To avoid copying in the case when RANGE is also a vector, pass NIL as :FORCE-COPY.

Package

cl-data-structures.algorithms.

Source

to-vector.lisp.

Methods
Method: to-vector (range &key key element-type after size)
Generic Function: transactionalp (container)

Syntax:
transactionalp container => boolean

Arguments:
–container, An subclass of the fundamental-container.

Examples:
(let ((container (cl-ds:become-transactional (cl-ds.dicts.hamt:make-mutable-hamt-dictionary #’sxhash #’eq)))) (prove:ok (cl-ds:mutablep container))
(prove:ok (cl-ds:transactionalp container)))

Returns:
T if the CONTAINER is transactional and NIL if it is not.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: transactionalp ((container transactional))
Method: transactionalp ((container fundamental-container))
Generic Function: translation (range dict &key key)

Description:
Substitutes element in the range with one found in the DICT, if present. If not, leaves element unchanged.

Returns:
ON-EACH-RANGE subclass.

Exceptional situations:
–Will signal a TYPE-ERROR if KEY is not funcallable.

Package

cl-data-structures.algorithms.

Source

translation.lisp.

Methods
Method: translation (range dict &key key)
Generic Function: traverse (object function)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: traverse ((range moving-average-range) function)
Source

moving-average.lisp.

Method: traverse ((range tokenizing-range) function)
Source

tokenize.lisp.

Method: traverse ((range line-by-line-range) function)
Source

line-by-line.lisp.

Method: traverse ((range abstract-sliding-window-proxy) function)
Source

sliding-window.lisp.

Method: traverse ((range distinct-proxy) function)
Source

distinct.lisp.

Method: traverse ((range forward-partition-if-proxy) function)
Source

partition-if.lisp.

Method: traverse ((range flatten-proxy) function)
Source

flatten-lists.lisp.

Method: traverse ((range forward-chain-of-ranges) function)
Source

chain.lisp.

Method: traverse ((range cumulative-accumulate-range) function)
Source

cumulative-accumulate.lisp.

Method: traverse ((range forward-establish-special-proxy-range) function)
Source

establish-special.lisp.

Method: traverse ((range latch-proxy) function)
Source

latch.lisp.

Method: traverse ((range repeat-proxy) function)
Source

repeat.lisp.

Method: traverse ((range restrain-size-proxy) function)
Source

restrain-size.lisp.

Method: traverse ((range multiplex-proxy) function)
Source

multiplex.lisp.

Method: traverse ((range filtering-proxy) function)
Source

filtering.lisp.

Method: traverse ((range forward-proxy-box-range) function)
Source

on-each.lisp.

Method: traverse ((range hash-table-range) function)
Source

common.lisp.

Method: traverse ((range proxy-range) function)
Source

common.lisp.

Method: traverse ((range mutable-skip-list-set-range) function)
Source

api.lisp.

Method: traverse ((object qp-trie-set-range) function)
Source

api.lisp.

Method: traverse ((container synchronization-primitives-mixin) function)
Source

api.lisp.

Method: traverse ((container 2-3-queue) function)
Source

api.lisp.

Method: traverse ((vector fundamental-sparse-rrb-vector) function)
Source

api.lisp.

Method: traverse ((range mutable-skip-list-dictionary-range) function)
Source

api.lisp.

Method: traverse ((container fundamental-egnat-container) function)
Source

methods.lisp.

Method: traverse ((range egnat-range) function)
Source

methods.lisp.

Method: traverse ((object fundamental-skip-list) function)
Source

common.lisp.

Method: traverse ((object fundamental-skip-list-range) function)
Source

common.lisp.

Method: traverse ((range rrb-range) function)
Source

common.lisp.

Method: traverse ((object rrb-container) function)
Source

common.lisp.

Method: traverse ((container sequence-window) function)
Source

sequence-window.lisp.

Method: traverse ((range forward-tree-range) function)
Source

ranges.lisp.

Method: traverse ((range lazy-forward-range) function)
Source

lazy-range.lisp.

Method: traverse :before ((range lazy-range) function)
Source

lazy-range.lisp.

Method: traverse ((obj list-range) function)
Source

list.lisp.

Method: traverse ((range vector-range) function)
Source

vector.lisp.

Method: traverse ((range empty-range) function)
Source

auxilary.lisp.

Method: traverse ((obj expression) function)
Source

expression-wrapper.lisp.

Method: traverse ((range chunked-range) function)
Method: traverse ((object sequence) function)
Method: traverse ((object fundamental-range) function)
Generic Function: type-specialization (container)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Reader Method: type-specialization ((2-3-queue 2-3-queue))

automatically generated reader method

Source

api.lisp.

Target Slot

%element-type.

Reader Method: type-specialization ((fundamental-sparse-rrb-vector fundamental-sparse-rrb-vector))

automatically generated reader method

Source

types.lisp.

Target Slot

%element-type.

Reader Method: type-specialization ((rrb-container rrb-container))

automatically generated reader method

Source

common.lisp.

Target Slot

%element-type.

Method: type-specialization ((container fundamental-container))
Generic Function: union (first-sketch &rest more-sketches)

Description:
Creates new data-sketch from the provided. Can be used to join sketches built on different data chunks.

Package

cl-data-structures.streaming-algorithms.

Source

common.lisp.

Methods
Method: union ((first bloom-filter) &rest more)
Source

bloom-filter.lisp.

Method: union ((first approximated-counts) &rest more)
Source

approximated-counts.lisp.

Method: union ((first approximated-set-cardinality) &rest more)
Source

approximated-set-cardinality.lisp.

Method: union ((first-sketch approximated-histogram) &rest more-sketches)
Source

approximated-histogram.lisp.

Method: union :around ((sketch fundamental-data-sketch) &rest more-sketches)
Generic Function: update (container location new-value)

Syntax:
update container location new-value => new-instance status

Arguments:
–container, The instance that shall be transformed.
–location, The location in the container that we want to transform.

Description:
Functional API: if there is value at LOCATION in the CONTAINER return new instance with NEW-VALUE at LOCATION.

Returns:
–New container, with updated value at LOCATION if UPDATE took place
–Modification status object

Notes:
This is the functional counterpart to the UPDATE! function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: update ((container functional-sequence) location new-value)
Source

common.lisp.

Method: update ((container functional-dictionary) location new-value)
Source

api.lisp.

Method: update ((container functional-sparse-vector) location new-value)
Source

api.lisp.

Generic Function: update! (container location new-value)

Syntax:
(update! container location new-value) => same-container status

Arguments:
–container, Container that shall be modified.
–location, Location in the container that we want to transform.

Description:
Mutable API: If the LOCATION is taken in the CONTAINER, destructivly update it with the NEW-VALUE

Returns:
–CONTAINER
–Modification status object

Notes:
This is the destructive counterpart to the UPDATE function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: update! ((container mutable-dictionary) location new-value)
Source

api.lisp.

Method: update! ((container mutable-sparse-vector) location new-value)
Source

api.lisp.

Generic Function: update-if (container location new-value condition-fn)

Syntax:
update-if container location new-value CONDITION-FN => new-instance status

Arguments:
–CONTAINER, The instance that shall be transformed.
–LOCATION, The location in the container that we want to transform.
–CONDITION-FN, Function used to check if update should happen.

Description:
Functional API: if there is a value at the LOCATION in the CONTAINER and the supplied CONDITION-FN returns true when called with the value, return new instance with NEW-VALUE at the LOCATION. Otherwise returns the same CONTAINER.

Returns:
–A new container, with the updated value at the LOCATION if UPDATE took place.
–The modification status object

Notes:
This is the functional counterpart to the UPDATE-IF! function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: update-if ((container functional-sequence) location new-value condition-fn)
Source

common.lisp.

Method: update-if ((container functional-dictionary) location new-value condition-fn)
Source

api.lisp.

Method: update-if ((container functional-sparse-vector) location new-value condition-fn)
Source

api.lisp.

Generic Function: update-if! (container location new-value condition-fn)

Syntax:
update-if! container location new-value CONDITION-FN => container status

Arguments:
–CONTAINER, The instance that shall be transformed.
–LOCATION, The location in the container that we want to transform.
–CONDITION-FN, Function used to check if update should happen.

Description:
Mutable API: if there is a value at the LOCATION in the CONTAINER and the supplied CONDITION-FN returns true when called with the present value, set the LOCATION to the new value.

Returns:
–CONTAINER
–Modification status object

Notes:
This is the destructive counterpart to the UPDATE-IF function.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: update-if! ((container functional-sequence) location new-value condition-fn)
Source

common.lisp.

Method: update-if! ((container mutable-dictionary) location new-value condition-fn)
Source

api.lisp.

Method: update-if! ((container mutable-sparse-vector) location new-value condition-fn)
Source

api.lisp.

Generic Function: validate-field (function field)
Package

cl-data-structures.

Source

field.lisp.

Methods
Method: validate-field ((!fn377 harmonic-average-mutual-information-function) !field378)
Source

mutual-information.lisp.

Method: validate-field ((!fn256 mutual-information-matrix-function) !field257)
Source

mutual-information.lisp.

Method: validate-field ((!fn135 mutual-information-function) !field136)
Source

mutual-information.lisp.

Method: validate-field ((!fn0 optimal-split-point-function) !field1)
Source

mutual-information.lisp.

Method: validate-field :around (function field)
Generic Function: value (status)

Syntax:
value status => value

Arguments:
–STATUS, instance of modification status class.

Returns:
Value that was present in the container at the location before operation took place. Returns NIL if location was free.

Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: value ((state approximated-set-cardinality))
Source

approximated-set-cardinality.lisp.

Method: value ((status lazy-modification-operation-status))
Source

lazy-box.lisp.

Reader Method: value ((implementation-modification-operation-status implementation-modification-operation-status))

automatically generated reader method

Source

modification-operation-status.lisp.

Target Slot

%value.

Generic Function: variance (range around &key key biased)

Arguments:
–RANGE, Data to aggregate.
–KEY, Function used to extract values from elements. –BIASED, Boolean. Should result be biased?

Description:
Calculates variance.

Returns:
Number representing variance.

Notes:
Name conflict with alexandria:variance.

Package

cl-data-structures.math.

Source

variance.lisp.

Methods
Method: variance (range around &key key biased)
Generic Function: whole-range (container)
Package

cl-data-structures.

Source

generics.lisp.

Methods
Method: whole-range ((object mutable-skip-list-set))
Source

api.lisp.

Method: whole-range ((container fundamental-qp-trie-set))
Source

api.lisp.

Method: whole-range ((container synchronization-mixin))
Source

api.lisp.

Method: whole-range ((container 2-3-queue))
Source

api.lisp.

Method: whole-range ((container lazy-box-sequence))
Source

common.lisp.

Method: whole-range ((container fundamental-sparse-rrb-vector))
Source

api.lisp.

Method: whole-range ((container hamt-dictionary))
Source

api.lisp.

Method: whole-range ((object mutable-skip-list-dictionary))
Source

api.lisp.

Method: whole-range ((container lazy-box-dictionary))
Source

common.lisp.

Method: whole-range ((container fundamental-egnat-container))
Source

methods.lisp.

Method: whole-range ((container rrb-container))
Source

common.lisp.

Method: whole-range ((container hamt-container))
Source

common.lisp.

Method: whole-range ((container list))
Source

list.lisp.

Method: whole-range ((obj vector))
Source

vector.lisp.

Method: whole-range ((range fundamental-range))
Generic Function: with-previous-element (range &key key)
Package

cl-data-structures.algorithms.

Source

with-previous-element.lisp.

Methods
Method: with-previous-element (range &key key)
Generic Function: without (range predicate &key key)

Arguments:
–RANGE, Input range.
–PREDICATE, Test used to check if an element should be skipped.
–KEY, Key function used to extract a value for the predicate.

Description:
A layer function. Creates a range that skips elements that PREDICATE (KEY element) => T.

Returns:
Either forward, bidirectional or random-access range, depending on the RANGE.

Exceptional situations:
Will signal a TYPE-ERROR if either PREDICATE or KEY is not funcallable.

Package

cl-data-structures.algorithms.

Source

without.lisp.

Methods
Method: without (range predicate &key key)
Generic Function: wrap-chunk (range chunk)
Package

cl-data-structures.algorithms.

Source

common.lisp.

Methods
Method: wrap-chunk ((range forward-only-different-proxy) (chunk fundamental-forward-range))
Source

only-different.lisp.

Method: wrap-chunk ((range forward-only-proxy) (chunk fundamental-forward-range))
Source

only.lisp.

Method: wrap-chunk ((range without-proxy) (chunk fundamental-forward-range))
Source

without.lisp.

Method: wrap-chunk ((range forward-proxy-box-range) (chunk fundamental-forward-range))
Source

on-each.lisp.

Generic Writer: write-ownership-tag (new-value object)
Package

cl-data-structures.common.abstract.

Methods
Writer Method: write-ownership-tag ((new-value fundamental-ownership-tagged-object) fundamental-ownership-tagged-object)

automatically generated writer method

Source

common.lisp.

Target Slot

%ownership-tag.


6.1.7 Standalone methods

Method: initialize-instance :after ((object approximated-set-cardinality) &rest all)
Source

approximated-set-cardinality.lisp.

Method: initialize-instance :after ((sketch bloom-filter) &rest all)
Source

bloom-filter.lisp.

Method: initialize-instance :after ((sketch fundamental-data-sketch) &rest all)
Source

common.lisp.

Method: initialize-instance :after ((object approximated-counts) &rest all)
Source

approximated-counts.lisp.

Method: initialize-instance :after ((obj linear-regression-fit) &rest rest)
Source

simple-linear-regression.lisp.

Method: initialize-instance :after ((instance rrb-range) &key container &allow-other-keys)
Source

common.lisp.

Method: initialize-instance :after ((container rrb-container) &key &allow-other-keys)
Source

common.lisp.

Method: initialize-instance :after ((instance sequence-window) &key &allow-other-keys)
Source

sequence-window.lisp.

Method: initialize-instance :after ((container fundamental-egnat-container) &rest all)
Source

classes.lisp.

Method: initialize-instance :after ((instance egnat-node) &rest all)
Source

classes.lisp.

Method: initialize-instance :after ((obj pipe-fragment) &key queue-size &allow-other-keys)
Source

parallel-tools.lisp.

Method: initialize-instance ((obj future-carousel) &key &allow-other-keys)
Source

parallel-tools.lisp.

Method: initialize-instance :after ((range file-range-mixin) &rest all)
Source

common.lisp.

Method: initialize-instance :after ((range vector-range) &key &allow-other-keys)
Source

vector.lisp.

Method: initialize-instance :after ((obj expression) &rest all &key &allow-other-keys)
Source

expression-wrapper.lisp.

Method: initialize-instance :before ((instance parallel-group-by-proxy) &key test groups key &allow-other-keys)
Source

parallel-group-by.lisp.

Method: initialize-instance :after ((obj forward-chain-of-ranges) &key &allow-other-keys)
Source

chain.lisp.

Method: initialize-instance :after ((range forward-connecting-range) &key &allow-other-keys)
Source

zip.lisp.

Method: initialize-instance :before ((instance group-by-proxy) &key test groups key &allow-other-keys)
Source

group-by.lisp.

Method: make-instance :before ((range directory-file-range-stack-cell) &key path &allow-other-keys)
Source

find.lisp.

Method: make-instance :before ((range regex-file-file-range-stack-cell) &key path &allow-other-keys)
Source

find.lisp.

Method: make-instance :before ((range file-file-range-stack-cell) &key path predicate &allow-other-keys)
Source

find.lisp.

Method: make-instance :before ((range recursive-content-file-range-stack-cell) &key path &allow-other-keys)
Source

find.lisp.

Method: make-instance :before ((range regex-directory-file-range-stack-cell) &key path times &allow-other-keys)
Source

find.lisp.

Method: print-object ((object approximated-histogram) stream)
Source

approximated-histogram.lisp.

Method: print-object ((object command) stream)
Source

unix.lisp.

Method: print-object ((object skip-list-node) stream)
Source

common.lisp.

Method: print-object ((object assoc-skip-list-node) stream)
Source

common.lisp.

Method: print-object ((obj hash-table-range) stream)
Source

common.lisp.


6.1.8 Conditions

Condition: argument-error
Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses

textual-error.

Direct subclasses
Direct methods
Direct slots
Slot: %argument
Initargs

:parameter, :argument

Readers

read-argument.

Writers

This slot is read-only.

Condition: argument-value-not-in-allowed-set
Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses
Condition: argument-value-out-of-bounds

Description:
Error signaled when passed the argument exceeds allowed bounds

Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses
Direct subclasses

initialization-out-of-bounds.

Direct methods

print-condition.

Condition: dimensionality-error
Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses

out-of-bounds.

Direct subclasses

too-many-dimensions.

Direct methods

print-condition.

Condition: early-aggregation-exit
Package

cl-data-structures.algorithms.meta.

Source

classes.lisp.

Direct superclasses

condition.

Condition: empty-array-key
Package

cl-data-structures.sets.qp-trie.

Source

api.lisp.

Direct superclasses

invalid-value.

Direct Default Initargs
InitargValue
:format-controlempty array as key in the qp-trie-set.~%
Condition: empty-container
Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses

textual-error.

Condition: file-releated-error
Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses

textual-error.

Direct methods
Direct slots
Slot: %path
Initform

(quote nil)

Initargs

:path

Readers

path.

Writers

This slot is read-only.

Condition: incompatible-arguments
Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses
Condition: initialization-error

Description:
Error signaled when the container can’t be initialized.

Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses
Direct subclasses

initialization-out-of-bounds.

Direct methods
Direct slots
Slot: %class
Initargs

:class

Readers

read-class.

Writers

This slot is read-only.

Condition: initialization-out-of-bounds

Description:
Error signaled when the container can’t be initialized with a value because it exceeds bounds.

Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses
Condition: invalid-argument

Description:
Error signaled if (for whatever reason) passed argument is invalid.

Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses
Direct subclasses

unexpected-argument.

Condition: invalid-argument-value
Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses
Direct subclasses
Condition: invalid-value
Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses
Direct subclasses
Direct methods
Direct slots
Slot: %value
Initargs

:value

Readers

read-value.

Writers

This slot is read-only.

Condition: not-implemented

Description:
Error signaled when unimlemented functionality is accessed.

Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses

simple-error.

Condition: not-in-allowed-set
Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses

out-of-bounds.

Direct subclasses

argument-value-not-in-allowed-set.

Direct methods

print-condition.

Condition: operation-not-allowed
Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses
Condition: out-of-bounds

Description:
Error signaled when a some value is out of the expected bounds.

Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses

invalid-value.

Direct subclasses
Direct methods

read-bounds.

Direct slots
Slot: %bounds
Initargs

:bounds

Readers

read-bounds.

Writers

This slot is read-only.

Condition: textual-error

Description:
Error with a human readable text description.

Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses
  • chainable-condition.
  • simple-error.
Direct subclasses
Direct methods

print-condition.

Condition: too-many-dimensions
Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses

dimensionality-error.

Condition: unexpected-argument

Description:
Error signaled when passed argument was unexpected.

Package

cl-data-structures.

Source

conditions.lisp.

Direct superclasses

invalid-argument.

Direct methods

print-condition.


6.1.9 Structures

Structure: aggregator
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: pass
Type

(serapeum:-> (t) t)

Initform

(function identity)

Readers

aggregator-pass.

Writers

(setf aggregator-pass).

Slot: extract
Type

(serapeum:-> nil t)

Initform

(lambda nil nil)

Readers

aggregator-extract.

Writers

(setf aggregator-extract).

Slot: cleanup
Type

(serapeum:-> nil t)

Initform

(lambda nil nil)

Readers

aggregator-cleanup.

Writers

(setf aggregator-cleanup).

Structure: dict-content
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: location
Readers

dict-content-location.

Writers

(setf dict-content-location).

Slot: value
Readers

dict-content-value.

Writers

(setf dict-content-value).

Structure: skip-list-node
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Direct superclasses

structure-object.

Direct subclasses

assoc-skip-list-node.

Direct methods
Direct slots
Slot: pointers
Type

simple-vector

Initform

#()

Readers

skip-list-node-pointers.

Writers

(setf skip-list-node-pointers).

Slot: content
Readers

skip-list-node-content.

Writers

(setf skip-list-node-content).

Structure: sparse-rrb-node-tagged
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Direct superclasses

tagged-struct-node.

Direct slots
Slot: content
Type

(simple-array * (*))

Initform

#()

Readers

sparse-rrb-node-tagged-content.

Writers

(setf sparse-rrb-node-tagged-content).

Slot: bitmask
Type

cl-data-structures.common.rrb:sparse-rrb-mask

Initform

0

Readers

sparse-rrb-node-tagged-bitmask.

Writers

(setf sparse-rrb-node-tagged-bitmask).

Structure: sparse-rrb-node-untagged
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: content
Type

(simple-array * (*))

Initform

#()

Readers

sparse-rrb-node-untagged-content.

Writers

(setf sparse-rrb-node-untagged-content).

Slot: bitmask
Type

cl-data-structures.common.rrb:sparse-rrb-mask

Initform

0

Readers

sparse-rrb-node-untagged-bitmask.

Writers

(setf sparse-rrb-node-untagged-bitmask).

Structure: tagged-struct-node
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Direct superclasses

structure-object.

Direct subclasses
Direct slots
Slot: ownership-tag
Readers

tagged-struct-node-ownership-tag.

Writers

(setf tagged-struct-node-ownership-tag).


6.1.10 Classes

Class: 2-node
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Direct superclasses

node.

Direct subclasses

tagged-2-node.

Direct methods
Direct slots
Slot: %left
Initform

cl-data-structures.meta:null-bucket

Initargs

:left

Readers

access-left.

Writers

(setf access-left).

Slot: %right
Initform

cl-data-structures.meta:null-bucket

Initargs

:right

Readers

access-right.

Writers

(setf access-right).

Class: 3-node
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Direct superclasses

node.

Direct subclasses

tagged-3-node.

Direct methods
Direct slots
Slot: %left
Initform

cl-data-structures.meta:null-bucket

Initargs

:left

Readers

access-left.

Writers

(setf access-left).

Slot: %middle
Initform

cl-data-structures.meta:null-bucket

Initargs

:middle

Readers

access-middle.

Writers

(setf access-middle).

Slot: %right
Initform

cl-data-structures.meta:null-bucket

Initargs

:right

Readers

access-right.

Writers

(setf access-right).

Class: add!-function

Description: Class of ADD.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: add-function

Description:
Class of ADD and ADD!.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

grow-function.

Direct subclasses
Direct methods

alter-bucket.

Class: aggregation-function

Description:
Fundamental class of aggregation functions. Aggregation functions transform range into single result.

Responsibilities:
–Dispatches make-state.
–Dispatches state-result.
–Mutates state in aggregate function.
–Presents callable interface to the user.

Collaborators:
–State
–Range
–Aggregator

See also:
–MAKE-STATE
–AGGREGATE
–STATE-RESULT

Notes:
Aggregation-function is part of moderatly complex user aggregation protocol.

Package

cl-data-structures.algorithms.meta.

Source

classes.lisp.

Direct superclasses

range-function.

Direct subclasses
Direct methods
Class: approximated-counts
Package

cl-data-structures.streaming-algorithms.

Source

approximated-counts.lisp.

Direct superclasses

fundamental-data-sketch.

Direct methods
Direct slots
Slot: %counters
Type

(simple-array alexandria:non-negative-fixnum (* *))

Initargs

:counters

Readers
Writers

(setf access-counters).

Slot: %hashes
Type

vector

Initargs

:hashes

Readers

access-hashes.

Writers

(setf access-hashes).

Slot: %depth
Initargs

:depth

Readers

access-depth.

Writers

(setf access-depth).

Slot: %width
Initargs

:width

Readers

access-width.

Writers

(setf access-width).

Class: approximated-histogram
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Direct methods
Direct Default Initargs
InitargValue
:maximal-bins-count128
:fill-pointer0
:count0
:bins(vector)
:minmost-positive-double-float
:maxmost-negative-double-float
Direct slots
Slot: %max-bins
Initargs

:maximal-bins-count

Readers
Writers

This slot is read-only.

Slot: %bins
Initargs

:bins

Readers

access-bins.

Writers

(setf access-bins).

Slot: %fill-pointer
Initargs

:fill-pointer

Readers

access-fill-pointer.

Writers

(setf access-fill-pointer).

Slot: %count
Initargs

:count

Readers

access-count.

Writers

(setf access-count).

Slot: %min
Initargs

:min

Readers

access-min.

Writers

(setf access-min).

Slot: %max
Initargs

:max

Readers

access-max.

Writers

(setf access-max).

Class: approximated-set-cardinality
Package

cl-data-structures.streaming-algorithms.

Source

approximated-set-cardinality.lisp.

Direct superclasses

fundamental-data-sketch.

Direct methods
Direct slots
Slot: %registers
Initargs

:registers

Readers
Writers

(setf access-registers).

Class: assignable-forward-tree-range
Package

cl-data-structures.common.

Source

ranges.lisp.

Direct superclasses
Direct methods
Direct slots
Slot: %store-value
Type

(serapeum:-> (t t) t)

Initargs

:store-value

Readers

read-store-value.

Writers

This slot is read-only.

Class: bidirectional-chain-of-ranges
Package

cl-data-structures.algorithms.

Source

chain.lisp.

Direct superclasses
Direct subclasses

random-access-chain-of-ranges.

Direct methods
Class: bidirectional-proxy-range
Package

cl-data-structures.algorithms.

Source

common.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: bloom-filter
Package

cl-data-structures.streaming-algorithms.

Source

bloom-filter.lisp.

Direct superclasses

fundamental-data-sketch.

Direct methods
Direct slots
Slot: %counters
Type

simple-bit-vector

Initargs

:counters

Readers
Writers

(setf access-counters).

Slot: %hashes
Type

vector

Initargs

:hashes

Readers

access-hashes.

Writers

(setf access-hashes).

Slot: %width
Type

fixnum

Initargs

:width

Readers

access-width.

Writers

(setf access-width).

Slot: %depth
Type

fixnum

Initargs

:depth

Readers

access-depth.

Writers

(setf access-depth).

Class: chunked-range
Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct superclasses
Direct methods
Direct slots
Slot: %original-range
Initargs

:original-range

Readers

read-original-range.

Writers

This slot is read-only.

Slot: %chunk-size
Initargs

:chunk-size

Readers

read-chunk-size.

Writers

This slot is read-only.

Class: chunking-mixin
Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct subclasses
Direct methods

chunked.

Class: command

Description:
Instances of this class can be passed to functions in cl-ds expecting a file path (like for instance LINE-BY-LINE).

Package

cl-data-structures.file-system.

Source

unix.lisp.

Direct methods
Direct slots
Slot: %command-string
Type

string

Initargs

:command-string

Readers

read-command-string.

Writers

This slot is read-only.

Class: count-elements-function
Package

cl-data-structures.algorithms.

Source

count.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: cumulative-accumulate-range
Package

cl-data-structures.algorithms.

Source

cumulative-accumulate.lisp.

Direct superclasses
Direct methods
Direct slots
Slot: %initial-state
Initargs

:state

Readers

read-initial-state.

Writers

This slot is read-only.

Class: delayed
Package

cl-data-structures.

Source

delay.lisp.

Direct methods

read-callback.

Direct slots
Slot: %callback
Initargs

:callback

Readers

read-callback.

Writers

This slot is read-only.

Slot: %value
Class: destructive-function

Description:
Function that inherits this class is expected to perform side effects.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

funcallable-standard-object.

Direct subclasses
Direct methods
Class: eager-modification-operation-status
Package

cl-data-structures.common.

Source

eager-modification-operation-status.lisp.

Direct superclasses

implementation-modification-operation-status.

Class: egnat-metric-set
Package

cl-data-structures.metric-space.egnat.

Source

api.lisp.

Direct superclasses
Direct methods

distance.

Class: empty-range
Package

cl-data-structures.

Source

auxilary.lisp.

Direct superclasses

fundamental-forward-range.

Direct methods
Class: erase!-function

Description: Class of ERASE.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: erase*!-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: erase*-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods

destructive-counterpart.

Class: erase-function

Description:
Class of ERASE and ERASE!.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

shrink-function.

Direct subclasses
Direct methods

alter-bucket.

Class: erase-if!-function

Description: Class of ERASE-IF!.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: erase-if-function

Description:
Class of ERASE-IF and ERASE-IF!.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

shrink-function.

Direct subclasses
Direct methods

alter-bucket.

Class: expression
Package

cl-data-structures.

Source

expression-wrapper.lisp.

Direct superclasses
Direct methods
Direct slots
Slot: %construct-function
Type

function

Initargs

:construct-function

Readers

read-body.

Writers

This slot is read-only.

Slot: %arguments
Initargs

:arguments

Readers

read-arguments.

Writers

This slot is read-only.

Slot: %arguments-closure
Initargs

:arguments-closure

Readers

access-arguments-closure.

Writers

(setf access-arguments-closure).

Slot: %finished-closure
Initargs

:finished-closure

Readers

access-finished-closure.

Writers

(setf access-finished-closure).

Slot: %closure
Initargs

:closure

Readers

access-closure.

Writers

(setf access-closure).

Class: field
Package

cl-data-structures.

Source

field.lisp.

Direct methods
Direct slots
Slot: %arguments
Initargs

:arguments

Readers

read-arguments.

Writers

This slot is read-only.

Class: file-range-mixin
Package

cl-data-structures.file-system.

Source

common.lisp.

Direct subclasses
Direct methods
Direct slots
Slot: %reached-end
Type

boolean

Initargs

:reached-end

Readers

access-reached-end.

Writers

(setf access-reached-end).

Slot: %current-position
Type

alexandria:non-negative-integer

Initargs

:initial-position

Readers

access-current-position.

Writers

(setf access-current-position).

Slot: %initial-position
Type

alexandria:non-negative-integer

Initargs

:initial-position

Readers

read-initial-position.

Writers

This slot is read-only.

Slot: %stream
Type

list

Initform

(list nil)

Initargs

:stream

Slot: %path
Initargs

:path

Readers

read-path.

Writers

This slot is read-only.

Class: filtering-proxy
Package

cl-data-structures.algorithms.

Source

filtering.lisp.

Direct superclasses

proxy-range.

Direct subclasses
Direct methods
Direct slots
Slot: %key
Package

cl-data-structures.algorithms.meta.

Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Class: fixed-capacity-synchronized-mutable-2-3-queue
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Direct superclasses
Direct methods

become-transactional.

Class: fixed-capacity-synchronized-transactional-2-3-queue
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Direct superclasses
Direct methods
Class: forward-chain-of-ranges
Package

cl-data-structures.algorithms.

Source

chain.lisp.

Direct superclasses
Direct subclasses

bidirectional-chain-of-ranges.

Direct methods
Direct slots
Slot: %content
Initargs

:content

Readers

read-content.

Writers

This slot is read-only.

Slot: %original-content
Type

list

Initargs

:original-content

Readers

read-original-content.

Writers

This slot is read-only.

Class: forward-multiplex-proxy
Package

cl-data-structures.algorithms.

Source

multiplex.lisp.

Direct superclasses
Direct subclasses

parallel-forward-multiplex-proxy.

Class: forward-proxy-box-range
Package

cl-data-structures.algorithms.

Source

on-each.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: forward-proxy-range
Package

cl-data-structures.algorithms.

Source

common.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: forward-tree-range
Package

cl-data-structures.common.

Source

ranges.lisp.

Direct superclasses

fundamental-forward-range.

Direct subclasses

assignable-forward-tree-range.

Direct methods
Direct slots
Slot: %forward-stack
Type

list

Initargs

:forward-stack

Readers

access-forward-stack.

Writers

(setf access-forward-stack).

Slot: %obtain-value
Type

(serapeum:-> ((serapeum:-> nil t) (serapeum:-> (t) t)) (values t boolean))

Initargs

:obtain-value

Readers

read-obtain-value.

Writers

This slot is read-only.

Slot: %initial-stack
Type

list

Initargs

:initial-stack

Readers

read-initial-stack.

Writers

This slot is read-only.

Slot: %key
Type

(serapeum:-> (t) t)

Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Slot: %container
Type

cl-data-structures:fundamental-container

Initargs

:container

Readers

read-container.

Writers

This slot is read-only.

Class: functional

Description:
Object implements functional api.

Package

cl-data-structures.

Source

trait-classes.lisp.

Direct superclasses

fundamental-container.

Direct subclasses
Direct methods
Class: functional-2-3-queue

Description:
An functional queue based around 2-3 tree data structur.

Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Direct superclasses
Direct methods
Class: functional-add-function

Description: Class of ADD.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods

destructive-counterpart.

Class: functional-dictionary

Description:
Functional variant of a dictionary.

Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: functional-erase-function

Description: Class of ERASE.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods

destructive-counterpart.

Class: functional-erase-if-function

Description: Class of ERASE-IF.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods

destructive-counterpart.

Class: functional-function

Description:
Function that inherits this class is not allowed to perform any side effects.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

funcallable-standard-object.

Direct subclasses
Direct methods
Class: functional-hamt-dictionary

Description:
HAMT dictionary that implements functional api.

Package

cl-data-structures.dicts.hamt.

Source

api.lisp.

Direct superclasses
Direct methods
Class: functional-hashing-dictionary

Description:
Functional variant of hashing a dictionary.

Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses
Direct subclasses
Class: functional-insert-function

Description: Class of INSERT.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods

destructive-counterpart.

Class: functional-put-back-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: functional-put-front-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods

destructive-counterpart.

Class: functional-put-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: functional-rrb-vector

Description:
Functional variant of the RRB vector.

Package

cl-data-structures.sequences.rrb-vector.

Source

api.lisp.

Direct superclasses
Direct methods
Class: functional-sequence
Package

cl-data-structures.sequences.

Source

common.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: functional-sparse-rrb-vector

Description:
SRRB sparse vector that implements mutable api.

Package

cl-data-structures.dicts.srrb.

Source

types.lisp.

Direct superclasses
Direct methods
Class: functional-sparse-vector
Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses

fundamental-sparse-vector.

Direct subclasses

functional-sparse-rrb-vector.

Direct methods
Class: functional-take-out-back-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: functional-take-out-front-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods

destructive-counterpart.

Class: functional-take-out-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods

destructive-counterpart.

Class: functional-update-function

Description: Class of UPDATE.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods

destructive-counterpart.

Class: functional-update-if-function

Description: Class of UPDATE-IF.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods

destructive-counterpart.

Class: fundamental-assignable-forward-range
Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct superclasses
Direct subclasses

assignable-forward-tree-range.

Class: fundamental-bidirectional-range
Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct superclasses

fundamental-forward-range.

Direct subclasses
Direct methods
Class: fundamental-container

Description:
The root class of the containers.

Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct superclasses

traversable.

Direct subclasses
Direct methods
Class: fundamental-data-sketch

Description:
The base class of all data sketches. Instances of this class can be passed to streaming algorihms as initial states, cloned and combined into unions.

Package

cl-data-structures.streaming-algorithms.

Source

common.lisp.

Direct subclasses
Direct methods
Direct slots
Slot: %hash-fn
Initargs

:hash-fn

Readers

access-hash-fn.

Writers

(setf access-hash-fn).

Class: fundamental-dictionary

Description:
Container that provides location to value mapping. Either ordered or unordered.

Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses

fundamental-container.

Direct subclasses
Direct methods

become-lazy.

Class: fundamental-egnat-container
Package

cl-data-structures.common.egnat.

Source

classes.lisp.

Direct superclasses

fundamental-container.

Direct subclasses
Direct methods
Direct slots
Slot: %branching-factor
Type

integer

Initargs

:branching-factor

Readers

read-branching-factor.

Writers

This slot is read-only.

Slot: %samples-count
Type

integer

Initargs

:samples-count

Readers

read-samples-count.

Writers

This slot is read-only.

Slot: %metric-type
Initform

:single-float

Initargs

:metric-type

Readers

read-metric-type.

Writers

This slot is read-only.

Slot: %content-count-in-node
Type

integer

Initargs

:content-count-in-node

Readers

read-content-count-in-node.

Writers

This slot is read-only.

Slot: %size
Type

integer

Initform

0

Readers
Writers

(setf access-size).

Slot: %root
Initargs

:root

Readers

access-root.

Writers

(setf access-root).

Class: fundamental-forward-range
Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct superclasses

fundamental-range.

Direct subclasses
Direct methods
Class: fundamental-functional-queue

Description:
A fundamental base class of all functional queues.

Package

cl-data-structures.queues.

Source

common.lisp.

Direct superclasses
Direct subclasses

functional-2-3-queue.

Direct methods
Class: fundamental-hashing-dictionary

Description:
Dictionary that uses hashing function. Hashing function is assumed to return fixnum.

Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses

fundamental-dictionary.

Direct subclasses
Direct methods
Direct slots
Slot: %hash-fn
Type

(serapeum:-> (t) fixnum)

Initargs

:hash-fn

Readers

read-hash-fn.

Writers

This slot is read-only.

Slot: %equal-fn
Type

(serapeum:-> (t t) boolean)

Initargs

:equal-fn

Readers

read-equal-fn.

Writers

This slot is read-only.

Class: fundamental-modification-operation-status

Description:
The base class of all fundamental modification status classes.

Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct subclasses
Class: fundamental-mutable-queue

Description:
A fundamental base class of all mutable queues.

Package

cl-data-structures.queues.

Source

common.lisp.

Direct superclasses
Direct subclasses

mutable-2-3-queue.

Direct methods
Class: fundamental-ownership-tagged-object
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Direct subclasses
Direct methods
Direct slots
Slot: %ownership-tag
Initargs

:ownership-tag

Readers

read-ownership-tag.

Writers

write-ownership-tag.

Class: fundamental-qp-trie-set
Package

cl-data-structures.sets.qp-trie.

Source

api.lisp.

Direct superclasses

qp-trie.

Direct subclasses

mutable-qp-trie-set.

Direct methods
Class: fundamental-queue

Description:
A fundamental base class of all queues.

Package

cl-data-structures.queues.

Source

common.lisp.

Direct superclasses

fundamental-container.

Direct subclasses
Direct methods
Direct slots
Slot: %size
Initform

0

Initargs

:size

Readers
Writers

(setf access-size).

Class: fundamental-random-access-range
Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct superclasses

fundamental-bidirectional-range.

Direct subclasses
Direct methods
Class: fundamental-range
Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct superclasses

traversable.

Direct subclasses
Direct methods
Class: fundamental-sequence
Package

cl-data-structures.sequences.

Source

common.lisp.

Direct subclasses
Direct methods

become-lazy.

Class: fundamental-set
Package

cl-data-structures.sets.

Source

common.lisp.

Direct superclasses

fundamental-container.

Direct subclasses

mutable-set.

Class: fundamental-skip-list
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Direct superclasses
Direct subclasses
Direct methods
Direct Default Initargs
InitargValue
:maximum-level32
Direct slots
Slot: %ordering-function
Initargs

:ordering-function

Readers

read-ordering-function.

Writers

This slot is read-only.

Slot: %test-function
Initargs

:test-function

Readers

access-test-function.

Writers

(setf access-test-function).

Slot: %pointers
Type

simple-vector

Initargs

:pointers

Readers

read-pointers.

Writers

This slot is read-only.

Slot: %maximum-level
Initargs

:maximum-level

Readers

access-maximum-level.

Writers

(setf access-maximum-level).

Class: fundamental-skip-list-range
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Direct superclasses

fundamental-forward-range.

Direct subclasses
Direct methods
Direct Default Initargs
InitargValue
:last-nodenil
Direct slots
Slot: %current-node
Initargs

:current-node

Readers

access-current-node.

Writers

(setf access-current-node).

Slot: %initial-current-node
Initargs

:current-node

Readers

read-initial-current-node.

Writers

This slot is read-only.

Slot: %last-node
Initargs

:last-node

Readers

read-last-node.

Writers

This slot is read-only.

Class: fundamental-sparse-vector
Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses

fundamental-dictionary.

Direct subclasses
Direct methods

map-bucket.

Class: fundamental-transactional-queue
Package

cl-data-structures.queues.

Source

common.lisp.

Direct superclasses
Direct subclasses

transactional-2-3-queue.

Direct methods
Class: future-carousel
Package

cl-data-structures.utils.

Source

parallel-tools.lisp.

Direct superclasses

funcallable-standard-object.

Direct methods
Direct slots
Slot: %vector
Type

vector

Initargs

:vector

Readers

read-vector.

Writers

This slot is read-only.

Slot: %index
Type

fixnum

Initform

0

Readers

access-index.

Writers

(setf access-index).

Slot: %function
Initargs

:function

Readers

read-function.

Writers

This slot is read-only.

Class: group-by-function
Package

cl-data-structures.algorithms.

Source

group-by.lisp.

Direct superclasses

layer-function.

Direct methods
Class: group-by-result-range
Package

cl-data-structures.algorithms.

Source

group-by.lisp.

Direct superclasses

hash-table-range.

Class: grow-function

Description:
Function will attempt to add new element to container.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

funcallable-standard-object.

Direct subclasses
Direct methods
Class: half-matrix

Description:
Matrix container suitable for storing symetric data (like distances). Does not store diagonal values.

Package

cl-data-structures.utils.

Source

distances.lisp.

Direct methods
Direct slots
Slot: %size
Type

fixnum

Initargs

:size

Readers

read-size.

Writers

This slot is read-only.

Slot: %content
Type

simple-array

Initargs

:content

Readers

read-content.

Writers

This slot is read-only.

Slot: %key
Type

function

Initform

(function identity)

Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Class: hamt-container
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Direct superclasses

fundamental-ownership-tagged-object.

Direct subclasses

hamt-dictionary.

Direct methods
Direct slots
Slot: %root

Hash node pointing to root of the whole hash tree.

Initargs

:root

Readers

access-root.

Writers

(setf access-root).

Slot: %size

How many elements are in there?

Type

alexandria:non-negative-fixnum

Initform

0

Initargs

:size

Readers

access-size.

Writers

(setf access-size).

Slot: %bucket-size
Type

alexandria:positive-fixnum

Initform

3

Initargs

:bucket-size

Readers

read-bucket-size.

Writers

This slot is read-only.

Class: hamt-dictionary

Description:
Root HAMT dictionary class.

Package

cl-data-structures.dicts.hamt.

Source

api.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: hash-table-range
Package

cl-data-structures.algorithms.

Source

common.lisp.

Direct superclasses
Direct subclasses
Direct methods
Direct slots
Slot: %hash-table
Initargs

:hash-table

Readers

read-hash-table.

Writers

This slot is read-only.

Slot: %keys
Initargs

:keys

Readers

read-keys.

Writers

This slot is read-only.

Slot: %begin
Type

fixnum

Initargs

:begin

Readers

access-begin.

Writers

(setf access-begin).

Slot: %initial-begin
Type

fixnum

Initargs

:begin

Readers

read-initial-begin.

Writers

This slot is read-only.

Slot: %end
Type

fixnum

Initargs

:end

Readers

access-end.

Writers

(setf access-end).

Slot: %initial-end
Type

fixnum

Initargs

:end

Readers

read-initial-end.

Writers

This slot is read-only.

Class: insert!-function

Description: Class of INSERT.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: insert-function

Description:
Class of INSERT and (SETF AT).

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

grow-function.

Direct subclasses
Direct methods

alter-bucket.

Class: key-value-range
Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct subclasses

hash-table-range.

Class: layer-function
Package

cl-data-structures.algorithms.meta.

Source

classes.lisp.

Direct superclasses

range-function.

Direct subclasses
Direct methods
Class: lazy

Description:
Functional object, with lazy implementation.

Package

cl-data-structures.

Source

trait-classes.lisp.

Direct superclasses

functional.

Direct subclasses
Class: lazy-bidirectional-range
Package

cl-data-structures.common.

Source

lazy-range.lisp.

Direct superclasses
Direct subclasses

lazy-random-access-range.

Direct methods
Class: lazy-box-container
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Direct superclasses
Direct subclasses
Direct methods
Direct slots
Slot: %operations
Type

(or null cl-data-structures.common::changes)

Initargs

:operations

Readers

access-operations.

Writers

(setf access-operations).

Class: lazy-dictionary

Description:
Lazy variant of a dictionary.

Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses
Direct subclasses
Class: lazy-hashing-dictionary

Description:
Lazy variant of a hashing dictionary.

Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses
Class: lazy-random-access-range
Package

cl-data-structures.common.

Source

lazy-range.lisp.

Direct superclasses
Direct methods
Class: list-range
Package

cl-data-structures.adapters.

Source

list.lisp.

Direct superclasses

fundamental-forward-range.

Direct methods
Direct slots
Slot: %content
Initargs

:content

Readers

access-content.

Writers

(setf access-content).

Slot: %original-content
Initargs

:original-content

Readers

read-original-content.

Writers

This slot is read-only.

Class: metric-space-dictionary

Description:
Fundamental class for all metric-space-dictionaries

Package

cl-data-structures.metric-space.

Source

trait-classes.lisp.

Direct superclasses

fundamental-container.

Direct subclasses

mutable-metric-space-dictionary.

Class: metric-space-set

Description:
Fundamental class for all metric space sets.

Package

cl-data-structures.metric-space.

Source

trait-classes.lisp.

Direct superclasses

fundamental-container.

Direct subclasses
Direct methods
Direct slots
Slot: %metric-fn
Initargs

:metric-fn

Readers

read-metric-fn.

Writers

This slot is read-only.

Class: mutable

Description:
Object implements mutable api.

Package

cl-data-structures.

Source

trait-classes.lisp.

Direct superclasses

fundamental-container.

Direct subclasses
Direct methods
Class: mutable-2-3-queue

Description:
An mutable queue based around 2-3 tree data structur.

Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: mutable-dictionary

Description:
Mutable variant of a dictionary.

Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: mutable-egnat-container
Package

cl-data-structures.common.egnat.

Source

classes.lisp.

Direct superclasses
Direct subclasses

mutable-egnat-metric-set.

Direct methods

position-modification.

Class: mutable-egnat-metric-set
Package

cl-data-structures.metric-space.egnat.

Source

api.lisp.

Direct superclasses
Class: mutable-hamt-dictionary

Description:
HAMT dictionary that implements mutable api.

Package

cl-data-structures.dicts.hamt.

Source

api.lisp.

Direct superclasses
Direct subclasses

transactional-hamt-dictionary.

Direct methods
Class: mutable-hashing-dictionary

Description:
Mutable variant of hashing a dictionary.

Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses
Direct subclasses

mutable-hamt-dictionary.

Class: mutable-metric-space-dictionary

Description:
Fundamental class for all mutable metric space dictionaries

Package

cl-data-structures.metric-space.

Source

trait-classes.lisp.

Direct superclasses

metric-space-dictionary.

Class: mutable-metric-space-set

Description:
Fundamental class for all mutable metric space sets.

Package

cl-data-structures.metric-space.

Source

trait-classes.lisp.

Direct superclasses

metric-space-set.

Direct subclasses

mutable-egnat-metric-set.

Direct methods
Class: mutable-qp-trie-set

Description:
Mutable variant of the mutable-qp-trie-set.

Package

cl-data-structures.sets.qp-trie.

Source

api.lisp.

Direct superclasses
Direct methods
Class: mutable-rrb-vector

Description:
Mutable variant of the RRB vector.

Package

cl-data-structures.sequences.rrb-vector.

Source

api.lisp.

Direct superclasses
Direct methods
Class: mutable-sequence
Package

cl-data-structures.sequences.

Source

common.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: mutable-set
Package

cl-data-structures.sets.

Source

common.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: mutable-skip-list-dictionary
Package

cl-data-structures.dicts.skip-list.

Source

api.lisp.

Direct superclasses
Direct methods
Class: mutable-skip-list-set

Description: Mutable skip list set.

Package

cl-data-structures.sets.skip-list.

Source

api.lisp.

Direct superclasses
Direct methods
Class: mutable-sparse-rrb-vector

Description:
SRRB sparse vector that implements mutable api.

Package

cl-data-structures.dicts.srrb.

Source

types.lisp.

Direct superclasses
Direct subclasses

transactional-sparse-rrb-vector.

Direct methods
Class: mutable-sparse-vector
Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses

fundamental-sparse-vector.

Direct subclasses
Direct methods
Class: node
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Direct subclasses
Class: offset-vector-range
Package

cl-data-structures.adapters.

Source

vector.lisp.

Direct superclasses

vector-range.

Direct methods
Direct slots
Slot: %offset
Type

fixnum

Initform

0

Initargs

:offset

Readers

read-offset.

Writers

This slot is read-only.

Class: pipe-fragment
Package

cl-data-structures.utils.

Source

parallel-tools.lisp.

Direct superclasses

funcallable-standard-object.

Direct methods
Direct slots
Slot: %thread
Readers

read-thread.

Writers

This slot is read-only.

Slot: %sinks
Initform

(serapeum:vect)

Readers

read-sinks.

Writers

This slot is read-only.

Slot: %sinks-lock
Initform

(bordeaux-threads:make-lock)

Readers

read-sinks-lock.

Writers

This slot is read-only.

Slot: %operation
Initargs

:operation

Readers

read-operation.

Writers

This slot is read-only.

Slot: %end-on-empty
Initargs

:end-on-empty

Readers

read-end-on-empty.

Writers

This slot is read-only.

Slot: %queue
Readers

read-queue.

Writers

This slot is read-only.

Class: proxy-box-range
Package

cl-data-structures.algorithms.

Source

on-each.lisp.

Direct superclasses

proxy-range.

Direct subclasses

forward-proxy-box-range.

Direct methods
Direct Default Initargs
InitargValue
:functornil
:functor-constructor(function identity)
Direct slots
Slot: %functor
Initargs

:functor

Readers

access-functor.

Writers

(setf access-functor).

Slot: %functor-prototype
Initargs

:functor-prototype

Readers

read-functor-prototype.

Writers

This slot is read-only.

Slot: %functor-constructor
Initargs

:functor-constructor

Readers

read-functor-constructor.

Writers

This slot is read-only.

Slot: %key
Package

cl-data-structures.algorithms.meta.

Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Class: proxy-range
Package

cl-data-structures.algorithms.

Source

common.lisp.

Direct subclasses
Direct methods
Direct slots
Slot: %original-range
Initargs

:original-range

Readers

read-original-range.

Writers

This slot is read-only.

Class: put!-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: put-back!-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: put-front!-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods

destructive-counterpart.

Class: put-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

grow-function.

Direct subclasses
Direct methods

position-modification.

Class: qp-trie
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Direct subclasses

fundamental-qp-trie-set.

Direct methods
Direct Default Initargs
InitargValue
:root(make-qp-trie-node)
Direct slots
Slot: %root
Initargs

:root

Readers

access-root.

Writers

(setf access-root).

Class: random-access-chain-of-ranges
Package

cl-data-structures.algorithms.

Source

chain.lisp.

Direct superclasses
Direct methods
Class: random-access-proxy-range
Package

cl-data-structures.algorithms.

Source

common.lisp.

Direct superclasses
Direct subclasses
Direct methods

at.

Class: range-function

Description:
Fundamental class of all functions operating on ranges (layer and aggregator functions).

Package

cl-data-structures.algorithms.meta.

Source

classes.lisp.

Direct superclasses

standard-generic-function.

Direct subclasses
Class: rrb-container
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Direct superclasses
Direct subclasses

rrb-vector.

Direct methods
Direct slots
Slot: %root

root of the tree

Type

(or cl-data-structures.common.rrb:rrb-node nil)

Initargs

:root

Readers

access-root.

Writers

(setf access-root).

Slot: %shift
Type

cl-data-structures.common.rrb:shift

Initform

0

Initargs

:shift

Readers

access-shift.

Writers

(setf access-shift).

Slot: %size
Type

alexandria:non-negative-fixnum

Initform

0

Initargs

:size

Readers

access-size.

Writers

(setf access-size).

Slot: %element-type
Initform

t

Initargs

:element-type

Readers
Writers

This slot is read-only.

Slot: %tail-size
Type

cl-data-structures.common.rrb:node-size

Initform

0

Initargs

:tail-size

Readers

access-tail-size.

Writers

(setf access-tail-size).

Slot: %tail
Type

(or null simple-array)

Initargs

:tail

Readers

access-tail.

Writers

(setf access-tail).

Class: rrb-range
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Direct superclasses

fundamental-random-access-range.

Direct subclasses

mutable-rrb-range.

Direct methods
Direct Default Initargs
InitargValue
:mutex(make-lock)
Direct slots
Slot: %start
Type

fixnum

Readers

access-start.

Writers

(setf access-start).

Slot: %mutex
Type

bordeaux-threads:lock

Initargs

:mutex

Readers

read-mutex.

Writers

This slot is read-only.

Slot: %last-size
Type

fixnum

Readers

access-last-size.

Writers

(setf access-last-size).

Slot: %lower-bound
Type

fixnum

Readers

access-lower-bound.

Writers

(setf access-lower-bound).

Slot: %upper-bound
Type

fixnum

Initargs

:upper-bound

Readers

access-upper-bound.

Writers

(setf access-upper-bound).

Slot: %initial-lower-bound
Type

fixnum

Initargs

:initial-lower-bound

Readers

read-initial-lower-bound.

Writers

This slot is read-only.

Slot: %initial-upper-bound
Type

fixnum

Initargs

:initial-upper-bound

Readers

read-initial-upper-bound.

Writers

This slot is read-only.

Slot: %content
Readers

read-content.

Writers

This slot is read-only.

Slot: %container
Initargs

:container

Readers

access-container.

Writers

(setf access-container).

Class: sequence-window
Package

cl-data-structures.common.

Source

sequence-window.lisp.

Direct superclasses

fundamental-random-access-range.

Direct subclasses
Direct methods
Direct slots
Slot: %from
Initargs

:from

Readers

read-from.

Writers

This slot is read-only.

Slot: %to
Initargs

:to

Readers

read-to.

Writers

This slot is read-only.

Slot: %content
Initargs

:content

Readers

read-content.

Writers

This slot is read-only.

Slot: %current-index
Initform

0

Initargs

:current-index

Readers

access-current-index.

Writers

(setf access-current-index).

Slot: %initial-to
Readers

access-initial-to.

Writers

(setf access-initial-to).

Class: shrink-function

Description:
Function will attempt to remove element from container.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

funcallable-standard-object.

Direct subclasses
Direct methods
Class: shuffled-range
Package

cl-data-structures.algorithms.

Source

shuffled-range.lisp.

Direct superclasses
Direct methods
Direct slots
Slot: %table
Initform

(make-hash-table)

Initargs

:table

Readers

read-table.

Writers

This slot is read-only.

Slot: %index
Initargs

:index

Readers

access-index.

Writers

(setf access-index).

Slot: %from
Initargs

:from

Readers

read-from.

Writers

This slot is read-only.

Slot: %to
Initargs

:to

Readers

read-to.

Writers

This slot is read-only.

Class: summary-result-range
Package

cl-data-structures.algorithms.

Source

summary.lisp.

Direct superclasses

hash-table-range.

Class: synchronized-mutable-2-3-queue
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Direct superclasses
Direct methods

become-transactional.

Class: synchronized-transactional-2-3-queue
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Direct superclasses
Direct methods
Class: tagged-node
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Direct subclasses
Direct methods

read-ownership-tag.

Direct slots
Slot: %ownership-tag
Initargs

:ownership-tag

Readers

read-ownership-tag.

Writers

This slot is read-only.

Class: take-out!-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: take-out-back!-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: take-out-front!-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods

destructive-counterpart.

Class: take-out-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

shrink-function.

Direct subclasses
Direct methods
Class: transactional

Description:
Object implements mutable api in a transactional way.

Package

cl-data-structures.

Source

trait-classes.lisp.

Direct superclasses

mutable.

Direct subclasses
Direct methods

transactionalp.

Class: transactional-2-3-queue

Description:
An transactional queue based around 2-3 tree data structure.

Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: transactional-dictionary

Description:
Transactional variant of a dictionary.

Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses
Direct subclasses

transactional-hashing-dictionary.

Class: transactional-hamt-dictionary

Description:
Transactional HAMT dictionary that implements mutable api.

Package

cl-data-structures.dicts.hamt.

Source

api.lisp.

Direct superclasses
Direct methods
Class: transactional-hashing-dictionary

Description:
Transactional variant of hashing a dictionary.

Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses
Direct subclasses

transactional-hamt-dictionary.

Class: transactional-rrb-vector

Description:
Transactional variant of the RRB vector.

Package

cl-data-structures.sequences.rrb-vector.

Source

api.lisp.

Direct superclasses
Direct methods
Class: transactional-sequence
Package

cl-data-structures.sequences.

Source

common.lisp.

Direct superclasses
Direct subclasses

transactional-rrb-vector.

Class: transactional-sparse-rrb-vector

Description:
Transactional SRRB sparse vector that implements mutable api.

Package

cl-data-structures.dicts.srrb.

Source

types.lisp.

Direct superclasses
Direct methods
Direct Default Initargs
InitargValue
:ownership-tag(make-ownership-tag)
Class: transactional-sparse-vector
Package

cl-data-structures.dicts.

Source

trait-classes.lisp.

Direct superclasses

mutable-sparse-vector.

Direct subclasses

transactional-sparse-rrb-vector.

Class: transformation!-function
Package

cl-data-structures.algorithms.meta.

Source

classes.lisp.

Direct superclasses

range-function.

Class: transparent-to-chunking-mixin
Package

cl-data-structures.algorithms.

Source

common.lisp.

Direct methods

chunked.

Class: traversable
Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct subclasses
Direct methods
Class: tree
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Direct superclasses

fundamental-container.

Direct subclasses
Direct methods
Direct slots
Slot: %root
Initform

cl-data-structures.meta:null-bucket

Initargs

:root

Readers

access-root.

Writers

(setf access-root).

Class: update!-function

Description: Class of UPDATE.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: update-function

Description:
Class of UPDATE and UPDATE!.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

grow-function.

Direct subclasses
Direct methods
Class: update-if!-function

Description: Class of UPDATE-IF!.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses
Direct methods
Class: update-if-function

Description:
Class of UPDATE-IF and UPDATE-IF!.

Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

grow-function.

Direct subclasses
Direct methods

fresh-bucket-status.

Class: vector-range
Package

cl-data-structures.adapters.

Source

vector.lisp.

Direct superclasses

fundamental-random-access-range.

Direct subclasses

offset-vector-range.

Direct methods
Direct Default Initargs
InitargValue
:lower-bound0
Direct slots
Slot: %vector
Type

vector

Initargs

:vector

Readers

read-vector.

Writers

This slot is read-only.

Slot: %initial-lower-bound
Type

fixnum

Initargs

:lower-bound

Readers

read-initial-lower-bound.

Writers

This slot is read-only.

Slot: %initial-upper-bound
Type

fixnum

Initargs

:upper-bound

Readers

read-initial-upper-bound.

Writers

This slot is read-only.

Slot: %lower-bound
Type

fixnum

Initargs

:lower-bound

Readers

access-lower-bound.

Writers

(setf access-lower-bound).

Slot: %upper-bound
Type

fixnum

Initargs

:upper-bound

Readers

access-upper-bound.

Writers

(setf access-upper-bound).


6.1.11 Types

Type: extendable-vector (&optional type)
Package

cl-data-structures.utils.

Source

types.lisp.

Type: hash ()
Package

cl-data-structures.streaming-algorithms.polynomial-hashing.

Source

polynomial-hashing.lisp.

Type: hash-array ()
Package

cl-data-structures.streaming-algorithms.polynomial-hashing.

Source

polynomial-hashing.lisp.

Type: hash-node-size ()
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Type: index ()
Package

cl-data-structures.utils.

Source

types.lisp.

Type: node-content ()

Vector with content of the node

Package

cl-data-structures.common.rrb.

Source

common.lisp.

Type: node-size ()

Effectivly index in the node-content

Package

cl-data-structures.common.rrb.

Source

common.lisp.

Type: qp-trie-node ()
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Type: register ()
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Type: rrb-index ()
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Type: rrb-node ()

Basicly either node-content or pair of node-content and ownership-tag

Package

cl-data-structures.common.rrb.

Source

common.lisp.

Type: rrb-node-position ()
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Type: shift ()
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Type: sketch ()
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Type: sparse-rrb-mask ()
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Type: sparse-rrb-node ()
Package

cl-data-structures.common.rrb.

Source

common.lisp.


6.2 Internals


6.2.2 Macros

Macro: define-all-validation-for-fields (&rest class-list)
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Macro: front-body (range stack)
Package

cl-data-structures.common.egnat.

Source

methods.lisp.

Macro: macro-with-dynamic-vars (bindings body)
Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: make-bucket-callback (make-container &key location value operation all)
Package

cl-data-structures.composite.

Source

implementation.lisp.

Macro: qp-trie-node-get-or-insert-child! (node index new-node-form)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Macro: quasi-clone-other-class* (instance class &body arguments)
Package

cl-data-structures.utils.

Source

cloning.lisp.

Macro: toggle-vars (bindings &body body)
Package

cl-data-structures.utils.

Source

macros.lisp.

Macro: traverse-body (range stack function)
Package

cl-data-structures.common.egnat.

Source

methods.lisp.

Macro: with-stream-input ((stream range) &body body)
Package

cl-data-structures.file-system.

Source

common.lisp.


6.2.3 Ordinary functions

Function: acquire-path (path shift ownership-tag)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: across/traverse (container function)
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Function: add-change (changes next)
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Function: add-children-to-stack (range node stack)
Package

cl-data-structures.common.egnat.

Source

methods.lisp.

Function: adjust-tree-to-new-size! (structure position ownership-tag)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: aggregation-function-class-form (function-class)
Package

cl-data-structures.algorithms.meta.

Source

macros.lisp.

Function: aggregation-function-defgeneric-form (function-name function-class generic-lambda-list method-lambda-list values)
Package

cl-data-structures.algorithms.meta.

Source

macros.lisp.

Reader: aggregator-cleanup (instance)
Writer: (setf aggregator-cleanup) (instance)
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Target Slot

cleanup.

Function: aggregator-constructor-form (function-class function-state-forms init-body aggregate-form result-form method-lambda-list parameters key-position)
Package

cl-data-structures.algorithms.meta.

Source

macros.lisp.

Reader: aggregator-extract (instance)
Writer: (setf aggregator-extract) (instance)
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Target Slot

extract.

Function: aggregator-p (object)
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Reader: aggregator-pass (instance)
Writer: (setf aggregator-pass) (instance)
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Target Slot

pass.

Function: approximated-expected-collisions (first second)
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: approximated-histogram-bin-clone (bin)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: approximated-histogram-bin-p (object)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: assign-children (container seeds data &optional start parallel)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: assoc-skip-list-node-content (instance)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: (setf assoc-skip-list-node-content) (instance)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: assoc-skip-list-node-p (object)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: assoc-skip-list-node-pointers (instance)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: (setf assoc-skip-list-node-pointers) (instance)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: average-pairwise-distance (container seeds content)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: become-subtree (container node)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: beta (ez)
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: bourgain-embedding (vector-of-elements distance-fn &key metric-type)
Package

cl-data-structures.utils.

Source

embedding.lisp.

Function: build-setf-form (vars args)
Package

cl-data-structures.utils.

Source

macros.lisp.

Function: calculate-distances (container item parent &optional stack)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: calculate-hodges-lehmann-estimator (parallel vector)
Package

cl-data-structures.math.

Source

hodges-lehmann.lisp.

Function: calculate-mutual-information (fields)
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Function: calculate-mutual-information-between (field1 field2)
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Function: calculate-skip-count (w)
Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Function: calculate-split-point (reference-field matched-field)
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Reader: changes-content (instance)
Writer: (setf changes-content) (instance)
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Target Slot

content.

Reader: changes-end-index (instance)
Writer: (setf changes-end-index) (instance)
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Target Slot

end-index.

Function: changes-p (object)
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Reader: changes-parent (instance)
Writer: (setf changes-parent) (instance)
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Target Slot

parent.

Reader: changes-unique (instance)
Writer: (setf changes-unique) (instance)
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Target Slot

unique.

Function: check-probability-in-rows (table)
Package

cl-data-structures.math.

Source

hmm.lisp.

Function: circular-shift (array start end shift)
Package

cl-data-structures.utils.

Source

arrays.lisp.

Function: circular-shift-left (array start end shift)
Package

cl-data-structures.utils.

Source

arrays.lisp.

Function: circular-shift-right (array start end shift)
Package

cl-data-structures.utils.

Source

arrays.lisp.

Function: clone-of-original-range (&rest arguments)
Package

cl-data-structures.algorithms.

Source

common.lisp.

Function: clone-of-stack (range)
Package

cl-data-structures.file-system.

Source

find.lisp.

Function: close-silence-errors (stream)
Package

cl-data-structures.file-system.

Source

common.lisp.

Function: closest-node (container nodes item)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: collect-buckets (parent)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: common-fundamental-range-class (ranges)
Package

cl-data-structures.algorithms.

Source

common-range-category.lisp.

Function: consume-impl (range v)
Package

cl-data-structures.algorithms.

Source

cumulative-accumulate.lisp.

Function: continuesp (field)
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Function: copy-aggregator (instance)
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Function: copy-approximated-histogram-bin (instance)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: copy-array-if-not-nil (array)
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Function: copy-assoc-skip-list-node (instance)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: copy-changes (instance)
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Function: copy-dict-content (instance)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: copy-hamt-range-stack-cell (instance)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: copy-hash-content (instance)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: copy-hash-dict-content (instance)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: copy-hash-node-tagged (instance)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: copy-hash-node-untagged (instance)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: copy-into! (destination source &optional limit start)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: copy-qp-trie-node-tagged (instance)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: copy-qp-trie-node-untagged (instance)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: copy-reservoir-sampling (instance)
Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Function: copy-skip-list-node (instance)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: copy-sparse-rrb-node-tagged (instance)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: copy-sparse-rrb-node-untagged (instance)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: copy-srrb-range-stack-cell (instance)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Function: copy-tagged-struct-node (instance)
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Function: cycle-rotate (array leader section-offset section-length)
Package

cl-data-structures.utils.

Source

arrays.lisp.

Function: deep-copy-of-content (range)
Package

cl-data-structures.algorithms.

Source

cartesian.lisp.

Function: deep-copy-of-tail (vector)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: destructive-grow-tree! (operation structure container position all value)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: dict-content-p (object)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: directory-content (directory)
Package

cl-data-structures.file-system.

Source

find.lisp.

Function: directory-regex-matches (regex path parent)
Package

cl-data-structures.file-system.

Source

find.lisp.

Function: discrete-form (field data)

Can’t calculate mutual information for continues variables, so we will divide whole range into segments.

Package

cl-data-structures.math.

Source

mutual-information.lisp.

Function: distance (matrix from to)
Package

cl-data-structures.utils.

Source

distances.lisp.

Function: (setf distance) (matrix from to)
Package

cl-data-structures.utils.

Source

distances.lisp.

Function: drop-unneded-nodes (tree shift-difference)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: egnat-grow! (structure container operation item additional-arguments)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: enclose-finalizer (stream-cons)
Package

cl-data-structures.file-system.

Source

common.lisp.

Function: every-possible-combination (count)
Package

cl-data-structures.utils.

Source

macros.lisp.

Function: execute-changes (changes instance)
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Function: expected-collisions (n m)
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: extract-parameters (lambda-list)
Package

cl-data-structures.algorithms.meta.

Source

macros.lisp.

Function: extract-values (lambda-list)
Package

cl-data-structures.algorithms.meta.

Source

macros.lisp.

Function: fast-map-embeddings (data metric-function dimensions iterations parallel)
Package

cl-data-structures.math.

Source

fast-map.lisp.

Function: fill-sparse-rrb-node-without (new-node old-node skipped-index)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: find-content (container bucket location hash)
Package

cl-data-structures.dicts.hamt.

Source

internal.lisp.

Function: fold-content (tag content)
Package

cl-data-structures.sequences.rrb-vector.

Source

api.lisp.

Function: fold-rrb-content (content tag)
Package

cl-data-structures.sequences.rrb-vector.

Source

api.lisp.

Function: force-lazy-range (range)
Package

cl-data-structures.common.

Source

lazy-range.lisp.

Function: forward-cell (cell)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: forward-cell (cell)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Function: full-bucket-p (container bucket)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: gather-pointers (node pointers)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: gen-w (count &optional w)
Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Function: generate-if-else (conditions forms)
Package

cl-data-structures.utils.

Source

macros.lisp.

Function: generate-validation-forms (body field-name accepted-field-arguments)
Package

cl-data-structures.

Source

field.lisp.

Function: grow-tree (operation structure container position all value)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Reader: hamt-range-stack-cell-end (instance)
Writer: (setf hamt-range-stack-cell-end) (instance)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Target Slot

end.

Reader: hamt-range-stack-cell-node (instance)
Writer: (setf hamt-range-stack-cell-node) (instance)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Target Slot

node.

Function: hamt-range-stack-cell-p (object)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Reader: hamt-range-stack-cell-start (instance)
Writer: (setf hamt-range-stack-cell-start) (instance)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Target Slot

start.

Function: has-single-child-p (node)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: hash-content-p (object)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: hash-dict-content-hash (instance)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: (setf hash-dict-content-hash) (instance)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: hash-dict-content-location (instance)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: (setf hash-dict-content-location) (instance)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: hash-dict-content-p (object)
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Function: hash-node-node-mask (argument)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: (setf hash-node-node-mask) (argument)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Reader: hash-node-tagged-content (instance)
Writer: (setf hash-node-tagged-content) (instance)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Target Slot

content.

Reader: hash-node-tagged-node-mask (instance)
Writer: (setf hash-node-tagged-node-mask) (instance)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Target Slot

node-mask.

Function: hash-node-tagged-ownership-tag (instance)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: (setf hash-node-tagged-ownership-tag) (instance)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-node-tagged-p (object)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Reader: hash-node-untagged-content (instance)
Writer: (setf hash-node-untagged-content) (instance)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Target Slot

content.

Reader: hash-node-untagged-node-mask (instance)
Writer: (setf hash-node-untagged-node-mask) (instance)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Target Slot

node-mask.

Function: hash-node-untagged-p (object)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: hash-shifts (y)
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: highest-leader (length)
Package

cl-data-structures.utils.

Source

arrays.lisp.

Function: hll-rank (value)
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: in-shuffle-array (array start end)
Package

cl-data-structures.utils.

Source

arrays.lisp.

Function: index-in-content-of-distance-matrix (size row column)
Package

cl-data-structures.utils.

Source

distances.lisp.

Function: init-chain-of-range (obj)
Package

cl-data-structures.algorithms.

Source

chain.lisp.

Function: init-connected-ranges (obj)
Package

cl-data-structures.algorithms.

Source

zip.lisp.

Function: init-rrb (instance container &key from to)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: init-vector-range (range)
Package

cl-data-structures.adapters.

Source

vector.lisp.

Function: initialize-field (data field)
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Function: initialize-fields (fields data)
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Function: initialize-mutual-information-hash-tables (field1 field2)
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Function: initialize-split-point-field (data field)
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Function: insert-into-node! (into new-element index)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: insert-new-node! (node i &optional ownership-tag)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: insert-tail-handle-root-overflow (shift tree new-node ownership-tag)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: inverse-in-shuffle-array (array start end)
Package

cl-data-structures.utils.

Source

arrays.lisp.

Function: key-parameters-start-at (lambda-list)
Package

cl-data-structures.algorithms.meta.

Source

macros.lisp.

Function: lz (register)
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: make-adjusted-tree (structure position new-shift ownership-tag)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: make-aggregator (&key pass extract cleanup)
Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Function: make-approximated-histogram-bin (&key value count)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Function: make-assoc-skip-list-node (&key pointers content value)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: make-changes (&key content parent end-index unique)
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Function: make-children-vector (container &rest initial-content)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: make-content-vector (container &rest initial-content)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: make-hamt-range-stack-cell (&key start end node)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: make-hash-dict-content (operation container location value hash all)
Package

cl-data-structures.dicts.hamt.

Source

internal.lisp.

Function: make-hash-node (&key node-mask content ownership-tag)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: make-hash-node-tagged (&key ownership-tag node-mask content)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: make-hash-node-untagged (&key node-mask content)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: make-mutable-of-size (size tag arguments)
Package

cl-data-structures.sequences.rrb-vector.

Source

api.lisp.

Function: make-node-from-tail (rrb-container ownership-tag)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: make-partitions (container seeds-indexes data)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: make-qp-trie-node-tagged (&key ownership-tag bitmask content)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: make-qp-trie-node-untagged (&key bitmask content)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: make-range-from-root (container)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Function: make-range-from-tail (container)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Function: make-ranges (container contents)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: make-reservoir-sampling* (&key result w skip-count)
Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Function: make-skip-list-node* (assoc &rest initargs)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Function: make-sparse-rrb-node-tagged (&key ownership-tag content bitmask)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: make-sparse-rrb-node-untagged (&key content bitmask)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: make-srrb-range-stack-cell (&key start end depth upper-bits is-tail container node-content node-bitmask)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Function: make-tagged-struct-node (&key ownership-tag)
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Function: minhash-corpus-minhash (corpus elements)
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Function: move-updated (vector position)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-top-k.lisp.

Function: mutable-from-traversable (traversable arguments)
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Function: mutable-from-traversable (traversable tag arguments)
Package

cl-data-structures.sequences.rrb-vector.

Source

api.lisp.

Function: mutual-information-hash-table (field fields)
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Function: new-cell (old-cell start end half-byte &optional leaf)
Package

cl-data-structures.sets.qp-trie.

Source

api.lisp.

Function: new-register (rank sig)
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: next-index (j length)
Package

cl-data-structures.utils.

Source

arrays.lisp.

Function: node-children-full-p (container node)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: node-full-p (container node)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: node-head (node)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: not-greater (times depth)
Package

cl-data-structures.file-system.

Source

find.lisp.

Function: obtain-value (pull push)
Package

cl-data-structures.sets.qp-trie.

Source

api.lisp.

Function: obtain-value (pull push)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Function: partition-if-consume-implementation (collected key on-first test value)
Package

cl-data-structures.algorithms.

Source

partition-if.lisp.

Function: partition-points (length split-points-count)

How to divide vector into equal partitions?

Package

cl-data-structures.math.

Source

mutual-information.lisp.

Function: peek-or-consume (current latches)
Package

cl-data-structures.algorithms.

Source

latch.lisp.

Function: position-to-value (position)
Package

cl-data-structures.common.egnat.

Source

methods.lisp.

Function: push-content (node container operation item additional-arguments)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: push-into-copy-of-tail (rrb-container ownership-tag element)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: push-into-tail! (rrb-container element)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: qp-trie-leaf-present-p (node index)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-contains-leafs-p (node)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-index (node index)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-insert-new-node! (node index new-node)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-mark-leaf! (node index)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-size (node)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Reader: qp-trie-node-tagged-bitmask (instance)
Writer: (setf qp-trie-node-tagged-bitmask) (instance)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Target Slot

bitmask.

Reader: qp-trie-node-tagged-content (instance)
Writer: (setf qp-trie-node-tagged-content) (instance)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Target Slot

content.

Function: qp-trie-node-tagged-ownership-tag (instance)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: (setf qp-trie-node-tagged-ownership-tag) (instance)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: qp-trie-node-tagged-p (object)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Reader: qp-trie-node-untagged-bitmask (instance)
Writer: (setf qp-trie-node-untagged-bitmask) (instance)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Target Slot

bitmask.

Reader: qp-trie-node-untagged-content (instance)
Writer: (setf qp-trie-node-untagged-content) (instance)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Target Slot

content.

Function: qp-trie-node-untagged-p (object)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: quasi-clone-other-class (instance class initarg initval)
Package

cl-data-structures.utils.

Source

cloning.lisp.

Function: random-float ()
Package

cl-data-structures.math.

Source

hmm.lisp.

Function: range-not-fully-read (range)
Package

cl-data-structures.adapters.

Source

vector.lisp.

Function: read-implementation (stack obtain-value)
Package

cl-data-structures.common.

Source

ranges.lisp.

Function: read-new-value ()
Package

cl-data-structures.utils.

Source

macros.lisp.

Function: read-stream (object)
Package

cl-data-structures.file-system.

Source

common.lisp.

Function: recursive-egnat-grow! (node container operation item additional-arguments)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: reg-sum-and-zeroes (registers)
Package

cl-data-structures.streaming-algorithms.hyperloglog.

Source

hyperloglog.lisp.

Function: regex-matches (regex path)
Package

cl-data-structures.file-system.

Source

find.lisp.

Function: replica-of-seen (&rest arguments)
Package

cl-data-structures.algorithms.

Source

distinct.lisp.

Function: reservoir-sampling-p (object)
Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Function: reservoir-sampling-sample-size (reservoir-sampling)
Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Reader: reservoir-sampling-skip-count (instance)
Writer: (setf reservoir-sampling-skip-count) (instance)
Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Target Slot

skip-count.

Reader: reservoir-sampling-w (instance)
Writer: (setf reservoir-sampling-w) (instance)
Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Target Slot

w.

Function: reset-ownership-tag (object)
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Function: round-size (size)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: rrb-node-deep-copy (node ownership-tag)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: rrb-node-pop! (node position)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: rrb-node-pop-in-the-copy (node position ownership-tag)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: sample-position (table row)
Package

cl-data-structures.math.

Source

hmm.lisp.

Function: select-best-seeds (container data &optional start parallel)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: select-seeds (branching-factor end &optional start)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: separate-operations/arguments (operations)
Package

cl-data-structures.composite.

Source

implementation.lisp.

Function: set-in-node-mask (node position bit)
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Function: set-in-tail (structure operation container offset value all)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: set-in-tail! (structure operation container offset value all)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: shrink-handle-tail! (structure position final-status last-node-size last-node-mask new-last-node)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: shrink-tree (operation structure container position all)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: shrink-tree! (operation structure container position all)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: skip-list-node-p (object)
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Reader: sparse-rrb-node-tagged-bitmask (instance)
Writer: (setf sparse-rrb-node-tagged-bitmask) (instance)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Target Slot

bitmask.

Reader: sparse-rrb-node-tagged-content (instance)
Writer: (setf sparse-rrb-node-tagged-content) (instance)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Target Slot

content.

Function: sparse-rrb-node-tagged-ownership-tag (instance)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: (setf sparse-rrb-node-tagged-ownership-tag) (instance)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: sparse-rrb-node-tagged-p (object)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Reader: sparse-rrb-node-untagged-bitmask (instance)
Writer: (setf sparse-rrb-node-untagged-bitmask) (instance)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Target Slot

bitmask.

Reader: sparse-rrb-node-untagged-content (instance)
Writer: (setf sparse-rrb-node-untagged-content) (instance)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Target Slot

content.

Function: sparse-rrb-node-untagged-p (object)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: split-byte (byte)
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Function: splitmix64 (state)
Package

cl-data-structures.utils.

Source

hashing.lisp.

Reader: srrb-range-stack-cell-container (instance)
Writer: (setf srrb-range-stack-cell-container) (instance)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Target Slot

container.

Reader: srrb-range-stack-cell-depth (instance)
Writer: (setf srrb-range-stack-cell-depth) (instance)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Target Slot

depth.

Reader: srrb-range-stack-cell-end (instance)
Writer: (setf srrb-range-stack-cell-end) (instance)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Target Slot

end.

Reader: srrb-range-stack-cell-is-tail (instance)
Writer: (setf srrb-range-stack-cell-is-tail) (instance)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Target Slot

is-tail.

Reader: srrb-range-stack-cell-node-bitmask (instance)
Writer: (setf srrb-range-stack-cell-node-bitmask) (instance)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Target Slot

node-bitmask.

Reader: srrb-range-stack-cell-node-content (instance)
Writer: (setf srrb-range-stack-cell-node-content) (instance)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Target Slot

node-content.

Function: srrb-range-stack-cell-p (object)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Reader: srrb-range-stack-cell-start (instance)
Writer: (setf srrb-range-stack-cell-start) (instance)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Target Slot

start.

Reader: srrb-range-stack-cell-upper-bits (instance)
Writer: (setf srrb-range-stack-cell-upper-bits) (instance)
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Target Slot

upper-bits.

Function: struct-accessor-name (type slot)
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Function: tagged-node-ownership-tag (node)
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Reader: tagged-struct-node-ownership-tag (instance)
Writer: (setf tagged-struct-node-ownership-tag) (instance)
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Target Slot

ownership-tag.

Function: tagged-struct-node-p (object)
Package

cl-data-structures.common.abstract.

Source

common.lisp.

Function: tail-copy (tail element-type)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: tail-offset (size)
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Function: times-matches (times depth)
Package

cl-data-structures.file-system.

Source

find.lisp.

Function: to-pathname (x &rest args)
Package

cl-data-structures.file-system.

Source

find.lisp.

Function: transactional-grow-tree! (operation structure container position all value)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: transactional-shrink-handle-tail! (structure position final-status last-node-size last-node-mask new-last-node)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: transactional-shrink-tree! (operation structure container position all)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: tree-index-bound (tree shift)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: unmerge-pathnames (pathspec default)

Removes those leading directory components from PATHSPEC that are shared with DEFAULT.

Package

cl-data-structures.file-system.

Source

find.lisp.

Function: unset-in-tail (operation structure container offset all)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: unset-in-tail! (operation structure container offset all)
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Function: update-count-min-sketch (location data-sketch &optional count)
Package

cl-data-structures.streaming-algorithms.

Source

approximated-counts.lisp.

Function: update-ranges! (container node item closest-index)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: validation-form (parameters-list argument-name field-name)
Package

cl-data-structures.

Source

field.lisp.

Function: visit-every-bucket (function parent &optional stack)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Function: xoshiro256** (state)
Package

cl-data-structures.utils.

Source

hashing.lisp.


6.2.4 Generic functions

Generic Reader: access-arguments-closure (object)
Package

cl-data-structures.

Methods
Reader Method: access-arguments-closure ((expression expression))

automatically generated reader method

Source

expression-wrapper.lisp.

Target Slot

%arguments-closure.

Generic Writer: (setf access-arguments-closure) (object)
Package

cl-data-structures.

Methods
Writer Method: (setf access-arguments-closure) ((expression expression))

automatically generated writer method

Source

expression-wrapper.lisp.

Target Slot

%arguments-closure.

Generic Reader: access-begin (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: access-begin ((hash-table-range hash-table-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%begin.

Generic Writer: (setf access-begin) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf access-begin) ((hash-table-range hash-table-range))

automatically generated writer method

Source

common.lisp.

Target Slot

%begin.

Generic Reader: access-bins (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: access-bins ((approximated-histogram approximated-histogram))

automatically generated reader method

Source

approximated-histogram.lisp.

Target Slot

%bins.

Generic Writer: (setf access-bins) (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Writer Method: (setf access-bins) ((approximated-histogram approximated-histogram))

automatically generated writer method

Source

approximated-histogram.lisp.

Target Slot

%bins.

Generic Reader: access-close-range (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: access-close-range ((egnat-subtree egnat-subtree))

automatically generated reader method

Source

classes.lisp.

Target Slot

%close-range.

Generic Writer: (setf access-close-range) (object)
Package

cl-data-structures.common.egnat.

Methods
Writer Method: (setf access-close-range) ((egnat-subtree egnat-subtree))

automatically generated writer method

Source

classes.lisp.

Target Slot

%close-range.

Generic Reader: access-closure (object)
Package

cl-data-structures.

Methods
Reader Method: access-closure ((expression expression))

automatically generated reader method

Source

expression-wrapper.lisp.

Target Slot

%closure.

Generic Writer: (setf access-closure) (object)
Package

cl-data-structures.

Methods
Writer Method: (setf access-closure) ((expression expression))

automatically generated writer method

Source

expression-wrapper.lisp.

Target Slot

%closure.

Generic Reader: access-collected (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: access-collected ((forward-partition-if-proxy forward-partition-if-proxy))

automatically generated reader method

Source

partition-if.lisp.

Target Slot

%collected.

Generic Writer: (setf access-collected) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf access-collected) ((forward-partition-if-proxy forward-partition-if-proxy))

automatically generated writer method

Source

partition-if.lisp.

Target Slot

%collected.

Generic Reader: access-container (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Reader Method: access-container ((2-3-queue-range 2-3-queue-range))

automatically generated reader method

Source

api.lisp.

Target Slot

%container.

Generic Writer: (setf access-container) (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Writer Method: (setf access-container) ((2-3-queue-range 2-3-queue-range))

automatically generated writer method

Source

api.lisp.

Target Slot

%container.

Generic Reader: access-container (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: access-container ((rrb-range rrb-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%container.

Generic Writer: (setf access-container) (object)
Package

cl-data-structures.common.rrb.

Methods
Writer Method: (setf access-container) ((rrb-range rrb-range))

automatically generated writer method

Source

common.lisp.

Target Slot

%container.

Generic Reader: access-content (object)
Package

cl-data-structures.adapters.

Methods
Reader Method: access-content ((list-range list-range))

automatically generated reader method

Source

list.lisp.

Target Slot

%content.

Generic Writer: (setf access-content) (object)
Package

cl-data-structures.adapters.

Methods
Writer Method: (setf access-content) ((list-range list-range))

automatically generated writer method

Source

list.lisp.

Target Slot

%content.

Generic Reader: access-count (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: access-count ((approximated-histogram approximated-histogram))

automatically generated reader method

Source

approximated-histogram.lisp.

Target Slot

%count.

Generic Writer: (setf access-count) (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Writer Method: (setf access-count) ((approximated-histogram approximated-histogram))

automatically generated writer method

Source

approximated-histogram.lisp.

Target Slot

%count.

Generic Reader: access-count (object)
Package

cl-data-structures.math.

Methods
Reader Method: access-count ((moving-average-range moving-average-range))

automatically generated reader method

Source

moving-average.lisp.

Target Slot

%count.

Generic Writer: (setf access-count) (object)
Package

cl-data-structures.math.

Methods
Writer Method: (setf access-count) ((moving-average-range moving-average-range))

automatically generated writer method

Source

moving-average.lisp.

Target Slot

%count.

Generic Reader: access-counters (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: access-counters ((bloom-filter bloom-filter))

automatically generated reader method

Source

bloom-filter.lisp.

Target Slot

%counters.

Reader Method: access-counters ((approximated-counts approximated-counts))

automatically generated reader method

Source

approximated-counts.lisp.

Target Slot

%counters.

Generic Writer: (setf access-counters) (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Writer Method: (setf access-counters) ((bloom-filter bloom-filter))

automatically generated writer method

Source

bloom-filter.lisp.

Target Slot

%counters.

Writer Method: (setf access-counters) ((approximated-counts approximated-counts))

automatically generated writer method

Source

approximated-counts.lisp.

Target Slot

%counters.

Generic Reader: access-current (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: access-current ((abstract-sliding-window-proxy abstract-sliding-window-proxy))

automatically generated reader method

Source

sliding-window.lisp.

Target Slot

%current.

Reader Method: access-current ((flatten-proxy flatten-proxy))

automatically generated reader method

Source

flatten-lists.lisp.

Target Slot

%current.

Reader Method: access-current ((multiplex-proxy multiplex-proxy))

automatically generated reader method

Source

multiplex.lisp.

Target Slot

%current.

Generic Writer: (setf access-current) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf access-current) ((abstract-sliding-window-proxy abstract-sliding-window-proxy))

automatically generated writer method

Source

sliding-window.lisp.

Target Slot

%current.

Writer Method: (setf access-current) ((flatten-proxy flatten-proxy))

automatically generated writer method

Source

flatten-lists.lisp.

Target Slot

%current.

Writer Method: (setf access-current) ((multiplex-proxy multiplex-proxy))

automatically generated writer method

Source

multiplex.lisp.

Target Slot

%current.

Generic Reader: access-current-index (object)
Package

cl-data-structures.common.

Methods
Reader Method: access-current-index ((sequence-window sequence-window))

automatically generated reader method

Source

sequence-window.lisp.

Target Slot

%current-index.

Generic Writer: (setf access-current-index) (object)
Package

cl-data-structures.common.

Methods
Writer Method: (setf access-current-index) ((sequence-window sequence-window))

automatically generated writer method

Source

sequence-window.lisp.

Target Slot

%current-index.

Generic Reader: access-current-node (object)
Package

cl-data-structures.common.skip-list.

Methods
Reader Method: access-current-node ((fundamental-skip-list-range fundamental-skip-list-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%current-node.

Generic Writer: (setf access-current-node) (object)
Package

cl-data-structures.common.skip-list.

Methods
Writer Method: (setf access-current-node) ((fundamental-skip-list-range fundamental-skip-list-range))

automatically generated writer method

Source

common.lisp.

Target Slot

%current-node.

Generic Reader: access-depth (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: access-depth ((bloom-filter bloom-filter))

automatically generated reader method

Source

bloom-filter.lisp.

Target Slot

%depth.

Reader Method: access-depth ((approximated-counts approximated-counts))

automatically generated reader method

Source

approximated-counts.lisp.

Target Slot

%depth.

Generic Writer: (setf access-depth) (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Writer Method: (setf access-depth) ((bloom-filter bloom-filter))

automatically generated writer method

Source

bloom-filter.lisp.

Target Slot

%depth.

Writer Method: (setf access-depth) ((approximated-counts approximated-counts))

automatically generated writer method

Source

approximated-counts.lisp.

Target Slot

%depth.

Generic Reader: access-distant-range (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: access-distant-range ((egnat-subtree egnat-subtree))

automatically generated reader method

Source

classes.lisp.

Target Slot

%distant-range.

Generic Writer: (setf access-distant-range) (object)
Package

cl-data-structures.common.egnat.

Methods
Writer Method: (setf access-distant-range) ((egnat-subtree egnat-subtree))

automatically generated writer method

Source

classes.lisp.

Target Slot

%distant-range.

Generic Reader: access-eager-status (object)
Package

cl-data-structures.common.

Methods
Reader Method: access-eager-status ((lazy-modification-operation-status lazy-modification-operation-status))

automatically generated reader method

Source

lazy-box.lisp.

Target Slot

%eager-status.

Generic Writer: (setf access-eager-status) (object)
Package

cl-data-structures.common.

Methods
Writer Method: (setf access-eager-status) ((lazy-modification-operation-status lazy-modification-operation-status))

automatically generated writer method

Source

lazy-box.lisp.

Target Slot

%eager-status.

Generic Reader: access-end (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: access-end ((hash-table-range hash-table-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%end.

Generic Writer: (setf access-end) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf access-end) ((hash-table-range hash-table-range))

automatically generated writer method

Source

common.lisp.

Target Slot

%end.

Generic Reader: access-fill-pointer (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: access-fill-pointer ((approximated-histogram approximated-histogram))

automatically generated reader method

Source

approximated-histogram.lisp.

Target Slot

%fill-pointer.

Generic Writer: (setf access-fill-pointer) (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Writer Method: (setf access-fill-pointer) ((approximated-histogram approximated-histogram))

automatically generated writer method

Source

approximated-histogram.lisp.

Target Slot

%fill-pointer.

Generic Reader: access-finished-closure (object)
Package

cl-data-structures.

Methods
Reader Method: access-finished-closure ((expression expression))

automatically generated reader method

Source

expression-wrapper.lisp.

Target Slot

%finished-closure.

Generic Writer: (setf access-finished-closure) (object)
Package

cl-data-structures.

Methods
Writer Method: (setf access-finished-closure) ((expression expression))

automatically generated writer method

Source

expression-wrapper.lisp.

Target Slot

%finished-closure.

Generic Reader: access-forward-stack (object)
Package

cl-data-structures.common.

Methods
Reader Method: access-forward-stack ((forward-tree-range forward-tree-range))

automatically generated reader method

Source

ranges.lisp.

Target Slot

%forward-stack.

Generic Writer: (setf access-forward-stack) (object)
Package

cl-data-structures.common.

Methods
Writer Method: (setf access-forward-stack) ((forward-tree-range forward-tree-range))

automatically generated writer method

Source

ranges.lisp.

Target Slot

%forward-stack.

Generic Reader: access-hash-fn (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: access-hash-fn ((fundamental-data-sketch fundamental-data-sketch))

automatically generated reader method

Source

common.lisp.

Target Slot

%hash-fn.

Generic Writer: (setf access-hash-fn) (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Writer Method: (setf access-hash-fn) ((fundamental-data-sketch fundamental-data-sketch))

automatically generated writer method

Source

common.lisp.

Target Slot

%hash-fn.

Generic Reader: access-hashes (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: access-hashes ((bloom-filter bloom-filter))

automatically generated reader method

Source

bloom-filter.lisp.

Target Slot

%hashes.

Reader Method: access-hashes ((approximated-counts approximated-counts))

automatically generated reader method

Source

approximated-counts.lisp.

Target Slot

%hashes.

Generic Writer: (setf access-hashes) (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Writer Method: (setf access-hashes) ((bloom-filter bloom-filter))

automatically generated writer method

Source

bloom-filter.lisp.

Target Slot

%hashes.

Writer Method: (setf access-hashes) ((approximated-counts approximated-counts))

automatically generated writer method

Source

approximated-counts.lisp.

Target Slot

%hashes.

Generic Reader: access-head (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Reader Method: access-head ((2-3-queue 2-3-queue))

automatically generated reader method

Source

api.lisp.

Target Slot

%head.

Generic Writer: (setf access-head) (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Writer Method: (setf access-head) ((2-3-queue 2-3-queue))

automatically generated writer method

Source

api.lisp.

Target Slot

%head.

Generic Reader: access-head-position (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Reader Method: access-head-position ((2-3-queue 2-3-queue))

automatically generated reader method

Source

api.lisp.

Target Slot

%head-position.

Generic Writer: (setf access-head-position) (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Writer Method: (setf access-head-position) ((2-3-queue 2-3-queue))

automatically generated writer method

Source

api.lisp.

Target Slot

%head-position.

Generic Reader: access-index (object)
Package

cl-data-structures.utils.

Methods
Reader Method: access-index ((future-carousel future-carousel))

automatically generated reader method

Source

parallel-tools.lisp.

Target Slot

%index.

Generic Writer: (setf access-index) (object)
Package

cl-data-structures.utils.

Methods
Writer Method: (setf access-index) ((future-carousel future-carousel))

automatically generated writer method

Source

parallel-tools.lisp.

Target Slot

%index.

Generic Reader: access-index (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: access-index ((shuffled-range shuffled-range))

automatically generated reader method

Source

shuffled-range.lisp.

Target Slot

%index.

Generic Writer: (setf access-index) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf access-index) ((shuffled-range shuffled-range))

automatically generated writer method

Source

shuffled-range.lisp.

Target Slot

%index.

Generic Reader: access-initial-state (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: access-initial-state ((stateful-file-range-stack-cell stateful-file-range-stack-cell))

automatically generated reader method

Source

find.lisp.

Target Slot

%initial-state.

Generic Writer: (setf access-initial-state) (object)
Package

cl-data-structures.file-system.

Methods
Writer Method: (setf access-initial-state) ((stateful-file-range-stack-cell stateful-file-range-stack-cell))

automatically generated writer method

Source

find.lisp.

Target Slot

%initial-state.

Generic Reader: access-initial-to (object)
Package

cl-data-structures.common.

Methods
Reader Method: access-initial-to ((sequence-window sequence-window))

automatically generated reader method

Source

sequence-window.lisp.

Target Slot

%initial-to.

Generic Writer: (setf access-initial-to) (object)
Package

cl-data-structures.common.

Methods
Writer Method: (setf access-initial-to) ((sequence-window sequence-window))

automatically generated writer method

Source

sequence-window.lisp.

Target Slot

%initial-to.

Generic Reader: access-lines-read (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: access-lines-read ((line-by-line-range line-by-line-range))

automatically generated reader method

Source

line-by-line.lisp.

Target Slot

%lines-read.

Generic Writer: (setf access-lines-read) (object)
Package

cl-data-structures.file-system.

Methods
Writer Method: (setf access-lines-read) ((line-by-line-range line-by-line-range))

automatically generated writer method

Source

line-by-line.lisp.

Target Slot

%lines-read.

Generic Reader: access-lower-bound (object)
Package

cl-data-structures.adapters.

Methods
Reader Method: access-lower-bound ((vector-range vector-range))

automatically generated reader method

Source

vector.lisp.

Target Slot

%lower-bound.

Generic Writer: (setf access-lower-bound) (object)
Package

cl-data-structures.adapters.

Methods
Writer Method: (setf access-lower-bound) ((vector-range vector-range))

automatically generated writer method

Source

vector.lisp.

Target Slot

%lower-bound.

Generic Reader: access-max (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: access-max ((approximated-histogram approximated-histogram))

automatically generated reader method

Source

approximated-histogram.lisp.

Target Slot

%max.

Generic Writer: (setf access-max) (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Writer Method: (setf access-max) ((approximated-histogram approximated-histogram))

automatically generated writer method

Source

approximated-histogram.lisp.

Target Slot

%max.

Generic Reader: access-min (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: access-min ((approximated-histogram approximated-histogram))

automatically generated reader method

Source

approximated-histogram.lisp.

Target Slot

%min.

Generic Writer: (setf access-min) (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Writer Method: (setf access-min) ((approximated-histogram approximated-histogram))

automatically generated writer method

Source

approximated-histogram.lisp.

Target Slot

%min.

Generic Reader: access-og-container (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Reader Method: access-og-container ((2-3-queue-range 2-3-queue-range))

automatically generated reader method

Source

api.lisp.

Target Slot

%og-container.

Generic Writer: (setf access-og-container) (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Writer Method: (setf access-og-container) ((2-3-queue-range 2-3-queue-range))

automatically generated writer method

Source

api.lisp.

Target Slot

%og-container.

Generic Reader: access-operations (object)
Package

cl-data-structures.common.

Methods
Reader Method: access-operations ((lazy-box-container lazy-box-container))

automatically generated reader method

Source

lazy-box.lisp.

Target Slot

%operations.

Generic Writer: (setf access-operations) (object)
Package

cl-data-structures.common.

Methods
Writer Method: (setf access-operations) ((lazy-box-container lazy-box-container))

automatically generated writer method

Source

lazy-box.lisp.

Target Slot

%operations.

Generic Reader: access-position (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: access-position ((repeat-proxy repeat-proxy))

automatically generated reader method

Source

repeat.lisp.

Target Slot

%position.

Reader Method: access-position ((restrain-size-proxy restrain-size-proxy))

automatically generated reader method

Source

restrain-size.lisp.

Target Slot

%position.

Generic Writer: (setf access-position) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf access-position) ((repeat-proxy repeat-proxy))

automatically generated writer method

Source

repeat.lisp.

Target Slot

%position.

Writer Method: (setf access-position) ((restrain-size-proxy restrain-size-proxy))

automatically generated writer method

Source

restrain-size.lisp.

Target Slot

%position.

Generic Reader: access-prev-cell (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: access-prev-cell ((fundamental-file-range-stack-cell fundamental-file-range-stack-cell))

automatically generated reader method

Source

find.lisp.

Target Slot

%prev-cell.

Generic Function: (setf access-prev-cell) (object)
Package

cl-data-structures.file-system.

Methods
Method: (setf access-prev-cell) :before ((cell file-file-range-stack-cell))
Source

find.lisp.

Method: (setf access-prev-cell) :before ((cell regex-directory-file-range-stack-cell))
Source

find.lisp.

Method: (setf access-prev-cell) :before ((cell directory-file-range-stack-cell))
Source

find.lisp.

Method: (setf access-prev-cell) :before ((cell regex-directory-file-range-stack-cell))
Source

find.lisp.

Writer Method: (setf access-prev-cell) ((fundamental-file-range-stack-cell fundamental-file-range-stack-cell))

automatically generated writer method

Source

find.lisp.

Target Slot

%prev-cell.

Generic Reader: access-previous (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: access-previous ((only-different-proxy only-different-proxy))

automatically generated reader method

Source

only-different.lisp.

Target Slot

%previous.

Generic Writer: (setf access-previous) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf access-previous) ((only-different-proxy only-different-proxy))

automatically generated writer method

Source

only-different.lisp.

Target Slot

%previous.

Generic Reader: access-previous-bound (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: access-previous-bound ((only-different-proxy only-different-proxy))

automatically generated reader method

Source

only-different.lisp.

Target Slot

%previous-bound.

Generic Writer: (setf access-previous-bound) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf access-previous-bound) ((only-different-proxy only-different-proxy))

automatically generated writer method

Source

only-different.lisp.

Target Slot

%previous-bound.

Generic Reader: access-registers (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: access-registers ((approximated-set-cardinality approximated-set-cardinality))

automatically generated reader method

Source

approximated-set-cardinality.lisp.

Target Slot

%registers.

Generic Writer: (setf access-registers) (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Writer Method: (setf access-registers) ((approximated-set-cardinality approximated-set-cardinality))

automatically generated writer method

Source

approximated-set-cardinality.lisp.

Target Slot

%registers.

Generic Reader: access-split-point (object)
Package

cl-data-structures.math.

Methods
Reader Method: access-split-point ((split-point-field split-point-field))

automatically generated reader method

Source

mutual-information.lisp.

Target Slot

%split-point.

Generic Writer: (setf access-split-point) (object)
Package

cl-data-structures.math.

Methods
Writer Method: (setf access-split-point) ((split-point-field split-point-field))

automatically generated writer method

Source

mutual-information.lisp.

Target Slot

%split-point.

Generic Reader: access-stack (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: access-stack ((egnat-range egnat-range))

automatically generated reader method

Source

classes.lisp.

Target Slot

%stack.

Generic Writer: (setf access-stack) (object)
Package

cl-data-structures.common.egnat.

Methods
Writer Method: (setf access-stack) ((egnat-range egnat-range))

automatically generated writer method

Source

classes.lisp.

Target Slot

%stack.

Generic Reader: access-stack (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: access-stack ((find-range find-range))

automatically generated reader method

Source

find.lisp.

Target Slot

%stack.

Generic Writer: (setf access-stack) (object)
Package

cl-data-structures.file-system.

Methods
Writer Method: (setf access-stack) ((find-range find-range))

automatically generated writer method

Source

find.lisp.

Target Slot

%stack.

Generic Reader: access-state (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: access-state ((stateful-file-range-stack-cell stateful-file-range-stack-cell))

automatically generated reader method

Source

find.lisp.

Target Slot

%state.

Generic Writer: (setf access-state) (object)
Package

cl-data-structures.file-system.

Methods
Writer Method: (setf access-state) ((stateful-file-range-stack-cell stateful-file-range-stack-cell))

automatically generated writer method

Source

find.lisp.

Target Slot

%state.

Generic Reader: access-state (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: access-state ((cumulative-state cumulative-state))

automatically generated reader method

Source

cumulative-accumulate.lisp.

Target Slot

%state.

Generic Writer: (setf access-state) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf access-state) ((cumulative-state cumulative-state))

automatically generated writer method

Source

cumulative-accumulate.lisp.

Target Slot

%state.

Generic Reader: access-sum (object)
Package

cl-data-structures.math.

Methods
Reader Method: access-sum ((moving-average-range moving-average-range))

automatically generated reader method

Source

moving-average.lisp.

Target Slot

%sum.

Generic Writer: (setf access-sum) (object)
Package

cl-data-structures.math.

Methods
Writer Method: (setf access-sum) ((moving-average-range moving-average-range))

automatically generated writer method

Source

moving-average.lisp.

Target Slot

%sum.

Generic Reader: access-tail (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Reader Method: access-tail ((2-3-queue 2-3-queue))

automatically generated reader method

Source

api.lisp.

Target Slot

%tail.

Generic Writer: (setf access-tail) (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Writer Method: (setf access-tail) ((2-3-queue 2-3-queue))

automatically generated writer method

Source

api.lisp.

Target Slot

%tail.

Generic Reader: access-tail (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: access-tail ((abstract-sliding-window-proxy abstract-sliding-window-proxy))

automatically generated reader method

Source

sliding-window.lisp.

Target Slot

%tail.

Generic Writer: (setf access-tail) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf access-tail) ((abstract-sliding-window-proxy abstract-sliding-window-proxy))

automatically generated writer method

Source

sliding-window.lisp.

Target Slot

%tail.

Generic Reader: access-tail-end (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Reader Method: access-tail-end ((2-3-queue 2-3-queue))

automatically generated reader method

Source

api.lisp.

Target Slot

%tail-end.

Generic Writer: (setf access-tail-end) (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Writer Method: (setf access-tail-end) ((2-3-queue 2-3-queue))

automatically generated writer method

Source

api.lisp.

Target Slot

%tail-end.

Generic Reader: access-tail-position (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Reader Method: access-tail-position ((2-3-queue 2-3-queue))

automatically generated reader method

Source

api.lisp.

Target Slot

%tail-position.

Generic Writer: (setf access-tail-position) (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Writer Method: (setf access-tail-position) ((2-3-queue 2-3-queue))

automatically generated writer method

Source

api.lisp.

Target Slot

%tail-position.

Generic Reader: access-upper-bound (object)
Package

cl-data-structures.adapters.

Methods
Reader Method: access-upper-bound ((vector-range vector-range))

automatically generated reader method

Source

vector.lisp.

Target Slot

%upper-bound.

Generic Writer: (setf access-upper-bound) (object)
Package

cl-data-structures.adapters.

Methods
Writer Method: (setf access-upper-bound) ((vector-range vector-range))

automatically generated writer method

Source

vector.lisp.

Target Slot

%upper-bound.

Generic Reader: access-width (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: access-width ((bloom-filter bloom-filter))

automatically generated reader method

Source

bloom-filter.lisp.

Target Slot

%width.

Reader Method: access-width ((approximated-counts approximated-counts))

automatically generated reader method

Source

approximated-counts.lisp.

Target Slot

%width.

Generic Writer: (setf access-width) (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Writer Method: (setf access-width) ((bloom-filter bloom-filter))

automatically generated writer method

Source

bloom-filter.lisp.

Target Slot

%width.

Writer Method: (setf access-width) ((approximated-counts approximated-counts))

automatically generated writer method

Source

approximated-counts.lisp.

Target Slot

%width.

Generic Reader: access-window (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: access-window ((abstract-sliding-window-proxy abstract-sliding-window-proxy))

automatically generated reader method

Source

sliding-window.lisp.

Target Slot

%window.

Generic Writer: (setf access-window) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf access-window) ((abstract-sliding-window-proxy abstract-sliding-window-proxy))

automatically generated writer method

Source

sliding-window.lisp.

Target Slot

%window.

Generic Function: become-subtree* (container node)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Methods
Method: become-subtree* (container (node egnat-node))
Method: become-subtree* (container (node egnat-subtree))
Generic Function: clone-cell (cell)
Package

cl-data-structures.file-system.

Source

find.lisp.

Methods
Method: clone-cell ((cell fundamental-file-range-stack-cell))
Method: clone-cell ((cell regex-directory-file-range-stack-cell))
Method: clone-cell :around ((cell stateful-file-range-stack-cell))
Generic Function: compatiblep (first-sketch &rest more-sketches)
Package

cl-data-structures.streaming-algorithms.

Source

common.lisp.

Methods
Method: compatiblep ((first bloom-filter) &rest more)
Source

bloom-filter.lisp.

Method: compatiblep ((first approximated-counts) &rest more)
Source

approximated-counts.lisp.

Method: compatiblep ((first-sketch approximated-set-cardinality) &rest more-sketches)
Source

approximated-set-cardinality.lisp.

Method: compatiblep :around ((a fundamental-data-sketch) &rest more-sketches)
Generic Function: delete-back (node)
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Methods
Method: delete-back ((node 3-node))
Method: delete-back ((node 2-node))
Method: delete-back (node)
Generic Function: delete-back! (node)
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Methods
Method: delete-back! ((node 3-node))
Method: delete-back! ((node 2-node))
Method: delete-back! (node)
Generic Reader: depth (object)
Package

cl-data-structures.sets.qp-trie.

Methods
Reader Method: depth ((qp-trie-range-stack-cell qp-trie-range-stack-cell))

automatically generated reader method

Source

api.lisp.

Target Slot

%depth.

Generic Function: eat-cell (cell)
Package

cl-data-structures.file-system.

Source

find.lisp.

Methods
Method: eat-cell ((cell file-file-range-stack-cell))
Method: eat-cell ((cell regex-directory-file-range-stack-cell))
Method: eat-cell ((cell regex-file-file-range-stack-cell))
Method: eat-cell ((cell all-files-file-range-stack-cell))
Method: eat-cell ((cell recursive-content-file-range-stack-cell))
Method: eat-cell ((cell directory-file-range-stack-cell))
Generic Function: effective-at (window index)
Package

cl-data-structures.common.

Source

sequence-window.lisp.

Methods
Method: effective-at ((window vector-sequence-window) index)
Method: effective-at ((window random-access-sequence-window) index)
Method: effective-at ((window list-sequence-window) index)
Generic Reader: end (object)
Package

cl-data-structures.sets.qp-trie.

Methods
Reader Method: end ((qp-trie-set-range qp-trie-set-range))

automatically generated reader method

Source

api.lisp.

Target Slot

%end.

Generic Function: fundamental-range-class-of (range class)
Package

cl-data-structures.algorithms.

Source

common-range-category.lisp.

Methods
Method: fundamental-range-class-of ((range fundamental-forward-range) class)
Method: fundamental-range-class-of ((range fundamental-bidirectional-range) (class (eql cl-data-structures:fundamental-random-access-range)))
Method: fundamental-range-class-of ((range fundamental-bidirectional-range) (class (eql cl-data-structures:fundamental-bidirectional-range)))
Method: fundamental-range-class-of ((range fundamental-random-access-range) class)
Generic Function: grow (operation container list location hash value &rest all)
Package

cl-data-structures.dicts.hamt.

Source

internal.lisp.

Methods
Method: grow ((operation destructive-function) container (bucket list) location hash value &rest all)
Method: grow ((operation functional-function) container bucket location hash value &rest all)
Generic Reader: initial-stack (object)
Package

cl-data-structures.sets.qp-trie.

Methods
Reader Method: initial-stack ((qp-trie-set-range qp-trie-set-range))

automatically generated reader method

Source

api.lisp.

Target Slot

%initial-stack.

Generic Function: insert-front (node new)
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Methods
Method: insert-front ((node 3-node) new)
Method: insert-front ((node 2-node) new)
Method: insert-front (node item)
Generic Function: insert-front! (node new)
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Methods
Method: insert-front! ((node 3-node) new)
Method: insert-front! ((node 2-node) new)
Method: insert-front! (node item)
Generic Function: list-of-slots (symbol)
Package

cl-data-structures.utils.

Source

macros.lisp.

Methods
Method: list-of-slots ((class (eql cl-data-structures.streaming-algorithms::minhash-corpus)))
Source

minhash.lisp.

Method: list-of-slots ((class (eql cl-data-structures.algorithms::reservoir-sampling)))
Source

reservoir-sample.lisp.

Method: list-of-slots ((class (eql cl-data-structures.common.skip-list:fundamental-skip-list)))
Source

common.lisp.

Method: list-of-slots ((class (eql cl-data-structures.common.skip-list::assoc-skip-list-node)))
Source

common.lisp.

Method: list-of-slots ((class (eql cl-data-structures.common.skip-list:skip-list-node)))
Source

common.lisp.

Generic Reader: make-bucket-callbacks (object)
Package

cl-data-structures.composite.

Methods
Reader Method: make-bucket-callbacks ((composite-container composite-container))

automatically generated reader method

Source

implementation.lisp.

Target Slot

%make-bucket-callbacks.

Generic Function: make-stack-cell (name &key predicate path times &allow-other-keys)
Package

cl-data-structures.file-system.

Source

find.lisp.

Methods
Method: make-stack-cell ((name (eql :all-files)) &key predicate)
Method: make-stack-cell ((name (eql :all-directories)) &key path predicate)
Method: make-stack-cell ((name (eql :file)) &key path predicate)
Method: make-stack-cell ((name (eql :regex-file)) &key path predicate)
Method: make-stack-cell ((name (eql :regex-directory)) &key path times predicate)
Method: make-stack-cell ((name (eql :directory)) &key path predicate)
Generic Function: make-state (aggregation-function &rest all &key &allow-other-keys)

Arguments:
–AGGREGATION-FUNCTION, aggergation-function instance
–ALL, All key arguments passed to apply-aggregation-function.

Description:
Construct state of aggregation function. All key arguments passed to apply-aggregation-function are forwarded to make-state.

Returns:
Aggregation state. It will be passed to aggregate function where it can be mutated, and to state-result where effective function result can be obtained.

Affected by
Class of function.

See also:
–AGGREGATION-FUNCTION
–AGGREGATE
–STATE-RESULT

Notes:
–There is no fundamental class for state. Anything can be used as it as long as it is mutable object. Dispatch of state releated functions is performed on the function instance. –Specialization for this generic function is required for each aggregation-function.

Package

cl-data-structures.algorithms.meta.

Source

generics.lisp.

Generic Reader: maximal-bins-count (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: maximal-bins-count ((approximated-histogram approximated-histogram))

automatically generated reader method

Source

approximated-histogram.lisp.

Target Slot

%max-bins.

Generic Function: minhash-corpus-hash-value (corpus element)
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Methods
Method: minhash-corpus-hash-value ((corpus xors-callback-minhash) element)
Method: minhash-corpus-hash-value ((corpus seeds-callback-minhash) element)
Method: minhash-corpus-hash-value ((corpus polynomial-callback-minhash) element)
Method: minhash-corpus-hash-value ((corpus minhash-corpus) element)
Generic Reader: more-checks-end (object)
Package

cl-data-structures.sets.qp-trie.

Methods
Reader Method: more-checks-end ((qp-trie-range-stack-cell qp-trie-range-stack-cell))

automatically generated reader method

Source

api.lisp.

Target Slot

%more-checks-end.

Generic Reader: more-checks-start (object)
Package

cl-data-structures.sets.qp-trie.

Methods
Reader Method: more-checks-start ((qp-trie-range-stack-cell qp-trie-range-stack-cell))

automatically generated reader method

Source

api.lisp.

Target Slot

%more-checks-start.

Generic Function: next-elements (range stack)
Package

cl-data-structures.common.egnat.

Source

generics.lisp.

Methods
Method: next-elements ((range egnat-range) stack)
Method: next-elements ((range egnat-range-around) stack)
Generic Reader: node (object)
Package

cl-data-structures.sets.qp-trie.

Methods
Reader Method: node ((qp-trie-range-stack-cell qp-trie-range-stack-cell))

automatically generated reader method

Source

api.lisp.

Target Slot

%node.

Generic Function: on-each-proxy-range-from-range (range function key functor-constructor)
Package

cl-data-structures.algorithms.

Source

on-each.lisp.

Methods
Method: on-each-proxy-range-from-range ((range traversable) function key functor-constructor)
Method: on-each-proxy-range-from-range ((range fundamental-random-access-range) function key functor-constructor)
Method: on-each-proxy-range-from-range ((range fundamental-bidirectional-range) function key functor-constructor)
Generic Reader: parents (object)
Package

cl-data-structures.sets.qp-trie.

Methods
Reader Method: parents ((qp-trie-range-stack-cell qp-trie-range-stack-cell))

automatically generated reader method

Source

api.lisp.

Target Slot

%parents.

Generic Function: print-condition (object stream)
Package

cl-data-structures.

Source

conditions.lisp.

Methods
Method: print-condition ((condition invalid-value) stream)
Method: print-condition ((condition unexpected-argument) stream)
Method: print-condition ((condition argument-error) stream)
Method: print-condition ((condition not-in-allowed-set) stream)
Method: print-condition ((condition argument-value-out-of-bounds) stream)
Method: print-condition ((condition dimensionality-error) stream)
Method: print-condition ((condition file-releated-error) stream)
Method: print-condition ((condition initialization-error) stream)
Method: print-condition ((condition textual-error) stream)
Generic Reader: read-argument (condition)
Package

cl-data-structures.

Methods
Reader Method: read-argument ((condition argument-error))
Source

conditions.lisp.

Target Slot

%argument.

Generic Reader: read-batch-size (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-batch-size ((abstract-in-batches-proxy abstract-in-batches-proxy))

automatically generated reader method

Source

in-batches.lisp.

Target Slot

%batch-size.

Generic Reader: read-bindings (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-bindings ((establish-special-proxy establish-special-proxy))

automatically generated reader method

Source

establish-special.lisp.

Target Slot

%bindings.

Generic Reader: read-body (object)
Package

cl-data-structures.

Methods
Reader Method: read-body ((expression expression))

automatically generated reader method

Source

expression-wrapper.lisp.

Target Slot

%construct-function.

Generic Reader: read-branching-factor (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: read-branching-factor ((fundamental-egnat-container fundamental-egnat-container))

automatically generated reader method

Source

classes.lisp.

Target Slot

%branching-factor.

Generic Reader: read-bucket-size (object)
Package

cl-data-structures.common.hamt.

Methods
Reader Method: read-bucket-size ((hamt-container hamt-container))

automatically generated reader method

Source

common.lisp.

Target Slot

%bucket-size.

Generic Reader: read-callback (object)
Package

cl-data-structures.

Methods
Reader Method: read-callback ((delayed delayed))

automatically generated reader method

Source

delay.lisp.

Target Slot

%callback.

Generic Reader: read-capacity (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Reader Method: read-capacity ((fixed-capacity-synchronization-mixin fixed-capacity-synchronization-mixin))

automatically generated reader method

Source

api.lisp.

Target Slot

%capacity.

Generic Reader: read-changed (object)
Package

cl-data-structures.common.

Methods
Reader Method: read-changed ((implementation-modification-operation-status implementation-modification-operation-status))

automatically generated reader method

Source

modification-operation-status.lisp.

Target Slot

%changed.

Generic Reader: read-children (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: read-children ((egnat-subtree egnat-subtree))

automatically generated reader method

Source

classes.lisp.

Target Slot

%children.

Generic Reader: read-chunk-size (object)
Package

cl-data-structures.

Methods
Reader Method: read-chunk-size ((chunked-range chunked-range))

automatically generated reader method

Source

fundamental-classes.lisp.

Target Slot

%chunk-size.

Generic Reader: read-chunk-size (object)
Package

cl-data-structures.threads.

Methods
Reader Method: read-chunk-size ((buffer-range buffer-range))

automatically generated reader method

Source

buffer-range.lisp.

Target Slot

%chunk-size.

Reader Method: read-chunk-size ((parallel-on-each-proxy parallel-on-each-proxy))

automatically generated reader method

Source

parallel-on-each.lisp.

Target Slot

%chunk-size.

Reader Method: read-chunk-size ((parallel-group-by-proxy parallel-group-by-proxy))

automatically generated reader method

Source

parallel-group-by.lisp.

Target Slot

%chunk-size.

Reader Method: read-chunk-size ((parallel-forward-multiplex-proxy parallel-forward-multiplex-proxy))

automatically generated reader method

Source

parallel-multiplex.lisp.

Target Slot

%chunk-size.

Generic Reader: read-chunked-range (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-chunked-range ((chunked-proxy-range chunked-proxy-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%chunked-range.

Generic Reader: read-chunks (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-chunks ((partition-if-proxy partition-if-proxy))

automatically generated reader method

Source

partition-if.lisp.

Target Slot

%chunks.

Generic Reader: read-close-range (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: read-close-range ((egnat-subtree egnat-subtree))

automatically generated reader method

Source

classes.lisp.

Target Slot

%close-range.

Generic Reader: read-command-string (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: read-command-string ((command command))

automatically generated reader method

Source

unix.lisp.

Target Slot

%command-string.

Generic Reader: read-compare (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-compare ((bootstrap-proxy bootstrap-proxy))

automatically generated reader method

Source

bootstrap.lisp.

Target Slot

%compare.

Generic Reader: read-comparsion (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-comparsion ((only-different-proxy only-different-proxy))

automatically generated reader method

Source

only-different.lisp.

Target Slot

%comparsion.

Generic Reader: read-confidence (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-confidence ((bootstrap-proxy bootstrap-proxy))

automatically generated reader method

Source

bootstrap.lisp.

Target Slot

%confidence.

Generic Reader: read-container (object)
Package

cl-data-structures.common.

Methods
Reader Method: read-container ((forward-tree-range forward-tree-range))

automatically generated reader method

Source

ranges.lisp.

Target Slot

%container.

Reader Method: read-container ((lazy-range lazy-range))

automatically generated reader method

Source

lazy-range.lisp.

Target Slot

%container.

Generic Reader: read-container (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: read-container ((egnat-range egnat-range))

automatically generated reader method

Source

classes.lisp.

Target Slot

%container.

Generic Reader: read-content (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: read-content ((rrb-range rrb-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%content.

Generic Reader: read-content (object)
Package

cl-data-structures.common.

Methods
Reader Method: read-content ((sequence-window sequence-window))

automatically generated reader method

Source

sequence-window.lisp.

Target Slot

%content.

Generic Reader: read-content (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: read-content ((egnat-subtree egnat-subtree))

automatically generated reader method

Source

classes.lisp.

Target Slot

%content.

Reader Method: read-content ((egnat-node egnat-node))

automatically generated reader method

Source

classes.lisp.

Target Slot

%content.

Generic Reader: read-content (object)
Package

cl-data-structures.utils.

Methods
Reader Method: read-content ((half-matrix half-matrix))

automatically generated reader method

Source

distances.lisp.

Target Slot

%content.

Generic Reader: read-content (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-content ((forward-chain-of-ranges forward-chain-of-ranges))

automatically generated reader method

Source

chain.lisp.

Target Slot

%content.

Reader Method: read-content ((forward-cartesian-range forward-cartesian-range))

automatically generated reader method

Source

cartesian.lisp.

Target Slot

%content.

Generic Reader: read-content-count-in-node (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: read-content-count-in-node ((fundamental-egnat-container fundamental-egnat-container))

automatically generated reader method

Source

classes.lisp.

Target Slot

%content-count-in-node.

Generic Reader: read-context-function (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-context-function ((bootstrap-proxy bootstrap-proxy))

automatically generated reader method

Source

bootstrap.lisp.

Target Slot

%context-function.

Generic Reader: read-cumulative-key (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-cumulative-key ((cumulative-state cumulative-state))

automatically generated reader method

Source

cumulative-accumulate.lisp.

Target Slot

%cumulative-key.

Generic Reader: read-data (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-data ((info-field info-field))

automatically generated reader method

Source

mutual-information.lisp.

Target Slot

%data.

Generic Reader: read-discrete (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-discrete ((info-field info-field))

automatically generated reader method

Source

mutual-information.lisp.

Target Slot

%discrete.

Generic Reader: read-discrete-values-set (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-discrete-values-set ((split-point-field split-point-field))

automatically generated reader method

Source

mutual-information.lisp.

Target Slot

%discrete-values-set.

Generic Reader: read-distant-range (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: read-distant-range ((egnat-subtree egnat-subtree))

automatically generated reader method

Source

classes.lisp.

Target Slot

%distant-range.

Generic Reader: read-element-type (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Reader Method: read-element-type ((2-3-queue 2-3-queue))

automatically generated reader method

Source

api.lisp.

Target Slot

%element-type.

Generic Reader: read-end-on-empty (object)
Package

cl-data-structures.utils.

Methods
Reader Method: read-end-on-empty ((pipe-fragment pipe-fragment))

automatically generated reader method

Source

parallel-tools.lisp.

Target Slot

%end-on-empty.

Generic Reader: read-from (object)
Package

cl-data-structures.common.

Methods
Reader Method: read-from ((sequence-window sequence-window))

automatically generated reader method

Source

sequence-window.lisp.

Target Slot

%from.

Generic Reader: read-from (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-from ((shuffled-range shuffled-range))

automatically generated reader method

Source

shuffled-range.lisp.

Target Slot

%from.

Generic Reader: read-function (object)
Package

cl-data-structures.utils.

Methods
Reader Method: read-function ((future-carousel future-carousel))

automatically generated reader method

Source

parallel-tools.lisp.

Target Slot

%function.

Generic Reader: read-groups (object)
Package

cl-data-structures.threads.

Methods
Reader Method: read-groups ((parallel-group-by-proxy parallel-group-by-proxy))

automatically generated reader method

Source

parallel-group-by.lisp.

Target Slot

%groups.

Generic Reader: read-groups (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-groups ((group-by-proxy group-by-proxy))

automatically generated reader method

Source

group-by.lisp.

Target Slot

%groups.

Generic Reader: read-hash-array (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: read-hash-array ((polynomial-callback-minhash polynomial-callback-minhash))

automatically generated reader method

Source

minhash.lisp.

Target Slot

%hash-array.

Generic Reader: read-hash-function (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: read-hash-function ((callback-minhash callback-minhash))

automatically generated reader method

Source

minhash.lisp.

Target Slot

%hash-function.

Generic Reader: read-having (object)
Package

cl-data-structures.threads.

Methods
Reader Method: read-having ((parallel-group-by-proxy parallel-group-by-proxy))

automatically generated reader method

Source

parallel-group-by.lisp.

Target Slot

%having.

Generic Reader: read-having (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-having ((group-by-proxy group-by-proxy))

automatically generated reader method

Source

group-by.lisp.

Target Slot

%having.

Generic Reader: read-initial-begin (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-initial-begin ((hash-table-range hash-table-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%initial-begin.

Generic Reader: read-initial-count (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-initial-count ((moving-average-range moving-average-range))

automatically generated reader method

Source

moving-average.lisp.

Target Slot

%initial-count.

Generic Reader: read-initial-current (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-initial-current ((multiplex-proxy multiplex-proxy))

automatically generated reader method

Source

multiplex.lisp.

Target Slot

%initial-current.

Generic Reader: read-initial-current-node (object)
Package

cl-data-structures.common.skip-list.

Methods
Reader Method: read-initial-current-node ((fundamental-skip-list-range fundamental-skip-list-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%initial-current-node.

Generic Reader: read-initial-current-position (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-initial-current-position ((abstract-sliding-window-proxy abstract-sliding-window-proxy))

automatically generated reader method

Source

sliding-window.lisp.

Target Slot

%initial-current-position.

Generic Reader: read-initial-end (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-initial-end ((hash-table-range hash-table-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%initial-end.

Generic Reader: read-initial-lines-read (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: read-initial-lines-read ((line-by-line-range line-by-line-range))

automatically generated reader method

Source

line-by-line.lisp.

Target Slot

%initial-lines-read.

Generic Reader: read-initial-lower-bound (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: read-initial-lower-bound ((rrb-range rrb-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%initial-lower-bound.

Generic Reader: read-initial-lower-bound (object)
Package

cl-data-structures.adapters.

Methods
Reader Method: read-initial-lower-bound ((vector-range vector-range))

automatically generated reader method

Source

vector.lisp.

Target Slot

%initial-lower-bound.

Generic Reader: read-initial-position (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: read-initial-position ((file-range-mixin file-range-mixin))

automatically generated reader method

Source

common.lisp.

Target Slot

%initial-position.

Generic Reader: read-initial-position (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-initial-position ((repeat-proxy repeat-proxy))

automatically generated reader method

Source

repeat.lisp.

Target Slot

%initial-position.

Reader Method: read-initial-position ((restrain-size-proxy restrain-size-proxy))

automatically generated reader method

Source

restrain-size.lisp.

Target Slot

%initial-position.

Generic Reader: read-initial-previous (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-initial-previous ((only-different-proxy only-different-proxy))

automatically generated reader method

Source

only-different.lisp.

Target Slot

%initial-previous.

Generic Writer: (setf read-initial-previous) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf read-initial-previous) ((only-different-proxy only-different-proxy))

automatically generated writer method

Source

only-different.lisp.

Target Slot

%initial-previous.

Generic Reader: read-initial-previous-bound (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-initial-previous-bound ((only-different-proxy only-different-proxy))

automatically generated reader method

Source

only-different.lisp.

Target Slot

%initial-previous-bound.

Generic Writer: (setf read-initial-previous-bound) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf read-initial-previous-bound) ((only-different-proxy only-different-proxy))

automatically generated writer method

Source

only-different.lisp.

Target Slot

%initial-previous-bound.

Generic Reader: read-initial-stack (object)
Package

cl-data-structures.common.

Methods
Reader Method: read-initial-stack ((forward-tree-range forward-tree-range))

automatically generated reader method

Source

ranges.lisp.

Target Slot

%initial-stack.

Generic Reader: read-initial-stack (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: read-initial-stack ((egnat-range egnat-range))

automatically generated reader method

Source

classes.lisp.

Target Slot

%initial-stack.

Generic Reader: read-initial-state (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-initial-state ((cumulative-accumulate-range cumulative-accumulate-range))

automatically generated reader method

Source

cumulative-accumulate.lisp.

Target Slot

%initial-state.

Generic Reader: read-initial-sum (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-initial-sum ((moving-average-range moving-average-range))

automatically generated reader method

Source

moving-average.lisp.

Target Slot

%initial-sum.

Generic Reader: read-initial-upper-bound (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: read-initial-upper-bound ((rrb-range rrb-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%initial-upper-bound.

Generic Reader: read-initial-upper-bound (object)
Package

cl-data-structures.adapters.

Methods
Reader Method: read-initial-upper-bound ((vector-range vector-range))

automatically generated reader method

Source

vector.lisp.

Target Slot

%initial-upper-bound.

Generic Reader: read-initial-window (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-initial-window ((abstract-sliding-window-proxy abstract-sliding-window-proxy))

automatically generated reader method

Source

sliding-window.lisp.

Target Slot

%initial-window.

Generic Reader: read-k (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: read-k ((fundamental-minhash fundamental-minhash))

automatically generated reader method

Source

minhash.lisp.

Target Slot

%k.

Generic Reader: read-key (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-key ((moving-average-range moving-average-range))

automatically generated reader method

Source

moving-average.lisp.

Target Slot

%key.

Reader Method: read-key ((bootstrap-proxy bootstrap-proxy))

automatically generated reader method

Source

bootstrap.lisp.

Target Slot

%key.

Generic Reader: read-key (object)
Package

cl-data-structures.common.

Methods
Reader Method: read-key ((forward-tree-range forward-tree-range))

automatically generated reader method

Source

ranges.lisp.

Target Slot

%key.

Generic Reader: read-key (object)
Package

cl-data-structures.utils.

Methods
Reader Method: read-key ((half-matrix half-matrix))

automatically generated reader method

Source

distances.lisp.

Target Slot

%key.

Generic Reader: read-key (object)
Package

cl-data-structures.threads.

Methods
Reader Method: read-key ((parallel-group-by-proxy parallel-group-by-proxy))

automatically generated reader method

Source

parallel-group-by.lisp.

Target Slot

%key.

Generic Reader: read-last-node (object)
Package

cl-data-structures.common.skip-list.

Methods
Reader Method: read-last-node ((fundamental-skip-list-range fundamental-skip-list-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%last-node.

Generic Reader: read-latches (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-latches ((latch-proxy latch-proxy))

automatically generated reader method

Source

latch.lisp.

Target Slot

%latches.

Generic Writer: (setf read-latches) (object)
Package

cl-data-structures.algorithms.

Methods
Writer Method: (setf read-latches) ((latch-proxy latch-proxy))

automatically generated writer method

Source

latch.lisp.

Target Slot

%latches.

Generic Reader: read-lazy-instance (object)
Package

cl-data-structures.common.

Methods
Reader Method: read-lazy-instance ((lazy-modification-operation-status lazy-modification-operation-status))

automatically generated reader method

Source

lazy-box.lisp.

Target Slot

%lazy-instance.

Generic Reader: read-lock (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Reader Method: read-lock ((synchronization-primitives-mixin synchronization-primitives-mixin))

automatically generated reader method

Source

api.lisp.

Target Slot

%lock.

Generic Reader: read-max-bins (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: read-max-bins ((approximated-histogram approximated-histogram))

automatically generated reader method

Source

approximated-histogram.lisp.

Target Slot

%max-bins.

Generic Reader: read-maximum-queue-size (object)
Package

cl-data-structures.threads.

Methods
Reader Method: read-maximum-queue-size ((buffer-range buffer-range))

automatically generated reader method

Source

buffer-range.lisp.

Target Slot

%maximum-queue-size.

Reader Method: read-maximum-queue-size ((parallel-on-each-proxy parallel-on-each-proxy))

automatically generated reader method

Source

parallel-on-each.lisp.

Target Slot

%maximum-queue-size.

Reader Method: read-maximum-queue-size ((parallel-group-by-proxy parallel-group-by-proxy))

automatically generated reader method

Source

parallel-group-by.lisp.

Target Slot

%maximum-queue-size.

Reader Method: read-maximum-queue-size ((parallel-forward-multiplex-proxy parallel-forward-multiplex-proxy))

automatically generated reader method

Source

parallel-multiplex.lisp.

Target Slot

%maximum-queue-size.

Generic Reader: read-metric-fn (object)
Package

cl-data-structures.metric-space.

Methods
Reader Method: read-metric-fn ((metric-space-set metric-space-set))

automatically generated reader method

Source

trait-classes.lisp.

Target Slot

%metric-fn.

Generic Reader: read-metric-type (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: read-metric-type ((fundamental-egnat-container fundamental-egnat-container))

automatically generated reader method

Source

classes.lisp.

Target Slot

%metric-type.

Generic Reader: read-mutex (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Reader Method: read-mutex ((2-3-queue-range 2-3-queue-range))

automatically generated reader method

Source

api.lisp.

Target Slot

%mutex.

Generic Reader: read-mutex (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: read-mutex ((rrb-range rrb-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%mutex.

Generic Reader: read-name (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-name ((info-field info-field))

automatically generated reader method

Source

mutual-information.lisp.

Target Slot

%name.

Generic Reader: read-notify-pop (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Reader Method: read-notify-pop ((synchronization-primitives-mixin synchronization-primitives-mixin))

automatically generated reader method

Source

api.lisp.

Target Slot

%notify-pop.

Generic Reader: read-notify-push (object)
Package

cl-data-structures.queues.2-3-tree.

Methods
Reader Method: read-notify-push ((fixed-capacity-synchronization-mixin fixed-capacity-synchronization-mixin))

automatically generated reader method

Source

api.lisp.

Target Slot

%notify-push.

Generic Reader: read-obtain-value (object)
Package

cl-data-structures.common.

Methods
Reader Method: read-obtain-value ((forward-tree-range forward-tree-range))

automatically generated reader method

Source

ranges.lisp.

Target Slot

%obtain-value.

Generic Reader: read-offset (object)
Package

cl-data-structures.adapters.

Methods
Reader Method: read-offset ((offset-vector-range offset-vector-range))

automatically generated reader method

Source

vector.lisp.

Target Slot

%offset.

Generic Reader: read-on-first (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-on-first ((abstract-partition-if-proxy abstract-partition-if-proxy))

automatically generated reader method

Source

partition-if.lisp.

Target Slot

%on-first.

Generic Reader: read-operation (object)
Package

cl-data-structures.utils.

Methods
Reader Method: read-operation ((pipe-fragment pipe-fragment))

automatically generated reader method

Source

parallel-tools.lisp.

Target Slot

%operation.

Generic Reader: read-original-collected (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-original-collected ((forward-partition-if-proxy forward-partition-if-proxy))

automatically generated reader method

Source

partition-if.lisp.

Target Slot

%orginal-collected.

Generic Reader: read-original-content (object)
Package

cl-data-structures.adapters.

Methods
Reader Method: read-original-content ((list-range list-range))

automatically generated reader method

Source

list.lisp.

Target Slot

%original-content.

Generic Reader: read-original-content (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-original-content ((forward-chain-of-ranges forward-chain-of-ranges))

automatically generated reader method

Source

chain.lisp.

Target Slot

%original-content.

Generic Reader: read-original-data (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-original-data ((info-field info-field))

automatically generated reader method

Source

mutual-information.lisp.

Target Slot

%original-data.

Generic Reader: read-original-range (object)
Package

cl-data-structures.

Methods
Reader Method: read-original-range ((chunked-range chunked-range))

automatically generated reader method

Source

fundamental-classes.lisp.

Target Slot

%original-range.

Generic Reader: read-original-seen (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-original-seen ((distinct-proxy distinct-proxy))

automatically generated reader method

Source

distinct.lisp.

Target Slot

%original-seen.

Generic Reader: read-original-selector-function (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-original-selector-function ((split-point-field split-point-field))

automatically generated reader method

Source

mutual-information.lisp.

Target Slot

%original-selector-function.

Generic Reader: read-parallel (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-parallel ((bootstrap-proxy bootstrap-proxy))

automatically generated reader method

Source

bootstrap.lisp.

Target Slot

%parallel.

Generic Reader: read-predicate (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: read-predicate ((fundamental-file-range-stack-cell fundamental-file-range-stack-cell))

automatically generated reader method

Source

find.lisp.

Target Slot

%predicate.

Generic Reader: read-predicate (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-predicate ((only-proxy only-proxy))

automatically generated reader method

Source

only.lisp.

Target Slot

%predicate.

Reader Method: read-predicate ((without-proxy without-proxy))

automatically generated reader method

Source

without.lisp.

Target Slot

%predicate.

Generic Reader: read-queue (object)
Package

cl-data-structures.utils.

Methods
Reader Method: read-queue ((pipe-fragment pipe-fragment))

automatically generated reader method

Source

parallel-tools.lisp.

Target Slot

%queue.

Generic Reader: read-range (object)
Package

cl-data-structures.common.

Methods
Reader Method: read-range ((lazy-range lazy-range))

automatically generated reader method

Source

lazy-range.lisp.

Target Slot

%range.

Generic Reader: read-ranges (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-ranges ((forward-connecting-range forward-connecting-range))

automatically generated reader method

Source

zip.lisp.

Target Slot

%ranges.

Generic Reader: read-regex (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: read-regex ((tokenizing-range tokenizing-range))

automatically generated reader method

Source

tokenize.lisp.

Target Slot

%regex.

Generic Reader: read-result (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-result ((cumulative-state cumulative-state))

automatically generated reader method

Source

cumulative-accumulate.lisp.

Target Slot

%result.

Generic Reader: read-rrb-range (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: read-rrb-range ((chunked-rrb-range chunked-rrb-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%rrb-range.

Generic Reader: read-sample-size (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-sample-size ((bootstrap-proxy bootstrap-proxy))

automatically generated reader method

Source

bootstrap.lisp.

Target Slot

%sample-size.

Generic Reader: read-samples-count (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-samples-count ((bootstrap-proxy bootstrap-proxy))

automatically generated reader method

Source

bootstrap.lisp.

Target Slot

%samples-count.

Generic Reader: read-samples-count (object)
Package

cl-data-structures.common.egnat.

Methods
Reader Method: read-samples-count ((fundamental-egnat-container fundamental-egnat-container))

automatically generated reader method

Source

classes.lisp.

Target Slot

%samples-count.

Generic Reader: read-seeds (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: read-seeds ((seeds-callback-minhash seeds-callback-minhash))

automatically generated reader method

Source

minhash.lisp.

Target Slot

%seeds.

Generic Reader: read-seen (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-seen ((distinct-proxy distinct-proxy))

automatically generated reader method

Source

distinct.lisp.

Target Slot

%seen.

Generic Reader: read-selector-function (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-selector-function ((info-field info-field))

automatically generated reader method

Source

mutual-information.lisp.

Target Slot

%selector-function.

Generic Reader: read-sinks (object)
Package

cl-data-structures.utils.

Methods
Reader Method: read-sinks ((pipe-fragment pipe-fragment))

automatically generated reader method

Source

parallel-tools.lisp.

Target Slot

%sinks.

Generic Reader: read-sinks-lock (object)
Package

cl-data-structures.utils.

Methods
Reader Method: read-sinks-lock ((pipe-fragment pipe-fragment))

automatically generated reader method

Source

parallel-tools.lisp.

Target Slot

%sinks-lock.

Generic Reader: read-size (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-size ((restrain-size-proxy restrain-size-proxy))

automatically generated reader method

Source

restrain-size.lisp.

Target Slot

%size.

Generic Reader: read-split-point-count (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-split-point-count ((info-field info-field))

automatically generated reader method

Source

mutual-information.lisp.

Target Slot

%split-point-count.

Generic Reader: read-table (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: read-table ((minhash-corpus minhash-corpus))

automatically generated reader method

Source

minhash.lisp.

Target Slot

%table.

Generic Reader: read-table (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-table ((shuffled-range shuffled-range))

automatically generated reader method

Source

shuffled-range.lisp.

Target Slot

%table.

Generic Reader: read-test (object)
Package

cl-data-structures.math.

Methods
Reader Method: read-test ((info-field info-field))

automatically generated reader method

Source

mutual-information.lisp.

Target Slot

%test.

Generic Reader: read-test (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-test ((abstract-partition-if-proxy abstract-partition-if-proxy))

automatically generated reader method

Source

partition-if.lisp.

Target Slot

%test.

Generic Reader: read-thread (object)
Package

cl-data-structures.utils.

Methods
Reader Method: read-thread ((pipe-fragment pipe-fragment))

automatically generated reader method

Source

parallel-tools.lisp.

Target Slot

%thread.

Generic Reader: read-times (object)
Package

cl-data-structures.file-system.

Methods
Reader Method: read-times ((regex-directory-file-range-stack-cell regex-directory-file-range-stack-cell))

automatically generated reader method

Source

find.lisp.

Target Slot

%times.

Generic Reader: read-times (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-times ((repeat-proxy repeat-proxy))

automatically generated reader method

Source

repeat.lisp.

Target Slot

%times.

Generic Reader: read-to (object)
Package

cl-data-structures.common.

Methods
Reader Method: read-to ((sequence-window sequence-window))

automatically generated reader method

Source

sequence-window.lisp.

Target Slot

%to.

Generic Reader: read-to (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-to ((shuffled-range shuffled-range))

automatically generated reader method

Source

shuffled-range.lisp.

Target Slot

%to.

Generic Reader: read-transform (object)
Package

cl-data-structures.threads.

Methods
Reader Method: read-transform ((parallel-group-by-proxy parallel-group-by-proxy))

automatically generated reader method

Source

parallel-group-by.lisp.

Target Slot

%transform.

Generic Reader: read-transform (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-transform ((group-by-proxy group-by-proxy))

automatically generated reader method

Source

group-by.lisp.

Target Slot

%transform.

Generic Reader: read-vector (object)
Package

cl-data-structures.utils.

Methods
Reader Method: read-vector ((future-carousel future-carousel))

automatically generated reader method

Source

parallel-tools.lisp.

Target Slot

%vector.

Generic Reader: read-vector (object)
Package

cl-data-structures.adapters.

Methods
Reader Method: read-vector ((vector-range vector-range))

automatically generated reader method

Source

vector.lisp.

Target Slot

%vector.

Generic Reader: read-vectors-in-chunk (object)
Package

cl-data-structures.common.rrb.

Methods
Reader Method: read-vectors-in-chunk ((chunked-rrb-range chunked-rrb-range))

automatically generated reader method

Source

common.lisp.

Target Slot

%vectors-in-chunk.

Generic Reader: read-window-size (object)
Package

cl-data-structures.algorithms.

Methods
Reader Method: read-window-size ((abstract-sliding-window-proxy abstract-sliding-window-proxy))

automatically generated reader method

Source

sliding-window.lisp.

Target Slot

%window-size.

Generic Reader: read-xors (object)
Package

cl-data-structures.streaming-algorithms.

Methods
Reader Method: read-xors ((xors-callback-minhash xors-callback-minhash))

automatically generated reader method

Source

minhash.lisp.

Target Slot

%xors.

Generic Function: recursive-egnat-grow!* (node container operation item additional-arguments)
Package

cl-data-structures.common.egnat.

Source

common.lisp.

Methods
Method: recursive-egnat-grow!* ((node egnat-node) container operation item additional-arguments)
Method: recursive-egnat-grow!* ((node egnat-subtree) container operation item additional-arguments)
Method: recursive-egnat-grow!* ((node (eql nil)) container operation item additional-arguments)
Generic Function: reset-cell (cell)
Package

cl-data-structures.file-system.

Source

find.lisp.

Methods
Method: reset-cell ((cell fundamental-file-range-stack-cell))
Method: reset-cell ((cell stateful-file-range-stack-cell))
Generic Reader: root (object)
Package

cl-data-structures.composite.

Methods
Reader Method: root ((composite-container composite-container))

automatically generated reader method

Source

implementation.lisp.

Target Slot

%root.

Generic Writer: (setf root) (object)
Package

cl-data-structures.composite.

Methods
Writer Method: (setf root) ((composite-container composite-container))

automatically generated writer method

Source

implementation.lisp.

Target Slot

%root.

Generic Function: set-stream-position (range stream)
Package

cl-data-structures.file-system.

Source

common.lisp.

Methods
Method: set-stream-position ((range line-by-line-range) stream)
Source

line-by-line.lisp.

Method: set-stream-position ((range file-range-mixin) stream)
Generic Function: shrink (operation container list location hash &rest all)
Package

cl-data-structures.dicts.hamt.

Source

internal.lisp.

Methods
Method: shrink ((operation functional-function) container (bucket list) location hash &rest all)
Method: shrink ((operation destructive-function) container bucket location hash &rest all)
Generic Reader: stack (object)
Package

cl-data-structures.sets.qp-trie.

Methods
Reader Method: stack ((qp-trie-set-range qp-trie-set-range))

automatically generated reader method

Source

api.lisp.

Target Slot

%stack.

Generic Writer: (setf stack) (object)
Package

cl-data-structures.sets.qp-trie.

Methods
Writer Method: (setf stack) ((qp-trie-set-range qp-trie-set-range))

automatically generated writer method

Source

api.lisp.

Target Slot

%stack.

Generic Reader: start (object)
Package

cl-data-structures.sets.qp-trie.

Methods
Reader Method: start ((qp-trie-set-range qp-trie-set-range))

automatically generated reader method

Source

api.lisp.

Target Slot

%start.

Generic Function: take-back (node)
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Generic Function: transactional-delete-back! (node tag)
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Methods
Method: transactional-delete-back! ((node 3-node) tag)
Method: transactional-delete-back! ((node 2-node) tag)
Method: transactional-delete-back! (node tag)
Generic Function: transactional-insert-front! (node new tag)
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Methods
Method: transactional-insert-front! ((node 3-node) new tag)
Method: transactional-insert-front! ((node 2-node) new tag)
Method: transactional-insert-front! (node new tag)
Generic Function: validation-form-for (parameter-name argument-name field-name value-name value-found parameter-body)
Package

cl-data-structures.

Source

field.lisp.

Methods
Method: validation-form-for ((parameter-name (eql :type)) argument-name field-name value-name value-found body)
Method: validation-form-for ((parameter-name (eql :default)) argument-name field-name value-name value-found body)
Method: validation-form-for ((parameter-name (eql :member)) argument-name field-name value-name value-found body)
Method: validation-form-for ((parameter-name (eql :optional)) argument-name field-name value-name value-found body)
Generic Writer: write-changed (new-value object)
Package

cl-data-structures.common.

Methods
Writer Method: write-changed ((new-value implementation-modification-operation-status) implementation-modification-operation-status)

automatically generated writer method

Source

modification-operation-status.lisp.

Target Slot

%changed.

Generic Writer: write-found (new-value object)
Package

cl-data-structures.common.

Methods
Writer Method: write-found ((new-value implementation-modification-operation-status) implementation-modification-operation-status)

automatically generated writer method

Source

modification-operation-status.lisp.

Target Slot

%found.

Generic Writer: write-lazy-instance (new-value object)
Package

cl-data-structures.common.

Methods
Writer Method: write-lazy-instance ((new-value lazy-modification-operation-status) lazy-modification-operation-status)

automatically generated writer method

Source

lazy-box.lisp.

Target Slot

%lazy-instance.

Generic Writer: write-value (new-value object)
Package

cl-data-structures.common.

Methods
Writer Method: write-value ((new-value implementation-modification-operation-status) implementation-modification-operation-status)

automatically generated writer method

Source

modification-operation-status.lisp.

Target Slot

%value.


6.2.5 Structures

Structure: approximated-histogram-bin
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: value
Type

double-float

Initform

0.0d0

Readers

approximated-histogram-bin-value.

Writers

(setf approximated-histogram-bin-value).

Slot: count
Package

common-lisp.

Type

double-float

Initform

0.0d0

Readers

approximated-histogram-bin-count.

Writers

(setf approximated-histogram-bin-count).

Structure: assoc-skip-list-node
Package

cl-data-structures.common.skip-list.

Source

common.lisp.

Direct superclasses

skip-list-node.

Direct methods

print-object.

Direct slots
Slot: value
Readers

assoc-skip-list-node-value.

Writers

(setf assoc-skip-list-node-value).

Structure: changes
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: content
Type

vector

Initform

(serapeum:vect)

Readers

changes-content.

Writers

(setf changes-content).

Slot: parent
Type

(or cl-data-structures.common::changes null)

Readers

changes-parent.

Writers

(setf changes-parent).

Slot: end-index
Type

fixnum

Initform

1

Readers

changes-end-index.

Writers

(setf changes-end-index).

Slot: unique
Type

boolean

Initform

t

Readers

changes-unique.

Writers

(setf changes-unique).

Structure: hamt-range-stack-cell
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Direct superclasses

structure-object.

Direct methods

clone.

Direct slots
Slot: start
Type

alexandria:non-negative-fixnum

Initform

0

Readers

hamt-range-stack-cell-start.

Writers

(setf hamt-range-stack-cell-start).

Slot: end
Type

alexandria:non-negative-fixnum

Initform

0

Readers

hamt-range-stack-cell-end.

Writers

(setf hamt-range-stack-cell-end).

Slot: node
Readers

hamt-range-stack-cell-node.

Writers

(setf hamt-range-stack-cell-node).

Structure: hash-content
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Direct superclasses

structure-object.

Direct subclasses

hash-dict-content.

Direct slots
Slot: hash
Type

fixnum

Initform

0

Readers

hash-content-hash.

Writers

(setf hash-content-hash).

Slot: location
Readers

hash-content-location.

Writers

(setf hash-content-location).

Structure: hash-dict-content
Package

cl-data-structures.common.

Source

content-tuple.lisp.

Direct superclasses

hash-content.

Direct slots
Slot: value
Readers

hash-dict-content-value.

Writers

(setf hash-dict-content-value).

Structure: hash-node-tagged
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Direct superclasses

tagged-struct-node.

Direct slots
Slot: node-mask
Type

cl-data-structures.common.hamt::hash-mask

Initform

0

Readers

hash-node-tagged-node-mask.

Writers

(setf hash-node-tagged-node-mask).

Slot: content
Type

simple-array

Initform

#()

Readers

hash-node-tagged-content.

Writers

(setf hash-node-tagged-content).

Structure: hash-node-untagged
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: node-mask
Type

cl-data-structures.common.hamt::hash-mask

Initform

0

Readers

hash-node-untagged-node-mask.

Writers

(setf hash-node-untagged-node-mask).

Slot: content
Type

simple-array

Initform

#()

Readers

hash-node-untagged-content.

Writers

(setf hash-node-untagged-content).

Structure: qp-trie-node-tagged
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Direct superclasses

tagged-struct-node.

Direct slots
Slot: bitmask
Type

cl-data-structures.common.qp-trie::full-mask

Initform

0

Readers

qp-trie-node-tagged-bitmask.

Writers

(setf qp-trie-node-tagged-bitmask).

Slot: content
Type

simple-vector

Initform

(make-array 0 :element-type (quote cl-data-structures.common.qp-trie:qp-trie-node))

Readers

qp-trie-node-tagged-content.

Writers

(setf qp-trie-node-tagged-content).

Structure: qp-trie-node-untagged
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: bitmask
Type

cl-data-structures.common.qp-trie::full-mask

Initform

0

Readers

qp-trie-node-untagged-bitmask.

Writers

(setf qp-trie-node-untagged-bitmask).

Slot: content
Type

simple-vector

Initform

(make-array 0 :element-type (quote cl-data-structures.common.qp-trie:qp-trie-node))

Readers

qp-trie-node-untagged-content.

Writers

(setf qp-trie-node-untagged-content).

Structure: reservoir-sampling
Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: result
Readers

reservoir-sampling-result.

Writers

(setf reservoir-sampling-result).

Slot: w
Type

double-float

Initform

0.0d0

Readers

reservoir-sampling-w.

Writers

(setf reservoir-sampling-w).

Slot: skip-count
Type

fixnum

Initform

0

Readers

reservoir-sampling-skip-count.

Writers

(setf reservoir-sampling-skip-count).

Structure: srrb-range-stack-cell
Package

cl-data-structures.dicts.srrb.

Source

api.lisp.

Direct superclasses

structure-object.

Direct slots
Slot: start
Type

cl-data-structures.common.rrb:node-size

Initform

0

Readers

srrb-range-stack-cell-start.

Writers

(setf srrb-range-stack-cell-start).

Slot: end
Type

cl-data-structures.common.rrb:node-size

Initform

0

Readers

srrb-range-stack-cell-end.

Writers

(setf srrb-range-stack-cell-end).

Slot: depth
Type

alexandria:non-negative-fixnum

Initform

0

Readers

srrb-range-stack-cell-depth.

Writers

(setf srrb-range-stack-cell-depth).

Slot: upper-bits
Type

alexandria:non-negative-fixnum

Initform

0

Readers

srrb-range-stack-cell-upper-bits.

Writers

(setf srrb-range-stack-cell-upper-bits).

Slot: is-tail
Type

boolean

Readers

srrb-range-stack-cell-is-tail.

Writers

(setf srrb-range-stack-cell-is-tail).

Slot: container
Readers

srrb-range-stack-cell-container.

Writers

(setf srrb-range-stack-cell-container).

Slot: node-content
Readers

srrb-range-stack-cell-node-content.

Writers

(setf srrb-range-stack-cell-node-content).

Slot: node-bitmask
Readers

srrb-range-stack-cell-node-bitmask.

Writers

(setf srrb-range-stack-cell-node-bitmask).


6.2.6 Classes

Class: %summary-function
Package

cl-data-structures.algorithms.

Source

summary.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: 2-3-queue
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Direct superclasses

tree.

Direct subclasses
Direct methods
Direct slots
Slot: %element-type
Initform

t

Initargs

:element-type

Readers
Writers

This slot is read-only.

Slot: %head
Initargs

:head

Readers

access-head.

Writers

(setf access-head).

Slot: %head-position
Type

cl-data-structures.queues.2-3-tree::buffer-index

Initform

0

Initargs

:head-position

Readers

access-head-position.

Writers

(setf access-head-position).

Slot: %tail
Initargs

:tail

Readers

access-tail.

Writers

(setf access-tail).

Slot: %tail-position
Type

cl-data-structures.queues.2-3-tree::buffer-index

Initform

0

Initargs

:tail-position

Readers

access-tail-position.

Writers

(setf access-tail-position).

Slot: %tail-end
Type

cl-data-structures.queues.2-3-tree::buffer-index

Initform

0

Initargs

:tail-end

Readers

access-tail-end.

Writers

(setf access-tail-end).

Class: 2-3-queue-range
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Direct superclasses

fundamental-forward-range.

Direct methods
Direct slots
Slot: %mutex
Initform

(bordeaux-threads:make-lock)

Readers

read-mutex.

Writers

This slot is read-only.

Slot: %og-container
Initargs

:og-container

Readers

access-og-container.

Writers

(setf access-og-container).

Slot: %container
Initargs

:container

Readers

access-container.

Writers

(setf access-container).

Class: absolute-value-norm-function
Package

cl-data-structures.math.

Source

absolute-value-norm.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: abstract-in-batches-proxy
Package

cl-data-structures.algorithms.

Source

in-batches.lisp.

Direct subclasses
Direct methods
Direct slots
Slot: %batch-size
Initargs

:batch-size

Readers

read-batch-size.

Writers

This slot is read-only.

Class: abstract-partition-if-proxy
Package

cl-data-structures.algorithms.

Source

partition-if.lisp.

Direct superclasses

proxy-range.

Direct subclasses

forward-abstract-partition-if-proxy.

Direct methods
Direct slots
Slot: %key
Package

cl-data-structures.algorithms.meta.

Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Slot: %on-first
Initargs

:on-first

Readers

read-on-first.

Writers

This slot is read-only.

Slot: %test
Initargs

:test

Readers

read-test.

Writers

This slot is read-only.

Class: abstract-sliding-window-proxy
Package

cl-data-structures.algorithms.

Source

sliding-window.lisp.

Direct subclasses

forward-sliding-window-proxy.

Direct methods
Direct Default Initargs
InitargValue
:initial-current-position0
Direct slots
Slot: %window-size
Initargs

:window-size

Readers

read-window-size.

Writers

This slot is read-only.

Slot: %initial-window
Initargs

:initial-window

Readers

read-initial-window.

Writers

This slot is read-only.

Slot: %initial-current-position
Initargs

:initial-current-position

Readers

read-initial-current-position.

Writers

This slot is read-only.

Slot: %window
Initargs

:window

Readers

access-window.

Writers

(setf access-window).

Slot: %tail
Initargs

:tail

Readers

access-tail.

Writers

(setf access-tail).

Slot: %current
Initargs

:current

Readers

access-current.

Writers

(setf access-current).

Class: accumulate-function
Package

cl-data-structures.algorithms.

Source

accumulate.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: all-files-file-range-stack-cell
Package

cl-data-structures.file-system.

Source

find.lisp.

Direct superclasses
Direct methods
Class: approximated-counts-function
Package

cl-data-structures.streaming-algorithms.

Source

approximated-counts.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: approximated-histogram-function
Package

cl-data-structures.streaming-algorithms.

Source

approximated-histogram.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: approximated-set-cardinality-function
Package

cl-data-structures.streaming-algorithms.

Source

approximated-set-cardinality.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: approximated-top-k-function
Package

cl-data-structures.streaming-algorithms.

Source

approximated-top-k.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: array-average-function
Package

cl-data-structures.math.

Source

average.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: array-elementwise-forward-proxy
Package

cl-data-structures.algorithms.

Source

array-elementwise.lisp.

Direct superclasses

forward-proxy-range.

Direct methods

aggregator-constructor.

Class: array-elementwise-function
Package

cl-data-structures.algorithms.

Source

array-elementwise.lisp.

Direct superclasses

layer-function.

Direct methods
Class: array-geometric-average-function
Package

cl-data-structures.math.

Source

average.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: array-harmonic-average-function
Package

cl-data-structures.math.

Source

average.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: array-sum-function
Package

cl-data-structures.math.

Source

sum.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: average-function
Package

cl-data-structures.math.

Source

average.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: bidirectional-bootstrap-proxy
Package

cl-data-structures.math.

Source

bootstrap.lisp.

Direct superclasses
Class: bidirectional-buffer-range
Package

cl-data-structures.threads.

Source

buffer-range.lisp.

Direct superclasses
Class: bidirectional-connecting-range
Package

cl-data-structures.algorithms.

Source

zip.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: bidirectional-establish-special-proxy-range
Package

cl-data-structures.algorithms.

Source

establish-special.lisp.

Direct superclasses
Class: bidirectional-filtering-proxy
Package

cl-data-structures.algorithms.

Source

filtering.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: bidirectional-group-by-proxy
Package

cl-data-structures.algorithms.

Source

group-by.lisp.

Direct superclasses
Direct subclasses

random-access-group-by-proxy.

Class: bidirectional-in-batches-proxy
Package

cl-data-structures.algorithms.

Source

in-batches.lisp.

Direct superclasses
Class: bidirectional-only-proxy
Package

cl-data-structures.algorithms.

Source

only.lisp.

Direct superclasses
Class: bidirectional-parallel-group-by-proxy
Package

cl-data-structures.threads.

Source

parallel-group-by.lisp.

Direct superclasses
Direct subclasses

random-access-parallel-group-by-proxy.

Class: bidirectional-proxy-box-range
Package

cl-data-structures.algorithms.

Source

on-each.lisp.

Direct superclasses
Direct subclasses

random-access-proxy-box-range.

Direct methods
Class: bidirectional-with-previous-element-proxy
Package

cl-data-structures.algorithms.

Source

with-previous-element.lisp.

Direct superclasses
Class: bidirectional-without-proxy
Package

cl-data-structures.algorithms.

Source

without.lisp.

Direct superclasses
Class: bidirectional-zipped-ranges
Package

cl-data-structures.algorithms.

Source

zip.lisp.

Direct superclasses
Class: bloom-filter-function
Package

cl-data-structures.streaming-algorithms.

Source

bloom-filter.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: bootstrap-function
Package

cl-data-structures.math.

Source

bootstrap.lisp.

Direct superclasses

layer-function.

Direct methods
Class: bootstrap-proxy
Package

cl-data-structures.math.

Source

bootstrap.lisp.

Direct superclasses

proxy-range.

Direct subclasses
Direct methods
Direct slots
Slot: %sample-size
Initargs

:sample-size

Readers

read-sample-size.

Writers

This slot is read-only.

Slot: %key
Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Slot: %compare
Initargs

:compare

Readers

read-compare.

Writers

This slot is read-only.

Slot: %confidence
Initargs

:confidence

Readers

read-confidence.

Writers

This slot is read-only.

Slot: %parallel
Initargs

:parallel

Readers

read-parallel.

Writers

This slot is read-only.

Slot: %context-function
Initargs

:context-function

Readers

read-context-function.

Writers

This slot is read-only.

Slot: %samples-count
Initargs

:samples-count

Readers

read-samples-count.

Writers

This slot is read-only.

Class: box-container
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Direct superclasses

fundamental-container.

Direct subclasses

lazy-box-container.

Direct methods
Direct slots
Slot: %content
Type

cl-data-structures.common::fundamental-container

Initargs

:content

Readers

access-content.

Writers

(setf access-content).

Class: buffer-range
Package

cl-data-structures.threads.

Source

buffer-range.lisp.

Direct superclasses

proxy-range.

Direct subclasses
Direct methods
Direct slots
Slot: %maximum-queue-size
Initargs

:maximum-queue-size

Readers

read-maximum-queue-size.

Writers

This slot is read-only.

Slot: %chunk-size
Initargs

:chunk-size

Readers

read-chunk-size.

Writers

This slot is read-only.

Class: callback-minhash
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Direct superclasses

fundamental-minhash.

Direct subclasses
Direct methods
Direct slots
Slot: %hash-function
Initargs

:hash-function

Readers

read-hash-function.

Writers

This slot is read-only.

Class: chunkable-bidirectional-connecting-range
Package

cl-data-structures.algorithms.

Source

zip.lisp.

Direct superclasses
Class: chunkable-forward-connecting-range
Package

cl-data-structures.algorithms.

Source

zip.lisp.

Direct superclasses
Class: chunkable-random-access-connecting-range
Package

cl-data-structures.algorithms.

Source

zip.lisp.

Direct superclasses
Class: chunked-proxy-range
Package

cl-data-structures.algorithms.

Source

common.lisp.

Direct superclasses
Direct subclasses

forward-proxy-box-range.

Direct methods
Direct slots
Slot: %chunked-range
Initargs

:chunked-range

Readers

read-chunked-range.

Writers

This slot is read-only.

Class: chunked-rrb-range
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Direct superclasses

fundamental-forward-range.

Direct methods
Direct slots
Slot: %vectors-in-chunk
Initargs

:vectors-in-chunk

Readers

read-vectors-in-chunk.

Writers

This slot is read-only.

Slot: %rrb-range
Initargs

:rrb-range

Readers

read-rrb-range.

Writers

This slot is read-only.

Class: co-occurence-table-function
Package

cl-data-structures.math.

Source

co-occurence-table.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: composite-container
Package

cl-data-structures.composite.

Source

implementation.lisp.

Direct subclasses
Direct methods
Direct slots
Slot: %root
Initargs

:root

Readers

root.

Writers

(setf root).

Slot: %make-bucket-callbacks
Initargs

:make-bucket-callbacks

Readers

make-bucket-callbacks.

Writers

This slot is read-only.

Class: cumulative-accumulate-function
Package

cl-data-structures.algorithms.

Source

cumulative-accumulate.lisp.

Direct superclasses

layer-function.

Direct methods
Class: cumulative-state
Package

cl-data-structures.algorithms.

Source

cumulative-accumulate.lisp.

Direct subclasses

cumulative-accumulate-range.

Direct methods
Direct slots
Slot: %state
Initargs

:state

Readers

access-state.

Writers

(setf access-state).

Slot: %result
Initargs

:result

Readers

read-result.

Writers

This slot is read-only.

Slot: %function
Initargs

:function

Readers

read-function.

Writers

This slot is read-only.

Slot: %cumulative-key
Initargs

:cumulative-key

Readers

read-cumulative-key.

Writers

This slot is read-only.

Class: directory-file-range-stack-cell
Package

cl-data-structures.file-system.

Source

find.lisp.

Direct superclasses

fundamental-file-range-stack-cell.

Direct subclasses
Direct methods
Class: distinct-function
Package

cl-data-structures.algorithms.

Source

distinct.lisp.

Direct superclasses

layer-function.

Direct methods
Class: distinct-proxy
Package

cl-data-structures.algorithms.

Source

distinct.lisp.

Direct superclasses

proxy-range.

Direct subclasses

forward-distinct-proxy.

Direct methods
Direct slots
Slot: %key
Package

cl-data-structures.algorithms.meta.

Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Slot: %seen
Initargs

:seen

Readers

read-seen.

Writers

This slot is read-only.

Slot: %original-seen
Initargs

:original-seen

Readers

read-original-seen.

Writers

This slot is read-only.

Class: egnat-node
Package

cl-data-structures.common.egnat.

Source

classes.lisp.

Direct methods
Direct slots
Slot: %content
Initargs

:content

Readers

read-content.

Writers

This slot is read-only.

Class: egnat-range
Package

cl-data-structures.common.egnat.

Source

classes.lisp.

Direct superclasses

fundamental-forward-range.

Direct subclasses

egnat-range-around.

Direct methods
Direct slots
Slot: %stack
Initform

(quote nil)

Initargs

:stack

Readers

access-stack.

Writers

(setf access-stack).

Slot: %initial-stack
Initargs

:stack

Readers

read-initial-stack.

Writers

This slot is read-only.

Slot: %container
Initargs

:container

Readers

read-container.

Writers

This slot is read-only.

Class: egnat-range-around
Package

cl-data-structures.common.egnat.

Source

classes.lisp.

Direct superclasses

egnat-range.

Direct methods
Direct slots
Slot: %near
Initargs

:near

Readers

read-near.

Writers

This slot is read-only.

Slot: %margin
Initargs

:margin

Readers

read-margin.

Writers

This slot is read-only.

Class: egnat-subtree
Package

cl-data-structures.common.egnat.

Source

classes.lisp.

Direct methods
Direct slots
Slot: %content
Initargs

:content

Readers

read-content.

Writers

This slot is read-only.

Slot: %close-range
Initargs

:close-range

Readers
Writers

(setf access-close-range).

Slot: %distant-range
Initargs

:distant-range

Readers
Writers

(setf access-distant-range).

Slot: %children
Type

vector

Initform

#()

Initargs

:children

Readers

read-children.

Writers

This slot is read-only.

Class: entropy-function
Package

cl-data-structures.math.

Source

entropy.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: enumerate-function
Package

cl-data-structures.algorithms.

Source

enumerate.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: establish-special-function
Package

cl-data-structures.algorithms.

Source

establish-special.lisp.

Direct superclasses

layer-function.

Direct methods
Class: establish-special-proxy
Package

cl-data-structures.algorithms.

Source

establish-special.lisp.

Direct subclasses
Direct methods
Direct slots
Slot: %key
Package

cl-data-structures.algorithms.meta.

Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Slot: %bindings
Initargs

:bindings

Readers

read-bindings.

Writers

This slot is read-only.

Class: extrema-function
Package

cl-data-structures.algorithms.

Source

extrema.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: extremum-function
Package

cl-data-structures.algorithms.

Source

extremum.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: fast-map-function
Package

cl-data-structures.math.

Source

fast-map.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: file-file-range-stack-cell
Package

cl-data-structures.file-system.

Source

find.lisp.

Direct superclasses

fundamental-file-range-stack-cell.

Direct subclasses
Direct methods
Class: find-range
Package

cl-data-structures.file-system.

Source

find.lisp.

Direct superclasses
Direct methods
Direct slots
Slot: %stack
Initargs

:stack

Readers

access-stack.

Writers

(setf access-stack).

Class: first-element-function
Package

cl-data-structures.algorithms.

Source

first-element.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: fixed-capacity-synchronization-mixin
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Direct superclasses

synchronization-primitives-mixin.

Direct subclasses
Direct methods
Direct slots
Slot: %capacity
Initargs

:capacity

Readers

read-capacity.

Writers

This slot is read-only.

Slot: %notify-push
Initform

(bordeaux-threads:make-condition-variable)

Readers

read-notify-push.

Writers

This slot is read-only.

Class: flatten-lists-function
Package

cl-data-structures.algorithms.

Source

flatten-lists.lisp.

Direct superclasses

layer-function.

Direct methods

apply-layer.

Class: flatten-proxy
Package

cl-data-structures.algorithms.

Source

flatten-lists.lisp.

Direct superclasses
Direct subclasses

forward-flatten-proxy.

Direct methods
Direct slots
Slot: %key
Package

cl-data-structures.algorithms.meta.

Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Slot: %current
Initargs

:current

Readers

access-current.

Writers

(setf access-current).

Class: forward-abstract-partition-if-proxy
Package

cl-data-structures.algorithms.

Source

partition-if.lisp.

Direct superclasses
Direct subclasses

forward-partition-if-proxy.

Class: forward-bootstrap-proxy
Package

cl-data-structures.math.

Source

bootstrap.lisp.

Direct superclasses
Class: forward-buffer-range
Package

cl-data-structures.threads.

Source

buffer-range.lisp.

Direct superclasses
Class: forward-cartesian-range
Package

cl-data-structures.algorithms.

Source

cartesian.lisp.

Direct superclasses
Direct methods
Direct slots
Slot: %content
Type

vector

Initargs

:content

Readers

read-content.

Writers

This slot is read-only.

Slot: %function
Type

function

Initargs

:function

Readers

read-function.

Writers

This slot is read-only.

Class: forward-connecting-range
Package

cl-data-structures.algorithms.

Source

zip.lisp.

Direct superclasses

fundamental-forward-range.

Direct subclasses
Direct methods
Direct slots
Slot: %ranges
Initargs

:ranges

Readers

read-ranges.

Writers

This slot is read-only.

Class: forward-distinct-proxy
Package

cl-data-structures.algorithms.

Source

distinct.lisp.

Direct superclasses
Direct methods
Class: forward-establish-special-proxy-range
Package

cl-data-structures.algorithms.

Source

establish-special.lisp.

Direct superclasses
Direct methods
Class: forward-filtering-proxy
Package

cl-data-structures.algorithms.

Source

filtering.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: forward-flatten-proxy
Package

cl-data-structures.algorithms.

Source

flatten-lists.lisp.

Direct superclasses
Direct methods
Class: forward-group-by-proxy
Package

cl-data-structures.algorithms.

Source

group-by.lisp.

Direct superclasses
Direct subclasses

bidirectional-group-by-proxy.

Class: forward-in-batches-proxy
Package

cl-data-structures.algorithms.

Source

in-batches.lisp.

Direct superclasses
Class: forward-latch-proxy
Package

cl-data-structures.algorithms.

Source

latch.lisp.

Direct superclasses
Direct methods
Class: forward-only-different-proxy
Package

cl-data-structures.algorithms.

Source

only-different.lisp.

Direct superclasses
Direct methods

wrap-chunk.

Class: forward-only-proxy
Package

cl-data-structures.algorithms.

Source

only.lisp.

Direct superclasses
Direct subclasses

bidirectional-only-proxy.

Direct methods

wrap-chunk.

Class: forward-parallel-group-by-proxy
Package

cl-data-structures.threads.

Source

parallel-group-by.lisp.

Direct superclasses
Direct subclasses

bidirectional-parallel-group-by-proxy.

Class: forward-partition-if-proxy
Package

cl-data-structures.algorithms.

Source

partition-if.lisp.

Direct superclasses
Direct methods
Direct Default Initargs
InitargValue
:collected(make-functional-rrb-vector)
Direct slots
Slot: %collected
Initargs

:collected

Readers

access-collected.

Writers

(setf access-collected).

Slot: %orginal-collected
Initargs

:collected

Readers

read-original-collected.

Writers

This slot is read-only.

Class: forward-repeat-proxy
Package

cl-data-structures.algorithms.

Source

repeat.lisp.

Direct superclasses
Class: forward-restrain-size-proxy
Package

cl-data-structures.algorithms.

Source

restrain-size.lisp.

Direct superclasses
Class: forward-sliding-window-proxy
Package

cl-data-structures.algorithms.

Source

sliding-window.lisp.

Direct superclasses
Class: forward-with-previous-element-proxy
Package

cl-data-structures.algorithms.

Source

with-previous-element.lisp.

Direct superclasses
Class: forward-without-proxy
Package

cl-data-structures.algorithms.

Source

without.lisp.

Direct superclasses
Direct subclasses

bidirectional-without-proxy.

Class: forward-zipped-ranges
Package

cl-data-structures.algorithms.

Source

zip.lisp.

Direct superclasses
Class: frequency-function
Package

cl-data-structures.algorithms.

Source

frequency.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: functional-composite-container
Package

cl-data-structures.composite.

Source

implementation.lisp.

Direct superclasses

composite-container.

Direct methods

alter-bucket.

Class: fundamental-assiganable-range
Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct superclasses

fundamental-range.

Direct subclasses
Class: fundamental-assignable-bidirectional-range
Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct superclasses
Class: fundamental-assignable-random-access-range
Package

cl-data-structures.

Source

fundamental-classes.lisp.

Direct superclasses
Class: fundamental-file-range-stack-cell
Package

cl-data-structures.file-system.

Source

find.lisp.

Direct subclasses
Direct methods
Direct slots
Slot: %prev-cell
Type

(or null cl-data-structures.file-system::fundamental-file-range-stack-cell)

Initargs

:prev-cell

Readers

access-prev-cell.

Writers

(setf access-prev-cell).

Slot: %predicate
Type

function

Initform

(constantly t)

Initargs

:predicate

Readers

read-predicate.

Writers

This slot is read-only.

Slot: %path
Type

(or nil string pathname)

Initargs

:path

Readers

read-path.

Writers

This slot is read-only.

Class: fundamental-minhash
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Direct subclasses
Direct methods
Direct slots
Slot: %k
Initargs

:k

Readers

read-k.

Writers

This slot is read-only.

Class: fundamental-sparse-rrb-vector
Package

cl-data-structures.dicts.srrb.

Source

types.lisp.

Direct superclasses

fundamental-sparse-vector.

Direct subclasses
Direct methods
Direct slots
Slot: %tree
Initform

cl-data-structures.meta:null-bucket

Initargs

:tree

Readers

access-tree.

Writers

(setf access-tree).

Slot: %tail
Initargs

:tail

Readers

access-tail.

Writers

(setf access-tail).

Slot: %tail-mask
Initform

0

Initargs

:tail-mask

Readers

access-tail-mask.

Writers

(setf access-tail-mask).

Slot: %shift
Initform

0

Initargs

:shift

Readers

access-shift.

Writers

(setf access-shift).

Slot: %tree-size
Initform

0

Initargs

:tree-size

Readers

access-tree-size.

Writers

(setf access-tree-size).

Slot: %tree-index-bound
Initform

0

Initargs

:tree-index-bound

Readers

access-tree-index-bound.

Writers

(setf access-tree-index-bound).

Slot: %index-bound
Initform

cl-data-structures.common.rrb:+maximum-children-count+

Initargs

:index-bound

Readers

access-index-bound.

Writers

(setf access-index-bound).

Slot: %element-type
Initform

t

Initargs

:element-type

Readers
Writers

This slot is read-only.

Class: gather-corpus-function
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: geometric-average-function
Package

cl-data-structures.math.

Source

average.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: gini-impurity-function
Package

cl-data-structures.math.

Source

gini-impurity.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: group-by-proxy
Package

cl-data-structures.algorithms.

Source

group-by.lisp.

Direct superclasses

proxy-range.

Direct subclasses

forward-group-by-proxy.

Direct methods
Direct slots
Slot: %groups
Type

hash-table

Initargs

:groups

Readers

read-groups.

Writers

This slot is read-only.

Slot: %having
Initargs

:having

Readers

read-having.

Writers

This slot is read-only.

Slot: %transform
Initargs

:transform

Readers

read-transform.

Writers

This slot is read-only.

Slot: %key
Package

cl-data-structures.algorithms.meta.

Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Class: harmonic-average-function
Package

cl-data-structures.math.

Source

average.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: harmonic-average-mutual-information-function
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: hash-table-elementwise-forward-proxy
Package

cl-data-structures.algorithms.

Source

hash-table-elementwise.lisp.

Direct superclasses

forward-proxy-range.

Direct methods

aggregator-constructor.

Class: hash-table-elementwise-function
Package

cl-data-structures.algorithms.

Source

hash-table-elementwise.lisp.

Direct superclasses

layer-function.

Direct methods
Class: hodges-lehmann-estimator-function
Package

cl-data-structures.math.

Source

hodges-lehmann.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: implementation-modification-operation-status
Package

cl-data-structures.common.

Source

modification-operation-status.lisp.

Direct superclasses

fundamental-modification-operation-status.

Direct subclasses

eager-modification-operation-status.

Direct methods
Direct slots
Slot: %value
Initargs

:value

Readers
Writers

write-value.

Slot: %changed
Initargs

:changed

Readers
Writers

write-changed.

Slot: %found
Initargs

:found

Readers
Writers

write-found.

Class: in-batches-function
Package

cl-data-structures.algorithms.

Source

in-batches.lisp.

Direct superclasses

layer-function.

Direct methods
Class: info-field
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Direct subclasses

split-point-field.

Direct methods
Direct slots
Slot: %name
Initargs

:name

Readers

read-name.

Writers

This slot is read-only.

Slot: %data
Initargs

:data

Readers

read-data.

Writers

This slot is read-only.

Slot: %original-data
Initargs

:original-data

Readers

read-original-data.

Writers

This slot is read-only.

Slot: %discrete
Initargs

:discrete

Readers

read-discrete.

Writers

This slot is read-only.

Slot: %split-point-count
Initargs

:split-point-count

Readers

read-split-point-count.

Writers

This slot is read-only.

Slot: %test
Initargs

:test

Readers

read-test.

Writers

This slot is read-only.

Slot: %selector-function
Initform

(function identity)

Initargs

:selector-function

Readers

read-selector-function.

Writers

This slot is read-only.

Class: last-element-function
Package

cl-data-structures.algorithms.

Source

first-element.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: latch-function
Package

cl-data-structures.algorithms.

Source

latch.lisp.

Direct superclasses

layer-function.

Direct methods

apply-layer.

Class: latch-proxy
Package

cl-data-structures.algorithms.

Source

latch.lisp.

Direct superclasses
Direct subclasses

forward-latch-proxy.

Direct methods
Direct slots
Slot: %latches
Initargs

:latches

Readers

read-latches.

Writers

(setf read-latches).

Class: lazy-box-dictionary
Package

cl-data-structures.dicts.

Source

common.lisp.

Direct superclasses
Direct methods
Class: lazy-box-sequence
Package

cl-data-structures.sequences.

Source

common.lisp.

Direct superclasses
Direct methods
Class: lazy-forward-range
Package

cl-data-structures.common.

Source

lazy-range.lisp.

Direct superclasses
Direct subclasses

lazy-bidirectional-range.

Direct methods
Class: lazy-modification-operation-status
Package

cl-data-structures.common.

Source

lazy-box.lisp.

Direct superclasses

fundamental-modification-operation-status.

Direct methods
Direct slots
Slot: %eager-status
Type

cl-data-structures.common:eager-modification-operation-status

Initargs

:eager-status

Readers

access-eager-status.

Writers

(setf access-eager-status).

Slot: %lazy-instance
Initargs

:lazy-instance

Readers

read-lazy-instance.

Writers

write-lazy-instance.

Class: lazy-range
Package

cl-data-structures.common.

Source

lazy-range.lisp.

Direct subclasses

lazy-forward-range.

Direct methods
Direct slots
Slot: %container
Initargs

:container

Readers

read-container.

Writers

This slot is read-only.

Slot: %range
Type

(or (serapeum:-> nil cl-data-structures:fundamental-range) cl-data-structures:fundamental-range)

Initargs

:range

Readers

read-range.

Writers

This slot is read-only.

Class: line-by-line-range
Package

cl-data-structures.file-system.

Source

line-by-line.lisp.

Direct superclasses
Direct methods
Direct Default Initargs
InitargValue
:initial-position0
:lines-read0
Direct slots
Slot: %lines-read
Initargs

:lines-read

Readers

access-lines-read.

Writers

(setf access-lines-read).

Slot: %initial-lines-read
Initargs

:lines-read

Readers

read-initial-lines-read.

Writers

This slot is read-only.

Class: linear-regression-fit
Package

cl-data-structures.math.

Source

simple-linear-regression.lisp.

Direct superclasses

funcallable-standard-object.

Direct methods
Direct slots
Slot: %beta1
Initargs

:beta1

Readers

beta1.

Writers

(setf beta1).

Slot: %beta0
Initargs

:beta0

Readers

beta0.

Writers

(setf beta0).

Class: list-sequence-window
Package

cl-data-structures.common.

Source

sequence-window.lisp.

Direct superclasses

sequence-window.

Direct methods

effective-at.

Class: median-absolute-deviation-function
Package

cl-data-structures.math.

Source

median-absolute-deviation.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: minhash-corpus
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Direct superclasses

fundamental-minhash.

Direct methods
Direct slots
Slot: %table
Initargs

:table

Readers

read-table.

Writers

This slot is read-only.

Class: moments-function
Package

cl-data-structures.math.

Source

moments.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: moving-average-function
Package

cl-data-structures.math.

Source

moving-average.lisp.

Direct superclasses

layer-function.

Direct methods

apply-layer.

Class: moving-average-range
Package

cl-data-structures.math.

Source

moving-average.lisp.

Direct superclasses
Direct methods
Direct slots
Slot: %initial-count
Initform

0

Initargs

:count

Readers

read-initial-count.

Writers

This slot is read-only.

Slot: %initial-sum
Initform

0

Initargs

:sum

Readers

read-initial-sum.

Writers

This slot is read-only.

Slot: %count
Initform

0

Initargs

:count

Readers

access-count.

Writers

(setf access-count).

Slot: %sum
Initform

0

Initargs

:sum

Readers

access-sum.

Writers

(setf access-sum).

Slot: %key
Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Class: multiplex-function
Package

cl-data-structures.algorithms.

Source

multiplex.lisp.

Direct superclasses

layer-function.

Direct methods

apply-layer.

Class: multiplex-proxy
Package

cl-data-structures.algorithms.

Source

multiplex.lisp.

Direct superclasses
Direct subclasses

forward-multiplex-proxy.

Direct methods
Direct slots
Slot: %key
Package

cl-data-structures.algorithms.meta.

Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Slot: %function
Initargs

:function

Readers

read-function.

Writers

This slot is read-only.

Slot: %current
Initargs

:current

Readers

access-current.

Writers

(setf access-current).

Slot: %initial-current
Initargs

:initial-current

Readers

read-initial-current.

Writers

This slot is read-only.

Class: mutable-composite-container
Package

cl-data-structures.composite.

Source

implementation.lisp.

Direct superclasses

composite-container.

Direct methods

alter-bucket!.

Class: mutable-rrb-range
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Direct superclasses

rrb-range.

Direct methods
Class: mutable-skip-list-dictionary-range
Package

cl-data-structures.dicts.skip-list.

Source

api.lisp.

Direct superclasses

fundamental-skip-list-range.

Direct methods
Class: mutable-skip-list-set-range
Package

cl-data-structures.sets.skip-list.

Source

api.lisp.

Direct superclasses

fundamental-skip-list-range.

Direct methods
Class: mutual-information-function
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: mutual-information-matrix-function
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: on-each-function
Package

cl-data-structures.algorithms.

Source

on-each.lisp.

Direct superclasses

layer-function.

Direct subclasses

translation-function.

Direct methods

apply-layer.

Class: one-bit-minhash
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Direct superclasses

callback-minhash.

Direct subclasses
Direct methods

minhash.

Class: only-different-function
Package

cl-data-structures.algorithms.

Source

only-different.lisp.

Direct superclasses

layer-function.

Direct methods

apply-layer.

Class: only-different-proxy
Package

cl-data-structures.algorithms.

Source

only-different.lisp.

Direct superclasses

filtering-proxy.

Direct subclasses

forward-only-different-proxy.

Direct methods
Direct Default Initargs
InitargValue
:previous-boundnil
:previousnil
Direct slots
Slot: %comparsion
Initargs

:comparsion

Readers

read-comparsion.

Writers

This slot is read-only.

Slot: %previous
Initargs

:previous

Readers

access-previous.

Writers

(setf access-previous).

Slot: %initial-previous
Initargs

:previous

Readers

read-initial-previous.

Writers

(setf read-initial-previous).

Slot: %previous-bound
Initargs

:previous-bound

Readers

access-previous-bound.

Writers

(setf access-previous-bound).

Slot: %initial-previous-bound
Initargs

:previous-bound

Readers

read-initial-previous-bound.

Writers

(setf read-initial-previous-bound).

Class: only-function
Package

cl-data-structures.algorithms.

Source

only.lisp.

Direct superclasses

layer-function.

Direct methods
Class: only-proxy
Package

cl-data-structures.algorithms.

Source

only.lisp.

Direct superclasses

filtering-proxy.

Direct subclasses

forward-only-proxy.

Direct methods
Direct slots
Slot: %predicate
Initargs

:predicate

Readers

read-predicate.

Writers

This slot is read-only.

Class: optimal-split-point-function
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: parallel-forward-multiplex-proxy
Package

cl-data-structures.threads.

Source

parallel-multiplex.lisp.

Direct superclasses

forward-multiplex-proxy.

Direct methods
Direct slots
Slot: %maximum-queue-size
Initargs

:maximum-queue-size

Readers

read-maximum-queue-size.

Writers

This slot is read-only.

Slot: %chunk-size
Initargs

:chunk-size

Readers

read-chunk-size.

Writers

This slot is read-only.

Class: parallel-group-by-function
Package

cl-data-structures.threads.

Source

parallel-group-by.lisp.

Direct superclasses

layer-function.

Direct methods
Class: parallel-group-by-proxy
Package

cl-data-structures.threads.

Source

parallel-group-by.lisp.

Direct superclasses

proxy-range.

Direct subclasses

forward-parallel-group-by-proxy.

Direct methods
Direct slots
Slot: %groups
Type

hash-table

Initargs

:groups

Readers

read-groups.

Writers

This slot is read-only.

Slot: %having
Initargs

:having

Readers

read-having.

Writers

This slot is read-only.

Slot: %transform
Initargs

:transform

Readers

read-transform.

Writers

This slot is read-only.

Slot: %chunk-size
Initargs

:chunk-size

Readers

read-chunk-size.

Writers

This slot is read-only.

Slot: %maximum-queue-size
Initargs

:maximum-queue-size

Readers

read-maximum-queue-size.

Writers

This slot is read-only.

Slot: %key
Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Class: parallel-multiplex-function
Package

cl-data-structures.threads.

Source

parallel-multiplex.lisp.

Direct superclasses

layer-function.

Direct methods

apply-layer.

Class: parallel-on-each-function
Package

cl-data-structures.threads.

Source

parallel-on-each.lisp.

Direct superclasses

layer-function.

Direct methods

apply-layer.

Class: parallel-on-each-proxy
Package

cl-data-structures.threads.

Source

parallel-on-each.lisp.

Direct superclasses

forward-proxy-box-range.

Direct methods
Direct slots
Slot: %maximum-queue-size
Initargs

:maximum-queue-size

Readers

read-maximum-queue-size.

Writers

This slot is read-only.

Slot: %chunk-size
Initargs

:chunk-size

Readers

read-chunk-size.

Writers

This slot is read-only.

Class: partition-if-function
Package

cl-data-structures.algorithms.

Source

partition-if.lisp.

Direct superclasses

layer-function.

Direct methods
Class: partition-if-proxy
Package

cl-data-structures.algorithms.

Source

partition-if.lisp.

Direct subclasses

forward-partition-if-proxy.

Direct methods
Direct slots
Slot: %chunks
Initform

(serapeum:vect)

Readers

read-chunks.

Writers

This slot is read-only.

Class: polynomial-callback-minhash
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Direct superclasses

callback-minhash.

Direct subclasses

polynomial-callback-one-bit-minhash.

Direct methods
Direct slots
Slot: %hash-array
Initargs

:hash-array

Readers

read-hash-array.

Writers

This slot is read-only.

Class: polynomial-callback-one-bit-minhash
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Direct superclasses
Class: put-back-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

grow-function.

Direct subclasses
Class: put-front-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

grow-function.

Direct subclasses
Class: qp-trie-range-stack-cell
Package

cl-data-structures.sets.qp-trie.

Source

api.lisp.

Direct methods
Direct Default Initargs
InitargValue
:more-checks-startt
:more-checks-endt
:parents(quote nil)
:depth0
Direct slots
Slot: %more-checks-start
Initargs

:more-checks-start

Readers

more-checks-start.

Writers

This slot is read-only.

Slot: %more-checks-end
Initargs

:more-checks-end

Readers

more-checks-end.

Writers

This slot is read-only.

Slot: %node
Initargs

:node

Readers

node.

Writers

This slot is read-only.

Slot: %depth
Initargs

:depth

Readers

depth.

Writers

This slot is read-only.

Slot: %parents
Initargs

:parents

Readers

parents.

Writers

This slot is read-only.

Class: qp-trie-set-range
Package

cl-data-structures.sets.qp-trie.

Source

api.lisp.

Direct superclasses

fundamental-forward-range.

Direct methods
Direct slots
Slot: %stack
Initargs

:stack

Readers

stack.

Writers

(setf stack).

Slot: %initial-stack
Initargs

:stack

Readers

initial-stack.

Writers

This slot is read-only.

Slot: %start
Initargs

:start

Readers

start.

Writers

This slot is read-only.

Slot: %end
Initargs

:end

Readers

end.

Writers

This slot is read-only.

Class: random-access-bootstrap-proxy
Package

cl-data-structures.math.

Source

bootstrap.lisp.

Direct superclasses
Class: random-access-buffer-range
Package

cl-data-structures.threads.

Source

buffer-range.lisp.

Direct superclasses
Class: random-access-connecting-range
Package

cl-data-structures.algorithms.

Source

zip.lisp.

Direct superclasses
Direct subclasses
Direct methods
Class: random-access-establish-special-proxy-range
Package

cl-data-structures.algorithms.

Source

establish-special.lisp.

Direct superclasses
Class: random-access-group-by-proxy
Package

cl-data-structures.algorithms.

Source

group-by.lisp.

Direct superclasses
Class: random-access-in-batches-proxy
Package

cl-data-structures.algorithms.

Source

in-batches.lisp.

Direct superclasses
Class: random-access-parallel-group-by-proxy
Package

cl-data-structures.threads.

Source

parallel-group-by.lisp.

Direct superclasses
Class: random-access-proxy-box-range
Package

cl-data-structures.algorithms.

Source

on-each.lisp.

Direct superclasses
Class: random-access-sequence-window
Package

cl-data-structures.common.

Source

sequence-window.lisp.

Direct superclasses

sequence-window.

Direct methods

effective-at.

Class: random-access-with-previous-element-proxy
Package

cl-data-structures.algorithms.

Source

with-previous-element.lisp.

Direct superclasses
Class: random-access-zipped-ranges
Package

cl-data-structures.algorithms.

Source

zip.lisp.

Direct superclasses
Class: rate-function
Package

cl-data-structures.algorithms.

Source

rate.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: recursive-content-file-range-stack-cell
Package

cl-data-structures.file-system.

Source

find.lisp.

Direct superclasses
Direct methods
Class: regex-directory-file-range-stack-cell
Package

cl-data-structures.file-system.

Source

find.lisp.

Direct superclasses
Direct methods
Direct Default Initargs
InitargValue
:times1
Direct slots
Slot: %times
Initargs

:times

Readers

read-times.

Writers

This slot is read-only.

Class: regex-file-file-range-stack-cell
Package

cl-data-structures.file-system.

Source

find.lisp.

Direct superclasses
Direct methods
Class: repeat-function
Package

cl-data-structures.algorithms.

Source

repeat.lisp.

Direct superclasses

layer-function.

Direct methods

apply-layer.

Class: repeat-proxy
Package

cl-data-structures.algorithms.

Source

repeat.lisp.

Direct superclasses

proxy-range.

Direct subclasses

forward-repeat-proxy.

Direct methods
Direct slots
Slot: %times
Initargs

:times

Readers

read-times.

Writers

This slot is read-only.

Slot: %position
Initform

0

Initargs

:position

Readers

access-position.

Writers

(setf access-position).

Slot: %initial-position
Initform

0

Initargs

:position

Readers

read-initial-position.

Writers

This slot is read-only.

Class: reservoir-sample-function
Package

cl-data-structures.algorithms.

Source

reservoir-sample.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: restrain-size-function
Package

cl-data-structures.algorithms.

Source

restrain-size.lisp.

Direct superclasses

layer-function.

Direct methods

apply-layer.

Class: restrain-size-proxy
Package

cl-data-structures.algorithms.

Source

restrain-size.lisp.

Direct superclasses

proxy-range.

Direct subclasses

forward-restrain-size-proxy.

Direct methods
Direct slots
Slot: %size
Initargs

:size

Readers

read-size.

Writers

This slot is read-only.

Slot: %position
Initform

0

Initargs

:position

Readers

access-position.

Writers

(setf access-position).

Slot: %initial-position
Initform

0

Initargs

:position

Readers

read-initial-position.

Writers

This slot is read-only.

Class: rrb-vector
Package

cl-data-structures.sequences.rrb-vector.

Source

api.lisp.

Direct superclasses

rrb-container.

Direct subclasses
Direct methods
Class: seeds-callback-minhash
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Direct superclasses

callback-minhash.

Direct subclasses

seeds-callback-one-bit-minhash.

Direct methods
Direct slots
Slot: %seeds
Initargs

:seeds

Readers

read-seeds.

Writers

This slot is read-only.

Class: seeds-callback-one-bit-minhash
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Direct superclasses
Class: simple-linear-regression-function
Package

cl-data-structures.math.

Source

simple-linear-regression.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: sliding-window-function
Package

cl-data-structures.algorithms.

Source

sliding-window.lisp.

Direct superclasses

layer-function.

Direct methods
Class: split-point-field
Package

cl-data-structures.math.

Source

mutual-information.lisp.

Direct superclasses

info-field.

Direct methods
Direct slots
Slot: %split-point
Initargs

:split-point

Readers

access-split-point.

Writers

(setf access-split-point).

Slot: %original-selector-function
Initargs

:original-selector-function

Readers

read-original-selector-function.

Writers

This slot is read-only.

Slot: %discrete-values-set
Initargs

:discrete-values-set

Readers

read-discrete-values-set.

Writers

This slot is read-only.

Class: standard-deviation-function
Package

cl-data-structures.math.

Source

standard-deviation.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: stateful-file-range-stack-cell
Package

cl-data-structures.file-system.

Source

find.lisp.

Direct subclasses
Direct methods
Direct slots
Slot: %state
Type

list

Initargs

:state

Readers

access-state.

Writers

(setf access-state).

Slot: %initial-state
Type

list

Initargs

:initial-state

Readers

access-initial-state.

Writers

(setf access-initial-state).

Class: sum-function
Package

cl-data-structures.math.

Source

sum.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: summary-aggregation-function
Package

cl-data-structures.algorithms.

Source

summary.lisp.

Direct superclasses

aggregation-function.

Class: synchronization-mixin
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Direct superclasses

synchronization-primitives-mixin.

Direct subclasses
Direct methods
Class: synchronization-primitives-mixin
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Direct subclasses
Direct methods
Direct slots
Slot: %lock
Initform

(bordeaux-threads:make-lock)

Readers

read-lock.

Writers

This slot is read-only.

Slot: %notify-pop
Initform

(bordeaux-threads:make-condition-variable)

Readers

read-notify-pop.

Writers

This slot is read-only.

Class: tagged-2-node
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Direct superclasses
Class: tagged-3-node
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Direct superclasses
Class: tagged-tree
Package

cl-data-structures.common.2-3-tree.

Source

common.lisp.

Direct superclasses
Direct Default Initargs
InitargValue
:ownership-tag(make-ownership-tag)
Class: take-out-back-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

shrink-function.

Direct subclasses
Class: take-out-front-function
Package

cl-data-structures.meta.

Source

meta.lisp.

Direct superclasses

shrink-function.

Direct subclasses
Class: thread-buffer-function
Package

cl-data-structures.threads.

Source

buffer-range.lisp.

Direct superclasses

layer-function.

Direct methods
Class: to-hash-table-function
Package

cl-data-structures.algorithms.

Source

to-hash-table.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: to-list-function
Package

cl-data-structures.algorithms.

Source

to-list.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: to-vector-function
Package

cl-data-structures.algorithms.

Source

to-vector.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: tokenizing-range
Package

cl-data-structures.file-system.

Source

tokenize.lisp.

Direct superclasses
Direct methods
Direct Default Initargs
InitargValue
:initial-position0
Direct slots
Slot: %path
Type

(or string pathname)

Initargs

:path

Readers

read-path.

Writers

This slot is read-only.

Slot: %regex
Initargs

:regex

Readers

read-regex.

Writers

This slot is read-only.

Class: translation-function
Package

cl-data-structures.algorithms.

Source

translation.lisp.

Direct superclasses

on-each-function.

Class: variance-function
Package

cl-data-structures.math.

Source

variance.lisp.

Direct superclasses

aggregation-function.

Direct methods
Class: vector-sequence-window
Package

cl-data-structures.common.

Source

sequence-window.lisp.

Direct superclasses

sequence-window.

Direct methods

effective-at.

Class: with-previous-element-function
Package

cl-data-structures.algorithms.

Source

with-previous-element.lisp.

Direct superclasses

layer-function.

Direct methods
Class: with-previous-element-proxy
Package

cl-data-structures.algorithms.

Source

with-previous-element.lisp.

Direct superclasses

proxy-range.

Direct subclasses
Direct methods
Direct slots
Slot: %key
Package

cl-data-structures.algorithms.meta.

Initform

(function identity)

Initargs

:key

Readers

read-key.

Writers

This slot is read-only.

Class: without-function
Package

cl-data-structures.algorithms.

Source

without.lisp.

Direct superclasses

layer-function.

Direct methods
Class: without-proxy
Package

cl-data-structures.algorithms.

Source

without.lisp.

Direct superclasses

filtering-proxy.

Direct subclasses

forward-without-proxy.

Direct methods
Direct slots
Slot: %predicate
Initargs

:predicate

Readers

read-predicate.

Writers

This slot is read-only.

Class: xors-callback-minhash
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Direct superclasses

callback-minhash.

Direct subclasses

xors-callback-one-bit-minhash.

Direct methods
Direct slots
Slot: %xors
Initargs

:xors

Readers

read-xors.

Writers

This slot is read-only.

Class: xors-callback-one-bit-minhash
Package

cl-data-structures.streaming-algorithms.

Source

minhash.lisp.

Direct superclasses
Class: zipping-mixin
Package

cl-data-structures.algorithms.

Source

zip.lisp.

Direct superclasses

chunking-mixin.

Direct subclasses
Direct methods
Direct slots
Slot: %function
Initargs

:function

Readers

read-function.

Writers

This slot is read-only.


6.2.7 Types

Type: buffer-index ()
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Type: full-mask ()
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Type: half-byte ()
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Type: hash-mask ()
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Type: hash-node ()
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Type: hash-node-index ()
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Type: index-path ()
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Type: node-index ()
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Type: node-mask ()
Package

cl-data-structures.common.qp-trie.

Source

qp-trie.lisp.

Type: node-path ()
Package

cl-data-structures.common.hamt.

Source

common.lisp.

Type: queue-buffer ()
Package

cl-data-structures.queues.2-3-tree.

Source

api.lisp.

Type: rrb-indexes ()
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Type: rrb-path ()
Package

cl-data-structures.common.rrb.

Source

common.lisp.

Type: shift ()
Package

cl-data-structures.dicts.srrb.

Source

internal.lisp.

Type: stream-designator ()
Package

cl-data-structures.file-system.

Source

common.lisp.


Appendix A Indexes


A.1 Concepts


A.2 Functions

Jump to:   %   (  
A   B   C   D   E   F   G   H   I   J   K   L   M   N   O   P   Q   R   S   T   U   V   W   X   Z  
Index Entry  Section

%
%summary: Public generic functions
%summary: Public generic functions

(
(setf access-arguments-closure): Private generic functions
(setf access-arguments-closure): Private generic functions
(setf access-begin): Private generic functions
(setf access-begin): Private generic functions
(setf access-bins): Private generic functions
(setf access-bins): Private generic functions
(setf access-close-range): Private generic functions
(setf access-close-range): Private generic functions
(setf access-closure): Private generic functions
(setf access-closure): Private generic functions
(setf access-collected): Private generic functions
(setf access-collected): Private generic functions
(setf access-container): Private generic functions
(setf access-container): Private generic functions
(setf access-container): Private generic functions
(setf access-container): Private generic functions
(setf access-content): Public generic functions
(setf access-content): Public generic functions
(setf access-content): Private generic functions
(setf access-content): Private generic functions
(setf access-count): Private generic functions
(setf access-count): Private generic functions
(setf access-count): Private generic functions
(setf access-count): Private generic functions
(setf access-counters): Private generic functions
(setf access-counters): Private generic functions
(setf access-counters): Private generic functions
(setf access-current): Private generic functions
(setf access-current): Private generic functions
(setf access-current): Private generic functions
(setf access-current): Private generic functions
(setf access-current-index): Private generic functions
(setf access-current-index): Private generic functions
(setf access-current-node): Private generic functions
(setf access-current-node): Private generic functions
(setf access-current-position): Public generic functions
(setf access-current-position): Public generic functions
(setf access-depth): Private generic functions
(setf access-depth): Private generic functions
(setf access-depth): Private generic functions
(setf access-distant-range): Private generic functions
(setf access-distant-range): Private generic functions
(setf access-eager-status): Private generic functions
(setf access-eager-status): Private generic functions
(setf access-end): Private generic functions
(setf access-end): Private generic functions
(setf access-fill-pointer): Private generic functions
(setf access-fill-pointer): Private generic functions
(setf access-finished-closure): Private generic functions
(setf access-finished-closure): Private generic functions
(setf access-forward-stack): Private generic functions
(setf access-forward-stack): Private generic functions
(setf access-functor): Public generic functions
(setf access-functor): Public generic functions
(setf access-hash-fn): Private generic functions
(setf access-hash-fn): Private generic functions
(setf access-hashes): Private generic functions
(setf access-hashes): Private generic functions
(setf access-hashes): Private generic functions
(setf access-head): Private generic functions
(setf access-head): Private generic functions
(setf access-head-position): Private generic functions
(setf access-head-position): Private generic functions
(setf access-index): Private generic functions
(setf access-index): Private generic functions
(setf access-index): Private generic functions
(setf access-index): Private generic functions
(setf access-index-bound): Public generic functions
(setf access-index-bound): Public generic functions
(setf access-initial-state): Private generic functions
(setf access-initial-state): Private generic functions
(setf access-initial-to): Private generic functions
(setf access-initial-to): Private generic functions
(setf access-last-size): Public generic functions
(setf access-last-size): Public generic functions
(setf access-left): Public generic functions
(setf access-left): Public generic functions
(setf access-left): Public generic functions
(setf access-lines-read): Private generic functions
(setf access-lines-read): Private generic functions
(setf access-lower-bound): Public generic functions
(setf access-lower-bound): Public generic functions
(setf access-lower-bound): Private generic functions
(setf access-lower-bound): Private generic functions
(setf access-max): Private generic functions
(setf access-max): Private generic functions
(setf access-maximum-level): Public generic functions
(setf access-maximum-level): Public generic functions
(setf access-middle): Public generic functions
(setf access-middle): Public generic functions
(setf access-min): Private generic functions
(setf access-min): Private generic functions
(setf access-og-container): Private generic functions
(setf access-og-container): Private generic functions
(setf access-operations): Private generic functions
(setf access-operations): Private generic functions
(setf access-position): Private generic functions
(setf access-position): Private generic functions
(setf access-position): Private generic functions
(setf access-prev-cell): Private generic functions
(setf access-prev-cell): Private generic functions
(setf access-prev-cell): Private generic functions
(setf access-prev-cell): Private generic functions
(setf access-prev-cell): Private generic functions
(setf access-prev-cell): Private generic functions
(setf access-previous): Private generic functions
(setf access-previous): Private generic functions
(setf access-previous-bound): Private generic functions
(setf access-previous-bound): Private generic functions
(setf access-reached-end): Public generic functions
(setf access-reached-end): Public generic functions
(setf access-registers): Private generic functions
(setf access-registers): Private generic functions
(setf access-right): Public generic functions
(setf access-right): Public generic functions
(setf access-right): Public generic functions
(setf access-root): Public generic functions
(setf access-root): Public generic functions
(setf access-root): Public generic functions
(setf access-root): Public generic functions
(setf access-root): Public generic functions
(setf access-root): Public generic functions
(setf access-root): Public generic functions
(setf access-root): Public generic functions
(setf access-root): Public generic functions
(setf access-root): Public generic functions
(setf access-shift): Public generic functions
(setf access-shift): Public generic functions
(setf access-shift): Public generic functions
(setf access-shift): Public generic functions
(setf access-size): Public generic functions
(setf access-size): Public generic functions
(setf access-size): Public generic functions
(setf access-size): Public generic functions
(setf access-size): Public generic functions
(setf access-size): Public generic functions
(setf access-size): Public generic functions
(setf access-size): Public generic functions
(setf access-split-point): Private generic functions
(setf access-split-point): Private generic functions
(setf access-stack): Private generic functions
(setf access-stack): Private generic functions
(setf access-stack): Private generic functions
(setf access-stack): Private generic functions
(setf access-start): Public generic functions
(setf access-start): Public generic functions
(setf access-state): Private generic functions
(setf access-state): Private generic functions
(setf access-state): Private generic functions
(setf access-state): Private generic functions
(setf access-sum): Private generic functions
(setf access-sum): Private generic functions
(setf access-tail): Public generic functions
(setf access-tail): Public generic functions
(setf access-tail): Public generic functions
(setf access-tail): Public generic functions
(setf access-tail): Private generic functions
(setf access-tail): Private generic functions
(setf access-tail): Private generic functions
(setf access-tail): Private generic functions
(setf access-tail-end): Private generic functions
(setf access-tail-end): Private generic functions
(setf access-tail-mask): Public generic functions
(setf access-tail-mask): Public generic functions
(setf access-tail-position): Private generic functions
(setf access-tail-position): Private generic functions
(setf access-tail-size): Public generic functions
(setf access-tail-size): Public generic functions
(setf access-test-function): Public generic functions
(setf access-test-function): Public generic functions
(setf access-tree): Public generic functions
(setf access-tree): Public generic functions
(setf access-tree-index-bound): Public generic functions
(setf access-tree-index-bound): Public generic functions
(setf access-tree-size): Public generic functions
(setf access-tree-size): Public generic functions
(setf access-upper-bound): Public generic functions
(setf access-upper-bound): Public generic functions
(setf access-upper-bound): Private generic functions
(setf access-upper-bound): Private generic functions
(setf access-width): Private generic functions
(setf access-width): Private generic functions
(setf access-width): Private generic functions
(setf access-window): Private generic functions
(setf access-window): Private generic functions
(setf aggregator-cleanup): Private ordinary functions
(setf aggregator-extract): Private ordinary functions
(setf aggregator-pass): Private ordinary functions
(setf approximated-histogram-bin-count): Public ordinary functions
(setf approximated-histogram-bin-value): Public ordinary functions
(setf assoc-skip-list-node-content): Private ordinary functions
(setf assoc-skip-list-node-pointers): Private ordinary functions
(setf assoc-skip-list-node-value): Public ordinary functions
(setf at): Public generic functions
(setf at): Public generic functions
(setf at): Public generic functions
(setf at): Public generic functions
(setf at): Public generic functions
(setf at): Public generic functions
(setf beta0): Public generic functions
(setf beta0): Public generic functions
(setf beta1): Public generic functions
(setf beta1): Public generic functions
(setf changes-content): Private ordinary functions
(setf changes-end-index): Private ordinary functions
(setf changes-parent): Private ordinary functions
(setf changes-unique): Private ordinary functions
(setf dict-content-location): Public ordinary functions
(setf dict-content-value): Public ordinary functions
(setf distance): Private ordinary functions
(setf hamt-range-stack-cell-end): Private ordinary functions
(setf hamt-range-stack-cell-node): Private ordinary functions
(setf hamt-range-stack-cell-start): Private ordinary functions
(setf hash-content-hash): Public ordinary functions
(setf hash-content-location): Public ordinary functions
(setf hash-dict-content-hash): Private ordinary functions
(setf hash-dict-content-location): Private ordinary functions
(setf hash-dict-content-value): Public ordinary functions
(setf hash-node-content): Public ordinary functions
(setf hash-node-node-mask): Private ordinary functions
(setf hash-node-tagged-content): Private ordinary functions
(setf hash-node-tagged-node-mask): Private ordinary functions
(setf hash-node-tagged-ownership-tag): Private ordinary functions
(setf hash-node-untagged-content): Private ordinary functions
(setf hash-node-untagged-node-mask): Private ordinary functions
(setf mref): Public ordinary functions
(setf nref): Public ordinary functions
(setf peek-back): Public generic functions
(setf peek-back): Public generic functions
(setf peek-front): Public generic functions
(setf peek-front): Public generic functions
(setf peek-front): Public generic functions
(setf qp-trie-node-bitmask): Public ordinary functions
(setf qp-trie-node-children-bitmask): Public ordinary functions
(setf qp-trie-node-content): Public ordinary functions
(setf qp-trie-node-store-bitmask): Public ordinary functions
(setf qp-trie-node-tagged-bitmask): Private ordinary functions
(setf qp-trie-node-tagged-content): Private ordinary functions
(setf qp-trie-node-tagged-ownership-tag): Private ordinary functions
(setf qp-trie-node-untagged-bitmask): Private ordinary functions
(setf qp-trie-node-untagged-content): Private ordinary functions
(setf read-initial-previous): Private generic functions
(setf read-initial-previous): Private generic functions
(setf read-initial-previous-bound): Private generic functions
(setf read-initial-previous-bound): Private generic functions
(setf read-latches): Private generic functions
(setf read-latches): Private generic functions
(setf reservoir-sampling-result): Public ordinary functions
(setf reservoir-sampling-skip-count): Private ordinary functions
(setf reservoir-sampling-w): Private ordinary functions
(setf root): Private generic functions
(setf root): Private generic functions
(setf skip-list-node-at): Public ordinary functions
(setf skip-list-node-content): Public ordinary functions
(setf skip-list-node-pointers): Public ordinary functions
(setf sparse-nref): Public ordinary functions
(setf sparse-rrb-node-bitmask): Public ordinary functions
(setf sparse-rrb-node-content): Public ordinary functions
(setf sparse-rrb-node-tagged-bitmask): Private ordinary functions
(setf sparse-rrb-node-tagged-content): Private ordinary functions
(setf sparse-rrb-node-tagged-ownership-tag): Private ordinary functions
(setf sparse-rrb-node-untagged-bitmask): Private ordinary functions
(setf sparse-rrb-node-untagged-content): Private ordinary functions
(setf srrb-range-stack-cell-container): Private ordinary functions
(setf srrb-range-stack-cell-depth): Private ordinary functions
(setf srrb-range-stack-cell-end): Private ordinary functions
(setf srrb-range-stack-cell-is-tail): Private ordinary functions
(setf srrb-range-stack-cell-node-bitmask): Private ordinary functions
(setf srrb-range-stack-cell-node-content): Private ordinary functions
(setf srrb-range-stack-cell-start): Private ordinary functions
(setf srrb-range-stack-cell-upper-bits): Private ordinary functions
(setf stack): Private generic functions
(setf stack): Private generic functions
(setf tagged-struct-node-ownership-tag): Private ordinary functions

A
absolute-value-norm: Public generic functions
absolute-value-norm: Public generic functions
access-arguments-closure: Private generic functions
access-arguments-closure: Private generic functions
access-begin: Private generic functions
access-begin: Private generic functions
access-bins: Private generic functions
access-bins: Private generic functions
access-close-range: Private generic functions
access-close-range: Private generic functions
access-closure: Private generic functions
access-closure: Private generic functions
access-collected: Private generic functions
access-collected: Private generic functions
access-container: Private generic functions
access-container: Private generic functions
access-container: Private generic functions
access-container: Private generic functions
access-content: Public generic functions
access-content: Public generic functions
access-content: Private generic functions
access-content: Private generic functions
access-count: Private generic functions
access-count: Private generic functions
access-count: Private generic functions
access-count: Private generic functions
access-counters: Private generic functions
access-counters: Private generic functions
access-counters: Private generic functions
access-current: Private generic functions
access-current: Private generic functions
access-current: Private generic functions
access-current: Private generic functions
access-current-index: Private generic functions
access-current-index: Private generic functions
access-current-node: Private generic functions
access-current-node: Private generic functions
access-current-position: Public generic functions
access-current-position: Public generic functions
access-depth: Private generic functions
access-depth: Private generic functions
access-depth: Private generic functions
access-distant-range: Private generic functions
access-distant-range: Private generic functions
access-eager-status: Private generic functions
access-eager-status: Private generic functions
access-end: Private generic functions
access-end: Private generic functions
access-fill-pointer: Private generic functions
access-fill-pointer: Private generic functions
access-finished-closure: Private generic functions
access-finished-closure: Private generic functions
access-forward-stack: Private generic functions
access-forward-stack: Private generic functions
access-functor: Public generic functions
access-functor: Public generic functions
access-hash-fn: Private generic functions
access-hash-fn: Private generic functions
access-hashes: Private generic functions
access-hashes: Private generic functions
access-hashes: Private generic functions
access-head: Private generic functions
access-head: Private generic functions
access-head-position: Private generic functions
access-head-position: Private generic functions
access-index: Private generic functions
access-index: Private generic functions
access-index: Private generic functions
access-index: Private generic functions
access-index-bound: Public generic functions
access-index-bound: Public generic functions
access-initial-state: Private generic functions
access-initial-state: Private generic functions
access-initial-to: Private generic functions
access-initial-to: Private generic functions
access-last-size: Public generic functions
access-last-size: Public generic functions
access-left: Public generic functions
access-left: Public generic functions
access-left: Public generic functions
access-lines-read: Private generic functions
access-lines-read: Private generic functions
access-lower-bound: Public generic functions
access-lower-bound: Public generic functions
access-lower-bound: Private generic functions
access-lower-bound: Private generic functions
access-max: Private generic functions
access-max: Private generic functions
access-maximum-level: Public generic functions
access-maximum-level: Public generic functions
access-middle: Public generic functions
access-middle: Public generic functions
access-min: Private generic functions
access-min: Private generic functions
access-og-container: Private generic functions
access-og-container: Private generic functions
access-operations: Private generic functions
access-operations: Private generic functions
access-position: Private generic functions
access-position: Private generic functions
access-position: Private generic functions
access-prev-cell: Private generic functions
access-prev-cell: Private generic functions
access-previous: Private generic functions
access-previous: Private generic functions
access-previous-bound: Private generic functions
access-previous-bound: Private generic functions
access-reached-end: Public generic functions
access-reached-end: Public generic functions
access-registers: Private generic functions
access-registers: Private generic functions
access-right: Public generic functions
access-right: Public generic functions
access-right: Public generic functions
access-root: Public generic functions
access-root: Public generic functions
access-root: Public generic functions
access-root: Public generic functions
access-root: Public generic functions
access-root: Public generic functions
access-root: Public generic functions
access-root: Public generic functions
access-root: Public generic functions
access-root: Public generic functions
access-shift: Public generic functions
access-shift: Public generic functions
access-shift: Public generic functions
access-shift: Public generic functions
access-size: Public generic functions
access-size: Public generic functions
access-size: Public generic functions
access-size: Public generic functions
access-size: Public generic functions
access-size: Public generic functions
access-size: Public generic functions
access-size: Public generic functions
access-split-point: Private generic functions
access-split-point: Private generic functions
access-stack: Private generic functions
access-stack: Private generic functions
access-stack: Private generic functions
access-stack: Private generic functions
access-start: Public generic functions
access-start: Public generic functions
access-state: Private generic functions
access-state: Private generic functions
access-state: Private generic functions
access-state: Private generic functions
access-sum: Private generic functions
access-sum: Private generic functions
access-tail: Public generic functions
access-tail: Public generic functions
access-tail: Public generic functions
access-tail: Public generic functions
access-tail: Private generic functions
access-tail: Private generic functions
access-tail: Private generic functions
access-tail: Private generic functions
access-tail-end: Private generic functions
access-tail-end: Private generic functions
access-tail-mask: Public generic functions
access-tail-mask: Public generic functions
access-tail-position: Private generic functions
access-tail-position: Private generic functions
access-tail-size: Public generic functions
access-tail-size: Public generic functions
access-test-function: Public generic functions
access-test-function: Public generic functions
access-tree: Public generic functions
access-tree: Public generic functions
access-tree-index-bound: Public generic functions
access-tree-index-bound: Public generic functions
access-tree-size: Public generic functions
access-tree-size: Public generic functions
access-upper-bound: Public generic functions
access-upper-bound: Public generic functions
access-upper-bound: Private generic functions
access-upper-bound: Private generic functions
access-width: Private generic functions
access-width: Private generic functions
access-width: Private generic functions
access-window: Private generic functions
access-window: Private generic functions
acquire-ownership: Public ordinary functions
acquire-path: Private ordinary functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across: Public generic functions
across-aggregate: Public generic functions
across-aggregate: Public generic functions
across-aggregate: Public generic functions
across-aggregate: Public generic functions
across-aggregate: Public generic functions
across-aggregate: Public generic functions
across-aggregate: Public generic functions
across/traverse: Private ordinary functions
add: Public generic functions
add: Public generic functions
add: Public generic functions
add!: Public generic functions
add!: Public generic functions
add!: Public generic functions
add-change: Private ordinary functions
add-children-to-stack: Private ordinary functions
add-hash: Public ordinary functions
add-into-queue: Public generic functions
add-into-queue: Public generic functions
add-sinks: Public generic functions
add-sinks: Public generic functions
add-to-list: Public ordinary functions
adjust-size-to-fill-pointer: Public ordinary functions
adjust-tree-to-new-size!: Private ordinary functions
aggregation-function-class-form: Private ordinary functions
aggregation-function-defgeneric-form: Private ordinary functions
aggregator-cleanup: Private ordinary functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor: Public generic functions
aggregator-constructor-form: Private ordinary functions
aggregator-extract: Private ordinary functions
aggregator-p: Private ordinary functions
aggregator-pass: Private ordinary functions
all-parents: Public ordinary functions
alter-bucket: Public generic functions
alter-bucket: Public generic functions
alter-bucket: Public generic functions
alter-bucket: Public generic functions
alter-bucket: Public generic functions
alter-bucket: Public generic functions
alter-bucket: Public generic functions
alter-bucket: Public generic functions
alter-bucket!: Public generic functions
alter-bucket!: Public generic functions
alter-bucket!: Public generic functions
alter-bucket!: Public generic functions
alter-bucket!: Public generic functions
alter-bucket!: Public generic functions
alter-bucket!: Public generic functions
alter-bucket!: Public generic functions
alter-bucket!: Public generic functions
ancestor-p: Public ordinary functions
and*: Public ordinary functions
apply-aggregation-function: Public generic functions
apply-aggregation-function: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-layer: Public generic functions
apply-range-function: Public generic functions
apply-range-function: Public generic functions
apply-range-function: Public generic functions
apply-range-function: Public generic functions
apply-range-function: Public generic functions
apply-range-function: Public generic functions
apply-range-function: Public generic functions
apply-range-function: Public generic functions
apply-range-function: Public generic functions
approximated-counts: Public generic functions
approximated-counts: Public generic functions
approximated-counts-distance: Public ordinary functions
approximated-expected-collisions: Private ordinary functions
approximated-histogram: Public generic functions
approximated-histogram: Public generic functions
approximated-histogram-add: Public ordinary functions
approximated-histogram-bin-clone: Private ordinary functions
approximated-histogram-bin-count: Public ordinary functions
approximated-histogram-bin-p: Private ordinary functions
approximated-histogram-bin-position: Public ordinary functions
approximated-histogram-bin-sum: Public ordinary functions
approximated-histogram-bin-value: Public ordinary functions
approximated-histogram-bins: Public ordinary functions
approximated-histogram-bounds: Public ordinary functions
approximated-histogram-count: Public ordinary functions
approximated-histogram-count-lower: Public ordinary functions
approximated-histogram-counts: Public ordinary functions
approximated-histogram-cumulant-sum: Public ordinary functions
approximated-histogram-mean: Public ordinary functions
approximated-histogram-median: Public ordinary functions
approximated-histogram-quantile: Public ordinary functions
approximated-histogram-rank-order: Public ordinary functions
approximated-histogram-standard-deviation: Public ordinary functions
approximated-histogram-sum: Public ordinary functions
approximated-histogram-trim: Public ordinary functions
approximated-histogram-truncated-mean: Public ordinary functions
approximated-histogram-values: Public ordinary functions
approximated-histogram-variance: Public ordinary functions
approximated-set-cardinality: Public generic functions
approximated-set-cardinality: Public generic functions
approximated-top-k: Public generic functions
approximated-top-k: Public generic functions
array-average: Public generic functions
array-average: Public generic functions
array-elementwise: Public generic functions
array-elementwise: Public generic functions
array-geometric-average: Public generic functions
array-geometric-average: Public generic functions
array-harmonic-average: Public generic functions
array-harmonic-average: Public generic functions
array-sum: Public generic functions
array-sum: Public generic functions
array-to-half-byte-array: Public ordinary functions
as-cons-tree: Public ordinary functions
assert-one-dimension: Public macros
assign-children: Private ordinary functions
assoc-skip-list-node-content: Private ordinary functions
assoc-skip-list-node-p: Private ordinary functions
assoc-skip-list-node-pointers: Private ordinary functions
assoc-skip-list-node-value: Public ordinary functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
at: Public generic functions
average: Public generic functions
average: Public generic functions
average-pairwise-distance: Private ordinary functions

B
become-functional: Public generic functions
become-functional: Public generic functions
become-functional: Public generic functions
become-functional: Public generic functions
become-functional: Public generic functions
become-functional: Public generic functions
become-functional: Public generic functions
become-functional: Public generic functions
become-functional: Public generic functions
become-lazy: Public generic functions
become-lazy: Public generic functions
become-lazy: Public generic functions
become-mutable: Public generic functions
become-mutable: Public generic functions
become-mutable: Public generic functions
become-mutable: Public generic functions
become-mutable: Public generic functions
become-mutable: Public generic functions
become-mutable: Public generic functions
become-mutable: Public generic functions
become-mutable: Public generic functions
become-mutable: Public generic functions
become-mutable: Public generic functions
become-mutable: Public generic functions
become-subtree: Private ordinary functions
become-subtree*: Private generic functions
become-subtree*: Private generic functions
become-subtree*: Private generic functions
become-transactional: Public generic functions
become-transactional: Public generic functions
become-transactional: Public generic functions
become-transactional: Public generic functions
become-transactional: Public generic functions
become-transactional: Public generic functions
become-transactional: Public generic functions
become-transactional: Public generic functions
become-transactional: Public generic functions
become-transactional: Public generic functions
become-transactional: Public generic functions
beta: Private ordinary functions
beta0: Public generic functions
beta0: Public generic functions
beta1: Public generic functions
beta1: Public generic functions
between*: Public generic functions
between*: Public generic functions
between*: Public generic functions
binary-search: Public ordinary functions
bind-lambda: Public macros
bloom-filter: Public generic functions
bloom-filter: Public generic functions
bootstrap: Public generic functions
bootstrap: Public generic functions
bourgain-embedding: Private ordinary functions
bucket-sort: Public ordinary functions
build-node: Public ordinary functions
build-rehashed-node: Public ordinary functions
build-setf-form: Private ordinary functions

C
calculate-distances: Private ordinary functions
calculate-hodges-lehmann-estimator: Private ordinary functions
calculate-mutual-information: Private ordinary functions
calculate-mutual-information-between: Private ordinary functions
calculate-skip-count: Private ordinary functions
calculate-split-point: Private ordinary functions
call-constructor: Public macros
cardinality: Public ordinary functions
cartesian: Public ordinary functions
cartesian: Public ordinary functions
cartesian-table: Public ordinary functions
cases: Public macros
chain: Public ordinary functions
changed: Public generic functions
changed: Public generic functions
changed: Public generic functions
changes-content: Private ordinary functions
changes-end-index: Private ordinary functions
changes-p: Private ordinary functions
changes-parent: Private ordinary functions
changes-unique: Private ordinary functions
check-argument-bounds: Public macros
check-probability-in-rows: Private ordinary functions
check-value: Public macros
chunked: Public generic functions
chunked: Public generic functions
chunked: Public generic functions
chunked: Public generic functions
chunked: Public generic functions
chunked: Public generic functions
chunked: Public generic functions
circular-shift: Private ordinary functions
circular-shift-left: Private ordinary functions
circular-shift-right: Private ordinary functions
clean-sketch: Public generic functions
clean-sketch: Public generic functions
clean-sketch: Public generic functions
clean-sketch: Public generic functions
clean-sketch: Public generic functions
cleanup: Public ordinary functions
clone: Public ordinary functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone: Public generic functions
clone-cell: Private generic functions
clone-cell: Private generic functions
clone-cell: Private generic functions
clone-cell: Private generic functions
clone-of-original-range: Private ordinary functions
clone-of-stack: Private ordinary functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-information: Public generic functions
cloning-list: Public ordinary functions
close-inner-stream: Public generic functions
close-inner-stream: Public generic functions
close-inner-stream: Public generic functions
close-inner-stream: Public generic functions
close-silence-errors: Private ordinary functions
close-stream: Public ordinary functions
closest-node: Private ordinary functions
co-occurence-table: Public generic functions
co-occurence-table: Public generic functions
collect-buckets: Private ordinary functions
command: Public ordinary functions
common-fundamental-range-class: Private ordinary functions
compatiblep: Private generic functions
compatiblep: Private generic functions
compatiblep: Private generic functions
compatiblep: Private generic functions
compatiblep: Private generic functions
cond+: Public macros
cond-compare: Public macros
connect: Public ordinary functions
connect-traversable: Public ordinary functions
construct-aggregator: Public ordinary functions
consume-back: Public generic functions
consume-back: Public generic functions
consume-back: Public generic functions
consume-back: Public generic functions
consume-back: Public generic functions
consume-back: Public generic functions
consume-back: Public generic functions
consume-back: Public generic functions
consume-back: Public generic functions
consume-back: Public generic functions
consume-back: Public generic functions
consume-back: Public generic functions
consume-back: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-front: Public generic functions
consume-impl: Private ordinary functions
continuesp: Private ordinary functions
copy-aggregator: Private ordinary functions
copy-approximated-histogram-bin: Private ordinary functions
copy-array-if-not-nil: Private ordinary functions
copy-assoc-skip-list-node: Private ordinary functions
copy-changes: Private ordinary functions
copy-dict-content: Private ordinary functions
copy-hamt-range-stack-cell: Private ordinary functions
copy-hash-content: Private ordinary functions
copy-hash-dict-content: Private ordinary functions
copy-hash-node-tagged: Private ordinary functions
copy-hash-node-untagged: Private ordinary functions
copy-into!: Private ordinary functions
copy-node: Public ordinary functions
copy-on-write: Public ordinary functions
copy-on-write: Public ordinary functions
copy-qp-trie-node-tagged: Private ordinary functions
copy-qp-trie-node-untagged: Private ordinary functions
copy-reservoir-sampling: Private ordinary functions
copy-skip-list-node: Private ordinary functions
copy-slots: Public macros
copy-sparse-rrb-node-tagged: Private ordinary functions
copy-sparse-rrb-node-untagged: Private ordinary functions
copy-srrb-range-stack-cell: Private ordinary functions
copy-tagged-struct-node: Private ordinary functions
copy-without: Public ordinary functions
count-elements: Public generic functions
count-elements: Public generic functions
cumulative-accumulate: Public generic functions
cumulative-accumulate: Public generic functions
cycle-over-address: Public ordinary functions
cycle-rotate: Private ordinary functions

D
deep-copy-of-content: Private ordinary functions
deep-copy-of-tail: Private ordinary functions
deep-copy-sparse-rrb-node: Public ordinary functions
define-aggregation-function: Public macros
define-all-validation-for-fields: Private macros
define-list-of-slots: Public macros
define-tagged-untagged-node: Public macros
define-validation-for-fields: Public macros
defmethod-with-peek-stack: Public macros
defmethod-with-stack: Public macros
defpackage: Public macros
delay: Public macros
delete-back: Private generic functions
delete-back: Private generic functions
delete-back: Private generic functions
delete-back: Private generic functions
delete-back!: Private generic functions
delete-back!: Private generic functions
delete-back!: Private generic functions
delete-back!: Private generic functions
delete-back-from-tree: Public ordinary functions
delete-back-from-tree!: Public ordinary functions
delete-node-between!: Public ordinary functions
depth: Private generic functions
depth: Private generic functions
descend-into-tree: Public ordinary functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-counterpart: Public generic functions
destructive-grow-tree!: Private ordinary functions
destructive-write: Public ordinary functions
dict-content-location: Public ordinary functions
dict-content-p: Private ordinary functions
dict-content-value: Public ordinary functions
dimensionality: Public generic functions
dimensionality: Public generic functions
dimensionality: Public generic functions
dimensionality: Public generic functions
directory-content: Private ordinary functions
directory-regex-matches: Private ordinary functions
discrete-form: Private ordinary functions
distance: Public generic functions
distance: Public generic functions
distance: Public generic functions
distance: Public generic functions
distance: Private ordinary functions
distinct: Public generic functions
distinct: Public generic functions
draw-random-vector: Public ordinary functions
draw-sample-vector: Public ordinary functions
drop-back: Public generic functions
drop-back: Public generic functions
drop-back: Public generic functions
drop-back: Public generic functions
drop-back: Public generic functions
drop-back: Public generic functions
drop-front: Public generic functions
drop-front: Public generic functions
drop-front: Public generic functions
drop-front: Public generic functions
drop-front: Public generic functions
drop-front: Public generic functions
drop-front: Public generic functions
drop-front: Public generic functions
drop-front: Public generic functions
drop-front: Public generic functions
drop-unneded-nodes: Private ordinary functions

E
each-in-matrix: Public generic functions
each-in-matrix: Public generic functions
eat-cell: Private generic functions
eat-cell: Private generic functions
eat-cell: Private generic functions
eat-cell: Private generic functions
eat-cell: Private generic functions
eat-cell: Private generic functions
eat-cell: Private generic functions
effective-at: Private generic functions
effective-at: Private generic functions
effective-at: Private generic functions
effective-at: Private generic functions
egnat-grow!: Private ordinary functions
empty-clone: Public generic functions
empty-clone: Public generic functions
empty-clone: Public generic functions
empty-clone: Public generic functions
empty-clone: Public generic functions
empty-clone: Public generic functions
empty-clone: Public generic functions
empty-clone: Public generic functions
empty-clone: Public generic functions
empty-clone: Public generic functions
enclose-finalizer: Private ordinary functions
end: Private generic functions
end: Private generic functions
end-execution: Public generic functions
end-execution: Public generic functions
end-execution: Public generic functions
ensure-call-ahead-of: Public ordinary functions
ensure-stream: Public ordinary functions
entropy: Public generic functions
entropy: Public generic functions
enumerate: Public generic functions
enumerate: Public generic functions
erase: Public generic functions
erase: Public generic functions
erase: Public generic functions
erase!: Public generic functions
erase!: Public generic functions
erase!: Public generic functions
erase!: Public generic functions
erase!: Public generic functions
erase*: Public generic functions
erase*!: Public generic functions
erase*!: Public generic functions
erase-from-vector: Public ordinary functions
erase-if: Public generic functions
erase-if: Public generic functions
erase-if!: Public generic functions
erase-if!: Public generic functions
establish-special: Public generic functions
establish-special: Public generic functions
every-possible-combination: Private ordinary functions
execute-changes: Private ordinary functions
expected-collisions: Private ordinary functions
extract-parameters: Private ordinary functions
extract-result: Public ordinary functions
extract-values: Private ordinary functions
extrema: Public generic functions
extrema: Public generic functions
extremum: Public generic functions
extremum: Public generic functions

F
fast-map: Public generic functions
fast-map: Public generic functions
fast-map-embeddings: Private ordinary functions
field: Public ordinary functions
fill-distance-matrix-from-vector: Public ordinary functions
fill-sparse-rrb-node-with-new: Public ordinary functions
fill-sparse-rrb-node-without: Private ordinary functions
find: Public generic functions
find: Public generic functions
find-content: Private ordinary functions
first-element: Public generic functions
first-element: Public generic functions
fixnum-hash: Public ordinary functions
flatten-lists: Public generic functions
flatten-lists: Public generic functions
fold-content: Private ordinary functions
fold-rrb-content: Private ordinary functions
force: Public ordinary functions
force-lazy-range: Private ordinary functions
force-version: Public ordinary functions
forward-call: Public generic functions
forward-call: Public generic functions
forward-call: Public generic functions
forward-call: Public generic functions
forward-cell: Private ordinary functions
forward-cell: Private ordinary functions
found: Public generic functions
found: Public generic functions
found: Public generic functions
frequency: Public generic functions
frequency: Public generic functions
fresh-bucket-status: Public generic functions
fresh-bucket-status: Public generic functions
fresh-bucket-status: Public generic functions
fresh-bucket-status: Public generic functions
fresh-bucket-status: Public generic functions
fresh-bucket-status: Public generic functions
front-body: Private macros
full-bucket-p: Private ordinary functions
Function, (setf aggregator-cleanup): Private ordinary functions
Function, (setf aggregator-extract): Private ordinary functions
Function, (setf aggregator-pass): Private ordinary functions
Function, (setf approximated-histogram-bin-count): Public ordinary functions
Function, (setf approximated-histogram-bin-value): Public ordinary functions
Function, (setf assoc-skip-list-node-content): Private ordinary functions
Function, (setf assoc-skip-list-node-pointers): Private ordinary functions
Function, (setf assoc-skip-list-node-value): Public ordinary functions
Function, (setf changes-content): Private ordinary functions
Function, (setf changes-end-index): Private ordinary functions
Function, (setf changes-parent): Private ordinary functions
Function, (setf changes-unique): Private ordinary functions
Function, (setf dict-content-location): Public ordinary functions
Function, (setf dict-content-value): Public ordinary functions
Function, (setf distance): Private ordinary functions
Function, (setf hamt-range-stack-cell-end): Private ordinary functions
Function, (setf hamt-range-stack-cell-node): Private ordinary functions
Function, (setf hamt-range-stack-cell-start): Private ordinary functions
Function, (setf hash-content-hash): Public ordinary functions
Function, (setf hash-content-location): Public ordinary functions
Function, (setf hash-dict-content-hash): Private ordinary functions
Function, (setf hash-dict-content-location): Private ordinary functions
Function, (setf hash-dict-content-value): Public ordinary functions
Function, (setf hash-node-content): Public ordinary functions
Function, (setf hash-node-node-mask): Private ordinary functions
Function, (setf hash-node-tagged-content): Private ordinary functions
Function, (setf hash-node-tagged-node-mask): Private ordinary functions
Function, (setf hash-node-tagged-ownership-tag): Private ordinary functions
Function, (setf hash-node-untagged-content): Private ordinary functions
Function, (setf hash-node-untagged-node-mask): Private ordinary functions
Function, (setf mref): Public ordinary functions
Function, (setf nref): Public ordinary functions
Function, (setf qp-trie-node-bitmask): Public ordinary functions
Function, (setf qp-trie-node-children-bitmask): Public ordinary functions
Function, (setf qp-trie-node-content): Public ordinary functions
Function, (setf qp-trie-node-store-bitmask): Public ordinary functions
Function, (setf qp-trie-node-tagged-bitmask): Private ordinary functions
Function, (setf qp-trie-node-tagged-content): Private ordinary functions
Function, (setf qp-trie-node-tagged-ownership-tag): Private ordinary functions
Function, (setf qp-trie-node-untagged-bitmask): Private ordinary functions
Function, (setf qp-trie-node-untagged-content): Private ordinary functions
Function, (setf reservoir-sampling-result): Public ordinary functions
Function, (setf reservoir-sampling-skip-count): Private ordinary functions
Function, (setf reservoir-sampling-w): Private ordinary functions
Function, (setf skip-list-node-at): Public ordinary functions
Function, (setf skip-list-node-content): Public ordinary functions
Function, (setf skip-list-node-pointers): Public ordinary functions
Function, (setf sparse-nref): Public ordinary functions
Function, (setf sparse-rrb-node-bitmask): Public ordinary functions
Function, (setf sparse-rrb-node-content): Public ordinary functions
Function, (setf sparse-rrb-node-tagged-bitmask): Private ordinary functions
Function, (setf sparse-rrb-node-tagged-content): Private ordinary functions
Function, (setf sparse-rrb-node-tagged-ownership-tag): Private ordinary functions
Function, (setf sparse-rrb-node-untagged-bitmask): Private ordinary functions
Function, (setf sparse-rrb-node-untagged-content): Private ordinary functions
Function, (setf srrb-range-stack-cell-container): Private ordinary functions
Function, (setf srrb-range-stack-cell-depth): Private ordinary functions
Function, (setf srrb-range-stack-cell-end): Private ordinary functions
Function, (setf srrb-range-stack-cell-is-tail): Private ordinary functions
Function, (setf srrb-range-stack-cell-node-bitmask): Private ordinary functions
Function, (setf srrb-range-stack-cell-node-content): Private ordinary functions
Function, (setf srrb-range-stack-cell-start): Private ordinary functions
Function, (setf srrb-range-stack-cell-upper-bits): Private ordinary functions
Function, (setf tagged-struct-node-ownership-tag): Private ordinary functions
Function, acquire-ownership: Public ordinary functions
Function, acquire-path: Private ordinary functions
Function, across/traverse: Private ordinary functions
Function, add-change: Private ordinary functions
Function, add-children-to-stack: Private ordinary functions
Function, add-hash: Public ordinary functions
Function, add-to-list: Public ordinary functions
Function, adjust-size-to-fill-pointer: Public ordinary functions
Function, adjust-tree-to-new-size!: Private ordinary functions
Function, aggregation-function-class-form: Private ordinary functions
Function, aggregation-function-defgeneric-form: Private ordinary functions
Function, aggregator-cleanup: Private ordinary functions
Function, aggregator-constructor-form: Private ordinary functions
Function, aggregator-extract: Private ordinary functions
Function, aggregator-p: Private ordinary functions
Function, aggregator-pass: Private ordinary functions
Function, all-parents: Public ordinary functions
Function, ancestor-p: Public ordinary functions
Function, and*: Public ordinary functions
Function, approximated-counts-distance: Public ordinary functions
Function, approximated-expected-collisions: Private ordinary functions
Function, approximated-histogram-add: Public ordinary functions
Function, approximated-histogram-bin-clone: Private ordinary functions
Function, approximated-histogram-bin-count: Public ordinary functions
Function, approximated-histogram-bin-p: Private ordinary functions
Function, approximated-histogram-bin-position: Public ordinary functions
Function, approximated-histogram-bin-sum: Public ordinary functions
Function, approximated-histogram-bin-value: Public ordinary functions
Function, approximated-histogram-bins: Public ordinary functions
Function, approximated-histogram-bounds: Public ordinary functions
Function, approximated-histogram-count: Public ordinary functions
Function, approximated-histogram-count-lower: Public ordinary functions
Function, approximated-histogram-counts: Public ordinary functions
Function, approximated-histogram-cumulant-sum: Public ordinary functions
Function, approximated-histogram-mean: Public ordinary functions
Function, approximated-histogram-median: Public ordinary functions
Function, approximated-histogram-quantile: Public ordinary functions
Function, approximated-histogram-rank-order: Public ordinary functions
Function, approximated-histogram-standard-deviation: Public ordinary functions
Function, approximated-histogram-sum: Public ordinary functions
Function, approximated-histogram-trim: Public ordinary functions
Function, approximated-histogram-truncated-mean: Public ordinary functions
Function, approximated-histogram-values: Public ordinary functions
Function, approximated-histogram-variance: Public ordinary functions
Function, array-to-half-byte-array: Public ordinary functions
Function, as-cons-tree: Public ordinary functions
Function, assign-children: Private ordinary functions
Function, assoc-skip-list-node-content: Private ordinary functions
Function, assoc-skip-list-node-p: Private ordinary functions
Function, assoc-skip-list-node-pointers: Private ordinary functions
Function, assoc-skip-list-node-value: Public ordinary functions
Function, average-pairwise-distance: Private ordinary functions
Function, become-subtree: Private ordinary functions
Function, beta: Private ordinary functions
Function, binary-search: Public ordinary functions
Function, bourgain-embedding: Private ordinary functions
Function, bucket-sort: Public ordinary functions
Function, build-node: Public ordinary functions
Function, build-rehashed-node: Public ordinary functions
Function, build-setf-form: Private ordinary functions
Function, calculate-distances: Private ordinary functions
Function, calculate-hodges-lehmann-estimator: Private ordinary functions
Function, calculate-mutual-information: Private ordinary functions
Function, calculate-mutual-information-between: Private ordinary functions
Function, calculate-skip-count: Private ordinary functions
Function, calculate-split-point: Private ordinary functions
Function, cardinality: Public ordinary functions
Function, cartesian: Public ordinary functions
Function, cartesian: Public ordinary functions
Function, cartesian-table: Public ordinary functions
Function, chain: Public ordinary functions
Function, changes-content: Private ordinary functions
Function, changes-end-index: Private ordinary functions
Function, changes-p: Private ordinary functions
Function, changes-parent: Private ordinary functions
Function, changes-unique: Private ordinary functions
Function, check-probability-in-rows: Private ordinary functions
Function, circular-shift: Private ordinary functions
Function, circular-shift-left: Private ordinary functions
Function, circular-shift-right: Private ordinary functions
Function, cleanup: Public ordinary functions
Function, clone: Public ordinary functions
Function, clone-of-original-range: Private ordinary functions
Function, clone-of-stack: Private ordinary functions
Function, cloning-list: Public ordinary functions
Function, close-silence-errors: Private ordinary functions
Function, close-stream: Public ordinary functions
Function, closest-node: Private ordinary functions
Function, collect-buckets: Private ordinary functions
Function, command: Public ordinary functions
Function, common-fundamental-range-class: Private ordinary functions
Function, connect: Public ordinary functions
Function, connect-traversable: Public ordinary functions
Function, construct-aggregator: Public ordinary functions
Function, consume-impl: Private ordinary functions
Function, continuesp: Private ordinary functions
Function, copy-aggregator: Private ordinary functions
Function, copy-approximated-histogram-bin: Private ordinary functions
Function, copy-array-if-not-nil: Private ordinary functions
Function, copy-assoc-skip-list-node: Private ordinary functions
Function, copy-changes: Private ordinary functions
Function, copy-dict-content: Private ordinary functions
Function, copy-hamt-range-stack-cell: Private ordinary functions
Function, copy-hash-content: Private ordinary functions
Function, copy-hash-dict-content: Private ordinary functions
Function, copy-hash-node-tagged: Private ordinary functions
Function, copy-hash-node-untagged: Private ordinary functions
Function, copy-into!: Private ordinary functions
Function, copy-node: Public ordinary functions
Function, copy-on-write: Public ordinary functions
Function, copy-on-write: Public ordinary functions
Function, copy-qp-trie-node-tagged: Private ordinary functions
Function, copy-qp-trie-node-untagged: Private ordinary functions
Function, copy-reservoir-sampling: Private ordinary functions
Function, copy-skip-list-node: Private ordinary functions
Function, copy-sparse-rrb-node-tagged: Private ordinary functions
Function, copy-sparse-rrb-node-untagged: Private ordinary functions
Function, copy-srrb-range-stack-cell: Private ordinary functions
Function, copy-tagged-struct-node: Private ordinary functions
Function, copy-without: Public ordinary functions
Function, cycle-over-address: Public ordinary functions
Function, cycle-rotate: Private ordinary functions
Function, deep-copy-of-content: Private ordinary functions
Function, deep-copy-of-tail: Private ordinary functions
Function, deep-copy-sparse-rrb-node: Public ordinary functions
Function, delete-back-from-tree: Public ordinary functions
Function, delete-back-from-tree!: Public ordinary functions
Function, delete-node-between!: Public ordinary functions
Function, descend-into-tree: Public ordinary functions
Function, destructive-grow-tree!: Private ordinary functions
Function, destructive-write: Public ordinary functions
Function, dict-content-location: Public ordinary functions
Function, dict-content-p: Private ordinary functions
Function, dict-content-value: Public ordinary functions
Function, directory-content: Private ordinary functions
Function, directory-regex-matches: Private ordinary functions
Function, discrete-form: Private ordinary functions
Function, distance: Private ordinary functions
Function, draw-random-vector: Public ordinary functions
Function, draw-sample-vector: Public ordinary functions
Function, drop-unneded-nodes: Private ordinary functions
Function, egnat-grow!: Private ordinary functions
Function, enclose-finalizer: Private ordinary functions
Function, ensure-call-ahead-of: Public ordinary functions
Function, ensure-stream: Public ordinary functions
Function, erase-from-vector: Public ordinary functions
Function, every-possible-combination: Private ordinary functions
Function, execute-changes: Private ordinary functions
Function, expected-collisions: Private ordinary functions
Function, extract-parameters: Private ordinary functions
Function, extract-result: Public ordinary functions
Function, extract-values: Private ordinary functions
Function, fast-map-embeddings: Private ordinary functions
Function, field: Public ordinary functions
Function, fill-distance-matrix-from-vector: Public ordinary functions
Function, fill-sparse-rrb-node-with-new: Public ordinary functions
Function, fill-sparse-rrb-node-without: Private ordinary functions
Function, find-content: Private ordinary functions
Function, fixnum-hash: Public ordinary functions
Function, fold-content: Private ordinary functions
Function, fold-rrb-content: Private ordinary functions
Function, force: Public ordinary functions
Function, force-lazy-range: Private ordinary functions
Function, force-version: Public ordinary functions
Function, forward-cell: Private ordinary functions
Function, forward-cell: Private ordinary functions
Function, full-bucket-p: Private ordinary functions
Function, functional-sparse-rrb-vector-grow: Public ordinary functions
Function, gather-pointers: Private ordinary functions
Function, gen-w: Private ordinary functions
Function, generate-if-else: Private ordinary functions
Function, generate-validation-forms: Private ordinary functions
Function, generator: Public ordinary functions
Function, go-down-on-path: Public ordinary functions
Function, grow-tree: Private ordinary functions
Function, half-byte-list-to-array: Public ordinary functions
Function, hamt-dictionary-at: Public ordinary functions
Function, hamt-dictionary-size: Public ordinary functions
Function, hamt-range-stack-cell-end: Private ordinary functions
Function, hamt-range-stack-cell-node: Private ordinary functions
Function, hamt-range-stack-cell-p: Private ordinary functions
Function, hamt-range-stack-cell-start: Private ordinary functions
Function, has-single-child-p: Private ordinary functions
Function, hash-content-hash: Public ordinary functions
Function, hash-content-location: Public ordinary functions
Function, hash-content-p: Private ordinary functions
Function, hash-dict-content-hash: Private ordinary functions
Function, hash-dict-content-location: Private ordinary functions
Function, hash-dict-content-p: Private ordinary functions
Function, hash-dict-content-value: Public ordinary functions
Function, hash-integer: Public ordinary functions
Function, hash-node-access: Public ordinary functions
Function, hash-node-contains: Public ordinary functions
Function, hash-node-contains-node: Public ordinary functions
Function, hash-node-content: Public ordinary functions
Function, hash-node-deep-copy: Public ordinary functions
Function, hash-node-insert!: Public ordinary functions
Function, hash-node-insert-into-copy: Public ordinary functions
Function, hash-node-node-mask: Private ordinary functions
Function, hash-node-p: Public ordinary functions
Function, hash-node-remove!: Public ordinary functions
Function, hash-node-remove-from-the-copy: Public ordinary functions
Function, hash-node-replace!: Public ordinary functions
Function, hash-node-replace-in-the-copy: Public ordinary functions
Function, hash-node-size: Public ordinary functions
Function, hash-node-tagged-content: Private ordinary functions
Function, hash-node-tagged-node-mask: Private ordinary functions
Function, hash-node-tagged-ownership-tag: Private ordinary functions
Function, hash-node-tagged-p: Private ordinary functions
Function, hash-node-to-masked-index: Public ordinary functions
Function, hash-node-untagged-content: Private ordinary functions
Function, hash-node-untagged-node-mask: Private ordinary functions
Function, hash-node-untagged-p: Private ordinary functions
Function, hash-node-whole-mask: Public ordinary functions
Function, hash-shifts: Private ordinary functions
Function, hashval: Public ordinary functions
Function, hashval-no-depth: Public ordinary functions
Function, hidden-markov-model-generator: Public ordinary functions
Function, highest-leader: Private ordinary functions
Function, hll-rank: Private ordinary functions
Function, homogenousp: Public ordinary functions
Function, hyperloglog-jaccard: Public ordinary functions
Function, if-else: Public ordinary functions
Function, ignore-errors*: Public ordinary functions
Function, in-shuffle-array: Private ordinary functions
Function, index-in-content-of-distance-matrix: Private ordinary functions
Function, init-chain-of-range: Private ordinary functions
Function, init-connected-ranges: Private ordinary functions
Function, init-rrb: Private ordinary functions
Function, init-vector-range: Private ordinary functions
Function, initialize-field: Private ordinary functions
Function, initialize-fields: Private ordinary functions
Function, initialize-mutual-information-hash-tables: Private ordinary functions
Function, initialize-split-point-field: Private ordinary functions
Function, insert-front-into-tree: Public ordinary functions
Function, insert-front-into-tree!: Public ordinary functions
Function, insert-into-node!: Private ordinary functions
Function, insert-new-node!: Private ordinary functions
Function, insert-node-between!: Public ordinary functions
Function, insert-or: Public ordinary functions
Function, insert-or-replace: Public ordinary functions
Function, insert-tail: Public ordinary functions
Function, insert-tail: Public ordinary functions
Function, insert-tail!: Public ordinary functions
Function, insert-tail-handle-root-overflow: Private ordinary functions
Function, intersection-cardinality: Public ordinary functions
Function, inverse-in-shuffle-array: Private ordinary functions
Function, inverted-hash-table: Public ordinary functions
Function, iota-range: Public ordinary functions
Function, jaccard: Public ordinary functions
Function, key-parameters-start-at: Private ordinary functions
Function, lambda-list-to-bindings: Public ordinary functions
Function, lambda-list-to-call-form: Public ordinary functions
Function, lazy-shuffle: Public ordinary functions
Function, lexicographic-compare: Public ordinary functions
Function, line-by-line: Public ordinary functions
Function, locate-node: Public ordinary functions
Function, lower-bound: Public ordinary functions
Function, lz: Private ordinary functions
Function, make-adjusted-tree: Private ordinary functions
Function, make-aggregator: Private ordinary functions
Function, make-approximated-histogram: Public ordinary functions
Function, make-approximated-histogram-bin: Private ordinary functions
Function, make-assoc-skip-list-node: Private ordinary functions
Function, make-changes: Private ordinary functions
Function, make-children-vector: Private ordinary functions
Function, make-content-vector: Private ordinary functions
Function, make-delay: Public ordinary functions
Function, make-dict-content: Public ordinary functions
Function, make-distance-matrix-from-vector: Public ordinary functions
Function, make-eager-modification-operation-status: Public ordinary functions
Function, make-egnat-tree: Public ordinary functions
Function, make-functional-2-3-queue: Public ordinary functions
Function, make-functional-composite-container: Public ordinary functions
Function, make-functional-hamt-dictionary: Public ordinary functions
Function, make-functional-rrb-vector: Public ordinary functions
Function, make-functional-sparse-rrb-vector: Public ordinary functions
Function, make-future-carousel: Public ordinary functions
Function, make-half-matrix: Public ordinary functions
Function, make-hamt-range-stack-cell: Private ordinary functions
Function, make-hash-array: Public ordinary functions
Function, make-hash-content: Public ordinary functions
Function, make-hash-dict-content: Public ordinary functions
Function, make-hash-dict-content: Private ordinary functions
Function, make-hash-node: Private ordinary functions
Function, make-hash-node-tagged: Private ordinary functions
Function, make-hash-node-untagged: Private ordinary functions
Function, make-hash-table-range: Public ordinary functions
Function, make-minhash: Public ordinary functions
Function, make-mutable-2-3-queue: Public ordinary functions
Function, make-mutable-composite-container: Public ordinary functions
Function, make-mutable-egnat-metric-set: Public ordinary functions
Function, make-mutable-hamt-dictionary: Public ordinary functions
Function, make-mutable-of-size: Private ordinary functions
Function, make-mutable-qp-trie-set: Public ordinary functions
Function, make-mutable-rrb-vector: Public ordinary functions
Function, make-mutable-skip-list-dictionary: Public ordinary functions
Function, make-mutable-skip-list-set: Public ordinary functions
Function, make-mutable-sparse-rrb-vector: Public ordinary functions
Function, make-node-content: Public ordinary functions
Function, make-node-from-tail: Private ordinary functions
Function, make-one-bit-minhash: Public ordinary functions
Function, make-ownership-tag: Public ordinary functions
Function, make-partitions: Private ordinary functions
Function, make-pipe-fragment: Public ordinary functions
Function, make-qp-trie-node: Public ordinary functions
Function, make-qp-trie-node-tagged: Private ordinary functions
Function, make-qp-trie-node-untagged: Private ordinary functions
Function, make-range-from-root: Private ordinary functions
Function, make-range-from-tail: Private ordinary functions
Function, make-ranges: Private ordinary functions
Function, make-reservoir-sampling: Public ordinary functions
Function, make-reservoir-sampling*: Private ordinary functions
Function, make-rrb-node: Public ordinary functions
Function, make-skip-list-node: Public ordinary functions
Function, make-skip-list-node*: Private ordinary functions
Function, make-skip-list-node-of-level: Public ordinary functions
Function, make-skip-list-node-of-random-level: Public ordinary functions
Function, make-sparse-rrb-node: Public ordinary functions
Function, make-sparse-rrb-node-tagged: Private ordinary functions
Function, make-sparse-rrb-node-untagged: Private ordinary functions
Function, make-srrb-range-stack-cell: Private ordinary functions
Function, make-synchronized-mutable-2-3-queue: Public ordinary functions
Function, make-synchronized-transactional-2-3-queue: Public ordinary functions
Function, make-tagged-struct-node: Private ordinary functions
Function, make-transactional-2-3-queue: Public ordinary functions
Function, make-transactional-hamt-dictionary: Public ordinary functions
Function, make-transactional-rrb-vector: Public ordinary functions
Function, make-transactional-sparse-rrb-vector: Public ordinary functions
Function, map-qp-trie-nodes: Public ordinary functions
Function, merge-ordered-vectors: Public ordinary functions
Function, method-lambda-list-to-function-lambda-list: Public ordinary functions
Function, minhash-corpus-minhash: Private ordinary functions
Function, minhash-jaccard/double-float: Public ordinary functions
Function, minhash-jaccard/fixnum: Public ordinary functions
Function, minhash-jaccard/single-float: Public ordinary functions
Function, modulo-range: Public ordinary functions
Function, move-updated: Private ordinary functions
Function, mref: Public ordinary functions
Function, mutable-from-traversable: Private ordinary functions
Function, mutable-from-traversable: Private ordinary functions
Function, mutable-sparse-rrb-vector-grow: Public ordinary functions
Function, mutual-information-hash-table: Private ordinary functions
Function, new-cell: Public ordinary functions
Function, new-cell: Private ordinary functions
Function, new-node-update-pointers!: Public ordinary functions
Function, new-register: Private ordinary functions
Function, new-sketch: Public ordinary functions
Function, next-index: Private ordinary functions
Function, node-children-full-p: Private ordinary functions
Function, node-full-p: Private ordinary functions
Function, node-head: Private ordinary functions
Function, normalize-sequence-to-span: Public ordinary functions
Function, normalize-sequence-to-sum: Public ordinary functions
Function, not-greater: Private ordinary functions
Function, nref: Public ordinary functions
Function, null-bucket-p: Public ordinary functions
Function, obtain-value: Public ordinary functions
Function, obtain-value: Private ordinary functions
Function, obtain-value: Private ordinary functions
Function, on-ordered-intersection: Public ordinary functions
Function, one-bit-minhash-jaccard/double-float: Public ordinary functions
Function, one-bit-minhash-jaccard/fixnum: Public ordinary functions
Function, one-bit-minhash-jaccard/single-float: Public ordinary functions
Function, or*: Public ordinary functions
Function, ordered-exclusion: Public ordinary functions
Function, ordered-intersection: Public ordinary functions
Function, ordered-p: Public ordinary functions
Function, parallel-fill-distance-matrix-from-vector: Public ordinary functions
Function, parallel-make-distance-matrix-from-vector: Public ordinary functions
Function, partition-if-consume-implementation: Private ordinary functions
Function, partition-points: Private ordinary functions
Function, pass-to-aggregation: Public ordinary functions
Function, path-scaner: Public ordinary functions
Function, peek-or-consume: Private ordinary functions
Function, pop-last: Public ordinary functions
Function, position-modification: Public ordinary functions
Function, position-modification!: Public ordinary functions
Function, position-to-value: Private ordinary functions
Function, prevent-duplicates: Public ordinary functions
Function, prune-subtrees: Public ordinary functions
Function, push-content: Private ordinary functions
Function, push-into-copy-of-tail: Private ordinary functions
Function, push-into-tail!: Private ordinary functions
Function, qp-trie-delete!: Public ordinary functions
Function, qp-trie-find: Public ordinary functions
Function, qp-trie-leaf-present-p: Private ordinary functions
Function, qp-trie-node-bitmask: Public ordinary functions
Function, qp-trie-node-children-bitmask: Public ordinary functions
Function, qp-trie-node-clone: Public ordinary functions
Function, qp-trie-node-contains-leafs-p: Private ordinary functions
Function, qp-trie-node-content: Public ordinary functions
Function, qp-trie-node-delete!: Public ordinary functions
Function, qp-trie-node-index: Private ordinary functions
Function, qp-trie-node-insert-new-node!: Private ordinary functions
Function, qp-trie-node-leaf-present-p: Public ordinary functions
Function, qp-trie-node-mark-leaf!: Private ordinary functions
Function, qp-trie-node-present-p: Public ordinary functions
Function, qp-trie-node-ref: Public ordinary functions
Function, qp-trie-node-size: Private ordinary functions
Function, qp-trie-node-store-bitmask: Public ordinary functions
Function, qp-trie-node-tagged-bitmask: Private ordinary functions
Function, qp-trie-node-tagged-content: Private ordinary functions
Function, qp-trie-node-tagged-ownership-tag: Private ordinary functions
Function, qp-trie-node-tagged-p: Private ordinary functions
Function, qp-trie-node-unmark-leaf!: Public ordinary functions
Function, qp-trie-node-untagged-bitmask: Private ordinary functions
Function, qp-trie-node-untagged-content: Private ordinary functions
Function, qp-trie-node-untagged-p: Private ordinary functions
Function, quasi-clone: Public ordinary functions
Function, quasi-clone-other-class: Private ordinary functions
Function, random-float: Private ordinary functions
Function, random-level: Public ordinary functions
Function, range-not-fully-read: Private ordinary functions
Function, read-implementation: Private ordinary functions
Function, read-new-value: Private ordinary functions
Function, read-stream: Private ordinary functions
Function, rebuild-rehashed-node: Public ordinary functions
Function, recursive-egnat-grow!: Private ordinary functions
Function, reg-sum-and-zeroes: Private ordinary functions
Function, regex-matches: Private ordinary functions
Function, rehash: Public ordinary functions
Function, remove-fill-pointer: Public ordinary functions
Function, remove-tail: Public ordinary functions
Function, replica: Public ordinary functions
Function, replica-of-seen: Private ordinary functions
Function, reservoir-sampling-p: Private ordinary functions
Function, reservoir-sampling-push: Public ordinary functions
Function, reservoir-sampling-result: Public ordinary functions
Function, reservoir-sampling-sample-size: Private ordinary functions
Function, reservoir-sampling-skip-count: Private ordinary functions
Function, reservoir-sampling-w: Private ordinary functions
Function, reset-ownership-tag: Private ordinary functions
Function, rol64: Public ordinary functions
Function, round-size: Private ordinary functions
Function, rrb-at: Public ordinary functions
Function, rrb-node-content: Public ordinary functions
Function, rrb-node-deep-copy: Private ordinary functions
Function, rrb-node-pop!: Private ordinary functions
Function, rrb-node-pop-in-the-copy: Private ordinary functions
Function, rrb-node-push!: Public ordinary functions
Function, rrb-node-push-into-copy: Public ordinary functions
Function, sample-position: Private ordinary functions
Function, scan: Public ordinary functions
Function, scan-index-bound: Public ordinary functions
Function, select-best-seeds: Private ordinary functions
Function, select-seeds: Private ordinary functions
Function, select-top: Public ordinary functions
Function, separate-operations/arguments: Private ordinary functions
Function, set-in-node-mask: Private ordinary functions
Function, set-in-tail: Private ordinary functions
Function, set-in-tail!: Private ordinary functions
Function, shift-for-position: Public ordinary functions
Function, shrink-handle-tail!: Private ordinary functions
Function, shrink-tree: Private ordinary functions
Function, shrink-tree!: Private ordinary functions
Function, shuffled-range: Public ordinary functions
Function, single-element-p: Public ordinary functions
Function, skip-list-locate-node: Public ordinary functions
Function, skip-list-node-at: Public ordinary functions
Function, skip-list-node-compare: Public ordinary functions
Function, skip-list-node-content: Public ordinary functions
Function, skip-list-node-level: Public ordinary functions
Function, skip-list-node-p: Private ordinary functions
Function, skip-list-node-pointers: Public ordinary functions
Function, skip-list-node-update-pointers!: Public ordinary functions
Function, sparse-nref: Public ordinary functions
Function, sparse-rrb-node-bitmask: Public ordinary functions
Function, sparse-rrb-node-contains: Public ordinary functions
Function, sparse-rrb-node-content: Public ordinary functions
Function, sparse-rrb-node-erase: Public ordinary functions
Function, sparse-rrb-node-erase!: Public ordinary functions
Function, sparse-rrb-node-size: Public ordinary functions
Function, sparse-rrb-node-tagged-bitmask: Private ordinary functions
Function, sparse-rrb-node-tagged-content: Private ordinary functions
Function, sparse-rrb-node-tagged-ownership-tag: Private ordinary functions
Function, sparse-rrb-node-tagged-p: Private ordinary functions
Function, sparse-rrb-node-untagged-bitmask: Private ordinary functions
Function, sparse-rrb-node-untagged-content: Private ordinary functions
Function, sparse-rrb-node-untagged-p: Private ordinary functions
Function, sparse-rrb-tree-map: Public ordinary functions
Function, sparse-rrb-tree-size: Public ordinary functions
Function, sparse-rrb-vector-at: Public ordinary functions
Function, split-byte: Private ordinary functions
Function, splitmix64: Private ordinary functions
Function, square: Public ordinary functions
Function, srrb-range-stack-cell-container: Private ordinary functions
Function, srrb-range-stack-cell-depth: Private ordinary functions
Function, srrb-range-stack-cell-end: Private ordinary functions
Function, srrb-range-stack-cell-is-tail: Private ordinary functions
Function, srrb-range-stack-cell-node-bitmask: Private ordinary functions
Function, srrb-range-stack-cell-node-content: Private ordinary functions
Function, srrb-range-stack-cell-p: Private ordinary functions
Function, srrb-range-stack-cell-start: Private ordinary functions
Function, srrb-range-stack-cell-upper-bits: Private ordinary functions
Function, struct-accessor-name: Private ordinary functions
Function, swap-if: Public ordinary functions
Function, swapop: Public ordinary functions
Function, tagged-node-ownership-tag: Private ordinary functions
Function, tagged-struct-node-ownership-tag: Private ordinary functions
Function, tagged-struct-node-p: Private ordinary functions
Function, tail-copy: Private ordinary functions
Function, tail-offset: Private ordinary functions
Function, times-matches: Private ordinary functions
Function, to-pathname: Private ordinary functions
Function, tokenize: Public ordinary functions
Function, transactional-copy-on-write: Public ordinary functions
Function, transactional-copy-on-write: Public ordinary functions
Function, transactional-delete-back-from-tree!: Public ordinary functions
Function, transactional-grow-tree!: Private ordinary functions
Function, transactional-insert-front-into-tree!: Public ordinary functions
Function, transactional-insert-tail!: Public ordinary functions
Function, transactional-shrink-handle-tail!: Private ordinary functions
Function, transactional-shrink-tree!: Private ordinary functions
Function, transactional-sparse-rrb-vector-grow: Public ordinary functions
Function, transform: Public ordinary functions
Function, traverse-impl: Public ordinary functions
Function, traverse-multiple: Public ordinary functions
Function, tree-index-bound: Private ordinary functions
Function, try-find: Public ordinary functions
Function, try-find-cell: Public ordinary functions
Function, try-remove: Public ordinary functions
Function, unfold-table: Public ordinary functions
Function, union: Public ordinary functions
Function, unmerge-pathnames: Private ordinary functions
Function, unset-in-tail: Private ordinary functions
Function, unset-in-tail!: Private ordinary functions
Function, update-count-min-sketch: Private ordinary functions
Function, update-head-pointers!: Public ordinary functions
Function, update-ranges!: Private ordinary functions
Function, validate-fields: Public ordinary functions
Function, validation-form: Private ordinary functions
Function, visit-every-bucket: Private ordinary functions
Function, xorshift: Public ordinary functions
Function, xoshiro256**: Private ordinary functions
Function, zip: Public ordinary functions
Function, zip-traversable: Public ordinary functions
functional-counterpart: Public generic functions
functional-counterpart: Public generic functions
functional-counterpart: Public generic functions
functional-counterpart: Public generic functions
functional-counterpart: Public generic functions
functional-counterpart: Public generic functions
functional-counterpart: Public generic functions
functional-counterpart: Public generic functions
functional-counterpart: Public generic functions
functional-counterpart: Public generic functions
functional-counterpart: Public generic functions
functional-sparse-rrb-vector-grow: Public ordinary functions
functionalp: Public generic functions
functionalp: Public generic functions
functionalp: Public generic functions
fundamental-range-class-of: Private generic functions
fundamental-range-class-of: Private generic functions
fundamental-range-class-of: Private generic functions
fundamental-range-class-of: Private generic functions
fundamental-range-class-of: Private generic functions

G
gather-minhash-corpus: Public generic functions
gather-minhash-corpus: Public generic functions
gather-pointers: Private ordinary functions
gen-w: Private ordinary functions
generate-if-else: Private ordinary functions
generate-validation-forms: Private ordinary functions
generator: Public ordinary functions
Generic Function, %summary: Public generic functions
Generic Function, (setf access-arguments-closure): Private generic functions
Generic Function, (setf access-begin): Private generic functions
Generic Function, (setf access-bins): Private generic functions
Generic Function, (setf access-close-range): Private generic functions
Generic Function, (setf access-closure): Private generic functions
Generic Function, (setf access-collected): Private generic functions
Generic Function, (setf access-container): Private generic functions
Generic Function, (setf access-container): Private generic functions
Generic Function, (setf access-content): Public generic functions
Generic Function, (setf access-content): Private generic functions
Generic Function, (setf access-count): Private generic functions
Generic Function, (setf access-count): Private generic functions
Generic Function, (setf access-counters): Private generic functions
Generic Function, (setf access-current): Private generic functions
Generic Function, (setf access-current-index): Private generic functions
Generic Function, (setf access-current-node): Private generic functions
Generic Function, (setf access-current-position): Public generic functions
Generic Function, (setf access-depth): Private generic functions
Generic Function, (setf access-distant-range): Private generic functions
Generic Function, (setf access-eager-status): Private generic functions
Generic Function, (setf access-end): Private generic functions
Generic Function, (setf access-fill-pointer): Private generic functions
Generic Function, (setf access-finished-closure): Private generic functions
Generic Function, (setf access-forward-stack): Private generic functions
Generic Function, (setf access-functor): Public generic functions
Generic Function, (setf access-hash-fn): Private generic functions
Generic Function, (setf access-hashes): Private generic functions
Generic Function, (setf access-head): Private generic functions
Generic Function, (setf access-head-position): Private generic functions
Generic Function, (setf access-index): Private generic functions
Generic Function, (setf access-index): Private generic functions
Generic Function, (setf access-index-bound): Public generic functions
Generic Function, (setf access-initial-state): Private generic functions
Generic Function, (setf access-initial-to): Private generic functions
Generic Function, (setf access-last-size): Public generic functions
Generic Function, (setf access-left): Public generic functions
Generic Function, (setf access-lines-read): Private generic functions
Generic Function, (setf access-lower-bound): Public generic functions
Generic Function, (setf access-lower-bound): Private generic functions
Generic Function, (setf access-max): Private generic functions
Generic Function, (setf access-maximum-level): Public generic functions
Generic Function, (setf access-middle): Public generic functions
Generic Function, (setf access-min): Private generic functions
Generic Function, (setf access-og-container): Private generic functions
Generic Function, (setf access-operations): Private generic functions
Generic Function, (setf access-position): Private generic functions
Generic Function, (setf access-prev-cell): Private generic functions
Generic Function, (setf access-previous): Private generic functions
Generic Function, (setf access-previous-bound): Private generic functions
Generic Function, (setf access-reached-end): Public generic functions
Generic Function, (setf access-registers): Private generic functions
Generic Function, (setf access-right): Public generic functions
Generic Function, (setf access-root): Public generic functions
Generic Function, (setf access-root): Public generic functions
Generic Function, (setf access-root): Public generic functions
Generic Function, (setf access-root): Public generic functions
Generic Function, (setf access-root): Public generic functions
Generic Function, (setf access-shift): Public generic functions
Generic Function, (setf access-shift): Public generic functions
Generic Function, (setf access-size): Public generic functions
Generic Function, (setf access-size): Public generic functions
Generic Function, (setf access-size): Public generic functions
Generic Function, (setf access-size): Public generic functions
Generic Function, (setf access-split-point): Private generic functions
Generic Function, (setf access-stack): Private generic functions
Generic Function, (setf access-stack): Private generic functions
Generic Function, (setf access-start): Public generic functions
Generic Function, (setf access-state): Private generic functions
Generic Function, (setf access-state): Private generic functions
Generic Function, (setf access-sum): Private generic functions
Generic Function, (setf access-tail): Public generic functions
Generic Function, (setf access-tail): Public generic functions
Generic Function, (setf access-tail): Private generic functions
Generic Function, (setf access-tail): Private generic functions
Generic Function, (setf access-tail-end): Private generic functions
Generic Function, (setf access-tail-mask): Public generic functions
Generic Function, (setf access-tail-position): Private generic functions
Generic Function, (setf access-tail-size): Public generic functions
Generic Function, (setf access-test-function): Public generic functions
Generic Function, (setf access-tree): Public generic functions
Generic Function, (setf access-tree-index-bound): Public generic functions
Generic Function, (setf access-tree-size): Public generic functions
Generic Function, (setf access-upper-bound): Public generic functions
Generic Function, (setf access-upper-bound): Private generic functions
Generic Function, (setf access-width): Private generic functions
Generic Function, (setf access-window): Private generic functions
Generic Function, (setf at): Public generic functions
Generic Function, (setf beta0): Public generic functions
Generic Function, (setf beta1): Public generic functions
Generic Function, (setf peek-back): Public generic functions
Generic Function, (setf peek-front): Public generic functions
Generic Function, (setf read-initial-previous): Private generic functions
Generic Function, (setf read-initial-previous-bound): Private generic functions
Generic Function, (setf read-latches): Private generic functions
Generic Function, (setf root): Private generic functions
Generic Function, (setf stack): Private generic functions
Generic Function, absolute-value-norm: Public generic functions
Generic Function, access-arguments-closure: Private generic functions
Generic Function, access-begin: Private generic functions
Generic Function, access-bins: Private generic functions
Generic Function, access-close-range: Private generic functions
Generic Function, access-closure: Private generic functions
Generic Function, access-collected: Private generic functions
Generic Function, access-container: Private generic functions
Generic Function, access-container: Private generic functions
Generic Function, access-content: Public generic functions
Generic Function, access-content: Private generic functions
Generic Function, access-count: Private generic functions
Generic Function, access-count: Private generic functions
Generic Function, access-counters: Private generic functions
Generic Function, access-current: Private generic functions
Generic Function, access-current-index: Private generic functions
Generic Function, access-current-node: Private generic functions
Generic Function, access-current-position: Public generic functions
Generic Function, access-depth: Private generic functions
Generic Function, access-distant-range: Private generic functions
Generic Function, access-eager-status: Private generic functions
Generic Function, access-end: Private generic functions
Generic Function, access-fill-pointer: Private generic functions
Generic Function, access-finished-closure: Private generic functions
Generic Function, access-forward-stack: Private generic functions
Generic Function, access-functor: Public generic functions
Generic Function, access-hash-fn: Private generic functions
Generic Function, access-hashes: Private generic functions
Generic Function, access-head: Private generic functions
Generic Function, access-head-position: Private generic functions
Generic Function, access-index: Private generic functions
Generic Function, access-index: Private generic functions
Generic Function, access-index-bound: Public generic functions
Generic Function, access-initial-state: Private generic functions
Generic Function, access-initial-to: Private generic functions
Generic Function, access-last-size: Public generic functions
Generic Function, access-left: Public generic functions
Generic Function, access-lines-read: Private generic functions
Generic Function, access-lower-bound: Public generic functions
Generic Function, access-lower-bound: Private generic functions
Generic Function, access-max: Private generic functions
Generic Function, access-maximum-level: Public generic functions
Generic Function, access-middle: Public generic functions
Generic Function, access-min: Private generic functions
Generic Function, access-og-container: Private generic functions
Generic Function, access-operations: Private generic functions
Generic Function, access-position: Private generic functions
Generic Function, access-prev-cell: Private generic functions
Generic Function, access-previous: Private generic functions
Generic Function, access-previous-bound: Private generic functions
Generic Function, access-reached-end: Public generic functions
Generic Function, access-registers: Private generic functions
Generic Function, access-right: Public generic functions
Generic Function, access-root: Public generic functions
Generic Function, access-root: Public generic functions
Generic Function, access-root: Public generic functions
Generic Function, access-root: Public generic functions
Generic Function, access-root: Public generic functions
Generic Function, access-shift: Public generic functions
Generic Function, access-shift: Public generic functions
Generic Function, access-size: Public generic functions
Generic Function, access-size: Public generic functions
Generic Function, access-size: Public generic functions
Generic Function, access-size: Public generic functions
Generic Function, access-split-point: Private generic functions
Generic Function, access-stack: Private generic functions
Generic Function, access-stack: Private generic functions
Generic Function, access-start: Public generic functions
Generic Function, access-state: Private generic functions
Generic Function, access-state: Private generic functions
Generic Function, access-sum: Private generic functions
Generic Function, access-tail: Public generic functions
Generic Function, access-tail: Public generic functions
Generic Function, access-tail: Private generic functions
Generic Function, access-tail: Private generic functions
Generic Function, access-tail-end: Private generic functions
Generic Function, access-tail-mask: Public generic functions
Generic Function, access-tail-position: Private generic functions
Generic Function, access-tail-size: Public generic functions
Generic Function, access-test-function: Public generic functions
Generic Function, access-tree: Public generic functions
Generic Function, access-tree-index-bound: Public generic functions
Generic Function, access-tree-size: Public generic functions
Generic Function, access-upper-bound: Public generic functions
Generic Function, access-upper-bound: Private generic functions
Generic Function, access-width: Private generic functions
Generic Function, access-window: Private generic functions
Generic Function, across: Public generic functions
Generic Function, across-aggregate: Public generic functions
Generic Function, add: Public generic functions
Generic Function, add!: Public generic functions
Generic Function, add-into-queue: Public generic functions
Generic Function, add-sinks: Public generic functions
Generic Function, aggregator-constructor: Public generic functions
Generic Function, alter-bucket: Public generic functions
Generic Function, alter-bucket!: Public generic functions
Generic Function, apply-aggregation-function: Public generic functions
Generic Function, apply-layer: Public generic functions
Generic Function, apply-range-function: Public generic functions
Generic Function, approximated-counts: Public generic functions
Generic Function, approximated-histogram: Public generic functions
Generic Function, approximated-set-cardinality: Public generic functions
Generic Function, approximated-top-k: Public generic functions
Generic Function, array-average: Public generic functions
Generic Function, array-elementwise: Public generic functions
Generic Function, array-geometric-average: Public generic functions
Generic Function, array-harmonic-average: Public generic functions
Generic Function, array-sum: Public generic functions
Generic Function, at: Public generic functions
Generic Function, average: Public generic functions
Generic Function, become-functional: Public generic functions
Generic Function, become-lazy: Public generic functions
Generic Function, become-mutable: Public generic functions
Generic Function, become-subtree*: Private generic functions
Generic Function, become-transactional: Public generic functions
Generic Function, beta0: Public generic functions
Generic Function, beta1: Public generic functions
Generic Function, between*: Public generic functions
Generic Function, bloom-filter: Public generic functions
Generic Function, bootstrap: Public generic functions
Generic Function, changed: Public generic functions
Generic Function, chunked: Public generic functions
Generic Function, clean-sketch: Public generic functions
Generic Function, clone: Public generic functions
Generic Function, clone-cell: Private generic functions
Generic Function, cloning-information: Public generic functions
Generic Function, close-inner-stream: Public generic functions
Generic Function, co-occurence-table: Public generic functions
Generic Function, compatiblep: Private generic functions
Generic Function, consume-back: Public generic functions
Generic Function, consume-front: Public generic functions
Generic Function, count-elements: Public generic functions
Generic Function, cumulative-accumulate: Public generic functions
Generic Function, delete-back: Private generic functions
Generic Function, delete-back!: Private generic functions
Generic Function, depth: Private generic functions
Generic Function, destructive-counterpart: Public generic functions
Generic Function, dimensionality: Public generic functions
Generic Function, distance: Public generic functions
Generic Function, distance: Public generic functions
Generic Function, distinct: Public generic functions
Generic Function, drop-back: Public generic functions
Generic Function, drop-front: Public generic functions
Generic Function, each-in-matrix: Public generic functions
Generic Function, eat-cell: Private generic functions
Generic Function, effective-at: Private generic functions
Generic Function, empty-clone: Public generic functions
Generic Function, end: Private generic functions
Generic Function, end-execution: Public generic functions
Generic Function, entropy: Public generic functions
Generic Function, enumerate: Public generic functions
Generic Function, erase: Public generic functions
Generic Function, erase!: Public generic functions
Generic Function, erase*: Public generic functions
Generic Function, erase*!: Public generic functions
Generic Function, erase-if: Public generic functions
Generic Function, erase-if!: Public generic functions
Generic Function, establish-special: Public generic functions
Generic Function, extrema: Public generic functions
Generic Function, extremum: Public generic functions
Generic Function, fast-map: Public generic functions
Generic Function, find: Public generic functions
Generic Function, first-element: Public generic functions
Generic Function, flatten-lists: Public generic functions
Generic Function, forward-call: Public generic functions
Generic Function, found: Public generic functions
Generic Function, frequency: Public generic functions
Generic Function, fresh-bucket-status: Public generic functions
Generic Function, functional-counterpart: Public generic functions
Generic Function, functionalp: Public generic functions
Generic Function, fundamental-range-class-of: Private generic functions
Generic Function, gather-minhash-corpus: Public generic functions
Generic Function, geometric-average: Public generic functions
Generic Function, get-range-key-function: Public generic functions
Generic Function, gini-impurity: Public generic functions
Generic Function, group-by: Public generic functions
Generic Function, grow: Private generic functions
Generic Function, harmonic-average: Public generic functions
Generic Function, harmonic-average-mutual-information: Public generic functions
Generic Function, hash-table-elementwise: Public generic functions
Generic Function, hodges-lehmann-estimator: Public generic functions
Generic Function, in-batches: Public generic functions
Generic Function, initial-stack: Private generic functions
Generic Function, insert: Public generic functions
Generic Function, insert!: Public generic functions
Generic Function, insert-front: Private generic functions
Generic Function, insert-front!: Private generic functions
Generic Function, internal-array: Public generic functions
Generic Function, last-element: Public generic functions
Generic Function, latch: Public generic functions
Generic Function, layer-aggregator-constructor: Public generic functions
Generic Function, list-of-slots: Private generic functions
Generic Function, lower-bound: Public generic functions
Generic Function, make-bucket: Public generic functions
Generic Function, make-bucket-callbacks: Private generic functions
Generic Function, make-bucket-from-multiple: Public generic functions
Generic Function, make-from-traversable: Public generic functions
Generic Function, make-of-size: Public generic functions
Generic Function, make-proxy: Public generic functions
Generic Function, make-range: Public generic functions
Generic Function, make-stack-cell: Private generic functions
Generic Function, make-state: Private generic functions
Generic Function, map-bucket: Public generic functions
Generic Function, maximal-bins-count: Private generic functions
Generic Function, median-absolute-deviation: Public generic functions
Generic Function, minhash: Public generic functions
Generic Function, minhash-corpus-hash-value: Private generic functions
Generic Function, moments: Public generic functions
Generic Function, more-checks-end: Private generic functions
Generic Function, more-checks-start: Private generic functions
Generic Function, moving-average: Public generic functions
Generic Function, multiplex: Public generic functions
Generic Function, mutablep: Public generic functions
Generic Function, mutate-matrix: Public generic functions
Generic Function, mutual-information: Public generic functions
Generic Function, mutual-information-matrix: Public generic functions
Generic Function, near: Public generic functions
Generic Function, next-elements: Private generic functions
Generic Function, node: Private generic functions
Generic Function, on-each: Public generic functions
Generic Function, on-each-proxy-range-from-range: Private generic functions
Generic Function, only: Public generic functions
Generic Function, only-different: Public generic functions
Generic Function, open-stream-designator: Public generic functions
Generic Function, optimal-split-point: Public generic functions
Generic Function, parallel-group-by: Public generic functions
Generic Function, parallel-multiplex: Public generic functions
Generic Function, parallel-on-each: Public generic functions
Generic Function, parents: Private generic functions
Generic Function, partition-if: Public generic functions
Generic Function, pass-bucket-operation: Public generic functions
Generic Function, pass-bucket-query: Public generic functions
Generic Function, path: Public generic functions
Generic Function, peek-back: Public generic functions
Generic Function, peek-front: Public generic functions
Generic Function, position-modification: Public generic functions
Generic Function, print-condition: Private generic functions
Generic Function, put: Public generic functions
Generic Function, put!: Public generic functions
Generic Function, put-back: Public generic functions
Generic Function, put-back!: Public generic functions
Generic Function, put-front: Public generic functions
Generic Function, put-front!: Public generic functions
Generic Function, rate: Public generic functions
Generic Function, read-argument: Private generic functions
Generic Function, read-arguments: Public generic functions
Generic Function, read-batch-size: Private generic functions
Generic Function, read-bindings: Private generic functions
Generic Function, read-body: Private generic functions
Generic Function, read-bounds: Public generic functions
Generic Function, read-branching-factor: Private generic functions
Generic Function, read-bucket-size: Private generic functions
Generic Function, read-callback: Private generic functions
Generic Function, read-capacity: Private generic functions
Generic Function, read-changed: Private generic functions
Generic Function, read-children: Private generic functions
Generic Function, read-chunk-size: Private generic functions
Generic Function, read-chunk-size: Private generic functions
Generic Function, read-chunked-range: Private generic functions
Generic Function, read-chunks: Private generic functions
Generic Function, read-class: Public generic functions
Generic Function, read-close-range: Private generic functions
Generic Function, read-command-string: Private generic functions
Generic Function, read-compare: Private generic functions
Generic Function, read-comparsion: Private generic functions
Generic Function, read-confidence: Private generic functions
Generic Function, read-container: Private generic functions
Generic Function, read-container: Private generic functions
Generic Function, read-content: Private generic functions
Generic Function, read-content: Private generic functions
Generic Function, read-content: Private generic functions
Generic Function, read-content: Private generic functions
Generic Function, read-content: Private generic functions
Generic Function, read-content-count-in-node: Private generic functions
Generic Function, read-context-function: Private generic functions
Generic Function, read-cumulative-key: Private generic functions
Generic Function, read-data: Private generic functions
Generic Function, read-discrete: Private generic functions
Generic Function, read-discrete-values-set: Private generic functions
Generic Function, read-distant-range: Private generic functions
Generic Function, read-element-type: Public generic functions
Generic Function, read-element-type: Public generic functions
Generic Function, read-element-type: Private generic functions
Generic Function, read-end-on-empty: Private generic functions
Generic Function, read-equal-fn: Public generic functions
Generic Function, read-found: Public generic functions
Generic Function, read-from: Private generic functions
Generic Function, read-from: Private generic functions
Generic Function, read-function: Public generic functions
Generic Function, read-function: Private generic functions
Generic Function, read-functor-constructor: Public generic functions
Generic Function, read-functor-prototype: Public generic functions
Generic Function, read-groups: Private generic functions
Generic Function, read-groups: Private generic functions
Generic Function, read-hash-array: Private generic functions
Generic Function, read-hash-fn: Public generic functions
Generic Function, read-hash-function: Private generic functions
Generic Function, read-hash-table: Public generic functions
Generic Function, read-having: Private generic functions
Generic Function, read-having: Private generic functions
Generic Function, read-initial-begin: Private generic functions
Generic Function, read-initial-count: Private generic functions
Generic Function, read-initial-current: Private generic functions
Generic Function, read-initial-current-node: Private generic functions
Generic Function, read-initial-current-position: Private generic functions
Generic Function, read-initial-end: Private generic functions
Generic Function, read-initial-lines-read: Private generic functions
Generic Function, read-initial-lower-bound: Private generic functions
Generic Function, read-initial-lower-bound: Private generic functions
Generic Function, read-initial-position: Private generic functions
Generic Function, read-initial-position: Private generic functions
Generic Function, read-initial-previous: Private generic functions
Generic Function, read-initial-previous-bound: Private generic functions
Generic Function, read-initial-stack: Private generic functions
Generic Function, read-initial-stack: Private generic functions
Generic Function, read-initial-state: Private generic functions
Generic Function, read-initial-sum: Private generic functions
Generic Function, read-initial-upper-bound: Private generic functions
Generic Function, read-initial-upper-bound: Private generic functions
Generic Function, read-initial-window: Private generic functions
Generic Function, read-k: Private generic functions
Generic Function, read-key: Public generic functions
Generic Function, read-key: Private generic functions
Generic Function, read-key: Private generic functions
Generic Function, read-key: Private generic functions
Generic Function, read-key: Private generic functions
Generic Function, read-keys: Public generic functions
Generic Function, read-last-node: Private generic functions
Generic Function, read-latches: Private generic functions
Generic Function, read-lazy-instance: Private generic functions
Generic Function, read-lock: Private generic functions
Generic Function, read-margin: Public generic functions
Generic Function, read-max-bins: Private generic functions
Generic Function, read-maximum-queue-size: Private generic functions
Generic Function, read-metric-fn: Private generic functions
Generic Function, read-metric-type: Private generic functions
Generic Function, read-mutex: Private generic functions
Generic Function, read-mutex: Private generic functions
Generic Function, read-name: Private generic functions
Generic Function, read-near: Public generic functions
Generic Function, read-notify-pop: Private generic functions
Generic Function, read-notify-push: Private generic functions
Generic Function, read-obtain-value: Private generic functions
Generic Function, read-offset: Private generic functions
Generic Function, read-on-first: Private generic functions
Generic Function, read-operation: Private generic functions
Generic Function, read-ordering-function: Public generic functions
Generic Function, read-original-collected: Private generic functions
Generic Function, read-original-content: Private generic functions
Generic Function, read-original-content: Private generic functions
Generic Function, read-original-data: Private generic functions
Generic Function, read-original-range: Public generic functions
Generic Function, read-original-range: Private generic functions
Generic Function, read-original-seen: Private generic functions
Generic Function, read-original-selector-function: Private generic functions
Generic Function, read-ownership-tag: Public generic functions
Generic Function, read-parallel: Private generic functions
Generic Function, read-path: Public generic functions
Generic Function, read-pointers: Public generic functions
Generic Function, read-predicate: Private generic functions
Generic Function, read-predicate: Private generic functions
Generic Function, read-queue: Private generic functions
Generic Function, read-range: Private generic functions
Generic Function, read-ranges: Private generic functions
Generic Function, read-regex: Private generic functions
Generic Function, read-result: Private generic functions
Generic Function, read-rrb-range: Private generic functions
Generic Function, read-sample-size: Private generic functions
Generic Function, read-samples-count: Private generic functions
Generic Function, read-samples-count: Private generic functions
Generic Function, read-seeds: Private generic functions
Generic Function, read-seen: Private generic functions
Generic Function, read-selector-function: Private generic functions
Generic Function, read-sinks: Private generic functions
Generic Function, read-sinks-lock: Private generic functions
Generic Function, read-size: Public generic functions
Generic Function, read-size: Private generic functions
Generic Function, read-split-point-count: Private generic functions
Generic Function, read-store-value: Public generic functions
Generic Function, read-table: Private generic functions
Generic Function, read-table: Private generic functions
Generic Function, read-test: Private generic functions
Generic Function, read-test: Private generic functions
Generic Function, read-thread: Private generic functions
Generic Function, read-times: Private generic functions
Generic Function, read-times: Private generic functions
Generic Function, read-to: Private generic functions
Generic Function, read-to: Private generic functions
Generic Function, read-transform: Private generic functions
Generic Function, read-transform: Private generic functions
Generic Function, read-value: Public generic functions
Generic Function, read-value: Public generic functions
Generic Function, read-vector: Private generic functions
Generic Function, read-vector: Private generic functions
Generic Function, read-vectors-in-chunk: Private generic functions
Generic Function, read-window-size: Private generic functions
Generic Function, read-xors: Private generic functions
Generic Function, recursive-egnat-grow!*: Private generic functions
Generic Function, replica: Public generic functions
Generic Function, reservoir-sample: Public generic functions
Generic Function, reset!: Public generic functions
Generic Function, reset-cell: Private generic functions
Generic Function, restrain-size: Public generic functions
Generic Function, root: Private generic functions
Generic Function, select-children: Public generic functions
Generic Function, sequence-window: Public generic functions
Generic Function, set-stream-position: Private generic functions
Generic Function, should-skip: Public generic functions
Generic Function, shrink: Private generic functions
Generic Function, simple-linear-regression: Public generic functions
Generic Function, size: Public generic functions
Generic Function, skip-list-node-clone: Public generic functions
Generic Function, sliding-window: Public generic functions
Generic Function, stack: Private generic functions
Generic Function, standard-deviation: Public generic functions
Generic Function, start: Private generic functions
Generic Function, start-execution: Public generic functions
Generic Function, state-result: Public generic functions
Generic Function, stream-designator-p: Public generic functions
Generic Function, take-back: Private generic functions
Generic Function, take-out: Public generic functions
Generic Function, take-out!: Public generic functions
Generic Function, take-out-back: Public generic functions
Generic Function, take-out-back!: Public generic functions
Generic Function, take-out-front: Public generic functions
Generic Function, take-out-front!: Public generic functions
Generic Function, thread-buffer: Public generic functions
Generic Function, to-hash-table: Public generic functions
Generic Function, to-list: Public generic functions
Generic Function, to-vector: Public generic functions
Generic Function, transactional-delete-back!: Private generic functions
Generic Function, transactional-insert-front!: Private generic functions
Generic Function, transactionalp: Public generic functions
Generic Function, translation: Public generic functions
Generic Function, traverse: Public generic functions
Generic Function, type-specialization: Public generic functions
Generic Function, union: Public generic functions
Generic Function, update: Public generic functions
Generic Function, update!: Public generic functions
Generic Function, update-if: Public generic functions
Generic Function, update-if!: Public generic functions
Generic Function, validate-field: Public generic functions
Generic Function, validation-form-for: Private generic functions
Generic Function, value: Public generic functions
Generic Function, variance: Public generic functions
Generic Function, whole-range: Public generic functions
Generic Function, with-previous-element: Public generic functions
Generic Function, without: Public generic functions
Generic Function, wrap-chunk: Public generic functions
Generic Function, write-changed: Private generic functions
Generic Function, write-found: Private generic functions
Generic Function, write-lazy-instance: Private generic functions
Generic Function, write-ownership-tag: Public generic functions
Generic Function, write-value: Private generic functions
geometric-average: Public generic functions
geometric-average: Public generic functions
get-range-key-function: Public generic functions
get-range-key-function: Public generic functions
gini-impurity: Public generic functions
gini-impurity: Public generic functions
go-down-on-path: Public ordinary functions
group-by: Public generic functions
group-by: Public generic functions
grow: Private generic functions
grow: Private generic functions
grow: Private generic functions
grow-tree: Private ordinary functions

H
half-byte-list-to-array: Public ordinary functions
hamt-dictionary-at: Public ordinary functions
hamt-dictionary-size: Public ordinary functions
hamt-range-stack-cell-end: Private ordinary functions
hamt-range-stack-cell-node: Private ordinary functions
hamt-range-stack-cell-p: Private ordinary functions
hamt-range-stack-cell-start: Private ordinary functions
harmonic-average: Public generic functions
harmonic-average: Public generic functions
harmonic-average-mutual-information: Public generic functions
harmonic-average-mutual-information: Public generic functions
has-single-child-p: Private ordinary functions
hash-content-hash: Public ordinary functions
hash-content-location: Public ordinary functions
hash-content-p: Private ordinary functions
hash-dict-content-hash: Private ordinary functions
hash-dict-content-location: Private ordinary functions
hash-dict-content-p: Private ordinary functions
hash-dict-content-value: Public ordinary functions
hash-do: Public macros
hash-integer: Public ordinary functions
hash-node-access: Public ordinary functions
hash-node-contains: Public ordinary functions
hash-node-contains-node: Public ordinary functions
hash-node-content: Public ordinary functions
hash-node-deep-copy: Public ordinary functions
hash-node-insert!: Public ordinary functions
hash-node-insert-into-copy: Public ordinary functions
hash-node-node-mask: Private ordinary functions
hash-node-p: Public ordinary functions
hash-node-remove!: Public ordinary functions
hash-node-remove-from-the-copy: Public ordinary functions
hash-node-replace!: Public ordinary functions
hash-node-replace-in-the-copy: Public ordinary functions
hash-node-size: Public ordinary functions
hash-node-tagged-content: Private ordinary functions
hash-node-tagged-node-mask: Private ordinary functions
hash-node-tagged-ownership-tag: Private ordinary functions
hash-node-tagged-p: Private ordinary functions
hash-node-to-masked-index: Public ordinary functions
hash-node-untagged-content: Private ordinary functions
hash-node-untagged-node-mask: Private ordinary functions
hash-node-untagged-p: Private ordinary functions
hash-node-whole-mask: Public ordinary functions
hash-shifts: Private ordinary functions
hash-table-elementwise: Public generic functions
hash-table-elementwise: Public generic functions
hashval: Public ordinary functions
hashval-no-depth: Public ordinary functions
hidden-markov-model-generator: Public ordinary functions
highest-leader: Private ordinary functions
hll-rank: Private ordinary functions
hodges-lehmann-estimator: Public generic functions
hodges-lehmann-estimator: Public generic functions
homogenousp: Public ordinary functions
hyperloglog-jaccard: Public ordinary functions

I
if-else: Public ordinary functions
ignore-errors*: Public ordinary functions
import-all-package-symbols: Public macros
in-batches: Public generic functions
in-batches: Public generic functions
in-shuffle-array: Private ordinary functions
index-in-content-of-distance-matrix: Private ordinary functions
init-chain-of-range: Private ordinary functions
init-connected-ranges: Private ordinary functions
init-rrb: Private ordinary functions
init-vector-range: Private ordinary functions
initial-stack: Private generic functions
initial-stack: Private generic functions
initialize-field: Private ordinary functions
initialize-fields: Private ordinary functions
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-instance: Public standalone methods
initialize-mutual-information-hash-tables: Private ordinary functions
initialize-split-point-field: Private ordinary functions
insert: Public generic functions
insert: Public generic functions
insert: Public generic functions
insert!: Public generic functions
insert!: Public generic functions
insert!: Public generic functions
insert-front: Private generic functions
insert-front: Private generic functions
insert-front: Private generic functions
insert-front: Private generic functions
insert-front!: Private generic functions
insert-front!: Private generic functions
insert-front!: Private generic functions
insert-front!: Private generic functions
insert-front-into-tree: Public ordinary functions
insert-front-into-tree!: Public ordinary functions
insert-into-node!: Private ordinary functions
insert-new-node!: Private ordinary functions
insert-node-between!: Public ordinary functions
insert-or: Public ordinary functions
insert-or-replace: Public ordinary functions
insert-tail: Public ordinary functions
insert-tail: Public ordinary functions
insert-tail!: Public ordinary functions
insert-tail-handle-root-overflow: Private ordinary functions
internal-array: Public generic functions
internal-array: Public generic functions
internal-array: Public generic functions
internal-array: Public generic functions
intersection-cardinality: Public ordinary functions
inverse-in-shuffle-array: Private ordinary functions
inverted-hash-table: Public ordinary functions
iota-range: Public ordinary functions

J
jaccard: Public ordinary functions

K
key-parameters-start-at: Private ordinary functions

L
lambda-list-to-bindings: Public ordinary functions
lambda-list-to-call-form: Public ordinary functions
last-element: Public generic functions
last-element: Public generic functions
latch: Public generic functions
latch: Public generic functions
layer-aggregator-constructor: Public generic functions
layer-aggregator-constructor: Public generic functions
layer-aggregator-constructor: Public generic functions
layer-aggregator-constructor: Public generic functions
layer-aggregator-constructor: Public generic functions
layer-aggregator-constructor: Public generic functions
layer-aggregator-constructor: Public generic functions
layer-aggregator-constructor: Public generic functions
lazy-let: Public macros
lazy-shuffle: Public ordinary functions
let-aggregator: Public macros
let-generator: Public macros
lexicographic-compare: Public ordinary functions
line-by-line: Public ordinary functions
list-of-slots: Private generic functions
list-of-slots: Private generic functions
list-of-slots: Private generic functions
list-of-slots: Private generic functions
list-of-slots: Private generic functions
list-of-slots: Private generic functions
locate-node: Public ordinary functions
lolol: Public macros
lower-bound: Public ordinary functions
lower-bound: Public generic functions
lower-bound: Public generic functions
lower-bound: Public generic functions
lparallel-future: Public macros
lz: Private ordinary functions

M
Macro, assert-one-dimension: Public macros
Macro, bind-lambda: Public macros
Macro, call-constructor: Public macros
Macro, cases: Public macros
Macro, check-argument-bounds: Public macros
Macro, check-value: Public macros
Macro, cond+: Public macros
Macro, cond-compare: Public macros
Macro, copy-slots: Public macros
Macro, define-aggregation-function: Public macros
Macro, define-all-validation-for-fields: Private macros
Macro, define-list-of-slots: Public macros
Macro, define-tagged-untagged-node: Public macros
Macro, define-validation-for-fields: Public macros
Macro, defmethod-with-peek-stack: Public macros
Macro, defmethod-with-stack: Public macros
Macro, defpackage: Public macros
Macro, delay: Public macros
Macro, front-body: Private macros
Macro, hash-do: Public macros
Macro, import-all-package-symbols: Public macros
Macro, lazy-let: Public macros
Macro, let-aggregator: Public macros
Macro, let-generator: Public macros
Macro, lolol: Public macros
Macro, lparallel-future: Public macros
Macro, macro-with-dynamic-vars: Private macros
Macro, make-bucket-callback: Private macros
Macro, make-lazy-range: Public macros
Macro, mod-bind: Public macros
Macro, optimize-value: Public macros
Macro, qp-trie-insert!: Public macros
Macro, qp-trie-node-get-or-insert-child!: Private macros
Macro, quasi-clone*: Public macros
Macro, quasi-clone-other-class*: Private macros
Macro, summary: Public macros
Macro, toggle-vars: Private macros
Macro, traverse-body: Private macros
Macro, with-destructive-erase-hamt: Public macros
Macro, with-file-ranges: Public macros
Macro, with-hamt-path: Public macros
Macro, with-hash-tree-functions: Public macros
Macro, with-keys: Public macros
Macro, with-rebind: Public macros
Macro, with-slots-for: Public macros
Macro, with-sparse-rrb-node: Public macros
Macro, with-sparse-rrb-node-path: Public macros
Macro, with-stream-input: Private macros
Macro, with-vectors: Public macros
Macro, xpr: Public macros
macro-with-dynamic-vars: Private macros
make-adjusted-tree: Private ordinary functions
make-aggregator: Private ordinary functions
make-approximated-histogram: Public ordinary functions
make-approximated-histogram-bin: Private ordinary functions
make-assoc-skip-list-node: Private ordinary functions
make-bucket: Public generic functions
make-bucket: Public generic functions
make-bucket: Public generic functions
make-bucket: Public generic functions
make-bucket-callback: Private macros
make-bucket-callbacks: Private generic functions
make-bucket-callbacks: Private generic functions
make-bucket-from-multiple: Public generic functions
make-bucket-from-multiple: Public generic functions
make-changes: Private ordinary functions
make-children-vector: Private ordinary functions
make-content-vector: Private ordinary functions
make-delay: Public ordinary functions
make-dict-content: Public ordinary functions
make-distance-matrix-from-vector: Public ordinary functions
make-eager-modification-operation-status: Public ordinary functions
make-egnat-tree: Public ordinary functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-from-traversable: Public generic functions
make-functional-2-3-queue: Public ordinary functions
make-functional-composite-container: Public ordinary functions
make-functional-hamt-dictionary: Public ordinary functions
make-functional-rrb-vector: Public ordinary functions
make-functional-sparse-rrb-vector: Public ordinary functions
make-future-carousel: Public ordinary functions
make-half-matrix: Public ordinary functions
make-hamt-range-stack-cell: Private ordinary functions
make-hash-array: Public ordinary functions
make-hash-content: Public ordinary functions
make-hash-dict-content: Public ordinary functions
make-hash-dict-content: Private ordinary functions
make-hash-node: Private ordinary functions
make-hash-node-tagged: Private ordinary functions
make-hash-node-untagged: Private ordinary functions
make-hash-table-range: Public ordinary functions
make-instance: Public standalone methods
make-instance: Public standalone methods
make-instance: Public standalone methods
make-instance: Public standalone methods
make-instance: Public standalone methods
make-lazy-range: Public macros
make-minhash: Public ordinary functions
make-mutable-2-3-queue: Public ordinary functions
make-mutable-composite-container: Public ordinary functions
make-mutable-egnat-metric-set: Public ordinary functions
make-mutable-hamt-dictionary: Public ordinary functions
make-mutable-of-size: Private ordinary functions
make-mutable-qp-trie-set: Public ordinary functions
make-mutable-rrb-vector: Public ordinary functions
make-mutable-skip-list-dictionary: Public ordinary functions
make-mutable-skip-list-set: Public ordinary functions
make-mutable-sparse-rrb-vector: Public ordinary functions
make-node-content: Public ordinary functions
make-node-from-tail: Private ordinary functions
make-of-size: Public generic functions
make-of-size: Public generic functions
make-of-size: Public generic functions
make-of-size: Public generic functions
make-one-bit-minhash: Public ordinary functions
make-ownership-tag: Public ordinary functions
make-partitions: Private ordinary functions
make-pipe-fragment: Public ordinary functions
make-proxy: Public generic functions
make-proxy: Public generic functions
make-qp-trie-node: Public ordinary functions
make-qp-trie-node-tagged: Private ordinary functions
make-qp-trie-node-untagged: Private ordinary functions
make-range: Public generic functions
make-range: Public generic functions
make-range: Public generic functions
make-range: Public generic functions
make-range-from-root: Private ordinary functions
make-range-from-tail: Private ordinary functions
make-ranges: Private ordinary functions
make-reservoir-sampling: Public ordinary functions
make-reservoir-sampling*: Private ordinary functions
make-rrb-node: Public ordinary functions
make-skip-list-node: Public ordinary functions
make-skip-list-node*: Private ordinary functions
make-skip-list-node-of-level: Public ordinary functions
make-skip-list-node-of-random-level: Public ordinary functions
make-sparse-rrb-node: Public ordinary functions
make-sparse-rrb-node-tagged: Private ordinary functions
make-sparse-rrb-node-untagged: Private ordinary functions
make-srrb-range-stack-cell: Private ordinary functions
make-stack-cell: Private generic functions
make-stack-cell: Private generic functions
make-stack-cell: Private generic functions
make-stack-cell: Private generic functions
make-stack-cell: Private generic functions
make-stack-cell: Private generic functions
make-stack-cell: Private generic functions
make-state: Private generic functions
make-synchronized-mutable-2-3-queue: Public ordinary functions
make-synchronized-transactional-2-3-queue: Public ordinary functions
make-tagged-struct-node: Private ordinary functions
make-transactional-2-3-queue: Public ordinary functions
make-transactional-hamt-dictionary: Public ordinary functions
make-transactional-rrb-vector: Public ordinary functions
make-transactional-sparse-rrb-vector: Public ordinary functions
map-bucket: Public generic functions
map-bucket: Public generic functions
map-bucket: Public generic functions
map-bucket: Public generic functions
map-bucket: Public generic functions
map-bucket: Public generic functions
map-qp-trie-nodes: Public ordinary functions
maximal-bins-count: Private generic functions
maximal-bins-count: Private generic functions
median-absolute-deviation: Public generic functions
median-absolute-deviation: Public generic functions
merge-ordered-vectors: Public ordinary functions
Method, %summary: Public generic functions
Method, (setf access-arguments-closure): Private generic functions
Method, (setf access-begin): Private generic functions
Method, (setf access-bins): Private generic functions
Method, (setf access-close-range): Private generic functions
Method, (setf access-closure): Private generic functions
Method, (setf access-collected): Private generic functions
Method, (setf access-container): Private generic functions
Method, (setf access-container): Private generic functions
Method, (setf access-content): Public generic functions
Method, (setf access-content): Private generic functions
Method, (setf access-count): Private generic functions
Method, (setf access-count): Private generic functions
Method, (setf access-counters): Private generic functions
Method, (setf access-counters): Private generic functions
Method, (setf access-current): Private generic functions
Method, (setf access-current): Private generic functions
Method, (setf access-current): Private generic functions
Method, (setf access-current-index): Private generic functions
Method, (setf access-current-node): Private generic functions
Method, (setf access-current-position): Public generic functions
Method, (setf access-depth): Private generic functions
Method, (setf access-depth): Private generic functions
Method, (setf access-distant-range): Private generic functions
Method, (setf access-eager-status): Private generic functions
Method, (setf access-end): Private generic functions
Method, (setf access-fill-pointer): Private generic functions
Method, (setf access-finished-closure): Private generic functions
Method, (setf access-forward-stack): Private generic functions
Method, (setf access-functor): Public generic functions
Method, (setf access-hash-fn): Private generic functions
Method, (setf access-hashes): Private generic functions
Method, (setf access-hashes): Private generic functions
Method, (setf access-head): Private generic functions
Method, (setf access-head-position): Private generic functions
Method, (setf access-index): Private generic functions
Method, (setf access-index): Private generic functions
Method, (setf access-index-bound): Public generic functions
Method, (setf access-initial-state): Private generic functions
Method, (setf access-initial-to): Private generic functions
Method, (setf access-last-size): Public generic functions
Method, (setf access-left): Public generic functions
Method, (setf access-left): Public generic functions
Method, (setf access-lines-read): Private generic functions
Method, (setf access-lower-bound): Public generic functions
Method, (setf access-lower-bound): Private generic functions
Method, (setf access-max): Private generic functions
Method, (setf access-maximum-level): Public generic functions
Method, (setf access-middle): Public generic functions
Method, (setf access-min): Private generic functions
Method, (setf access-og-container): Private generic functions
Method, (setf access-operations): Private generic functions
Method, (setf access-position): Private generic functions
Method, (setf access-position): Private generic functions
Method, (setf access-prev-cell): Private generic functions
Method, (setf access-prev-cell): Private generic functions
Method, (setf access-prev-cell): Private generic functions
Method, (setf access-prev-cell): Private generic functions
Method, (setf access-prev-cell): Private generic functions
Method, (setf access-previous): Private generic functions
Method, (setf access-previous-bound): Private generic functions
Method, (setf access-reached-end): Public generic functions
Method, (setf access-registers): Private generic functions
Method, (setf access-right): Public generic functions
Method, (setf access-right): Public generic functions
Method, (setf access-root): Public generic functions
Method, (setf access-root): Public generic functions
Method, (setf access-root): Public generic functions
Method, (setf access-root): Public generic functions
Method, (setf access-root): Public generic functions
Method, (setf access-shift): Public generic functions
Method, (setf access-shift): Public generic functions
Method, (setf access-size): Public generic functions
Method, (setf access-size): Public generic functions
Method, (setf access-size): Public generic functions
Method, (setf access-size): Public generic functions
Method, (setf access-split-point): Private generic functions
Method, (setf access-stack): Private generic functions
Method, (setf access-stack): Private generic functions
Method, (setf access-start): Public generic functions
Method, (setf access-state): Private generic functions
Method, (setf access-state): Private generic functions
Method, (setf access-sum): Private generic functions
Method, (setf access-tail): Public generic functions
Method, (setf access-tail): Public generic functions
Method, (setf access-tail): Private generic functions
Method, (setf access-tail): Private generic functions
Method, (setf access-tail-end): Private generic functions
Method, (setf access-tail-mask): Public generic functions
Method, (setf access-tail-position): Private generic functions
Method, (setf access-tail-size): Public generic functions
Method, (setf access-test-function): Public generic functions
Method, (setf access-tree): Public generic functions
Method, (setf access-tree-index-bound): Public generic functions
Method, (setf access-tree-size): Public generic functions
Method, (setf access-upper-bound): Public generic functions
Method, (setf access-upper-bound): Private generic functions
Method, (setf access-width): Private generic functions
Method, (setf access-width): Private generic functions
Method, (setf access-window): Private generic functions
Method, (setf at): Public generic functions
Method, (setf at): Public generic functions
Method, (setf at): Public generic functions
Method, (setf at): Public generic functions
Method, (setf at): Public generic functions
Method, (setf beta0): Public generic functions
Method, (setf beta1): Public generic functions
Method, (setf peek-back): Public generic functions
Method, (setf peek-front): Public generic functions
Method, (setf peek-front): Public generic functions
Method, (setf read-initial-previous): Private generic functions
Method, (setf read-initial-previous-bound): Private generic functions
Method, (setf read-latches): Private generic functions
Method, (setf root): Private generic functions
Method, (setf stack): Private generic functions
Method, absolute-value-norm: Public generic functions
Method, access-arguments-closure: Private generic functions
Method, access-begin: Private generic functions
Method, access-bins: Private generic functions
Method, access-close-range: Private generic functions
Method, access-closure: Private generic functions
Method, access-collected: Private generic functions
Method, access-container: Private generic functions
Method, access-container: Private generic functions
Method, access-content: Public generic functions
Method, access-content: Private generic functions
Method, access-count: Private generic functions
Method, access-count: Private generic functions
Method, access-counters: Private generic functions
Method, access-counters: Private generic functions
Method, access-current: Private generic functions
Method, access-current: Private generic functions
Method, access-current: Private generic functions
Method, access-current-index: Private generic functions
Method, access-current-node: Private generic functions
Method, access-current-position: Public generic functions
Method, access-depth: Private generic functions
Method, access-depth: Private generic functions
Method, access-distant-range: Private generic functions
Method, access-eager-status: Private generic functions
Method, access-end: Private generic functions
Method, access-fill-pointer: Private generic functions
Method, access-finished-closure: Private generic functions
Method, access-forward-stack: Private generic functions
Method, access-functor: Public generic functions
Method, access-hash-fn: Private generic functions
Method, access-hashes: Private generic functions
Method, access-hashes: Private generic functions
Method, access-head: Private generic functions
Method, access-head-position: Private generic functions
Method, access-index: Private generic functions
Method, access-index: Private generic functions
Method, access-index-bound: Public generic functions
Method, access-initial-state: Private generic functions
Method, access-initial-to: Private generic functions
Method, access-last-size: Public generic functions
Method, access-left: Public generic functions
Method, access-left: Public generic functions
Method, access-lines-read: Private generic functions
Method, access-lower-bound: Public generic functions
Method, access-lower-bound: Private generic functions
Method, access-max: Private generic functions
Method, access-maximum-level: Public generic functions
Method, access-middle: Public generic functions
Method, access-min: Private generic functions
Method, access-og-container: Private generic functions
Method, access-operations: Private generic functions
Method, access-position: Private generic functions
Method, access-position: Private generic functions
Method, access-prev-cell: Private generic functions
Method, access-previous: Private generic functions
Method, access-previous-bound: Private generic functions
Method, access-reached-end: Public generic functions
Method, access-registers: Private generic functions
Method, access-right: Public generic functions
Method, access-right: Public generic functions
Method, access-root: Public generic functions
Method, access-root: Public generic functions
Method, access-root: Public generic functions
Method, access-root: Public generic functions
Method, access-root: Public generic functions
Method, access-shift: Public generic functions
Method, access-shift: Public generic functions
Method, access-size: Public generic functions
Method, access-size: Public generic functions
Method, access-size: Public generic functions
Method, access-size: Public generic functions
Method, access-split-point: Private generic functions
Method, access-stack: Private generic functions
Method, access-stack: Private generic functions
Method, access-start: Public generic functions
Method, access-state: Private generic functions
Method, access-state: Private generic functions
Method, access-sum: Private generic functions
Method, access-tail: Public generic functions
Method, access-tail: Public generic functions
Method, access-tail: Private generic functions
Method, access-tail: Private generic functions
Method, access-tail-end: Private generic functions
Method, access-tail-mask: Public generic functions
Method, access-tail-position: Private generic functions
Method, access-tail-size: Public generic functions
Method, access-test-function: Public generic functions
Method, access-tree: Public generic functions
Method, access-tree-index-bound: Public generic functions
Method, access-tree-size: Public generic functions
Method, access-upper-bound: Public generic functions
Method, access-upper-bound: Private generic functions
Method, access-width: Private generic functions
Method, access-width: Private generic functions
Method, access-window: Private generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across: Public generic functions
Method, across-aggregate: Public generic functions
Method, across-aggregate: Public generic functions
Method, across-aggregate: Public generic functions
Method, across-aggregate: Public generic functions
Method, across-aggregate: Public generic functions
Method, across-aggregate: Public generic functions
Method, add: Public generic functions
Method, add: Public generic functions
Method, add!: Public generic functions
Method, add!: Public generic functions
Method, add-into-queue: Public generic functions
Method, add-sinks: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, aggregator-constructor: Public generic functions
Method, alter-bucket: Public generic functions
Method, alter-bucket: Public generic functions
Method, alter-bucket: Public generic functions
Method, alter-bucket: Public generic functions
Method, alter-bucket: Public generic functions
Method, alter-bucket: Public generic functions
Method, alter-bucket: Public generic functions
Method, alter-bucket!: Public generic functions
Method, alter-bucket!: Public generic functions
Method, alter-bucket!: Public generic functions
Method, alter-bucket!: Public generic functions
Method, alter-bucket!: Public generic functions
Method, alter-bucket!: Public generic functions
Method, alter-bucket!: Public generic functions
Method, alter-bucket!: Public generic functions
Method, apply-aggregation-function: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-layer: Public generic functions
Method, apply-range-function: Public generic functions
Method, apply-range-function: Public generic functions
Method, apply-range-function: Public generic functions
Method, apply-range-function: Public generic functions
Method, apply-range-function: Public generic functions
Method, apply-range-function: Public generic functions
Method, apply-range-function: Public generic functions
Method, apply-range-function: Public generic functions
Method, approximated-counts: Public generic functions
Method, approximated-histogram: Public generic functions
Method, approximated-set-cardinality: Public generic functions
Method, approximated-top-k: Public generic functions
Method, array-average: Public generic functions
Method, array-elementwise: Public generic functions
Method, array-geometric-average: Public generic functions
Method, array-harmonic-average: Public generic functions
Method, array-sum: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, at: Public generic functions
Method, average: Public generic functions
Method, become-functional: Public generic functions
Method, become-functional: Public generic functions
Method, become-functional: Public generic functions
Method, become-functional: Public generic functions
Method, become-functional: Public generic functions
Method, become-functional: Public generic functions
Method, become-functional: Public generic functions
Method, become-functional: Public generic functions
Method, become-lazy: Public generic functions
Method, become-lazy: Public generic functions
Method, become-mutable: Public generic functions
Method, become-mutable: Public generic functions
Method, become-mutable: Public generic functions
Method, become-mutable: Public generic functions
Method, become-mutable: Public generic functions
Method, become-mutable: Public generic functions
Method, become-mutable: Public generic functions
Method, become-mutable: Public generic functions
Method, become-mutable: Public generic functions
Method, become-mutable: Public generic functions
Method, become-mutable: Public generic functions
Method, become-subtree*: Private generic functions
Method, become-subtree*: Private generic functions
Method, become-transactional: Public generic functions
Method, become-transactional: Public generic functions
Method, become-transactional: Public generic functions
Method, become-transactional: Public generic functions
Method, become-transactional: Public generic functions
Method, become-transactional: Public generic functions
Method, become-transactional: Public generic functions
Method, become-transactional: Public generic functions
Method, become-transactional: Public generic functions
Method, become-transactional: Public generic functions
Method, beta0: Public generic functions
Method, beta1: Public generic functions
Method, between*: Public generic functions
Method, between*: Public generic functions
Method, bloom-filter: Public generic functions
Method, bootstrap: Public generic functions
Method, changed: Public generic functions
Method, changed: Public generic functions
Method, chunked: Public generic functions
Method, chunked: Public generic functions
Method, chunked: Public generic functions
Method, chunked: Public generic functions
Method, chunked: Public generic functions
Method, chunked: Public generic functions
Method, clean-sketch: Public generic functions
Method, clean-sketch: Public generic functions
Method, clean-sketch: Public generic functions
Method, clean-sketch: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone: Public generic functions
Method, clone-cell: Private generic functions
Method, clone-cell: Private generic functions
Method, clone-cell: Private generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, cloning-information: Public generic functions
Method, close-inner-stream: Public generic functions
Method, close-inner-stream: Public generic functions
Method, close-inner-stream: Public generic functions
Method, co-occurence-table: Public generic functions
Method, compatiblep: Private generic functions
Method, compatiblep: Private generic functions
Method, compatiblep: Private generic functions
Method, compatiblep: Private generic functions
Method, consume-back: Public generic functions
Method, consume-back: Public generic functions
Method, consume-back: Public generic functions
Method, consume-back: Public generic functions
Method, consume-back: Public generic functions
Method, consume-back: Public generic functions
Method, consume-back: Public generic functions
Method, consume-back: Public generic functions
Method, consume-back: Public generic functions
Method, consume-back: Public generic functions
Method, consume-back: Public generic functions
Method, consume-back: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, consume-front: Public generic functions
Method, count-elements: Public generic functions
Method, cumulative-accumulate: Public generic functions
Method, delete-back: Private generic functions
Method, delete-back: Private generic functions
Method, delete-back: Private generic functions
Method, delete-back!: Private generic functions
Method, delete-back!: Private generic functions
Method, delete-back!: Private generic functions
Method, depth: Private generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, destructive-counterpart: Public generic functions
Method, dimensionality: Public generic functions
Method, dimensionality: Public generic functions
Method, dimensionality: Public generic functions
Method, distance: Public generic functions
Method, distance: Public generic functions
Method, distinct: Public generic functions
Method, drop-back: Public generic functions
Method, drop-back: Public generic functions
Method, drop-back: Public generic functions
Method, drop-back: Public generic functions
Method, drop-back: Public generic functions
Method, drop-front: Public generic functions
Method, drop-front: Public generic functions
Method, drop-front: Public generic functions
Method, drop-front: Public generic functions
Method, drop-front: Public generic functions
Method, drop-front: Public generic functions
Method, drop-front: Public generic functions
Method, drop-front: Public generic functions
Method, drop-front: Public generic functions
Method, each-in-matrix: Public generic functions
Method, eat-cell: Private generic functions
Method, eat-cell: Private generic functions
Method, eat-cell: Private generic functions
Method, eat-cell: Private generic functions
Method, eat-cell: Private generic functions
Method, eat-cell: Private generic functions
Method, effective-at: Private generic functions
Method, effective-at: Private generic functions
Method, effective-at: Private generic functions
Method, empty-clone: Public generic functions
Method, empty-clone: Public generic functions
Method, empty-clone: Public generic functions
Method, empty-clone: Public generic functions
Method, empty-clone: Public generic functions
Method, empty-clone: Public generic functions
Method, empty-clone: Public generic functions
Method, empty-clone: Public generic functions
Method, empty-clone: Public generic functions
Method, end: Private generic functions
Method, end-execution: Public generic functions
Method, end-execution: Public generic functions
Method, entropy: Public generic functions
Method, enumerate: Public generic functions
Method, erase: Public generic functions
Method, erase: Public generic functions
Method, erase!: Public generic functions
Method, erase!: Public generic functions
Method, erase!: Public generic functions
Method, erase!: Public generic functions
Method, erase*!: Public generic functions
Method, erase-if: Public generic functions
Method, erase-if!: Public generic functions
Method, establish-special: Public generic functions
Method, extrema: Public generic functions
Method, extremum: Public generic functions
Method, fast-map: Public generic functions
Method, find: Public generic functions
Method, first-element: Public generic functions
Method, flatten-lists: Public generic functions
Method, forward-call: Public generic functions
Method, forward-call: Public generic functions
Method, forward-call: Public generic functions
Method, found: Public generic functions
Method, found: Public generic functions
Method, frequency: Public generic functions
Method, fresh-bucket-status: Public generic functions
Method, fresh-bucket-status: Public generic functions
Method, fresh-bucket-status: Public generic functions
Method, fresh-bucket-status: Public generic functions
Method, fresh-bucket-status: Public generic functions
Method, functional-counterpart: Public generic functions
Method, functional-counterpart: Public generic functions
Method, functional-counterpart: Public generic functions
Method, functional-counterpart: Public generic functions
Method, functional-counterpart: Public generic functions
Method, functional-counterpart: Public generic functions
Method, functional-counterpart: Public generic functions
Method, functional-counterpart: Public generic functions
Method, functional-counterpart: Public generic functions
Method, functional-counterpart: Public generic functions
Method, functionalp: Public generic functions
Method, functionalp: Public generic functions
Method, fundamental-range-class-of: Private generic functions
Method, fundamental-range-class-of: Private generic functions
Method, fundamental-range-class-of: Private generic functions
Method, fundamental-range-class-of: Private generic functions
Method, gather-minhash-corpus: Public generic functions
Method, geometric-average: Public generic functions
Method, get-range-key-function: Public generic functions
Method, gini-impurity: Public generic functions
Method, group-by: Public generic functions
Method, grow: Private generic functions
Method, grow: Private generic functions
Method, harmonic-average: Public generic functions
Method, harmonic-average-mutual-information: Public generic functions
Method, hash-table-elementwise: Public generic functions
Method, hodges-lehmann-estimator: Public generic functions
Method, in-batches: Public generic functions
Method, initial-stack: Private generic functions
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, initialize-instance: Public standalone methods
Method, insert: Public generic functions
Method, insert: Public generic functions
Method, insert!: Public generic functions
Method, insert!: Public generic functions
Method, insert-front: Private generic functions
Method, insert-front: Private generic functions
Method, insert-front: Private generic functions
Method, insert-front!: Private generic functions
Method, insert-front!: Private generic functions
Method, insert-front!: Private generic functions
Method, internal-array: Public generic functions
Method, internal-array: Public generic functions
Method, internal-array: Public generic functions
Method, last-element: Public generic functions
Method, latch: Public generic functions
Method, layer-aggregator-constructor: Public generic functions
Method, layer-aggregator-constructor: Public generic functions
Method, layer-aggregator-constructor: Public generic functions
Method, layer-aggregator-constructor: Public generic functions
Method, layer-aggregator-constructor: Public generic functions
Method, layer-aggregator-constructor: Public generic functions
Method, layer-aggregator-constructor: Public generic functions
Method, list-of-slots: Private generic functions
Method, list-of-slots: Private generic functions
Method, list-of-slots: Private generic functions
Method, list-of-slots: Private generic functions
Method, list-of-slots: Private generic functions
Method, lower-bound: Public generic functions
Method, lower-bound: Public generic functions
Method, make-bucket: Public generic functions
Method, make-bucket: Public generic functions
Method, make-bucket: Public generic functions
Method, make-bucket-callbacks: Private generic functions
Method, make-bucket-from-multiple: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-from-traversable: Public generic functions
Method, make-instance: Public standalone methods
Method, make-instance: Public standalone methods
Method, make-instance: Public standalone methods
Method, make-instance: Public standalone methods
Method, make-instance: Public standalone methods
Method, make-of-size: Public generic functions
Method, make-of-size: Public generic functions
Method, make-of-size: Public generic functions
Method, make-proxy: Public generic functions
Method, make-range: Public generic functions
Method, make-range: Public generic functions
Method, make-range: Public generic functions
Method, make-stack-cell: Private generic functions
Method, make-stack-cell: Private generic functions
Method, make-stack-cell: Private generic functions
Method, make-stack-cell: Private generic functions
Method, make-stack-cell: Private generic functions
Method, make-stack-cell: Private generic functions
Method, map-bucket: Public generic functions
Method, map-bucket: Public generic functions
Method, map-bucket: Public generic functions
Method, map-bucket: Public generic functions
Method, map-bucket: Public generic functions
Method, maximal-bins-count: Private generic functions
Method, median-absolute-deviation: Public generic functions
Method, minhash: Public generic functions
Method, minhash: Public generic functions
Method, minhash: Public generic functions
Method, minhash-corpus-hash-value: Private generic functions
Method, minhash-corpus-hash-value: Private generic functions
Method, minhash-corpus-hash-value: Private generic functions
Method, minhash-corpus-hash-value: Private generic functions
Method, moments: Public generic functions
Method, more-checks-end: Private generic functions
Method, more-checks-start: Private generic functions
Method, moving-average: Public generic functions
Method, multiplex: Public generic functions
Method, mutablep: Public generic functions
Method, mutablep: Public generic functions
Method, mutate-matrix: Public generic functions
Method, mutual-information: Public generic functions
Method, mutual-information-matrix: Public generic functions
Method, near: Public generic functions
Method, next-elements: Private generic functions
Method, next-elements: Private generic functions
Method, node: Private generic functions
Method, on-each: Public generic functions
Method, on-each-proxy-range-from-range: Private generic functions
Method, on-each-proxy-range-from-range: Private generic functions
Method, on-each-proxy-range-from-range: Private generic functions
Method, only: Public generic functions
Method, only-different: Public generic functions
Method, open-stream-designator: Public generic functions
Method, open-stream-designator: Public generic functions
Method, open-stream-designator: Public generic functions
Method, optimal-split-point: Public generic functions
Method, parallel-group-by: Public generic functions
Method, parallel-multiplex: Public generic functions
Method, parallel-on-each: Public generic functions
Method, parents: Private generic functions
Method, partition-if: Public generic functions
Method, path: Public generic functions
Method, peek-back: Public generic functions
Method, peek-back: Public generic functions
Method, peek-back: Public generic functions
Method, peek-back: Public generic functions
Method, peek-back: Public generic functions
Method, peek-back: Public generic functions
Method, peek-back: Public generic functions
Method, peek-back: Public generic functions
Method, peek-back: Public generic functions
Method, peek-back: Public generic functions
Method, peek-back: Public generic functions
Method, peek-back: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, peek-front: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, position-modification: Public generic functions
Method, print-condition: Private generic functions
Method, print-condition: Private generic functions
Method, print-condition: Private generic functions
Method, print-condition: Private generic functions
Method, print-condition: Private generic functions
Method, print-condition: Private generic functions
Method, print-condition: Private generic functions
Method, print-condition: Private generic functions
Method, print-condition: Private generic functions
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, print-object: Public standalone methods
Method, put: Public generic functions
Method, put: Public generic functions
Method, put!: Public generic functions
Method, put!: Public generic functions
Method, put!: Public generic functions
Method, put!: Public generic functions
Method, put!: Public generic functions
Method, put-back: Public generic functions
Method, put-back!: Public generic functions
Method, rate: Public generic functions
Method, read-argument: Private generic functions
Method, read-arguments: Public generic functions
Method, read-arguments: Public generic functions
Method, read-batch-size: Private generic functions
Method, read-bindings: Private generic functions
Method, read-body: Private generic functions
Method, read-bounds: Public generic functions
Method, read-branching-factor: Private generic functions
Method, read-bucket-size: Private generic functions
Method, read-callback: Private generic functions
Method, read-capacity: Private generic functions
Method, read-changed: Private generic functions
Method, read-children: Private generic functions
Method, read-chunk-size: Private generic functions
Method, read-chunk-size: Private generic functions
Method, read-chunk-size: Private generic functions
Method, read-chunk-size: Private generic functions
Method, read-chunk-size: Private generic functions
Method, read-chunked-range: Private generic functions
Method, read-chunks: Private generic functions
Method, read-class: Public generic functions
Method, read-close-range: Private generic functions
Method, read-command-string: Private generic functions
Method, read-compare: Private generic functions
Method, read-comparsion: Private generic functions
Method, read-confidence: Private generic functions
Method, read-container: Private generic functions
Method, read-container: Private generic functions
Method, read-container: Private generic functions
Method, read-content: Private generic functions
Method, read-content: Private generic functions
Method, read-content: Private generic functions
Method, read-content: Private generic functions
Method, read-content: Private generic functions
Method, read-content: Private generic functions
Method, read-content: Private generic functions
Method, read-content-count-in-node: Private generic functions
Method, read-context-function: Private generic functions
Method, read-cumulative-key: Private generic functions
Method, read-data: Private generic functions
Method, read-discrete: Private generic functions
Method, read-discrete-values-set: Private generic functions
Method, read-distant-range: Private generic functions
Method, read-element-type: Public generic functions
Method, read-element-type: Public generic functions
Method, read-element-type: Private generic functions
Method, read-end-on-empty: Private generic functions
Method, read-equal-fn: Public generic functions
Method, read-found: Public generic functions
Method, read-from: Private generic functions
Method, read-from: Private generic functions
Method, read-function: Public generic functions
Method, read-function: Public generic functions
Method, read-function: Public generic functions
Method, read-function: Public generic functions
Method, read-function: Private generic functions
Method, read-functor-constructor: Public generic functions
Method, read-functor-prototype: Public generic functions
Method, read-groups: Private generic functions
Method, read-groups: Private generic functions
Method, read-hash-array: Private generic functions
Method, read-hash-fn: Public generic functions
Method, read-hash-function: Private generic functions
Method, read-hash-table: Public generic functions
Method, read-having: Private generic functions
Method, read-having: Private generic functions
Method, read-initial-begin: Private generic functions
Method, read-initial-count: Private generic functions
Method, read-initial-current: Private generic functions
Method, read-initial-current-node: Private generic functions
Method, read-initial-current-position: Private generic functions
Method, read-initial-end: Private generic functions
Method, read-initial-lines-read: Private generic functions
Method, read-initial-lower-bound: Private generic functions
Method, read-initial-lower-bound: Private generic functions
Method, read-initial-position: Private generic functions
Method, read-initial-position: Private generic functions
Method, read-initial-position: Private generic functions
Method, read-initial-previous: Private generic functions
Method, read-initial-previous-bound: Private generic functions
Method, read-initial-stack: Private generic functions
Method, read-initial-stack: Private generic functions
Method, read-initial-state: Private generic functions
Method, read-initial-sum: Private generic functions
Method, read-initial-upper-bound: Private generic functions
Method, read-initial-upper-bound: Private generic functions
Method, read-initial-window: Private generic functions
Method, read-k: Private generic functions
Method, read-key: Public generic functions
Method, read-key: Public generic functions
Method, read-key: Public generic functions
Method, read-key: Public generic functions
Method, read-key: Public generic functions
Method, read-key: Public generic functions
Method, read-key: Public generic functions
Method, read-key: Public generic functions
Method, read-key: Public generic functions
Method, read-key: Private generic functions
Method, read-key: Private generic functions
Method, read-key: Private generic functions
Method, read-key: Private generic functions
Method, read-key: Private generic functions
Method, read-keys: Public generic functions
Method, read-last-node: Private generic functions
Method, read-latches: Private generic functions
Method, read-lazy-instance: Private generic functions
Method, read-lock: Private generic functions
Method, read-margin: Public generic functions
Method, read-max-bins: Private generic functions
Method, read-maximum-queue-size: Private generic functions
Method, read-maximum-queue-size: Private generic functions
Method, read-maximum-queue-size: Private generic functions
Method, read-maximum-queue-size: Private generic functions
Method, read-metric-fn: Private generic functions
Method, read-metric-type: Private generic functions
Method, read-mutex: Private generic functions
Method, read-mutex: Private generic functions
Method, read-name: Private generic functions
Method, read-near: Public generic functions
Method, read-notify-pop: Private generic functions
Method, read-notify-push: Private generic functions
Method, read-obtain-value: Private generic functions
Method, read-offset: Private generic functions
Method, read-on-first: Private generic functions
Method, read-operation: Private generic functions
Method, read-ordering-function: Public generic functions
Method, read-original-collected: Private generic functions
Method, read-original-content: Private generic functions
Method, read-original-content: Private generic functions
Method, read-original-data: Private generic functions
Method, read-original-range: Public generic functions
Method, read-original-range: Private generic functions
Method, read-original-seen: Private generic functions
Method, read-original-selector-function: Private generic functions
Method, read-ownership-tag: Public generic functions
Method, read-ownership-tag: Public generic functions
Method, read-parallel: Private generic functions
Method, read-path: Public generic functions
Method, read-path: Public generic functions
Method, read-path: Public generic functions
Method, read-pointers: Public generic functions
Method, read-predicate: Private generic functions
Method, read-predicate: Private generic functions
Method, read-predicate: Private generic functions
Method, read-queue: Private generic functions
Method, read-range: Private generic functions
Method, read-ranges: Private generic functions
Method, read-regex: Private generic functions
Method, read-result: Private generic functions
Method, read-rrb-range: Private generic functions
Method, read-sample-size: Private generic functions
Method, read-samples-count: Private generic functions
Method, read-samples-count: Private generic functions
Method, read-seeds: Private generic functions
Method, read-seen: Private generic functions
Method, read-selector-function: Private generic functions
Method, read-sinks: Private generic functions
Method, read-sinks-lock: Private generic functions
Method, read-size: Public generic functions
Method, read-size: Private generic functions
Method, read-split-point-count: Private generic functions
Method, read-store-value: Public generic functions
Method, read-table: Private generic functions
Method, read-table: Private generic functions
Method, read-test: Private generic functions
Method, read-test: Private generic functions
Method, read-thread: Private generic functions
Method, read-times: Private generic functions
Method, read-times: Private generic functions
Method, read-to: Private generic functions
Method, read-to: Private generic functions
Method, read-transform: Private generic functions
Method, read-transform: Private generic functions
Method, read-value: Public generic functions
Method, read-value: Public generic functions
Method, read-vector: Private generic functions
Method, read-vector: Private generic functions
Method, read-vectors-in-chunk: Private generic functions
Method, read-window-size: Private generic functions
Method, read-xors: Private generic functions
Method, recursive-egnat-grow!*: Private generic functions
Method, recursive-egnat-grow!*: Private generic functions
Method, recursive-egnat-grow!*: Private generic functions
Method, replica: Public generic functions
Method, replica: Public generic functions
Method, replica: Public generic functions
Method, replica: Public generic functions
Method, reservoir-sample: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset!: Public generic functions
Method, reset-cell: Private generic functions
Method, reset-cell: Private generic functions
Method, restrain-size: Public generic functions
Method, root: Private generic functions
Method, select-children: Public generic functions
Method, select-children: Public generic functions
Method, sequence-window: Public generic functions
Method, sequence-window: Public generic functions
Method, sequence-window: Public generic functions
Method, sequence-window: Public generic functions
Method, sequence-window: Public generic functions
Method, set-stream-position: Private generic functions
Method, set-stream-position: Private generic functions
Method, should-skip: Public generic functions
Method, should-skip: Public generic functions
Method, should-skip: Public generic functions
Method, shrink: Private generic functions
Method, shrink: Private generic functions
Method, simple-linear-regression: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, size: Public generic functions
Method, skip-list-node-clone: Public generic functions
Method, skip-list-node-clone: Public generic functions
Method, sliding-window: Public generic functions
Method, stack: Private generic functions
Method, standard-deviation: Public generic functions
Method, start: Private generic functions
Method, start-execution: Public generic functions
Method, state-result: Public generic functions
Method, stream-designator-p: Public generic functions
Method, stream-designator-p: Public generic functions
Method, stream-designator-p: Public generic functions
Method, take-out: Public generic functions
Method, take-out: Public generic functions
Method, take-out!: Public generic functions
Method, take-out!: Public generic functions
Method, take-out!: Public generic functions
Method, take-out!: Public generic functions
Method, take-out-back: Public generic functions
Method, take-out-back!: Public generic functions
Method, thread-buffer: Public generic functions
Method, to-hash-table: Public generic functions
Method, to-list: Public generic functions
Method, to-vector: Public generic functions
Method, transactional-delete-back!: Private generic functions
Method, transactional-delete-back!: Private generic functions
Method, transactional-delete-back!: Private generic functions
Method, transactional-insert-front!: Private generic functions
Method, transactional-insert-front!: Private generic functions
Method, transactional-insert-front!: Private generic functions
Method, transactionalp: Public generic functions
Method, transactionalp: Public generic functions
Method, translation: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, traverse: Public generic functions
Method, type-specialization: Public generic functions
Method, type-specialization: Public generic functions
Method, type-specialization: Public generic functions
Method, type-specialization: Public generic functions
Method, union: Public generic functions
Method, union: Public generic functions
Method, union: Public generic functions
Method, union: Public generic functions
Method, union: Public generic functions
Method, update: Public generic functions
Method, update: Public generic functions
Method, update: Public generic functions
Method, update!: Public generic functions
Method, update!: Public generic functions
Method, update-if: Public generic functions
Method, update-if: Public generic functions
Method, update-if: Public generic functions
Method, update-if!: Public generic functions
Method, update-if!: Public generic functions
Method, update-if!: Public generic functions
Method, validate-field: Public generic functions
Method, validate-field: Public generic functions
Method, validate-field: Public generic functions
Method, validate-field: Public generic functions
Method, validate-field: Public generic functions
Method, validation-form-for: Private generic functions
Method, validation-form-for: Private generic functions
Method, validation-form-for: Private generic functions
Method, validation-form-for: Private generic functions
Method, value: Public generic functions
Method, value: Public generic functions
Method, value: Public generic functions
Method, variance: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, whole-range: Public generic functions
Method, with-previous-element: Public generic functions
Method, without: Public generic functions
Method, wrap-chunk: Public generic functions
Method, wrap-chunk: Public generic functions
Method, wrap-chunk: Public generic functions
Method, wrap-chunk: Public generic functions
Method, write-changed: Private generic functions
Method, write-found: Private generic functions
Method, write-lazy-instance: Private generic functions
Method, write-ownership-tag: Public generic functions
Method, write-value: Private generic functions
method-lambda-list-to-function-lambda-list: Public ordinary functions
minhash: Public generic functions
minhash: Public generic functions
minhash: Public generic functions
minhash: Public generic functions
minhash-corpus-hash-value: Private generic functions
minhash-corpus-hash-value: Private generic functions
minhash-corpus-hash-value: Private generic functions
minhash-corpus-hash-value: Private generic functions
minhash-corpus-hash-value: Private generic functions
minhash-corpus-minhash: Private ordinary functions
minhash-jaccard/double-float: Public ordinary functions
minhash-jaccard/fixnum: Public ordinary functions
minhash-jaccard/single-float: Public ordinary functions
mod-bind: Public macros
modulo-range: Public ordinary functions
moments: Public generic functions
moments: Public generic functions
more-checks-end: Private generic functions
more-checks-end: Private generic functions
more-checks-start: Private generic functions
more-checks-start: Private generic functions
move-updated: Private ordinary functions
moving-average: Public generic functions
moving-average: Public generic functions
mref: Public ordinary functions
multiplex: Public generic functions
multiplex: Public generic functions
mutable-from-traversable: Private ordinary functions
mutable-from-traversable: Private ordinary functions
mutable-sparse-rrb-vector-grow: Public ordinary functions
mutablep: Public generic functions
mutablep: Public generic functions
mutablep: Public generic functions
mutate-matrix: Public generic functions
mutate-matrix: Public generic functions
mutual-information: Public generic functions
mutual-information: Public generic functions
mutual-information-hash-table: Private ordinary functions
mutual-information-matrix: Public generic functions
mutual-information-matrix: Public generic functions

N
near: Public generic functions
near: Public generic functions
new-cell: Public ordinary functions
new-cell: Private ordinary functions
new-node-update-pointers!: Public ordinary functions
new-register: Private ordinary functions
new-sketch: Public ordinary functions
next-elements: Private generic functions
next-elements: Private generic functions
next-elements: Private generic functions
next-index: Private ordinary functions
node: Private generic functions
node: Private generic functions
node-children-full-p: Private ordinary functions
node-full-p: Private ordinary functions
node-head: Private ordinary functions
normalize-sequence-to-span: Public ordinary functions
normalize-sequence-to-sum: Public ordinary functions
not-greater: Private ordinary functions
nref: Public ordinary functions
null-bucket-p: Public ordinary functions

O
obtain-value: Public ordinary functions
obtain-value: Private ordinary functions
obtain-value: Private ordinary functions
on-each: Public generic functions
on-each: Public generic functions
on-each-proxy-range-from-range: Private generic functions
on-each-proxy-range-from-range: Private generic functions
on-each-proxy-range-from-range: Private generic functions
on-each-proxy-range-from-range: Private generic functions
on-ordered-intersection: Public ordinary functions
one-bit-minhash-jaccard/double-float: Public ordinary functions
one-bit-minhash-jaccard/fixnum: Public ordinary functions
one-bit-minhash-jaccard/single-float: Public ordinary functions
only: Public generic functions
only: Public generic functions
only-different: Public generic functions
only-different: Public generic functions
open-stream-designator: Public generic functions
open-stream-designator: Public generic functions
open-stream-designator: Public generic functions
open-stream-designator: Public generic functions
optimal-split-point: Public generic functions
optimal-split-point: Public generic functions
optimize-value: Public macros
or*: Public ordinary functions
ordered-exclusion: Public ordinary functions
ordered-intersection: Public ordinary functions
ordered-p: Public ordinary functions

P
parallel-fill-distance-matrix-from-vector: Public ordinary functions
parallel-group-by: Public generic functions
parallel-group-by: Public generic functions
parallel-make-distance-matrix-from-vector: Public ordinary functions
parallel-multiplex: Public generic functions
parallel-multiplex: Public generic functions
parallel-on-each: Public generic functions
parallel-on-each: Public generic functions
parents: Private generic functions
parents: Private generic functions
partition-if: Public generic functions
partition-if: Public generic functions
partition-if-consume-implementation: Private ordinary functions
partition-points: Private ordinary functions
pass-bucket-operation: Public generic functions
pass-bucket-query: Public generic functions
pass-to-aggregation: Public ordinary functions
path: Public generic functions
path: Public generic functions
path-scaner: Public ordinary functions
peek-back: Public generic functions
peek-back: Public generic functions
peek-back: Public generic functions
peek-back: Public generic functions
peek-back: Public generic functions
peek-back: Public generic functions
peek-back: Public generic functions
peek-back: Public generic functions
peek-back: Public generic functions
peek-back: Public generic functions
peek-back: Public generic functions
peek-back: Public generic functions
peek-back: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-front: Public generic functions
peek-or-consume: Private ordinary functions
pop-last: Public ordinary functions
position-modification: Public ordinary functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification: Public generic functions
position-modification!: Public ordinary functions
position-to-value: Private ordinary functions
prevent-duplicates: Public ordinary functions
print-condition: Private generic functions
print-condition: Private generic functions
print-condition: Private generic functions
print-condition: Private generic functions
print-condition: Private generic functions
print-condition: Private generic functions
print-condition: Private generic functions
print-condition: Private generic functions
print-condition: Private generic functions
print-condition: Private generic functions
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
print-object: Public standalone methods
prune-subtrees: Public ordinary functions
push-content: Private ordinary functions
push-into-copy-of-tail: Private ordinary functions
push-into-tail!: Private ordinary functions
put: Public generic functions
put: Public generic functions
put: Public generic functions
put!: Public generic functions
put!: Public generic functions
put!: Public generic functions
put!: Public generic functions
put!: Public generic functions
put!: Public generic functions
put-back: Public generic functions
put-back: Public generic functions
put-back!: Public generic functions
put-back!: Public generic functions
put-front: Public generic functions
put-front!: Public generic functions

Q
qp-trie-delete!: Public ordinary functions
qp-trie-find: Public ordinary functions
qp-trie-insert!: Public macros
qp-trie-leaf-present-p: Private ordinary functions
qp-trie-node-bitmask: Public ordinary functions
qp-trie-node-children-bitmask: Public ordinary functions
qp-trie-node-clone: Public ordinary functions
qp-trie-node-contains-leafs-p: Private ordinary functions
qp-trie-node-content: Public ordinary functions
qp-trie-node-delete!: Public ordinary functions
qp-trie-node-get-or-insert-child!: Private macros
qp-trie-node-index: Private ordinary functions
qp-trie-node-insert-new-node!: Private ordinary functions
qp-trie-node-leaf-present-p: Public ordinary functions
qp-trie-node-mark-leaf!: Private ordinary functions
qp-trie-node-present-p: Public ordinary functions
qp-trie-node-ref: Public ordinary functions
qp-trie-node-size: Private ordinary functions
qp-trie-node-store-bitmask: Public ordinary functions
qp-trie-node-tagged-bitmask: Private ordinary functions
qp-trie-node-tagged-content: Private ordinary functions
qp-trie-node-tagged-ownership-tag: Private ordinary functions
qp-trie-node-tagged-p: Private ordinary functions
qp-trie-node-unmark-leaf!: Public ordinary functions
qp-trie-node-untagged-bitmask: Private ordinary functions
qp-trie-node-untagged-content: Private ordinary functions
qp-trie-node-untagged-p: Private ordinary functions
quasi-clone: Public ordinary functions
quasi-clone*: Public macros
quasi-clone-other-class: Private ordinary functions
quasi-clone-other-class*: Private macros

R
random-float: Private ordinary functions
random-level: Public ordinary functions
range-not-fully-read: Private ordinary functions
rate: Public generic functions
rate: Public generic functions
read-argument: Private generic functions
read-argument: Private generic functions
read-arguments: Public generic functions
read-arguments: Public generic functions
read-arguments: Public generic functions
read-batch-size: Private generic functions
read-batch-size: Private generic functions
read-bindings: Private generic functions
read-bindings: Private generic functions
read-body: Private generic functions
read-body: Private generic functions
read-bounds: Public generic functions
read-bounds: Public generic functions
read-branching-factor: Private generic functions
read-branching-factor: Private generic functions
read-bucket-size: Private generic functions
read-bucket-size: Private generic functions
read-callback: Private generic functions
read-callback: Private generic functions
read-capacity: Private generic functions
read-capacity: Private generic functions
read-changed: Private generic functions
read-changed: Private generic functions
read-children: Private generic functions
read-children: Private generic functions
read-chunk-size: Private generic functions
read-chunk-size: Private generic functions
read-chunk-size: Private generic functions
read-chunk-size: Private generic functions
read-chunk-size: Private generic functions
read-chunk-size: Private generic functions
read-chunk-size: Private generic functions
read-chunked-range: Private generic functions
read-chunked-range: Private generic functions
read-chunks: Private generic functions
read-chunks: Private generic functions
read-class: Public generic functions
read-class: Public generic functions
read-close-range: Private generic functions
read-close-range: Private generic functions
read-command-string: Private generic functions
read-command-string: Private generic functions
read-compare: Private generic functions
read-compare: Private generic functions
read-comparsion: Private generic functions
read-comparsion: Private generic functions
read-confidence: Private generic functions
read-confidence: Private generic functions
read-container: Private generic functions
read-container: Private generic functions
read-container: Private generic functions
read-container: Private generic functions
read-container: Private generic functions
read-content: Private generic functions
read-content: Private generic functions
read-content: Private generic functions
read-content: Private generic functions
read-content: Private generic functions
read-content: Private generic functions
read-content: Private generic functions
read-content: Private generic functions
read-content: Private generic functions
read-content: Private generic functions
read-content: Private generic functions
read-content: Private generic functions
read-content-count-in-node: Private generic functions
read-content-count-in-node: Private generic functions
read-context-function: Private generic functions
read-context-function: Private generic functions
read-cumulative-key: Private generic functions
read-cumulative-key: Private generic functions
read-data: Private generic functions
read-data: Private generic functions
read-discrete: Private generic functions
read-discrete: Private generic functions
read-discrete-values-set: Private generic functions
read-discrete-values-set: Private generic functions
read-distant-range: Private generic functions
read-distant-range: Private generic functions
read-element-type: Public generic functions
read-element-type: Public generic functions
read-element-type: Public generic functions
read-element-type: Public generic functions
read-element-type: Private generic functions
read-element-type: Private generic functions
read-end-on-empty: Private generic functions
read-end-on-empty: Private generic functions
read-equal-fn: Public generic functions
read-equal-fn: Public generic functions
read-found: Public generic functions
read-found: Public generic functions
read-from: Private generic functions
read-from: Private generic functions
read-from: Private generic functions
read-from: Private generic functions
read-function: Public generic functions
read-function: Public generic functions
read-function: Public generic functions
read-function: Public generic functions
read-function: Public generic functions
read-function: Private generic functions
read-function: Private generic functions
read-functor-constructor: Public generic functions
read-functor-constructor: Public generic functions
read-functor-prototype: Public generic functions
read-functor-prototype: Public generic functions
read-groups: Private generic functions
read-groups: Private generic functions
read-groups: Private generic functions
read-groups: Private generic functions
read-hash-array: Private generic functions
read-hash-array: Private generic functions
read-hash-fn: Public generic functions
read-hash-fn: Public generic functions
read-hash-function: Private generic functions
read-hash-function: Private generic functions
read-hash-table: Public generic functions
read-hash-table: Public generic functions
read-having: Private generic functions
read-having: Private generic functions
read-having: Private generic functions
read-having: Private generic functions
read-implementation: Private ordinary functions
read-initial-begin: Private generic functions
read-initial-begin: Private generic functions
read-initial-count: Private generic functions
read-initial-count: Private generic functions
read-initial-current: Private generic functions
read-initial-current: Private generic functions
read-initial-current-node: Private generic functions
read-initial-current-node: Private generic functions
read-initial-current-position: Private generic functions
read-initial-current-position: Private generic functions
read-initial-end: Private generic functions
read-initial-end: Private generic functions
read-initial-lines-read: Private generic functions
read-initial-lines-read: Private generic functions
read-initial-lower-bound: Private generic functions
read-initial-lower-bound: Private generic functions
read-initial-lower-bound: Private generic functions
read-initial-lower-bound: Private generic functions
read-initial-position: Private generic functions
read-initial-position: Private generic functions
read-initial-position: Private generic functions
read-initial-position: Private generic functions
read-initial-position: Private generic functions
read-initial-previous: Private generic functions
read-initial-previous: Private generic functions
read-initial-previous-bound: Private generic functions
read-initial-previous-bound: Private generic functions
read-initial-stack: Private generic functions
read-initial-stack: Private generic functions
read-initial-stack: Private generic functions
read-initial-stack: Private generic functions
read-initial-state: Private generic functions
read-initial-state: Private generic functions
read-initial-sum: Private generic functions
read-initial-sum: Private generic functions
read-initial-upper-bound: Private generic functions
read-initial-upper-bound: Private generic functions
read-initial-upper-bound: Private generic functions
read-initial-upper-bound: Private generic functions
read-initial-window: Private generic functions
read-initial-window: Private generic functions
read-k: Private generic functions
read-k: Private generic functions
read-key: Public generic functions
read-key: Public generic functions
read-key: Public generic functions
read-key: Public generic functions
read-key: Public generic functions
read-key: Public generic functions
read-key: Public generic functions
read-key: Public generic functions
read-key: Public generic functions
read-key: Public generic functions
read-key: Private generic functions
read-key: Private generic functions
read-key: Private generic functions
read-key: Private generic functions
read-key: Private generic functions
read-key: Private generic functions
read-key: Private generic functions
read-key: Private generic functions
read-key: Private generic functions
read-keys: Public generic functions
read-keys: Public generic functions
read-last-node: Private generic functions
read-last-node: Private generic functions
read-latches: Private generic functions
read-latches: Private generic functions
read-lazy-instance: Private generic functions
read-lazy-instance: Private generic functions
read-lock: Private generic functions
read-lock: Private generic functions
read-margin: Public generic functions
read-margin: Public generic functions
read-max-bins: Private generic functions
read-max-bins: Private generic functions
read-maximum-queue-size: Private generic functions
read-maximum-queue-size: Private generic functions
read-maximum-queue-size: Private generic functions
read-maximum-queue-size: Private generic functions
read-maximum-queue-size: Private generic functions
read-metric-fn: Private generic functions
read-metric-fn: Private generic functions
read-metric-type: Private generic functions
read-metric-type: Private generic functions
read-mutex: Private generic functions
read-mutex: Private generic functions
read-mutex: Private generic functions
read-mutex: Private generic functions
read-name: Private generic functions
read-name: Private generic functions
read-near: Public generic functions
read-near: Public generic functions
read-new-value: Private ordinary functions
read-notify-pop: Private generic functions
read-notify-pop: Private generic functions
read-notify-push: Private generic functions
read-notify-push: Private generic functions
read-obtain-value: Private generic functions
read-obtain-value: Private generic functions
read-offset: Private generic functions
read-offset: Private generic functions
read-on-first: Private generic functions
read-on-first: Private generic functions
read-operation: Private generic functions
read-operation: Private generic functions
read-ordering-function: Public generic functions
read-ordering-function: Public generic functions
read-original-collected: Private generic functions
read-original-collected: Private generic functions
read-original-content: Private generic functions
read-original-content: Private generic functions
read-original-content: Private generic functions
read-original-content: Private generic functions
read-original-data: Private generic functions
read-original-data: Private generic functions
read-original-range: Public generic functions
read-original-range: Public generic functions
read-original-range: Private generic functions
read-original-range: Private generic functions
read-original-seen: Private generic functions
read-original-seen: Private generic functions
read-original-selector-function: Private generic functions
read-original-selector-function: Private generic functions
read-ownership-tag: Public generic functions
read-ownership-tag: Public generic functions
read-ownership-tag: Public generic functions
read-parallel: Private generic functions
read-parallel: Private generic functions
read-path: Public generic functions
read-path: Public generic functions
read-path: Public generic functions
read-path: Public generic functions
read-pointers: Public generic functions
read-pointers: Public generic functions
read-predicate: Private generic functions
read-predicate: Private generic functions
read-predicate: Private generic functions
read-predicate: Private generic functions
read-predicate: Private generic functions
read-queue: Private generic functions
read-queue: Private generic functions
read-range: Private generic functions
read-range: Private generic functions
read-ranges: Private generic functions
read-ranges: Private generic functions
read-regex: Private generic functions
read-regex: Private generic functions
read-result: Private generic functions
read-result: Private generic functions
read-rrb-range: Private generic functions
read-rrb-range: Private generic functions
read-sample-size: Private generic functions
read-sample-size: Private generic functions
read-samples-count: Private generic functions
read-samples-count: Private generic functions
read-samples-count: Private generic functions
read-samples-count: Private generic functions
read-seeds: Private generic functions
read-seeds: Private generic functions
read-seen: Private generic functions
read-seen: Private generic functions
read-selector-function: Private generic functions
read-selector-function: Private generic functions
read-sinks: Private generic functions
read-sinks: Private generic functions
read-sinks-lock: Private generic functions
read-sinks-lock: Private generic functions
read-size: Public generic functions
read-size: Public generic functions
read-size: Private generic functions
read-size: Private generic functions
read-split-point-count: Private generic functions
read-split-point-count: Private generic functions
read-store-value: Public generic functions
read-store-value: Public generic functions
read-stream: Private ordinary functions
read-table: Private generic functions
read-table: Private generic functions
read-table: Private generic functions
read-table: Private generic functions
read-test: Private generic functions
read-test: Private generic functions
read-test: Private generic functions
read-test: Private generic functions
read-thread: Private generic functions
read-thread: Private generic functions
read-times: Private generic functions
read-times: Private generic functions
read-times: Private generic functions
read-times: Private generic functions
read-to: Private generic functions
read-to: Private generic functions
read-to: Private generic functions
read-to: Private generic functions
read-transform: Private generic functions
read-transform: Private generic functions
read-transform: Private generic functions
read-transform: Private generic functions
read-value: Public generic functions
read-value: Public generic functions
read-value: Public generic functions
read-value: Public generic functions
read-vector: Private generic functions
read-vector: Private generic functions
read-vector: Private generic functions
read-vector: Private generic functions
read-vectors-in-chunk: Private generic functions
read-vectors-in-chunk: Private generic functions
read-window-size: Private generic functions
read-window-size: Private generic functions
read-xors: Private generic functions
read-xors: Private generic functions
rebuild-rehashed-node: Public ordinary functions
recursive-egnat-grow!: Private ordinary functions
recursive-egnat-grow!*: Private generic functions
recursive-egnat-grow!*: Private generic functions
recursive-egnat-grow!*: Private generic functions
recursive-egnat-grow!*: Private generic functions
reg-sum-and-zeroes: Private ordinary functions
regex-matches: Private ordinary functions
rehash: Public ordinary functions
remove-fill-pointer: Public ordinary functions
remove-tail: Public ordinary functions
replica: Public ordinary functions
replica: Public generic functions
replica: Public generic functions
replica: Public generic functions
replica: Public generic functions
replica: Public generic functions
replica-of-seen: Private ordinary functions
reservoir-sample: Public generic functions
reservoir-sample: Public generic functions
reservoir-sampling-p: Private ordinary functions
reservoir-sampling-push: Public ordinary functions
reservoir-sampling-result: Public ordinary functions
reservoir-sampling-sample-size: Private ordinary functions
reservoir-sampling-skip-count: Private ordinary functions
reservoir-sampling-w: Private ordinary functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset!: Public generic functions
reset-cell: Private generic functions
reset-cell: Private generic functions
reset-cell: Private generic functions
reset-ownership-tag: Private ordinary functions
restrain-size: Public generic functions
restrain-size: Public generic functions
rol64: Public ordinary functions
root: Private generic functions
root: Private generic functions
round-size: Private ordinary functions
rrb-at: Public ordinary functions
rrb-node-content: Public ordinary functions
rrb-node-deep-copy: Private ordinary functions
rrb-node-pop!: Private ordinary functions
rrb-node-pop-in-the-copy: Private ordinary functions
rrb-node-push!: Public ordinary functions
rrb-node-push-into-copy: Public ordinary functions

S
sample-position: Private ordinary functions
scan: Public ordinary functions
scan-index-bound: Public ordinary functions
select-best-seeds: Private ordinary functions
select-children: Public generic functions
select-children: Public generic functions
select-children: Public generic functions
select-seeds: Private ordinary functions
select-top: Public ordinary functions
separate-operations/arguments: Private ordinary functions
sequence-window: Public generic functions
sequence-window: Public generic functions
sequence-window: Public generic functions
sequence-window: Public generic functions
sequence-window: Public generic functions
sequence-window: Public generic functions
set-in-node-mask: Private ordinary functions
set-in-tail: Private ordinary functions
set-in-tail!: Private ordinary functions
set-stream-position: Private generic functions
set-stream-position: Private generic functions
set-stream-position: Private generic functions
shift-for-position: Public ordinary functions
should-skip: Public generic functions
should-skip: Public generic functions
should-skip: Public generic functions
should-skip: Public generic functions
shrink: Private generic functions
shrink: Private generic functions
shrink: Private generic functions
shrink-handle-tail!: Private ordinary functions
shrink-tree: Private ordinary functions
shrink-tree!: Private ordinary functions
shuffled-range: Public ordinary functions
simple-linear-regression: Public generic functions
simple-linear-regression: Public generic functions
single-element-p: Public ordinary functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
size: Public generic functions
skip-list-locate-node: Public ordinary functions
skip-list-node-at: Public ordinary functions
skip-list-node-clone: Public generic functions
skip-list-node-clone: Public generic functions
skip-list-node-clone: Public generic functions
skip-list-node-compare: Public ordinary functions
skip-list-node-content: Public ordinary functions
skip-list-node-level: Public ordinary functions
skip-list-node-p: Private ordinary functions
skip-list-node-pointers: Public ordinary functions
skip-list-node-update-pointers!: Public ordinary functions
sliding-window: Public generic functions
sliding-window: Public generic functions
sparse-nref: Public ordinary functions
sparse-rrb-node-bitmask: Public ordinary functions
sparse-rrb-node-contains: Public ordinary functions
sparse-rrb-node-content: Public ordinary functions
sparse-rrb-node-erase: Public ordinary functions
sparse-rrb-node-erase!: Public ordinary functions
sparse-rrb-node-size: Public ordinary functions
sparse-rrb-node-tagged-bitmask: Private ordinary functions
sparse-rrb-node-tagged-content: Private ordinary functions
sparse-rrb-node-tagged-ownership-tag: Private ordinary functions
sparse-rrb-node-tagged-p: Private ordinary functions
sparse-rrb-node-untagged-bitmask: Private ordinary functions
sparse-rrb-node-untagged-content: Private ordinary functions
sparse-rrb-node-untagged-p: Private ordinary functions
sparse-rrb-tree-map: Public ordinary functions
sparse-rrb-tree-size: Public ordinary functions
sparse-rrb-vector-at: Public ordinary functions
split-byte: Private ordinary functions
splitmix64: Private ordinary functions
square: Public ordinary functions
srrb-range-stack-cell-container: Private ordinary functions
srrb-range-stack-cell-depth: Private ordinary functions
srrb-range-stack-cell-end: Private ordinary functions
srrb-range-stack-cell-is-tail: Private ordinary functions
srrb-range-stack-cell-node-bitmask: Private ordinary functions
srrb-range-stack-cell-node-content: Private ordinary functions
srrb-range-stack-cell-p: Private ordinary functions
srrb-range-stack-cell-start: Private ordinary functions
srrb-range-stack-cell-upper-bits: Private ordinary functions
stack: Private generic functions
stack: Private generic functions
standard-deviation: Public generic functions
standard-deviation: Public generic functions
start: Private generic functions
start: Private generic functions
start-execution: Public generic functions
start-execution: Public generic functions
state-result: Public generic functions
state-result: Public generic functions
stream-designator-p: Public generic functions
stream-designator-p: Public generic functions
stream-designator-p: Public generic functions
stream-designator-p: Public generic functions
struct-accessor-name: Private ordinary functions
summary: Public macros
swap-if: Public ordinary functions
swapop: Public ordinary functions

T
tagged-node-ownership-tag: Private ordinary functions
tagged-struct-node-ownership-tag: Private ordinary functions
tagged-struct-node-p: Private ordinary functions
tail-copy: Private ordinary functions
tail-offset: Private ordinary functions
take-back: Private generic functions
take-out: Public generic functions
take-out: Public generic functions
take-out: Public generic functions
take-out!: Public generic functions
take-out!: Public generic functions
take-out!: Public generic functions
take-out!: Public generic functions
take-out!: Public generic functions
take-out-back: Public generic functions
take-out-back: Public generic functions
take-out-back!: Public generic functions
take-out-back!: Public generic functions
take-out-front: Public generic functions
take-out-front!: Public generic functions
thread-buffer: Public generic functions
thread-buffer: Public generic functions
times-matches: Private ordinary functions
to-hash-table: Public generic functions
to-hash-table: Public generic functions
to-list: Public generic functions
to-list: Public generic functions
to-pathname: Private ordinary functions
to-vector: Public generic functions
to-vector: Public generic functions
toggle-vars: Private macros
tokenize: Public ordinary functions
transactional-copy-on-write: Public ordinary functions
transactional-copy-on-write: Public ordinary functions
transactional-delete-back!: Private generic functions
transactional-delete-back!: Private generic functions
transactional-delete-back!: Private generic functions
transactional-delete-back!: Private generic functions
transactional-delete-back-from-tree!: Public ordinary functions
transactional-grow-tree!: Private ordinary functions
transactional-insert-front!: Private generic functions
transactional-insert-front!: Private generic functions
transactional-insert-front!: Private generic functions
transactional-insert-front!: Private generic functions
transactional-insert-front-into-tree!: Public ordinary functions
transactional-insert-tail!: Public ordinary functions
transactional-shrink-handle-tail!: Private ordinary functions
transactional-shrink-tree!: Private ordinary functions
transactional-sparse-rrb-vector-grow: Public ordinary functions
transactionalp: Public generic functions
transactionalp: Public generic functions
transactionalp: Public generic functions
transform: Public ordinary functions
translation: Public generic functions
translation: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse: Public generic functions
traverse-body: Private macros
traverse-impl: Public ordinary functions
traverse-multiple: Public ordinary functions
tree-index-bound: Private ordinary functions
try-find: Public ordinary functions
try-find-cell: Public ordinary functions
try-remove: Public ordinary functions
type-specialization: Public generic functions
type-specialization: Public generic functions
type-specialization: Public generic functions
type-specialization: Public generic functions
type-specialization: Public generic functions

U
unfold-table: Public ordinary functions
union: Public ordinary functions
union: Public generic functions
union: Public generic functions
union: Public generic functions
union: Public generic functions
union: Public generic functions
union: Public generic functions
unmerge-pathnames: Private ordinary functions
unset-in-tail: Private ordinary functions
unset-in-tail!: Private ordinary functions
update: Public generic functions
update: Public generic functions
update: Public generic functions
update: Public generic functions
update!: Public generic functions
update!: Public generic functions
update!: Public generic functions
update-count-min-sketch: Private ordinary functions
update-head-pointers!: Public ordinary functions
update-if: Public generic functions
update-if: Public generic functions
update-if: Public generic functions
update-if: Public generic functions
update-if!: Public generic functions
update-if!: Public generic functions
update-if!: Public generic functions
update-if!: Public generic functions
update-ranges!: Private ordinary functions

V
validate-field: Public generic functions
validate-field: Public generic functions
validate-field: Public generic functions
validate-field: Public generic functions
validate-field: Public generic functions
validate-field: Public generic functions
validate-fields: Public ordinary functions
validation-form: Private ordinary functions
validation-form-for: Private generic functions
validation-form-for: Private generic functions
validation-form-for: Private generic functions
validation-form-for: Private generic functions
validation-form-for: Private generic functions
value: Public generic functions
value: Public generic functions
value: Public generic functions
value: Public generic functions
variance: Public generic functions
variance: Public generic functions
visit-every-bucket: Private ordinary functions

W
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
whole-range: Public generic functions
with-destructive-erase-hamt: Public macros
with-file-ranges: Public macros
with-hamt-path: Public macros
with-hash-tree-functions: Public macros
with-keys: Public macros
with-previous-element: Public generic functions
with-previous-element: Public generic functions
with-rebind: Public macros
with-slots-for: Public macros
with-sparse-rrb-node: Public macros
with-sparse-rrb-node-path: Public macros
with-stream-input: Private macros
with-vectors: Public macros
without: Public generic functions
without: Public generic functions
wrap-chunk: Public generic functions
wrap-chunk: Public generic functions
wrap-chunk: Public generic functions
wrap-chunk: Public generic functions
wrap-chunk: Public generic functions
write-changed: Private generic functions
write-changed: Private generic functions
write-found: Private generic functions
write-found: Private generic functions
write-lazy-instance: Private generic functions
write-lazy-instance: Private generic functions
write-ownership-tag: Public generic functions
write-ownership-tag: Public generic functions
write-value: Private generic functions
write-value: Private generic functions

X
xorshift: Public ordinary functions
xoshiro256**: Private ordinary functions
xpr: Public macros

Z
zip: Public ordinary functions
zip-traversable: Public ordinary functions


A.3 Variables

Jump to:   %   *   +  
B   C   D   E   H   I   L   N   O   P   R   S   T   U   V   W  
Index Entry  Section

%
%argument: Public conditions
%arguments: Public classes
%arguments: Public classes
%arguments-closure: Public classes
%batch-size: Private classes
%begin: Public classes
%beta0: Private classes
%beta1: Private classes
%bindings: Private classes
%bins: Public classes
%bounds: Public conditions
%branching-factor: Public classes
%bucket-size: Public classes
%callback: Public classes
%capacity: Private classes
%changed: Private classes
%children: Private classes
%chunk-size: Public classes
%chunk-size: Private classes
%chunk-size: Private classes
%chunk-size: Private classes
%chunk-size: Private classes
%chunked-range: Private classes
%chunks: Private classes
%class: Public conditions
%close-range: Private classes
%closure: Public classes
%collected: Private classes
%command-string: Public classes
%compare: Private classes
%comparsion: Private classes
%confidence: Private classes
%construct-function: Public classes
%container: Public classes
%container: Public classes
%container: Private classes
%container: Private classes
%container: Private classes
%content: Public classes
%content: Public classes
%content: Public classes
%content: Public classes
%content: Public classes
%content: Private classes
%content: Private classes
%content: Private classes
%content: Private classes
%content-count-in-node: Public classes
%context-function: Private classes
%count: Public classes
%count: Private classes
%counters: Public classes
%counters: Public classes
%cumulative-key: Private classes
%current: Private classes
%current: Private classes
%current: Private classes
%current-index: Public classes
%current-node: Public classes
%current-position: Public classes
%data: Private classes
%depth: Public classes
%depth: Public classes
%depth: Private classes
%discrete: Private classes
%discrete-values-set: Private classes
%distant-range: Private classes
%eager-status: Private classes
%element-type: Public classes
%element-type: Private classes
%element-type: Private classes
%end: Public classes
%end: Private classes
%end-on-empty: Public classes
%equal-fn: Public classes
%fill-pointer: Public classes
%finished-closure: Public classes
%forward-stack: Public classes
%found: Private classes
%from: Public classes
%from: Public classes
%function: Public classes
%function: Private classes
%function: Private classes
%function: Private classes
%function: Private classes
%functor: Public classes
%functor-constructor: Public classes
%functor-prototype: Public classes
%groups: Private classes
%groups: Private classes
%hash-array: Private classes
%hash-fn: Public classes
%hash-fn: Public classes
%hash-function: Private classes
%hash-table: Public classes
%hashes: Public classes
%hashes: Public classes
%having: Private classes
%having: Private classes
%head: Private classes
%head-position: Private classes
%index: Public classes
%index: Public classes
%index-bound: Private classes
%initial-begin: Public classes
%initial-count: Private classes
%initial-current: Private classes
%initial-current-node: Public classes
%initial-current-position: Private classes
%initial-end: Public classes
%initial-lines-read: Private classes
%initial-lower-bound: Public classes
%initial-lower-bound: Public classes
%initial-position: Public classes
%initial-position: Private classes
%initial-position: Private classes
%initial-previous: Private classes
%initial-previous-bound: Private classes
%initial-stack: Public classes
%initial-stack: Private classes
%initial-stack: Private classes
%initial-state: Public classes
%initial-state: Private classes
%initial-sum: Private classes
%initial-to: Public classes
%initial-upper-bound: Public classes
%initial-upper-bound: Public classes
%initial-window: Private classes
%k: Private classes
%key: Public classes
%key: Public classes
%key: Public classes
%key: Public classes
%key: Private classes
%key: Private classes
%key: Private classes
%key: Private classes
%key: Private classes
%key: Private classes
%key: Private classes
%key: Private classes
%key: Private classes
%key: Private classes
%keys: Public classes
%last-node: Public classes
%last-size: Public classes
%latches: Private classes
%lazy-instance: Private classes
%left: Public classes
%left: Public classes
%lines-read: Private classes
%lock: Private classes
%lower-bound: Public classes
%lower-bound: Public classes
%make-bucket-callbacks: Private classes
%margin: Private classes
%max: Public classes
%max-bins: Public classes
%maximum-level: Public classes
%maximum-queue-size: Private classes
%maximum-queue-size: Private classes
%maximum-queue-size: Private classes
%maximum-queue-size: Private classes
%metric-fn: Public classes
%metric-type: Public classes
%middle: Public classes
%min: Public classes
%more-checks-end: Private classes
%more-checks-start: Private classes
%mutex: Public classes
%mutex: Private classes
%name: Private classes
%near: Private classes
%node: Private classes
%notify-pop: Private classes
%notify-push: Private classes
%obtain-value: Public classes
%offset: Public classes
%og-container: Private classes
%on-first: Private classes
%operation: Public classes
%operations: Public classes
%ordering-function: Public classes
%orginal-collected: Private classes
%original-content: Public classes
%original-content: Public classes
%original-data: Private classes
%original-range: Public classes
%original-range: Public classes
%original-seen: Private classes
%original-selector-function: Private classes
%ownership-tag: Public classes
%ownership-tag: Public classes
%parallel: Private classes
%parents: Private classes
%path: Public conditions
%path: Public classes
%path: Private classes
%path: Private classes
%pointers: Public classes
%position: Private classes
%position: Private classes
%predicate: Private classes
%predicate: Private classes
%predicate: Private classes
%prev-cell: Private classes
%previous: Private classes
%previous-bound: Private classes
%queue: Public classes
%range: Private classes
%ranges: Private classes
%reached-end: Public classes
%regex: Private classes
%registers: Public classes
%result: Private classes
%right: Public classes
%right: Public classes
%root: Public classes
%root: Public classes
%root: Public classes
%root: Public classes
%root: Public classes
%root: Private classes
%rrb-range: Private classes
%sample-size: Private classes
%samples-count: Public classes
%samples-count: Private classes
%seeds: Private classes
%seen: Private classes
%selector-function: Private classes
%shift: Public classes
%shift: Private classes
%sinks: Public classes
%sinks-lock: Public classes
%size: Public classes
%size: Public classes
%size: Public classes
%size: Public classes
%size: Public classes
%size: Private classes
%split-point: Private classes
%split-point-count: Private classes
%stack: Private classes
%stack: Private classes
%stack: Private classes
%start: Public classes
%start: Private classes
%state: Private classes
%state: Private classes
%store-value: Public classes
%stream: Public classes
%sum: Private classes
%table: Public classes
%table: Private classes
%tail: Public classes
%tail: Private classes
%tail: Private classes
%tail: Private classes
%tail-end: Private classes
%tail-mask: Private classes
%tail-position: Private classes
%tail-size: Public classes
%test: Private classes
%test: Private classes
%test-function: Public classes
%thread: Public classes
%times: Private classes
%times: Private classes
%to: Public classes
%to: Public classes
%transform: Private classes
%transform: Private classes
%tree: Private classes
%tree-index-bound: Private classes
%tree-size: Private classes
%upper-bound: Public classes
%upper-bound: Public classes
%value: Public conditions
%value: Public classes
%value: Private classes
%vector: Public classes
%vector: Public classes
%vectors-in-chunk: Private classes
%width: Public classes
%width: Public classes
%window: Private classes
%window-size: Private classes
%xors: Private classes

*
*current-key*: Public special variables
*previous-element*: Public special variables

+
+2q+: Private constants
+2r+: Private constants
+alpha+: Private constants
+bit-count+: Public constants
+buffer-size+: Private constants
+c+: Private constants
+depth+: Public constants
+hash-level+: Public constants
+long-prime+: Private constants
+m+: Private constants
+max+: Private constants
+max-64-bits+: Public constants
+maximal-shift+: Public constants
+maximum-children-count+: Public constants
+maximum-children-count+: Public constants
+maxx+: Private constants
+p+: Private constants
+q+: Private constants
+r+: Private constants
+tail-mask+: Public constants

B
bitmask: Public structures
bitmask: Public structures
bitmask: Private structures
bitmask: Private structures

C
cleanup: Public structures
Constant, +2q+: Private constants
Constant, +2r+: Private constants
Constant, +alpha+: Private constants
Constant, +bit-count+: Public constants
Constant, +buffer-size+: Private constants
Constant, +c+: Private constants
Constant, +depth+: Public constants
Constant, +hash-level+: Public constants
Constant, +long-prime+: Private constants
Constant, +m+: Private constants
Constant, +max+: Private constants
Constant, +max-64-bits+: Public constants
Constant, +maximal-shift+: Public constants
Constant, +maximum-children-count+: Public constants
Constant, +maximum-children-count+: Public constants
Constant, +maxx+: Private constants
Constant, +p+: Private constants
Constant, +q+: Private constants
Constant, +r+: Private constants
Constant, +tail-mask+: Public constants
Constant, null-bucket: Public constants
container: Private structures
content: Public structures
content: Public structures
content: Public structures
content: Private structures
content: Private structures
content: Private structures
content: Private structures
content: Private structures
count: Private structures

D
depth: Private structures

E
empty-changed-eager-modification-operation-status: Public symbol macros
empty-eager-modification-operation-status: Public symbol macros
end: Private structures
end: Private structures
end-index: Private structures
extract: Public structures

H
hash: Private structures

I
is-tail: Private structures

L
location: Public structures
location: Private structures

N
node: Private structures
node-bitmask: Private structures
node-content: Private structures
node-mask: Private structures
node-mask: Private structures
null-bucket: Public constants

O
ownership-tag: Public structures

P
parent: Private structures
pass: Public structures
pointers: Public structures

R
result: Private structures

S
skip-count: Private structures
Slot, %argument: Public conditions
Slot, %arguments: Public classes
Slot, %arguments: Public classes
Slot, %arguments-closure: Public classes
Slot, %batch-size: Private classes
Slot, %begin: Public classes
Slot, %beta0: Private classes
Slot, %beta1: Private classes
Slot, %bindings: Private classes
Slot, %bins: Public classes
Slot, %bounds: Public conditions
Slot, %branching-factor: Public classes
Slot, %bucket-size: Public classes
Slot, %callback: Public classes
Slot, %capacity: Private classes
Slot, %changed: Private classes
Slot, %children: Private classes
Slot, %chunk-size: Public classes
Slot, %chunk-size: Private classes
Slot, %chunk-size: Private classes
Slot, %chunk-size: Private classes
Slot, %chunk-size: Private classes
Slot, %chunked-range: Private classes
Slot, %chunks: Private classes
Slot, %class: Public conditions
Slot, %close-range: Private classes
Slot, %closure: Public classes
Slot, %collected: Private classes
Slot, %command-string: Public classes
Slot, %compare: Private classes
Slot, %comparsion: Private classes
Slot, %confidence: Private classes
Slot, %construct-function: Public classes
Slot, %container: Public classes
Slot, %container: Public classes
Slot, %container: Private classes
Slot, %container: Private classes
Slot, %container: Private classes
Slot, %content: Public classes
Slot, %content: Public classes
Slot, %content: Public classes
Slot, %content: Public classes
Slot, %content: Public classes
Slot, %content: Private classes
Slot, %content: Private classes
Slot, %content: Private classes
Slot, %content: Private classes
Slot, %content-count-in-node: Public classes
Slot, %context-function: Private classes
Slot, %count: Public classes
Slot, %count: Private classes
Slot, %counters: Public classes
Slot, %counters: Public classes
Slot, %cumulative-key: Private classes
Slot, %current: Private classes
Slot, %current: Private classes
Slot, %current: Private classes
Slot, %current-index: Public classes
Slot, %current-node: Public classes
Slot, %current-position: Public classes
Slot, %data: Private classes
Slot, %depth: Public classes
Slot, %depth: Public classes
Slot, %depth: Private classes
Slot, %discrete: Private classes
Slot, %discrete-values-set: Private classes
Slot, %distant-range: Private classes
Slot, %eager-status: Private classes
Slot, %element-type: Public classes
Slot, %element-type: Private classes
Slot, %element-type: Private classes
Slot, %end: Public classes
Slot, %end: Private classes
Slot, %end-on-empty: Public classes
Slot, %equal-fn: Public classes
Slot, %fill-pointer: Public classes
Slot, %finished-closure: Public classes
Slot, %forward-stack: Public classes
Slot, %found: Private classes
Slot, %from: Public classes
Slot, %from: Public classes
Slot, %function: Public classes
Slot, %function: Private classes
Slot, %function: Private classes
Slot, %function: Private classes
Slot, %function: Private classes
Slot, %functor: Public classes
Slot, %functor-constructor: Public classes
Slot, %functor-prototype: Public classes
Slot, %groups: Private classes
Slot, %groups: Private classes
Slot, %hash-array: Private classes
Slot, %hash-fn: Public classes
Slot, %hash-fn: Public classes
Slot, %hash-function: Private classes
Slot, %hash-table: Public classes
Slot, %hashes: Public classes
Slot, %hashes: Public classes
Slot, %having: Private classes
Slot, %having: Private classes
Slot, %head: Private classes
Slot, %head-position: Private classes
Slot, %index: Public classes
Slot, %index: Public classes
Slot, %index-bound: Private classes
Slot, %initial-begin: Public classes
Slot, %initial-count: Private classes
Slot, %initial-current: Private classes
Slot, %initial-current-node: Public classes
Slot, %initial-current-position: Private classes
Slot, %initial-end: Public classes
Slot, %initial-lines-read: Private classes
Slot, %initial-lower-bound: Public classes
Slot, %initial-lower-bound: Public classes
Slot, %initial-position: Public classes
Slot, %initial-position: Private classes
Slot, %initial-position: Private classes
Slot, %initial-previous: Private classes
Slot, %initial-previous-bound: Private classes
Slot, %initial-stack: Public classes
Slot, %initial-stack: Private classes
Slot, %initial-stack: Private classes
Slot, %initial-state: Public classes
Slot, %initial-state: Private classes
Slot, %initial-sum: Private classes
Slot, %initial-to: Public classes
Slot, %initial-upper-bound: Public classes
Slot, %initial-upper-bound: Public classes
Slot, %initial-window: Private classes
Slot, %k: Private classes
Slot, %key: Public classes
Slot, %key: Public classes
Slot, %key: Public classes
Slot, %key: Public classes
Slot, %key: Private classes
Slot, %key: Private classes
Slot, %key: Private classes
Slot, %key: Private classes
Slot, %key: Private classes
Slot, %key: Private classes
Slot, %key: Private classes
Slot, %key: Private classes
Slot, %key: Private classes
Slot, %key: Private classes
Slot, %keys: Public classes
Slot, %last-node: Public classes
Slot, %last-size: Public classes
Slot, %latches: Private classes
Slot, %lazy-instance: Private classes
Slot, %left: Public classes
Slot, %left: Public classes
Slot, %lines-read: Private classes
Slot, %lock: Private classes
Slot, %lower-bound: Public classes
Slot, %lower-bound: Public classes
Slot, %make-bucket-callbacks: Private classes
Slot, %margin: Private classes
Slot, %max: Public classes
Slot, %max-bins: Public classes
Slot, %maximum-level: Public classes
Slot, %maximum-queue-size: Private classes
Slot, %maximum-queue-size: Private classes
Slot, %maximum-queue-size: Private classes
Slot, %maximum-queue-size: Private classes
Slot, %metric-fn: Public classes
Slot, %metric-type: Public classes
Slot, %middle: Public classes
Slot, %min: Public classes
Slot, %more-checks-end: Private classes
Slot, %more-checks-start: Private classes
Slot, %mutex: Public classes
Slot, %mutex: Private classes
Slot, %name: Private classes
Slot, %near: Private classes
Slot, %node: Private classes
Slot, %notify-pop: Private classes
Slot, %notify-push: Private classes
Slot, %obtain-value: Public classes
Slot, %offset: Public classes
Slot, %og-container: Private classes
Slot, %on-first: Private classes
Slot, %operation: Public classes
Slot, %operations: Public classes
Slot, %ordering-function: Public classes
Slot, %orginal-collected: Private classes
Slot, %original-content: Public classes
Slot, %original-content: Public classes
Slot, %original-data: Private classes
Slot, %original-range: Public classes
Slot, %original-range: Public classes
Slot, %original-seen: Private classes
Slot, %original-selector-function: Private classes
Slot, %ownership-tag: Public classes
Slot, %ownership-tag: Public classes
Slot, %parallel: Private classes
Slot, %parents: Private classes
Slot, %path: Public conditions
Slot, %path: Public classes
Slot, %path: Private classes
Slot, %path: Private classes
Slot, %pointers: Public classes
Slot, %position: Private classes
Slot, %position: Private classes
Slot, %predicate: Private classes
Slot, %predicate: Private classes
Slot, %predicate: Private classes
Slot, %prev-cell: Private classes
Slot, %previous: Private classes
Slot, %previous-bound: Private classes
Slot, %queue: Public classes
Slot, %range: Private classes
Slot, %ranges: Private classes
Slot, %reached-end: Public classes
Slot, %regex: Private classes
Slot, %registers: Public classes
Slot, %result: Private classes
Slot, %right: Public classes
Slot, %right: Public classes
Slot, %root: Public classes
Slot, %root: Public classes
Slot, %root: Public classes
Slot, %root: Public classes
Slot, %root: Public classes
Slot, %root: Private classes
Slot, %rrb-range: Private classes
Slot, %sample-size: Private classes
Slot, %samples-count: Public classes
Slot, %samples-count: Private classes
Slot, %seeds: Private classes
Slot, %seen: Private classes
Slot, %selector-function: Private classes
Slot, %shift: Public classes
Slot, %shift: Private classes
Slot, %sinks: Public classes
Slot, %sinks-lock: Public classes
Slot, %size: Public classes
Slot, %size: Public classes
Slot, %size: Public classes
Slot, %size: Public classes
Slot, %size: Public classes
Slot, %size: Private classes
Slot, %split-point: Private classes
Slot, %split-point-count: Private classes
Slot, %stack: Private classes
Slot, %stack: Private classes
Slot, %stack: Private classes
Slot, %start: Public classes
Slot, %start: Private classes
Slot, %state: Private classes
Slot, %state: Private classes
Slot, %store-value: Public classes
Slot, %stream: Public classes
Slot, %sum: Private classes
Slot, %table: Public classes
Slot, %table: Private classes
Slot, %tail: Public classes
Slot, %tail: Private classes
Slot, %tail: Private classes
Slot, %tail: Private classes
Slot, %tail-end: Private classes
Slot, %tail-mask: Private classes
Slot, %tail-position: Private classes
Slot, %tail-size: Public classes
Slot, %test: Private classes
Slot, %test: Private classes
Slot, %test-function: Public classes
Slot, %thread: Public classes
Slot, %times: Private classes
Slot, %times: Private classes
Slot, %to: Public classes
Slot, %to: Public classes
Slot, %transform: Private classes
Slot, %transform: Private classes
Slot, %tree: Private classes
Slot, %tree-index-bound: Private classes
Slot, %tree-size: Private classes
Slot, %upper-bound: Public classes
Slot, %upper-bound: Public classes
Slot, %value: Public conditions
Slot, %value: Public classes
Slot, %value: Private classes
Slot, %vector: Public classes
Slot, %vector: Public classes
Slot, %vectors-in-chunk: Private classes
Slot, %width: Public classes
Slot, %width: Public classes
Slot, %window: Private classes
Slot, %window-size: Private classes
Slot, %xors: Private classes
Slot, bitmask: Public structures
Slot, bitmask: Public structures
Slot, bitmask: Private structures
Slot, bitmask: Private structures
Slot, cleanup: Public structures
Slot, container: Private structures
Slot, content: Public structures
Slot, content: Public structures
Slot, content: Public structures
Slot, content: Private structures
Slot, content: Private structures
Slot, content: Private structures
Slot, content: Private structures
Slot, content: Private structures
Slot, count: Private structures
Slot, depth: Private structures
Slot, end: Private structures
Slot, end: Private structures
Slot, end-index: Private structures
Slot, extract: Public structures
Slot, hash: Private structures
Slot, is-tail: Private structures
Slot, location: Public structures
Slot, location: Private structures
Slot, node: Private structures
Slot, node-bitmask: Private structures
Slot, node-content: Private structures
Slot, node-mask: Private structures
Slot, node-mask: Private structures
Slot, ownership-tag: Public structures
Slot, parent: Private structures
Slot, pass: Public structures
Slot, pointers: Public structures
Slot, result: Private structures
Slot, skip-count: Private structures
Slot, start: Private structures
Slot, start: Private structures
Slot, unique: Private structures
Slot, upper-bits: Private structures
Slot, value: Public structures
Slot, value: Private structures
Slot, value: Private structures
Slot, value: Private structures
Slot, w: Private structures
Special Variable, *current-key*: Public special variables
Special Variable, *previous-element*: Public special variables
start: Private structures
start: Private structures
Symbol Macro, empty-changed-eager-modification-operation-status: Public symbol macros
Symbol Macro, empty-eager-modification-operation-status: Public symbol macros
Symbol Macro, todo: Public symbol macros

T
todo: Public symbol macros

U
unique: Private structures
upper-bits: Private structures

V
value: Public structures
value: Private structures
value: Private structures
value: Private structures

W
w: Private structures


A.4 Data types

Jump to:   %   2   3  
A   B   C   D   E   F   G   H   I   K   L   M   N   O   P   Q   R   S   T   U   V   W   X   Z  
Index Entry  Section

%
%summary-function: Private classes

2
2-3-queue: Private classes
2-3-queue-range: Private classes
2-3-tree: The cl-data-structures/common/2-3-tree module
2-3-tree: The cl-data-structures/queues/2-3-tree module
2-node: Public classes

3
3-node: Public classes

A
absolute-value-norm-function: Private classes
absolute-value-norm.lisp: The cl-data-structures/math/absolute-value-norm․lisp file
abstract: The cl-data-structures/common/abstract module
abstract-in-batches-proxy: Private classes
abstract-partition-if-proxy: Private classes
abstract-sliding-window-proxy: Private classes
accumulate-function: Private classes
accumulate.lisp: The cl-data-structures/algorithms/accumulate․lisp file
adapters: The cl-data-structures/adapters module
add!-function: Public classes
add-function: Public classes
aggregation-function: Public classes
aggregator: Public structures
algorithms: The cl-data-structures/algorithms module
all-files-file-range-stack-cell: Private classes
api: The cl-data-structures/api module
api.lisp: The cl-data-structures/dicts/api․lisp file
api.lisp: The cl-data-structures/dicts/skip-list/api․lisp file
api.lisp: The cl-data-structures/dicts/hamt/api․lisp file
api.lisp: The cl-data-structures/dicts/srrb/api․lisp file
api.lisp: The cl-data-structures/sequences/rrb/api․lisp file
api.lisp: The cl-data-structures/queues/2-3-tree/api․lisp file
api.lisp: The cl-data-structures/sets/qp-trie/api․lisp file
api.lisp: The cl-data-structures/sets/skip-list/api․lisp file
api.lisp: The cl-data-structures/metric-space/api․lisp file
api.lisp: The cl-data-structures/metric-space/egnat/api․lisp file
approximated-counts: Public classes
approximated-counts-function: Private classes
approximated-counts.lisp: The cl-data-structures/streaming-algorithms/approximated-counts․lisp file
approximated-histogram: Public classes
approximated-histogram-bin: Private structures
approximated-histogram-function: Private classes
approximated-histogram.lisp: The cl-data-structures/streaming-algorithms/approximated-histogram․lisp file
approximated-set-cardinality: Public classes
approximated-set-cardinality-function: Private classes
approximated-set-cardinality.lisp: The cl-data-structures/streaming-algorithms/approximated-set-cardinality․lisp file
approximated-top-k-function: Private classes
approximated-top-k.lisp: The cl-data-structures/streaming-algorithms/approximated-top-k․lisp file
argument-error: Public conditions
argument-value-not-in-allowed-set: Public conditions
argument-value-out-of-bounds: Public conditions
array-average-function: Private classes
array-elementwise-forward-proxy: Private classes
array-elementwise-function: Private classes
array-elementwise.lisp: The cl-data-structures/algorithms/array-elementwise․lisp file
array-geometric-average-function: Private classes
array-harmonic-average-function: Private classes
array-sum-function: Private classes
arrays.lisp: The cl-data-structures/utils/arrays․lisp file
assignable-forward-tree-range: Public classes
assoc-skip-list-node: Private structures
aux-package.lisp: The cl-data-structures/aux-package․lisp file
auxilary.lisp: The cl-data-structures/api/auxilary․lisp file
average-function: Private classes
average.lisp: The cl-data-structures/math/average․lisp file

B
bidirectional-bootstrap-proxy: Private classes
bidirectional-buffer-range: Private classes
bidirectional-chain-of-ranges: Public classes
bidirectional-connecting-range: Private classes
bidirectional-establish-special-proxy-range: Private classes
bidirectional-filtering-proxy: Private classes
bidirectional-group-by-proxy: Private classes
bidirectional-in-batches-proxy: Private classes
bidirectional-only-proxy: Private classes
bidirectional-parallel-group-by-proxy: Private classes
bidirectional-proxy-box-range: Private classes
bidirectional-proxy-range: Public classes
bidirectional-with-previous-element-proxy: Private classes
bidirectional-without-proxy: Private classes
bidirectional-zipped-ranges: Private classes
bind.lisp: The cl-data-structures/utils/bind․lisp file
bloom-filter: Public classes
bloom-filter-function: Private classes
bloom-filter.lisp: The cl-data-structures/streaming-algorithms/bloom-filter․lisp file
bootstrap-function: Private classes
bootstrap-proxy: Private classes
bootstrap.lisp: The cl-data-structures/math/bootstrap․lisp file
box-container: Private classes
bucket-sort.lisp: The cl-data-structures/utils/bucket-sort․lisp file
buffer-index: Private types
buffer-range: Private classes
buffer-range.lisp: The cl-data-structures/threads/buffer-range․lisp file

C
callback-minhash: Private classes
cartesian.lisp: The cl-data-structures/utils/cartesian․lisp file
cartesian.lisp: The cl-data-structures/algorithms/cartesian․lisp file
chain.lisp: The cl-data-structures/algorithms/chain․lisp file
changes: Private structures
chunkable-bidirectional-connecting-range: Private classes
chunkable-forward-connecting-range: Private classes
chunkable-random-access-connecting-range: Private classes
chunked-proxy-range: Private classes
chunked-range: Public classes
chunked-rrb-range: Private classes
chunking-mixin: Public classes
cl-data-structures: The cl-data-structures system
cl-data-structures: The cl-data-structures package
cl-data-structures.adapters: The cl-data-structures․adapters package
cl-data-structures.algorithms: The cl-data-structures․algorithms package
cl-data-structures.algorithms.meta: The cl-data-structures․algorithms․meta package
cl-data-structures.asd: The cl-data-structures/cl-data-structures․asd file
cl-data-structures.aux-package: The cl-data-structures․aux-package package
cl-data-structures.common: The cl-data-structures․common package
cl-data-structures.common.2-3-tree: The cl-data-structures․common․2-3-tree package
cl-data-structures.common.abstract: The cl-data-structures․common․abstract package
cl-data-structures.common.egnat: The cl-data-structures․common․egnat package
cl-data-structures.common.hamt: The cl-data-structures․common․hamt package
cl-data-structures.common.qp-trie: The cl-data-structures․common․qp-trie package
cl-data-structures.common.rrb: The cl-data-structures․common․rrb package
cl-data-structures.common.skip-list: The cl-data-structures․common․skip-list package
cl-data-structures.composite: The cl-data-structures․composite package
cl-data-structures.dicts: The cl-data-structures․dicts package
cl-data-structures.dicts.hamt: The cl-data-structures․dicts․hamt package
cl-data-structures.dicts.skip-list: The cl-data-structures․dicts․skip-list package
cl-data-structures.dicts.srrb: The cl-data-structures․dicts․srrb package
cl-data-structures.fancy: The cl-data-structures․fancy package
cl-data-structures.file-system: The cl-data-structures․file-system package
cl-data-structures.math: The cl-data-structures․math package
cl-data-structures.meta: The cl-data-structures․meta package
cl-data-structures.metric-space: The cl-data-structures․metric-space package
cl-data-structures.metric-space.egnat: The cl-data-structures․metric-space․egnat package
cl-data-structures.queues: The cl-data-structures․queues package
cl-data-structures.queues.2-3-tree: The cl-data-structures․queues․2-3-tree package
cl-data-structures.sequences: The cl-data-structures․sequences package
cl-data-structures.sequences.rrb-vector: The cl-data-structures․sequences․rrb-vector package
cl-data-structures.sets: The cl-data-structures․sets package
cl-data-structures.sets.qp-trie: The cl-data-structures․sets․qp-trie package
cl-data-structures.sets.skip-list: The cl-data-structures․sets․skip-list package
cl-data-structures.streaming-algorithms: The cl-data-structures․streaming-algorithms package
cl-data-structures.streaming-algorithms.hyperloglog: The cl-data-structures․streaming-algorithms․hyperloglog package
cl-data-structures.streaming-algorithms.polynomial-hashing: The cl-data-structures․streaming-algorithms․polynomial-hashing package
cl-data-structures.threads: The cl-data-structures․threads package
cl-data-structures.utils: The cl-data-structures․utils package
Class, %summary-function: Private classes
Class, 2-3-queue: Private classes
Class, 2-3-queue-range: Private classes
Class, 2-node: Public classes
Class, 3-node: Public classes
Class, absolute-value-norm-function: Private classes
Class, abstract-in-batches-proxy: Private classes
Class, abstract-partition-if-proxy: Private classes
Class, abstract-sliding-window-proxy: Private classes
Class, accumulate-function: Private classes
Class, add!-function: Public classes
Class, add-function: Public classes
Class, aggregation-function: Public classes
Class, all-files-file-range-stack-cell: Private classes
Class, approximated-counts: Public classes
Class, approximated-counts-function: Private classes
Class, approximated-histogram: Public classes
Class, approximated-histogram-function: Private classes
Class, approximated-set-cardinality: Public classes
Class, approximated-set-cardinality-function: Private classes
Class, approximated-top-k-function: Private classes
Class, array-average-function: Private classes
Class, array-elementwise-forward-proxy: Private classes
Class, array-elementwise-function: Private classes
Class, array-geometric-average-function: Private classes
Class, array-harmonic-average-function: Private classes
Class, array-sum-function: Private classes
Class, assignable-forward-tree-range: Public classes
Class, average-function: Private classes
Class, bidirectional-bootstrap-proxy: Private classes
Class, bidirectional-buffer-range: Private classes
Class, bidirectional-chain-of-ranges: Public classes
Class, bidirectional-connecting-range: Private classes
Class, bidirectional-establish-special-proxy-range: Private classes
Class, bidirectional-filtering-proxy: Private classes
Class, bidirectional-group-by-proxy: Private classes
Class, bidirectional-in-batches-proxy: Private classes
Class, bidirectional-only-proxy: Private classes
Class, bidirectional-parallel-group-by-proxy: Private classes
Class, bidirectional-proxy-box-range: Private classes
Class, bidirectional-proxy-range: Public classes
Class, bidirectional-with-previous-element-proxy: Private classes
Class, bidirectional-without-proxy: Private classes
Class, bidirectional-zipped-ranges: Private classes
Class, bloom-filter: Public classes
Class, bloom-filter-function: Private classes
Class, bootstrap-function: Private classes
Class, bootstrap-proxy: Private classes
Class, box-container: Private classes
Class, buffer-range: Private classes
Class, callback-minhash: Private classes
Class, chunkable-bidirectional-connecting-range: Private classes
Class, chunkable-forward-connecting-range: Private classes
Class, chunkable-random-access-connecting-range: Private classes
Class, chunked-proxy-range: Private classes
Class, chunked-range: Public classes
Class, chunked-rrb-range: Private classes
Class, chunking-mixin: Public classes
Class, co-occurence-table-function: Private classes
Class, command: Public classes
Class, composite-container: Private classes
Class, count-elements-function: Public classes
Class, cumulative-accumulate-function: Private classes
Class, cumulative-accumulate-range: Public classes
Class, cumulative-state: Private classes
Class, delayed: Public classes
Class, destructive-function: Public classes
Class, directory-file-range-stack-cell: Private classes
Class, distinct-function: Private classes
Class, distinct-proxy: Private classes
Class, eager-modification-operation-status: Public classes
Class, egnat-metric-set: Public classes
Class, egnat-node: Private classes
Class, egnat-range: Private classes
Class, egnat-range-around: Private classes
Class, egnat-subtree: Private classes
Class, empty-range: Public classes
Class, entropy-function: Private classes
Class, enumerate-function: Private classes
Class, erase!-function: Public classes
Class, erase*!-function: Public classes
Class, erase*-function: Public classes
Class, erase-function: Public classes
Class, erase-if!-function: Public classes
Class, erase-if-function: Public classes
Class, establish-special-function: Private classes
Class, establish-special-proxy: Private classes
Class, expression: Public classes
Class, extrema-function: Private classes
Class, extremum-function: Private classes
Class, fast-map-function: Private classes
Class, field: Public classes
Class, file-file-range-stack-cell: Private classes
Class, file-range-mixin: Public classes
Class, filtering-proxy: Public classes
Class, find-range: Private classes
Class, first-element-function: Private classes
Class, fixed-capacity-synchronization-mixin: Private classes
Class, fixed-capacity-synchronized-mutable-2-3-queue: Public classes
Class, fixed-capacity-synchronized-transactional-2-3-queue: Public classes
Class, flatten-lists-function: Private classes
Class, flatten-proxy: Private classes
Class, forward-abstract-partition-if-proxy: Private classes
Class, forward-bootstrap-proxy: Private classes
Class, forward-buffer-range: Private classes
Class, forward-cartesian-range: Private classes
Class, forward-chain-of-ranges: Public classes
Class, forward-connecting-range: Private classes
Class, forward-distinct-proxy: Private classes
Class, forward-establish-special-proxy-range: Private classes
Class, forward-filtering-proxy: Private classes
Class, forward-flatten-proxy: Private classes
Class, forward-group-by-proxy: Private classes
Class, forward-in-batches-proxy: Private classes
Class, forward-latch-proxy: Private classes
Class, forward-multiplex-proxy: Public classes
Class, forward-only-different-proxy: Private classes
Class, forward-only-proxy: Private classes
Class, forward-parallel-group-by-proxy: Private classes
Class, forward-partition-if-proxy: Private classes
Class, forward-proxy-box-range: Public classes
Class, forward-proxy-range: Public classes
Class, forward-repeat-proxy: Private classes
Class, forward-restrain-size-proxy: Private classes
Class, forward-sliding-window-proxy: Private classes
Class, forward-tree-range: Public classes
Class, forward-with-previous-element-proxy: Private classes
Class, forward-without-proxy: Private classes
Class, forward-zipped-ranges: Private classes
Class, frequency-function: Private classes
Class, functional: Public classes
Class, functional-2-3-queue: Public classes
Class, functional-add-function: Public classes
Class, functional-composite-container: Private classes
Class, functional-dictionary: Public classes
Class, functional-erase-function: Public classes
Class, functional-erase-if-function: Public classes
Class, functional-function: Public classes
Class, functional-hamt-dictionary: Public classes
Class, functional-hashing-dictionary: Public classes
Class, functional-insert-function: Public classes
Class, functional-put-back-function: Public classes
Class, functional-put-front-function: Public classes
Class, functional-put-function: Public classes
Class, functional-rrb-vector: Public classes
Class, functional-sequence: Public classes
Class, functional-sparse-rrb-vector: Public classes
Class, functional-sparse-vector: Public classes
Class, functional-take-out-back-function: Public classes
Class, functional-take-out-front-function: Public classes
Class, functional-take-out-function: Public classes
Class, functional-update-function: Public classes
Class, functional-update-if-function: Public classes
Class, fundamental-assiganable-range: Private classes
Class, fundamental-assignable-bidirectional-range: Private classes
Class, fundamental-assignable-forward-range: Public classes
Class, fundamental-assignable-random-access-range: Private classes
Class, fundamental-bidirectional-range: Public classes
Class, fundamental-container: Public classes
Class, fundamental-data-sketch: Public classes
Class, fundamental-dictionary: Public classes
Class, fundamental-egnat-container: Public classes
Class, fundamental-file-range-stack-cell: Private classes
Class, fundamental-forward-range: Public classes
Class, fundamental-functional-queue: Public classes
Class, fundamental-hashing-dictionary: Public classes
Class, fundamental-minhash: Private classes
Class, fundamental-modification-operation-status: Public classes
Class, fundamental-mutable-queue: Public classes
Class, fundamental-ownership-tagged-object: Public classes
Class, fundamental-qp-trie-set: Public classes
Class, fundamental-queue: Public classes
Class, fundamental-random-access-range: Public classes
Class, fundamental-range: Public classes
Class, fundamental-sequence: Public classes
Class, fundamental-set: Public classes
Class, fundamental-skip-list: Public classes
Class, fundamental-skip-list-range: Public classes
Class, fundamental-sparse-rrb-vector: Private classes
Class, fundamental-sparse-vector: Public classes
Class, fundamental-transactional-queue: Public classes
Class, future-carousel: Public classes
Class, gather-corpus-function: Private classes
Class, geometric-average-function: Private classes
Class, gini-impurity-function: Private classes
Class, group-by-function: Public classes
Class, group-by-proxy: Private classes
Class, group-by-result-range: Public classes
Class, grow-function: Public classes
Class, half-matrix: Public classes
Class, hamt-container: Public classes
Class, hamt-dictionary: Public classes
Class, harmonic-average-function: Private classes
Class, harmonic-average-mutual-information-function: Private classes
Class, hash-table-elementwise-forward-proxy: Private classes
Class, hash-table-elementwise-function: Private classes
Class, hash-table-range: Public classes
Class, hodges-lehmann-estimator-function: Private classes
Class, implementation-modification-operation-status: Private classes
Class, in-batches-function: Private classes
Class, info-field: Private classes
Class, insert!-function: Public classes
Class, insert-function: Public classes
Class, key-value-range: Public classes
Class, last-element-function: Private classes
Class, latch-function: Private classes
Class, latch-proxy: Private classes
Class, layer-function: Public classes
Class, lazy: Public classes
Class, lazy-bidirectional-range: Public classes
Class, lazy-box-container: Public classes
Class, lazy-box-dictionary: Private classes
Class, lazy-box-sequence: Private classes
Class, lazy-dictionary: Public classes
Class, lazy-forward-range: Private classes
Class, lazy-hashing-dictionary: Public classes
Class, lazy-modification-operation-status: Private classes
Class, lazy-random-access-range: Public classes
Class, lazy-range: Private classes
Class, line-by-line-range: Private classes
Class, linear-regression-fit: Private classes
Class, list-range: Public classes
Class, list-sequence-window: Private classes
Class, median-absolute-deviation-function: Private classes
Class, metric-space-dictionary: Public classes
Class, metric-space-set: Public classes
Class, minhash-corpus: Private classes
Class, moments-function: Private classes
Class, moving-average-function: Private classes
Class, moving-average-range: Private classes
Class, multiplex-function: Private classes
Class, multiplex-proxy: Private classes
Class, mutable: Public classes
Class, mutable-2-3-queue: Public classes
Class, mutable-composite-container: Private classes
Class, mutable-dictionary: Public classes
Class, mutable-egnat-container: Public classes
Class, mutable-egnat-metric-set: Public classes
Class, mutable-hamt-dictionary: Public classes
Class, mutable-hashing-dictionary: Public classes
Class, mutable-metric-space-dictionary: Public classes
Class, mutable-metric-space-set: Public classes
Class, mutable-qp-trie-set: Public classes
Class, mutable-rrb-range: Private classes
Class, mutable-rrb-vector: Public classes
Class, mutable-sequence: Public classes
Class, mutable-set: Public classes
Class, mutable-skip-list-dictionary: Public classes
Class, mutable-skip-list-dictionary-range: Private classes
Class, mutable-skip-list-set: Public classes
Class, mutable-skip-list-set-range: Private classes
Class, mutable-sparse-rrb-vector: Public classes
Class, mutable-sparse-vector: Public classes
Class, mutual-information-function: Private classes
Class, mutual-information-matrix-function: Private classes
Class, node: Public classes
Class, offset-vector-range: Public classes
Class, on-each-function: Private classes
Class, one-bit-minhash: Private classes
Class, only-different-function: Private classes
Class, only-different-proxy: Private classes
Class, only-function: Private classes
Class, only-proxy: Private classes
Class, optimal-split-point-function: Private classes
Class, parallel-forward-multiplex-proxy: Private classes
Class, parallel-group-by-function: Private classes
Class, parallel-group-by-proxy: Private classes
Class, parallel-multiplex-function: Private classes
Class, parallel-on-each-function: Private classes
Class, parallel-on-each-proxy: Private classes
Class, partition-if-function: Private classes
Class, partition-if-proxy: Private classes
Class, pipe-fragment: Public classes
Class, polynomial-callback-minhash: Private classes
Class, polynomial-callback-one-bit-minhash: Private classes
Class, proxy-box-range: Public classes
Class, proxy-range: Public classes
Class, put!-function: Public classes
Class, put-back!-function: Public classes
Class, put-back-function: Private classes
Class, put-front!-function: Public classes
Class, put-front-function: Private classes
Class, put-function: Public classes
Class, qp-trie: Public classes
Class, qp-trie-range-stack-cell: Private classes
Class, qp-trie-set-range: Private classes
Class, random-access-bootstrap-proxy: Private classes
Class, random-access-buffer-range: Private classes
Class, random-access-chain-of-ranges: Public classes
Class, random-access-connecting-range: Private classes
Class, random-access-establish-special-proxy-range: Private classes
Class, random-access-group-by-proxy: Private classes
Class, random-access-in-batches-proxy: Private classes
Class, random-access-parallel-group-by-proxy: Private classes
Class, random-access-proxy-box-range: Private classes
Class, random-access-proxy-range: Public classes
Class, random-access-sequence-window: Private classes
Class, random-access-with-previous-element-proxy: Private classes
Class, random-access-zipped-ranges: Private classes
Class, range-function: Public classes
Class, rate-function: Private classes
Class, recursive-content-file-range-stack-cell: Private classes
Class, regex-directory-file-range-stack-cell: Private classes
Class, regex-file-file-range-stack-cell: Private classes
Class, repeat-function: Private classes
Class, repeat-proxy: Private classes
Class, reservoir-sample-function: Private classes
Class, restrain-size-function: Private classes
Class, restrain-size-proxy: Private classes
Class, rrb-container: Public classes
Class, rrb-range: Public classes
Class, rrb-vector: Private classes
Class, seeds-callback-minhash: Private classes
Class, seeds-callback-one-bit-minhash: Private classes
Class, sequence-window: Public classes
Class, shrink-function: Public classes
Class, shuffled-range: Public classes
Class, simple-linear-regression-function: Private classes
Class, sliding-window-function: Private classes
Class, split-point-field: Private classes
Class, standard-deviation-function: Private classes
Class, stateful-file-range-stack-cell: Private classes
Class, sum-function: Private classes
Class, summary-aggregation-function: Private classes
Class, summary-result-range: Public classes
Class, synchronization-mixin: Private classes
Class, synchronization-primitives-mixin: Private classes
Class, synchronized-mutable-2-3-queue: Public classes
Class, synchronized-transactional-2-3-queue: Public classes
Class, tagged-2-node: Private classes
Class, tagged-3-node: Private classes
Class, tagged-node: Public classes
Class, tagged-tree: Private classes
Class, take-out!-function: Public classes
Class, take-out-back!-function: Public classes
Class, take-out-back-function: Private classes
Class, take-out-front!-function: Public classes
Class, take-out-front-function: Private classes
Class, take-out-function: Public classes
Class, thread-buffer-function: Private classes
Class, to-hash-table-function: Private classes
Class, to-list-function: Private classes
Class, to-vector-function: Private classes
Class, tokenizing-range: Private classes
Class, transactional: Public classes
Class, transactional-2-3-queue: Public classes
Class, transactional-dictionary: Public classes
Class, transactional-hamt-dictionary: Public classes
Class, transactional-hashing-dictionary: Public classes
Class, transactional-rrb-vector: Public classes
Class, transactional-sequence: Public classes
Class, transactional-sparse-rrb-vector: Public classes
Class, transactional-sparse-vector: Public classes
Class, transformation!-function: Public classes
Class, translation-function: Private classes
Class, transparent-to-chunking-mixin: Public classes
Class, traversable: Public classes
Class, tree: Public classes
Class, update!-function: Public classes
Class, update-function: Public classes
Class, update-if!-function: Public classes
Class, update-if-function: Public classes
Class, variance-function: Private classes
Class, vector-range: Public classes
Class, vector-sequence-window: Private classes
Class, with-previous-element-function: Private classes
Class, with-previous-element-proxy: Private classes
Class, without-function: Private classes
Class, without-proxy: Private classes
Class, xors-callback-minhash: Private classes
Class, xors-callback-one-bit-minhash: Private classes
Class, zipping-mixin: Private classes
classes.lisp: The cl-data-structures/common/egnat/classes․lisp file
classes.lisp: The cl-data-structures/algorithms/meta/classes․lisp file
cloning.lisp: The cl-data-structures/utils/cloning․lisp file
co-occurence-table-function: Private classes
co-occurence-table.lisp: The cl-data-structures/math/co-occurence-table․lisp file
command: Public classes
common: The cl-data-structures/common module
common-range-category.lisp: The cl-data-structures/algorithms/common-range-category․lisp file
common.lisp: The cl-data-structures/common/abstract/common․lisp file
common.lisp: The cl-data-structures/common/2-3-tree/common․lisp file
common.lisp: The cl-data-structures/common/hamt/common․lisp file
common.lisp: The cl-data-structures/common/rrb/common․lisp file
common.lisp: The cl-data-structures/common/skip-list/common․lisp file
common.lisp: The cl-data-structures/common/egnat/common․lisp file
common.lisp: The cl-data-structures/dicts/common․lisp file
common.lisp: The cl-data-structures/sequences/common․lisp file
common.lisp: The cl-data-structures/queues/common․lisp file
common.lisp: The cl-data-structures/sets/common․lisp file
common.lisp: The cl-data-structures/metric-space/common․lisp file
common.lisp: The cl-data-structures/algorithms/common․lisp file
common.lisp: The cl-data-structures/file-system/common․lisp file
common.lisp: The cl-data-structures/streaming-algorithms/common․lisp file
composite: The cl-data-structures/composite module
composite-container: Private classes
Condition, argument-error: Public conditions
Condition, argument-value-not-in-allowed-set: Public conditions
Condition, argument-value-out-of-bounds: Public conditions
Condition, dimensionality-error: Public conditions
Condition, early-aggregation-exit: Public conditions
Condition, empty-array-key: Public conditions
Condition, empty-container: Public conditions
Condition, file-releated-error: Public conditions
Condition, incompatible-arguments: Public conditions
Condition, initialization-error: Public conditions
Condition, initialization-out-of-bounds: Public conditions
Condition, invalid-argument: Public conditions
Condition, invalid-argument-value: Public conditions
Condition, invalid-value: Public conditions
Condition, not-implemented: Public conditions
Condition, not-in-allowed-set: Public conditions
Condition, operation-not-allowed: Public conditions
Condition, out-of-bounds: Public conditions
Condition, textual-error: Public conditions
Condition, too-many-dimensions: Public conditions
Condition, unexpected-argument: Public conditions
conditions.lisp: The cl-data-structures/api/conditions․lisp file
content-tuple.lisp: The cl-data-structures/common/content-tuple․lisp file
count-elements-function: Public classes
count.lisp: The cl-data-structures/algorithms/count․lisp file
cumulative-accumulate-function: Private classes
cumulative-accumulate-range: Public classes
cumulative-accumulate.lisp: The cl-data-structures/algorithms/cumulative-accumulate․lisp file
cumulative-state: Private classes

D
delay.lisp: The cl-data-structures/api/delay․lisp file
delayed: Public classes
destructive-function: Public classes
dict-content: Public structures
dicts: The cl-data-structures/dicts module
dimensionality-error: Public conditions
directory-file-range-stack-cell: Private classes
distances.lisp: The cl-data-structures/utils/distances․lisp file
distinct-function: Private classes
distinct-proxy: Private classes
distinct.lisp: The cl-data-structures/algorithms/distinct․lisp file
docstrings.lisp: The cl-data-structures/utils/docstrings․lisp file
docstrings.lisp: The cl-data-structures/api/docstrings․lisp file
docstrings.lisp: The cl-data-structures/common/docstrings․lisp file
docstrings.lisp: The cl-data-structures/common/egnat/docstrings․lisp file
docstrings.lisp: The cl-data-structures/dicts/docstrings․lisp file
docstrings.lisp: The cl-data-structures/dicts/hamt/docstrings․lisp file
docstrings.lisp: The cl-data-structures/dicts/srrb/docstrings․lisp file
docstrings.lisp: The cl-data-structures/sequences/rrb/docstrings․lisp file
docstrings.lisp: The cl-data-structures/queues/docstrings․lisp file
docstrings.lisp: The cl-data-structures/queues/2-3-tree/docstrings․lisp file
docstrings.lisp: The cl-data-structures/sets/docstrings․lisp file
docstrings.lisp: The cl-data-structures/sets/qp-trie/docstrings․lisp file
docstrings.lisp: The cl-data-structures/sets/skip-list/docstrings․lisp file
docstrings.lisp: The cl-data-structures/metric-space/docstrings․lisp file
docstrings.lisp: The cl-data-structures/algorithms/meta/docstrings․lisp file
docstrings.lisp: The cl-data-structures/algorithms/docstrings․lisp file
docstrings.lisp: The cl-data-structures/file-system/docstrings․lisp file
docstrings.lisp: The cl-data-structures/threads/docstrings․lisp file
docstrings.lisp: The cl-data-structures/math/docstrings․lisp file
docstrings.lisp: The cl-data-structures/streaming-algorithms/docstrings․lisp file

E
eager-modification-operation-status: Public classes
eager-modification-operation-status.lisp: The cl-data-structures/common/eager-modification-operation-status․lisp file
early-aggregation-exit: Public conditions
egnat: The cl-data-structures/common/egnat module
egnat: The cl-data-structures/metric-space/egnat module
egnat-metric-set: Public classes
egnat-node: Private classes
egnat-range: Private classes
egnat-range-around: Private classes
egnat-subtree: Private classes
embedding.lisp: The cl-data-structures/utils/embedding․lisp file
empty-array-key: Public conditions
empty-container: Public conditions
empty-range: Public classes
entropy-function: Private classes
entropy.lisp: The cl-data-structures/math/entropy․lisp file
enumerate-function: Private classes
enumerate.lisp: The cl-data-structures/algorithms/enumerate․lisp file
erase!-function: Public classes
erase*!-function: Public classes
erase*-function: Public classes
erase-function: Public classes
erase-if!-function: Public classes
erase-if-function: Public classes
establish-special-function: Private classes
establish-special-proxy: Private classes
establish-special.lisp: The cl-data-structures/algorithms/establish-special․lisp file
expression: Public classes
expression-wrapper.lisp: The cl-data-structures/api/expression-wrapper․lisp file
extendable-vector: Public types
extrema-function: Private classes
extrema.lisp: The cl-data-structures/algorithms/extrema․lisp file
extremum-function: Private classes
extremum.lisp: The cl-data-structures/algorithms/extremum․lisp file

F
fast-map-function: Private classes
fast-map.lisp: The cl-data-structures/math/fast-map․lisp file
field: Public classes
field.lisp: The cl-data-structures/api/field․lisp file
File, absolute-value-norm.lisp: The cl-data-structures/math/absolute-value-norm․lisp file
File, accumulate.lisp: The cl-data-structures/algorithms/accumulate․lisp file
File, api.lisp: The cl-data-structures/dicts/api․lisp file
File, api.lisp: The cl-data-structures/dicts/skip-list/api․lisp file
File, api.lisp: The cl-data-structures/dicts/hamt/api․lisp file
File, api.lisp: The cl-data-structures/dicts/srrb/api․lisp file
File, api.lisp: The cl-data-structures/sequences/rrb/api․lisp file
File, api.lisp: The cl-data-structures/queues/2-3-tree/api․lisp file
File, api.lisp: The cl-data-structures/sets/qp-trie/api․lisp file
File, api.lisp: The cl-data-structures/sets/skip-list/api․lisp file
File, api.lisp: The cl-data-structures/metric-space/api․lisp file
File, api.lisp: The cl-data-structures/metric-space/egnat/api․lisp file
File, approximated-counts.lisp: The cl-data-structures/streaming-algorithms/approximated-counts․lisp file
File, approximated-histogram.lisp: The cl-data-structures/streaming-algorithms/approximated-histogram․lisp file
File, approximated-set-cardinality.lisp: The cl-data-structures/streaming-algorithms/approximated-set-cardinality․lisp file
File, approximated-top-k.lisp: The cl-data-structures/streaming-algorithms/approximated-top-k․lisp file
File, array-elementwise.lisp: The cl-data-structures/algorithms/array-elementwise․lisp file
File, arrays.lisp: The cl-data-structures/utils/arrays․lisp file
File, aux-package.lisp: The cl-data-structures/aux-package․lisp file
File, auxilary.lisp: The cl-data-structures/api/auxilary․lisp file
File, average.lisp: The cl-data-structures/math/average․lisp file
File, bind.lisp: The cl-data-structures/utils/bind․lisp file
File, bloom-filter.lisp: The cl-data-structures/streaming-algorithms/bloom-filter․lisp file
File, bootstrap.lisp: The cl-data-structures/math/bootstrap․lisp file
File, bucket-sort.lisp: The cl-data-structures/utils/bucket-sort․lisp file
File, buffer-range.lisp: The cl-data-structures/threads/buffer-range․lisp file
File, cartesian.lisp: The cl-data-structures/utils/cartesian․lisp file
File, cartesian.lisp: The cl-data-structures/algorithms/cartesian․lisp file
File, chain.lisp: The cl-data-structures/algorithms/chain․lisp file
File, cl-data-structures.asd: The cl-data-structures/cl-data-structures․asd file
File, classes.lisp: The cl-data-structures/common/egnat/classes․lisp file
File, classes.lisp: The cl-data-structures/algorithms/meta/classes․lisp file
File, cloning.lisp: The cl-data-structures/utils/cloning․lisp file
File, co-occurence-table.lisp: The cl-data-structures/math/co-occurence-table․lisp file
File, common-range-category.lisp: The cl-data-structures/algorithms/common-range-category․lisp file
File, common.lisp: The cl-data-structures/common/abstract/common․lisp file
File, common.lisp: The cl-data-structures/common/2-3-tree/common․lisp file
File, common.lisp: The cl-data-structures/common/hamt/common․lisp file
File, common.lisp: The cl-data-structures/common/rrb/common․lisp file
File, common.lisp: The cl-data-structures/common/skip-list/common․lisp file
File, common.lisp: The cl-data-structures/common/egnat/common․lisp file
File, common.lisp: The cl-data-structures/dicts/common․lisp file
File, common.lisp: The cl-data-structures/sequences/common․lisp file
File, common.lisp: The cl-data-structures/queues/common․lisp file
File, common.lisp: The cl-data-structures/sets/common․lisp file
File, common.lisp: The cl-data-structures/metric-space/common․lisp file
File, common.lisp: The cl-data-structures/algorithms/common․lisp file
File, common.lisp: The cl-data-structures/file-system/common․lisp file
File, common.lisp: The cl-data-structures/streaming-algorithms/common․lisp file
File, conditions.lisp: The cl-data-structures/api/conditions․lisp file
File, content-tuple.lisp: The cl-data-structures/common/content-tuple․lisp file
File, count.lisp: The cl-data-structures/algorithms/count․lisp file
File, cumulative-accumulate.lisp: The cl-data-structures/algorithms/cumulative-accumulate․lisp file
File, delay.lisp: The cl-data-structures/api/delay․lisp file
File, distances.lisp: The cl-data-structures/utils/distances․lisp file
File, distinct.lisp: The cl-data-structures/algorithms/distinct․lisp file
File, docstrings.lisp: The cl-data-structures/utils/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/api/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/common/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/common/egnat/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/dicts/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/dicts/hamt/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/dicts/srrb/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/sequences/rrb/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/queues/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/queues/2-3-tree/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/sets/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/sets/qp-trie/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/sets/skip-list/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/metric-space/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/algorithms/meta/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/algorithms/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/file-system/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/threads/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/math/docstrings․lisp file
File, docstrings.lisp: The cl-data-structures/streaming-algorithms/docstrings․lisp file
File, eager-modification-operation-status.lisp: The cl-data-structures/common/eager-modification-operation-status․lisp file
File, embedding.lisp: The cl-data-structures/utils/embedding․lisp file
File, entropy.lisp: The cl-data-structures/math/entropy․lisp file
File, enumerate.lisp: The cl-data-structures/algorithms/enumerate․lisp file
File, establish-special.lisp: The cl-data-structures/algorithms/establish-special․lisp file
File, expression-wrapper.lisp: The cl-data-structures/api/expression-wrapper․lisp file
File, extrema.lisp: The cl-data-structures/algorithms/extrema․lisp file
File, extremum.lisp: The cl-data-structures/algorithms/extremum․lisp file
File, fast-map.lisp: The cl-data-structures/math/fast-map․lisp file
File, field.lisp: The cl-data-structures/api/field․lisp file
File, filtering.lisp: The cl-data-structures/algorithms/filtering․lisp file
File, find.lisp: The cl-data-structures/file-system/find․lisp file
File, first-element.lisp: The cl-data-structures/algorithms/first-element․lisp file
File, flatten-lists.lisp: The cl-data-structures/algorithms/flatten-lists․lisp file
File, frequency.lisp: The cl-data-structures/algorithms/frequency․lisp file
File, functions.lisp: The cl-data-structures/api/functions․lisp file
File, fundamental-classes.lisp: The cl-data-structures/api/fundamental-classes․lisp file
File, generics.lisp: The cl-data-structures/api/generics․lisp file
File, generics.lisp: The cl-data-structures/common/egnat/generics․lisp file
File, generics.lisp: The cl-data-structures/algorithms/meta/generics․lisp file
File, gini-impurity.lisp: The cl-data-structures/math/gini-impurity․lisp file
File, group-by.lisp: The cl-data-structures/algorithms/group-by․lisp file
File, hash-table-elementwise.lisp: The cl-data-structures/algorithms/hash-table-elementwise․lisp file
File, hash-table.lisp: The cl-data-structures/adapters/hash-table․lisp file
File, hashing.lisp: The cl-data-structures/utils/hashing․lisp file
File, higher-order.lisp: The cl-data-structures/utils/higher-order․lisp file
File, hmm.lisp: The cl-data-structures/math/hmm․lisp file
File, hodges-lehmann.lisp: The cl-data-structures/math/hodges-lehmann․lisp file
File, hyperloglog.lisp: The cl-data-structures/streaming-algorithms/hyperloglog․lisp file
File, implementation.lisp: The cl-data-structures/composite/implementation․lisp file
File, in-batches.lisp: The cl-data-structures/algorithms/in-batches․lisp file
File, internal.lisp: The cl-data-structures/dicts/hamt/internal․lisp file
File, internal.lisp: The cl-data-structures/dicts/srrb/internal․lisp file
File, lambda-lists.lisp: The cl-data-structures/utils/lambda-lists․lisp file
File, latch.lisp: The cl-data-structures/algorithms/latch․lisp file
File, lazy-box.lisp: The cl-data-structures/common/lazy-box․lisp file
File, lazy-range.lisp: The cl-data-structures/common/lazy-range․lisp file
File, lazy-shuffle.lisp: The cl-data-structures/utils/lazy-shuffle․lisp file
File, line-by-line.lisp: The cl-data-structures/file-system/line-by-line․lisp file
File, list.lisp: The cl-data-structures/adapters/list․lisp file
File, lists.lisp: The cl-data-structures/utils/lists․lisp file
File, macros.lisp: The cl-data-structures/utils/macros․lisp file
File, macros.lisp: The cl-data-structures/api/macros․lisp file
File, macros.lisp: The cl-data-structures/algorithms/meta/macros․lisp file
File, median-absolute-deviation.lisp: The cl-data-structures/math/median-absolute-deviation․lisp file
File, meta-docstrings.lisp: The cl-data-structures/api/meta-docstrings․lisp file
File, meta.lisp: The cl-data-structures/api/meta․lisp file
File, meta.lisp: The cl-data-structures/common/meta․lisp file
File, methods.lisp: The cl-data-structures/common/egnat/methods․lisp file
File, methods.lisp: The cl-data-structures/algorithms/meta/methods․lisp file
File, minhash.lisp: The cl-data-structures/streaming-algorithms/minhash․lisp file
File, modification-algorithms.lisp: The cl-data-structures/utils/modification-algorithms․lisp file
File, modification-operation-status.lisp: The cl-data-structures/common/modification-operation-status․lisp file
File, moments.lisp: The cl-data-structures/math/moments․lisp file
File, moving-average.lisp: The cl-data-structures/math/moving-average․lisp file
File, multiplex.lisp: The cl-data-structures/algorithms/multiplex․lisp file
File, mutual-information.lisp: The cl-data-structures/math/mutual-information․lisp file
File, numbers.lisp: The cl-data-structures/utils/numbers․lisp file
File, on-each.lisp: The cl-data-structures/algorithms/on-each․lisp file
File, only-different.lisp: The cl-data-structures/algorithms/only-different․lisp file
File, only.lisp: The cl-data-structures/algorithms/only․lisp file
File, ordered-algorithms.lisp: The cl-data-structures/utils/ordered-algorithms․lisp file
File, package.lisp: The cl-data-structures/package․lisp file
File, package.lisp: The cl-data-structures/utils/package․lisp file
File, package.lisp: The cl-data-structures/adapters/package․lisp file
File, package.lisp: The cl-data-structures/common/package․lisp file
File, package.lisp: The cl-data-structures/common/abstract/package․lisp file
File, package.lisp: The cl-data-structures/common/2-3-tree/package․lisp file
File, package.lisp: The cl-data-structures/common/hamt/package․lisp file
File, package.lisp: The cl-data-structures/common/rrb/package․lisp file
File, package.lisp: The cl-data-structures/common/skip-list/package․lisp file
File, package.lisp: The cl-data-structures/common/egnat/package․lisp file
File, package.lisp: The cl-data-structures/composite/package․lisp file
File, package.lisp: The cl-data-structures/algorithms/package․lisp file
File, package.lisp: The cl-data-structures/file-system/package․lisp file
File, package.lisp: The cl-data-structures/threads/package․lisp file
File, package.lisp: The cl-data-structures/math/package․lisp file
File, package.lisp: The cl-data-structures/streaming-algorithms/package․lisp file
File, packages.lisp: The cl-data-structures/dicts/packages․lisp file
File, packages.lisp: The cl-data-structures/sequences/packages․lisp file
File, packages.lisp: The cl-data-structures/queues/packages․lisp file
File, packages.lisp: The cl-data-structures/sets/packages․lisp file
File, packages.lisp: The cl-data-structures/metric-space/packages․lisp file
File, parallel-group-by.lisp: The cl-data-structures/threads/parallel-group-by․lisp file
File, parallel-multiplex.lisp: The cl-data-structures/threads/parallel-multiplex․lisp file
File, parallel-on-each.lisp: The cl-data-structures/threads/parallel-on-each․lisp file
File, parallel-tools.lisp: The cl-data-structures/utils/parallel-tools․lisp file
File, partition-if.lisp: The cl-data-structures/algorithms/partition-if․lisp file
File, polynomial-hashing.lisp: The cl-data-structures/streaming-algorithms/polynomial-hashing․lisp file
File, qp-trie.lisp: The cl-data-structures/common/qp-trie․lisp file
File, ranges.lisp: The cl-data-structures/common/ranges․lisp file
File, rate.lisp: The cl-data-structures/algorithms/rate․lisp file
File, repeat.lisp: The cl-data-structures/algorithms/repeat․lisp file
File, reservoir-sample.lisp: The cl-data-structures/algorithms/reservoir-sample․lisp file
File, restrain-size.lisp: The cl-data-structures/algorithms/restrain-size․lisp file
File, sequence-window.lisp: The cl-data-structures/common/sequence-window․lisp file
File, shuffled-range.lisp: The cl-data-structures/algorithms/shuffled-range․lisp file
File, simple-linear-regression.lisp: The cl-data-structures/math/simple-linear-regression․lisp file
File, sliding-window.lisp: The cl-data-structures/algorithms/sliding-window․lisp file
File, standard-deviation.lisp: The cl-data-structures/math/standard-deviation․lisp file
File, sum.lisp: The cl-data-structures/math/sum․lisp file
File, summary.lisp: The cl-data-structures/algorithms/summary․lisp file
File, to-hash-table.lisp: The cl-data-structures/algorithms/to-hash-table․lisp file
File, to-list.lisp: The cl-data-structures/algorithms/to-list․lisp file
File, to-vector.lisp: The cl-data-structures/algorithms/to-vector․lisp file
File, tokenize.lisp: The cl-data-structures/file-system/tokenize․lisp file
File, trait-classes.lisp: The cl-data-structures/api/trait-classes․lisp file
File, trait-classes.lisp: The cl-data-structures/dicts/trait-classes․lisp file
File, trait-classes.lisp: The cl-data-structures/metric-space/trait-classes․lisp file
File, translation.lisp: The cl-data-structures/algorithms/translation․lisp file
File, trees.lisp: The cl-data-structures/utils/trees․lisp file
File, trivial.lisp: The cl-data-structures/utils/trivial․lisp file
File, types.lisp: The cl-data-structures/utils/types․lisp file
File, types.lisp: The cl-data-structures/dicts/srrb/types․lisp file
File, unix.lisp: The cl-data-structures/file-system/unix․lisp file
File, variance.lisp: The cl-data-structures/math/variance․lisp file
File, vector.lisp: The cl-data-structures/adapters/vector․lisp file
File, with-previous-element.lisp: The cl-data-structures/algorithms/with-previous-element․lisp file
File, without.lisp: The cl-data-structures/algorithms/without․lisp file
File, zip.lisp: The cl-data-structures/algorithms/zip․lisp file
file-file-range-stack-cell: Private classes
file-range-mixin: Public classes
file-releated-error: Public conditions
file-system: The cl-data-structures/file-system module
filtering-proxy: Public classes
filtering.lisp: The cl-data-structures/algorithms/filtering․lisp file
find-range: Private classes
find.lisp: The cl-data-structures/file-system/find․lisp file
first-element-function: Private classes
first-element.lisp: The cl-data-structures/algorithms/first-element․lisp file
fixed-capacity-synchronization-mixin: Private classes
fixed-capacity-synchronized-mutable-2-3-queue: Public classes
fixed-capacity-synchronized-transactional-2-3-queue: Public classes
flatten-lists-function: Private classes
flatten-lists.lisp: The cl-data-structures/algorithms/flatten-lists․lisp file
flatten-proxy: Private classes
forward-abstract-partition-if-proxy: Private classes
forward-bootstrap-proxy: Private classes
forward-buffer-range: Private classes
forward-cartesian-range: Private classes
forward-chain-of-ranges: Public classes
forward-connecting-range: Private classes
forward-distinct-proxy: Private classes
forward-establish-special-proxy-range: Private classes
forward-filtering-proxy: Private classes
forward-flatten-proxy: Private classes
forward-group-by-proxy: Private classes
forward-in-batches-proxy: Private classes
forward-latch-proxy: Private classes
forward-multiplex-proxy: Public classes
forward-only-different-proxy: Private classes
forward-only-proxy: Private classes
forward-parallel-group-by-proxy: Private classes
forward-partition-if-proxy: Private classes
forward-proxy-box-range: Public classes
forward-proxy-range: Public classes
forward-repeat-proxy: Private classes
forward-restrain-size-proxy: Private classes
forward-sliding-window-proxy: Private classes
forward-tree-range: Public classes
forward-with-previous-element-proxy: Private classes
forward-without-proxy: Private classes
forward-zipped-ranges: Private classes
frequency-function: Private classes
frequency.lisp: The cl-data-structures/algorithms/frequency․lisp file
full-mask: Private types
functional: Public classes
functional-2-3-queue: Public classes
functional-add-function: Public classes
functional-composite-container: Private classes
functional-dictionary: Public classes
functional-erase-function: Public classes
functional-erase-if-function: Public classes
functional-function: Public classes
functional-hamt-dictionary: Public classes
functional-hashing-dictionary: Public classes
functional-insert-function: Public classes
functional-put-back-function: Public classes
functional-put-front-function: Public classes
functional-put-function: Public classes
functional-rrb-vector: Public classes
functional-sequence: Public classes
functional-sparse-rrb-vector: Public classes
functional-sparse-vector: Public classes
functional-take-out-back-function: Public classes
functional-take-out-front-function: Public classes
functional-take-out-function: Public classes
functional-update-function: Public classes
functional-update-if-function: Public classes
functions.lisp: The cl-data-structures/api/functions․lisp file
fundamental-assiganable-range: Private classes
fundamental-assignable-bidirectional-range: Private classes
fundamental-assignable-forward-range: Public classes
fundamental-assignable-random-access-range: Private classes
fundamental-bidirectional-range: Public classes
fundamental-classes.lisp: The cl-data-structures/api/fundamental-classes․lisp file
fundamental-container: Public classes
fundamental-data-sketch: Public classes
fundamental-dictionary: Public classes
fundamental-egnat-container: Public classes
fundamental-file-range-stack-cell: Private classes
fundamental-forward-range: Public classes
fundamental-functional-queue: Public classes
fundamental-hashing-dictionary: Public classes
fundamental-minhash: Private classes
fundamental-modification-operation-status: Public classes
fundamental-mutable-queue: Public classes
fundamental-ownership-tagged-object: Public classes
fundamental-qp-trie-set: Public classes
fundamental-queue: Public classes
fundamental-random-access-range: Public classes
fundamental-range: Public classes
fundamental-sequence: Public classes
fundamental-set: Public classes
fundamental-skip-list: Public classes
fundamental-skip-list-range: Public classes
fundamental-sparse-rrb-vector: Private classes
fundamental-sparse-vector: Public classes
fundamental-transactional-queue: Public classes
future-carousel: Public classes

G
gather-corpus-function: Private classes
generics.lisp: The cl-data-structures/api/generics․lisp file
generics.lisp: The cl-data-structures/common/egnat/generics․lisp file
generics.lisp: The cl-data-structures/algorithms/meta/generics․lisp file
geometric-average-function: Private classes
gini-impurity-function: Private classes
gini-impurity.lisp: The cl-data-structures/math/gini-impurity․lisp file
group-by-function: Public classes
group-by-proxy: Private classes
group-by-result-range: Public classes
group-by.lisp: The cl-data-structures/algorithms/group-by․lisp file
grow-function: Public classes

H
half-byte: Private types
half-matrix: Public classes
hamt: The cl-data-structures/common/hamt module
hamt: The cl-data-structures/dicts/hamt module
hamt-container: Public classes
hamt-dictionary: Public classes
hamt-range-stack-cell: Private structures
harmonic-average-function: Private classes
harmonic-average-mutual-information-function: Private classes
hash: Public types
hash-array: Public types
hash-content: Private structures
hash-dict-content: Private structures
hash-mask: Private types
hash-node: Private types
hash-node-index: Private types
hash-node-size: Public types
hash-node-tagged: Private structures
hash-node-untagged: Private structures
hash-table-elementwise-forward-proxy: Private classes
hash-table-elementwise-function: Private classes
hash-table-elementwise.lisp: The cl-data-structures/algorithms/hash-table-elementwise․lisp file
hash-table-range: Public classes
hash-table.lisp: The cl-data-structures/adapters/hash-table․lisp file
hashing.lisp: The cl-data-structures/utils/hashing․lisp file
higher-order.lisp: The cl-data-structures/utils/higher-order․lisp file
hmm.lisp: The cl-data-structures/math/hmm․lisp file
hodges-lehmann-estimator-function: Private classes
hodges-lehmann.lisp: The cl-data-structures/math/hodges-lehmann․lisp file
hyperloglog.lisp: The cl-data-structures/streaming-algorithms/hyperloglog․lisp file

I
implementation-modification-operation-status: Private classes
implementation.lisp: The cl-data-structures/composite/implementation․lisp file
in-batches-function: Private classes
in-batches.lisp: The cl-data-structures/algorithms/in-batches․lisp file
incompatible-arguments: Public conditions
index: Public types
index-path: Private types
info-field: Private classes
initialization-error: Public conditions
initialization-out-of-bounds: Public conditions
insert!-function: Public classes
insert-function: Public classes
internal.lisp: The cl-data-structures/dicts/hamt/internal․lisp file
internal.lisp: The cl-data-structures/dicts/srrb/internal․lisp file
invalid-argument: Public conditions
invalid-argument-value: Public conditions
invalid-value: Public conditions

K
key-value-range: Public classes

L
lambda-lists.lisp: The cl-data-structures/utils/lambda-lists․lisp file
last-element-function: Private classes
latch-function: Private classes
latch-proxy: Private classes
latch.lisp: The cl-data-structures/algorithms/latch․lisp file
layer-function: Public classes
lazy: Public classes
lazy-bidirectional-range: Public classes
lazy-box-container: Public classes
lazy-box-dictionary: Private classes
lazy-box-sequence: Private classes
lazy-box.lisp: The cl-data-structures/common/lazy-box․lisp file
lazy-dictionary: Public classes
lazy-forward-range: Private classes
lazy-hashing-dictionary: Public classes
lazy-modification-operation-status: Private classes
lazy-random-access-range: Public classes
lazy-range: Private classes
lazy-range.lisp: The cl-data-structures/common/lazy-range․lisp file
lazy-shuffle.lisp: The cl-data-structures/utils/lazy-shuffle․lisp file
line-by-line-range: Private classes
line-by-line.lisp: The cl-data-structures/file-system/line-by-line․lisp file
linear-regression-fit: Private classes
list-range: Public classes
list-sequence-window: Private classes
list.lisp: The cl-data-structures/adapters/list․lisp file
lists.lisp: The cl-data-structures/utils/lists․lisp file

M
macros.lisp: The cl-data-structures/utils/macros․lisp file
macros.lisp: The cl-data-structures/api/macros․lisp file
macros.lisp: The cl-data-structures/algorithms/meta/macros․lisp file
math: The cl-data-structures/math module
median-absolute-deviation-function: Private classes
median-absolute-deviation.lisp: The cl-data-structures/math/median-absolute-deviation․lisp file
meta: The cl-data-structures/algorithms/meta module
meta-docstrings.lisp: The cl-data-structures/api/meta-docstrings․lisp file
meta.lisp: The cl-data-structures/api/meta․lisp file
meta.lisp: The cl-data-structures/common/meta․lisp file
methods.lisp: The cl-data-structures/common/egnat/methods․lisp file
methods.lisp: The cl-data-structures/algorithms/meta/methods․lisp file
metric-space: The cl-data-structures/metric-space module
metric-space-dictionary: Public classes
metric-space-set: Public classes
minhash-corpus: Private classes
minhash.lisp: The cl-data-structures/streaming-algorithms/minhash․lisp file
modification-algorithms.lisp: The cl-data-structures/utils/modification-algorithms․lisp file
modification-operation-status.lisp: The cl-data-structures/common/modification-operation-status․lisp file
Module, 2-3-tree: The cl-data-structures/common/2-3-tree module
Module, 2-3-tree: The cl-data-structures/queues/2-3-tree module
Module, abstract: The cl-data-structures/common/abstract module
Module, adapters: The cl-data-structures/adapters module
Module, algorithms: The cl-data-structures/algorithms module
Module, api: The cl-data-structures/api module
Module, common: The cl-data-structures/common module
Module, composite: The cl-data-structures/composite module
Module, dicts: The cl-data-structures/dicts module
Module, egnat: The cl-data-structures/common/egnat module
Module, egnat: The cl-data-structures/metric-space/egnat module
Module, file-system: The cl-data-structures/file-system module
Module, hamt: The cl-data-structures/common/hamt module
Module, hamt: The cl-data-structures/dicts/hamt module
Module, math: The cl-data-structures/math module
Module, meta: The cl-data-structures/algorithms/meta module
Module, metric-space: The cl-data-structures/metric-space module
Module, qp-trie: The cl-data-structures/sets/qp-trie module
Module, queues: The cl-data-structures/queues module
Module, rrb: The cl-data-structures/common/rrb module
Module, rrb: The cl-data-structures/sequences/rrb module
Module, sequences: The cl-data-structures/sequences module
Module, sets: The cl-data-structures/sets module
Module, skip-list: The cl-data-structures/common/skip-list module
Module, skip-list: The cl-data-structures/dicts/skip-list module
Module, skip-list: The cl-data-structures/sets/skip-list module
Module, srrb: The cl-data-structures/dicts/srrb module
Module, streaming-algorithms: The cl-data-structures/streaming-algorithms module
Module, threads: The cl-data-structures/threads module
Module, utils: The cl-data-structures/utils module
moments-function: Private classes
moments.lisp: The cl-data-structures/math/moments․lisp file
moving-average-function: Private classes
moving-average-range: Private classes
moving-average.lisp: The cl-data-structures/math/moving-average․lisp file
multiplex-function: Private classes
multiplex-proxy: Private classes
multiplex.lisp: The cl-data-structures/algorithms/multiplex․lisp file
mutable: Public classes
mutable-2-3-queue: Public classes
mutable-composite-container: Private classes
mutable-dictionary: Public classes
mutable-egnat-container: Public classes
mutable-egnat-metric-set: Public classes
mutable-hamt-dictionary: Public classes
mutable-hashing-dictionary: Public classes
mutable-metric-space-dictionary: Public classes
mutable-metric-space-set: Public classes
mutable-qp-trie-set: Public classes
mutable-rrb-range: Private classes
mutable-rrb-vector: Public classes
mutable-sequence: Public classes
mutable-set: Public classes
mutable-skip-list-dictionary: Public classes
mutable-skip-list-dictionary-range: Private classes
mutable-skip-list-set: Public classes
mutable-skip-list-set-range: Private classes
mutable-sparse-rrb-vector: Public classes
mutable-sparse-vector: Public classes
mutual-information-function: Private classes
mutual-information-matrix-function: Private classes
mutual-information.lisp: The cl-data-structures/math/mutual-information․lisp file

N
node: Public classes
node-content: Public types
node-index: Private types
node-mask: Private types
node-path: Private types
node-size: Public types
not-implemented: Public conditions
not-in-allowed-set: Public conditions
numbers.lisp: The cl-data-structures/utils/numbers․lisp file

O
offset-vector-range: Public classes
on-each-function: Private classes
on-each.lisp: The cl-data-structures/algorithms/on-each․lisp file
one-bit-minhash: Private classes
only-different-function: Private classes
only-different-proxy: Private classes
only-different.lisp: The cl-data-structures/algorithms/only-different․lisp file
only-function: Private classes
only-proxy: Private classes
only.lisp: The cl-data-structures/algorithms/only․lisp file
operation-not-allowed: Public conditions
optimal-split-point-function: Private classes
ordered-algorithms.lisp: The cl-data-structures/utils/ordered-algorithms․lisp file
out-of-bounds: Public conditions

P
Package, cl-data-structures: The cl-data-structures package
Package, cl-data-structures.adapters: The cl-data-structures․adapters package
Package, cl-data-structures.algorithms: The cl-data-structures․algorithms package
Package, cl-data-structures.algorithms.meta: The cl-data-structures․algorithms․meta package
Package, cl-data-structures.aux-package: The cl-data-structures․aux-package package
Package, cl-data-structures.common: The cl-data-structures․common package
Package, cl-data-structures.common.2-3-tree: The cl-data-structures․common․2-3-tree package
Package, cl-data-structures.common.abstract: The cl-data-structures․common․abstract package
Package, cl-data-structures.common.egnat: The cl-data-structures․common․egnat package
Package, cl-data-structures.common.hamt: The cl-data-structures․common․hamt package
Package, cl-data-structures.common.qp-trie: The cl-data-structures․common․qp-trie package
Package, cl-data-structures.common.rrb: The cl-data-structures․common․rrb package
Package, cl-data-structures.common.skip-list: The cl-data-structures․common․skip-list package
Package, cl-data-structures.composite: The cl-data-structures․composite package
Package, cl-data-structures.dicts: The cl-data-structures․dicts package
Package, cl-data-structures.dicts.hamt: The cl-data-structures․dicts․hamt package
Package, cl-data-structures.dicts.skip-list: The cl-data-structures․dicts․skip-list package
Package, cl-data-structures.dicts.srrb: The cl-data-structures․dicts․srrb package
Package, cl-data-structures.fancy: The cl-data-structures․fancy package
Package, cl-data-structures.file-system: The cl-data-structures․file-system package
Package, cl-data-structures.math: The cl-data-structures․math package
Package, cl-data-structures.meta: The cl-data-structures․meta package
Package, cl-data-structures.metric-space: The cl-data-structures․metric-space package
Package, cl-data-structures.metric-space.egnat: The cl-data-structures․metric-space․egnat package
Package, cl-data-structures.queues: The cl-data-structures․queues package
Package, cl-data-structures.queues.2-3-tree: The cl-data-structures․queues․2-3-tree package
Package, cl-data-structures.sequences: The cl-data-structures․sequences package
Package, cl-data-structures.sequences.rrb-vector: The cl-data-structures․sequences․rrb-vector package
Package, cl-data-structures.sets: The cl-data-structures․sets package
Package, cl-data-structures.sets.qp-trie: The cl-data-structures․sets․qp-trie package
Package, cl-data-structures.sets.skip-list: The cl-data-structures․sets․skip-list package
Package, cl-data-structures.streaming-algorithms: The cl-data-structures․streaming-algorithms package
Package, cl-data-structures.streaming-algorithms.hyperloglog: The cl-data-structures․streaming-algorithms․hyperloglog package
Package, cl-data-structures.streaming-algorithms.polynomial-hashing: The cl-data-structures․streaming-algorithms․polynomial-hashing package
Package, cl-data-structures.threads: The cl-data-structures․threads package
Package, cl-data-structures.utils: The cl-data-structures․utils package
package.lisp: The cl-data-structures/package․lisp file
package.lisp: The cl-data-structures/utils/package․lisp file
package.lisp: The cl-data-structures/adapters/package․lisp file
package.lisp: The cl-data-structures/common/package․lisp file
package.lisp: The cl-data-structures/common/abstract/package․lisp file
package.lisp: The cl-data-structures/common/2-3-tree/package․lisp file
package.lisp: The cl-data-structures/common/hamt/package․lisp file
package.lisp: The cl-data-structures/common/rrb/package․lisp file
package.lisp: The cl-data-structures/common/skip-list/package․lisp file
package.lisp: The cl-data-structures/common/egnat/package․lisp file
package.lisp: The cl-data-structures/composite/package․lisp file
package.lisp: The cl-data-structures/algorithms/package․lisp file
package.lisp: The cl-data-structures/file-system/package․lisp file
package.lisp: The cl-data-structures/threads/package․lisp file
package.lisp: The cl-data-structures/math/package․lisp file
package.lisp: The cl-data-structures/streaming-algorithms/package․lisp file
packages.lisp: The cl-data-structures/dicts/packages․lisp file
packages.lisp: The cl-data-structures/sequences/packages․lisp file
packages.lisp: The cl-data-structures/queues/packages․lisp file
packages.lisp: The cl-data-structures/sets/packages․lisp file
packages.lisp: The cl-data-structures/metric-space/packages․lisp file
parallel-forward-multiplex-proxy: Private classes
parallel-group-by-function: Private classes
parallel-group-by-proxy: Private classes
parallel-group-by.lisp: The cl-data-structures/threads/parallel-group-by․lisp file
parallel-multiplex-function: Private classes
parallel-multiplex.lisp: The cl-data-structures/threads/parallel-multiplex․lisp file
parallel-on-each-function: Private classes
parallel-on-each-proxy: Private classes
parallel-on-each.lisp: The cl-data-structures/threads/parallel-on-each․lisp file
parallel-tools.lisp: The cl-data-structures/utils/parallel-tools․lisp file
partition-if-function: Private classes
partition-if-proxy: Private classes
partition-if.lisp: The cl-data-structures/algorithms/partition-if․lisp file
pipe-fragment: Public classes
polynomial-callback-minhash: Private classes
polynomial-callback-one-bit-minhash: Private classes
polynomial-hashing.lisp: The cl-data-structures/streaming-algorithms/polynomial-hashing․lisp file
proxy-box-range: Public classes
proxy-range: Public classes
put!-function: Public classes
put-back!-function: Public classes
put-back-function: Private classes
put-front!-function: Public classes
put-front-function: Private classes
put-function: Public classes

Q
qp-trie: The cl-data-structures/sets/qp-trie module
qp-trie: Public classes
qp-trie-node: Public types
qp-trie-node-tagged: Private structures
qp-trie-node-untagged: Private structures
qp-trie-range-stack-cell: Private classes
qp-trie-set-range: Private classes
qp-trie.lisp: The cl-data-structures/common/qp-trie․lisp file
queue-buffer: Private types
queues: The cl-data-structures/queues module

R
random-access-bootstrap-proxy: Private classes
random-access-buffer-range: Private classes
random-access-chain-of-ranges: Public classes
random-access-connecting-range: Private classes
random-access-establish-special-proxy-range: Private classes
random-access-group-by-proxy: Private classes
random-access-in-batches-proxy: Private classes
random-access-parallel-group-by-proxy: Private classes
random-access-proxy-box-range: Private classes
random-access-proxy-range: Public classes
random-access-sequence-window: Private classes
random-access-with-previous-element-proxy: Private classes
random-access-zipped-ranges: Private classes
range-function: Public classes
ranges.lisp: The cl-data-structures/common/ranges․lisp file
rate-function: Private classes
rate.lisp: The cl-data-structures/algorithms/rate․lisp file
recursive-content-file-range-stack-cell: Private classes
regex-directory-file-range-stack-cell: Private classes
regex-file-file-range-stack-cell: Private classes
register: Public types
repeat-function: Private classes
repeat-proxy: Private classes
repeat.lisp: The cl-data-structures/algorithms/repeat․lisp file
reservoir-sample-function: Private classes
reservoir-sample.lisp: The cl-data-structures/algorithms/reservoir-sample․lisp file
reservoir-sampling: Private structures
restrain-size-function: Private classes
restrain-size-proxy: Private classes
restrain-size.lisp: The cl-data-structures/algorithms/restrain-size․lisp file
rrb: The cl-data-structures/common/rrb module
rrb: The cl-data-structures/sequences/rrb module
rrb-container: Public classes
rrb-index: Public types
rrb-indexes: Private types
rrb-node: Public types
rrb-node-position: Public types
rrb-path: Private types
rrb-range: Public classes
rrb-vector: Private classes

S
seeds-callback-minhash: Private classes
seeds-callback-one-bit-minhash: Private classes
sequence-window: Public classes
sequence-window.lisp: The cl-data-structures/common/sequence-window․lisp file
sequences: The cl-data-structures/sequences module
sets: The cl-data-structures/sets module
shift: Public types
shift: Private types
shrink-function: Public classes
shuffled-range: Public classes
shuffled-range.lisp: The cl-data-structures/algorithms/shuffled-range․lisp file
simple-linear-regression-function: Private classes
simple-linear-regression.lisp: The cl-data-structures/math/simple-linear-regression․lisp file
sketch: Public types
skip-list: The cl-data-structures/common/skip-list module
skip-list: The cl-data-structures/dicts/skip-list module
skip-list: The cl-data-structures/sets/skip-list module
skip-list-node: Public structures
sliding-window-function: Private classes
sliding-window.lisp: The cl-data-structures/algorithms/sliding-window․lisp file
sparse-rrb-mask: Public types
sparse-rrb-node: Public types
sparse-rrb-node-tagged: Public structures
sparse-rrb-node-untagged: Public structures
split-point-field: Private classes
srrb: The cl-data-structures/dicts/srrb module
srrb-range-stack-cell: Private structures
standard-deviation-function: Private classes
standard-deviation.lisp: The cl-data-structures/math/standard-deviation․lisp file
stateful-file-range-stack-cell: Private classes
stream-designator: Private types
streaming-algorithms: The cl-data-structures/streaming-algorithms module
Structure, aggregator: Public structures
Structure, approximated-histogram-bin: Private structures
Structure, assoc-skip-list-node: Private structures
Structure, changes: Private structures
Structure, dict-content: Public structures
Structure, hamt-range-stack-cell: Private structures
Structure, hash-content: Private structures
Structure, hash-dict-content: Private structures
Structure, hash-node-tagged: Private structures
Structure, hash-node-untagged: Private structures
Structure, qp-trie-node-tagged: Private structures
Structure, qp-trie-node-untagged: Private structures
Structure, reservoir-sampling: Private structures
Structure, skip-list-node: Public structures
Structure, sparse-rrb-node-tagged: Public structures
Structure, sparse-rrb-node-untagged: Public structures
Structure, srrb-range-stack-cell: Private structures
Structure, tagged-struct-node: Public structures
sum-function: Private classes
sum.lisp: The cl-data-structures/math/sum․lisp file
summary-aggregation-function: Private classes
summary-result-range: Public classes
summary.lisp: The cl-data-structures/algorithms/summary․lisp file
synchronization-mixin: Private classes
synchronization-primitives-mixin: Private classes
synchronized-mutable-2-3-queue: Public classes
synchronized-transactional-2-3-queue: Public classes
System, cl-data-structures: The cl-data-structures system

T
tagged-2-node: Private classes
tagged-3-node: Private classes
tagged-node: Public classes
tagged-struct-node: Public structures
tagged-tree: Private classes
take-out!-function: Public classes
take-out-back!-function: Public classes
take-out-back-function: Private classes
take-out-front!-function: Public classes
take-out-front-function: Private classes
take-out-function: Public classes
textual-error: Public conditions
thread-buffer-function: Private classes
threads: The cl-data-structures/threads module
to-hash-table-function: Private classes
to-hash-table.lisp: The cl-data-structures/algorithms/to-hash-table․lisp file
to-list-function: Private classes
to-list.lisp: The cl-data-structures/algorithms/to-list․lisp file
to-vector-function: Private classes
to-vector.lisp: The cl-data-structures/algorithms/to-vector․lisp file
tokenize.lisp: The cl-data-structures/file-system/tokenize․lisp file
tokenizing-range: Private classes
too-many-dimensions: Public conditions
trait-classes.lisp: The cl-data-structures/api/trait-classes․lisp file
trait-classes.lisp: The cl-data-structures/dicts/trait-classes․lisp file
trait-classes.lisp: The cl-data-structures/metric-space/trait-classes․lisp file
transactional: Public classes
transactional-2-3-queue: Public classes
transactional-dictionary: Public classes
transactional-hamt-dictionary: Public classes
transactional-hashing-dictionary: Public classes
transactional-rrb-vector: Public classes
transactional-sequence: Public classes
transactional-sparse-rrb-vector: Public classes
transactional-sparse-vector: Public classes
transformation!-function: Public classes
translation-function: Private classes
translation.lisp: The cl-data-structures/algorithms/translation․lisp file
transparent-to-chunking-mixin: Public classes
traversable: Public classes
tree: Public classes
trees.lisp: The cl-data-structures/utils/trees․lisp file
trivial.lisp: The cl-data-structures/utils/trivial․lisp file
Type, buffer-index: Private types
Type, extendable-vector: Public types
Type, full-mask: Private types
Type, half-byte: Private types
Type, hash: Public types
Type, hash-array: Public types
Type, hash-mask: Private types
Type, hash-node: Private types
Type, hash-node-index: Private types
Type, hash-node-size: Public types
Type, index: Public types
Type, index-path: Private types
Type, node-content: Public types
Type, node-index: Private types
Type, node-mask: Private types
Type, node-path: Private types
Type, node-size: Public types
Type, qp-trie-node: Public types
Type, queue-buffer: Private types
Type, register: Public types
Type, rrb-index: Public types
Type, rrb-indexes: Private types
Type, rrb-node: Public types
Type, rrb-node-position: Public types
Type, rrb-path: Private types
Type, shift: Public types
Type, shift: Private types
Type, sketch: Public types
Type, sparse-rrb-mask: Public types
Type, sparse-rrb-node: Public types
Type, stream-designator: Private types
types.lisp: The cl-data-structures/utils/types․lisp file
types.lisp: The cl-data-structures/dicts/srrb/types․lisp file

U
unexpected-argument: Public conditions
unix.lisp: The cl-data-structures/file-system/unix․lisp file
update!-function: Public classes
update-function: Public classes
update-if!-function: Public classes
update-if-function: Public classes
utils: The cl-data-structures/utils module

V
variance-function: Private classes
variance.lisp: The cl-data-structures/math/variance․lisp file
vector-range: Public classes
vector-sequence-window: Private classes
vector.lisp: The cl-data-structures/adapters/vector․lisp file

W
with-previous-element-function: Private classes
with-previous-element-proxy: Private classes
with-previous-element.lisp: The cl-data-structures/algorithms/with-previous-element․lisp file
without-function: Private classes
without-proxy: Private classes
without.lisp: The cl-data-structures/algorithms/without․lisp file

X
xors-callback-minhash: Private classes
xors-callback-one-bit-minhash: Private classes

Z
zip.lisp: The cl-data-structures/algorithms/zip․lisp file
zipping-mixin: Private classes