The lisp-interface-library Reference Manual

This is the lisp-interface-library Reference Manual, version 1.0.2.0, generated automatically by Declt version 4.0 beta 2 "William Riker" on Wed May 15 06:01:36 2024 GMT+0.

Table of Contents


1 Introduction


2 Systems

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


2.1 lisp-interface-library

Long name alias for lil

Author

Francois-Rene Rideau

License

MIT

Version

1.0.2.0

Dependency

lil (system).

Source

lisp-interface-library.asd.


2.2 lil

LIL: Lisp Interface Library

Author

Francois-Rene Rideau

License

MIT

Long Description

LIL is a collection of pure and stateful data structures in Interface Passing Style. See http://fare.livejournal.com/155094.html regarding Interface Passing Style, or our ILC’2012 article http://github.com/fare/lil-ilc2012/

Version

1.0.2.0

Dependencies
Source

lil.asd.


2.3 lil/core/all

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.4 lil/core/metaclass

Author

Francois-Rene Rideau

License

MIT

Dependencies
  • closer-mop (system).
  • fare-memoization (system).
  • closer-mop (system).
  • lil/core/utility (system).
  • fare-utils (system).
  • alexandria (system).
Source

lil.asd.


2.5 lil/core/utility

Author

Francois-Rene Rideau

License

MIT

Dependencies
  • closer-mop (system).
  • closer-mop (system).
  • fare-utils (system).
  • alexandria (system).
Source

lil.asd.


2.6 lil/core/interface

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.7 lil/interface/all

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.8 lil/interface/base

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.9 lil/interface/group

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.10 lil/interface/empty

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.11 lil/interface/size

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.12 lil/interface/fold

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.13 lil/interface/iterator

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.14 lil/interface/collection

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.15 lil/interface/box

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.16 lil/interface/eq

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.17 lil/interface/order

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.18 lil/interface/sequence

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.19 lil/interface/map

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.20 lil/interface/set

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.21 lil/interface/tree

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.22 lil/interface/tree-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.23 lil/interface/monad

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.24 lil/interface/run

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.25 lil/interface/monad/continuation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.26 lil/interface/monad/identity

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.27 lil/interface/monad/list

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.28 lil/interface/monad/maybe

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.29 lil/interface/monad/state

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.30 lil/interface/monad/transformer/list

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.31 lil/interface/monad/transformer

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.32 lil/interface/monad/transformer/maybe

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.33 lil/pure/all

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.34 lil/pure/empty

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.35 lil/pure/collection

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.36 lil/pure/iterator

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.37 lil/pure/map

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.38 lil/pure/set

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.39 lil/pure/sequence

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.40 lil/pure/lexicographic

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.41 lil/pure/alist

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.42 lil/pure/tree

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.43 lil/pure/hash-table

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.44 lil/pure/encoded-key-map

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.45 lil/pure/fmim

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.46 lil/pure/queue

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.47 lil/pure/iterator-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.48 lil/pure/map-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.49 lil/pure/set-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.50 lil/pure/alist-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.51 lil/pure/tree-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.52 lil/pure/hash-table-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.53 lil/pure/fmim-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.54 lil/pure/encoded-key-map-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.55 lil/pure/queue-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.56 lil/stateful/all

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.57 lil/stateful/empty

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.58 lil/stateful/collection

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.59 lil/stateful/iterator

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.60 lil/stateful/map

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.61 lil/stateful/tree

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.62 lil/stateful/hash-table

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.63 lil/stateful/encoded-key-map

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.64 lil/stateful/queue

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.65 lil/stateful/iterator-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.66 lil/stateful/map-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.67 lil/stateful/tree-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.68 lil/stateful/hash-table-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.69 lil/stateful/encoded-key-map-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.70 lil/stateful/queue-implementation

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.71 lil/transform/all

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.72 lil/transform/linearize

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.73 lil/transform/linearized-map

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.74 lil/transform/mutating

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.75 lil/transform/mutating-map

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.76 lil/transform/classify

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.77 lil/transform/classy

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


2.78 lil/transform/posh

Author

Francois-Rene Rideau

License

MIT

Dependencies
Source

lil.asd.


3 Files

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


3.1 Lisp


3.1.1 lisp-interface-library/lisp-interface-library.asd

Source

lisp-interface-library.asd.

Parent Component

lisp-interface-library (system).

ASDF Systems

lisp-interface-library.


3.1.2 lil/lil.asd

Source

lil.asd.

Parent Component

lil (system).

ASDF Systems

3.1.3 lil/core/all/file-type.lisp

Source

lil.asd.

Parent Component

lil/core/all (system).

Packages

lil/core/all.


3.1.4 lil/core/metaclass/file-type.lisp

Source

lil.asd.

Parent Component

lil/core/metaclass (system).

Packages

lil/core/metaclass.

Public Interface
Internals

3.1.5 lil/core/utility/file-type.lisp

Source

lil.asd.

Parent Component

lil/core/utility (system).

Packages

lil/core/utility.

Public Interface
Internals

call-with-unique-collector (function).


3.1.6 lil/core/interface/file-type.lisp

Source

lil.asd.

Parent Component

lil/core/interface (system).

Packages

lil/core/interface.

Public Interface

3.1.7 lil/interface/all/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/all (system).

Packages

lil/interface/all.


3.1.8 lil/interface/base/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/base (system).

Packages

lil/interface/base.

Public Interface

3.1.9 lil/interface/group/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/group (system).

Packages

lil/interface/group.

Public Interface
Internals

3.1.10 lil/interface/empty/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/empty (system).

Packages

lil/interface/empty.

Public Interface

3.1.11 lil/interface/size/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/size (system).

Packages

lil/interface/size.

Public Interface

3.1.12 lil/interface/fold/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/fold (system).

Packages

lil/interface/fold.

Public Interface

3.1.13 lil/interface/iterator/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/iterator (system).

Packages

lil/interface/iterator.

Public Interface

3.1.14 lil/interface/collection/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/collection (system).

Packages

lil/interface/collection.

Public Interface

3.1.15 lil/interface/box/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/box (system).

Packages

lil/interface/box.

Public Interface
Internals

3.1.16 lil/interface/eq/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/eq (system).

Packages

lil/interface/eq.

Public Interface

3.1.17 lil/interface/order/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/order (system).

Packages

lil/interface/order.

Public Interface
Internals

3.1.18 lil/interface/sequence/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/sequence (system).

Packages

lil/interface/sequence.

Public Interface

<sequence> (class).


3.1.19 lil/interface/map/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/map (system).

Packages

lil/interface/map.

Public Interface
Internals

<map-fold-left*-from-fold-right*> (class).


3.1.20 lil/interface/set/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/set (system).

Packages

lil/interface/set.

Public Interface
Internals

3.1.21 lil/interface/tree/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/tree (system).

Packages

lil/interface/tree.

Public Interface

3.1.22 lil/interface/tree-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/tree-implementation (system).

Packages

lil/interface/tree-implementation.

Public Interface

3.1.23 lil/interface/monad/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/monad (system).

Packages

lil/interface/monad.

Public Interface

3.1.24 lil/interface/run/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/run (system).

Packages

lil/interface/run.

Public Interface
  • <run> (class).
  • run (generic function).

3.1.25 lil/interface/monad/continuation/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/monad/continuation (system).

Packages

lil/interface/monad/continuation.

Public Interface

3.1.26 lil/interface/monad/identity/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/monad/identity (system).

Packages

lil/interface/monad/identity.

Public Interface

3.1.27 lil/interface/monad/list/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/monad/list (system).

Packages

lil/interface/monad/list.

Public Interface

3.1.28 lil/interface/monad/maybe/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/monad/maybe (system).

Packages

lil/interface/monad/maybe.

Public Interface
Internals

3.1.29 lil/interface/monad/state/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/monad/state (system).

Packages

lil/interface/monad/state.

Public Interface

3.1.30 lil/interface/monad/transformer/list/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/monad/transformer/list (system).

Packages

lil/interface/monad/transformer/list.

Public Interface

3.1.31 lil/interface/monad/transformer/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/monad/transformer (system).

Packages

lil/interface/monad/transformer.

Public Interface

3.1.32 lil/interface/monad/transformer/maybe/file-type.lisp

Source

lil.asd.

Parent Component

lil/interface/monad/transformer/maybe (system).

Packages

lil/interface/monad/transformer/maybe.

Public Interface
Internals

3.1.33 lil/pure/all/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/all (system).

Packages

lil/pure/all.


3.1.34 lil/pure/empty/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/empty (system).

Packages

lil/pure/empty.

Public Interface

3.1.35 lil/pure/collection/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/collection (system).

Packages

lil/pure/collection.

Public Interface

3.1.36 lil/pure/iterator/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/iterator (system).

Packages

lil/pure/iterator.

Public Interface

3.1.37 lil/pure/map/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/map (system).

Packages

lil/pure/map.

Public Interface

3.1.38 lil/pure/set/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/set (system).

Packages

lil/pure/set.

Public Interface

3.1.39 lil/pure/sequence/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/sequence (system).

Packages

lil/pure/sequence.

Public Interface

<sequence> (class).


3.1.40 lil/pure/lexicographic/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/lexicographic (system).

Packages

lil/pure/lexicographic.

Public Interface

3.1.41 lil/pure/alist/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/alist (system).

Packages

lil/pure/alist.

Public Interface

3.1.42 lil/pure/tree/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/tree (system).

Packages

lil/pure/tree.

Public Interface

3.1.43 lil/pure/hash-table/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/hash-table (system).

Packages

lil/pure/hash-table.

Public Interface

3.1.44 lil/pure/encoded-key-map/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/encoded-key-map (system).

Packages

lil/pure/encoded-key-map.

Public Interface

3.1.45 lil/pure/fmim/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/fmim (system).

Packages

lil/pure/fmim.

Public Interface

3.1.46 lil/pure/queue/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/queue (system).

Packages

lil/pure/queue.

Public Interface

3.1.47 lil/pure/iterator-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/iterator-implementation (system).

Packages

lil/pure/iterator-implementation.

Public Interface

3.1.48 lil/pure/map-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/map-implementation (system).

Packages

lil/pure/map-implementation.

Public Interface

3.1.49 lil/pure/set-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/set-implementation (system).

Packages

lil/pure/set-implementation.

Public Interface

3.1.50 lil/pure/alist-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/alist-implementation (system).

Packages

lil/pure/alist-implementation.

Public Interface

3.1.51 lil/pure/tree-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/tree-implementation (system).

Packages

lil/pure/tree-implementation.

Public Interface

3.1.52 lil/pure/hash-table-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/hash-table-implementation (system).

Packages

lil/pure/hash-table-implementation.

Public Interface

3.1.53 lil/pure/fmim-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/fmim-implementation (system).

Packages

lil/pure/fmim-implementation.

Public Interface
Internals

3.1.54 lil/pure/encoded-key-map-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/encoded-key-map-implementation (system).

Packages

lil/pure/encoded-key-map-implementation.

Public Interface

3.1.55 lil/pure/queue-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/pure/queue-implementation (system).

Packages

lil/pure/queue-implementation.

Public Interface

3.1.56 lil/stateful/all/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/all (system).

Packages

lil/stateful/all.


3.1.57 lil/stateful/empty/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/empty (system).

Packages

lil/stateful/empty.

Public Interface

3.1.58 lil/stateful/collection/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/collection (system).

Packages

lil/stateful/collection.

Public Interface

3.1.59 lil/stateful/iterator/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/iterator (system).

Packages

lil/stateful/iterator.

Public Interface

3.1.60 lil/stateful/map/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/map (system).

Packages

lil/stateful/map.

Public Interface

3.1.61 lil/stateful/tree/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/tree (system).

Packages

lil/stateful/tree.

Public Interface

3.1.62 lil/stateful/hash-table/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/hash-table (system).

Packages

lil/stateful/hash-table.

Public Interface

3.1.63 lil/stateful/encoded-key-map/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/encoded-key-map (system).

Packages

lil/stateful/encoded-key-map.

Public Interface

3.1.64 lil/stateful/queue/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/queue (system).

Packages

lil/stateful/queue.

Public Interface

3.1.65 lil/stateful/iterator-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/iterator-implementation (system).

Packages

lil/stateful/iterator-implementation.

Public Interface
Internals

<devnull> (class).


3.1.66 lil/stateful/map-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/map-implementation (system).

Packages

lil/stateful/map-implementation.

Public Interface

3.1.67 lil/stateful/tree-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/tree-implementation (system).

Packages

lil/stateful/tree-implementation.

Public Interface
Internals

copy-node (generic function).


3.1.68 lil/stateful/hash-table-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/hash-table-implementation (system).

Packages

lil/stateful/hash-table-implementation.

Public Interface
Internals

3.1.69 lil/stateful/encoded-key-map-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/encoded-key-map-implementation (system).

Packages

lil/stateful/encoded-key-map-implementation.

Public Interface

3.1.70 lil/stateful/queue-implementation/file-type.lisp

Source

lil.asd.

Parent Component

lil/stateful/queue-implementation (system).

Packages

lil/stateful/queue-implementation.

Public Interface

3.1.71 lil/transform/all/file-type.lisp

Source

lil.asd.

Parent Component

lil/transform/all (system).

Packages

lil/transform/all.


3.1.72 lil/transform/linearize/file-type.lisp

Source

lil.asd.

Parent Component

lil/transform/linearize (system).

Packages

lil/transform/linearize.

Public Interface

3.1.73 lil/transform/linearized-map/file-type.lisp

Source

lil.asd.

Parent Component

lil/transform/linearized-map (system).

Packages

lil/transform/linearized-map.

Public Interface

3.1.74 lil/transform/mutating/file-type.lisp

Source

lil.asd.

Parent Component

lil/transform/mutating (system).

Packages

lil/transform/mutating.

Public Interface

3.1.75 lil/transform/mutating-map/file-type.lisp

Source

lil.asd.

Parent Component

lil/transform/mutating-map (system).

Packages

lil/transform/mutating-map.

Public Interface

3.1.76 lil/transform/classify/file-type.lisp

Source

lil.asd.

Parent Component

lil/transform/classify (system).

Packages

lil/transform/classify.

Public Interface

3.1.77 lil/transform/classy/file-type.lisp

Source

lil.asd.

Parent Component

lil/transform/classy (system).

Packages

lil/transform/classy.

Public Interface
Internals

3.1.78 lil/transform/posh/file-type.lisp

Source

lil.asd.

Parent Component

lil/transform/posh (system).

Packages

lil/transform/posh.

Public Interface
Internals

4 Packages

Packages are listed by definition order.


4.2 lil/pure/map-implementation

Source

file-type.lisp.

Use List
Used By List

lil/pure/all.


4.3 lil/core/utility

Source

file-type.lisp.

Use List
  • alexandria.
  • closer-common-lisp.
  • closer-mop.
  • fare-utils.
  • uiop/driver.
Used By List
Public Interface
Internals

call-with-unique-collector (function).


4.4 lil/pure/iterator-implementation

Source

file-type.lisp.

Use List
Used By List

lil/pure/all.


4.5 lil/transform/linearize

Source

file-type.lisp.

Use List
Used By List

lil/transform/linearized-map.

Public Interface

4.6 lil/pure/encoded-key-map-implementation

Source

file-type.lisp.

Use List
Used By List

lil/pure/all.


4.7 lil/pure/hash-table-implementation

Source

file-type.lisp.

Use List
Used By List

lil/pure/all.


4.8 lil/interface/base

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.11 lil/interface/size

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.12 lil/transform/classify

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.13 lil/stateful/hash-table-implementation

Source

file-type.lisp.

Use List
Used By List

lil/stateful/all.

Internals

4.15 lil/stateful/collection

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.17 lil/pure/empty

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.18 lil/pure/tree

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.19 lil/transform/classy

traditional classy APIs for LIL data structure

Source

file-type.lisp.

Nickname

classy

Use List
Public Interface
Internals

4.20 lil/transform/posh

Pure Object-Oriented Structure Hierarchy, classy APIs for pure LIL data structure

Source

file-type.lisp.

Nickname

posh

Use List
Public Interface
Internals

4.21 lil/interface/monad/continuation

Source

file-type.lisp.

Use List
Used By List

lil/interface/all.

Public Interface

4.22 lil/stateful/encoded-key-map-implementation

Source

file-type.lisp.

Use List
Used By List

lil/stateful/all.


4.23 lil/pure/set-implementation

Source

file-type.lisp.

Use List
Used By List

lil/pure/all.


4.24 lil/interface/iterator

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.25 lil/stateful/queue

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.26 lil/pure/tree-implementation

Source

file-type.lisp.

Use List
Used By List

lil/pure/all.


4.27 lil/interface/monad/transformer/list

Source

file-type.lisp.

Use List
Used By List

lil/interface/all.

Public Interface

4.28 lil/core/interface

Source

file-type.lisp.

Use List
Used By List

lil/core/all.


4.29 lil/stateful/queue-implementation

Source

file-type.lisp.

Use List
Used By List

lil/stateful/all.


4.30 lil/interface/eq

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.32 lil/pure/iterator

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.33 lil/stateful/iterator

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.34 lil/interface/monad/maybe

Source

file-type.lisp.

Use List
Used By List

lil/interface/all.

Public Interface

4.35 lil/transform/linearized-map

Source

file-type.lisp.

Use List
Public Interface

<linearized-map> (class).


4.36 lil/pure/set

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.37 lil/pure/hash-table

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.39 lil/transform/mutating

Source

file-type.lisp.

Use List
Used By List

lil/transform/mutating-map.

Public Interface

4.40 lil/transform/mutating-map

Source

file-type.lisp.

Use List
Public Interface

4.41 lil/interface/group

Source

file-type.lisp.

Use List
Used By List
Public Interface
Internals

4.42 lil/interface/tree

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.43 lil/interface/box

Source

file-type.lisp.

Use List
Used By List
Public Interface
Internals

4.44 lil/pure/lexicographic

Source

file-type.lisp.

Use List
Used By List

lil/pure/all.

Public Interface

<lexicographic> (class).


4.45 lil/pure/fmim

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.46 lil/pure/queue-implementation

Source

file-type.lisp.

Use List
Used By List

lil/pure/all.


4.47 lil/pure/alist-implementation

Source

file-type.lisp.

Use List
Used By List

lil/pure/all.


4.48 lil/interface/tree-implementation

Source

file-type.lisp.

Use List
Used By List

lil/interface/all.

Public Interface

binary-tree-sexp (function).


4.49 lil/core/all

Source

file-type.lisp.

Nickname

lil/core

Use List
Used By List

4.50 lil/interface/set

Source

file-type.lisp.

Use List
Used By List
Public Interface
Internals

4.51 lil/interface/order

Source

file-type.lisp.

Use List
Used By List
Public Interface
Internals

4.52 lil/interface/map

Source

file-type.lisp.

Use List
Used By List
Public Interface
Internals

<map-fold-left*-from-fold-right*> (class).


4.53 lil/stateful/tree-implementation

Source

file-type.lisp.

Use List
Used By List

lil/stateful/all.

Internals

copy-node (generic function).


4.55 lil/stateful/iterator-implementation

Source

file-type.lisp.

Use List
Used By List

lil/stateful/all.

Internals

<devnull> (class).


4.56 lil/interface/monad/transformer/maybe

Source

file-type.lisp.

Use List
Used By List

lil/interface/all.

Public Interface

4.57 lil/interface/monad/transformer

Source

file-type.lisp.

Use List
Used By List

lil/interface/monad/transformer/list.

Public Interface

4.59 lil/interface/monad/identity

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.60 lil/interface/monad

This package is the <MONAD> interface.

It contains and exports:

<MONAD>
RESULT
BIND
FAIL
MLET*

Source

file-type.lisp.

Use List

common-lisp.

Used By List
Public Interface

4.61 lil/stateful/hash-table

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.62 lil/pure/alist

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.63 lil/pure/collection

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.64 lil/interface/monad/list

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.65 lil/pure/queue

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.66 lil/pure/fmim-implementation

Source

file-type.lisp.

Use List
Used By List

lil/pure/all.

Internals

4.69 lil/transform/all

Source

file-type.lisp.

Use List

common-lisp.


4.70 lil/stateful/tree

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.71 lil/interface/run

Source

file-type.lisp.

Use List

common-lisp.

Used By List

lil/interface/all.

Public Interface
  • <run> (class).
  • run (generic function).

4.72 lil/stateful/empty

Source

file-type.lisp.

Use List
Used By List
Public Interface

4.73 lil/interface/monad/state

Source

file-type.lisp.

Use List
Used By List

lil/interface/all.

Public Interface

4.74 lil/core/metaclass

Source

file-type.lisp.

Use List
  • alexandria.
  • closer-common-lisp.
  • closer-mop.
  • fare-memoization.
  • fare-utils.
  • lil/core/utility.
  • uiop/driver.
Used By List
Public Interface
Internals

4.75 lil/interface/collection

Source

file-type.lisp.

Use List
Used By List
Public Interface

5 Definitions

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


5.1 Public Interface


5.1.1 Special variables

Special Variable: <alist>
Package

lil/transform/mutating-map.

Source

file-type.lisp.

Special Variable: <alist>
Package

lil/pure/alist.

Source

file-type.lisp.

Special Variable: <any>
Package

lil/interface/base.

Source

file-type.lisp.

Special Variable: <boolean>
Package

lil/interface/order.

Source

file-type.lisp.

Special Variable: <case-insensitive-string>
Package

lil/interface/order.

Source

file-type.lisp.

Special Variable: <char>
Package

lil/interface/order.

Source

file-type.lisp.

Special Variable: <continuation>
Package

lil/interface/monad/continuation.

Source

file-type.lisp.

Special Variable: <eql>
Package

lil/interface/eq.

Source

file-type.lisp.

Special Variable: <equal>
Package

lil/interface/eq.

Source

file-type.lisp.

Special Variable: <fifo-queue>
Package

lil/stateful/queue.

Source

file-type.lisp.

Special Variable: <fifo-queue>
Package

lil/pure/queue.

Source

file-type.lisp.

Special Variable: <fmim>
Package

lil/pure/fmim.

Source

file-type.lisp.

Special Variable: <for-each>
Package

lil/interface/iterator.

Source

file-type.lisp.

Special Variable: <hash-table>
Package

lil/pure/hash-table.

Source

file-type.lisp.

Special Variable: <hash-table>
Package

lil/stateful/hash-table.

Source

file-type.lisp.

Special Variable: <identity>
Package

lil/interface/monad/identity.

Source

file-type.lisp.

Special Variable: <integer>
Package

lil/interface/order.

Source

file-type.lisp.

Special Variable: <lifo-queue>
Package

lil/stateful/queue.

Source

file-type.lisp.

Special Variable: <lifo-queue>
Package

lil/pure/queue.

Source

file-type.lisp.

Special Variable: <list-transformer>
Package

lil/interface/monad/transformer/list.

Source

file-type.lisp.

Special Variable: <list>
Package

lil/interface/monad/list.

Source

file-type.lisp.

Special Variable: <maybe-empty>
Package

lil/interface/monad/maybe.

Source

file-type.lisp.

Special Variable: <maybe-transformer>
Package

lil/interface/monad/transformer/maybe.

Source

file-type.lisp.

Special Variable: <maybe>
Package

lil/interface/monad/maybe.

Source

file-type.lisp.

Special Variable: <monad>
Package

lil/interface/monad.

Source

file-type.lisp.

Special Variable: <nm>
Package

lil/pure/tree.

Source

file-type.lisp.

Special Variable: <nm>
Package

lil/stateful/tree.

Source

file-type.lisp.

Special Variable: <number-map>
Package

lil/pure/tree.

Source

file-type.lisp.

Special Variable: <number-map>
Package

lil/stateful/tree.

Source

file-type.lisp.

Special Variable: <number>
Package

lil/interface/order.

Source

file-type.lisp.

Special Variable: <one-use-value-box>
Package

lil/interface/box.

Source

file-type.lisp.

Special Variable: <state>
Package

lil/interface/monad/state.

Source

file-type.lisp.

Special Variable: <string-map>
Package

lil/pure/tree.

Source

file-type.lisp.

Special Variable: <string-map>
Package

lil/stateful/tree.

Source

file-type.lisp.

Special Variable: <string>
Package

lil/interface/order.

Source

file-type.lisp.

Special Variable: <transformer>
Package

lil/interface/monad/transformer.

Source

file-type.lisp.

Special Variable: <value-box>
Package

lil/interface/box.

Source

file-type.lisp.


5.1.2 Macros

Macro: define-classified-interface-class (name superclasses interface &optional slots &rest options)
Package

lil/transform/classify.

Source

file-type.lisp.

Macro: define-classified-method (class interface class-gf interface-gf &key interface-argument extract-interface interface-keyword value-keyword wrap unwrap genericp)
Package

lil/transform/classify.

Source

file-type.lisp.

Macro: define-interface (interface super-interfaces slots &body options)
Package

lil/core/metaclass.

Source

file-type.lisp.

Macro: define-interface-generic (time interface name lambda-list &body options)
Package

lil/core/metaclass.

Source

file-type.lisp.

Macro: define-interface-generic> (time interface name lambda-list &body options)
Package

lil/core/metaclass.

Source

file-type.lisp.

Macro: define-interface-method (interface gf &body rest)
Package

lil/core/metaclass.

Source

file-type.lisp.

Macro: define-interface-methods (interface &body body)
Package

lil/core/metaclass.

Source

file-type.lisp.

Macro: define-interface-specialized-functions (interface-sexp functions-spec &key prefix package)
Package

lil/core/metaclass.

Source

file-type.lisp.

Macro: define-linearized-interface (name pure-interfaces stateful-interfaces &optional slots &rest options)
Package

lil/transform/linearize.

Source

file-type.lisp.

Macro: define-linearized-method (linearized-interface pure-interfaces stateful-interfaces pure-gf stateful-gf &key pure-lambda-list pure-values pure-effects pure-gf-options stateful-lambda-list stateful-values stateful-effects stateful-gf-options)
Package

lil/transform/linearize.

Source

file-type.lisp.

Macro: define-mutating-interface (name stateful-interfaces pure-interfaces &optional slots &rest options)
Package

lil/transform/mutating.

Source

file-type.lisp.

Macro: define-mutating-method (mutating-interface stateful-interfaces pure-interfaces stateful-gf pure-gf &key pure-lambda-list pure-values pure-effects pure-gf-options stateful-lambda-list stateful-values stateful-effects stateful-gf-options)
Package

lil/transform/mutating.

Source

file-type.lisp.

Macro: delay (&body body)
Package

lil/interface/box.

Source

file-type.lisp.

Macro: mlet* (monad bindings &body body)

The MLET* macro is like a LET* that is implemented with BIND, and a WITH-INTERFACE so the proper functions are FLETd.

MONAD is a form that is passed to WITH-INTERFACE. BINDINGS are essentially a list of variables that are expanded into a LAMBDA which is passed to BIND. BODY is the body of the form.

e.g, (mlet* <list> ((x (list 1 2 3 4)))
(result (1+ x)))

;; MACROEXPANDs to something like:

;; (WITH-INTERFACE (<LIST> <LIST>)
;; (BIND (LIST 1 2 3 4) (LAMBDA (X) (RESULT (1+ X)))

Package

lil/interface/monad.

Source

file-type.lisp.

Macro: one-use-lambda (formals &body body)
Package

lil/interface/box.

Source

file-type.lisp.

Macro: with-interface ((interface-sexp functions-spec &key prefix package) &body body)
Package

lil/core/metaclass.

Source

file-type.lisp.

Macro: with-unique-collector ((collector &key test) &body body)

Like UIOP:WHILE-COLLECTING, but doesn’t collect duplicates.

Package

lil/core/utility.

Source

file-type.lisp.


5.1.3 Ordinary functions

Function: <encoded-key-map> (&rest keys)
Package

lil/stateful/encoded-key-map.

Source

file-type.lisp.

Function: <encoded-key-map> (&rest keys)
Package

lil/pure/encoded-key-map.

Source

file-type.lisp.

Function: all-interface-generics (interfaces)
Package

lil/core/metaclass.

Source

file-type.lisp.

Function: binary-tree-sexp (tree)
Package

lil/interface/tree-implementation.

Source

file-type.lisp.

Function: boolean-integer (bool)
Package

lil/core/utility.

Source

file-type.lisp.

Function: box! (x)
Package

lil/interface/box.

Source

file-type.lisp.

Function: collect-function-names (functions-spec)
Package

lil/core/metaclass.

Source

file-type.lisp.

Function: create-fifo-queue (contents &rest keys336 &key &allow-other-keys)
Package

lil/transform/classy.

Source

file-type.lisp.

Function: create-number-map (contents &rest keys287 &key &allow-other-keys)
Package

lil/transform/classy.

Source

file-type.lisp.

Function: create-number-map (contents &rest keys284 &key &allow-other-keys)
Package

lil/transform/posh.

Source

file-type.lisp.

Function: decompose-function-name (name)
Package

lil/core/utility.

Source

file-type.lisp.

Function: empty-fifo-queue ()
Package

lil/transform/classy.

Source

file-type.lisp.

Function: empty-number-map ()
Package

lil/transform/classy.

Source

file-type.lisp.

Function: empty-number-map ()
Package

lil/transform/posh.

Source

file-type.lisp.

Function: empty-object-p (x)
Package

lil/interface/empty.

Source

file-type.lisp.

Function: expand-interface-method> (interface gf x &rest y)
Package

lil/core/metaclass.

Source

file-type.lisp.

Function: find-multiple-clos-options (key options)
Package

lil/core/utility.

Source

file-type.lisp.

Function: find-unique-clos-option (key options)
Package

lil/core/utility.

Source

file-type.lisp.

Function: find-unique-clos-option/0 (key options)
Package

lil/core/utility.

Source

file-type.lisp.

Function: find-unique-clos-option/1 (key options &optional default)
Package

lil/core/utility.

Source

file-type.lisp.

Function: find-unique-clos-option/1* (key options)
Package

lil/core/utility.

Source

file-type.lisp.

Function: force (promise)
Package

lil/interface/box.

Source

file-type.lisp.

Function: interface-class-p (class)
Package

lil/core/metaclass.

Source

file-type.lisp.

Function: interface-direct-generics (interface)
Package

lil/core/metaclass.

Source

file-type.lisp.

Function: interface-gf-options (interface gf)
Package

lil/core/metaclass.

Source

file-type.lisp.

Function: keep-keyed-clos-options (keys options)
Package

lil/core/utility.

Source

file-type.lisp.

Function: lambda-list-mimicker (lambda-list &optional gensym-all)
Package

lil/core/utility.

Source

file-type.lisp.

Function: make-empty-object ()
Package

lil/interface/empty.

Source

file-type.lisp.

Function: make-local-name (name &key prefix package)
Package

lil/core/utility.

Source

file-type.lisp.

Function: make-number-iterator (&rest keys &key from downfrom upfrom to downto upto below above by repeat)

Make a number iterator in the style of LOOP

Package

lil/interface/iterator.

Source

file-type.lisp.

Function: make-one-use-function (function &optional name)
Package

lil/interface/box.

Source

file-type.lisp.

Function: memberp (list &rest keys &key test test-not key)
Package

lil/core/utility.

Source

file-type.lisp.

Function: number-of-required-arguments (lambda-list)
Package

lil/core/utility.

Source

file-type.lisp.

Function: one-use-value-box (x)
Package

lil/interface/box.

Source

file-type.lisp.

Function: register-interface-generic (class name &rest keys &key lambda-list values in out)
Package

lil/core/metaclass.

Source

file-type.lisp.

Function: remove-keyed-clos-options (keys options)
Package

lil/core/utility.

Source

file-type.lisp.

Function: search-gf-options (classes gf)
Package

lil/core/metaclass.

Source

file-type.lisp.

Function: un<>ate (string)
Package

lil/core/metaclass.

Source

file-type.lisp.


5.1.4 Generic functions

Generic Function: == (<eq> x y)
Package

lil/interface/eq.

Source

file-type.lisp.

Methods
Method: == ((i <order-parameter>) x y)
Source

file-type.lisp.

Method: == ((<case-insensitive-string> <case-insensitive-string>) x y)
Source

file-type.lisp.

Method: == ((i <string>) x y)
Source

file-type.lisp.

Method: == ((i <char>) x y)
Source

file-type.lisp.

Method: == ((i <number>) x y)
Source

file-type.lisp.

Method: == ((i <lessp>) x y)
Source

file-type.lisp.

Method: == ((<order-from-compare> <order-from-compare>) x y)
Source

file-type.lisp.

Method: == ((<order-from-lessp> <order-from-lessp>) x y)
Source

file-type.lisp.

Method: == ((<equal> <equal>) x y)
Method: == ((<eq-from-eq-function> <eq-from-eq-function>) x y)
Method: == ((<eql> <eql>) x y)
Generic Function: alist-map (<map> alist)

Convert an alist to a map of given interface

Package

lil/interface/map.

Source

file-type.lisp.

Methods
Method: alist-map ((<map> <mutating-map>) alist)
Source

file-type.lisp.

Method: alist-map ((<map> <linearized-map>) alist)
Source

file-type.lisp.

Method: alist-map ((<map> <map>) map)
Source

file-type.lisp.

Generic Function: all-super-interfaces (interfaces)
Package

lil/core/metaclass.

Source

file-type.lisp.

Methods
Method: all-super-interfaces ((symbol symbol))
Method: all-super-interfaces ((interface interface-class))
Method: all-super-interfaces ((interfaces cons))
Generic Function: balance-node (<tree> node)

balance a node in a tree

Package

lil/stateful/tree.

Source

file-type.lisp.

Methods
Method: balance-node ((i <avl-tree>) (node avl-tree-node))
Source

file-type.lisp.

Method: balance-node ((i <avl-tree>) (node empty-object))
Source

file-type.lisp.

Generic Reader: base-interface (<has-base-interface>)

from a functor, extract the base interface parameter

Package

lil/interface/base.

Source

file-type.lisp.

Methods
Reader Method: base-interface ((<multiset-from-set> <multiset-from-set>))

automatically generated reader method

Source

file-type.lisp.

Target Slot

base-interface.

Reader Method: base-interface ((<multiset-from-map> <multiset-from-map>))

automatically generated reader method

Source

file-type.lisp.

Target Slot

base-interface.

Reader Method: base-interface ((<set*-from-collection> <set*-from-collection>))

automatically generated reader method

Source

file-type.lisp.

Target Slot

base-interface.

Reader Method: base-interface ((<parametric-encoded-key-collection> <parametric-encoded-key-collection>))

automatically generated reader method

Source

file-type.lisp.

Target Slot

base-interface.

Generic Function: bind (<monad> monadic-value monadic-function)

Takes a monadic value, retrieves the contained value, and calls the monadic function with it.

MONADIC-VALUE : The value of the type expected by the monad. MONADIC-FUNCTION : a function that takes any VALUE and returns a MONADIC-VALUE.

e.g., (BIND (RESULT 1) (LAMBDA (N) (RESULT (+ 1 N))))

Package

lil/interface/monad.

Source

file-type.lisp.

Methods
Method: bind ((<m> <maybe-transformer>) mv mf)
Source

file-type.lisp.

Method: bind ((m <list-transformer>) mv mf)
Source

file-type.lisp.

Method: bind ((<m> <transformer>) mv mf)
Source

file-type.lisp.

Method: bind ((<state> <state>) mv mf)
Source

file-type.lisp.

Method: bind ((<m> <maybe>) mv mf)
Source

file-type.lisp.

Method: bind ((<list> <list>) mvs mf)
Source

file-type.lisp.

Method: bind ((<identity> <identity>) mv mf)

FUNCALLs the MF with the MV

Source

file-type.lisp.

Method: bind ((<continuation> <continuation>) mv mf)
Source

file-type.lisp.

Generic Function: box-ref (box)

open a box and return its contents

Package

lil/interface/box.

Source

file-type.lisp.

Methods
Method: box-ref :after ((box one-use-thunk-box))
Method: box-ref :after ((box one-use-value-box))
Method: box-ref :after ((box one-use-box))
Method: box-ref :before ((box one-use-box))
Method: box-ref ((box simple-thunk-box))
Method: box-ref ((box simple-value-box))
Method: box-ref ((box value-box))
Generic Function: (setf box-ref) (box)
Package

lil/interface/box.

Source

file-type.lisp.

Methods
Method: (setf box-ref) (box)
Generic Function: box-set! (box value)

set the contents of a BOX (if applicable). Return VALUE.

Package

lil/interface/box.

Source

file-type.lisp.

Methods
Method: box-set! ((box box!) value)
Method: box-set! ((box immutable-box) value)
Generic Reader: box-value (object)
Package

lil/interface/box.

Methods
Reader Method: box-value ((box! box!))

automatically generated reader method

Source

file-type.lisp.

Target Slot

value.

Reader Method: box-value ((value-box value-box))

automatically generated reader method

Source

file-type.lisp.

Target Slot

value.

Generic Writer: (setf box-value) (object)
Package

lil/interface/box.

Methods
Writer Method: (setf box-value) ((box! box!))

automatically generated writer method

Source

file-type.lisp.

Target Slot

value.

Generic Reader: bucketmap-interface (object)
Package

lil/pure/hash-table.

Methods
Reader Method: bucketmap-interface ((<hash-table> <hash-table>))

automatically generated reader method

Source

file-type.lisp.

Target Slot

bucketmap-interface.

Generic Function: call/cc (<continuation> function)
Package

lil/interface/monad/continuation.

Source

file-type.lisp.

Methods
Method: call/cc ((<continuation> <continuation>) fn)
Generic Function: check-invariant (<type> object &key lower lowerp upper upperp &allow-other-keys)

Check whether an OBJECT fulfills the invariant(s) required
to be an object of the type represented by this interface.
On success the OBJECT itself is returned. On failure an error is signalled.

Package

lil/interface/base.

Source

file-type.lisp.

Methods
Method: check-invariant ((<type> <mutating-map>) object &rest keys1198 &key &allow-other-keys)
Source

file-type.lisp.

Method: check-invariant ((<type> <linearized-map>) object &rest keys920 &key &allow-other-keys)
Source

file-type.lisp.

Method: check-invariant ((<simple-queue> <simple-queue>) q &key)
Source

file-type.lisp.

Method: check-invariant ((i <encoded-key-map>) m &key)
Source

file-type.lisp.

Method: check-invariant ((i <hash-table>) map &key)
Source

file-type.lisp.

Method: check-invariant ((<simple-queue> <simple-queue>) q &key)
Source

file-type.lisp.

Method: check-invariant ((i <encoded-key-map>) m &key)
Source

file-type.lisp.

Method: check-invariant ((i <fmim>) (map trie-head) &key)
Source

file-type.lisp.

Method: check-invariant ((i <hash-table>) map &key)
Source

file-type.lisp.

Method: check-invariant ((i <alist>) map &key)
Source

file-type.lisp.

Method: check-invariant :before ((i <avl-tree>) (node avl-tree-node) &key)
Source

file-type.lisp.

Method: check-invariant ((i <binary-tree>) (node binary-branch) &key lower lowerp upper upperp)
Source

file-type.lisp.

Method: check-invariant ((<empty-is-nil> <empty-is-nil>) (m null) &key &allow-other-keys)
Source

file-type.lisp.

Method: check-invariant ((<empty-is-empty-object> <empty-is-empty-object>) (m empty-object) &key &allow-other-keys)
Source

file-type.lisp.

Method: check-invariant ((<any> <any>) object &key)
Method: check-invariant :around ((<type> <type>) object &key &allow-other-keys)
Generic Function: check-invariant (object &rest keys403 &key &allow-other-keys)
Package

lil/transform/classy.

Methods
Method: check-invariant ((object >fifo-queue<) &rest keys438 &key &allow-other-keys)
Source

file-type.lisp.

Method: check-invariant ((object >queue<) &rest keys448 &key &allow-other-keys)
Source

file-type.lisp.

Method: check-invariant ((object >number-map<) &rest keys248 &key &allow-other-keys)
Source

file-type.lisp.

Method: check-invariant ((object >hash-table<) &rest keys40 &key &allow-other-keys)
Source

file-type.lisp.

Method: check-invariant ((object >map<) &rest keys398 &key &allow-other-keys)
Source

file-type.lisp.

Method: check-invariant ((object >fifo-queue<) &rest keys300 &key &allow-other-keys)
Source

file-type.lisp.

Method: check-invariant ((object >queue<) &rest keys307 &key &allow-other-keys)
Source

file-type.lisp.

Method: check-invariant ((object >number-map<) &rest keys251 &key &allow-other-keys)
Source

file-type.lisp.

Method: check-invariant ((object >map<) &rest keys403 &key &allow-other-keys)
Source

file-type.lisp.

Generic Reader: class-interface (object)
Package

lil/transform/classify.

Methods
Reader Method: class-interface ((object-box object-box))

automatically generated reader method

Source

file-type.lisp.

Target Slot

interface.

Reader Method: class-interface ((object-box object-box))

automatically generated reader method

Source

file-type.lisp.

Target Slot

interface.

Generic Function: collect (<sink> collector &rest values)

Given a <SINK> interface, a COLLECTOR state some VALUES, return a new COLLECTOR state to which the values were added

Package

lil/pure/iterator.

Source

file-type.lisp.

Methods
Method: collect ((<map> <map>) map &rest values)
Source

file-type.lisp.

Method: collect ((<for-each> <for-each>) fun &rest values)
Source

file-type.lisp.

Method: collect ((i <devnull>) x &rest values)
Source

file-type.lisp.

Generic Function: collect (<sink> collector &rest values)

Given a <SINK> interface, a COLLECTOR state some VALUES, return no values.

Package

lil/stateful/iterator.

Source

file-type.lisp.

Methods
Method: collect ((<map> <map>) map &rest values)
Source

file-type.lisp.

Method: collect ((<for-each> <for-each>) fun &rest values)
Source

file-type.lisp.

Method: collect ((i <devnull>) x &rest values)
Source

file-type.lisp.

Generic Function: collect-all-super-interfaces (interfaces collector)
Package

lil/core/metaclass.

Source

file-type.lisp.

Methods
Method: collect-all-super-interfaces ((symbol symbol) collector)
Method: collect-all-super-interfaces ((interface interface-class) collector)
Method: collect-all-super-interfaces ((interfaces cons) collector)
Generic Function: collector (<sink> sink)

Given a <SINK> interface and a SINK object, return
an initial COLLECTOR state with which to start collecting.

Package

lil/pure/iterator.

Source

file-type.lisp.

Methods
Method: collector ((<map> <map>) map)
Source

file-type.lisp.

Method: collector ((<for-each> <for-each>) fun)
Source

file-type.lisp.

Method: collector ((i <devnull>) x)
Source

file-type.lisp.

Generic Function: collector (<sink> sink)

Given a <SINK> interface and a SINK object, return
an initial COLLECTOR state with which to start collecting.

Package

lil/stateful/iterator.

Source

file-type.lisp.

Methods
Method: collector ((<map> <map>) map)
Source

file-type.lisp.

Method: collector ((<for-each> <for-each>) fun)
Source

file-type.lisp.

Method: collector ((i <devnull>) x)
Source

file-type.lisp.

Generic Function: compare (<order> x y)
Package

lil/interface/order.

Source

file-type.lisp.

Methods
Method: compare ((<lexicographic> <lexicographic>) x y)
Source

file-type.lisp.

Method: compare ((<boolean> <boolean>) x y)
Method: compare ((i <order-parameter>) x y)
Method: compare ((i <string>) x y)
Method: compare ((i <char>) x y)
Method: compare ((i <number>) x y)
Method: compare ((i <lessp>) x y)
Method: compare ((<compare> <compare>) x y)
Method: compare ((<order-from-lessp> <order-from-lessp>) x y)
Generic Function: conj (<finite-collection> collection entry)

Add an ENTRY to a COLLECTION.
How the entry is combined with any existing entry of same key depends on the specific interface. Return a new COLLECTION.

Package

lil/stateful/collection.

Source

file-type.lisp.

Methods
Method: conj ((<finite-collection> <mutating-map>) collection entry)
Source

file-type.lisp.

Generic Function: conj (<finite-collection> collection entry)

Add an ENTRY to a COLLECTION.
How the entry is combined with any existing entry of same key depends on the specific interface. Return a new COLLECTION.

Package

lil/pure/collection.

Source

file-type.lisp.

Methods
Method: conj ((<finite-collection> <linearized-map>) collection entry)
Source

file-type.lisp.

Generic Function: contents (<type> object &key &allow-other-keys)

Given an object, return contents sufficient to re-CREATE a similar object.

Package

lil/interface/base.

Source

file-type.lisp.

Methods
Method: contents ((<type> <mutating-map>) object &rest keys1274 &key &allow-other-keys)
Source

file-type.lisp.

Method: contents ((<type> <linearized-map>) object &rest keys1056 &key &allow-other-keys)
Source

file-type.lisp.

Method: contents ((<simple-queue> <simple-queue>) q &key)
Source

file-type.lisp.

Method: contents ((<simple-queue> <simple-queue>) q &key)
Source

file-type.lisp.

Generic Function: contents (object &rest keys483 &key &allow-other-keys)
Package

lil/transform/classy.

Methods
Method: contents ((object >fifo-queue<) &rest keys509 &key &allow-other-keys)
Source

file-type.lisp.

Method: contents ((object >queue<) &rest keys528 &key &allow-other-keys)
Source

file-type.lisp.

Method: contents ((object >number-map<) &rest keys319 &key &allow-other-keys)
Source

file-type.lisp.

Method: contents ((object >hash-table<) &rest keys111 &key &allow-other-keys)
Source

file-type.lisp.

Method: contents ((object >map<) &rest keys478 &key &allow-other-keys)
Source

file-type.lisp.

Method: contents ((object >fifo-queue<) &rest keys371 &key &allow-other-keys)
Source

file-type.lisp.

Method: contents ((object >queue<) &rest keys387 &key &allow-other-keys)
Source

file-type.lisp.

Method: contents ((object >number-map<) &rest keys322 &key &allow-other-keys)
Source

file-type.lisp.

Method: contents ((object >map<) &rest keys483 &key &allow-other-keys)
Source

file-type.lisp.

Generic Function: convert (<destination> <origin> object)

Convert an OBJECT following interface <ORIGIN>
into a new object following interface <DESTINATION>.

Package

lil/interface/base.

Source

file-type.lisp.

Methods
Method: convert ((<destination> <mutating-map>) <origin> object)
Source

file-type.lisp.

Method: convert ((<destination> <linearized-map>) <origin> object)
Source

file-type.lisp.

Method: convert ((<to> <map>) (<from> <map>) frommap)
Source

file-type.lisp.

Method: convert ((<to> <alist>) (<from> <map>) map)
Source

file-type.lisp.

Method: convert ((i2 <map>) (i1 <map>) map1)
Source

file-type.lisp.

Method: convert ((<any> <any>) <origin> object)
Generic Function: convert (<map> <origin> object)
Package

lil/transform/classy.

Methods
Method: convert ((<queue> <queue>) <origin> object)
Source

file-type.lisp.

Method: convert ((<map> <map>) <origin> object)
Source

file-type.lisp.

Method: convert ((<queue> <queue>) <origin> object)
Source

file-type.lisp.

Method: convert ((<map> <map>) <origin> object)
Source

file-type.lisp.

Generic Function: copy (<copyable> object)

Copy an OBJECT, returning a fresh object with
equivalent contains.
Beware: how deep the copy goes depends on the interface;
copying a data structure may lead to identical objects rather than copies being left at leaves; or it may not.
If you work in a stateful style, then this matters a lot
because your side-effects may or may not be seen by more or fewer copies than you think. Please consult the documentation of appropriate methods.

Package

lil/interface/base.

Source

file-type.lisp.

Methods
Method: copy ((<copyable> <mutating-map>) object)
Source

file-type.lisp.

Method: copy ((<copyable> <linearized-map>) object)
Source

file-type.lisp.

Method: copy ((<map-copy-from-join-empty> <map-copy-from-join-empty>) map)
Source

file-type.lisp.

Method: copy ((<copy-is-identity> <copy-is-identity>) x)
Generic Function: copy (object)
Package

lil/transform/classy.

Methods
Method: copy ((object >fifo-queue<))
Source

file-type.lisp.

Method: copy ((object >queue<))
Source

file-type.lisp.

Method: copy ((object >number-map<))
Source

file-type.lisp.

Method: copy ((object >hash-table<))
Source

file-type.lisp.

Method: copy ((object >map<))
Source

file-type.lisp.

Method: copy ((object >fifo-queue<))
Source

file-type.lisp.

Method: copy ((object >queue<))
Source

file-type.lisp.

Method: copy ((object >number-map<))
Source

file-type.lisp.

Method: copy ((object >map<))
Source

file-type.lisp.

Generic Function: create (<type> contents &key &allow-other-keys)

create an object conforming to the interface
based on CONTENTS and provided keyword options, returning the object.

Package

lil/interface/base.

Source

file-type.lisp.

Methods
Method: create ((<type> <mutating-map>) contents &rest keys1236 &key &allow-other-keys)
Source

file-type.lisp.

Method: create ((<type> <linearized-map>) contents &rest keys1018 &key &allow-other-keys)
Source

file-type.lisp.

Method: create ((<simple-queue> <simple-queue>) contents &key)
Source

file-type.lisp.

Method: create ((<simple-queue> <simple-queue>) entries &key)
Source

file-type.lisp.

Generic Function: create (<map> contents &rest keys439 &key &allow-other-keys)
Package

lil/transform/classy.

Methods
Method: create ((<queue> <queue>) contents &rest keys484 &key &allow-other-keys)
Source

file-type.lisp.

Method: create ((<map> <map>) contents &rest keys434 &key &allow-other-keys)
Source

file-type.lisp.

Method: create ((<queue> <queue>) contents &rest keys343 &key &allow-other-keys)
Source

file-type.lisp.

Method: create ((<map> <map>) contents &rest keys439 &key &allow-other-keys)
Source

file-type.lisp.

Generic Function: decode-key (<encoded-key-collection> encoded-key)

decode user-visible key from internal key

Package

lil/interface/collection.

Source

file-type.lisp.

Methods
Method: decode-key ((i <parametric-encoded-key-collection>) k)
Generic Function: deconj (<finite-collection> collection)

Drop from the COLLECTION the first ENTRY, if any. Return two values:
1- the ENTRY that was dropped if any, and
2- a boolean FOUNDP that is true iff an entry was found.

Package

lil/stateful/collection.

Source

file-type.lisp.

Methods
Method: deconj ((<finite-collection> <mutating-map>) collection)
Source

file-type.lisp.

Generic Function: deconj (<finite-collection> collection)

Drop from the COLLECTION the first ENTRY, if any. Return three values:
1- a new COLLECTION without that entry,
2- the ENTRY that was dropped if any, and
3- a boolean FOUNDP that is true iff an entry was found.

Package

lil/pure/collection.

Source

file-type.lisp.

Methods
Method: deconj ((<finite-collection> <linearized-map>) collection)
Source

file-type.lisp.

Generic Function: decons (<map> map)

Modify a map to drop its first association,
returning three values:
1- a boolean indicating whether the map was already empty. 2- a key
3- a value.
Which association is dropped is the same as per first-key-value.

Package

lil/stateful/map.

Source

file-type.lisp.

Methods
Method: decons ((<map> <mutating-map>) map)
Source

file-type.lisp.

Method: decons ((i <encoded-key-map>) map)
Source

file-type.lisp.

Method: decons ((i <map-decons-from-first-key-value-drop>) map)
Source

file-type.lisp.

Generic Function: decons (map)
Package

lil/transform/classy.

Methods
Method: decons ((map >number-map<))
Source

file-type.lisp.

Method: decons ((map >map<))
Source

file-type.lisp.

Generic Function: decons (map)
Package

lil/transform/posh.

Methods
Method: decons ((map >number-map<))
Source

file-type.lisp.

Method: decons ((map >hash-table<))
Source

file-type.lisp.

Method: decons ((map >map<))
Source

file-type.lisp.

Generic Function: decons (<map> map)

Drop an association from a map,
returning four values:
1- a boolean indicating whether the map was already empty. 2- a new map
3- a key
4- a value.
Which association is dropped is the same as per first-key-value.

Package

lil/pure/map.

Source

file-type.lisp.

Methods
Method: decons ((<map> <linearized-map>) map)
Source

file-type.lisp.

Method: decons ((i <encoded-key-map>) map)
Source

file-type.lisp.

Method: decons ((i <hash-table>) map)
Source

file-type.lisp.

Method: decons ((<i> <map-decons-from-first-key-value-drop>) map)
Source

file-type.lisp.

Generic Function: decrease-member-count (<multiset> collection key &optional count)
Package

lil/pure/set.

Source

file-type.lisp.

Methods
Method: decrease-member-count ((<i> <multiset>) collection key &optional count)
Source

file-type.lisp.

Generic Function: dequeue (queue)
Package

lil/transform/classy.

Methods
Method: dequeue ((queue >fifo-queue<))
Source

file-type.lisp.

Method: dequeue ((queue >queue<))
Source

file-type.lisp.

Generic Function: dequeue (queue)
Package

lil/transform/posh.

Methods
Method: dequeue ((queue >fifo-queue<))
Source

file-type.lisp.

Method: dequeue ((queue >queue<))
Source

file-type.lisp.

Generic Function: dequeue (<queue> queue)

Dequeue a datum from a queue

Package

lil/stateful/queue.

Source

file-type.lisp.

Methods
Method: dequeue ((<simple-queue> <simple-queue>) q)
Source

file-type.lisp.

Generic Function: dequeue (<queue> queue)

Dequeue a datum from a queue

Package

lil/pure/queue.

Source

file-type.lisp.

Methods
Method: dequeue ((<simple-queue> <simple-queue>) q)
Source

file-type.lisp.

Generic Function: dequeue-all (queue)
Package

lil/transform/classy.

Methods
Method: dequeue-all ((queue >fifo-queue<))
Source

file-type.lisp.

Method: dequeue-all ((queue >queue<))
Source

file-type.lisp.

Generic Function: dequeue-all (queue)
Package

lil/transform/posh.

Methods
Method: dequeue-all ((queue >fifo-queue<))
Source

file-type.lisp.

Method: dequeue-all ((queue >queue<))
Source

file-type.lisp.

Generic Function: dequeue-all (<queue> queue)

Empty the queue, return the former contents

Package

lil/stateful/queue.

Source

file-type.lisp.

Methods
Method: dequeue-all ((<simple-queue> <simple-queue>) q)
Source

file-type.lisp.

Generic Function: dequeue-all (<queue> queue)

Empty the queue, return the former contents

Package

lil/pure/queue.

Source

file-type.lisp.

Generic Function: disj (<finite-collection> collection key)

Drop from the COLLECTION an entry matching the key, if any. Return two values:
1- the ENTRY that was dropped if any, and
2- a boolean FOUNDP that is true iff an entry was found.

Package

lil/stateful/collection.

Source

file-type.lisp.

Methods
Method: disj ((<finite-collection> <mutating-map>) collection key)
Source

file-type.lisp.

Generic Function: disj (<finite-collection> collection key)

Drop from the COLLECTION an entry matching the key, if any. Return three values:
1- a new COLLECTION without that entry,
2- the ENTRY that was dropped if any, and
3- a boolean FOUNDP that is true iff an entry was found.

Package

lil/pure/collection.

Source

file-type.lisp.

Methods
Method: disj ((<finite-collection> <linearized-map>) collection key)
Source

file-type.lisp.

Generic Function: divide (<finite-collection> collection)

Divide a COLLECTION in two,
returning two maps COLLECTION2 and COLLECTION (eq to the COLLECTION argument) that each have strictly fewer associations than COLLECTION originally had, unless COLLECTION is of size zero or one, at which point COLLECTION2 is empty.

Package

lil/stateful/collection.

Source

file-type.lisp.

Methods
Method: divide ((<finite-collection> <mutating-map>) collection)
Source

file-type.lisp.

Method: divide ((i <encoded-key-map>) map)
Source

file-type.lisp.

Method: divide ((i <binary-tree>) node)
Source

file-type.lisp.

Method: divide ((<i> <map-divide-from-for-each*>) map)
Source

file-type.lisp.

Generic Function: divide (collection)
Package

lil/transform/classy.

Methods
Method: divide ((collection >number-map<))
Source

file-type.lisp.

Method: divide ((collection >map<))
Source

file-type.lisp.

Generic Function: divide (collection)
Package

lil/transform/posh.

Methods
Method: divide ((collection >fifo-queue<))
Source

file-type.lisp.

Method: divide ((collection >queue<))
Source

file-type.lisp.

Method: divide ((collection >number-map<))
Source

file-type.lisp.

Method: divide ((collection >hash-table<))
Source

file-type.lisp.

Method: divide ((collection >map<))
Source

file-type.lisp.

Generic Function: divide (<finite-collection> collection)

Divide a COLLECTION in two,
returning two collections COLLECTION1 and COLLECTION2 that each have strictly fewer entries than COLLECTION unless COLLECTION is of size zero or one, at which point the first result COLLECTION1 is empty.

Package

lil/pure/collection.

Source

file-type.lisp.

Methods
Method: divide ((<finite-collection> <linearized-map>) collection)
Source

file-type.lisp.

Method: divide ((i <encoded-key-map>) map)
Source

file-type.lisp.

Method: divide ((i <fmim>) map)
Source

file-type.lisp.

Method: divide ((i <hash-table>) map)
Source

file-type.lisp.

Method: divide ((i <binary-tree>) node)
Source

file-type.lisp.

Method: divide ((i <alist>) map)
Source

file-type.lisp.

Generic Function: divide/list (<finite-collection> collection)

Divide a collection in a list of several subcollections and return that list, such that merging those collections with join/list
will return a collection similar to the original one,
that the returned list is empty iff the initial collection is empty,
that the returned list is of length one iff the initial collection is a singleton, that otherwise, each element of the list is non-empty,
and the first one is EQ to the original collection.

Package

lil/stateful/collection.

Source

file-type.lisp.

Methods
Method: divide/list ((<mutating-map> <mutating-map>) map)
Source

file-type.lisp.

Method: divide/list ((i <encoded-key-map>) map)
Source

file-type.lisp.

Method: divide/list ((i <binary-tree>) node)
Source

file-type.lisp.

Method: divide/list ((<i> <map-divide/list-from-divide>) map)
Source

file-type.lisp.

Generic Function: divide/list (<finite-collection> collection)

Divide a collection in a list of several subcollections and return that list, such that merging those collections with join/list
will return a collection similar to the original one,
that the returned list is empty iff the initial collection is empty,
that the returned list is of length one iff the initial collection is a singleton, and that otherwise, each element of the list is non-empty.

Package

lil/pure/collection.

Source

file-type.lisp.

Methods
Method: divide/list ((<linearized-map> <linearized-map>) map)
Source

file-type.lisp.

Method: divide/list ((i <encoded-key-map>) map)
Source

file-type.lisp.

Method: divide/list ((i <hash-table>) map)
Source

file-type.lisp.

Method: divide/list ((i <binary-tree>) node)
Source

file-type.lisp.

Method: divide/list ((<i> <map-divide/list-from-divide>) map)
Source

file-type.lisp.

Generic Function: drop (<map> map key)

Modify the map to drop the association corresponding to given key, returning two values:
1- the value from the dropped association, and
2- a boolean that is true iff an association was found.

Package

lil/stateful/map.

Source

file-type.lisp.

Methods
Method: drop ((<map> <mutating-map>) map key)
Source

file-type.lisp.

Method: drop ((i <encoded-key-map>) map key)
Source

file-type.lisp.

Method: drop ((i <hash-table>) map key)
Source

file-type.lisp.

Method: drop :after ((i <post-self-balanced-binary-tree>) node key)
Source

file-type.lisp.

Method: drop ((i <binary-tree>) node key)
Source

file-type.lisp.

Generic Function: drop (map key)
Package

lil/transform/classy.

Methods
Method: drop ((map >number-map<) key)
Source

file-type.lisp.

Method: drop ((map >map<) key)
Source

file-type.lisp.

Generic Function: drop (map key)
Package

lil/transform/posh.

Methods
Method: drop ((map >number-map<) key)
Source

file-type.lisp.

Method: drop ((map >hash-table<) key)
Source

file-type.lisp.

Method: drop ((map >map<) key)
Source

file-type.lisp.

Generic Function: drop (<map> map key)

Drop from a map the association corresponding to given key, returning three values:
a new map without that association,
the value from the dropped association,
and a boolean that is true iff an association was found.

Package

lil/pure/map.

Source

file-type.lisp.

Methods
Method: drop ((<map> <linearized-map>) map key)
Source

file-type.lisp.

Method: drop ((i <encoded-key-map>) map key)
Source

file-type.lisp.

Method: drop ((i <fmim>) map key)
Source

file-type.lisp.

Method: drop ((i <hash-table>) map key)
Source

file-type.lisp.

Method: drop ((i <binary-tree>) node key)
Source

file-type.lisp.

Method: drop ((i <alist>) map key)
Source

file-type.lisp.

Generic Function: empty (<emptyable>)

Return an empty object of the emptyable type. A constant one is pure, a new one if stateful.

Package

lil/interface/empty.

Source

file-type.lisp.

Methods
Method: empty ((<emptyable> <mutating-map>))
Source

file-type.lisp.

Method: empty ((<emptyable> <linearized-map>))
Source

file-type.lisp.

Method: empty ((<simple-queue> <simple-queue>))
Source

file-type.lisp.

Method: empty ((i <encoded-key-map>))
Source

file-type.lisp.

Method: empty ((i <hash-table>))
Source

file-type.lisp.

Method: empty ((i <encoded-key-map>))
Source

file-type.lisp.

Method: empty ((i <hash-table>))
Source

file-type.lisp.

Method: empty ((<i> <set*-from-collection>))
Source

file-type.lisp.

Method: empty ((<i> <set*-from-collection>))
Source

file-type.lisp.

Method: empty ((i <box!>))
Source

file-type.lisp.

Method: empty ((<empty-is-nil> <empty-is-nil>))
Method: empty ((<empty-is-empty-object> <empty-is-empty-object>))
Generic Function: empty (<map>)
Package

lil/transform/classy.

Methods
Method: empty ((<queue> <queue>))
Source

file-type.lisp.

Method: empty ((<map> <map>))
Source

file-type.lisp.

Method: empty ((<queue> <queue>))
Source

file-type.lisp.

Method: empty ((<map> <map>))
Source

file-type.lisp.

Generic Function: empty! (<empty!able> ignored)

This function is pretty useless to call, but allows for automatic generation of mutating interface wrappers.

Package

lil/pure/empty.

Source

file-type.lisp.

Methods
Method: empty! ((<empty!able> <linearized-map>) ignored)
Source

file-type.lisp.

Method: empty! ((<i> <set*-from-collection>) x)
Source

file-type.lisp.

Method: empty! ((<empty!able> <empty!able>) ignored)
Generic Function: empty! (map)
Package

lil/transform/classy.

Methods
Method: empty! ((map >fifo-queue<))
Source

file-type.lisp.

Method: empty! ((map >queue<))
Source

file-type.lisp.

Method: empty! ((map >number-map<))
Source

file-type.lisp.

Method: empty! ((map >map<))
Source

file-type.lisp.

Generic Function: empty! (ignored)
Package

lil/transform/posh.

Methods
Method: empty! ((ignored >fifo-queue<))
Source

file-type.lisp.

Method: empty! ((ignored >queue<))
Source

file-type.lisp.

Method: empty! ((ignored >number-map<))
Source

file-type.lisp.

Method: empty! ((ignored >hash-table<))
Source

file-type.lisp.

Method: empty! ((ignored >map<))
Source

file-type.lisp.

Generic Function: empty! (<empty!able> map)

Clear the collection and make it empty. Return no value.

Package

lil/stateful/empty.

Source

file-type.lisp.

Methods
Method: empty! ((<mutating-map> <mutating-map>) x)
Source

file-type.lisp.

Method: empty! ((<simple-queue> <simple-queue>) q)
Source

file-type.lisp.

Method: empty! ((i <encoded-key-map>) map)
Source

file-type.lisp.

Method: empty! ((<i> <map-empty-is-empty-object>) map)
Source

file-type.lisp.

Generic Function: empty-p (<emptyable> object)