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.
cl-data-structures/utilscl-data-structures/apicl-data-structures/adapterscl-data-structures/commoncl-data-structures/common/abstractcl-data-structures/common/2-3-treecl-data-structures/common/hamtcl-data-structures/common/rrbcl-data-structures/common/skip-listcl-data-structures/common/egnatcl-data-structures/dictscl-data-structures/dicts/skip-listcl-data-structures/dicts/hamtcl-data-structures/dicts/srrbcl-data-structures/sequencescl-data-structures/sequences/rrbcl-data-structures/queuescl-data-structures/queues/2-3-treecl-data-structures/setscl-data-structures/sets/qp-triecl-data-structures/sets/skip-listcl-data-structures/metric-spacecl-data-structures/metric-space/egnatcl-data-structures/compositecl-data-structures/algorithmscl-data-structures/algorithms/metacl-data-structures/file-systemcl-data-structures/threadscl-data-structures/mathcl-data-structures/streaming-algorithmscl-data-structures/cl-data-structures.asdcl-data-structures/aux-package.lispcl-data-structures/package.lispcl-data-structures/utils/package.lispcl-data-structures/utils/macros.lispcl-data-structures/utils/types.lispcl-data-structures/utils/higher-order.lispcl-data-structures/utils/cartesian.lispcl-data-structures/utils/ordered-algorithms.lispcl-data-structures/utils/lists.lispcl-data-structures/utils/trivial.lispcl-data-structures/utils/modification-algorithms.lispcl-data-structures/utils/distances.lispcl-data-structures/utils/lazy-shuffle.lispcl-data-structures/utils/arrays.lispcl-data-structures/utils/trees.lispcl-data-structures/utils/bind.lispcl-data-structures/utils/parallel-tools.lispcl-data-structures/utils/lambda-lists.lispcl-data-structures/utils/embedding.lispcl-data-structures/utils/cloning.lispcl-data-structures/utils/numbers.lispcl-data-structures/utils/bucket-sort.lispcl-data-structures/utils/hashing.lispcl-data-structures/utils/docstrings.lispcl-data-structures/api/meta.lispcl-data-structures/api/meta-docstrings.lispcl-data-structures/api/fundamental-classes.lispcl-data-structures/api/trait-classes.lispcl-data-structures/api/generics.lispcl-data-structures/api/conditions.lispcl-data-structures/api/expression-wrapper.lispcl-data-structures/api/delay.lispcl-data-structures/api/macros.lispcl-data-structures/api/functions.lispcl-data-structures/api/field.lispcl-data-structures/api/auxilary.lispcl-data-structures/api/docstrings.lispcl-data-structures/adapters/package.lispcl-data-structures/adapters/hash-table.lispcl-data-structures/adapters/vector.lispcl-data-structures/adapters/list.lispcl-data-structures/common/package.lispcl-data-structures/common/modification-operation-status.lispcl-data-structures/common/eager-modification-operation-status.lispcl-data-structures/common/lazy-box.lispcl-data-structures/common/lazy-range.lispcl-data-structures/common/content-tuple.lispcl-data-structures/common/ranges.lispcl-data-structures/common/sequence-window.lispcl-data-structures/common/docstrings.lispcl-data-structures/common/abstract/package.lispcl-data-structures/common/abstract/common.lispcl-data-structures/common/2-3-tree/package.lispcl-data-structures/common/2-3-tree/common.lispcl-data-structures/common/hamt/package.lispcl-data-structures/common/hamt/common.lispcl-data-structures/common/rrb/package.lispcl-data-structures/common/rrb/common.lispcl-data-structures/common/skip-list/package.lispcl-data-structures/common/skip-list/common.lispcl-data-structures/common/egnat/package.lispcl-data-structures/common/egnat/classes.lispcl-data-structures/common/egnat/generics.lispcl-data-structures/common/egnat/common.lispcl-data-structures/common/egnat/methods.lispcl-data-structures/common/egnat/docstrings.lispcl-data-structures/common/qp-trie.lispcl-data-structures/common/meta.lispcl-data-structures/dicts/packages.lispcl-data-structures/dicts/trait-classes.lispcl-data-structures/dicts/common.lispcl-data-structures/dicts/api.lispcl-data-structures/dicts/docstrings.lispcl-data-structures/dicts/skip-list/api.lispcl-data-structures/dicts/hamt/internal.lispcl-data-structures/dicts/hamt/api.lispcl-data-structures/dicts/hamt/docstrings.lispcl-data-structures/dicts/srrb/types.lispcl-data-structures/dicts/srrb/internal.lispcl-data-structures/dicts/srrb/api.lispcl-data-structures/dicts/srrb/docstrings.lispcl-data-structures/sequences/packages.lispcl-data-structures/sequences/common.lispcl-data-structures/sequences/rrb/api.lispcl-data-structures/sequences/rrb/docstrings.lispcl-data-structures/queues/packages.lispcl-data-structures/queues/common.lispcl-data-structures/queues/docstrings.lispcl-data-structures/queues/2-3-tree/api.lispcl-data-structures/queues/2-3-tree/docstrings.lispcl-data-structures/sets/packages.lispcl-data-structures/sets/common.lispcl-data-structures/sets/docstrings.lispcl-data-structures/sets/qp-trie/api.lispcl-data-structures/sets/qp-trie/docstrings.lispcl-data-structures/sets/skip-list/api.lispcl-data-structures/sets/skip-list/docstrings.lispcl-data-structures/metric-space/packages.lispcl-data-structures/metric-space/trait-classes.lispcl-data-structures/metric-space/common.lispcl-data-structures/metric-space/api.lispcl-data-structures/metric-space/docstrings.lispcl-data-structures/metric-space/egnat/api.lispcl-data-structures/composite/package.lispcl-data-structures/composite/implementation.lispcl-data-structures/algorithms/package.lispcl-data-structures/algorithms/meta/macros.lispcl-data-structures/algorithms/meta/classes.lispcl-data-structures/algorithms/meta/generics.lispcl-data-structures/algorithms/meta/methods.lispcl-data-structures/algorithms/meta/docstrings.lispcl-data-structures/algorithms/common.lispcl-data-structures/algorithms/array-elementwise.lispcl-data-structures/algorithms/hash-table-elementwise.lispcl-data-structures/algorithms/on-each.lispcl-data-structures/algorithms/translation.lispcl-data-structures/algorithms/count.lispcl-data-structures/algorithms/to-vector.lispcl-data-structures/algorithms/to-list.lispcl-data-structures/algorithms/rate.lispcl-data-structures/algorithms/to-hash-table.lispcl-data-structures/algorithms/enumerate.lispcl-data-structures/algorithms/shuffled-range.lispcl-data-structures/algorithms/filtering.lispcl-data-structures/algorithms/common-range-category.lispcl-data-structures/algorithms/summary.lispcl-data-structures/algorithms/accumulate.lispcl-data-structures/algorithms/group-by.lispcl-data-structures/algorithms/without.lispcl-data-structures/algorithms/multiplex.lispcl-data-structures/algorithms/only.lispcl-data-structures/algorithms/only-different.lispcl-data-structures/algorithms/cartesian.lispcl-data-structures/algorithms/restrain-size.lispcl-data-structures/algorithms/reservoir-sample.lispcl-data-structures/algorithms/repeat.lispcl-data-structures/algorithms/latch.lispcl-data-structures/algorithms/establish-special.lispcl-data-structures/algorithms/extrema.lispcl-data-structures/algorithms/extremum.lispcl-data-structures/algorithms/cumulative-accumulate.lispcl-data-structures/algorithms/chain.lispcl-data-structures/algorithms/frequency.lispcl-data-structures/algorithms/zip.lispcl-data-structures/algorithms/flatten-lists.lispcl-data-structures/algorithms/partition-if.lispcl-data-structures/algorithms/distinct.lispcl-data-structures/algorithms/first-element.lispcl-data-structures/algorithms/in-batches.lispcl-data-structures/algorithms/sliding-window.lispcl-data-structures/algorithms/with-previous-element.lispcl-data-structures/algorithms/docstrings.lispcl-data-structures/file-system/package.lispcl-data-structures/file-system/common.lispcl-data-structures/file-system/line-by-line.lispcl-data-structures/file-system/tokenize.lispcl-data-structures/file-system/find.lispcl-data-structures/file-system/unix.lispcl-data-structures/file-system/docstrings.lispcl-data-structures/threads/package.lispcl-data-structures/threads/parallel-multiplex.lispcl-data-structures/threads/parallel-group-by.lispcl-data-structures/threads/parallel-on-each.lispcl-data-structures/threads/buffer-range.lispcl-data-structures/threads/docstrings.lispcl-data-structures/math/package.lispcl-data-structures/math/absolute-value-norm.lispcl-data-structures/math/average.lispcl-data-structures/math/variance.lispcl-data-structures/math/mutual-information.lispcl-data-structures/math/simple-linear-regression.lispcl-data-structures/math/median-absolute-deviation.lispcl-data-structures/math/hodges-lehmann.lispcl-data-structures/math/co-occurence-table.lispcl-data-structures/math/standard-deviation.lispcl-data-structures/math/moments.lispcl-data-structures/math/bootstrap.lispcl-data-structures/math/moving-average.lispcl-data-structures/math/hmm.lispcl-data-structures/math/gini-impurity.lispcl-data-structures/math/entropy.lispcl-data-structures/math/fast-map.lispcl-data-structures/math/sum.lispcl-data-structures/math/docstrings.lispcl-data-structures/streaming-algorithms/hyperloglog.lispcl-data-structures/streaming-algorithms/polynomial-hashing.lispcl-data-structures/streaming-algorithms/package.lispcl-data-structures/streaming-algorithms/common.lispcl-data-structures/streaming-algorithms/approximated-histogram.lispcl-data-structures/streaming-algorithms/approximated-set-cardinality.lispcl-data-structures/streaming-algorithms/approximated-counts.lispcl-data-structures/streaming-algorithms/approximated-top-k.lispcl-data-structures/streaming-algorithms/bloom-filter.lispcl-data-structures/streaming-algorithms/minhash.lispcl-data-structures/streaming-algorithms/docstrings.lispcl-data-structures.common.2-3-treecl-data-structures.queues.2-3-treecl-data-structures.streaming-algorithmscl-data-structures.fancycl-data-structures.metacl-data-structures.dictscl-data-structures.sets.qp-triecl-data-structures.metric-spacecl-data-structures.dicts.skip-listcl-data-structures.mathcl-data-structures.common.hamtcl-data-structures.common.rrbcl-data-structures.commoncl-data-structures.common.egnatcl-data-structures.setscl-data-structures.utilscl-data-structures.file-systemcl-data-structures.metric-space.egnatcl-data-structures.dicts.srrbcl-data-structures.adapterscl-data-structures.common.qp-triecl-data-structures.common.abstractcl-data-structurescl-data-structures.common.skip-listcl-data-structures.compositecl-data-structures.threadscl-data-structures.dicts.hamtcl-data-structures.algorithms.metacl-data-structures.sequencescl-data-structures.queuescl-data-structures.aux-packagecl-data-structures.algorithmscl-data-structures.sets.skip-listcl-data-structures.streaming-algorithms.polynomial-hashingcl-data-structures.sequences.rrb-vectorcl-data-structures.streaming-algorithms.hyperloglogThe main system appears first, followed by any subsystem dependency.
cl-data-structuresData structures, ranges, ranges algorithms.
Marek Kochanowicz
Marek Kochanowicz
BSD simplified
1.3.0
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).
aux-package.lisp (file).
package.lisp (file).
utils (module).
api (module).
adapters (module).
common (module).
dicts (module).
sequences (module).
queues (module).
sets (module).
metric-space (module).
composite (module).
algorithms (module).
file-system (module).
threads (module).
math (module).
streaming-algorithms (module).
Modules are listed depth-first from the system components tree.
cl-data-structures/utilscl-data-structures/apicl-data-structures/adapterscl-data-structures/commoncl-data-structures/common/abstractcl-data-structures/common/2-3-treecl-data-structures/common/hamtcl-data-structures/common/rrbcl-data-structures/common/skip-listcl-data-structures/common/egnatcl-data-structures/dictscl-data-structures/dicts/skip-listcl-data-structures/dicts/hamtcl-data-structures/dicts/srrbcl-data-structures/sequencescl-data-structures/sequences/rrbcl-data-structures/queuescl-data-structures/queues/2-3-treecl-data-structures/setscl-data-structures/sets/qp-triecl-data-structures/sets/skip-listcl-data-structures/metric-spacecl-data-structures/metric-space/egnatcl-data-structures/compositecl-data-structures/algorithmscl-data-structures/algorithms/metacl-data-structures/file-systemcl-data-structures/threadscl-data-structures/mathcl-data-structures/streaming-algorithmscl-data-structures/utilspackage.lisp (file).
cl-data-structures (system).
package.lisp (file).
macros.lisp (file).
types.lisp (file).
higher-order.lisp (file).
cartesian.lisp (file).
ordered-algorithms.lisp (file).
lists.lisp (file).
trivial.lisp (file).
modification-algorithms.lisp (file).
distances.lisp (file).
lazy-shuffle.lisp (file).
arrays.lisp (file).
trees.lisp (file).
bind.lisp (file).
parallel-tools.lisp (file).
lambda-lists.lisp (file).
embedding.lisp (file).
cloning.lisp (file).
numbers.lisp (file).
bucket-sort.lisp (file).
hashing.lisp (file).
docstrings.lisp (file).
cl-data-structures/apiutils (module).
cl-data-structures (system).
meta.lisp (file).
meta-docstrings.lisp (file).
fundamental-classes.lisp (file).
trait-classes.lisp (file).
generics.lisp (file).
conditions.lisp (file).
expression-wrapper.lisp (file).
delay.lisp (file).
macros.lisp (file).
functions.lisp (file).
field.lisp (file).
auxilary.lisp (file).
docstrings.lisp (file).
cl-data-structures/adaptersapi (module).
cl-data-structures (system).
package.lisp (file).
hash-table.lisp (file).
vector.lisp (file).
list.lisp (file).
cl-data-structures/commonadapters (module).
cl-data-structures (system).
package.lisp (file).
modification-operation-status.lisp (file).
eager-modification-operation-status.lisp (file).
lazy-box.lisp (file).
lazy-range.lisp (file).
content-tuple.lisp (file).
ranges.lisp (file).
sequence-window.lisp (file).
docstrings.lisp (file).
abstract (module).
2-3-tree (module).
hamt (module).
rrb (module).
skip-list (module).
egnat (module).
qp-trie.lisp (file).
meta.lisp (file).
cl-data-structures/common/abstractcommon (module).
package.lisp (file).
common.lisp (file).
cl-data-structures/common/2-3-treecommon (module).
package.lisp (file).
common.lisp (file).
cl-data-structures/common/hamtcommon (module).
package.lisp (file).
common.lisp (file).
cl-data-structures/common/rrbcommon (module).
package.lisp (file).
common.lisp (file).
cl-data-structures/common/skip-listcommon (module).
package.lisp (file).
common.lisp (file).
cl-data-structures/common/egnatcommon (module).
package.lisp (file).
classes.lisp (file).
generics.lisp (file).
common.lisp (file).
methods.lisp (file).
docstrings.lisp (file).
cl-data-structures/dictscommon (module).
cl-data-structures (system).
packages.lisp (file).
trait-classes.lisp (file).
common.lisp (file).
api.lisp (file).
docstrings.lisp (file).
skip-list (module).
hamt (module).
srrb (module).
cl-data-structures/dicts/skip-listcl-data-structures/dicts/hamtdicts (module).
internal.lisp (file).
api.lisp (file).
docstrings.lisp (file).
cl-data-structures/dicts/srrbdicts (module).
types.lisp (file).
internal.lisp (file).
api.lisp (file).
docstrings.lisp (file).
cl-data-structures/sequencesdicts (module).
cl-data-structures (system).
packages.lisp (file).
common.lisp (file).
rrb (module).
cl-data-structures/sequences/rrbsequences (module).
api.lisp (file).
docstrings.lisp (file).
cl-data-structures/queuessequences (module).
cl-data-structures (system).
packages.lisp (file).
common.lisp (file).
docstrings.lisp (file).
2-3-tree (module).
cl-data-structures/queues/2-3-treequeues (module).
api.lisp (file).
docstrings.lisp (file).
cl-data-structures/setsqueues (module).
cl-data-structures (system).
packages.lisp (file).
common.lisp (file).
docstrings.lisp (file).
qp-trie (module).
skip-list (module).
cl-data-structures/sets/qp-triesets (module).
api.lisp (file).
docstrings.lisp (file).
cl-data-structures/sets/skip-listsets (module).
api.lisp (file).
docstrings.lisp (file).
cl-data-structures/metric-spacesets (module).
cl-data-structures (system).
packages.lisp (file).
trait-classes.lisp (file).
common.lisp (file).
api.lisp (file).
docstrings.lisp (file).
egnat (module).
cl-data-structures/metric-space/egnatmetric-space (module).
api.lisp (file).
cl-data-structures/compositemetric-space (module).
cl-data-structures (system).
package.lisp (file).
implementation.lisp (file).
cl-data-structures/algorithmscomposite (module).
cl-data-structures (system).
package.lisp (file).
meta (module).
common.lisp (file).
array-elementwise.lisp (file).
hash-table-elementwise.lisp (file).
on-each.lisp (file).
translation.lisp (file).
count.lisp (file).
to-vector.lisp (file).
to-list.lisp (file).
rate.lisp (file).
to-hash-table.lisp (file).
enumerate.lisp (file).
shuffled-range.lisp (file).
filtering.lisp (file).
common-range-category.lisp (file).
summary.lisp (file).
accumulate.lisp (file).
group-by.lisp (file).
without.lisp (file).
multiplex.lisp (file).
only.lisp (file).
only-different.lisp (file).
cartesian.lisp (file).
restrain-size.lisp (file).
reservoir-sample.lisp (file).
repeat.lisp (file).
latch.lisp (file).
establish-special.lisp (file).
extrema.lisp (file).
extremum.lisp (file).
cumulative-accumulate.lisp (file).
chain.lisp (file).
frequency.lisp (file).
zip.lisp (file).
flatten-lists.lisp (file).
partition-if.lisp (file).
distinct.lisp (file).
first-element.lisp (file).
in-batches.lisp (file).
sliding-window.lisp (file).
with-previous-element.lisp (file).
docstrings.lisp (file).
cl-data-structures/algorithms/metaalgorithms (module).
macros.lisp (file).
classes.lisp (file).
generics.lisp (file).
methods.lisp (file).
docstrings.lisp (file).
cl-data-structures/file-systemalgorithms (module).
cl-data-structures (system).
package.lisp (file).
common.lisp (file).
line-by-line.lisp (file).
tokenize.lisp (file).
find.lisp (file).
unix.lisp (file).
docstrings.lisp (file).
cl-data-structures/threadsfile-system (module).
cl-data-structures (system).
package.lisp (file).
parallel-multiplex.lisp (file).
parallel-group-by.lisp (file).
parallel-on-each.lisp (file).
buffer-range.lisp (file).
docstrings.lisp (file).
cl-data-structures/maththreads (module).
cl-data-structures (system).
package.lisp (file).
absolute-value-norm.lisp (file).
average.lisp (file).
variance.lisp (file).
mutual-information.lisp (file).
simple-linear-regression.lisp (file).
median-absolute-deviation.lisp (file).
hodges-lehmann.lisp (file).
co-occurence-table.lisp (file).
standard-deviation.lisp (file).
moments.lisp (file).
bootstrap.lisp (file).
moving-average.lisp (file).
hmm.lisp (file).
gini-impurity.lisp (file).
entropy.lisp (file).
fast-map.lisp (file).
sum.lisp (file).
docstrings.lisp (file).
cl-data-structures/streaming-algorithmsmath (module).
cl-data-structures (system).
hyperloglog.lisp (file).
polynomial-hashing.lisp (file).
package.lisp (file).
common.lisp (file).
approximated-histogram.lisp (file).
approximated-set-cardinality.lisp (file).
approximated-counts.lisp (file).
approximated-top-k.lisp (file).
bloom-filter.lisp (file).
minhash.lisp (file).
docstrings.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
cl-data-structures/cl-data-structures.asdcl-data-structures/aux-package.lispcl-data-structures/package.lispcl-data-structures/utils/package.lispcl-data-structures/utils/macros.lispcl-data-structures/utils/types.lispcl-data-structures/utils/higher-order.lispcl-data-structures/utils/cartesian.lispcl-data-structures/utils/ordered-algorithms.lispcl-data-structures/utils/lists.lispcl-data-structures/utils/trivial.lispcl-data-structures/utils/modification-algorithms.lispcl-data-structures/utils/distances.lispcl-data-structures/utils/lazy-shuffle.lispcl-data-structures/utils/arrays.lispcl-data-structures/utils/trees.lispcl-data-structures/utils/bind.lispcl-data-structures/utils/parallel-tools.lispcl-data-structures/utils/lambda-lists.lispcl-data-structures/utils/embedding.lispcl-data-structures/utils/cloning.lispcl-data-structures/utils/numbers.lispcl-data-structures/utils/bucket-sort.lispcl-data-structures/utils/hashing.lispcl-data-structures/utils/docstrings.lispcl-data-structures/api/meta.lispcl-data-structures/api/meta-docstrings.lispcl-data-structures/api/fundamental-classes.lispcl-data-structures/api/trait-classes.lispcl-data-structures/api/generics.lispcl-data-structures/api/conditions.lispcl-data-structures/api/expression-wrapper.lispcl-data-structures/api/delay.lispcl-data-structures/api/macros.lispcl-data-structures/api/functions.lispcl-data-structures/api/field.lispcl-data-structures/api/auxilary.lispcl-data-structures/api/docstrings.lispcl-data-structures/adapters/package.lispcl-data-structures/adapters/hash-table.lispcl-data-structures/adapters/vector.lispcl-data-structures/adapters/list.lispcl-data-structures/common/package.lispcl-data-structures/common/modification-operation-status.lispcl-data-structures/common/eager-modification-operation-status.lispcl-data-structures/common/lazy-box.lispcl-data-structures/common/lazy-range.lispcl-data-structures/common/content-tuple.lispcl-data-structures/common/ranges.lispcl-data-structures/common/sequence-window.lispcl-data-structures/common/docstrings.lispcl-data-structures/common/abstract/package.lispcl-data-structures/common/abstract/common.lispcl-data-structures/common/2-3-tree/package.lispcl-data-structures/common/2-3-tree/common.lispcl-data-structures/common/hamt/package.lispcl-data-structures/common/hamt/common.lispcl-data-structures/common/rrb/package.lispcl-data-structures/common/rrb/common.lispcl-data-structures/common/skip-list/package.lispcl-data-structures/common/skip-list/common.lispcl-data-structures/common/egnat/package.lispcl-data-structures/common/egnat/classes.lispcl-data-structures/common/egnat/generics.lispcl-data-structures/common/egnat/common.lispcl-data-structures/common/egnat/methods.lispcl-data-structures/common/egnat/docstrings.lispcl-data-structures/common/qp-trie.lispcl-data-structures/common/meta.lispcl-data-structures/dicts/packages.lispcl-data-structures/dicts/trait-classes.lispcl-data-structures/dicts/common.lispcl-data-structures/dicts/api.lispcl-data-structures/dicts/docstrings.lispcl-data-structures/dicts/skip-list/api.lispcl-data-structures/dicts/hamt/internal.lispcl-data-structures/dicts/hamt/api.lispcl-data-structures/dicts/hamt/docstrings.lispcl-data-structures/dicts/srrb/types.lispcl-data-structures/dicts/srrb/internal.lispcl-data-structures/dicts/srrb/api.lispcl-data-structures/dicts/srrb/docstrings.lispcl-data-structures/sequences/packages.lispcl-data-structures/sequences/common.lispcl-data-structures/sequences/rrb/api.lispcl-data-structures/sequences/rrb/docstrings.lispcl-data-structures/queues/packages.lispcl-data-structures/queues/common.lispcl-data-structures/queues/docstrings.lispcl-data-structures/queues/2-3-tree/api.lispcl-data-structures/queues/2-3-tree/docstrings.lispcl-data-structures/sets/packages.lispcl-data-structures/sets/common.lispcl-data-structures/sets/docstrings.lispcl-data-structures/sets/qp-trie/api.lispcl-data-structures/sets/qp-trie/docstrings.lispcl-data-structures/sets/skip-list/api.lispcl-data-structures/sets/skip-list/docstrings.lispcl-data-structures/metric-space/packages.lispcl-data-structures/metric-space/trait-classes.lispcl-data-structures/metric-space/common.lispcl-data-structures/metric-space/api.lispcl-data-structures/metric-space/docstrings.lispcl-data-structures/metric-space/egnat/api.lispcl-data-structures/composite/package.lispcl-data-structures/composite/implementation.lispcl-data-structures/algorithms/package.lispcl-data-structures/algorithms/meta/macros.lispcl-data-structures/algorithms/meta/classes.lispcl-data-structures/algorithms/meta/generics.lispcl-data-structures/algorithms/meta/methods.lispcl-data-structures/algorithms/meta/docstrings.lispcl-data-structures/algorithms/common.lispcl-data-structures/algorithms/array-elementwise.lispcl-data-structures/algorithms/hash-table-elementwise.lispcl-data-structures/algorithms/on-each.lispcl-data-structures/algorithms/translation.lispcl-data-structures/algorithms/count.lispcl-data-structures/algorithms/to-vector.lispcl-data-structures/algorithms/to-list.lispcl-data-structures/algorithms/rate.lispcl-data-structures/algorithms/to-hash-table.lispcl-data-structures/algorithms/enumerate.lispcl-data-structures/algorithms/shuffled-range.lispcl-data-structures/algorithms/filtering.lispcl-data-structures/algorithms/common-range-category.lispcl-data-structures/algorithms/summary.lispcl-data-structures/algorithms/accumulate.lispcl-data-structures/algorithms/group-by.lispcl-data-structures/algorithms/without.lispcl-data-structures/algorithms/multiplex.lispcl-data-structures/algorithms/only.lispcl-data-structures/algorithms/only-different.lispcl-data-structures/algorithms/cartesian.lispcl-data-structures/algorithms/restrain-size.lispcl-data-structures/algorithms/reservoir-sample.lispcl-data-structures/algorithms/repeat.lispcl-data-structures/algorithms/latch.lispcl-data-structures/algorithms/establish-special.lispcl-data-structures/algorithms/extrema.lispcl-data-structures/algorithms/extremum.lispcl-data-structures/algorithms/cumulative-accumulate.lispcl-data-structures/algorithms/chain.lispcl-data-structures/algorithms/frequency.lispcl-data-structures/algorithms/zip.lispcl-data-structures/algorithms/flatten-lists.lispcl-data-structures/algorithms/partition-if.lispcl-data-structures/algorithms/distinct.lispcl-data-structures/algorithms/first-element.lispcl-data-structures/algorithms/in-batches.lispcl-data-structures/algorithms/sliding-window.lispcl-data-structures/algorithms/with-previous-element.lispcl-data-structures/algorithms/docstrings.lispcl-data-structures/file-system/package.lispcl-data-structures/file-system/common.lispcl-data-structures/file-system/line-by-line.lispcl-data-structures/file-system/tokenize.lispcl-data-structures/file-system/find.lispcl-data-structures/file-system/unix.lispcl-data-structures/file-system/docstrings.lispcl-data-structures/threads/package.lispcl-data-structures/threads/parallel-multiplex.lispcl-data-structures/threads/parallel-group-by.lispcl-data-structures/threads/parallel-on-each.lispcl-data-structures/threads/buffer-range.lispcl-data-structures/threads/docstrings.lispcl-data-structures/math/package.lispcl-data-structures/math/absolute-value-norm.lispcl-data-structures/math/average.lispcl-data-structures/math/variance.lispcl-data-structures/math/mutual-information.lispcl-data-structures/math/simple-linear-regression.lispcl-data-structures/math/median-absolute-deviation.lispcl-data-structures/math/hodges-lehmann.lispcl-data-structures/math/co-occurence-table.lispcl-data-structures/math/standard-deviation.lispcl-data-structures/math/moments.lispcl-data-structures/math/bootstrap.lispcl-data-structures/math/moving-average.lispcl-data-structures/math/hmm.lispcl-data-structures/math/gini-impurity.lispcl-data-structures/math/entropy.lispcl-data-structures/math/fast-map.lispcl-data-structures/math/sum.lispcl-data-structures/math/docstrings.lispcl-data-structures/streaming-algorithms/hyperloglog.lispcl-data-structures/streaming-algorithms/polynomial-hashing.lispcl-data-structures/streaming-algorithms/package.lispcl-data-structures/streaming-algorithms/common.lispcl-data-structures/streaming-algorithms/approximated-histogram.lispcl-data-structures/streaming-algorithms/approximated-set-cardinality.lispcl-data-structures/streaming-algorithms/approximated-counts.lispcl-data-structures/streaming-algorithms/approximated-top-k.lispcl-data-structures/streaming-algorithms/bloom-filter.lispcl-data-structures/streaming-algorithms/minhash.lispcl-data-structures/streaming-algorithms/docstrings.lispcl-data-structures/cl-data-structures.asdcl-data-structures (system).
cl-data-structures/aux-package.lispcl-data-structures (system).
defpackage (macro).
cl-data-structures/package.lispaux-package.lisp (file).
cl-data-structures (system).
cl-data-structures/utils/macros.lisputils (module).
bind-lambda (macro).
cases (macro).
check-value (macro).
cond+ (macro).
cond-compare (macro).
copy-slots (macro).
define-list-of-slots (macro).
import-all-package-symbols (macro).
lazy-let (macro).
let-generator (macro).
lolol (macro).
lparallel-future (macro).
optimize-value (macro).
with-keys (macro).
with-rebind (macro).
with-slots-for (macro).
with-vectors (macro).
build-setf-form (function).
every-possible-combination (function).
generate-if-else (function).
list-of-slots (generic function).
macro-with-dynamic-vars (macro).
read-new-value (function).
toggle-vars (macro).
cl-data-structures/utils/types.lisputils (module).
extendable-vector (type).
index (type).
cl-data-structures/utils/higher-order.lisputils (module).
and* (function).
cycle-over-address (function).
generator (function).
if-else (function).
ignore-errors* (function).
or* (function).
prevent-duplicates (function).
cl-data-structures/utils/cartesian.lisputils (module).
cartesian (function).
cartesian-table (function).
cl-data-structures/utils/ordered-algorithms.lisputils (module).
binary-search (function).
lower-bound (function).
merge-ordered-vectors (function).
on-ordered-intersection (function).
ordered-exclusion (function).
ordered-intersection (function).
ordered-p (function).
cl-data-structures/utils/lists.lisputils (module).
add-to-list (function).
homogenousp (function).
insert-or-replace (function).
lexicographic-compare (function).
normalize-sequence-to-span (function).
normalize-sequence-to-sum (function).
scan (function).
transform (function).
try-find (function).
try-find-cell (function).
try-remove (function).
cl-data-structures/utils/trivial.lispcl-data-structures/utils/modification-algorithms.lisputils (module).
adjust-size-to-fill-pointer (function).
copy-without (function).
erase-from-vector (function).
inverted-hash-table (function).
pop-last (function).
swap-if (function).
swapop (function).
cl-data-structures/utils/distances.lisputils (module).
each-in-matrix (generic function).
fill-distance-matrix-from-vector (function).
half-matrix (class).
make-distance-matrix-from-vector (function).
make-half-matrix (function).
mref (function).
(setf mref) (function).
mutate-matrix (generic function).
parallel-fill-distance-matrix-from-vector (function).
parallel-make-distance-matrix-from-vector (function).
read-size (reader method).
distance (function).
(setf distance) (function).
index-in-content-of-distance-matrix (function).
read-content (reader method).
read-key (reader method).
cl-data-structures/utils/lazy-shuffle.lisputils (module).
draw-random-vector (function).
draw-sample-vector (function).
lazy-shuffle (function).
cl-data-structures/utils/arrays.lisputils (module).
remove-fill-pointer (function).
select-top (function).
unfold-table (function).
circular-shift (function).
circular-shift-left (function).
circular-shift-right (function).
cycle-rotate (function).
highest-leader (function).
in-shuffle-array (function).
inverse-in-shuffle-array (function).
next-index (function).
cl-data-structures/utils/trees.lisputils (module).
all-parents (function).
ancestor-p (function).
as-cons-tree (function).
cl-data-structures/utils/parallel-tools.lisputils (module).
add-into-queue (generic function).
add-sinks (generic function).
end-execution (generic function).
ensure-call-ahead-of (function).
future-carousel (class).
initialize-instance (method).
initialize-instance (method).
make-future-carousel (function).
make-pipe-fragment (function).
pipe-fragment (class).
start-execution (generic function).
access-index (reader method).
(setf access-index) (writer method).
read-end-on-empty (reader method).
read-function (reader method).
read-operation (reader method).
read-queue (reader method).
read-sinks (reader method).
read-sinks-lock (reader method).
read-thread (reader method).
read-vector (reader method).
cl-data-structures/utils/lambda-lists.lisputils (module).
lambda-list-to-bindings (function).
lambda-list-to-call-form (function).
method-lambda-list-to-function-lambda-list (function).
cl-data-structures/utils/embedding.lisputils (module).
bourgain-embedding (function).
cl-data-structures/utils/cloning.lisputils (module).
clone (function).
cloning-information (generic function).
cloning-list (function).
quasi-clone (function).
quasi-clone* (macro).
quasi-clone-other-class (function).
quasi-clone-other-class* (macro).
cl-data-structures/utils/numbers.lispcl-data-structures/utils/bucket-sort.lisputils (module).
bucket-sort (function).
cl-data-structures/utils/hashing.lisputils (module).
fixnum-hash (function).
hash-integer (function).
rol64 (function).
xorshift (function).
splitmix64 (function).
xoshiro256** (function).
cl-data-structures/api/meta.lispapi (module).
add!-function (class).
add-function (class).
alter-bucket (generic function).
alter-bucket! (generic function).
destructive-counterpart (generic function).
destructive-function (class).
erase!-function (class).
erase*!-function (class).
erase*-function (class).
erase-function (class).
erase-if!-function (class).
erase-if-function (class).
fresh-bucket-status (generic function).
functional-add-function (class).
functional-counterpart (generic function).
functional-erase-function (class).
functional-erase-if-function (class).
functional-function (class).
functional-insert-function (class).
functional-put-back-function (class).
functional-put-front-function (class).
functional-put-function (class).
functional-take-out-back-function (class).
functional-take-out-front-function (class).
functional-take-out-function (class).
functional-update-function (class).
functional-update-if-function (class).
grow-function (class).
insert!-function (class).
insert-function (class).
make-bucket (generic function).
make-bucket-from-multiple (generic function).
map-bucket (generic function).
null-bucket (constant).
null-bucket-p (function).
pass-bucket-operation (generic function).
pass-bucket-query (generic function).
position-modification (generic function).
put!-function (class).
put-back!-function (class).
put-front!-function (class).
put-function (class).
shrink-function (class).
take-out!-function (class).
take-out-back!-function (class).
take-out-front!-function (class).
take-out-function (class).
update!-function (class).
update-function (class).
update-if!-function (class).
update-if-function (class).
put-back-function (class).
put-front-function (class).
take-out-back-function (class).
take-out-front-function (class).
cl-data-structures/api/fundamental-classes.lispapi (module).
chunked-range (class).
chunking-mixin (class).
fundamental-assignable-forward-range (class).
fundamental-bidirectional-range (class).
fundamental-container (class).
fundamental-forward-range (class).
fundamental-modification-operation-status (class).
fundamental-random-access-range (class).
fundamental-range (class).
key-value-range (class).
traversable (class).
fundamental-assiganable-range (class).
fundamental-assignable-bidirectional-range (class).
fundamental-assignable-random-access-range (class).
read-chunk-size (reader method).
read-original-range (reader method).
cl-data-structures/api/trait-classes.lispapi (module).
functional (class).
lazy (class).
mutable (class).
transactional (class).
cl-data-structures/api/generics.lispapi (module).
across (generic function).
add (generic function).
add! (generic function).
at (generic function).
(setf at) (generic function).
become-functional (generic function).
become-lazy (generic function).
become-mutable (generic function).
become-transactional (generic function).
between* (generic function).
changed (generic function).
chunked (generic function).
clone (generic function).
consume-back (generic function).
consume-front (generic function).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
destructive-counterpart (method).
dimensionality (generic function).
drop-back (generic function).
drop-front (generic function).
empty-clone (generic function).
erase (generic function).
erase! (generic function).
erase* (generic function).
erase*! (generic function).
erase-if (generic function).
erase-if! (generic function).
forward-call (generic function).
found (generic function).
functional-counterpart (method).
functional-counterpart (method).
functional-counterpart (method).
functional-counterpart (method).
functional-counterpart (method).
functional-counterpart (method).
functional-counterpart (method).
functional-counterpart (method).
functional-counterpart (method).
functional-counterpart (method).
functionalp (generic function).
insert (generic function).
insert! (generic function).
lower-bound (generic function).
make-from-traversable (generic function).
make-of-size (generic function).
mutablep (generic function).
near (generic function).
peek-back (generic function).
(setf peek-back) (generic function).
peek-front (generic function).
(setf peek-front) (generic function).
put (generic function).
put! (generic function).
put-back (generic function).
put-back! (generic function).
put-front (generic function).
put-front! (generic function).
replica (generic function).
reset! (generic function).
size (generic function).
take-out (generic function).
take-out! (generic function).
take-out-back (generic function).
take-out-back! (generic function).
take-out-front (generic function).
take-out-front! (generic function).
transactionalp (generic function).
traverse (generic function).
type-specialization (generic function).
update (generic function).
update! (generic function).
update-if (generic function).
update-if! (generic function).
value (generic function).
whole-range (generic function).
cl-data-structures/api/conditions.lispapi (module).
argument-error (condition).
argument-value-not-in-allowed-set (condition).
argument-value-out-of-bounds (condition).
dimensionality-error (condition).
empty-container (condition).
file-releated-error (condition).
incompatible-arguments (condition).
initialization-error (condition).
initialization-out-of-bounds (condition).
invalid-argument (condition).
invalid-argument-value (condition).
invalid-value (condition).
not-implemented (condition).
not-in-allowed-set (condition).
operation-not-allowed (condition).
out-of-bounds (condition).
path (reader method).
read-bounds (reader method).
read-class (reader method).
read-value (reader method).
textual-error (condition).
too-many-dimensions (condition).
unexpected-argument (condition).
print-condition (generic function).
read-argument (reader method).
cl-data-structures/api/expression-wrapper.lispapi (module).
across (method).
clone (method).
consume-front (method).
drop-front (method).
expression (class).
initialize-instance (method).
path-scaner (function).
peek-front (method).
read-arguments (reader method).
reset! (method).
traverse (method).
xpr (macro).
access-arguments-closure (reader method).
(setf access-arguments-closure) (writer method).
access-closure (reader method).
(setf access-closure) (writer method).
access-finished-closure (reader method).
(setf access-finished-closure) (writer method).
read-body (reader method).
cl-data-structures/api/delay.lispapi (module).
delay (macro).
delayed (class).
force (function).
make-delay (function).
read-callback (reader method).
cl-data-structures/api/macros.lispapi (module).
assert-one-dimension (macro).
check-argument-bounds (macro).
mod-bind (macro).
cl-data-structures/api/functions.lispapi (module).
iota-range (function).
modulo-range (function).
traverse-multiple (function).
cl-data-structures/api/field.lispapi (module).
at (method).
(setf at) (method).
define-validation-for-fields (macro).
field (function).
field (class).
read-arguments (reader method).
validate-field (generic function).
validate-fields (function).
generate-validation-forms (function).
validation-form (function).
validation-form-for (generic function).
cl-data-structures/api/auxilary.lispapi (module).
across (method).
clone (method).
consume-front (method).
empty-range (class).
peek-front (method).
reset! (method).
traverse (method).
cl-data-structures/adapters/hash-table.lispcl-data-structures/adapters/vector.lispadapters (module).
across (method).
at (method).
at (method).
at (method).
clone (method).
clone (method).
consume-back (method).
consume-front (method).
dimensionality (method).
initialize-instance (method).
offset-vector-range (class).
peek-back (method).
peek-front (method).
reset! (method).
size (method).
size (method).
traverse (method).
vector-range (class).
whole-range (method).
access-lower-bound (reader method).
(setf access-lower-bound) (writer method).
access-upper-bound (reader method).
(setf access-upper-bound) (writer method).
init-vector-range (function).
range-not-fully-read (function).
read-initial-lower-bound (reader method).
read-initial-upper-bound (reader method).
read-offset (reader method).
read-vector (reader method).
cl-data-structures/adapters/list.lispadapters (module).
across (method).
at (method).
clone (method).
consume-front (method).
list-range (class).
peek-front (method).
reset! (method).
size (method).
traverse (method).
whole-range (method).
access-content (reader method).
(setf access-content) (writer method).
read-original-content (reader method).
cl-data-structures/common/modification-operation-status.lispcommon (module).
changed (reader method).
found (reader method).
read-found (reader method).
read-value (reader method).
value (reader method).
implementation-modification-operation-status (class).
read-changed (reader method).
write-changed (writer method).
write-found (writer method).
write-value (writer method).
cl-data-structures/common/eager-modification-operation-status.lispcommon (module).
eager-modification-operation-status (class).
empty-changed-eager-modification-operation-status (symbol macro).
empty-eager-modification-operation-status (symbol macro).
make-eager-modification-operation-status (function).
cl-data-structures/common/lazy-box.lispcommon (module).
access-content (reader method).
(setf access-content) (writer method).
become-functional (method).
become-mutable (method).
become-transactional (method).
changed (method).
force-version (function).
found (method).
lazy-box-container (class).
position-modification (method).
reset! (method).
size (method).
value (method).
access-eager-status (reader method).
(setf access-eager-status) (writer method).
access-operations (reader method).
(setf access-operations) (writer method).
add-change (function).
box-container (class).
changes (structure).
changes-content (reader).
(setf changes-content) (writer).
changes-end-index (reader).
(setf changes-end-index) (writer).
changes-p (function).
changes-parent (reader).
(setf changes-parent) (writer).
changes-unique (reader).
(setf changes-unique) (writer).
copy-changes (function).
execute-changes (function).
lazy-modification-operation-status (class).
make-changes (function).
read-lazy-instance (reader method).
write-lazy-instance (writer method).
cl-data-structures/common/lazy-range.lispcommon (module).
across (method).
across (method).
consume-back (method).
consume-back (method).
consume-front (method).
consume-front (method).
drop-back (method).
drop-back (method).
drop-front (method).
drop-front (method).
lazy-bidirectional-range (class).
lazy-random-access-range (class).
make-lazy-range (macro).
peek-back (method).
peek-back (method).
peek-front (method).
peek-front (method).
size (method).
size (method).
traverse (method).
traverse (method).
force-lazy-range (function).
lazy-forward-range (class).
lazy-range (class).
read-container (reader method).
read-range (reader method).
cl-data-structures/common/content-tuple.lispcommon (module).
dict-content (structure).
dict-content-location (reader).
(setf dict-content-location) (writer).
dict-content-value (reader).
(setf dict-content-value) (writer).
hash-content-hash (reader).
(setf hash-content-hash) (writer).
hash-content-location (reader).
(setf hash-content-location) (writer).
hash-dict-content-value (reader).
(setf hash-dict-content-value) (writer).
make-dict-content (function).
make-hash-content (function).
make-hash-dict-content (function).
single-element-p (function).
copy-dict-content (function).
copy-hash-content (function).
copy-hash-dict-content (function).
dict-content-p (function).
hash-content (structure).
hash-content-p (function).
hash-dict-content (structure).
hash-dict-content-hash (function).
(setf hash-dict-content-hash) (function).
hash-dict-content-location (function).
(setf hash-dict-content-location) (function).
hash-dict-content-p (function).
cl-data-structures/common/ranges.lispcommon (module).
across (method).
assignable-forward-tree-range (class).
clone (method).
cloning-information (method).
consume-front (method).
defmethod-with-peek-stack (macro).
defmethod-with-stack (macro).
drop-front (method).
forward-tree-range (class).
peek-front (method).
(setf peek-front) (method).
read-store-value (reader method).
reset! (method).
traverse (method).
access-forward-stack (reader method).
(setf access-forward-stack) (writer method).
read-container (reader method).
read-implementation (function).
read-initial-stack (reader method).
read-key (reader method).
read-obtain-value (reader method).
cl-data-structures/common/sequence-window.lispcommon (module).
across (method).
at (method).
clone (method).
consume-back (method).
consume-front (method).
initialize-instance (method).
peek-back (method).
peek-front (method).
reset! (method).
sequence-window (generic function).
sequence-window (class).
size (method).
traverse (method).
access-current-index (reader method).
(setf access-current-index) (writer method).
access-initial-to (reader method).
(setf access-initial-to) (writer method).
effective-at (generic function).
list-sequence-window (class).
random-access-sequence-window (class).
read-content (reader method).
read-from (reader method).
read-to (reader method).
vector-sequence-window (class).
cl-data-structures/common/abstract/package.lispabstract (module).
cl-data-structures/common/abstract/common.lispabstract (module).
acquire-ownership (function).
define-tagged-untagged-node (macro).
fundamental-ownership-tagged-object (class).
make-ownership-tag (function).
read-ownership-tag (reader method).
read-ownership-tag (reader method).
replica (function).
tagged-node (class).
tagged-struct-node (structure).
write-ownership-tag (writer method).
copy-tagged-struct-node (function).
make-tagged-struct-node (function).
reset-ownership-tag (function).
struct-accessor-name (function).
tagged-node-ownership-tag (function).
tagged-struct-node-ownership-tag (reader).
(setf tagged-struct-node-ownership-tag) (writer).
tagged-struct-node-p (function).
cl-data-structures/common/2-3-tree/package.lisp2-3-tree (module).
cl-data-structures/common/2-3-tree/common.lisp2-3-tree (module).
2-node (class).
3-node (class).
access-left (reader method).
access-left (reader method).
(setf access-left) (writer method).
(setf access-left) (writer method).
access-middle (reader method).
(setf access-middle) (writer method).
access-right (reader method).
access-right (reader method).
(setf access-right) (writer method).
(setf access-right) (writer method).
access-root (reader method).
(setf access-root) (writer method).
delete-back-from-tree (function).
delete-back-from-tree! (function).
insert-front-into-tree (function).
insert-front-into-tree! (function).
node (class).
transactional-delete-back-from-tree! (function).
transactional-insert-front-into-tree! (function).
tree (class).
delete-back (generic function).
delete-back! (generic function).
insert-front (generic function).
insert-front! (generic function).
tagged-2-node (class).
tagged-3-node (class).
tagged-tree (class).
take-back (generic function).
transactional-delete-back! (generic function).
transactional-insert-front! (generic function).
cl-data-structures/common/hamt/common.lisphamt (module).
+depth+ (constant).
+hash-level+ (constant).
+maximum-children-count+ (constant).
access-root (reader method).
(setf access-root) (writer method).
access-size (reader method).
(setf access-size) (writer method).
build-node (function).
build-rehashed-node (function).
clone (method).
copy-node (function).
copy-on-write (function).
get-range-key-function (generic function).
go-down-on-path (function).
hamt-container (class).
hash-do (macro).
hash-node-access (function).
hash-node-contains (function).
hash-node-contains-node (function).
hash-node-content (function).
(setf hash-node-content) (function).
hash-node-deep-copy (function).
hash-node-insert! (function).
hash-node-insert-into-copy (function).
hash-node-p (function).
hash-node-remove! (function).
hash-node-remove-from-the-copy (function).
hash-node-replace! (function).
hash-node-replace-in-the-copy (function).
hash-node-size (function).
hash-node-size (type).
hash-node-to-masked-index (function).
hash-node-whole-mask (function).
new-cell (function).
obtain-value (function).
rebuild-rehashed-node (function).
rehash (function).
transactional-copy-on-write (function).
whole-range (method).
with-destructive-erase-hamt (macro).
with-hamt-path (macro).
copy-hamt-range-stack-cell (function).
copy-hash-node-tagged (function).
copy-hash-node-untagged (function).
forward-cell (function).
full-bucket-p (function).
hamt-range-stack-cell (structure).
hamt-range-stack-cell-end (reader).
(setf hamt-range-stack-cell-end) (writer).
hamt-range-stack-cell-node (reader).
(setf hamt-range-stack-cell-node) (writer).
hamt-range-stack-cell-p (function).
hamt-range-stack-cell-start (reader).
(setf hamt-range-stack-cell-start) (writer).
hash-mask (type).
hash-node (type).
hash-node-index (type).
hash-node-node-mask (function).
(setf hash-node-node-mask) (function).
hash-node-tagged (structure).
hash-node-tagged-content (reader).
(setf hash-node-tagged-content) (writer).
hash-node-tagged-node-mask (reader).
(setf hash-node-tagged-node-mask) (writer).
hash-node-tagged-ownership-tag (function).
(setf hash-node-tagged-ownership-tag) (function).
hash-node-tagged-p (function).
hash-node-untagged (structure).
hash-node-untagged-content (reader).
(setf hash-node-untagged-content) (writer).
hash-node-untagged-node-mask (reader).
(setf hash-node-untagged-node-mask) (writer).
hash-node-untagged-p (function).
index-path (type).
make-hamt-range-stack-cell (function).
make-hash-node (function).
make-hash-node-tagged (function).
make-hash-node-untagged (function).
node-path (type).
read-bucket-size (reader method).
round-size (function).
set-in-node-mask (function).
cl-data-structures/common/rrb/common.lisprrb (module).
+bit-count+ (constant).
+maximal-shift+ (constant).
+maximum-children-count+ (constant).
+tail-mask+ (constant).
access-last-size (reader method).
(setf access-last-size) (writer method).
access-lower-bound (reader method).
(setf access-lower-bound) (writer method).
access-root (reader method).
(setf access-root) (writer method).
access-shift (reader method).
(setf access-shift) (writer method).
access-size (reader method).
(setf access-size) (writer method).
access-start (reader method).
(setf access-start) (writer method).
access-tail (reader method).
(setf access-tail) (writer method).
access-tail-size (reader method).
(setf access-tail-size) (writer method).
access-upper-bound (reader method).
(setf access-upper-bound) (writer method).
across (method).
at (method).
at (method).
(setf at) (method).
chunked (method).
clone (method).
clone (method).
consume-back (method).
consume-front (method).
consume-front (method).
copy-on-write (function).
deep-copy-sparse-rrb-node (function).
descend-into-tree (function).
destructive-write (function).
fill-sparse-rrb-node-with-new (function).
initialize-instance (method).
initialize-instance (method).
insert-tail (function).
make-node-content (function).
make-rrb-node (function).
make-sparse-rrb-node (function).
node-content (type).
node-size (type).
nref (function).
(setf nref) (function).
peek-back (method).
(setf peek-back) (method).
peek-front (method).
peek-front (method).
(setf peek-front) (method).
read-element-type (reader method).
remove-tail (function).
reset! (method).
rrb-at (function).
rrb-container (class).
rrb-index (type).
rrb-node (type).
rrb-node-content (function).
rrb-node-position (type).
rrb-node-push! (function).
rrb-node-push-into-copy (function).
rrb-range (class).
shift (type).
size (method).
size (method).
sparse-nref (function).
(setf sparse-nref) (function).
sparse-rrb-mask (type).
sparse-rrb-node (type).
sparse-rrb-node-bitmask (function).
(setf sparse-rrb-node-bitmask) (function).
sparse-rrb-node-contains (function).
sparse-rrb-node-content (function).
(setf sparse-rrb-node-content) (function).
sparse-rrb-node-erase (function).
sparse-rrb-node-erase! (function).
sparse-rrb-node-size (function).
sparse-rrb-node-tagged (structure).
sparse-rrb-node-untagged (structure).
sparse-rrb-tree-map (function).
sparse-rrb-tree-size (function).
transactional-copy-on-write (function).
traverse (method).
traverse (method).
type-specialization (reader method).
whole-range (method).
with-sparse-rrb-node (macro).
with-sparse-rrb-node-path (macro).
access-container (reader method).
(setf access-container) (writer method).
acquire-path (function).
chunked-rrb-range (class).
copy-sparse-rrb-node-tagged (function).
copy-sparse-rrb-node-untagged (function).
fill-sparse-rrb-node-without (function).
init-rrb (function).
make-sparse-rrb-node-tagged (function).
make-sparse-rrb-node-untagged (function).
mutable-rrb-range (class).
push-into-copy-of-tail (function).
push-into-tail! (function).
read-content (reader method).
read-initial-lower-bound (reader method).
read-initial-upper-bound (reader method).
read-mutex (reader method).
read-rrb-range (reader method).
read-vectors-in-chunk (reader method).
rrb-indexes (type).
rrb-node-deep-copy (function).
rrb-node-pop! (function).
rrb-node-pop-in-the-copy (function).
rrb-path (type).
sparse-rrb-node-tagged-bitmask (reader).
(setf sparse-rrb-node-tagged-bitmask) (writer).
sparse-rrb-node-tagged-content (reader).
(setf sparse-rrb-node-tagged-content) (writer).
sparse-rrb-node-tagged-ownership-tag (function).
(setf sparse-rrb-node-tagged-ownership-tag) (function).
sparse-rrb-node-tagged-p (function).
sparse-rrb-node-untagged-bitmask (reader).
(setf sparse-rrb-node-untagged-bitmask) (writer).
sparse-rrb-node-untagged-content (reader).
(setf sparse-rrb-node-untagged-content) (writer).
sparse-rrb-node-untagged-p (function).
tail-offset (function).
cl-data-structures/common/skip-list/package.lispskip-list (module).
cl-data-structures/common/skip-list/common.lispskip-list (module).
access-maximum-level (reader method).
(setf access-maximum-level) (writer method).
access-test-function (reader method).
(setf access-test-function) (writer method).
across (method).
across (method).
assoc-skip-list-node-value (reader).
(setf assoc-skip-list-node-value) (writer).
between* (method).
clone (method).
clone (method).
cloning-information (method).
cloning-information (method).
consume-front (method).
delete-node-between! (function).
drop-front (method).
empty-clone (method).
fundamental-skip-list (class).
fundamental-skip-list-range (class).
insert-node-between! (function).
insert-or (function).
locate-node (function).
make-range (generic function).
make-skip-list-node (function).
make-skip-list-node-of-level (function).
make-skip-list-node-of-random-level (function).
new-node-update-pointers! (function).
peek-front (method).
position-modification (method).
position-modification (method).
print-object (method).
print-object (method).
random-level (function).
read-ordering-function (reader method).
read-pointers (reader method).
reset! (method).
reset! (method).
size (method).
skip-list-locate-node (function).
skip-list-node (structure).
skip-list-node-at (function).
(setf skip-list-node-at) (function).
skip-list-node-clone (generic function).
skip-list-node-compare (function).
skip-list-node-content (reader).
(setf skip-list-node-content) (writer).
skip-list-node-level (function).
skip-list-node-pointers (reader).
(setf skip-list-node-pointers) (writer).
skip-list-node-update-pointers! (function).
traverse (method).
traverse (method).
update-head-pointers! (function).
access-current-node (reader method).
(setf access-current-node) (writer method).
assoc-skip-list-node (structure).
assoc-skip-list-node-content (function).
(setf assoc-skip-list-node-content) (function).
assoc-skip-list-node-p (function).
assoc-skip-list-node-pointers (function).
(setf assoc-skip-list-node-pointers) (function).
copy-assoc-skip-list-node (function).
copy-into! (function).
copy-skip-list-node (function).
gather-pointers (function).
list-of-slots (method).
list-of-slots (method).
list-of-slots (method).
make-assoc-skip-list-node (function).
make-skip-list-node* (function).
read-initial-current-node (reader method).
read-last-node (reader method).
skip-list-node-p (function).
cl-data-structures/common/egnat/package.lispegnat (module).
cl-data-structures/common/egnat/classes.lispegnat (module).
access-root (reader method).
(setf access-root) (writer method).
access-size (reader method).
(setf access-size) (writer method).
cloning-information (method).
cloning-information (method).
fundamental-egnat-container (class).
initialize-instance (method).
initialize-instance (method).
mutable-egnat-container (class).
read-margin (reader method).
read-near (reader method).
size (reader method).
access-close-range (reader method).
(setf access-close-range) (writer method).
access-distant-range (reader method).
(setf access-distant-range) (writer method).
access-stack (reader method).
(setf access-stack) (writer method).
egnat-node (class).
egnat-range (class).
egnat-range-around (class).
egnat-subtree (class).
read-branching-factor (reader method).
read-children (reader method).
read-close-range (reader method).
read-container (reader method).
read-content (reader method).
read-content (reader method).
read-content-count-in-node (reader method).
read-distant-range (reader method).
read-initial-stack (reader method).
read-metric-type (reader method).
read-samples-count (reader method).
cl-data-structures/common/egnat/generics.lispegnat (module).
distance (generic function).
select-children (generic function).
next-elements (generic function).
cl-data-structures/common/egnat/common.lispegnat (module).
make-egnat-tree (function).
prune-subtrees (function).
traverse-impl (function).
assign-children (function).
average-pairwise-distance (function).
become-subtree (function).
become-subtree* (generic function).
calculate-distances (function).
closest-node (function).
collect-buckets (function).
egnat-grow! (function).
make-children-vector (function).
make-content-vector (function).
make-partitions (function).
make-ranges (function).
node-children-full-p (function).
node-full-p (function).
node-head (function).
push-content (function).
recursive-egnat-grow! (function).
recursive-egnat-grow!* (generic function).
select-best-seeds (function).
select-seeds (function).
update-ranges! (function).
visit-every-bucket (function).
cl-data-structures/common/egnat/methods.lispegnat (module).
across (method).
across (method).
clone (method).
clone (method).
clone (method).
consume-front (method).
near (method).
peek-front (method).
position-modification (method).
reset! (method).
traverse (method).
traverse (method).
whole-range (method).
add-children-to-stack (function).
front-body (macro).
position-to-value (function).
traverse-body (macro).
cl-data-structures/common/qp-trie.lispcommon (module).
access-root (reader method).
(setf access-root) (writer method).
array-to-half-byte-array (function).
half-byte-list-to-array (function).
make-qp-trie-node (function).
map-qp-trie-nodes (function).
qp-trie (class).
qp-trie-delete! (function).
qp-trie-find (function).
qp-trie-insert! (macro).
qp-trie-node (type).
qp-trie-node-bitmask (function).
(setf qp-trie-node-bitmask) (function).
qp-trie-node-children-bitmask (function).
(setf qp-trie-node-children-bitmask) (function).
qp-trie-node-clone (function).
qp-trie-node-content (function).
(setf qp-trie-node-content) (function).
qp-trie-node-delete! (function).
qp-trie-node-leaf-present-p (function).
qp-trie-node-present-p (function).
qp-trie-node-ref (function).
qp-trie-node-store-bitmask (function).
(setf qp-trie-node-store-bitmask) (function).
qp-trie-node-unmark-leaf! (function).
copy-qp-trie-node-tagged (function).
copy-qp-trie-node-untagged (function).
full-mask (type).
half-byte (type).
make-qp-trie-node-tagged (function).
make-qp-trie-node-untagged (function).
node-index (type).
node-mask (type).
qp-trie-leaf-present-p (function).
qp-trie-node-contains-leafs-p (function).
qp-trie-node-get-or-insert-child! (macro).
qp-trie-node-index (function).
qp-trie-node-insert-new-node! (function).
qp-trie-node-mark-leaf! (function).
qp-trie-node-size (function).
qp-trie-node-tagged (structure).
qp-trie-node-tagged-bitmask (reader).
(setf qp-trie-node-tagged-bitmask) (writer).
qp-trie-node-tagged-content (reader).
(setf qp-trie-node-tagged-content) (writer).
qp-trie-node-tagged-ownership-tag (function).
(setf qp-trie-node-tagged-ownership-tag) (function).
qp-trie-node-tagged-p (function).
qp-trie-node-untagged (structure).
qp-trie-node-untagged-bitmask (reader).
(setf qp-trie-node-untagged-bitmask) (writer).
qp-trie-node-untagged-content (reader).
(setf qp-trie-node-untagged-content) (writer).
qp-trie-node-untagged-p (function).
split-byte (function).
cl-data-structures/common/meta.lispcommon (module).
alter-bucket (method).
alter-bucket (method).
alter-bucket (method).
alter-bucket (method).
alter-bucket (method).
alter-bucket (method).
alter-bucket! (method).
alter-bucket! (method).
alter-bucket! (method).
alter-bucket! (method).
alter-bucket! (method).
alter-bucket! (method).
alter-bucket! (method).
fresh-bucket-status (method).
fresh-bucket-status (method).
fresh-bucket-status (method).
fresh-bucket-status (method).
fresh-bucket-status (method).
make-bucket (method).
make-bucket (method).
cl-data-structures/dicts/trait-classes.lispdicts (module).
functional-dictionary (class).
functional-hashing-dictionary (class).
functional-sparse-vector (class).
fundamental-dictionary (class).
fundamental-hashing-dictionary (class).
fundamental-sparse-vector (class).
lazy-dictionary (class).
lazy-hashing-dictionary (class).
mutable-dictionary (class).
mutable-hashing-dictionary (class).
mutable-sparse-vector (class).
read-equal-fn (reader method).
read-hash-fn (reader method).
transactional-dictionary (class).
transactional-hashing-dictionary (class).
transactional-sparse-vector (class).
cl-data-structures/dicts/common.lispdicts (module).
at (method).
become-lazy (method).
map-bucket (method).
map-bucket (method).
whole-range (method).
lazy-box-dictionary (class).
cl-data-structures/dicts/api.lispdicts (module).
add (method).
add (method).
add! (method).
add! (method).
(setf at) (method).
(setf at) (method).
erase (method).
erase (method).
erase! (method).
erase! (method).
erase-if (method).
erase-if! (method).
insert (method).
insert (method).
insert! (method).
insert! (method).
update (method).
update (method).
update! (method).
update! (method).
update-if (method).
update-if (method).
update-if! (method).
update-if! (method).
cl-data-structures/dicts/skip-list/api.lispskip-list (module).
across (method).
at (method).
consume-front (method).
lower-bound (method).
make-from-traversable (method).
make-mutable-skip-list-dictionary (function).
make-range (method).
mutable-skip-list-dictionary (class).
peek-front (method).
position-modification (method).
position-modification (method).
traverse (method).
whole-range (method).
mutable-skip-list-dictionary-range (class).
cl-data-structures/dicts/hamt/internal.lisphamt (module).
find-content (function).
grow (generic function).
make-hash-dict-content (function).
shrink (generic function).
cl-data-structures/dicts/hamt/api.lisphamt (module).
across (method).
at (method).
become-functional (method).
become-functional (method).
become-mutable (method).
become-mutable (method).
become-transactional (method).
empty-clone (method).
functional-hamt-dictionary (class).
get-range-key-function (method).
hamt-dictionary (class).
hamt-dictionary-at (function).
hamt-dictionary-size (function).
make-from-traversable (method).
make-from-traversable (method).
make-from-traversable (method).
make-functional-hamt-dictionary (function).
make-mutable-hamt-dictionary (function).
make-transactional-hamt-dictionary (function).
mutable-hamt-dictionary (class).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
replica (method).
reset! (method).
size (method).
transactional-hamt-dictionary (class).
whole-range (method).
with-hash-tree-functions (macro).
cl-data-structures/dicts/srrb/types.lispsrrb (module).
access-index-bound (reader method).
(setf access-index-bound) (writer method).
access-shift (reader method).
(setf access-shift) (writer method).
access-tail (reader method).
(setf access-tail) (writer method).
access-tail-mask (reader method).
(setf access-tail-mask) (writer method).
access-tree (reader method).
(setf access-tree) (writer method).
access-tree-index-bound (reader method).
(setf access-tree-index-bound) (writer method).
access-tree-size (reader method).
(setf access-tree-size) (writer method).
cloning-information (method).
functional-sparse-rrb-vector (class).
mutable-sparse-rrb-vector (class).
read-element-type (reader method).
transactional-sparse-rrb-vector (class).
type-specialization (reader method).
fundamental-sparse-rrb-vector (class).
cl-data-structures/dicts/srrb/internal.lispsrrb (module).
functional-sparse-rrb-vector-grow (function).
insert-tail (function).
insert-tail! (function).
mutable-sparse-rrb-vector-grow (function).
scan-index-bound (function).
shift-for-position (function).
transactional-insert-tail! (function).
transactional-sparse-rrb-vector-grow (function).
adjust-tree-to-new-size! (function).
deep-copy-of-tail (function).
destructive-grow-tree! (function).
drop-unneded-nodes (function).
grow-tree (function).
has-single-child-p (function).
insert-into-node! (function).
insert-new-node! (function).
insert-tail-handle-root-overflow (function).
make-adjusted-tree (function).
make-node-from-tail (function).
set-in-tail (function).
set-in-tail! (function).
shift (type).
shrink-handle-tail! (function).
shrink-tree (function).
shrink-tree! (function).
tail-copy (function).
transactional-grow-tree! (function).
transactional-shrink-handle-tail! (function).
transactional-shrink-tree! (function).
tree-index-bound (function).
unset-in-tail (function).
unset-in-tail! (function).
cl-data-structures/dicts/srrb/api.lispsrrb (module).
across (method).
at (method).
become-functional (method).
become-mutable (method).
become-transactional (method).
become-transactional (method).
empty-clone (method).
make-from-traversable (method).
make-from-traversable (method).
make-from-traversable (method).
make-functional-sparse-rrb-vector (function).
make-mutable-sparse-rrb-vector (function).
make-transactional-sparse-rrb-vector (function).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
replica (method).
reset! (method).
reset! (method).
size (method).
sparse-rrb-vector-at (function).
traverse (method).
whole-range (method).
copy-srrb-range-stack-cell (function).
forward-cell (function).
make-range-from-root (function).
make-range-from-tail (function).
make-srrb-range-stack-cell (function).
obtain-value (function).
srrb-range-stack-cell (structure).
srrb-range-stack-cell-container (reader).
(setf srrb-range-stack-cell-container) (writer).
srrb-range-stack-cell-depth (reader).
(setf srrb-range-stack-cell-depth) (writer).
srrb-range-stack-cell-end (reader).
(setf srrb-range-stack-cell-end) (writer).
srrb-range-stack-cell-is-tail (reader).
(setf srrb-range-stack-cell-is-tail) (writer).
srrb-range-stack-cell-node-bitmask (reader).
(setf srrb-range-stack-cell-node-bitmask) (writer).
srrb-range-stack-cell-node-content (reader).
(setf srrb-range-stack-cell-node-content) (writer).
srrb-range-stack-cell-p (function).
srrb-range-stack-cell-start (reader).
(setf srrb-range-stack-cell-start) (writer).
srrb-range-stack-cell-upper-bits (reader).
(setf srrb-range-stack-cell-upper-bits) (writer).
cl-data-structures/sequences/packages.lispsequences (module).
cl-data-structures/sequences/common.lispsequences (module).
at (method).
(setf at) (method).
become-lazy (method).
functional-sequence (class).
fundamental-sequence (class).
mutable-sequence (class).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
put (method).
put! (method).
put-back (method).
put-back! (method).
take-out (method).
take-out! (method).
take-out-back (method).
take-out-back! (method).
transactional-sequence (class).
update (method).
update-if (method).
update-if! (method).
whole-range (method).
lazy-box-sequence (class).
cl-data-structures/sequences/rrb/api.lisprrb (module).
become-functional (method).
become-functional (method).
become-mutable (method).
become-mutable (method).
become-transactional (method).
empty-clone (method).
functional-rrb-vector (class).
make-from-traversable (method).
make-from-traversable (method).
make-from-traversable (method).
make-functional-rrb-vector (function).
make-mutable-rrb-vector (function).
make-of-size (method).
make-of-size (method).
make-of-size (method).
make-transactional-rrb-vector (function).
mutable-rrb-vector (class).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
replica (method).
reset! (method).
reset! (method).
transactional-rrb-vector (class).
fold-content (function).
fold-rrb-content (function).
make-mutable-of-size (function).
mutable-from-traversable (function).
rrb-vector (class).
cl-data-structures/queues/common.lispqueues (module).
access-size (reader method).
(setf access-size) (writer method).
fundamental-functional-queue (class).
fundamental-mutable-queue (class).
fundamental-queue (class).
fundamental-transactional-queue (class).
put (method).
put! (method).
put! (method).
size (reader method).
take-out (method).
take-out! (method).
take-out! (method).
take-out! (method).
cl-data-structures/queues/2-3-tree/api.lisp2-3-tree (module).
across (method).
across (method).
across (method).
at (method).
at (method).
become-functional (method).
become-mutable (method).
become-mutable (method).
become-mutable (method).
become-mutable (method).
become-transactional (method).
become-transactional (method).
become-transactional (method).
become-transactional (method).
become-transactional (method).
clone (method).
consume-front (method).
empty-clone (method).
empty-clone (method).
empty-clone (method).
fixed-capacity-synchronized-mutable-2-3-queue (class).
fixed-capacity-synchronized-transactional-2-3-queue (class).
functional-2-3-queue (class).
make-from-traversable (method).
make-from-traversable (method).
make-from-traversable (method).
make-functional-2-3-queue (function).
make-mutable-2-3-queue (function).
make-synchronized-mutable-2-3-queue (function).
make-synchronized-transactional-2-3-queue (function).
make-transactional-2-3-queue (function).
mutable-2-3-queue (class).
peek-front (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
position-modification (method).
replica (method).
reset! (method).
reset! (method).
reset! (method).
reset! (method).
reset! (method).
size (method).
synchronized-mutable-2-3-queue (class).
synchronized-transactional-2-3-queue (class).
transactional-2-3-queue (class).
traverse (method).
traverse (method).
type-specialization (reader method).
whole-range (method).
whole-range (method).
+buffer-size+ (constant).
2-3-queue (class).
2-3-queue-range (class).
access-container (reader method).
(setf access-container) (writer method).
access-head (reader method).
(setf access-head) (writer method).
access-head-position (reader method).
(setf access-head-position) (writer method).
access-og-container (reader method).
(setf access-og-container) (writer method).
access-tail (reader method).
(setf access-tail) (writer method).
access-tail-end (reader method).
(setf access-tail-end) (writer method).
access-tail-position (reader method).
(setf access-tail-position) (writer method).
across/traverse (function).
buffer-index (type).
copy-array-if-not-nil (function).
fixed-capacity-synchronization-mixin (class).
mutable-from-traversable (function).
queue-buffer (type).
read-capacity (reader method).
read-element-type (reader method).
read-lock (reader method).
read-mutex (reader method).
read-notify-pop (reader method).
read-notify-push (reader method).
synchronization-mixin (class).
synchronization-primitives-mixin (class).
cl-data-structures/queues/2-3-tree/docstrings.lisp2-3-tree (module).
cl-data-structures/sets/common.lispsets (module).
erase! (method).
erase*! (method).
fundamental-set (class).
mutable-set (class).
put! (method).
cl-data-structures/sets/qp-trie/api.lispqp-trie (module).
across (method).
across (method).
at (method).
between* (method).
clone (method).
clone (method).
consume-front (method).
empty-array-key (condition).
empty-clone (method).
fundamental-qp-trie-set (class).
make-from-traversable (method).
make-mutable-qp-trie-set (function).
mutable-qp-trie-set (class).
peek-front (method).
position-modification (method).
position-modification (method).
position-modification (method).
reset! (method).
reset! (method).
size (method).
traverse (method).
whole-range (method).
depth (reader method).
end (reader method).
initial-stack (reader method).
more-checks-end (reader method).
more-checks-start (reader method).
new-cell (function).
node (reader method).
obtain-value (function).
parents (reader method).
qp-trie-range-stack-cell (class).
qp-trie-set-range (class).
stack (reader method).
(setf stack) (writer method).
start (reader method).
cl-data-structures/sets/skip-list/api.lispskip-list (module).
across (method).
at (method).
consume-front (method).
lower-bound (method).
make-from-traversable (method).
make-mutable-skip-list-set (function).
make-range (method).
mutable-skip-list-set (class).
peek-front (method).
position-modification (method).
traverse (method).
whole-range (method).
mutable-skip-list-set-range (class).
cl-data-structures/sets/skip-list/docstrings.lispskip-list (module).
cl-data-structures/metric-space/packages.lispmetric-space (module).
cl-data-structures/metric-space/trait-classes.lispmetric-space (module).
metric-space-dictionary (class).
metric-space-set (class).
mutable-metric-space-dictionary (class).
mutable-metric-space-set (class).
read-metric-fn (reader method).
cl-data-structures/metric-space/common.lispmetric-space (module).
distance (generic function).
cl-data-structures/metric-space/api.lispmetric-space (module).
cl-data-structures/metric-space/docstrings.lispmetric-space (module).
cl-data-structures/metric-space/egnat/api.lispegnat (module).
distance (method).
egnat-metric-set (class).
make-from-traversable (method).
make-from-traversable (method).
make-from-traversable (method).
make-mutable-egnat-metric-set (function).
mutable-egnat-metric-set (class).
cl-data-structures/composite/package.lispcomposite (module).
cl-data-structures/composite/implementation.lispcomposite (module).
alter-bucket (method).
alter-bucket! (method).
at (method).
make-bucket (method).
make-functional-composite-container (function).
make-mutable-composite-container (function).
position-modification (function).
position-modification! (function).
composite-container (class).
functional-composite-container (class).
make-bucket-callback (macro).
make-bucket-callbacks (reader method).
mutable-composite-container (class).
root (reader method).
(setf root) (writer method).
separate-operations/arguments (function).
cl-data-structures/algorithms/package.lispalgorithms (module).
cl-data-structures/algorithms/meta/macros.lispmeta (module).
define-aggregation-function (macro).
let-aggregator (macro).
aggregation-function-class-form (function).
aggregation-function-defgeneric-form (function).
aggregator-constructor-form (function).
extract-parameters (function).
extract-values (function).
key-parameters-start-at (function).
cl-data-structures/algorithms/meta/classes.lispmeta (module).
aggregation-function (class).
early-aggregation-exit (condition).
layer-function (class).
range-function (class).
transformation!-function (class).
cl-data-structures/algorithms/meta/generics.lispmeta (module).
across-aggregate (generic function).
aggregator (structure).
aggregator-constructor (generic function).
apply-aggregation-function (generic function).
apply-layer (generic function).
apply-range-function (generic function).
call-constructor (macro).
cleanup (function).
construct-aggregator (function).
extract-result (function).
layer-aggregator-constructor (generic function).
pass-to-aggregation (function).
state-result (generic function).
aggregator-cleanup (reader).
(setf aggregator-cleanup) (writer).
aggregator-extract (reader).
(setf aggregator-extract) (writer).
aggregator-p (function).
aggregator-pass (reader).
(setf aggregator-pass) (writer).
copy-aggregator (function).
make-aggregator (function).
make-state (generic function).
cl-data-structures/algorithms/meta/methods.lispmeta (module).
apply-aggregation-function (method).
apply-range-function (method).
apply-range-function (method).
apply-range-function (method).
apply-range-function (method).
apply-range-function (method).
apply-range-function (method).
apply-range-function (method).
apply-range-function (method).
cl-data-structures/algorithms/common.lispalgorithms (module).
*current-key* (special variable).
across (method).
across-aggregate (method).
at (method).
at (method).
bidirectional-proxy-range (class).
chunked (method).
chunked (method).
clone (method).
clone (method).
cloning-information (method).
cloning-information (method).
consume-back (method).
consume-back (method).
consume-front (method).
consume-front (method).
consume-front (method).
drop-back (method).
drop-front (method).
forward-call (method).
forward-proxy-range (class).
hash-table-range (class).
make-hash-table-range (function).
make-proxy (generic function).
peek-back (method).
peek-back (method).
peek-front (method).
peek-front (method).
print-object (method).
proxy-range (class).
random-access-proxy-range (class).
read-hash-table (reader method).
read-keys (reader method).
read-original-range (reader method).
reset! (method).
reset! (method).
size (method).
transparent-to-chunking-mixin (class).
traverse (method).
traverse (method).
wrap-chunk (generic function).
access-begin (reader method).
(setf access-begin) (writer method).
access-end (reader method).
(setf access-end) (writer method).
chunked-proxy-range (class).
clone-of-original-range (function).
read-chunked-range (reader method).
read-initial-begin (reader method).
read-initial-end (reader method).
cl-data-structures/algorithms/array-elementwise.lispalgorithms (module).
aggregator-constructor (method).
apply-layer (method).
array-elementwise (generic function).
layer-aggregator-constructor (method).
array-elementwise-forward-proxy (class).
array-elementwise-function (class).
cl-data-structures/algorithms/hash-table-elementwise.lispalgorithms (module).
aggregator-constructor (method).
apply-layer (method).
hash-table-elementwise (generic function).
layer-aggregator-constructor (method).
hash-table-elementwise-forward-proxy (class).
hash-table-elementwise-function (class).
cl-data-structures/algorithms/on-each.lispalgorithms (module).
access-functor (reader method).
(setf access-functor) (writer method).
across (method).
aggregator-constructor (method).
apply-layer (method).
at (method).
cloning-information (method).
consume-back (method).
consume-front (method).
drop-back (method).
drop-front (method).
forward-proxy-box-range (class).
on-each (generic function).
peek-back (method).
peek-front (method).
proxy-box-range (class).
read-functor-constructor (reader method).
read-functor-prototype (reader method).
read-key (reader method).
reset! (method).
traverse (method).
wrap-chunk (method).
bidirectional-proxy-box-range (class).
on-each-function (class).
on-each-proxy-range-from-range (generic function).
random-access-proxy-box-range (class).
cl-data-structures/algorithms/translation.lispalgorithms (module).
translation (generic function).
translation-function (class).
cl-data-structures/algorithms/count.lispalgorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
count-elements (generic function).
count-elements-function (class).
cl-data-structures/algorithms/to-vector.lispalgorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
to-vector (generic function).
to-vector-function (class).
cl-data-structures/algorithms/to-list.lispalgorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
to-list (generic function).
to-list-function (class).
cl-data-structures/algorithms/rate.lispalgorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
rate (generic function).
rate-function (class).
cl-data-structures/algorithms/to-hash-table.lispalgorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
to-hash-table (generic function).
to-hash-table-function (class).
cl-data-structures/algorithms/enumerate.lispalgorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
enumerate (generic function).
enumerate-function (class).
cl-data-structures/algorithms/shuffled-range.lispalgorithms (module).
clone (method).
consume-front (method).
peek-front (method).
reset! (method).
shuffled-range (function).
shuffled-range (class).
access-index (reader method).
(setf access-index) (writer method).
read-from (reader method).
read-table (reader method).
read-to (reader method).
cl-data-structures/algorithms/filtering.lispalgorithms (module).
across (method).
aggregator-constructor (method).
clone (method).
cloning-information (method).
consume-back (method).
consume-front (method).
filtering-proxy (class).
peek-back (method).
peek-front (method).
read-key (reader method).
should-skip (generic function).
traverse (method).
bidirectional-filtering-proxy (class).
forward-filtering-proxy (class).
cl-data-structures/algorithms/common-range-category.lispalgorithms (module).
common-fundamental-range-class (function).
fundamental-range-class-of (generic function).
cl-data-structures/algorithms/summary.lispalgorithms (module).
%summary (generic function).
aggregator-constructor (method).
aggregator-constructor (method).
summary (macro).
summary-result-range (class).
%summary-function (class).
summary-aggregation-function (class).
cl-data-structures/algorithms/accumulate.lispalgorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
accumulate-function (class).
cl-data-structures/algorithms/group-by.lispalgorithms (module).
aggregator-constructor (method).
apply-layer (method).
apply-layer (method).
apply-layer (method).
apply-layer (method).
cloning-information (method).
group-by (generic function).
group-by-function (class).
group-by-result-range (class).
initialize-instance (method).
read-key (reader method).
bidirectional-group-by-proxy (class).
forward-group-by-proxy (class).
group-by-proxy (class).
random-access-group-by-proxy (class).
read-groups (reader method).
read-having (reader method).
read-transform (reader method).
cl-data-structures/algorithms/without.lispalgorithms (module).
aggregator-constructor (method).
apply-layer (method).
apply-layer (method).
cloning-information (method).
should-skip (method).
without (generic function).
wrap-chunk (method).
bidirectional-without-proxy (class).
forward-without-proxy (class).
read-predicate (reader method).
without-function (class).
without-proxy (class).
cl-data-structures/algorithms/multiplex.lispalgorithms (module).
across (method).
across-aggregate (method).
aggregator-constructor (method).
apply-layer (method).
clone (method).
cloning-information (method).
consume-front (method).
forward-multiplex-proxy (class).
multiplex (generic function).
peek-front (method).
read-function (reader method).
read-key (reader method).
reset! (method).
traverse (method).
access-current (reader method).
(setf access-current) (writer method).
multiplex-function (class).
multiplex-proxy (class).
read-initial-current (reader method).
cl-data-structures/algorithms/only.lispalgorithms (module).
aggregator-constructor (method).
apply-layer (method).
apply-layer (method).
cloning-information (method).
only (generic function).
should-skip (method).
wrap-chunk (method).
bidirectional-only-proxy (class).
forward-only-proxy (class).
only-function (class).
only-proxy (class).
read-predicate (reader method).
cl-data-structures/algorithms/only-different.lispalgorithms (module).
aggregator-constructor (method).
apply-layer (method).
cloning-information (method).
only-different (generic function).
reset! (method).
should-skip (method).
wrap-chunk (method).
access-previous (reader method).
(setf access-previous) (writer method).
access-previous-bound (reader method).
(setf access-previous-bound) (writer method).
forward-only-different-proxy (class).
only-different-function (class).
only-different-proxy (class).
read-comparsion (reader method).
read-initial-previous (reader method).
(setf read-initial-previous) (writer method).
read-initial-previous-bound (reader method).
(setf read-initial-previous-bound) (writer method).
cl-data-structures/algorithms/cartesian.lispalgorithms (module).
cartesian (function).
clone (method).
cloning-information (method).
consume-front (method).
peek-front (method).
read-function (reader method).
reset! (method).
deep-copy-of-content (function).
forward-cartesian-range (class).
read-content (reader method).
cl-data-structures/algorithms/restrain-size.lispalgorithms (module).
across (method).
aggregator-constructor (method).
apply-layer (method).
cloning-information (method).
consume-front (method).
peek-front (method).
reset! (method).
restrain-size (generic function).
traverse (method).
access-position (reader method).
(setf access-position) (writer method).
forward-restrain-size-proxy (class).
read-initial-position (reader method).
read-size (reader method).
restrain-size-function (class).
restrain-size-proxy (class).
cl-data-structures/algorithms/reservoir-sample.lispalgorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
make-reservoir-sampling (function).
reservoir-sample (generic function).
reservoir-sampling-push (function).
reservoir-sampling-result (reader).
(setf reservoir-sampling-result) (writer).
calculate-skip-count (function).
copy-reservoir-sampling (function).
gen-w (function).
list-of-slots (method).
make-reservoir-sampling* (function).
reservoir-sample-function (class).
reservoir-sampling (structure).
reservoir-sampling-p (function).
reservoir-sampling-sample-size (function).
reservoir-sampling-skip-count (reader).
(setf reservoir-sampling-skip-count) (writer).
reservoir-sampling-w (reader).
(setf reservoir-sampling-w) (writer).
cl-data-structures/algorithms/repeat.lispalgorithms (module).
across (method).
aggregator-constructor (method).
apply-layer (method).
clone (method).
consume-front (method).
peek-front (method).
reset! (method).
traverse (method).
access-position (reader method).
(setf access-position) (writer method).
forward-repeat-proxy (class).
read-initial-position (reader method).
read-times (reader method).
repeat-function (class).
repeat-proxy (class).
cl-data-structures/algorithms/latch.lispalgorithms (module).
across (method).
across-aggregate (method).
apply-layer (method).
clone (method).
consume-front (method).
latch (generic function).
peek-front (method).
reset! (method).
traverse (method).
forward-latch-proxy (class).
latch-function (class).
latch-proxy (class).
peek-or-consume (function).
read-latches (reader method).
(setf read-latches) (writer method).
cl-data-structures/algorithms/establish-special.lispalgorithms (module).
across (method).
aggregator-constructor (method).
apply-layer (method).
apply-layer (method).
apply-layer (method).
cloning-information (method).
establish-special (generic function).
read-key (reader method).
traverse (method).
bidirectional-establish-special-proxy-range (class).
establish-special-function (class).
establish-special-proxy (class).
forward-establish-special-proxy-range (class).
random-access-establish-special-proxy-range (class).
read-bindings (reader method).
cl-data-structures/algorithms/extrema.lispalgorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
extrema (generic function).
extrema-function (class).
cl-data-structures/algorithms/extremum.lispalgorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
extremum (generic function).
extremum-function (class).
cl-data-structures/algorithms/cumulative-accumulate.lispalgorithms (module).
across (method).
across-aggregate (method).
aggregator-constructor (method).
apply-layer (method).
clone (method).
cloning-information (method).
consume-front (method).
cumulative-accumulate (generic function).
cumulative-accumulate-range (class).
layer-aggregator-constructor (method).
peek-front (method).
read-function (reader method).
reset! (method).
traverse (method).
access-state (reader method).
(setf access-state) (writer method).
consume-impl (function).
cumulative-accumulate-function (class).
cumulative-state (class).
read-cumulative-key (reader method).
read-initial-state (reader method).
read-result (reader method).
cl-data-structures/algorithms/chain.lispalgorithms (module).
across (method).
at (method).
bidirectional-chain-of-ranges (class).
chain (function).
clone (method).
consume-back (method).
consume-front (method).
empty-clone (method).
forward-call (method).
forward-chain-of-ranges (class).
initialize-instance (method).
peek-back (method).
peek-front (method).
random-access-chain-of-ranges (class).
reset! (method).
size (method).
traverse (method).
init-chain-of-range (function).
read-content (reader method).
read-original-content (reader method).
cl-data-structures/algorithms/frequency.lispalgorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
frequency (generic function).
frequency-function (class).
cl-data-structures/algorithms/zip.lispalgorithms (module).
at (method).
at (method).
clone (method).
cloning-information (method).
cloning-information (method).
connect (function).
connect-traversable (function).
consume-back (method).
consume-back (method).
consume-front (method).
consume-front (method).
initialize-instance (method).
peek-back (method).
peek-back (method).
peek-front (method).
peek-front (method).
read-function (reader method).
reset! (method).
size (method).
zip (function).
zip-traversable (function).
bidirectional-connecting-range (class).
bidirectional-zipped-ranges (class).
chunkable-bidirectional-connecting-range (class).
chunkable-forward-connecting-range (class).
chunkable-random-access-connecting-range (class).
forward-connecting-range (class).
forward-zipped-ranges (class).
init-connected-ranges (function).
random-access-connecting-range (class).
random-access-zipped-ranges (class).
read-ranges (reader method).
zipping-mixin (class).
cl-data-structures/algorithms/flatten-lists.lispalgorithms (module).
across (method).
aggregator-constructor (method).
apply-layer (method).
cloning-information (method).
consume-front (method).
flatten-lists (generic function).
peek-front (method).
read-key (reader method).
reset! (method).
traverse (method).
access-current (reader method).
(setf access-current) (writer method).
flatten-lists-function (class).
flatten-proxy (class).
forward-flatten-proxy (class).
cl-data-structures/algorithms/partition-if.lispalgorithms (module).
across (method).
aggregator-constructor (method).
apply-layer (method).
clone (method).
consume-front (method).
layer-aggregator-constructor (method).
partition-if (generic function).
peek-front (method).
read-key (reader method).
reset! (method).
traverse (method).
abstract-partition-if-proxy (class).
access-collected (reader method).
(setf access-collected) (writer method).
forward-abstract-partition-if-proxy (class).
forward-partition-if-proxy (class).
partition-if-consume-implementation (function).
partition-if-function (class).
partition-if-proxy (class).
read-chunks (reader method).
read-on-first (reader method).
read-original-collected (reader method).
read-test (reader method).
cl-data-structures/algorithms/distinct.lispalgorithms (module).
across (method).
aggregator-constructor (method).
apply-layer (method).
clone (method).
cloning-information (method).
consume-front (method).
distinct (generic function).
drop-front (method).
layer-aggregator-constructor (method).
peek-front (method).
read-key (reader method).
reset! (method).
traverse (method).
distinct-function (class).
distinct-proxy (class).
forward-distinct-proxy (class).
read-original-seen (reader method).
read-seen (reader method).
replica-of-seen (function).
cl-data-structures/algorithms/first-element.lispalgorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
first-element (generic function).
last-element (generic function).
first-element-function (class).
last-element-function (class).
cl-data-structures/algorithms/in-batches.lispalgorithms (module).
aggregator-constructor (method).
apply-layer (method).
apply-layer (method).
apply-layer (method).
clone (method).
in-batches (generic function).
layer-aggregator-constructor (method).
abstract-in-batches-proxy (class).
bidirectional-in-batches-proxy (class).
forward-in-batches-proxy (class).
in-batches-function (class).
random-access-in-batches-proxy (class).
read-batch-size (reader method).
cl-data-structures/algorithms/sliding-window.lispalgorithms (module).
across (method).
aggregator-constructor (method).
apply-layer (method).
clone (method).
consume-front (method).
layer-aggregator-constructor (method).
reset! (method).
sliding-window (generic function).
traverse (method).
abstract-sliding-window-proxy (class).
access-current (reader method).
(setf access-current) (writer method).
access-tail (reader method).
(setf access-tail) (writer method).
access-window (reader method).
(setf access-window) (writer method).
forward-sliding-window-proxy (class).
read-initial-current-position (reader method).
read-initial-window (reader method).
read-window-size (reader method).
sliding-window-function (class).
cl-data-structures/algorithms/with-previous-element.lispalgorithms (module).
*previous-element* (special variable).
aggregator-constructor (method).
apply-layer (method).
apply-layer (method).
apply-layer (method).
apply-layer (method).
cloning-information (method).
read-key (reader method).
with-previous-element (generic function).
bidirectional-with-previous-element-proxy (class).
forward-with-previous-element-proxy (class).
random-access-with-previous-element-proxy (class).
with-previous-element-function (class).
with-previous-element-proxy (class).
cl-data-structures/file-system/package.lispfile-system (module).
cl-data-structures/file-system/common.lispfile-system (module).
access-current-position (reader method).
(setf access-current-position) (writer method).
access-reached-end (reader method).
(setf access-reached-end) (writer method).
across (method).
cloning-information (method).
close-inner-stream (generic function).
close-stream (function).
consume-front (method).
ensure-stream (function).
file-range-mixin (class).
initialize-instance (method).
open-stream-designator (method).
open-stream-designator (method).
read-path (reader method).
reset! (method).
stream-designator-p (generic function).
with-file-ranges (macro).
close-silence-errors (function).
enclose-finalizer (function).
read-initial-position (reader method).
read-stream (function).
set-stream-position (generic function).
stream-designator (type).
with-stream-input (macro).
cl-data-structures/file-system/line-by-line.lispfile-system (module).
across (method).
clone (method).
consume-front (method).
line-by-line (function).
peek-front (method).
reset! (method).
traverse (method).
access-lines-read (reader method).
(setf access-lines-read) (writer method).
line-by-line-range (class).
read-initial-lines-read (reader method).
set-stream-position (method).
cl-data-structures/file-system/tokenize.lispfile-system (module).
clone (method).
consume-front (method).
peek-front (method).
read-path (reader method).
tokenize (function).
traverse (method).
read-regex (reader method).
tokenizing-range (class).
cl-data-structures/file-system/find.lispfile-system (module).
clone (method).
cloning-information (method).
consume-front (method).
find (generic function).
make-instance (method).
make-instance (method).
make-instance (method).
make-instance (method).
make-instance (method).
peek-front (method).
read-path (reader method).
reset! (method).
access-initial-state (reader method).
(setf access-initial-state) (writer method).
access-prev-cell (reader method).
(setf access-prev-cell) (method).
(setf access-prev-cell) (method).
(setf access-prev-cell) (method).
(setf access-prev-cell) (method).
(setf access-prev-cell) (writer method).
access-stack (reader method).
(setf access-stack) (writer method).
access-state (reader method).
(setf access-state) (writer method).
all-files-file-range-stack-cell (class).
clone-cell (generic function).
clone-of-stack (function).
directory-content (function).
directory-file-range-stack-cell (class).
directory-regex-matches (function).
eat-cell (generic function).
file-file-range-stack-cell (class).
find-range (class).
fundamental-file-range-stack-cell (class).
make-stack-cell (generic function).
not-greater (function).
read-predicate (reader method).
read-times (reader method).
recursive-content-file-range-stack-cell (class).
regex-directory-file-range-stack-cell (class).
regex-file-file-range-stack-cell (class).
regex-matches (function).
reset-cell (generic function).
stateful-file-range-stack-cell (class).
times-matches (function).
to-pathname (function).
unmerge-pathnames (function).
cl-data-structures/file-system/unix.lispfile-system (module).
command (function).
command (class).
open-stream-designator (method).
print-object (method).
stream-designator-p (method).
read-command-string (reader method).
cl-data-structures/file-system/docstrings.lispfile-system (module).
cl-data-structures/threads/parallel-multiplex.lispthreads (module).
aggregator-constructor (method).
apply-layer (method).
cloning-information (method).
parallel-multiplex (generic function).
parallel-forward-multiplex-proxy (class).
parallel-multiplex-function (class).
read-chunk-size (reader method).
read-maximum-queue-size (reader method).
cl-data-structures/threads/parallel-group-by.lispthreads (module).
aggregator-constructor (method).
apply-layer (method).
apply-layer (method).
apply-layer (method).
apply-layer (method).
cloning-information (method).
initialize-instance (method).
parallel-group-by (generic function).
bidirectional-parallel-group-by-proxy (class).
forward-parallel-group-by-proxy (class).
parallel-group-by-function (class).
parallel-group-by-proxy (class).
random-access-parallel-group-by-proxy (class).
read-chunk-size (reader method).
read-groups (reader method).
read-having (reader method).
read-key (reader method).
read-maximum-queue-size (reader method).
read-transform (reader method).
cl-data-structures/threads/parallel-on-each.lispthreads (module).
aggregator-constructor (method).
apply-layer (method).
cloning-information (method).
parallel-on-each (generic function).
parallel-on-each-function (class).
parallel-on-each-proxy (class).
read-chunk-size (reader method).
read-maximum-queue-size (reader method).
cl-data-structures/threads/buffer-range.lispthreads (module).
aggregator-constructor (method).
apply-layer (method).
apply-layer (method).
apply-layer (method).
cloning-information (method).
thread-buffer (generic function).
bidirectional-buffer-range (class).
buffer-range (class).
forward-buffer-range (class).
random-access-buffer-range (class).
read-chunk-size (reader method).
read-maximum-queue-size (reader method).
thread-buffer-function (class).
cl-data-structures/math/absolute-value-norm.lispmath (module).
absolute-value-norm (generic function).
aggregator-constructor (method).
aggregator-constructor (method).
absolute-value-norm-function (class).
cl-data-structures/math/average.lispmath (module).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
array-average (generic function).
array-geometric-average (generic function).
array-harmonic-average (generic function).
average (generic function).
geometric-average (generic function).
harmonic-average (generic function).
array-average-function (class).
array-geometric-average-function (class).
array-harmonic-average-function (class).
average-function (class).
geometric-average-function (class).
harmonic-average-function (class).
cl-data-structures/math/variance.lispmath (module).
aggregator-constructor (method).
aggregator-constructor (method).
variance (generic function).
variance-function (class).
cl-data-structures/math/mutual-information.lispmath (module).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
harmonic-average-mutual-information (generic function).
mutual-information (generic function).
mutual-information-matrix (generic function).
optimal-split-point (generic function).
validate-field (method).
validate-field (method).
validate-field (method).
validate-field (method).
access-split-point (reader method).
(setf access-split-point) (writer method).
calculate-mutual-information (function).
calculate-mutual-information-between (function).
calculate-split-point (function).
continuesp (function).
define-all-validation-for-fields (macro).
discrete-form (function).
harmonic-average-mutual-information-function (class).
info-field (class).
initialize-field (function).
initialize-fields (function).
initialize-mutual-information-hash-tables (function).
initialize-split-point-field (function).
mutual-information-function (class).
mutual-information-hash-table (function).
mutual-information-matrix-function (class).
optimal-split-point-function (class).
partition-points (function).
read-data (reader method).
read-discrete (reader method).
read-discrete-values-set (reader method).
read-name (reader method).
read-original-data (reader method).
read-original-selector-function (reader method).
read-selector-function (reader method).
read-split-point-count (reader method).
read-test (reader method).
split-point-field (class).
cl-data-structures/math/simple-linear-regression.lispmath (module).
aggregator-constructor (method).
aggregator-constructor (method).
beta0 (reader method).
(setf beta0) (writer method).
beta1 (reader method).
(setf beta1) (writer method).
initialize-instance (method).
simple-linear-regression (generic function).
linear-regression-fit (class).
simple-linear-regression-function (class).
cl-data-structures/math/median-absolute-deviation.lispmath (module).
aggregator-constructor (method).
aggregator-constructor (method).
median-absolute-deviation (generic function).
median-absolute-deviation-function (class).
cl-data-structures/math/hodges-lehmann.lispmath (module).
aggregator-constructor (method).
aggregator-constructor (method).
hodges-lehmann-estimator (generic function).
calculate-hodges-lehmann-estimator (function).
hodges-lehmann-estimator-function (class).
cl-data-structures/math/co-occurence-table.lispmath (module).
aggregator-constructor (method).
aggregator-constructor (method).
co-occurence-table (generic function).
co-occurence-table-function (class).
cl-data-structures/math/standard-deviation.lispmath (module).
aggregator-constructor (method).
aggregator-constructor (method).
standard-deviation (generic function).
standard-deviation-function (class).
cl-data-structures/math/moments.lispmath (module).
aggregator-constructor (method).
aggregator-constructor (method).
moments (generic function).
moments-function (class).
cl-data-structures/math/bootstrap.lispmath (module).
aggregator-constructor (method).
apply-layer (method).
apply-layer (method).
apply-layer (method).
bootstrap (generic function).
cloning-information (method).
bidirectional-bootstrap-proxy (class).
bootstrap-function (class).
bootstrap-proxy (class).
forward-bootstrap-proxy (class).
random-access-bootstrap-proxy (class).
read-compare (reader method).
read-confidence (reader method).
read-context-function (reader method).
read-key (reader method).
read-parallel (reader method).
read-sample-size (reader method).
read-samples-count (reader method).
cl-data-structures/math/moving-average.lispmath (module).
across (method).
apply-layer (method).
cloning-information (method).
consume-front (method).
moving-average (generic function).
peek-front (method).
reset! (method).
traverse (method).
access-count (reader method).
(setf access-count) (writer method).
access-sum (reader method).
(setf access-sum) (writer method).
moving-average-function (class).
moving-average-range (class).
read-initial-count (reader method).
read-initial-sum (reader method).
read-key (reader method).
cl-data-structures/math/hmm.lispmath (module).
hidden-markov-model-generator (function).
check-probability-in-rows (function).
random-float (function).
sample-position (function).
cl-data-structures/math/gini-impurity.lispmath (module).
aggregator-constructor (method).
aggregator-constructor (method).
gini-impurity (generic function).
gini-impurity-function (class).
cl-data-structures/math/entropy.lispmath (module).
aggregator-constructor (method).
aggregator-constructor (method).
entropy (generic function).
entropy-function (class).
cl-data-structures/math/fast-map.lispmath (module).
aggregator-constructor (method).
aggregator-constructor (method).
fast-map (generic function).
fast-map-embeddings (function).
fast-map-function (class).
cl-data-structures/math/sum.lispmath (module).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
aggregator-constructor (method).
array-sum (generic function).
array-sum-function (class).
sum-function (class).
cl-data-structures/streaming-algorithms/hyperloglog.lispstreaming-algorithms (module).
add-hash (function).
cardinality (function).
intersection-cardinality (function).
jaccard (function).
new-sketch (function).
register (type).
sketch (type).
union (function).
+2q+ (constant).
+2r+ (constant).
+alpha+ (constant).
+c+ (constant).
+m+ (constant).
+max+ (constant).
+maxx+ (constant).
+p+ (constant).
+q+ (constant).
+r+ (constant).
approximated-expected-collisions (function).
beta (function).
expected-collisions (function).
hash-shifts (function).
hll-rank (function).
lz (function).
new-register (function).
reg-sum-and-zeroes (function).
cl-data-structures/streaming-algorithms/polynomial-hashing.lispstreaming-algorithms (module).
+max-64-bits+ (constant).
hash (type).
hash-array (type).
hashval (function).
hashval-no-depth (function).
make-hash-array (function).
+long-prime+ (constant).
cl-data-structures/streaming-algorithms/package.lispstreaming-algorithms (module).
cl-data-structures/streaming-algorithms/common.lispstreaming-algorithms (module).
clean-sketch (generic function).
cloning-information (method).
fundamental-data-sketch (class).
initialize-instance (method).
internal-array (generic reader).
union (generic function).
access-hash-fn (reader method).
(setf access-hash-fn) (writer method).
compatiblep (generic function).
cl-data-structures/streaming-algorithms/approximated-histogram.lispstreaming-algorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
approximated-histogram (generic function).
approximated-histogram (class).
approximated-histogram-add (function).
approximated-histogram-bin-count (reader).
(setf approximated-histogram-bin-count) (writer).
approximated-histogram-bin-position (function).
approximated-histogram-bin-sum (function).
approximated-histogram-bin-value (reader).
(setf approximated-histogram-bin-value) (writer).
approximated-histogram-bins (function).
approximated-histogram-bounds (function).
approximated-histogram-count (function).
approximated-histogram-count-lower (function).
approximated-histogram-counts (function).
approximated-histogram-cumulant-sum (function).
approximated-histogram-mean (function).
approximated-histogram-median (function).
approximated-histogram-quantile (function).
approximated-histogram-rank-order (function).
approximated-histogram-standard-deviation (function).
approximated-histogram-sum (function).
approximated-histogram-trim (function).
approximated-histogram-truncated-mean (function).
approximated-histogram-values (function).
approximated-histogram-variance (function).
at (method).
clean-sketch (method).
clone (method).
make-approximated-histogram (function).
print-object (method).
union (method).
access-bins (reader method).
(setf access-bins) (writer method).
access-count (reader method).
(setf access-count) (writer method).
access-fill-pointer (reader method).
(setf access-fill-pointer) (writer method).
access-max (reader method).
(setf access-max) (writer method).
access-min (reader method).
(setf access-min) (writer method).
approximated-histogram-bin (structure).
approximated-histogram-bin-clone (function).
approximated-histogram-bin-p (function).
approximated-histogram-function (class).
copy-approximated-histogram-bin (function).
make-approximated-histogram-bin (function).
maximal-bins-count (reader method).
read-max-bins (reader method).
cl-data-structures/streaming-algorithms/approximated-set-cardinality.lispstreaming-algorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
approximated-set-cardinality (generic function).
approximated-set-cardinality (class).
clean-sketch (method).
clone (method).
cloning-information (method).
hyperloglog-jaccard (function).
initialize-instance (method).
internal-array (reader method).
union (method).
value (method).
access-registers (reader method).
(setf access-registers) (writer method).
approximated-set-cardinality-function (class).
compatiblep (method).
cl-data-structures/streaming-algorithms/approximated-counts.lispstreaming-algorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
approximated-counts (generic function).
approximated-counts (class).
approximated-counts-distance (function).
at (method).
clean-sketch (method).
clone (method).
cloning-information (method).
initialize-instance (method).
internal-array (reader method).
union (method).
access-counters (reader method).
(setf access-counters) (writer method).
access-depth (reader method).
(setf access-depth) (writer method).
access-hashes (reader method).
(setf access-hashes) (writer method).
access-width (reader method).
(setf access-width) (writer method).
approximated-counts-function (class).
compatiblep (method).
update-count-min-sketch (function).
cl-data-structures/streaming-algorithms/approximated-top-k.lispstreaming-algorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
approximated-top-k (generic function).
approximated-top-k-function (class).
move-updated (function).
cl-data-structures/streaming-algorithms/bloom-filter.lispstreaming-algorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
at (method).
bloom-filter (generic function).
bloom-filter (class).
clean-sketch (method).
clone (method).
cloning-information (method).
initialize-instance (method).
internal-array (reader method).
union (method).
access-counters (reader method).
(setf access-counters) (writer method).
access-depth (reader method).
(setf access-depth) (writer method).
access-hashes (reader method).
(setf access-hashes) (writer method).
access-width (reader method).
(setf access-width) (writer method).
bloom-filter-function (class).
compatiblep (method).
cl-data-structures/streaming-algorithms/minhash.lispstreaming-algorithms (module).
aggregator-constructor (method).
aggregator-constructor (method).
clone (method).
clone (method).
gather-minhash-corpus (generic function).
make-minhash (function).
make-one-bit-minhash (function).
minhash (generic function).
minhash-jaccard/double-float (function).
minhash-jaccard/fixnum (function).
minhash-jaccard/single-float (function).
one-bit-minhash-jaccard/double-float (function).
one-bit-minhash-jaccard/fixnum (function).
one-bit-minhash-jaccard/single-float (function).
callback-minhash (class).
fundamental-minhash (class).
gather-corpus-function (class).
list-of-slots (method).
minhash-corpus (class).
minhash-corpus-hash-value (generic function).
minhash-corpus-minhash (function).
one-bit-minhash (class).
polynomial-callback-minhash (class).
polynomial-callback-one-bit-minhash (class).
read-hash-array (reader method).
read-hash-function (reader method).
read-k (reader method).
read-seeds (reader method).
read-table (reader method).
read-xors (reader method).
seeds-callback-minhash (class).
seeds-callback-one-bit-minhash (class).
xors-callback-minhash (class).
xors-callback-one-bit-minhash (class).
cl-data-structures/streaming-algorithms/docstrings.lispstreaming-algorithms (module).
Packages are listed by definition order.
cl-data-structures.common.2-3-treecl-data-structures.queues.2-3-treecl-data-structures.streaming-algorithmscl-data-structures.fancycl-data-structures.metacl-data-structures.dictscl-data-structures.sets.qp-triecl-data-structures.metric-spacecl-data-structures.dicts.skip-listcl-data-structures.mathcl-data-structures.common.hamtcl-data-structures.common.rrbcl-data-structures.commoncl-data-structures.common.egnatcl-data-structures.setscl-data-structures.utilscl-data-structures.file-systemcl-data-structures.metric-space.egnatcl-data-structures.dicts.srrbcl-data-structures.adapterscl-data-structures.common.qp-triecl-data-structures.common.abstractcl-data-structurescl-data-structures.common.skip-listcl-data-structures.compositecl-data-structures.threadscl-data-structures.dicts.hamtcl-data-structures.algorithms.metacl-data-structures.sequencescl-data-structures.queuescl-data-structures.aux-packagecl-data-structures.algorithmscl-data-structures.sets.skip-listcl-data-structures.streaming-algorithms.polynomial-hashingcl-data-structures.sequences.rrb-vectorcl-data-structures.streaming-algorithms.hyperloglogcl-data-structures.common.2-3-treecl-ds.common.2-3
cl-data-structures.aux-package.
common-lisp.
2-node (class).
3-node (class).
access-left (generic reader).
(setf access-left) (generic writer).
access-middle (generic reader).
(setf access-middle) (generic writer).
access-right (generic reader).
(setf access-right) (generic writer).
access-root (generic reader).
(setf access-root) (generic writer).
delete-back-from-tree (function).
delete-back-from-tree! (function).
insert-front-into-tree (function).
insert-front-into-tree! (function).
node (class).
transactional-delete-back-from-tree! (function).
transactional-insert-front-into-tree! (function).
tree (class).
delete-back (generic function).
delete-back! (generic function).
insert-front (generic function).
insert-front! (generic function).
tagged-2-node (class).
tagged-3-node (class).
tagged-tree (class).
take-back (generic function).
transactional-delete-back! (generic function).
transactional-insert-front! (generic function).
cl-data-structures.queues.2-3-treecl-ds.queues.2-3-tree
cl-data-structures.aux-package.
common-lisp.
fixed-capacity-synchronized-mutable-2-3-queue (class).
fixed-capacity-synchronized-transactional-2-3-queue (class).
functional-2-3-queue (class).
make-functional-2-3-queue (function).
make-mutable-2-3-queue (function).
make-synchronized-mutable-2-3-queue (function).
make-synchronized-transactional-2-3-queue (function).
make-transactional-2-3-queue (function).
mutable-2-3-queue (class).
synchronized-mutable-2-3-queue (class).
synchronized-transactional-2-3-queue (class).
transactional-2-3-queue (class).
+buffer-size+ (constant).
2-3-queue (class).
2-3-queue-range (class).
access-container (generic reader).
(setf access-container) (generic writer).
access-head (generic reader).
(setf access-head) (generic writer).
access-head-position (generic reader).
(setf access-head-position) (generic writer).
access-og-container (generic reader).
(setf access-og-container) (generic writer).
access-tail (generic reader).
(setf access-tail) (generic writer).
access-tail-end (generic reader).
(setf access-tail-end) (generic writer).
access-tail-position (generic reader).
(setf access-tail-position) (generic writer).
across/traverse (function).
buffer-index (type).
copy-array-if-not-nil (function).
fixed-capacity-synchronization-mixin (class).
mutable-from-traversable (function).
queue-buffer (type).
read-capacity (generic reader).
read-element-type (generic reader).
read-lock (generic reader).
read-mutex (generic reader).
read-notify-pop (generic reader).
read-notify-push (generic reader).
synchronization-mixin (class).
synchronization-primitives-mixin (class).
cl-data-structures.streaming-algorithmscl-ds.sa
cl-data-structures.aux-package.
common-lisp.
approximated-counts (generic function).
approximated-counts (class).
approximated-counts-distance (function).
approximated-histogram (generic function).
approximated-histogram (class).
approximated-histogram-add (function).
approximated-histogram-bin-count (reader).
(setf approximated-histogram-bin-count) (writer).
approximated-histogram-bin-position (function).
approximated-histogram-bin-sum (function).
approximated-histogram-bin-value (reader).
(setf approximated-histogram-bin-value) (writer).
approximated-histogram-bins (function).
approximated-histogram-bounds (function).
approximated-histogram-count (function).
approximated-histogram-count-lower (function).
approximated-histogram-counts (function).
approximated-histogram-cumulant-sum (function).
approximated-histogram-mean (function).
approximated-histogram-median (function).
approximated-histogram-quantile (function).
approximated-histogram-rank-order (function).
approximated-histogram-standard-deviation (function).
approximated-histogram-sum (function).
approximated-histogram-trim (function).
approximated-histogram-truncated-mean (function).
approximated-histogram-values (function).
approximated-histogram-variance (function).
approximated-set-cardinality (generic function).
approximated-set-cardinality (class).
approximated-top-k (generic function).
bloom-filter (generic function).
bloom-filter (class).
clean-sketch (generic function).
fundamental-data-sketch (class).
gather-minhash-corpus (generic function).
hyperloglog-jaccard (function).
internal-array (generic reader).
make-approximated-histogram (function).
make-minhash (function).
make-one-bit-minhash (function).
minhash (generic function).
minhash-jaccard/double-float (function).
minhash-jaccard/fixnum (function).
minhash-jaccard/single-float (function).
one-bit-minhash-jaccard/double-float (function).
one-bit-minhash-jaccard/fixnum (function).
one-bit-minhash-jaccard/single-float (function).
union (generic function).
access-bins (generic reader).
(setf access-bins) (generic writer).
access-count (generic reader).
(setf access-count) (generic writer).
access-counters (generic reader).
(setf access-counters) (generic writer).
access-depth (generic reader).
(setf access-depth) (generic writer).
access-fill-pointer (generic reader).
(setf access-fill-pointer) (generic writer).
access-hash-fn (generic reader).
(setf access-hash-fn) (generic writer).
access-hashes (generic reader).
(setf access-hashes) (generic writer).
access-max (generic reader).
(setf access-max) (generic writer).
access-min (generic reader).
(setf access-min) (generic writer).
access-registers (generic reader).
(setf access-registers) (generic writer).
access-width (generic reader).
(setf access-width) (generic writer).
approximated-counts-function (class).
approximated-histogram-bin (structure).
approximated-histogram-bin-clone (function).
approximated-histogram-bin-p (function).
approximated-histogram-function (class).
approximated-set-cardinality-function (class).
approximated-top-k-function (class).
bloom-filter-function (class).
callback-minhash (class).
compatiblep (generic function).
copy-approximated-histogram-bin (function).
fundamental-minhash (class).
gather-corpus-function (class).
make-approximated-histogram-bin (function).
maximal-bins-count (generic reader).
minhash-corpus (class).
minhash-corpus-hash-value (generic function).
minhash-corpus-minhash (function).
move-updated (function).
one-bit-minhash (class).
polynomial-callback-minhash (class).
polynomial-callback-one-bit-minhash (class).
read-hash-array (generic reader).
read-hash-function (generic reader).
read-k (generic reader).
read-max-bins (generic reader).
read-seeds (generic reader).
read-table (generic reader).
read-xors (generic reader).
seeds-callback-minhash (class).
seeds-callback-one-bit-minhash (class).
update-count-min-sketch (function).
xors-callback-minhash (class).
xors-callback-one-bit-minhash (class).
cl-data-structures.metacl-ds.meta
cl-data-structures.aux-package.
common-lisp.
add!-function (class).
add-function (class).
alter-bucket (generic function).
alter-bucket! (generic function).
destructive-counterpart (generic function).
destructive-function (class).
erase!-function (class).
erase*!-function (class).
erase*-function (class).
erase-function (class).
erase-if!-function (class).
erase-if-function (class).
fresh-bucket-status (generic function).
functional-add-function (class).
functional-counterpart (generic function).
functional-erase-function (class).
functional-erase-if-function (class).
functional-function (class).
functional-insert-function (class).
functional-put-back-function (class).
functional-put-front-function (class).
functional-put-function (class).
functional-take-out-back-function (class).
functional-take-out-front-function (class).
functional-take-out-function (class).
functional-update-function (class).
functional-update-if-function (class).
grow-function (class).
insert!-function (class).
insert-function (class).
make-bucket (generic function).
make-bucket-from-multiple (generic function).
map-bucket (generic function).
null-bucket (constant).
null-bucket-p (function).
pass-bucket-operation (generic function).
pass-bucket-query (generic function).
position-modification (generic function).
put!-function (class).
put-back!-function (class).
put-front!-function (class).
put-function (class).
shrink-function (class).
take-out!-function (class).
take-out-back!-function (class).
take-out-front!-function (class).
take-out-function (class).
update!-function (class).
update-function (class).
update-if!-function (class).
update-if-function (class).
put-back-function (class).
put-front-function (class).
take-out-back-function (class).
take-out-front-function (class).
cl-data-structures.dictscl-ds.dicts
cl-data-structures.aux-package.
common-lisp.
functional-dictionary (class).
functional-hashing-dictionary (class).
functional-sparse-vector (class).
fundamental-dictionary (class).
fundamental-hashing-dictionary (class).
fundamental-sparse-vector (class).
lazy-dictionary (class).
lazy-hashing-dictionary (class).
mutable-dictionary (class).
mutable-hashing-dictionary (class).
mutable-sparse-vector (class).
read-equal-fn (generic reader).
read-hash-fn (generic reader).
transactional-dictionary (class).
transactional-hashing-dictionary (class).
transactional-sparse-vector (class).
lazy-box-dictionary (class).
cl-data-structures.sets.qp-triecl-ds.sets.qp-trie
cl-data-structures.aux-package.
common-lisp.
empty-array-key (condition).
fundamental-qp-trie-set (class).
make-mutable-qp-trie-set (function).
mutable-qp-trie-set (class).
depth (generic reader).
end (generic reader).
initial-stack (generic reader).
more-checks-end (generic reader).
more-checks-start (generic reader).
new-cell (function).
node (generic reader).
obtain-value (function).
parents (generic reader).
qp-trie-range-stack-cell (class).
qp-trie-set-range (class).
stack (generic reader).
(setf stack) (generic writer).
start (generic reader).
cl-data-structures.metric-spacecl-ds.ms
cl-data-structures.aux-package.
common-lisp.
distance (generic function).
metric-space-dictionary (class).
metric-space-set (class).
mutable-metric-space-dictionary (class).
mutable-metric-space-set (class).
read-metric-fn (generic reader).
cl-data-structures.dicts.skip-listcl-ds.dicts.skip-list
make-mutable-skip-list-dictionary (function).
mutable-skip-list-dictionary (class).
mutable-skip-list-dictionary-range (class).
cl-data-structures.mathcl-ds.math
cl-data-structures.aux-package.
common-lisp.
absolute-value-norm (generic function).
array-average (generic function).
array-geometric-average (generic function).
array-harmonic-average (generic function).
array-sum (generic function).
average (generic function).
beta0 (generic reader).
(setf beta0) (generic writer).
beta1 (generic reader).
(setf beta1) (generic writer).
bootstrap (generic function).
co-occurence-table (generic function).
entropy (generic function).
fast-map (generic function).
geometric-average (generic function).
gini-impurity (generic function).
harmonic-average (generic function).
harmonic-average-mutual-information (generic function).
hidden-markov-model-generator (function).
hodges-lehmann-estimator (generic function).
median-absolute-deviation (generic function).
moments (generic function).
moving-average (generic function).
mutual-information (generic function).
mutual-information-matrix (generic function).
optimal-split-point (generic function).
simple-linear-regression (generic function).
standard-deviation (generic function).
variance (generic function).
absolute-value-norm-function (class).
access-count (generic reader).
(setf access-count) (generic writer).
access-split-point (generic reader).
(setf access-split-point) (generic writer).
access-sum (generic reader).
(setf access-sum) (generic writer).
array-average-function (class).
array-geometric-average-function (class).
array-harmonic-average-function (class).
array-sum-function (class).
average-function (class).
bidirectional-bootstrap-proxy (class).
bootstrap-function (class).
bootstrap-proxy (class).
calculate-hodges-lehmann-estimator (function).
calculate-mutual-information (function).
calculate-mutual-information-between (function).
calculate-split-point (function).
check-probability-in-rows (function).
co-occurence-table-function (class).
continuesp (function).
define-all-validation-for-fields (macro).
discrete-form (function).
entropy-function (class).
fast-map-embeddings (function).
fast-map-function (class).
forward-bootstrap-proxy (class).
geometric-average-function (class).
gini-impurity-function (class).
harmonic-average-function (class).
harmonic-average-mutual-information-function (class).
hodges-lehmann-estimator-function (class).
info-field (class).
initialize-field (function).
initialize-fields (function).
initialize-mutual-information-hash-tables (function).
initialize-split-point-field (function).
linear-regression-fit (class).
median-absolute-deviation-function (class).
moments-function (class).
moving-average-function (class).
moving-average-range (class).
mutual-information-function (class).
mutual-information-hash-table (function).
mutual-information-matrix-function (class).
optimal-split-point-function (class).
partition-points (function).
random-access-bootstrap-proxy (class).
random-float (function).
read-compare (generic reader).
read-confidence (generic reader).
read-context-function (generic reader).
read-data (generic reader).
read-discrete (generic reader).
read-discrete-values-set (generic reader).
read-initial-count (generic reader).
read-initial-sum (generic reader).
read-key (generic reader).
read-name (generic reader).
read-original-data (generic reader).
read-original-selector-function (generic reader).
read-parallel (generic reader).
read-sample-size (generic reader).
read-samples-count (generic reader).
read-selector-function (generic reader).
read-split-point-count (generic reader).
read-test (generic reader).
sample-position (function).
simple-linear-regression-function (class).
split-point-field (class).
standard-deviation-function (class).
sum-function (class).
variance-function (class).
cl-data-structures.common.hamtcl-ds.common.hamt
cl-data-structures.aux-package.
cl-data-structures.common.abstract.
common-lisp.
+depth+ (constant).
+hash-level+ (constant).
+maximum-children-count+ (constant).
access-root (generic reader).
(setf access-root) (generic writer).
access-size (generic reader).
(setf access-size) (generic writer).
build-node (function).
build-rehashed-node (function).
copy-node (function).
copy-on-write (function).
get-range-key-function (generic function).
go-down-on-path (function).
hamt-container (class).
hash-do (macro).
hash-node-access (function).
hash-node-contains (function).
hash-node-contains-node (function).
hash-node-content (function).
(setf hash-node-content) (function).
hash-node-deep-copy (function).
hash-node-insert! (function).
hash-node-insert-into-copy (function).
hash-node-p (function).
hash-node-remove! (function).
hash-node-remove-from-the-copy (function).
hash-node-replace! (function).
hash-node-replace-in-the-copy (function).
hash-node-size (function).
hash-node-size (type).
hash-node-to-masked-index (function).
hash-node-whole-mask (function).
new-cell (function).
obtain-value (function).
rebuild-rehashed-node (function).
rehash (function).
transactional-copy-on-write (function).
with-destructive-erase-hamt (macro).
with-hamt-path (macro).
with-hash-tree-functions (macro).
copy-hamt-range-stack-cell (function).
copy-hash-node-tagged (function).
copy-hash-node-untagged (function).
forward-cell (function).
full-bucket-p (function).
hamt-range-stack-cell (structure).
hamt-range-stack-cell-end (reader).
(setf hamt-range-stack-cell-end) (writer).
hamt-range-stack-cell-node (reader).
(setf hamt-range-stack-cell-node) (writer).
hamt-range-stack-cell-p (function).
hamt-range-stack-cell-start (reader).
(setf hamt-range-stack-cell-start) (writer).
hash-mask (type).
hash-node (type).
hash-node-index (type).
hash-node-node-mask (function).
(setf hash-node-node-mask) (function).
hash-node-tagged (structure).
hash-node-tagged-content (reader).
(setf hash-node-tagged-content) (writer).
hash-node-tagged-node-mask (reader).
(setf hash-node-tagged-node-mask) (writer).
hash-node-tagged-ownership-tag (function).
(setf hash-node-tagged-ownership-tag) (function).
hash-node-tagged-p (function).
hash-node-untagged (structure).
hash-node-untagged-content (reader).
(setf hash-node-untagged-content) (writer).
hash-node-untagged-node-mask (reader).
(setf hash-node-untagged-node-mask) (writer).
hash-node-untagged-p (function).
index-path (type).
make-hamt-range-stack-cell (function).
make-hash-node (function).
make-hash-node-tagged (function).
make-hash-node-untagged (function).
node-path (type).
read-bucket-size (generic reader).
round-size (function).
set-in-node-mask (function).
cl-data-structures.common.rrbcl-ds.common.rrb
cl-data-structures.aux-package.
cl-data-structures.common.abstract.
common-lisp.
+bit-count+ (constant).
+maximal-shift+ (constant).
+maximum-children-count+ (constant).
+tail-mask+ (constant).
access-last-size (generic reader).
(setf access-last-size) (generic writer).
access-lower-bound (generic reader).
(setf access-lower-bound) (generic writer).
access-root (generic reader).
(setf access-root) (generic writer).
access-shift (generic reader).
(setf access-shift) (generic writer).
access-size (generic reader).
(setf access-size) (generic writer).
access-start (generic reader).
(setf access-start) (generic writer).
access-tail (generic reader).
(setf access-tail) (generic writer).
access-tail-size (generic reader).
(setf access-tail-size) (generic writer).
access-upper-bound (generic reader).
(setf access-upper-bound) (generic writer).
copy-on-write (function).
deep-copy-sparse-rrb-node (function).
descend-into-tree (function).
destructive-write (function).
fill-sparse-rrb-node-with-new (function).
insert-tail (function).
make-node-content (function).
make-rrb-node (function).
make-sparse-rrb-node (function).
node-content (type).
node-size (type).
nref (function).
(setf nref) (function).
read-element-type (generic reader).
remove-tail (function).
rrb-at (function).
rrb-container (class).
rrb-index (type).
rrb-node (type).
rrb-node-content (function).
rrb-node-position (type).
rrb-node-push! (function).
rrb-node-push-into-copy (function).
rrb-range (class).
shift (type).
sparse-nref (function).
(setf sparse-nref) (function).
sparse-rrb-mask (type).
sparse-rrb-node (type).
sparse-rrb-node-bitmask (function).
(setf sparse-rrb-node-bitmask) (function).
sparse-rrb-node-contains (function).
sparse-rrb-node-content (function).
(setf sparse-rrb-node-content) (function).
sparse-rrb-node-erase (function).
sparse-rrb-node-erase! (function).
sparse-rrb-node-size (function).
sparse-rrb-node-tagged (structure).
sparse-rrb-node-untagged (structure).
sparse-rrb-tree-map (function).
sparse-rrb-tree-size (function).
transactional-copy-on-write (function).
with-sparse-rrb-node (macro).
with-sparse-rrb-node-path (macro).
access-container (generic reader).
(setf access-container) (generic writer).
acquire-path (function).
chunked-rrb-range (class).
copy-sparse-rrb-node-tagged (function).
copy-sparse-rrb-node-untagged (function).
fill-sparse-rrb-node-without (function).
init-rrb (function).
make-sparse-rrb-node-tagged (function).
make-sparse-rrb-node-untagged (function).
mutable-rrb-range (class).
push-into-copy-of-tail (function).
push-into-tail! (function).
read-content (generic reader).
read-initial-lower-bound (generic reader).
read-initial-upper-bound (generic reader).
read-mutex (generic reader).
read-rrb-range (generic reader).
read-vectors-in-chunk (generic reader).
rrb-indexes (type).
rrb-node-deep-copy (function).
rrb-node-pop! (function).
rrb-node-pop-in-the-copy (function).
rrb-path (type).
sparse-rrb-node-tagged-bitmask (reader).
(setf sparse-rrb-node-tagged-bitmask) (writer).
sparse-rrb-node-tagged-content (reader).
(setf sparse-rrb-node-tagged-content) (writer).
sparse-rrb-node-tagged-ownership-tag (function).
(setf sparse-rrb-node-tagged-ownership-tag) (function).
sparse-rrb-node-tagged-p (function).
sparse-rrb-node-untagged-bitmask (reader).
(setf sparse-rrb-node-untagged-bitmask) (writer).
sparse-rrb-node-untagged-content (reader).
(setf sparse-rrb-node-untagged-content) (writer).
sparse-rrb-node-untagged-p (function).
tail-offset (function).
cl-data-structures.commoncl-ds.common
cl-data-structures.aux-package.
common-lisp.
access-content (generic reader).
(setf access-content) (generic writer).
assignable-forward-tree-range (class).
defmethod-with-peek-stack (macro).
defmethod-with-stack (macro).
dict-content (structure).
dict-content-location (reader).
(setf dict-content-location) (writer).
dict-content-value (reader).
(setf dict-content-value) (writer).
eager-modification-operation-status (class).
empty-changed-eager-modification-operation-status (symbol macro).
empty-eager-modification-operation-status (symbol macro).
force-version (function).
forward-tree-range (class).
hash-content-hash (reader).
(setf hash-content-hash) (writer).
hash-content-location (reader).
(setf hash-content-location) (writer).
hash-dict-content-value (reader).
(setf hash-dict-content-value) (writer).
lazy-bidirectional-range (class).
lazy-box-container (class).
lazy-random-access-range (class).
make-dict-content (function).
make-eager-modification-operation-status (function).
make-hash-content (function).
make-hash-dict-content (function).
make-lazy-range (macro).
read-found (generic reader).
read-store-value (generic reader).
read-value (generic reader).
sequence-window (generic function).
sequence-window (class).
single-element-p (function).
access-current-index (generic reader).
(setf access-current-index) (generic writer).
access-eager-status (generic reader).
(setf access-eager-status) (generic writer).
access-forward-stack (generic reader).
(setf access-forward-stack) (generic writer).
access-initial-to (generic reader).
(setf access-initial-to) (generic writer).
access-operations (generic reader).
(setf access-operations) (generic writer).
add-change (function).
box-container (class).
changes (structure).
changes-content (reader).
(setf changes-content) (writer).
changes-end-index (reader).
(setf changes-end-index) (writer).
changes-p (function).
changes-parent (reader).
(setf changes-parent) (writer).
changes-unique (reader).
(setf changes-unique) (writer).
copy-changes (function).
copy-dict-content (function).
copy-hash-content (function).
copy-hash-dict-content (function).
dict-content-p (function).
effective-at (generic function).
execute-changes (function).
force-lazy-range (function).
hash-content (structure).
hash-content-p (function).
hash-dict-content (structure).
hash-dict-content-hash (function).
(setf hash-dict-content-hash) (function).
hash-dict-content-location (function).
(setf hash-dict-content-location) (function).
hash-dict-content-p (function).
implementation-modification-operation-status (class).
lazy-forward-range (class).
lazy-modification-operation-status (class).
lazy-range (class).
list-sequence-window (class).
make-changes (function).
random-access-sequence-window (class).
read-changed (generic reader).
read-container (generic reader).
read-content (generic reader).
read-from (generic reader).
read-implementation (function).
read-initial-stack (generic reader).
read-key (generic reader).
read-lazy-instance (generic reader).
read-obtain-value (generic reader).
read-range (generic reader).
read-to (generic reader).
vector-sequence-window (class).
write-changed (generic writer).
write-found (generic writer).
write-lazy-instance (generic writer).
write-value (generic writer).
cl-data-structures.common.egnatcl-ds.common.egnat
cl-data-structures.aux-package.
common-lisp.
access-root (generic reader).
(setf access-root) (generic writer).
access-size (generic reader).
(setf access-size) (generic writer).
distance (generic function).
fundamental-egnat-container (class).
make-egnat-tree (function).
mutable-egnat-container (class).
prune-subtrees (function).
read-margin (generic reader).
read-near (generic reader).
select-children (generic function).
traverse-impl (function).
access-close-range (generic reader).
(setf access-close-range) (generic writer).
access-distant-range (generic reader).
(setf access-distant-range) (generic writer).
access-stack (generic reader).
(setf access-stack) (generic writer).
add-children-to-stack (function).
assign-children (function).
average-pairwise-distance (function).
become-subtree (function).
become-subtree* (generic function).
calculate-distances (function).
closest-node (function).
collect-buckets (function).
egnat-grow! (function).
egnat-node (class).
egnat-range (class).
egnat-range-around (class).
egnat-subtree (class).
front-body (macro).
make-children-vector (function).
make-content-vector (function).
make-partitions (function).
make-ranges (function).
next-elements (generic function).
node-children-full-p (function).
node-full-p (function).
node-head (function).
position-to-value (function).
push-content (function).
read-branching-factor (generic reader).
read-children (generic reader).
read-close-range (generic reader).
read-container (generic reader).
read-content (generic reader).
read-content-count-in-node (generic reader).
read-distant-range (generic reader).
read-initial-stack (generic reader).
read-metric-type (generic reader).
read-samples-count (generic reader).
recursive-egnat-grow! (function).
recursive-egnat-grow!* (generic function).
select-best-seeds (function).
select-seeds (function).
traverse-body (macro).
update-ranges! (function).
visit-every-bucket (function).
cl-data-structures.setscl-ds.sets
cl-data-structures.aux-package.
common-lisp.
fundamental-set (class).
mutable-set (class).
cl-data-structures.utilscl-ds.utils
cl-data-structures.aux-package.
common-lisp.
add-into-queue (generic function).
add-sinks (generic function).
add-to-list (function).
adjust-size-to-fill-pointer (function).
all-parents (function).
ancestor-p (function).
and* (function).
as-cons-tree (function).
binary-search (function).
bind-lambda (macro).
bucket-sort (function).
cartesian (function).
cartesian-table (function).
cases (macro).
check-value (macro).
clone (function).
cloning-information (generic function).
cloning-list (function).
cond+ (macro).
cond-compare (macro).
copy-slots (macro).
copy-without (function).
cycle-over-address (function).
define-list-of-slots (macro).
draw-random-vector (function).
draw-sample-vector (function).
each-in-matrix (generic function).
end-execution (generic function).
ensure-call-ahead-of (function).
erase-from-vector (function).
extendable-vector (type).
fill-distance-matrix-from-vector (function).
fixnum-hash (function).
future-carousel (class).
generator (function).
half-matrix (class).
hash-integer (function).
homogenousp (function).
if-else (function).
ignore-errors* (function).
import-all-package-symbols (macro).
index (type).
insert-or-replace (function).
inverted-hash-table (function).
lambda-list-to-bindings (function).
lambda-list-to-call-form (function).
lazy-let (macro).
lazy-shuffle (function).
let-generator (macro).
lexicographic-compare (function).
lolol (macro).
lower-bound (function).
lparallel-future (macro).
make-distance-matrix-from-vector (function).
make-future-carousel (function).
make-half-matrix (function).
make-pipe-fragment (function).
merge-ordered-vectors (function).
method-lambda-list-to-function-lambda-list (function).
mref (function).
(setf mref) (function).
mutate-matrix (generic function).
normalize-sequence-to-span (function).
normalize-sequence-to-sum (function).
on-ordered-intersection (function).
optimize-value (macro).
or* (function).
ordered-exclusion (function).
ordered-intersection (function).
ordered-p (function).
parallel-fill-distance-matrix-from-vector (function).
parallel-make-distance-matrix-from-vector (function).
pipe-fragment (class).
pop-last (function).
prevent-duplicates (function).
quasi-clone (function).
quasi-clone* (macro).
read-size (generic reader).
remove-fill-pointer (function).
rol64 (function).
scan (function).
select-top (function).
square (function).
start-execution (generic function).
swap-if (function).
swapop (function).
todo (symbol macro).
transform (function).
try-find (function).
try-find-cell (function).
try-remove (function).
unfold-table (function).
with-keys (macro).
with-rebind (macro).
with-slots-for (macro).
with-vectors (macro).
xorshift (function).
access-index (generic reader).
(setf access-index) (generic writer).
bourgain-embedding (function).
build-setf-form (function).
circular-shift (function).
circular-shift-left (function).
circular-shift-right (function).
cycle-rotate (function).
distance (function).
(setf distance) (function).
every-possible-combination (function).
generate-if-else (function).
highest-leader (function).
in-shuffle-array (function).
index-in-content-of-distance-matrix (function).
inverse-in-shuffle-array (function).
list-of-slots (generic function).
macro-with-dynamic-vars (macro).
next-index (function).
quasi-clone-other-class (function).
quasi-clone-other-class* (macro).
read-content (generic reader).
read-end-on-empty (generic reader).
read-function (generic reader).
read-key (generic reader).
read-new-value (function).
read-operation (generic reader).
read-queue (generic reader).
read-sinks (generic reader).
read-sinks-lock (generic reader).
read-thread (generic reader).
read-vector (generic reader).
splitmix64 (function).
toggle-vars (macro).
xoshiro256** (function).
cl-data-structures.file-systemcl-ds.fs
cl-data-structures.aux-package.
common-lisp.
access-current-position (generic reader).
(setf access-current-position) (generic writer).
access-reached-end (generic reader).
(setf access-reached-end) (generic writer).
close-inner-stream (generic function).
close-stream (function).
command (function).
command (class).
ensure-stream (function).
file-range-mixin (class).
find (generic function).
line-by-line (function).
open-stream-designator (generic function).
read-path (generic reader).
stream-designator-p (generic function).
tokenize (function).
with-file-ranges (macro).
access-initial-state (generic reader).
(setf access-initial-state) (generic writer).
access-lines-read (generic reader).
(setf access-lines-read) (generic writer).
access-prev-cell (generic reader).
(setf access-prev-cell) (generic function).
access-stack (generic reader).
(setf access-stack) (generic writer).
access-state (generic reader).
(setf access-state) (generic writer).
all-files-file-range-stack-cell (class).
clone-cell (generic function).
clone-of-stack (function).
close-silence-errors (function).
directory-content (function).
directory-file-range-stack-cell (class).
directory-regex-matches (function).
eat-cell (generic function).
enclose-finalizer (function).
file-file-range-stack-cell (class).
find-range (class).
fundamental-file-range-stack-cell (class).
line-by-line-range (class).
make-stack-cell (generic function).
not-greater (function).
read-command-string (generic reader).
read-initial-lines-read (generic reader).
read-initial-position (generic reader).
read-predicate (generic reader).
read-regex (generic reader).
read-stream (function).
read-times (generic reader).
recursive-content-file-range-stack-cell (class).
regex-directory-file-range-stack-cell (class).
regex-file-file-range-stack-cell (class).
regex-matches (function).
reset-cell (generic function).
set-stream-position (generic function).
stateful-file-range-stack-cell (class).
stream-designator (type).
times-matches (function).
to-pathname (function).
tokenizing-range (class).
unmerge-pathnames (function).
with-stream-input (macro).
cl-data-structures.metric-space.egnatcl-ds.ms.egnat
cl-data-structures.aux-package.
common-lisp.
egnat-metric-set (class).
make-mutable-egnat-metric-set (function).
mutable-egnat-metric-set (class).
cl-data-structures.dicts.srrbcl-ds.dicts.srrb
cl-data-structures.aux-package.
common-lisp.
access-index-bound (generic reader).
(setf access-index-bound) (generic writer).
access-shift (generic reader).
(setf access-shift) (generic writer).
access-tail (generic reader).
(setf access-tail) (generic writer).
access-tail-mask (generic reader).
(setf access-tail-mask) (generic writer).
access-tree (generic reader).
(setf access-tree) (generic writer).
access-tree-index-bound (generic reader).
(setf access-tree-index-bound) (generic writer).
access-tree-size (generic reader).
(setf access-tree-size) (generic writer).
functional-sparse-rrb-vector (class).
functional-sparse-rrb-vector-grow (function).
insert-tail (function).
insert-tail! (function).
make-functional-sparse-rrb-vector (function).
make-mutable-sparse-rrb-vector (function).
make-transactional-sparse-rrb-vector (function).
mutable-sparse-rrb-vector (class).
mutable-sparse-rrb-vector-grow (function).
read-element-type (generic reader).
scan-index-bound (function).
shift-for-position (function).
sparse-rrb-vector-at (function).
transactional-insert-tail! (function).
transactional-sparse-rrb-vector (class).
transactional-sparse-rrb-vector-grow (function).
adjust-tree-to-new-size! (function).
copy-srrb-range-stack-cell (function).
deep-copy-of-tail (function).
destructive-grow-tree! (function).
drop-unneded-nodes (function).
forward-cell (function).
fundamental-sparse-rrb-vector (class).
grow-tree (function).
has-single-child-p (function).
insert-into-node! (function).
insert-new-node! (function).
insert-tail-handle-root-overflow (function).
make-adjusted-tree (function).
make-node-from-tail (function).
make-range-from-root (function).
make-range-from-tail (function).
make-srrb-range-stack-cell (function).
obtain-value (function).
set-in-tail (function).
set-in-tail! (function).
shift (type).
shrink-handle-tail! (function).
shrink-tree (function).
shrink-tree! (function).
srrb-range-stack-cell (structure).
srrb-range-stack-cell-container (reader).
(setf srrb-range-stack-cell-container) (writer).
srrb-range-stack-cell-depth (reader).
(setf srrb-range-stack-cell-depth) (writer).
srrb-range-stack-cell-end (reader).
(setf srrb-range-stack-cell-end) (writer).
srrb-range-stack-cell-is-tail (reader).
(setf srrb-range-stack-cell-is-tail) (writer).
srrb-range-stack-cell-node-bitmask (reader).
(setf srrb-range-stack-cell-node-bitmask) (writer).
srrb-range-stack-cell-node-content (reader).
(setf srrb-range-stack-cell-node-content) (writer).
srrb-range-stack-cell-p (function).
srrb-range-stack-cell-start (reader).
(setf srrb-range-stack-cell-start) (writer).
srrb-range-stack-cell-upper-bits (reader).
(setf srrb-range-stack-cell-upper-bits) (writer).
tail-copy (function).
transactional-grow-tree! (function).
transactional-shrink-handle-tail! (function).
transactional-shrink-tree! (function).
tree-index-bound (function).
unset-in-tail (function).
unset-in-tail! (function).
cl-data-structures.adapterscl-ds.adapters
cl-data-structures.aux-package.
common-lisp.
list-range (class).
offset-vector-range (class).
vector-range (class).
access-content (generic reader).
(setf access-content) (generic writer).
access-lower-bound (generic reader).
(setf access-lower-bound) (generic writer).
access-upper-bound (generic reader).
(setf access-upper-bound) (generic writer).
init-vector-range (function).
range-not-fully-read (function).
read-initial-lower-bound (generic reader).
read-initial-upper-bound (generic reader).
read-offset (generic reader).
read-original-content (generic reader).
read-vector (generic reader).
cl-data-structures.common.qp-triecl-ds.common.qp-trie
cl-data-structures.aux-package.
common-lisp.
access-root (generic reader).
(setf access-root) (generic writer).
array-to-half-byte-array (function).
half-byte-list-to-array (function).
make-qp-trie-node (function).
map-qp-trie-nodes (function).
qp-trie (class).
qp-trie-delete! (function).
qp-trie-find (function).
qp-trie-insert! (macro).
qp-trie-node (type).
qp-trie-node-bitmask (function).
(setf qp-trie-node-bitmask) (function).
qp-trie-node-children-bitmask (function).
(setf qp-trie-node-children-bitmask) (function).
qp-trie-node-clone (function).
qp-trie-node-content (function).
(setf qp-trie-node-content) (function).
qp-trie-node-delete! (function).
qp-trie-node-leaf-present-p (function).
qp-trie-node-present-p (function).
qp-trie-node-ref (function).
qp-trie-node-store-bitmask (function).
(setf qp-trie-node-store-bitmask) (function).
qp-trie-node-unmark-leaf! (function).
copy-qp-trie-node-tagged (function).
copy-qp-trie-node-untagged (function).
full-mask (type).
half-byte (type).
make-qp-trie-node-tagged (function).
make-qp-trie-node-untagged (function).
node-index (type).
node-mask (type).
qp-trie-leaf-present-p (function).
qp-trie-node-contains-leafs-p (function).
qp-trie-node-get-or-insert-child! (macro).
qp-trie-node-index (function).
qp-trie-node-insert-new-node! (function).
qp-trie-node-mark-leaf! (function).
qp-trie-node-size (function).
qp-trie-node-tagged (structure).
qp-trie-node-tagged-bitmask (reader).
(setf qp-trie-node-tagged-bitmask) (writer).
qp-trie-node-tagged-content (reader).
(setf qp-trie-node-tagged-content) (writer).
qp-trie-node-tagged-ownership-tag (function).
(setf qp-trie-node-tagged-ownership-tag) (function).
qp-trie-node-tagged-p (function).
qp-trie-node-untagged (structure).
qp-trie-node-untagged-bitmask (reader).
(setf qp-trie-node-untagged-bitmask) (writer).
qp-trie-node-untagged-content (reader).
(setf qp-trie-node-untagged-content) (writer).
qp-trie-node-untagged-p (function).
split-byte (function).
cl-data-structures.common.abstractcl-ds.common.abstract
cl-data-structures.aux-package.
common-lisp.
acquire-ownership (function).
define-tagged-untagged-node (macro).
fundamental-ownership-tagged-object (class).
make-ownership-tag (function).
read-ownership-tag (generic reader).
replica (function).
tagged-node (class).
tagged-struct-node (structure).
write-ownership-tag (generic writer).
copy-tagged-struct-node (function).
make-tagged-struct-node (function).
reset-ownership-tag (function).
struct-accessor-name (function).
tagged-node-ownership-tag (function).
tagged-struct-node-ownership-tag (reader).
(setf tagged-struct-node-ownership-tag) (writer).
tagged-struct-node-p (function).
cl-data-structurescl-ds
cl-data-structures.aux-package.
common-lisp.
across (generic function).
add (generic function).
add! (generic function).
argument-error (condition).
argument-value-not-in-allowed-set (condition).
argument-value-out-of-bounds (condition).
assert-one-dimension (macro).
at (generic function).
(setf at) (generic function).
become-functional (generic function).
become-lazy (generic function).
become-mutable (generic function).
become-transactional (generic function).
between* (generic function).
changed (generic function).
check-argument-bounds (macro).
chunked (generic function).
chunked-range (class).
chunking-mixin (class).
clone (generic function).
consume-back (generic function).
consume-front (generic function).
define-validation-for-fields (macro).
delay (macro).
delayed (class).
dimensionality (generic function).
dimensionality-error (condition).
drop-back (generic function).
drop-front (generic function).
empty-clone (generic function).
empty-container (condition).
empty-range (class).
erase (generic function).
erase! (generic function).
erase* (generic function).
erase*! (generic function).
erase-if (generic function).
erase-if! (generic function).
expression (class).
field (function).
field (class).
file-releated-error (condition).
force (function).
forward-call (generic function).
found (generic function).
functional (class).
functionalp (generic function).
fundamental-assignable-forward-range (class).
fundamental-bidirectional-range (class).
fundamental-container (class).
fundamental-forward-range (class).
fundamental-modification-operation-status (class).
fundamental-random-access-range (class).
fundamental-range (class).
incompatible-arguments (condition).
initialization-error (condition).
initialization-out-of-bounds (condition).
insert (generic function).
insert! (generic function).
invalid-argument (condition).
invalid-argument-value (condition).
invalid-value (condition).
iota-range (function).
key-value-range (class).
lazy (class).
lower-bound (generic function).
make-delay (function).
make-from-traversable (generic function).
make-of-size (generic function).
mod-bind (macro).
modulo-range (function).
mutable (class).
mutablep (generic function).
near (generic function).
not-implemented (condition).
not-in-allowed-set (condition).
operation-not-allowed (condition).
out-of-bounds (condition).
path (generic reader).
path-scaner (function).
peek-back (generic function).
(setf peek-back) (generic function).
peek-front (generic function).
(setf peek-front) (generic function).
put (generic function).
put! (generic function).
put-back (generic function).
put-back! (generic function).
put-front (generic function).
put-front! (generic function).
read-arguments (generic reader).
read-bounds (generic reader).
read-class (generic reader).
read-value (generic reader).
replica (generic function).
reset! (generic function).
size (generic function).
take-out (generic function).
take-out! (generic function).
take-out-back (generic function).
take-out-back! (generic function).
take-out-front (generic function).
take-out-front! (generic function).
textual-error (condition).
too-many-dimensions (condition).
transactional (class).
transactionalp (generic function).
traversable (class).
traverse (generic function).
traverse-multiple (function).
type-specialization (generic function).
unexpected-argument (condition).
update (generic function).
update! (generic function).
update-if (generic function).
update-if! (generic function).
validate-field (generic function).
validate-fields (function).
value (generic function).
whole-range (generic function).
xpr (macro).
access-arguments-closure (generic reader).
(setf access-arguments-closure) (generic writer).
access-closure (generic reader).
(setf access-closure) (generic writer).
access-finished-closure (generic reader).
(setf access-finished-closure) (generic writer).
fundamental-assiganable-range (class).
fundamental-assignable-bidirectional-range (class).
fundamental-assignable-random-access-range (class).
generate-validation-forms (function).
print-condition (generic function).
read-argument (generic reader).
read-body (generic reader).
read-callback (generic reader).
read-chunk-size (generic reader).
read-original-range (generic reader).
validation-form (function).
validation-form-for (generic function).
cl-data-structures.common.skip-listcl-ds.common.skip-list
cl-data-structures.aux-package.
cl-data-structures.common.abstract.
common-lisp.
access-maximum-level (generic reader).
(setf access-maximum-level) (generic writer).
access-test-function (generic reader).
(setf access-test-function) (generic writer).
assoc-skip-list-node-value (reader).
(setf assoc-skip-list-node-value) (writer).
delete-node-between! (function).
fundamental-skip-list (class).
fundamental-skip-list-range (class).
insert-node-between! (function).
insert-or (function).
locate-node (function).
make-range (generic function).
make-skip-list-node (function).
make-skip-list-node-of-level (function).
make-skip-list-node-of-random-level (function).
new-node-update-pointers! (function).
random-level (function).
read-ordering-function (generic reader).
read-pointers (generic reader).
skip-list-locate-node (function).
skip-list-node (structure).
skip-list-node-at (function).
(setf skip-list-node-at) (function).
skip-list-node-clone (generic function).
skip-list-node-compare (function).
skip-list-node-content (reader).
(setf skip-list-node-content) (writer).
skip-list-node-level (function).
skip-list-node-pointers (reader).
(setf skip-list-node-pointers) (writer).
skip-list-node-update-pointers! (function).
update-head-pointers! (function).
access-current-node (generic reader).
(setf access-current-node) (generic writer).
assoc-skip-list-node (structure).
assoc-skip-list-node-content (function).
(setf assoc-skip-list-node-content) (function).
assoc-skip-list-node-p (function).
assoc-skip-list-node-pointers (function).
(setf assoc-skip-list-node-pointers) (function).
copy-assoc-skip-list-node (function).
copy-into! (function).
copy-skip-list-node (function).
gather-pointers (function).
make-assoc-skip-list-node (function).
make-skip-list-node* (function).
read-initial-current-node (generic reader).
read-last-node (generic reader).
skip-list-node-p (function).
cl-data-structures.compositecl-ds.composite
cl-data-structures.aux-package.
common-lisp.
make-functional-composite-container (function).
make-mutable-composite-container (function).
position-modification (function).
position-modification! (function).
composite-container (class).
functional-composite-container (class).
make-bucket-callback (macro).
make-bucket-callbacks (generic reader).
mutable-composite-container (class).
root (generic reader).
(setf root) (generic writer).
separate-operations/arguments (function).
cl-data-structures.threadscl-ds.threads
cl-data-structures.aux-package.
common-lisp.
parallel-group-by (generic function).
parallel-multiplex (generic function).
parallel-on-each (generic function).
thread-buffer (generic function).
bidirectional-buffer-range (class).
bidirectional-parallel-group-by-proxy (class).
buffer-range (class).
forward-buffer-range (class).
forward-parallel-group-by-proxy (class).
parallel-forward-multiplex-proxy (class).
parallel-group-by-function (class).
parallel-group-by-proxy (class).
parallel-multiplex-function (class).
parallel-on-each-function (class).
parallel-on-each-proxy (class).
random-access-buffer-range (class).
random-access-parallel-group-by-proxy (class).
read-chunk-size (generic reader).
read-groups (generic reader).
read-having (generic reader).
read-key (generic reader).
read-maximum-queue-size (generic reader).
read-transform (generic reader).
thread-buffer-function (class).
cl-data-structures.dicts.hamtcl-ds.dicts.hamt
functional-hamt-dictionary (class).
hamt-dictionary (class).
hamt-dictionary-at (function).
hamt-dictionary-size (function).
make-functional-hamt-dictionary (function).
make-mutable-hamt-dictionary (function).
make-transactional-hamt-dictionary (function).
mutable-hamt-dictionary (class).
transactional-hamt-dictionary (class).
find-content (function).
grow (generic function).
make-hash-dict-content (function).
shrink (generic function).
cl-data-structures.algorithms.metacl-ds.alg.meta
cl-data-structures.
cl-data-structures.aux-package.
common-lisp.
%key (slot).
%key (slot).
%key (slot).
%key (slot).
%key (slot).
%key (slot).
%key (slot).
%key (slot).
%key (slot).
across-aggregate (generic function).
aggregation-function (class).
aggregator (structure).
aggregator-constructor (generic function).
apply-aggregation-function (generic function).
apply-layer (generic function).
apply-range-function (generic function).
call-constructor (macro).
cleanup (function).
construct-aggregator (function).
define-aggregation-function (macro).
early-aggregation-exit (condition).
extract-result (function).
layer-aggregator-constructor (generic function).
layer-function (class).
let-aggregator (macro).
pass-to-aggregation (function).
range-function (class).
read-key (generic reader).
state-result (generic function).
transformation!-function (class).
aggregation-function-class-form (function).
aggregation-function-defgeneric-form (function).
aggregator-cleanup (reader).
(setf aggregator-cleanup) (writer).
aggregator-constructor-form (function).
aggregator-extract (reader).
(setf aggregator-extract) (writer).
aggregator-p (function).
aggregator-pass (reader).
(setf aggregator-pass) (writer).
copy-aggregator (function).
extract-parameters (function).
extract-values (function).
key-parameters-start-at (function).
make-aggregator (function).
make-state (generic function).
cl-data-structures.sequencescl-ds.seqs
cl-data-structures.aux-package.
common-lisp.
functional-sequence (class).
fundamental-sequence (class).
mutable-sequence (class).
transactional-sequence (class).
lazy-box-sequence (class).
cl-data-structures.queuescl-ds.queues
cl-data-structures.aux-package.
common-lisp.
access-size (generic reader).
(setf access-size) (generic writer).
fundamental-functional-queue (class).
fundamental-mutable-queue (class).
fundamental-queue (class).
fundamental-transactional-queue (class).
cl-data-structures.aux-packagecl-data-structures.
cl-data-structures.adapters.
cl-data-structures.algorithms.
cl-data-structures.algorithms.meta.
cl-data-structures.common.
cl-data-structures.common.2-3-tree.
cl-data-structures.common.abstract.
cl-data-structures.common.egnat.
cl-data-structures.common.hamt.
cl-data-structures.common.qp-trie.
cl-data-structures.common.rrb.
cl-data-structures.common.skip-list.
cl-data-structures.composite.
cl-data-structures.dicts.
cl-data-structures.dicts.hamt.
cl-data-structures.dicts.skip-list.
cl-data-structures.dicts.srrb.
cl-data-structures.file-system.
cl-data-structures.math.
cl-data-structures.meta.
cl-data-structures.metric-space.
cl-data-structures.metric-space.egnat.
cl-data-structures.queues.
cl-data-structures.queues.2-3-tree.
cl-data-structures.sequences.
cl-data-structures.sequences.rrb-vector.
cl-data-structures.sets.
cl-data-structures.sets.qp-trie.
cl-data-structures.sets.skip-list.
cl-data-structures.streaming-algorithms.
cl-data-structures.streaming-algorithms.hyperloglog.
cl-data-structures.streaming-algorithms.polynomial-hashing.
cl-data-structures.threads.
cl-data-structures.utils.
cl-data-structures.algorithmscl-ds.alg
%summary (generic function).
*current-key* (special variable).
*previous-element* (special variable).
access-functor (generic reader).
(setf access-functor) (generic writer).
array-elementwise (generic function).
bidirectional-chain-of-ranges (class).
bidirectional-proxy-range (class).
cartesian (function).
chain (function).
connect (function).
connect-traversable (function).
count-elements (generic function).
count-elements-function (class).
cumulative-accumulate (generic function).
cumulative-accumulate-range (class).
distinct (generic function).
enumerate (generic function).
establish-special (generic function).
extrema (generic function).
extremum (generic function).
filtering-proxy (class).
first-element (generic function).
flatten-lists (generic function).
forward-chain-of-ranges (class).
forward-multiplex-proxy (class).
forward-proxy-box-range (class).
forward-proxy-range (class).
frequency (generic function).
group-by (generic function).
group-by-function (class).
group-by-result-range (class).
hash-table-elementwise (generic function).
hash-table-range (class).
in-batches (generic function).
last-element (generic function).
latch (generic function).
make-hash-table-range (function).
make-proxy (generic function).
make-reservoir-sampling (function).
multiplex (generic function).
on-each (generic function).
only (generic function).
only-different (generic function).
partition-if (generic function).
proxy-box-range (class).
proxy-range (class).
random-access-chain-of-ranges (class).
random-access-proxy-range (class).
rate (generic function).
read-function (generic reader).
read-functor-constructor (generic reader).
read-functor-prototype (generic reader).
read-hash-table (generic reader).
read-keys (generic reader).
read-original-range (generic reader).
reservoir-sample (generic function).
reservoir-sampling-push (function).
reservoir-sampling-result (reader).
(setf reservoir-sampling-result) (writer).
restrain-size (generic function).
should-skip (generic function).
shuffled-range (function).
shuffled-range (class).
sliding-window (generic function).
summary (macro).
summary-result-range (class).
to-hash-table (generic function).
to-list (generic function).
to-vector (generic function).
translation (generic function).
transparent-to-chunking-mixin (class).
with-previous-element (generic function).
without (generic function).
wrap-chunk (generic function).
zip (function).
zip-traversable (function).
%summary-function (class).
abstract-in-batches-proxy (class).
abstract-partition-if-proxy (class).
abstract-sliding-window-proxy (class).
access-begin (generic reader).
(setf access-begin) (generic writer).
access-collected (generic reader).
(setf access-collected) (generic writer).
access-current (generic reader).
(setf access-current) (generic writer).
access-end (generic reader).
(setf access-end) (generic writer).
access-index (generic reader).
(setf access-index) (generic writer).
access-position (generic reader).
(setf access-position) (generic writer).
access-previous (generic reader).
(setf access-previous) (generic writer).
access-previous-bound (generic reader).
(setf access-previous-bound) (generic writer).
access-state (generic reader).
(setf access-state) (generic writer).
access-tail (generic reader).
(setf access-tail) (generic writer).
access-window (generic reader).
(setf access-window) (generic writer).
accumulate-function (class).
array-elementwise-forward-proxy (class).
array-elementwise-function (class).
bidirectional-connecting-range (class).
bidirectional-establish-special-proxy-range (class).
bidirectional-filtering-proxy (class).
bidirectional-group-by-proxy (class).
bidirectional-in-batches-proxy (class).
bidirectional-only-proxy (class).
bidirectional-proxy-box-range (class).
bidirectional-with-previous-element-proxy (class).
bidirectional-without-proxy (class).
bidirectional-zipped-ranges (class).
calculate-skip-count (function).
chunkable-bidirectional-connecting-range (class).
chunkable-forward-connecting-range (class).
chunkable-random-access-connecting-range (class).
chunked-proxy-range (class).
clone-of-original-range (function).
common-fundamental-range-class (function).
consume-impl (function).
copy-reservoir-sampling (function).
cumulative-accumulate-function (class).
cumulative-state (class).
deep-copy-of-content (function).
distinct-function (class).
distinct-proxy (class).
enumerate-function (class).
establish-special-function (class).
establish-special-proxy (class).
extrema-function (class).
extremum-function (class).
first-element-function (class).
flatten-lists-function (class).
flatten-proxy (class).
forward-abstract-partition-if-proxy (class).
forward-cartesian-range (class).
forward-connecting-range (class).
forward-distinct-proxy (class).
forward-establish-special-proxy-range (class).
forward-filtering-proxy (class).
forward-flatten-proxy (class).
forward-group-by-proxy (class).
forward-in-batches-proxy (class).
forward-latch-proxy (class).
forward-only-different-proxy (class).
forward-only-proxy (class).
forward-partition-if-proxy (class).
forward-repeat-proxy (class).
forward-restrain-size-proxy (class).
forward-sliding-window-proxy (class).
forward-with-previous-element-proxy (class).
forward-without-proxy (class).
forward-zipped-ranges (class).
frequency-function (class).
fundamental-range-class-of (generic function).
gen-w (function).
group-by-proxy (class).
hash-table-elementwise-forward-proxy (class).
hash-table-elementwise-function (class).
in-batches-function (class).
init-chain-of-range (function).
init-connected-ranges (function).
last-element-function (class).
latch-function (class).
latch-proxy (class).
make-reservoir-sampling* (function).
multiplex-function (class).
multiplex-proxy (class).
on-each-function (class).
on-each-proxy-range-from-range (generic function).
only-different-function (class).
only-different-proxy (class).
only-function (class).
only-proxy (class).
partition-if-consume-implementation (function).
partition-if-function (class).
partition-if-proxy (class).
peek-or-consume (function).
random-access-connecting-range (class).
random-access-establish-special-proxy-range (class).
random-access-group-by-proxy (class).
random-access-in-batches-proxy (class).
random-access-proxy-box-range (class).
random-access-with-previous-element-proxy (class).
random-access-zipped-ranges (class).
rate-function (class).
read-batch-size (generic reader).
read-bindings (generic reader).
read-chunked-range (generic reader).
read-chunks (generic reader).
read-comparsion (generic reader).
read-content (generic reader).
read-cumulative-key (generic reader).
read-from (generic reader).
read-groups (generic reader).
read-having (generic reader).
read-initial-begin (generic reader).
read-initial-current (generic reader).
read-initial-current-position (generic reader).
read-initial-end (generic reader).
read-initial-position (generic reader).
read-initial-previous (generic reader).
(setf read-initial-previous) (generic writer).
read-initial-previous-bound (generic reader).
(setf read-initial-previous-bound) (generic writer).
read-initial-state (generic reader).
read-initial-window (generic reader).
read-latches (generic reader).
(setf read-latches) (generic writer).
read-on-first (generic reader).
read-original-collected (generic reader).
read-original-content (generic reader).
read-original-seen (generic reader).
read-predicate (generic reader).
read-ranges (generic reader).
read-result (generic reader).
read-seen (generic reader).
read-size (generic reader).
read-table (generic reader).
read-test (generic reader).
read-times (generic reader).
read-to (generic reader).
read-transform (generic reader).
read-window-size (generic reader).
repeat-function (class).
repeat-proxy (class).
replica-of-seen (function).
reservoir-sample-function (class).
reservoir-sampling (structure).
reservoir-sampling-p (function).
reservoir-sampling-sample-size (function).
reservoir-sampling-skip-count (reader).
(setf reservoir-sampling-skip-count) (writer).
reservoir-sampling-w (reader).
(setf reservoir-sampling-w) (writer).
restrain-size-function (class).
restrain-size-proxy (class).
sliding-window-function (class).
summary-aggregation-function (class).
to-hash-table-function (class).
to-list-function (class).
to-vector-function (class).
translation-function (class).
with-previous-element-function (class).
with-previous-element-proxy (class).
without-function (class).
without-proxy (class).
zipping-mixin (class).
cl-data-structures.sets.skip-listcl-ds.sets.skip-list
cl-data-structures.aux-package.
common-lisp.
make-mutable-skip-list-set (function).
mutable-skip-list-set (class).
mutable-skip-list-set-range (class).
cl-data-structures.streaming-algorithms.polynomial-hashingcl-data-structures.aux-package.
common-lisp.
+max-64-bits+ (constant).
hash (type).
hash-array (type).
hashval (function).
hashval-no-depth (function).
make-hash-array (function).
+long-prime+ (constant).
cl-data-structures.sequences.rrb-vectorcl-ds.seqs.rrb
cl-data-structures.aux-package.
cl-data-structures.common.rrb.
common-lisp.
functional-rrb-vector (class).
make-functional-rrb-vector (function).
make-mutable-rrb-vector (function).
make-transactional-rrb-vector (function).
mutable-rrb-vector (class).
transactional-rrb-vector (class).
fold-content (function).
fold-rrb-content (function).
make-mutable-of-size (function).
mutable-from-traversable (function).
rrb-vector (class).
cl-data-structures.streaming-algorithms.hyperloglogcl-data-structures.aux-package.
common-lisp.
add-hash (function).
cardinality (function).
intersection-cardinality (function).
jaccard (function).
new-sketch (function).
register (type).
sketch (type).
union (function).
+2q+ (constant).
+2r+ (constant).
+alpha+ (constant).
+c+ (constant).
+m+ (constant).
+max+ (constant).
+maxx+ (constant).
+p+ (constant).
+q+ (constant).
+r+ (constant).
approximated-expected-collisions (function).
beta (function).
expected-collisions (function).
hash-shifts (function).
hll-rank (function).
lz (function).
new-register (function).
reg-sum-and-zeroes (function).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Description:
KEY for the current group when aggregating by the GROUP-BY or PARTITION-IF function.
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)
Macro, used for elemination of code branches by duplicating code.
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)
Description:
Defines all required methods and classes for aggregation functions.
Description:
Simple lazy evaluated value. Used to eleminate costly creation of elements in the container by update-if.
Macro used for writing code going down into hash tree.
Macro. Will import all internal symbols from package to package. For tests.
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.
Poor man’s generator (no continuations, no code-walking).
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).
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.
Simple macro adding local functions (all forwards to the container closures).
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)
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.
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.
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.
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.
Description:
Adds a single element to the distribution.
Description:
How many elements with value lower then the specified there is?
Description:
Returns vector of cumulant sums at bin.
Description:
Estimates mean of the distribution.
Description:
Estimate median of the approximated distribution.
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)))
Description:
What is the percantage of element in the histogram with value lower then the specified there is?
Description:
Estimates total sum of all elements passed to the histogram.
Description:
Estimate mean of the approximated distribution. Truncates outliers by the fraction.
Description:
Estimates variance of the distribution.
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.
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.
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).
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
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.
Description:
Extract final result of aggregation.
Implementation of AT
Implementation of SIZE
hash.
Attempts to randomize bits. Uses xorshift* algorithm.
Returns copy of node, but without element under index. Not safe, does not check if element is actually present.
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.
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)
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.
Description:
Find position in the VECTOR of the first element not larger then ELEMENT.
Returns:
Empty functional-2-3-queue
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.
Description:
Creates and returns a new instance of functiona-rrb-vector
Description:
Constructs and returns a functional variant of the sparse rrb vector.
Returns:
Empty mutable-2-3-queue
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.
Description:
Constructs and returns a new instance of the mutable-qp-trie-set
Description:
Creates and returns a new instance of mutable-rrb-vector.
Description:
Constructs and returns a new instance of mutable-skip-list.
Description:
Constructs and returns a mutable variant of the sparse rrb vector.
Returns:
Empty transactional-2-3-queue
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.
Description:
Creates and returns a new instance of transactional-rrb-vector
Description:
Constructs and returns a transactional variant of the sparse rrb vector.
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.
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.
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.
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.
Description:
Matrix reference. Accessor for values in matrices.
Description:
Normalizes SEQUENCE of numbers so every element is between MIN and MAX
Returns:
SEQUENCE
Exceptional situations:
Assert: (< MIN MAX)
Side Effects:
Mutates SEQUENCE.
Description:
Normalizes SEQUENCE of numbers so sum of elements is equal to SUM.
Returns:
SEQUENCE
Side Effects:
Mutates SEQUENCE.
Predictate. Checks if SEQUENCE is ordered by FN (that is, if call to (fn prev current) always returns T).
@b(Side Effects:) none.
Arguments:
–AGGREGATOR, Instance of aggregator.
–ELEMENT, Element that is supposed to be aggregated.
Description:
Passes ELEMENT to the AGGREGATOR.
Affected by
Class of AGGREGATOR.
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.
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.
Returns index-bound from the tree.
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.
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.
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.
@b(Returns) first matching elements as first value and boolean telling if it was found as second
@b(Returns) first matching sublist
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)
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.
box-container)) ¶automatically generated reader method
box-container)) ¶automatically generated writer method
file-range-mixin)) ¶automatically generated reader method
file-range-mixin)) ¶automatically generated writer method
proxy-box-range)) ¶automatically generated reader method
proxy-box-range)) ¶automatically generated writer method
fundamental-sparse-rrb-vector)) ¶automatically generated reader method
fundamental-sparse-rrb-vector)) ¶automatically generated writer method
fundamental-skip-list)) ¶automatically generated reader method
fundamental-skip-list)) ¶automatically generated writer method
file-range-mixin)) ¶automatically generated reader method
file-range-mixin)) ¶automatically generated writer method
hamt-container)) ¶hamt-container)) ¶Hash node pointing to root of the whole hash tree.
rrb-container)) ¶rrb-container)) ¶root of the tree
fundamental-egnat-container)) ¶automatically generated reader method
fundamental-egnat-container)) ¶automatically generated writer method
rrb-container)) ¶automatically generated reader method
rrb-container)) ¶automatically generated writer method
fundamental-sparse-rrb-vector)) ¶automatically generated reader method
fundamental-sparse-rrb-vector)) ¶automatically generated writer method
hamt-container)) ¶hamt-container)) ¶How many elements are in there?
rrb-container)) ¶automatically generated reader method
rrb-container)) ¶automatically generated writer method
fundamental-egnat-container)) ¶automatically generated reader method
fundamental-egnat-container)) ¶automatically generated writer method
fundamental-queue)) ¶automatically generated reader method
fundamental-queue)) ¶automatically generated writer method
rrb-container)) ¶automatically generated reader method
rrb-container)) ¶automatically generated writer method
fundamental-sparse-rrb-vector)) ¶automatically generated reader method
fundamental-sparse-rrb-vector)) ¶automatically generated writer method
fundamental-sparse-rrb-vector)) ¶automatically generated reader method
fundamental-sparse-rrb-vector)) ¶automatically generated writer method
rrb-container)) ¶automatically generated reader method
rrb-container)) ¶automatically generated writer method
fundamental-skip-list)) ¶automatically generated reader method
fundamental-skip-list)) ¶automatically generated writer method
fundamental-sparse-rrb-vector)) ¶automatically generated reader method
fundamental-sparse-rrb-vector)) ¶automatically generated writer method
fundamental-sparse-rrb-vector)) ¶automatically generated reader method
fundamental-sparse-rrb-vector)) ¶automatically generated writer method
fundamental-sparse-rrb-vector)) ¶automatically generated reader method
fundamental-sparse-rrb-vector)) ¶automatically generated writer method
moving-average-range) function) ¶line-by-line-range) function) ¶file-range-mixin) function) ¶abstract-sliding-window-proxy) function) ¶distinct-proxy) function) ¶forward-partition-if-proxy) function) ¶flatten-proxy) function) ¶forward-chain-of-ranges) function) ¶cumulative-accumulate-range) function) ¶forward-establish-special-proxy-range) function) ¶latch-proxy) function) ¶repeat-proxy) function) ¶restrain-size-proxy) function) ¶multiplex-proxy) function) ¶filtering-proxy) function) ¶forward-proxy-box-range) function) ¶proxy-range) function) ¶mutable-skip-list-set-range) function) ¶qp-trie-set-range) function) ¶fundamental-qp-trie-set) function) ¶synchronization-primitives-mixin) function) ¶2-3-queue-range) function) ¶fundamental-sparse-rrb-vector) function) ¶hamt-dictionary) function) ¶mutable-skip-list-dictionary-range) function) ¶fundamental-egnat-container) function) ¶egnat-range) function) ¶fundamental-skip-list) function) ¶fundamental-skip-list-range) function) ¶sequence-window) function) ¶forward-tree-range) function) ¶lazy-forward-range) function) ¶lazy-range) function) ¶list-range) function) ¶vector-range) function) ¶empty-range) function) ¶expression) function) ¶chunked-range) function) ¶sequence) function) ¶fundamental-container) function) ¶fundamental-range) function) ¶cumulative-accumulate-function) function) ¶latch-proxy) function) ¶multiplex-proxy) function) ¶proxy-range) function) ¶traversable) function) ¶sequence) function) ¶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.
functional-sparse-vector) location new-value) ¶functional-dictionary) 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.
mutable-dictionary) location new-value) ¶mutable-sparse-vector) location new-value) ¶pipe-fragment) x) ¶pipe-fragment) sink &rest sinks) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 gather-corpus-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 gather-corpus-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 bloom-filter-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 bloom-filter-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 approximated-top-k-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 approximated-top-k-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 approximated-counts-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 approximated-counts-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 approximated-set-cardinality-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 approximated-set-cardinality-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 approximated-histogram-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 approximated-histogram-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 array-sum-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 array-sum-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 sum-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 sum-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 fast-map-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 fast-map-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 entropy-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 entropy-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 gini-impurity-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 gini-impurity-function) (!arguments5 list)) ¶bootstrap-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 moments-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 moments-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 standard-deviation-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 standard-deviation-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 co-occurence-table-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 co-occurence-table-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 hodges-lehmann-estimator-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 hodges-lehmann-estimator-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 median-absolute-deviation-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 median-absolute-deviation-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 simple-linear-regression-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 simple-linear-regression-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 optimal-split-point-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 optimal-split-point-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 harmonic-average-mutual-information-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 harmonic-average-mutual-information-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 mutual-information-matrix-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 mutual-information-matrix-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 mutual-information-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 mutual-information-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 variance-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 variance-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 array-harmonic-average-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 array-harmonic-average-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 array-geometric-average-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 array-geometric-average-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 array-average-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 array-average-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 geometric-average-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 geometric-average-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 harmonic-average-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 harmonic-average-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 average-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 average-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 absolute-value-norm-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 absolute-value-norm-function) (!arguments5 list)) ¶buffer-range) outer-constructor (function aggregation-function) (arguments list)) ¶parallel-on-each-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶parallel-group-by-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶parallel-forward-multiplex-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶with-previous-element-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶abstract-sliding-window-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶abstract-in-batches-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 last-element-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 last-element-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 first-element-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 first-element-function) (!arguments5 list)) ¶distinct-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶partition-if-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶flatten-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 frequency-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 frequency-function) (!arguments5 list)) ¶cumulative-accumulate-range) outer-constructor (function aggregation-function) (arguments list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 extremum-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 extremum-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 extrema-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 extrema-function) (!arguments5 list)) ¶establish-special-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶repeat-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 reservoir-sample-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 reservoir-sample-function) (!arguments5 list)) ¶restrain-size-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶only-different-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶only-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶multiplex-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶without-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶group-by-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 accumulate-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 accumulate-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 %summary-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 %summary-function) (!arguments5 list)) ¶filtering-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 enumerate-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 enumerate-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 to-hash-table-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 to-hash-table-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 rate-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 rate-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 to-list-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 to-list-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 to-vector-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 to-vector-function) (!arguments5 list)) ¶sequence) (!outer-constructor2 (eql nil)) (!function3 count-elements-function) (!arguments5 list)) ¶traversable) (!outer-constructor2 (eql nil)) (!function3 count-elements-function) (!arguments5 list)) ¶proxy-box-range) outer-constructor (function aggregation-function) (arguments list)) ¶hash-table-elementwise-forward-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶array-elementwise-forward-proxy) outer-constructor (function aggregation-function) (arguments list)) ¶sequence) (outer-constructor function) (function aggregation-function) (arguments list)) ¶traversable) (outer-constructor function) (function aggregation-function) (arguments list)) ¶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) ¶erase-if-function) value bucket &rest all &key condition-fn) ¶take-out-function) value bucket &rest all) ¶erase-function) value bucket &rest all) ¶add-function) value bucket &rest all) ¶insert-function) value bucket &rest all) ¶update-function) value bucket &rest all) ¶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) ¶take-out!-function) value bucket &rest all) ¶update-if!-function) value bucket &rest all &key condition-fn) ¶add!-function) value bucket &rest all) ¶insert!-function) value bucket &rest all) ¶erase-if!-function) value bucket &rest all &key condition-fn) ¶erase!-function) value bucket &rest all) ¶update!-function) value bucket &rest all) ¶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.
aggregation-function) all) ¶Arguments:
–RANGE, Instance of FUNDAMENTAL-RANGE.
–FUNCTION, Instance of LAYER-FUNCTION.
Description:
Entry point to common layer function logic.
Affected by
Class of RANGE.
fundamental-forward-range) (fn moving-average-function) all) ¶fundamental-random-access-range) (fn bootstrap-function) all) ¶fundamental-bidirectional-range) (fn bootstrap-function) all) ¶fundamental-forward-range) (fn bootstrap-function) all) ¶fundamental-bidirectional-range) (fn thread-buffer-function) arguments) ¶fundamental-random-access-range) (fn thread-buffer-function) arguments) ¶traversable) (fn thread-buffer-function) arguments) ¶traversable) (fn parallel-on-each-function) all) ¶fundamental-random-access-range) (fn parallel-group-by-function) all) ¶fundamental-bidirectional-range) (fn parallel-group-by-function) all) ¶fundamental-forward-range) (fn parallel-group-by-function) all) ¶traversable) (fn parallel-group-by-function) all) ¶traversable) (fn parallel-multiplex-function) all) ¶fundamental-random-access-range) (fn with-previous-element-function) all) ¶fundamental-bidirectional-range) (fn with-previous-element-function) all) ¶fundamental-forward-range) (fn with-previous-element-function) all) ¶traversable) (fn with-previous-element-function) all) ¶traversable) (fn sliding-window-function) all) ¶fundamental-random-access-range) (fn in-batches-function) all) ¶fundamental-bidirectional-range) (fn in-batches-function) all) ¶traversable) (fn in-batches-function) all) ¶fundamental-forward-range) (function distinct-function) all) ¶traversable) (fn partition-if-function) all) ¶traversable) (function flatten-lists-function) all) ¶fundamental-forward-range) (fn cumulative-accumulate-function) all) ¶fundamental-random-access-range) (fn establish-special-function) all) ¶fundamental-bidirectional-range) (fn establish-special-function) all) ¶traversable) (fn establish-special-function) all) ¶fundamental-forward-range) (function latch-function) all) ¶fundamental-range) (fn repeat-function) all) ¶fundamental-range) (fn restrain-size-function) all) ¶traversable) (function only-different-function) all) ¶traversable) (function only-function) all) ¶fundamental-bidirectional-range) (function only-function) all) ¶traversable) (fn multiplex-function) all) ¶traversable) (function without-function) all) ¶fundamental-bidirectional-range) (function without-function) all) ¶fundamental-random-access-range) (fn group-by-function) all) ¶fundamental-bidirectional-range) (fn group-by-function) all) ¶fundamental-forward-range) (fn group-by-function) all) ¶traversable) (fn group-by-function) all) ¶traversable) (fn on-each-function) all) ¶traversable) (function hash-table-elementwise-function) arguments) ¶traversable) (function array-elementwise-function) arguments) ¶fundamental-container) (function layer-function) all) ¶sequence) (function layer-function) all) ¶hash-table) (function layer-function) all) ¶fundamental-range) (function layer-function) all) ¶traversable) (function layer-function) all) ¶aggregation-function) all) ¶sequence) (function aggregation-function) all) ¶fundamental-container) (function aggregation-function) all) ¶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.
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.
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.
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.
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.
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.
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.
Description:
Calculates elementwise sum of all arrays in the range.
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.
bloom-filter) location &rest more-locations) ¶approximated-counts) location &rest more-locations) ¶approximated-histogram) location &rest more-locations) ¶zipping-mixin) location &rest more-locations) ¶random-access-connecting-range) location &rest more-locations) ¶random-access-chain-of-ranges) location &rest more-locations) ¶bidirectional-proxy-box-range) location &rest more-locations) ¶hash-table-range) location &rest more) ¶random-access-proxy-range) location &rest more) ¶composite-container) location &rest more-locations) ¶mutable-skip-list-set) location &rest more-locations) ¶fundamental-qp-trie-set) location &rest more-locations) ¶lazy-box-sequence) location &rest more-locations) ¶fundamental-sparse-rrb-vector) position &rest more-positions) ¶hamt-dictionary) location &rest more-locations) ¶mutable-skip-list-dictionary) location &rest more-locations) ¶lazy-box-dictionary) location &rest more-locations) ¶rrb-container) index &rest more) ¶sequence-window) index &rest more) ¶vector) index &rest more-locations) ¶offset-vector-range) location &rest more-locations) ¶vector-range) location &rest more) ¶hash-table) 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.
mutable-sequence) location &rest more-locations) ¶mutable-dictionary) location &rest more-locations) ¶mutable-sparse-vector) location &rest more-locations) ¶mutable-rrb-range) index &rest more) ¶Arguments:
–RANGE, Object to aggregate.
–KEY, Function used to extract value from RANGE element.
Description:
Calculate average of elements in the range.
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.
mutable-2-3-queue)) ¶transactional-rrb-vector)) ¶mutable-rrb-vector)) ¶fundamental-sparse-rrb-vector)) ¶transactional-hamt-dictionary)) ¶mutable-hamt-dictionary)) ¶lazy-box-container)) ¶functional)) ¶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
fundamental-sequence)) ¶fundamental-dictionary)) ¶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.
fixed-capacity-synchronized-transactional-2-3-queue)) ¶synchronized-transactional-2-3-queue)) ¶transactional-2-3-queue)) ¶functional-2-3-queue)) ¶transactional-rrb-vector)) ¶functional-rrb-vector)) ¶fundamental-sparse-rrb-vector)) ¶transactional-hamt-dictionary)) ¶functional-hamt-dictionary)) ¶lazy-box-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.
synchronized-mutable-2-3-queue)) ¶fixed-capacity-synchronized-mutable-2-3-queue)) ¶synchronized-transactional-2-3-queue)) ¶fixed-capacity-synchronized-transactional-2-3-queue)) ¶rrb-vector)) ¶fundamental-sparse-rrb-vector)) ¶transactional-sparse-rrb-vector)) ¶hamt-dictionary)) ¶lazy-box-container)) ¶linear-regression-fit)) ¶automatically generated reader method
linear-regression-fit)) ¶automatically generated writer method
linear-regression-fit)) ¶automatically generated reader method
linear-regression-fit)) ¶automatically generated writer method
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.
fundamental-qp-trie-set) &key low high) ¶fundamental-skip-list) &key low high) ¶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)).
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
Syntax:
changed status => boolean
Arguments:
–STATUS, instance of the modification status class
Returns:
T if operation changed the container.
lazy-modification-operation-status)) ¶implementation-modification-operation-status)) ¶automatically generated reader method
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.
transparent-to-chunking-mixin) &optional chunk-size-hint) ¶proxy-range) &optional chunk-size-hint) ¶chunking-mixin) &optional chunk-size-hint) ¶fundamental-range) &optional chunk-size-hint) ¶fundamental-range) &optional chunk-size-hint) ¶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.
bloom-filter-function) &rest all &key hashes hash-fn depth width) ¶approximated-counts-function) &rest all &key hashes hash-fn depth width) ¶approximated-set-cardinality-function) &rest all &key hash-fn) ¶approximated-histogram-function) &rest all &key maximal-bins-count) ¶callback-minhash)) ¶minhash-corpus)) ¶bloom-filter)) ¶approximated-counts)) ¶approximated-set-cardinality)) ¶approximated-histogram)) ¶find-range)) ¶tokenizing-range)) ¶line-by-line-range)) ¶abstract-sliding-window-proxy)) ¶abstract-in-batches-proxy)) ¶distinct-proxy)) ¶abstract-partition-if-proxy)) ¶forward-connecting-range)) ¶forward-chain-of-ranges)) ¶cumulative-accumulate-range)) ¶latch-proxy)) ¶repeat-proxy)) ¶forward-cartesian-range)) ¶multiplex-proxy)) ¶filtering-proxy)) ¶shuffled-range)) ¶hash-table-range)) ¶proxy-range)) ¶qp-trie-set-range)) ¶fundamental-qp-trie-set)) ¶2-3-queue-range)) ¶fundamental-egnat-container)) ¶egnat-range-around)) ¶egnat-range)) ¶fundamental-skip-list)) ¶fundamental-skip-list-range)) ¶chunked-rrb-range)) ¶hamt-range-stack-cell)) ¶sequence-window)) ¶forward-tree-range)) ¶list-range)) ¶offset-vector-range)) ¶vector-range)) ¶empty-range)) ¶expression)) ¶chunked-range)) ¶append.
:most-specific-last
bloom-filter)) ¶approximated-counts)) ¶approximated-set-cardinality)) ¶fundamental-data-sketch)) ¶moving-average-range)) ¶bootstrap-proxy)) ¶buffer-range)) ¶parallel-on-each-proxy)) ¶parallel-group-by-proxy)) ¶parallel-forward-multiplex-proxy)) ¶find-range)) ¶file-range-mixin)) ¶with-previous-element-proxy)) ¶distinct-proxy)) ¶flatten-proxy)) ¶zipping-mixin)) ¶forward-connecting-range)) ¶cumulative-state)) ¶establish-special-proxy)) ¶restrain-size-proxy)) ¶forward-cartesian-range)) ¶only-different-proxy)) ¶only-proxy)) ¶multiplex-proxy)) ¶without-proxy)) ¶group-by-proxy)) ¶filtering-proxy)) ¶proxy-box-range)) ¶hash-table-range)) ¶proxy-range)) ¶fundamental-sparse-rrb-vector)) ¶egnat-subtree)) ¶egnat-node)) ¶fundamental-skip-list-range)) ¶fundamental-skip-list)) ¶forward-tree-range)) ¶file-releated-error)) ¶fundamental-forward-range)) ¶file-range-mixin)) ¶zipping-mixin)) ¶bidirectional-connecting-range)) ¶bidirectional-chain-of-ranges)) ¶bidirectional-filtering-proxy)) ¶bidirectional-proxy-box-range)) ¶hash-table-range)) ¶bidirectional-proxy-range)) ¶sequence-window)) ¶lazy-bidirectional-range)) ¶lazy-range)) ¶vector-range)) ¶moving-average-range)) ¶find-range)) ¶tokenizing-range)) ¶line-by-line-range)) ¶file-range-mixin)) ¶abstract-sliding-window-proxy)) ¶forward-distinct-proxy)) ¶forward-partition-if-proxy)) ¶forward-flatten-proxy)) ¶zipping-mixin)) ¶forward-connecting-range)) ¶forward-chain-of-ranges)) ¶cumulative-accumulate-range)) ¶forward-latch-proxy)) ¶repeat-proxy)) ¶restrain-size-proxy)) ¶forward-cartesian-range)) ¶multiplex-proxy)) ¶forward-filtering-proxy)) ¶shuffled-range)) ¶forward-proxy-box-range)) ¶hash-table-range)) ¶forward-proxy-range)) ¶chunked-proxy-range)) ¶mutable-skip-list-set-range)) ¶qp-trie-set-range)) ¶2-3-queue-range)) ¶mutable-skip-list-dictionary-range)) ¶egnat-range)) ¶fundamental-skip-list-range)) ¶chunked-rrb-range)) ¶sequence-window)) ¶forward-tree-range)) ¶lazy-forward-range)) ¶lazy-range)) ¶list-range)) ¶vector-range)) ¶empty-range)) ¶expression)) ¶chunked-range)) ¶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
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.
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.
functional-update-function)) ¶functional-put-back-function)) ¶functional-put-front-function)) ¶functional-take-out-front-function)) ¶functional-take-out-back-function)) ¶functional-take-out-function)) ¶functional-insert-function)) ¶functional-put-function)) ¶functional-add-function)) ¶functional-update-if-function)) ¶functional-erase-if-function)) ¶functional-erase-function)) ¶destructive-function)) ¶put-back!-function)) ¶put-front!-function)) ¶take-out-front!-function)) ¶erase*-function)) ¶take-out-back!-function)) ¶Description:
Number of dimensions in the object.
array)) ¶fundamental-container)) ¶fundamental-range)) ¶metric-space-set) bucket element) ¶egnat-metric-set) bucket item) ¶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.
bidirectional-proxy-box-range) count) ¶hash-table-range) count) ¶lazy-bidirectional-range) count) ¶lazy-range) count) ¶fundamental-bidirectional-range) count) ¶distinct-proxy) count) ¶forward-proxy-box-range) count) ¶hash-table-range) count) ¶fundamental-skip-list-range) count) ¶forward-tree-range) count) ¶lazy-forward-range) count) ¶lazy-range) count) ¶expression) count) ¶fundamental-forward-range) count) ¶half-matrix)) ¶forward-chain-of-ranges)) ¶fundamental-qp-trie-set)) ¶fixed-capacity-synchronization-mixin)) ¶transactional-2-3-queue)) ¶rrb-vector)) ¶fundamental-sparse-rrb-vector)) ¶hamt-dictionary)) ¶fundamental-skip-list)) ¶future-carousel)) ¶pipe-fragment)) ¶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.
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.
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.
functional-dictionary) location) ¶functional-sparse-vector) 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.
mutable-metric-space-set) item) ¶mutable-set) location) ¶mutable-dictionary) location) ¶mutable-sparse-vector) location) ¶mutable-set) range) ¶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.
functional-dictionary) 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.
mutable-dictionary) location condition-fn) ¶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.
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.
Description:
Embedds finite metric set into euclid space using fast-map algorithm..
Returns:
SIMPLE-ARRAY containing with embeddings with all elements.
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.
list)) ¶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.
forward-chain-of-ranges) function) ¶proxy-range) function) ¶fundamental-forward-range) function) ¶Syntax:
found status => boolean
Arguments:
–STATUS, instance of modification status class.
Returns:
T if LOCATION was occupied before operation took place, NIL otherwise.
lazy-modification-operation-status)) ¶implementation-modification-operation-status)) ¶automatically generated reader method
update-if!-function) value) ¶update!-function) value) ¶update-if-function) value) ¶update-function) value) ¶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.
update!-function)) ¶take-out!-function)) ¶insert!-function)) ¶add!-function)) ¶put!-function)) ¶erase-if!-function)) ¶update-if!-function)) ¶erase*!-function)) ¶erase!-function)) ¶functional-function)) ¶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.
functional)) ¶fundamental-container)) ¶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.
Arguments:
–RANGE, Object to aggregate.
–KEY, Function used to extract value from RANGE element.
Description:
Calculate geometric average of elements in the range
hamt-dictionary)) ¶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.
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.
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.
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.
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.
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.
functional-dictionary) location new-value) ¶functional-sparse-vector) location new-value) ¶mutable-sparse-vector) location value) ¶mutable-dictionary) location value) ¶bloom-filter)) ¶automatically generated reader method
approximated-counts)) ¶automatically generated reader method
approximated-set-cardinality)) ¶automatically generated reader method
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.
sliding-window-function) outer-fn arguments) ¶in-batches-function) outer-constructor arguments) ¶distinct-function) outer-fn arguments) ¶partition-if-function) outer-fn arguments) ¶cumulative-accumulate-function) outer-fn arguments) ¶hash-table-elementwise-function) outer-constructor arguments) ¶array-elementwise-function) outer-constructor arguments) ¶mutable-skip-list-set) location) ¶mutable-skip-list-dictionary) location) ¶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.
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) ¶fundamental-container) (operation shrink-function) value &rest all) ¶fundamental-container) (operation grow-function) value &rest all) ¶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.
fundamental-forward-range) (class (eql cl-data-structures.metric-space.egnat:mutable-egnat-metric-set)) &rest arguments) ¶fundamental-random-access-range) (class (eql cl-data-structures.metric-space.egnat:mutable-egnat-metric-set)) &rest arguments) ¶vector) (class (eql cl-data-structures.metric-space.egnat:mutable-egnat-metric-set)) &rest arguments) ¶(eql cl-data-structures.sets.skip-list:mutable-skip-list-set)) &rest arguments) ¶(eql cl-data-structures.sets.qp-trie:mutable-qp-trie-set)) &rest arguments) ¶(eql cl-data-structures.queues.2-3-tree:functional-2-3-queue)) &rest arguments) ¶(eql cl-data-structures.queues.2-3-tree:synchronized-mutable-2-3-queue)) &rest arguments) ¶(eql cl-data-structures.queues.2-3-tree:mutable-2-3-queue)) &rest arguments) ¶(eql cl-data-structures.sequences.rrb-vector:transactional-rrb-vector)) &rest arguments) ¶(eql cl-data-structures.sequences.rrb-vector:functional-rrb-vector)) &rest arguments) ¶(eql cl-data-structures.sequences.rrb-vector:mutable-rrb-vector)) &rest arguments) ¶(eql cl-data-structures.dicts.srrb:transactional-sparse-rrb-vector)) traversable &rest arguments) ¶(eql cl-data-structures.dicts.srrb:functional-sparse-rrb-vector)) traversable &rest arguments) ¶(eql cl-data-structures.dicts.srrb:mutable-sparse-rrb-vector)) traversable &rest arguments) ¶(eql cl-data-structures.dicts.hamt:transactional-hamt-dictionary)) &rest arguments) ¶(eql cl-data-structures.dicts.hamt:functional-hamt-dictionary)) &rest arguments) ¶(eql cl-data-structures.dicts.hamt:mutable-hamt-dictionary)) &rest arguments) ¶traversable) class &rest all &key &allow-other-keys) ¶mutable-skip-list-set) current-node last-node) ¶mutable-skip-list-dictionary) current-node last-node) ¶fundamental-skip-list) current-node last-node) ¶fundamental-sparse-vector) bucket function) ¶fundamental-hashing-dictionary) bucket function) ¶(eql cl-data-structures.meta:null-bucket)) function) ¶sequence) function) ¶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.
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.
one-bit-minhash) elements) ¶fundamental-minhash) elements) ¶minhash-corpus) elements) ¶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.
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.
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.
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.
fundamental-container)) ¶half-matrix) fn m1 &rest more) ¶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.
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.
fundamental-egnat-container) item maximal-distance) ¶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.
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.
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.
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.
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.
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.
file-releated-error)) ¶zipping-mixin)) ¶bidirectional-connecting-range)) ¶bidirectional-chain-of-ranges)) ¶bidirectional-filtering-proxy)) ¶bidirectional-proxy-box-range)) ¶hash-table-range)) ¶bidirectional-proxy-range)) ¶sequence-window)) ¶lazy-bidirectional-range)) ¶lazy-range)) ¶vector-range)) ¶mutable-rrb-range)) ¶moving-average-range)) ¶find-range)) ¶tokenizing-range)) ¶line-by-line-range)) ¶forward-distinct-proxy)) ¶forward-partition-if-proxy)) ¶forward-flatten-proxy)) ¶zipping-mixin)) ¶forward-connecting-range)) ¶forward-chain-of-ranges)) ¶cumulative-accumulate-range)) ¶forward-latch-proxy)) ¶repeat-proxy)) ¶restrain-size-proxy)) ¶forward-cartesian-range)) ¶multiplex-proxy)) ¶forward-filtering-proxy)) ¶shuffled-range)) ¶forward-proxy-box-range)) ¶hash-table-range)) ¶forward-proxy-range)) ¶mutable-skip-list-set-range)) ¶qp-trie-set-range)) ¶2-3-queue-range)) ¶mutable-skip-list-dictionary-range)) ¶egnat-range)) ¶fundamental-skip-list-range)) ¶chunked-rrb-range)) ¶sequence-window)) ¶forward-tree-range)) ¶lazy-forward-range)) ¶lazy-range)) ¶list-range)) ¶vector-range)) ¶empty-range)) ¶expression)) ¶chunked-range)) ¶mutable-rrb-range)) ¶assignable-forward-tree-range)) ¶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.
put!-function) container (structure mutable-skip-list-set) location &rest all) ¶erase*!-function) container (structure mutable-qp-trie-set) (location qp-trie-set-range) &rest all) ¶erase!-function) container (structure mutable-qp-trie-set) location &rest all) ¶put!-function) container (structure mutable-qp-trie-set) location &rest all) ¶take-out!-function) container (structure fixed-capacity-synchronization-mixin) location &rest all) ¶put!-function) container (structure fixed-capacity-synchronization-mixin) location &rest all) ¶put!-function) container (structure synchronization-mixin) location &rest all) ¶take-out!-function) container (structure synchronization-mixin) location &rest all) ¶take-out!-function) container (structure mutable-2-3-queue) location &rest all) ¶take-out!-function) container (structure transactional-2-3-queue) location &rest all) ¶take-out-function) container (structure functional-2-3-queue) location &rest all) ¶put!-function) container (structure transactional-2-3-queue) location &rest all) ¶put!-function) container (structure mutable-2-3-queue) location &rest all) ¶put-function) container (structure functional-2-3-queue) location &rest all) ¶grow-function) container (structure functional-rrb-vector) index &rest rest &key value &allow-other-keys) ¶grow-function) container (structure transactional-rrb-vector) index &rest rest &key value &allow-other-keys) ¶take-out-function) container (structure functional-rrb-vector) location &rest rest &key &allow-other-keys) ¶put!-function) container (structure transactional-rrb-vector) location &rest rest &key value &allow-other-keys) ¶functional-put-function) container (structure functional-rrb-vector) location &rest rest &key value &allow-other-keys) ¶put!-function) container (structure mutable-rrb-vector) location &rest rest &key value &allow-other-keys) ¶grow-function) (structure mutable-rrb-vector) container index &rest rest &key value &allow-other-keys) ¶take-out!-function) container (structure mutable-rrb-vector) location &rest rest &key &allow-other-keys) ¶take-out!-function) container (structure transactional-rrb-vector) location &rest rest &key &allow-other-keys) ¶take-out-back!-function) container (structure mutable-sequence) location &key value) ¶functional-take-out-back-function) container (structure functional-sequence) location &key value) ¶functional-put-back-function) container (structure functional-sequence) location &key value) ¶put-back!-function) container (structure mutable-sequence) location &key value) ¶shrink-function) container (structure functional-sparse-rrb-vector) position &rest all) ¶shrink-function) container (structure transactional-sparse-rrb-vector) position &rest all) ¶shrink-function) container (structure mutable-sparse-rrb-vector) position &rest all) ¶grow-function) container (structure functional-sparse-rrb-vector) position &rest all &key value) ¶grow-function) container (structure mutable-sparse-rrb-vector) position &rest all &key value) ¶grow-function) container (structure transactional-sparse-rrb-vector) position &rest all &key value) ¶grow-function) container (structure mutable-hamt-dictionary) location &rest all &key value) ¶shrink-function) container (structure mutable-hamt-dictionary) location &rest all &key) ¶shrink-function) container (structure transactional-hamt-dictionary) location &rest all &key) ¶shrink-function) container (structure functional-hamt-dictionary) location &rest all &key) ¶grow-function) container (structure transactional-hamt-dictionary) location &rest all &key value) ¶grow-function) container (structure functional-hamt-dictionary) location &rest all &key value) ¶shrink-function) container (structure mutable-skip-list-dictionary) location &rest all) ¶grow-function) container (structure mutable-skip-list-dictionary) location &rest all &key value) ¶grow-function) container (structure mutable-egnat-container) location &rest all) ¶erase*!-function) container (structure fundamental-skip-list) (location fundamental-skip-list-range) &rest all) ¶erase!-function) container (structure fundamental-skip-list) location &rest all) ¶lazy-box-container) location &rest args &key &allow-other-keys) ¶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.
fundamental-functional-queue) item) ¶functional-sequence) 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.
mutable-metric-space-set) item) ¶mutable-set) item) ¶fundamental-transactional-queue) item) ¶fundamental-mutable-queue) item) ¶mutable-sequence) item) ¶functional-sequence) item) ¶mutable-sequence) item) ¶field)) ¶automatically generated reader method
expression)) ¶automatically generated reader method
out-of-bounds)) ¶initialization-error)) ¶rrb-container)) ¶automatically generated reader method
fundamental-sparse-rrb-vector)) ¶automatically generated reader method
fundamental-hashing-dictionary)) ¶automatically generated reader method
implementation-modification-operation-status)) ¶automatically generated reader method
zipping-mixin)) ¶automatically generated reader method
cumulative-state)) ¶automatically generated reader method
forward-cartesian-range)) ¶automatically generated reader method
multiplex-proxy)) ¶automatically generated reader method
proxy-box-range)) ¶automatically generated reader method
proxy-box-range)) ¶automatically generated reader method
fundamental-hashing-dictionary)) ¶automatically generated reader method
hash-table-range)) ¶automatically generated reader method
with-previous-element-proxy)) ¶automatically generated reader method
%key.
distinct-proxy)) ¶automatically generated reader method
%key.
abstract-partition-if-proxy)) ¶automatically generated reader method
%key.
flatten-proxy)) ¶automatically generated reader method
%key.
establish-special-proxy)) ¶automatically generated reader method
%key.
multiplex-proxy)) ¶automatically generated reader method
%key.
group-by-proxy)) ¶automatically generated reader method
%key.
filtering-proxy)) ¶automatically generated reader method
%key.
proxy-box-range)) ¶automatically generated reader method
%key.
hash-table-range)) ¶automatically generated reader method
egnat-range-around)) ¶automatically generated reader method
egnat-range-around)) ¶automatically generated reader method
fundamental-skip-list)) ¶automatically generated reader method
proxy-range)) ¶automatically generated reader method
tagged-node)) ¶automatically generated reader method
fundamental-ownership-tagged-object)) ¶automatically generated reader method
fundamental-file-range-stack-cell)) ¶automatically generated reader method
tokenizing-range)) ¶automatically generated reader method
file-range-mixin)) ¶automatically generated reader method
fundamental-skip-list)) ¶automatically generated reader method
half-matrix)) ¶automatically generated reader method
assignable-forward-tree-range)) ¶automatically generated reader method
implementation-modification-operation-status)) ¶automatically generated reader method
invalid-value)) ¶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.
transactional-2-3-queue) &optional isolate) ¶transactional-rrb-vector) &optional isolate) ¶transactional-sparse-rrb-vector) &optional isolate) ¶hamt-dictionary) &optional isolate) ¶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.
moving-average-range)) ¶find-range)) ¶line-by-line-range)) ¶file-range-mixin)) ¶abstract-sliding-window-proxy)) ¶distinct-proxy)) ¶forward-partition-if-proxy)) ¶flatten-proxy)) ¶forward-connecting-range)) ¶forward-chain-of-ranges)) ¶cumulative-accumulate-range)) ¶latch-proxy)) ¶repeat-proxy)) ¶restrain-size-proxy)) ¶forward-cartesian-range)) ¶only-different-proxy)) ¶multiplex-proxy)) ¶shuffled-range)) ¶proxy-box-range)) ¶hash-table-range)) ¶proxy-range)) ¶qp-trie-set-range)) ¶mutable-qp-trie-set)) ¶fixed-capacity-synchronization-mixin)) ¶synchronization-mixin)) ¶2-3-queue-range)) ¶transactional-2-3-queue)) ¶mutable-2-3-queue)) ¶transactional-rrb-vector)) ¶mutable-rrb-vector)) ¶transactional-sparse-rrb-vector)) ¶mutable-sparse-rrb-vector)) ¶mutable-hamt-dictionary)) ¶egnat-range)) ¶fundamental-skip-list)) ¶fundamental-skip-list-range)) ¶sequence-window)) ¶forward-tree-range)) ¶lazy-box-container)) ¶list-range)) ¶vector-range)) ¶empty-range)) ¶expression)) ¶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.
egnat-range) (node egnat-subtree)) ¶egnat-range-around) (node egnat-subtree)) ¶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.
list) from to) ¶vector) from to) ¶sequence-window) from to) ¶sequence) from to) ¶fundamental-random-access-range) from to) ¶only-different-proxy) element can-mutate) ¶only-proxy) element can-mutate) ¶without-proxy) element can-mutate) ¶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.
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.
random-access-connecting-range)) ¶random-access-chain-of-ranges)) ¶hash-table-range)) ¶fundamental-qp-trie-set)) ¶synchronization-primitives-mixin)) ¶fundamental-queue)) ¶automatically generated reader method
fundamental-sparse-rrb-vector)) ¶hamt-dictionary)) ¶fundamental-egnat-container)) ¶automatically generated reader method
fundamental-skip-list)) ¶rrb-container)) ¶sequence-window)) ¶lazy-random-access-range)) ¶lazy-random-access-range)) ¶lazy-box-container)) ¶vector)) ¶vector-range)) ¶skip-list-node)) ¶(eql nil))) ¶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.
pipe-fragment)) ¶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.
aggregation-function) state) ¶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.
fundamental-functional-queue)) ¶functional-sequence)) ¶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.
fundamental-functional-queue)) ¶fundamental-transactional-queue)) ¶fundamental-mutable-queue)) ¶mutable-sequence)) ¶functional-sequence)) ¶mutable-sequence)) ¶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.
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.
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.
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.
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.
transactional)) ¶fundamental-container)) ¶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.
moving-average-range) function) ¶tokenizing-range) function) ¶line-by-line-range) function) ¶abstract-sliding-window-proxy) function) ¶distinct-proxy) function) ¶forward-partition-if-proxy) function) ¶flatten-proxy) function) ¶forward-chain-of-ranges) function) ¶cumulative-accumulate-range) function) ¶forward-establish-special-proxy-range) function) ¶latch-proxy) function) ¶repeat-proxy) function) ¶restrain-size-proxy) function) ¶multiplex-proxy) function) ¶filtering-proxy) function) ¶forward-proxy-box-range) function) ¶hash-table-range) function) ¶proxy-range) function) ¶mutable-skip-list-set-range) function) ¶qp-trie-set-range) function) ¶synchronization-primitives-mixin) function) ¶fundamental-sparse-rrb-vector) function) ¶mutable-skip-list-dictionary-range) function) ¶fundamental-egnat-container) function) ¶egnat-range) function) ¶fundamental-skip-list) function) ¶fundamental-skip-list-range) function) ¶rrb-container) function) ¶sequence-window) function) ¶forward-tree-range) function) ¶lazy-forward-range) function) ¶lazy-range) function) ¶list-range) function) ¶vector-range) function) ¶empty-range) function) ¶expression) function) ¶chunked-range) function) ¶sequence) function) ¶fundamental-range) function) ¶2-3-queue)) ¶automatically generated reader method
fundamental-sparse-rrb-vector)) ¶automatically generated reader method
rrb-container)) ¶automatically generated reader method
fundamental-container)) ¶Description:
Creates new data-sketch from the provided. Can be used to join sketches built on different data chunks.
bloom-filter) &rest more) ¶approximated-counts) &rest more) ¶approximated-set-cardinality) &rest more) ¶approximated-histogram) &rest more-sketches) ¶fundamental-data-sketch) &rest more-sketches) ¶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.
functional-sequence) location new-value) ¶functional-dictionary) location new-value) ¶functional-sparse-vector) 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.
mutable-dictionary) location new-value) ¶mutable-sparse-vector) location new-value) ¶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.
functional-sequence) location new-value condition-fn) ¶functional-dictionary) location new-value condition-fn) ¶functional-sparse-vector) 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.
functional-sequence) location new-value condition-fn) ¶mutable-dictionary) location new-value condition-fn) ¶mutable-sparse-vector) location new-value condition-fn) ¶harmonic-average-mutual-information-function) !field378) ¶mutual-information-matrix-function) !field257) ¶mutual-information-function) !field136) ¶optimal-split-point-function) !field1) ¶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.
approximated-set-cardinality)) ¶lazy-modification-operation-status)) ¶implementation-modification-operation-status)) ¶automatically generated reader method
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.
mutable-skip-list-set)) ¶fundamental-qp-trie-set)) ¶synchronization-mixin)) ¶lazy-box-sequence)) ¶fundamental-sparse-rrb-vector)) ¶hamt-dictionary)) ¶mutable-skip-list-dictionary)) ¶lazy-box-dictionary)) ¶fundamental-egnat-container)) ¶rrb-container)) ¶hamt-container)) ¶vector)) ¶fundamental-range)) ¶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.
forward-only-different-proxy) (chunk fundamental-forward-range)) ¶forward-only-proxy) (chunk fundamental-forward-range)) ¶without-proxy) (chunk fundamental-forward-range)) ¶forward-proxy-box-range) (chunk fundamental-forward-range)) ¶fundamental-ownership-tagged-object) fundamental-ownership-tagged-object) ¶automatically generated writer method
approximated-set-cardinality) &rest all) ¶bloom-filter) &rest all) ¶fundamental-data-sketch) &rest all) ¶approximated-counts) &rest all) ¶linear-regression-fit) &rest rest) ¶rrb-container) &key &allow-other-keys) ¶sequence-window) &key &allow-other-keys) ¶fundamental-egnat-container) &rest all) ¶egnat-node) &rest all) ¶pipe-fragment) &key queue-size &allow-other-keys) ¶future-carousel) &key &allow-other-keys) ¶file-range-mixin) &rest all) ¶vector-range) &key &allow-other-keys) ¶expression) &rest all &key &allow-other-keys) ¶parallel-group-by-proxy) &key test groups key &allow-other-keys) ¶forward-chain-of-ranges) &key &allow-other-keys) ¶forward-connecting-range) &key &allow-other-keys) ¶group-by-proxy) &key test groups key &allow-other-keys) ¶directory-file-range-stack-cell) &key path &allow-other-keys) ¶regex-file-file-range-stack-cell) &key path &allow-other-keys) ¶file-file-range-stack-cell) &key path predicate &allow-other-keys) ¶recursive-content-file-range-stack-cell) &key path &allow-other-keys) ¶regex-directory-file-range-stack-cell) &key path times &allow-other-keys) ¶approximated-histogram) stream) ¶skip-list-node) stream) ¶assoc-skip-list-node) stream) ¶hash-table-range) stream) ¶:parameter, :argument
This slot is read-only.
Description:
Error signaled when passed the argument exceeds allowed bounds
condition.
| Initarg | Value |
|---|---|
:format-control | empty array as key in the qp-trie-set.~% |
incompatible-arguments.
textual-error.
Description:
Error signaled when the container can’t be initialized.
reference-condition.
textual-error.
:class
This slot is read-only.
Description:
Error signaled when the container can’t be initialized with a value because it exceeds bounds.
Description:
Error signaled if (for whatever reason) passed argument is invalid.
argument-error.
reference-condition.
reference-condition.
textual-error.
:value
This slot is read-only.
Description:
Error signaled when unimlemented functionality is accessed.
simple-error.
reference-condition.
textual-error.
Description:
Error signaled when a some value is out of the expected bounds.
:bounds
This slot is read-only.
Description:
Error with a human readable text description.
chainable-condition.
simple-error.
Description:
Error signaled when passed argument was unexpected.
structure-object.
(serapeum:-> (t) t)
(function identity)
(serapeum:-> nil t)
(lambda nil nil)
(serapeum:-> nil t)
(lambda nil nil)
structure-object.
node.
cl-data-structures.meta:null-bucket
:left
cl-data-structures.meta:null-bucket
:middle
cl-data-structures.meta:null-bucket
:right
Description: Class of ADD.
add-function.
destructive-function.
standard-generic-function.
Description:
Class of ADD and ADD!.
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.
%summary-function.
absolute-value-norm-function.
accumulate-function.
approximated-counts-function.
approximated-histogram-function.
approximated-set-cardinality-function.
approximated-top-k-function.
array-average-function.
array-geometric-average-function.
array-harmonic-average-function.
array-sum-function.
average-function.
bloom-filter-function.
co-occurence-table-function.
count-elements-function.
entropy-function.
enumerate-function.
extrema-function.
extremum-function.
fast-map-function.
first-element-function.
frequency-function.
gather-corpus-function.
geometric-average-function.
gini-impurity-function.
harmonic-average-function.
harmonic-average-mutual-information-function.
hodges-lehmann-estimator-function.
last-element-function.
median-absolute-deviation-function.
moments-function.
mutual-information-function.
mutual-information-matrix-function.
optimal-split-point-function.
rate-function.
reservoir-sample-function.
simple-linear-regression-function.
standard-deviation-function.
sum-function.
summary-aggregation-function.
to-hash-table-function.
to-list-function.
to-vector-function.
variance-function.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
apply-aggregation-function.
apply-range-function.
apply-range-function.
apply-range-function.
state-result.
(simple-array alexandria:non-negative-fixnum (* *))
:counters
vector
:hashes
:depth
:width
| Initarg | Value |
|---|---|
:maximal-bins-count | 128 |
:fill-pointer | 0 |
:count | 0 |
:bins | (vector) |
:min | most-positive-double-float |
:max | most-negative-double-float |
:maximal-bins-count
This slot is read-only.
:bins
:fill-pointer
:count
:min
:max
:registers
(serapeum:-> (t t) t)
:store-value
This slot is read-only.
simple-bit-vector
:counters
vector
:hashes
fixnum
:width
fixnum
:depth
chunkable-bidirectional-connecting-range.
chunkable-forward-connecting-range.
chunkable-random-access-connecting-range.
chunked-proxy-range.
chunked-range.
expression.
find-range.
flatten-proxy.
forward-cartesian-range.
forward-chain-of-ranges.
forward-distinct-proxy.
forward-repeat-proxy.
forward-restrain-size-proxy.
latch-proxy.
line-by-line-range.
multiplex-proxy.
shuffled-range.
tokenizing-range.
zipping-mixin.
Description:
Instances of this class can be passed to functions in cl-ds expecting a file path (like for instance LINE-BY-LINE).
string
:command-string
This slot is read-only.
:state
This slot is read-only.
Description:
Function that inherits this class is expected to perform side effects.
funcallable-standard-object.
Description: Class of ERASE.
destructive-function.
erase-function.
standard-generic-function.
destructive-function.
erase-function.
standard-generic-function.
erase-function.
functional-function.
standard-generic-function.
Description:
Class of ERASE and ERASE!.
Description: Class of ERASE-IF!.
destructive-function.
erase-if-function.
standard-generic-function.
Description:
Class of ERASE-IF and ERASE-IF!.
function
:construct-function
This slot is read-only.
:arguments
This slot is read-only.
:arguments-closure
:finished-closure
:closure
:arguments
This slot is read-only.
boolean
:reached-end
alexandria:non-negative-integer
:initial-position
alexandria:non-negative-integer
:initial-position
This slot is read-only.
list
(list nil)
:stream
:key
This slot is read-only.
list
:forward-stack
(serapeum:-> ((serapeum:-> nil t) (serapeum:-> (t) t)) (values t boolean))
:obtain-value
This slot is read-only.
list
:initial-stack
This slot is read-only.
(serapeum:-> (t) t)
:key
This slot is read-only.
cl-data-structures:fundamental-container
:container
This slot is read-only.
Description:
Object implements functional api.
Description:
An functional queue based around 2-3 tree data structur.
Description: Class of ADD.
add-function.
functional-function.
standard-generic-function.
Description:
Functional variant of a dictionary.
Description: Class of ERASE.
erase-function.
functional-function.
standard-generic-function.
Description: Class of ERASE-IF.
erase-if-function.
functional-function.
standard-generic-function.
Description:
Function that inherits this class is not allowed to perform any side effects.
funcallable-standard-object.
erase*-function.
functional-add-function.
functional-erase-function.
functional-erase-if-function.
functional-insert-function.
functional-put-back-function.
functional-put-front-function.
functional-put-function.
functional-take-out-back-function.
functional-take-out-front-function.
functional-take-out-function.
functional-update-function.
functional-update-if-function.
Description:
HAMT dictionary that implements functional api.
Description:
Functional variant of hashing a dictionary.
Description: Class of INSERT.
functional-function.
insert-function.
standard-generic-function.
functional-function.
put-back-function.
standard-generic-function.
functional-function.
put-front-function.
standard-generic-function.
functional-function.
put-function.
standard-generic-function.
Description:
Functional variant of the RRB vector.
Description:
SRRB sparse vector that implements mutable api.
functional-function.
standard-generic-function.
take-out-back-function.
functional-function.
standard-generic-function.
take-out-front-function.
functional-function.
standard-generic-function.
take-out-function.
Description: Class of UPDATE.
functional-function.
standard-generic-function.
update-function.
Description: Class of UPDATE-IF.
functional-function.
standard-generic-function.
update-if-function.
Description:
The root class of the containers.
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.
:hash-fn
Description:
Container that provides location to value mapping. Either ordered or unordered.
integer
:branching-factor
This slot is read-only.
integer
:samples-count
This slot is read-only.
:single-float
:metric-type
This slot is read-only.
integer
:content-count-in-node
This slot is read-only.
integer
0
:root
2-3-queue-range.
chunked-proxy-range.
chunked-range.
chunked-rrb-range.
cumulative-accumulate-range.
egnat-range.
empty-range.
expression.
find-range.
forward-abstract-partition-if-proxy.
forward-bootstrap-proxy.
forward-cartesian-range.
forward-chain-of-ranges.
forward-connecting-range.
forward-distinct-proxy.
forward-filtering-proxy.
forward-flatten-proxy.
forward-group-by-proxy.
forward-latch-proxy.
forward-multiplex-proxy.
forward-parallel-group-by-proxy.
forward-proxy-range.
forward-tree-range.
forward-with-previous-element-proxy.
fundamental-assignable-forward-range.
fundamental-bidirectional-range.
fundamental-skip-list-range.
lazy-forward-range.
line-by-line-range.
list-range.
moving-average-range.
qp-trie-set-range.
shuffled-range.
tokenizing-range.
Description:
A fundamental base class of all functional queues.
Description:
Dictionary that uses hashing function. Hashing function is assumed to return fixnum.
Description:
The base class of all fundamental modification status classes.
Description:
A fundamental base class of all mutable queues.
:ownership-tag
across.
at.
between*.
clone.
empty-clone.
size.
whole-range.
Description:
A fundamental base class of all queues.
0
:size
| Initarg | Value |
|---|---|
:maximum-level | 32 |
:ordering-function
This slot is read-only.
:test-function
simple-vector
:pointers
This slot is read-only.
:maximum-level
| Initarg | Value |
|---|---|
:last-node | nil |
:current-node
:current-node
This slot is read-only.
:last-node
This slot is read-only.
funcallable-standard-object.
vector
:vector
This slot is read-only.
fixnum
0
:function
This slot is read-only.
Description:
Function will attempt to add new element to container.
funcallable-standard-object.
Description:
Matrix container suitable for storing symetric data (like distances). Does not store diagonal values.
simple-array
:content
This slot is read-only.
Hash node pointing to root of the whole hash tree.
:root
How many elements are in there?
alexandria:non-negative-fixnum
0
:size
alexandria:positive-fixnum
3
:bucket-size
This slot is read-only.
Description:
Root HAMT dictionary class.
:hash-table
This slot is read-only.
fixnum
:begin
fixnum
:begin
This slot is read-only.
fixnum
:end
fixnum
:end
This slot is read-only.
Description: Class of INSERT.
destructive-function.
insert-function.
standard-generic-function.
Description:
Class of INSERT and (SETF AT).
array-elementwise-function.
bootstrap-function.
cumulative-accumulate-function.
distinct-function.
establish-special-function.
flatten-lists-function.
group-by-function.
hash-table-elementwise-function.
in-batches-function.
latch-function.
moving-average-function.
multiplex-function.
on-each-function.
only-different-function.
only-function.
parallel-group-by-function.
parallel-multiplex-function.
parallel-on-each-function.
partition-if-function.
repeat-function.
restrain-size-function.
sliding-window-function.
thread-buffer-function.
with-previous-element-function.
without-function.
Description:
Functional object, with lazy implementation.
(or null cl-data-structures.common::changes)
:operations
Description:
Lazy variant of a dictionary.
Description:
Lazy variant of a hashing dictionary.
Description:
Fundamental class for all metric-space-dictionaries
Description:
Fundamental class for all metric space sets.
:metric-fn
This slot is read-only.
Description:
Object implements mutable api.
Description:
An mutable queue based around 2-3 tree data structur.
Description:
Mutable variant of a dictionary.
Description:
HAMT dictionary that implements mutable api.
Description:
Mutable variant of hashing a dictionary.
Description:
Fundamental class for all mutable metric space dictionaries
Description:
Fundamental class for all mutable metric space sets.
Description:
Mutable variant of the mutable-qp-trie-set.
Description:
Mutable variant of the RRB vector.
Description: Mutable skip list set.
Description:
SRRB sparse vector that implements mutable api.
at.
clone.
read-offset.
fixnum
0
:offset
This slot is read-only.
funcallable-standard-object.
This slot is read-only.
(serapeum:vect)
This slot is read-only.
(bordeaux-threads:make-lock)
This slot is read-only.
:operation
This slot is read-only.
:end-on-empty
This slot is read-only.
This slot is read-only.
| Initarg | Value |
|---|---|
:functor | nil |
:functor-constructor | (function identity) |
:functor
:functor-prototype
This slot is read-only.
:functor-constructor
This slot is read-only.
:key
This slot is read-only.
abstract-partition-if-proxy.
bidirectional-proxy-range.
bootstrap-proxy.
buffer-range.
chunked-proxy-range.
cumulative-accumulate-range.
distinct-proxy.
filtering-proxy.
flatten-proxy.
forward-proxy-range.
group-by-proxy.
latch-proxy.
moving-average-range.
multiplex-proxy.
parallel-group-by-proxy.
proxy-box-range.
random-access-proxy-range.
repeat-proxy.
restrain-size-proxy.
with-previous-element-proxy.
:original-range
This slot is read-only.
destructive-function.
put-function.
standard-generic-function.
destructive-function.
put-back-function.
standard-generic-function.
destructive-function.
put-front-function.
standard-generic-function.
| Initarg | Value |
|---|---|
:root | (make-qp-trie-node) |
:root
at.
Description:
Fundamental class of all functions operating on ranges (layer and aggregator functions).
standard-generic-function.
root of the tree
(or cl-data-structures.common.rrb:rrb-node nil)
:root
cl-data-structures.common.rrb:shift
0
:shift
alexandria:non-negative-fixnum
0
:size
t
:element-type
This slot is read-only.
cl-data-structures.common.rrb:node-size
0
:tail-size
(or null simple-array)
:tail
(setf access-container).
access-container.
(setf access-last-size).
access-last-size.
(setf access-lower-bound).
access-lower-bound.
(setf access-start).
access-start.
(setf access-upper-bound).
access-upper-bound.
across.
at.
chunked.
clone.
consume-back.
consume-front.
initialize-instance.
peek-back.
peek-front.
read-content.
read-initial-lower-bound.
read-initial-upper-bound.
read-mutex.
reset!.
size.
traverse.
| Initarg | Value |
|---|---|
:mutex | (make-lock) |
fixnum
bordeaux-threads:lock
:mutex
This slot is read-only.
fixnum
fixnum
fixnum
:upper-bound
fixnum
:initial-lower-bound
This slot is read-only.
fixnum
:initial-upper-bound
This slot is read-only.
This slot is read-only.
:container
Description:
Function will attempt to remove element from container.
funcallable-standard-object.
:ownership-tag
This slot is read-only.
destructive-function.
standard-generic-function.
take-out-function.
destructive-function.
standard-generic-function.
take-out-back-function.
destructive-function.
standard-generic-function.
take-out-front-function.
Description:
Object implements mutable api in a transactional way.
Description:
An transactional queue based around 2-3 tree data structure.
Description:
Transactional variant of a dictionary.
Description:
Transactional HAMT dictionary that implements mutable api.
Description:
Transactional variant of hashing a dictionary.
Description:
Transactional variant of the RRB vector.
Description:
Transactional SRRB sparse vector that implements mutable api.
| Initarg | Value |
|---|---|
:ownership-tag | (make-ownership-tag) |
across-aggregate.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
aggregator-constructor.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-layer.
apply-range-function.
make-proxy.
on-each-proxy-range-from-range.
cl-data-structures.meta:null-bucket
:root
Description: Class of UPDATE.
destructive-function.
standard-generic-function.
update-function.
Description:
Class of UPDATE and UPDATE!.
Description: Class of UPDATE-IF!.
destructive-function.
standard-generic-function.
update-if-function.
Description:
Class of UPDATE-IF and UPDATE-IF!.
| Initarg | Value |
|---|---|
:lower-bound | 0 |
vector
:vector
This slot is read-only.
fixnum
:lower-bound
This slot is read-only.
fixnum
:upper-bound
This slot is read-only.
fixnum
:lower-bound
fixnum
:upper-bound
Vector with content of the node
Effectivly index in the node-content
Basicly either node-content or pair of node-content and ownership-tag
pass.
Can’t calculate mutual information for continues variables, so we will divide whole range into segments.
end.
node.
How to divide vector into equal partitions?
w.
end.
Removes those leading directory components from PATHSPEC that are shared with DEFAULT.
expression)) ¶automatically generated reader method
expression)) ¶automatically generated writer method
hash-table-range)) ¶automatically generated reader method
hash-table-range)) ¶automatically generated writer method
approximated-histogram)) ¶automatically generated reader method
approximated-histogram)) ¶automatically generated writer method
egnat-subtree)) ¶automatically generated reader method
egnat-subtree)) ¶automatically generated writer method
expression)) ¶automatically generated reader method
expression)) ¶automatically generated writer method
forward-partition-if-proxy)) ¶automatically generated reader method
forward-partition-if-proxy)) ¶automatically generated writer method
2-3-queue-range)) ¶automatically generated reader method
2-3-queue-range)) ¶automatically generated writer method
list-range)) ¶automatically generated reader method
list-range)) ¶automatically generated writer method
approximated-histogram)) ¶automatically generated reader method
approximated-histogram)) ¶automatically generated writer method
moving-average-range)) ¶automatically generated reader method
moving-average-range)) ¶automatically generated writer method
bloom-filter)) ¶automatically generated reader method
approximated-counts)) ¶automatically generated reader method
bloom-filter)) ¶automatically generated writer method
approximated-counts)) ¶automatically generated writer method
abstract-sliding-window-proxy)) ¶automatically generated reader method
flatten-proxy)) ¶automatically generated reader method
multiplex-proxy)) ¶automatically generated reader method
abstract-sliding-window-proxy)) ¶automatically generated writer method
flatten-proxy)) ¶automatically generated writer method
multiplex-proxy)) ¶automatically generated writer method
sequence-window)) ¶automatically generated reader method
sequence-window)) ¶automatically generated writer method
fundamental-skip-list-range)) ¶automatically generated reader method
fundamental-skip-list-range)) ¶automatically generated writer method
bloom-filter)) ¶automatically generated reader method
approximated-counts)) ¶automatically generated reader method
bloom-filter)) ¶automatically generated writer method
approximated-counts)) ¶automatically generated writer method
egnat-subtree)) ¶automatically generated reader method
egnat-subtree)) ¶automatically generated writer method
lazy-modification-operation-status)) ¶automatically generated reader method
lazy-modification-operation-status)) ¶automatically generated writer method
hash-table-range)) ¶automatically generated reader method
%end.
hash-table-range)) ¶automatically generated writer method
%end.
approximated-histogram)) ¶automatically generated reader method
approximated-histogram)) ¶automatically generated writer method
expression)) ¶automatically generated reader method
expression)) ¶automatically generated writer method
forward-tree-range)) ¶automatically generated reader method
forward-tree-range)) ¶automatically generated writer method
fundamental-data-sketch)) ¶automatically generated reader method
fundamental-data-sketch)) ¶automatically generated writer method
bloom-filter)) ¶automatically generated reader method
approximated-counts)) ¶automatically generated reader method
bloom-filter)) ¶automatically generated writer method
approximated-counts)) ¶automatically generated writer method
future-carousel)) ¶automatically generated reader method
future-carousel)) ¶automatically generated writer method
shuffled-range)) ¶automatically generated reader method
shuffled-range)) ¶automatically generated writer method
stateful-file-range-stack-cell)) ¶automatically generated reader method
stateful-file-range-stack-cell)) ¶automatically generated writer method
sequence-window)) ¶automatically generated reader method
sequence-window)) ¶automatically generated writer method
line-by-line-range)) ¶automatically generated reader method
line-by-line-range)) ¶automatically generated writer method
vector-range)) ¶automatically generated reader method
vector-range)) ¶automatically generated writer method
approximated-histogram)) ¶automatically generated reader method
%max.
approximated-histogram)) ¶automatically generated writer method
%max.
approximated-histogram)) ¶automatically generated reader method
%min.
approximated-histogram)) ¶automatically generated writer method
%min.
2-3-queue-range)) ¶automatically generated reader method
2-3-queue-range)) ¶automatically generated writer method
lazy-box-container)) ¶automatically generated reader method
lazy-box-container)) ¶automatically generated writer method
repeat-proxy)) ¶automatically generated reader method
restrain-size-proxy)) ¶automatically generated reader method
repeat-proxy)) ¶automatically generated writer method
restrain-size-proxy)) ¶automatically generated writer method
fundamental-file-range-stack-cell)) ¶automatically generated reader method
file-file-range-stack-cell)) ¶regex-directory-file-range-stack-cell)) ¶directory-file-range-stack-cell)) ¶regex-directory-file-range-stack-cell)) ¶fundamental-file-range-stack-cell)) ¶automatically generated writer method
only-different-proxy)) ¶automatically generated reader method
only-different-proxy)) ¶automatically generated writer method
only-different-proxy)) ¶automatically generated reader method
only-different-proxy)) ¶automatically generated writer method
approximated-set-cardinality)) ¶automatically generated reader method
approximated-set-cardinality)) ¶automatically generated writer method
split-point-field)) ¶automatically generated reader method
split-point-field)) ¶automatically generated writer method
egnat-range)) ¶automatically generated reader method
egnat-range)) ¶automatically generated writer method
find-range)) ¶automatically generated reader method
find-range)) ¶automatically generated writer method
stateful-file-range-stack-cell)) ¶automatically generated reader method
stateful-file-range-stack-cell)) ¶automatically generated writer method
cumulative-state)) ¶automatically generated reader method
cumulative-state)) ¶automatically generated writer method
moving-average-range)) ¶automatically generated reader method
%sum.
moving-average-range)) ¶automatically generated writer method
%sum.
abstract-sliding-window-proxy)) ¶automatically generated reader method
abstract-sliding-window-proxy)) ¶automatically generated writer method
vector-range)) ¶automatically generated reader method
vector-range)) ¶automatically generated writer method
bloom-filter)) ¶automatically generated reader method
approximated-counts)) ¶automatically generated reader method
bloom-filter)) ¶automatically generated writer method
approximated-counts)) ¶automatically generated writer method
abstract-sliding-window-proxy)) ¶automatically generated reader method
abstract-sliding-window-proxy)) ¶automatically generated writer method
egnat-node)) ¶egnat-subtree)) ¶fundamental-file-range-stack-cell)) ¶regex-directory-file-range-stack-cell)) ¶stateful-file-range-stack-cell)) ¶bloom-filter) &rest more) ¶approximated-counts) &rest more) ¶approximated-set-cardinality) &rest more-sketches) ¶fundamental-data-sketch) &rest more-sketches) ¶qp-trie-range-stack-cell)) ¶automatically generated reader method
file-file-range-stack-cell)) ¶regex-directory-file-range-stack-cell)) ¶regex-file-file-range-stack-cell)) ¶all-files-file-range-stack-cell)) ¶recursive-content-file-range-stack-cell)) ¶directory-file-range-stack-cell)) ¶vector-sequence-window) index) ¶random-access-sequence-window) index) ¶list-sequence-window) index) ¶qp-trie-set-range)) ¶automatically generated reader method
fundamental-forward-range) class) ¶fundamental-bidirectional-range) (class (eql cl-data-structures:fundamental-random-access-range))) ¶fundamental-bidirectional-range) (class (eql cl-data-structures:fundamental-bidirectional-range))) ¶fundamental-random-access-range) class) ¶destructive-function) container (bucket list) location hash value &rest all) ¶functional-function) container bucket location hash value &rest all) ¶qp-trie-set-range)) ¶automatically generated reader method
(eql cl-data-structures.streaming-algorithms::minhash-corpus))) ¶(eql cl-data-structures.algorithms::reservoir-sampling))) ¶(eql cl-data-structures.common.skip-list:fundamental-skip-list))) ¶(eql cl-data-structures.common.skip-list::assoc-skip-list-node))) ¶(eql cl-data-structures.common.skip-list:skip-list-node))) ¶composite-container)) ¶automatically generated reader method
(eql :all-files)) &key predicate) ¶(eql :all-directories)) &key path predicate) ¶(eql :file)) &key path predicate) ¶(eql :regex-file)) &key path predicate) ¶(eql :regex-directory)) &key path times predicate) ¶(eql :directory)) &key path predicate) ¶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.
approximated-histogram)) ¶automatically generated reader method
xors-callback-minhash) element) ¶seeds-callback-minhash) element) ¶polynomial-callback-minhash) element) ¶minhash-corpus) element) ¶qp-trie-range-stack-cell)) ¶automatically generated reader method
qp-trie-range-stack-cell)) ¶automatically generated reader method
egnat-range) stack) ¶egnat-range-around) stack) ¶qp-trie-range-stack-cell)) ¶automatically generated reader method
traversable) function key functor-constructor) ¶fundamental-random-access-range) function key functor-constructor) ¶fundamental-bidirectional-range) function key functor-constructor) ¶qp-trie-range-stack-cell)) ¶automatically generated reader method
invalid-value) stream) ¶unexpected-argument) stream) ¶argument-error) stream) ¶not-in-allowed-set) stream) ¶argument-value-out-of-bounds) stream) ¶dimensionality-error) stream) ¶file-releated-error) stream) ¶initialization-error) stream) ¶textual-error) stream) ¶argument-error)) ¶abstract-in-batches-proxy)) ¶automatically generated reader method
establish-special-proxy)) ¶automatically generated reader method
expression)) ¶automatically generated reader method
fundamental-egnat-container)) ¶automatically generated reader method
hamt-container)) ¶automatically generated reader method
fixed-capacity-synchronization-mixin)) ¶automatically generated reader method
implementation-modification-operation-status)) ¶automatically generated reader method
egnat-subtree)) ¶automatically generated reader method
chunked-range)) ¶automatically generated reader method
buffer-range)) ¶automatically generated reader method
parallel-on-each-proxy)) ¶automatically generated reader method
parallel-group-by-proxy)) ¶automatically generated reader method
parallel-forward-multiplex-proxy)) ¶automatically generated reader method
chunked-proxy-range)) ¶automatically generated reader method
partition-if-proxy)) ¶automatically generated reader method
egnat-subtree)) ¶automatically generated reader method
bootstrap-proxy)) ¶automatically generated reader method
only-different-proxy)) ¶automatically generated reader method
bootstrap-proxy)) ¶automatically generated reader method
forward-tree-range)) ¶automatically generated reader method
lazy-range)) ¶automatically generated reader method
egnat-range)) ¶automatically generated reader method
sequence-window)) ¶automatically generated reader method
egnat-subtree)) ¶automatically generated reader method
egnat-node)) ¶automatically generated reader method
half-matrix)) ¶automatically generated reader method
forward-chain-of-ranges)) ¶automatically generated reader method
forward-cartesian-range)) ¶automatically generated reader method
fundamental-egnat-container)) ¶automatically generated reader method
bootstrap-proxy)) ¶automatically generated reader method
cumulative-state)) ¶automatically generated reader method
info-field)) ¶automatically generated reader method
info-field)) ¶automatically generated reader method
split-point-field)) ¶automatically generated reader method
egnat-subtree)) ¶automatically generated reader method
pipe-fragment)) ¶automatically generated reader method
sequence-window)) ¶automatically generated reader method
shuffled-range)) ¶automatically generated reader method
future-carousel)) ¶automatically generated reader method
parallel-group-by-proxy)) ¶automatically generated reader method
group-by-proxy)) ¶automatically generated reader method
polynomial-callback-minhash)) ¶automatically generated reader method
callback-minhash)) ¶automatically generated reader method
parallel-group-by-proxy)) ¶automatically generated reader method
group-by-proxy)) ¶automatically generated reader method
hash-table-range)) ¶automatically generated reader method
moving-average-range)) ¶automatically generated reader method
multiplex-proxy)) ¶automatically generated reader method
fundamental-skip-list-range)) ¶automatically generated reader method
abstract-sliding-window-proxy)) ¶automatically generated reader method
hash-table-range)) ¶automatically generated reader method
line-by-line-range)) ¶automatically generated reader method
vector-range)) ¶automatically generated reader method
file-range-mixin)) ¶automatically generated reader method
repeat-proxy)) ¶automatically generated reader method
restrain-size-proxy)) ¶automatically generated reader method
only-different-proxy)) ¶automatically generated reader method
only-different-proxy)) ¶automatically generated writer method
only-different-proxy)) ¶automatically generated reader method
only-different-proxy)) ¶automatically generated writer method
forward-tree-range)) ¶automatically generated reader method
egnat-range)) ¶automatically generated reader method
cumulative-accumulate-range)) ¶automatically generated reader method
moving-average-range)) ¶automatically generated reader method
vector-range)) ¶automatically generated reader method
abstract-sliding-window-proxy)) ¶automatically generated reader method
fundamental-minhash)) ¶automatically generated reader method
%k.
moving-average-range)) ¶automatically generated reader method
%key.
bootstrap-proxy)) ¶automatically generated reader method
%key.
forward-tree-range)) ¶automatically generated reader method
%key.
half-matrix)) ¶automatically generated reader method
%key.
parallel-group-by-proxy)) ¶automatically generated reader method
%key.
fundamental-skip-list-range)) ¶automatically generated reader method
latch-proxy)) ¶automatically generated reader method
latch-proxy)) ¶automatically generated writer method
lazy-modification-operation-status)) ¶automatically generated reader method
synchronization-primitives-mixin)) ¶automatically generated reader method
approximated-histogram)) ¶automatically generated reader method
buffer-range)) ¶automatically generated reader method
parallel-on-each-proxy)) ¶automatically generated reader method
parallel-group-by-proxy)) ¶automatically generated reader method
parallel-forward-multiplex-proxy)) ¶automatically generated reader method
metric-space-set)) ¶automatically generated reader method
fundamental-egnat-container)) ¶automatically generated reader method
2-3-queue-range)) ¶automatically generated reader method
info-field)) ¶automatically generated reader method
synchronization-primitives-mixin)) ¶automatically generated reader method
fixed-capacity-synchronization-mixin)) ¶automatically generated reader method
forward-tree-range)) ¶automatically generated reader method
offset-vector-range)) ¶automatically generated reader method
abstract-partition-if-proxy)) ¶automatically generated reader method
pipe-fragment)) ¶automatically generated reader method
forward-partition-if-proxy)) ¶automatically generated reader method
list-range)) ¶automatically generated reader method
forward-chain-of-ranges)) ¶automatically generated reader method
info-field)) ¶automatically generated reader method
chunked-range)) ¶automatically generated reader method
distinct-proxy)) ¶automatically generated reader method
split-point-field)) ¶automatically generated reader method
bootstrap-proxy)) ¶automatically generated reader method
fundamental-file-range-stack-cell)) ¶automatically generated reader method
only-proxy)) ¶automatically generated reader method
without-proxy)) ¶automatically generated reader method
pipe-fragment)) ¶automatically generated reader method
lazy-range)) ¶automatically generated reader method
forward-connecting-range)) ¶automatically generated reader method
tokenizing-range)) ¶automatically generated reader method
cumulative-state)) ¶automatically generated reader method
chunked-rrb-range)) ¶automatically generated reader method
bootstrap-proxy)) ¶automatically generated reader method
bootstrap-proxy)) ¶automatically generated reader method
fundamental-egnat-container)) ¶automatically generated reader method
seeds-callback-minhash)) ¶automatically generated reader method
distinct-proxy)) ¶automatically generated reader method
info-field)) ¶automatically generated reader method
pipe-fragment)) ¶automatically generated reader method
pipe-fragment)) ¶automatically generated reader method
restrain-size-proxy)) ¶automatically generated reader method
info-field)) ¶automatically generated reader method
minhash-corpus)) ¶automatically generated reader method
shuffled-range)) ¶automatically generated reader method
info-field)) ¶automatically generated reader method
abstract-partition-if-proxy)) ¶automatically generated reader method
pipe-fragment)) ¶automatically generated reader method
regex-directory-file-range-stack-cell)) ¶automatically generated reader method
repeat-proxy)) ¶automatically generated reader method
sequence-window)) ¶automatically generated reader method
%to.
shuffled-range)) ¶automatically generated reader method
%to.
parallel-group-by-proxy)) ¶automatically generated reader method
group-by-proxy)) ¶automatically generated reader method
future-carousel)) ¶automatically generated reader method
vector-range)) ¶automatically generated reader method
chunked-rrb-range)) ¶automatically generated reader method
abstract-sliding-window-proxy)) ¶automatically generated reader method
xors-callback-minhash)) ¶automatically generated reader method
egnat-node) container operation item additional-arguments) ¶egnat-subtree) container operation item additional-arguments) ¶(eql nil)) container operation item additional-arguments) ¶fundamental-file-range-stack-cell)) ¶stateful-file-range-stack-cell)) ¶composite-container)) ¶automatically generated reader method
composite-container)) ¶automatically generated writer method
line-by-line-range) stream) ¶file-range-mixin) stream) ¶functional-function) container (bucket list) location hash &rest all) ¶destructive-function) container bucket location hash &rest all) ¶qp-trie-set-range)) ¶automatically generated reader method
qp-trie-set-range)) ¶automatically generated writer method
qp-trie-set-range)) ¶automatically generated reader method
(eql :type)) argument-name field-name value-name value-found body) ¶(eql :default)) argument-name field-name value-name value-found body) ¶(eql :member)) argument-name field-name value-name value-found body) ¶(eql :optional)) argument-name field-name value-name value-found body) ¶implementation-modification-operation-status) implementation-modification-operation-status) ¶automatically generated writer method
implementation-modification-operation-status) implementation-modification-operation-status) ¶automatically generated writer method
lazy-modification-operation-status) lazy-modification-operation-status) ¶automatically generated writer method
implementation-modification-operation-status) implementation-modification-operation-status) ¶automatically generated writer method
structure-object.
vector
(serapeum:vect)
(or cl-data-structures.common::changes null)
fixnum
1
boolean
t
structure-object.
cl-data-structures.common.qp-trie::full-mask
0
simple-vector
(make-array 0 :element-type (quote cl-data-structures.common.qp-trie:qp-trie-node))
structure-object.
cl-data-structures.common.rrb:node-size
0
cl-data-structures.common.rrb:node-size
0
alexandria:non-negative-fixnum
0
alexandria:non-negative-fixnum
0
boolean
tree.
(setf access-head).
access-head.
(setf access-head-position).
access-head-position.
(setf access-tail).
access-tail.
(setf access-tail-end).
access-tail-end.
(setf access-tail-position).
access-tail-position.
across.
at.
at.
become-transactional.
empty-clone.
read-element-type.
traverse.
type-specialization.
whole-range.
t
:element-type
This slot is read-only.
:head
cl-data-structures.queues.2-3-tree::buffer-index
0
:head-position
:tail
cl-data-structures.queues.2-3-tree::buffer-index
0
:tail-position
cl-data-structures.queues.2-3-tree::buffer-index
0
:tail-end
:batch-size
This slot is read-only.
| Initarg | Value |
|---|---|
:initial-current-position | 0 |
:window-size
This slot is read-only.
:initial-window
This slot is read-only.
:initial-current-position
This slot is read-only.
:window
:tail
:current
:sample-size
This slot is read-only.
:compare
This slot is read-only.
:confidence
This slot is read-only.
:parallel
This slot is read-only.
:context-function
This slot is read-only.
:samples-count
This slot is read-only.
cl-data-structures.common::fundamental-container
:content
:hash-function
This slot is read-only.
:chunked-range
This slot is read-only.
:state
:result
This slot is read-only.
:function
This slot is read-only.
:cumulative-key
This slot is read-only.
:content
This slot is read-only.
(quote nil)
:stack
:stack
This slot is read-only.
:container
This slot is read-only.
:margin
This slot is read-only.
:content
This slot is read-only.
:close-range
:distant-range
vector
#()
:children
This slot is read-only.
:stack
:ranges
This slot is read-only.
(or null cl-data-structures.file-system::fundamental-file-range-stack-cell)
:prev-cell
function
(constantly t)
:predicate
This slot is read-only.
(setf access-index-bound).
access-index-bound.
(setf access-shift).
access-shift.
(setf access-tail).
access-tail.
(setf access-tail-mask).
access-tail-mask.
(setf access-tree).
access-tree.
(setf access-tree-index-bound).
access-tree-index-bound.
(setf access-tree-size).
access-tree-size.
across.
at.
become-functional.
become-mutable.
become-transactional.
cloning-information.
empty-clone.
read-element-type.
size.
traverse.
type-specialization.
whole-range.
cl-data-structures.meta:null-bucket
:tree
:tail
0
:tail-mask
0
:shift
0
:tree-size
0
:tree-index-bound
cl-data-structures.common.rrb:+maximum-children-count+
:index-bound
t
:element-type
This slot is read-only.
hash-table
:groups
This slot is read-only.
:having
This slot is read-only.
:transform
This slot is read-only.
:key
This slot is read-only.
:original-data
This slot is read-only.
:discrete
This slot is read-only.
:split-point-count
This slot is read-only.
(function identity)
:selector-function
This slot is read-only.
:latches
:container
This slot is read-only.
(or (serapeum:-> nil cl-data-structures:fundamental-range) cl-data-structures:fundamental-range)
:range
This slot is read-only.
:table
This slot is read-only.
0
:count
This slot is read-only.
0
:sum
This slot is read-only.
0
:count
0
:sum
:key
This slot is read-only.
:function
This slot is read-only.
:current
:initial-current
This slot is read-only.
| Initarg | Value |
|---|---|
:previous-bound | nil |
:previous | nil |
:comparsion
This slot is read-only.
:previous
:previous
:previous-bound
:previous-bound
:predicate
This slot is read-only.
hash-table
:groups
This slot is read-only.
:having
This slot is read-only.
:transform
This slot is read-only.
:chunk-size
This slot is read-only.
:maximum-queue-size
This slot is read-only.
(serapeum:vect)
This slot is read-only.
:hash-array
This slot is read-only.
| Initarg | Value |
|---|---|
:more-checks-start | t |
:more-checks-end | t |
:parents | (quote nil) |
:depth | 0 |
:more-checks-start
This slot is read-only.
:more-checks-end
This slot is read-only.
| Initarg | Value |
|---|---|
:times | 1 |
:times
This slot is read-only.
:times
This slot is read-only.
0
:position
0
:position
This slot is read-only.
:seeds
This slot is read-only.
:split-point
:original-selector-function
This slot is read-only.
:discrete-values-set
This slot is read-only.
| Initarg | Value |
|---|---|
:ownership-tag | (make-ownership-tag) |
(function identity)
:key
This slot is read-only.
:predicate
This slot is read-only.
:function
This slot is read-only.
| 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 |
|---|
| 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 |
|---|
| Jump to: | %
*
+
B C D E H I L N O P R S T U V W |
|---|
| Jump to: | %
*
+
B C D E H I L N O P R S T U V W |
|---|
| 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 |
|---|
| 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 |
|---|