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 Fri Sep 15 05:50:55 2023 GMT+0.
lisp-interface-librarylillil/core/alllil/core/metaclasslil/core/utilitylil/core/interfacelil/interface/alllil/interface/baselil/interface/grouplil/interface/emptylil/interface/sizelil/interface/foldlil/interface/iteratorlil/interface/collectionlil/interface/boxlil/interface/eqlil/interface/orderlil/interface/sequencelil/interface/maplil/interface/setlil/interface/treelil/interface/tree-implementationlil/interface/monadlil/interface/runlil/interface/monad/continuationlil/interface/monad/identitylil/interface/monad/listlil/interface/monad/maybelil/interface/monad/statelil/interface/monad/transformer/listlil/interface/monad/transformerlil/interface/monad/transformer/maybelil/pure/alllil/pure/emptylil/pure/collectionlil/pure/iteratorlil/pure/maplil/pure/setlil/pure/sequencelil/pure/lexicographiclil/pure/alistlil/pure/treelil/pure/hash-tablelil/pure/encoded-key-maplil/pure/fmimlil/pure/queuelil/pure/iterator-implementationlil/pure/map-implementationlil/pure/set-implementationlil/pure/alist-implementationlil/pure/tree-implementationlil/pure/hash-table-implementationlil/pure/fmim-implementationlil/pure/encoded-key-map-implementationlil/pure/queue-implementationlil/stateful/alllil/stateful/emptylil/stateful/collectionlil/stateful/iteratorlil/stateful/maplil/stateful/treelil/stateful/hash-tablelil/stateful/encoded-key-maplil/stateful/queuelil/stateful/iterator-implementationlil/stateful/map-implementationlil/stateful/tree-implementationlil/stateful/hash-table-implementationlil/stateful/encoded-key-map-implementationlil/stateful/queue-implementationlil/transform/alllil/transform/linearizelil/transform/linearized-maplil/transform/mutatinglil/transform/mutating-maplil/transform/classifylil/transform/classylil/transform/poshlisp-interface-library/lisp-interface-library.asdlil/lil.asdlil/core/all/file-type.lisplil/core/metaclass/file-type.lisplil/core/utility/file-type.lisplil/core/interface/file-type.lisplil/interface/all/file-type.lisplil/interface/base/file-type.lisplil/interface/group/file-type.lisplil/interface/empty/file-type.lisplil/interface/size/file-type.lisplil/interface/fold/file-type.lisplil/interface/iterator/file-type.lisplil/interface/collection/file-type.lisplil/interface/box/file-type.lisplil/interface/eq/file-type.lisplil/interface/order/file-type.lisplil/interface/sequence/file-type.lisplil/interface/map/file-type.lisplil/interface/set/file-type.lisplil/interface/tree/file-type.lisplil/interface/tree-implementation/file-type.lisplil/interface/monad/file-type.lisplil/interface/run/file-type.lisplil/interface/monad/continuation/file-type.lisplil/interface/monad/identity/file-type.lisplil/interface/monad/list/file-type.lisplil/interface/monad/maybe/file-type.lisplil/interface/monad/state/file-type.lisplil/interface/monad/transformer/list/file-type.lisplil/interface/monad/transformer/file-type.lisplil/interface/monad/transformer/maybe/file-type.lisplil/pure/all/file-type.lisplil/pure/empty/file-type.lisplil/pure/collection/file-type.lisplil/pure/iterator/file-type.lisplil/pure/map/file-type.lisplil/pure/set/file-type.lisplil/pure/sequence/file-type.lisplil/pure/lexicographic/file-type.lisplil/pure/alist/file-type.lisplil/pure/tree/file-type.lisplil/pure/hash-table/file-type.lisplil/pure/encoded-key-map/file-type.lisplil/pure/fmim/file-type.lisplil/pure/queue/file-type.lisplil/pure/iterator-implementation/file-type.lisplil/pure/map-implementation/file-type.lisplil/pure/set-implementation/file-type.lisplil/pure/alist-implementation/file-type.lisplil/pure/tree-implementation/file-type.lisplil/pure/hash-table-implementation/file-type.lisplil/pure/fmim-implementation/file-type.lisplil/pure/encoded-key-map-implementation/file-type.lisplil/pure/queue-implementation/file-type.lisplil/stateful/all/file-type.lisplil/stateful/empty/file-type.lisplil/stateful/collection/file-type.lisplil/stateful/iterator/file-type.lisplil/stateful/map/file-type.lisplil/stateful/tree/file-type.lisplil/stateful/hash-table/file-type.lisplil/stateful/encoded-key-map/file-type.lisplil/stateful/queue/file-type.lisplil/stateful/iterator-implementation/file-type.lisplil/stateful/map-implementation/file-type.lisplil/stateful/tree-implementation/file-type.lisplil/stateful/hash-table-implementation/file-type.lisplil/stateful/encoded-key-map-implementation/file-type.lisplil/stateful/queue-implementation/file-type.lisplil/transform/all/file-type.lisplil/transform/linearize/file-type.lisplil/transform/linearized-map/file-type.lisplil/transform/mutating/file-type.lisplil/transform/mutating-map/file-type.lisplil/transform/classify/file-type.lisplil/transform/classy/file-type.lisplil/transform/posh/file-type.lisplil/transform/classylil/pure/map-implementationlil/interface/monad/transformerlil/pure/hash-tablelil/interface/monad/identitylil/transform/linearizelil/pure/alist-implementationlil/core/interfacelil/pure/emptylil/core/metaclasslil/stateful/iteratorlil/interface/monad/statelil/stateful/iterator-implementationlil/pure/encoded-key-map-implementationlil/core/alllil/interface/foldlil/stateful/queuelil/pure/tree-implementationlil/pure/iterator-implementationlil/stateful/hash-table-implementationlil/interface/grouplil/stateful/tree-implementationlil/stateful/treelil/pure/queuelil/pure/queue-implementationlil/pure/set-implementationlil/interface/eqlil/interface/monad/transformer/listlil/transform/linearized-maplil/interface/setlil/interface/monadlil/transform/alllil/interface/maplil/pure/fmim-implementationlil/interface/monad/listlil/interface/baselil/pure/treelil/interface/sizelil/stateful/map-implementationlil/transform/mutating-maplil/pure/hash-table-implementationlil/transform/poshlil/core/utilitylil/pure/encoded-key-maplil/interface/emptylil/pure/lexicographiclil/stateful/encoded-key-map-implementationlil/pure/alllil/interface/tree-implementationlil/interface/alllil/transform/classifylil/stateful/hash-tablelil/pure/setlil/interface/sequencelil/interface/monad/continuationlil/stateful/alllil/pure/sequencelil/interface/monad/maybelil/transform/mutatinglil/interface/runlil/interface/collectionlil/stateful/maplil/stateful/collectionlil/interface/iteratorlil/pure/collectionlil/stateful/queue-implementationlil/interface/monad/transformer/maybelil/interface/boxlil/pure/alistlil/interface/treelil/stateful/emptylil/stateful/encoded-key-maplil/pure/maplil/pure/fmimlil/interface/orderlil/pure/iteratorThe main system appears first, followed by any subsystem dependency.
lisp-interface-librarylillil/core/alllil/core/metaclasslil/core/utilitylil/core/interfacelil/interface/alllil/interface/baselil/interface/grouplil/interface/emptylil/interface/sizelil/interface/foldlil/interface/iteratorlil/interface/collectionlil/interface/boxlil/interface/eqlil/interface/orderlil/interface/sequencelil/interface/maplil/interface/setlil/interface/treelil/interface/tree-implementationlil/interface/monadlil/interface/runlil/interface/monad/continuationlil/interface/monad/identitylil/interface/monad/listlil/interface/monad/maybelil/interface/monad/statelil/interface/monad/transformer/listlil/interface/monad/transformerlil/interface/monad/transformer/maybelil/pure/alllil/pure/emptylil/pure/collectionlil/pure/iteratorlil/pure/maplil/pure/setlil/pure/sequencelil/pure/lexicographiclil/pure/alistlil/pure/treelil/pure/hash-tablelil/pure/encoded-key-maplil/pure/fmimlil/pure/queuelil/pure/iterator-implementationlil/pure/map-implementationlil/pure/set-implementationlil/pure/alist-implementationlil/pure/tree-implementationlil/pure/hash-table-implementationlil/pure/fmim-implementationlil/pure/encoded-key-map-implementationlil/pure/queue-implementationlil/stateful/alllil/stateful/emptylil/stateful/collectionlil/stateful/iteratorlil/stateful/maplil/stateful/treelil/stateful/hash-tablelil/stateful/encoded-key-maplil/stateful/queuelil/stateful/iterator-implementationlil/stateful/map-implementationlil/stateful/tree-implementationlil/stateful/hash-table-implementationlil/stateful/encoded-key-map-implementationlil/stateful/queue-implementationlil/transform/alllil/transform/linearizelil/transform/linearized-maplil/transform/mutatinglil/transform/mutating-maplil/transform/classifylil/transform/classylil/transform/poshlisp-interface-libraryLong name alias for lil
Francois-Rene Rideau
MIT
1.0.2.0
lil (system).
lilLIL: Lisp Interface Library
Francois-Rene Rideau
MIT
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/
1.0.2.0
lil/core/all (system).
lil/interface/all (system).
lil/pure/all (system).
lil/stateful/all (system).
lil/transform/all (system).
fare-memoization (system)., at least version "1.2.0"
lil/core/allFrancois-Rene Rideau
MIT
closer-mop (system).
fare-utils (system).
alexandria (system).
lil/core/metaclass (system).
lil/core/utility (system).
lil/core/interface (system).
lil/core/metaclassFrancois-Rene Rideau
MIT
closer-mop (system).
fare-memoization (system).
closer-mop (system).
lil/core/utility (system).
fare-utils (system).
alexandria (system).
lil/core/utilityFrancois-Rene Rideau
MIT
closer-mop (system).
closer-mop (system).
fare-utils (system).
alexandria (system).
lil/core/interfaceFrancois-Rene Rideau
MIT
closer-mop (system).
closer-mop (system).
lil/core/utility (system).
lil/core/metaclass (system).
lil/interface/allFrancois-Rene Rideau
MIT
closer-mop (system).
fare-utils (system).
alexandria (system).
lil/interface/base (system).
lil/interface/group (system).
lil/interface/empty (system).
lil/interface/size (system).
lil/interface/fold (system).
lil/interface/collection (system).
lil/interface/box (system).
lil/interface/eq (system).
lil/interface/order (system).
lil/interface/iterator (system).
lil/interface/sequence (system).
lil/interface/map (system).
lil/interface/set (system).
lil/interface/tree (system).
lil/interface/tree-implementation (system).
lil/interface/monad (system).
lil/interface/run (system).
lil/interface/monad/continuation (system).
lil/interface/monad/identity (system).
lil/interface/monad/list (system).
lil/interface/monad/maybe (system).
lil/interface/monad/state (system).
lil/interface/monad/transformer/list (system).
lil/interface/monad/transformer/maybe (system).
lil/interface/baseFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/groupFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
fare-utils (system).
alexandria (system).
lil/interface/emptyFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/sizeFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/foldFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/size (system).
lil/interface/group (system).
lil/interface/empty (system).
lil/interface/iterator (system).
lil/interface/iteratorFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
fare-utils (system).
alexandria (system).
lil/interface/collectionFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/empty (system).
lil/interface/size (system).
lil/interface/fold (system).
lil/interface/iterator (system).
lil/interface/boxFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/empty (system).
fare-utils (system).
alexandria (system).
lil/interface/eqFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
fare-utils (system).
alexandria (system).
lil/interface/orderFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/eq (system).
lil/interface/group (system).
fare-utils (system).
alexandria (system).
lil/interface/sequenceFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/collection (system).
lil/interface/empty (system).
lil/interface/size (system).
lil/interface/fold (system).
lil/interface/iterator (system).
lil/interface/mapFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/group (system).
lil/interface/collection (system).
lil/interface/fold (system).
fare-utils (system).
alexandria (system).
lil/interface/setFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/order (system).
lil/interface/fold (system).
lil/interface/collection (system).
lil/interface/map (system).
fare-utils (system).
alexandria (system).
lil/interface/treeFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/map (system).
lil/interface/fold (system).
lil/interface/order (system).
fare-utils (system).
alexandria (system).
lil/interface/tree-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/empty (system).
lil/interface/order (system).
lil/interface/iterator (system).
lil/interface/fold (system).
lil/interface/map (system).
lil/interface/tree (system).
fare-utils (system).
alexandria (system).
lil/interface/monadFrancois-Rene Rideau
MIT
lil/core/all (system).
lil/interface/base (system).
lil/interface/runFrancois-Rene Rideau
MIT
lil/core/all (system).
lil/interface/base (system).
lil/interface/monad/continuationFrancois-Rene Rideau
MIT
lil/interface/monad (system).
lil/core/all (system).
lil/interface/run (system).
lil/interface/monad/identityFrancois-Rene Rideau
MIT
lil/interface/monad (system).
lil/core/all (system).
lil/interface/monad/listFrancois-Rene Rideau
MIT
lil/interface/monad (system).
lil/core/all (system).
lil/interface/monad/maybeFrancois-Rene Rideau
MIT
lil/interface/monad (system).
lil/core/all (system).
lil/interface/empty (system).
lil/interface/group (system).
lil/interface/monad/stateFrancois-Rene Rideau
MIT
lil/interface/monad (system).
lil/core/all (system).
lil/interface/run (system).
lil/interface/monad/transformer/listFrancois-Rene Rideau
MIT
lil/core/all (system).
lil/interface/monad (system).
lil/interface/monad/list (system).
lil/interface/monad/transformer (system).
lil/interface/monad/identity (system).
lil/interface/monad/transformerFrancois-Rene Rideau
MIT
lil/interface/monad (system).
lil/core/all (system).
lil/interface/monad/identity (system).
lil/interface/monad/transformer/maybeFrancois-Rene Rideau
MIT
lil/interface/monad (system).
lil/core/all (system).
lil/interface/monad/identity (system).
lil/interface/group (system).
lil/interface/empty (system).
lil/interface/monad/maybe (system).
lil/interface/monad/transformer (system).
lil/pure/allFrancois-Rene Rideau
MIT
lil/interface/all (system).
closer-mop (system).
fare-utils (system).
alexandria (system).
lil/interface/base (system).
lil/interface/eq (system).
lil/interface/order (system).
lil/interface/group (system).
lil/pure/empty (system).
lil/pure/collection (system).
lil/pure/iterator (system).
lil/pure/map (system).
lil/pure/set (system).
lil/pure/sequence (system).
lil/pure/lexicographic (system).
lil/pure/alist (system).
lil/pure/tree (system).
lil/pure/hash-table (system).
lil/pure/fmim (system).
lil/pure/encoded-key-map (system).
lil/pure/queue (system).
lil/pure/iterator-implementation (system).
lil/pure/map-implementation (system).
lil/pure/set-implementation (system).
lil/pure/alist-implementation (system).
lil/pure/tree-implementation (system).
lil/pure/hash-table-implementation (system).
lil/pure/fmim-implementation (system).
lil/pure/encoded-key-map-implementation (system).
lil/pure/queue-implementation (system).
lil/pure/emptyFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/empty (system).
lil/pure/collectionFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/pure/empty (system).
lil/interface/collection (system).
lil/pure/iteratorFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/iterator (system).
lil/pure/mapFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/map (system).
lil/interface/fold (system).
lil/pure/iterator (system).
lil/pure/collection (system).
lil/pure/setFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/set (system).
lil/pure/collection (system).
lil/pure/map (system).
lil/pure/sequenceFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/pure/empty (system).
lil/interface/empty (system).
lil/interface/size (system).
lil/interface/fold (system).
lil/pure/iterator (system).
lil/pure/collection (system).
lil/interface/sequence (system).
lil/pure/lexicographicFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/eq (system).
lil/pure/sequence (system).
lil/interface/order (system).
fare-utils (system).
alexandria (system).
lil/pure/alistFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/eq (system).
lil/interface/group (system).
lil/pure/map (system).
lil/pure/treeFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/order (system).
lil/interface/tree (system).
lil/pure/map (system).
lil/pure/hash-tableFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/pure/tree (system).
lil/pure/alist (system).
lil/pure/encoded-key-map (system).
lil/interface/eq (system).
lil/pure/map (system).
lil/pure/encoded-key-mapFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/pure/map (system).
lil/pure/fmimFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/box (system).
lil/interface/order (system).
lil/pure/tree (system).
lil/pure/alist (system).
lil/pure/map (system).
lil/pure/queueFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/pure/iterator (system).
lil/pure/collection (system).
lil/pure/iterator-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/pure/iterator (system).
lil/pure/map-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/group (system).
lil/interface/fold (system).
lil/pure/map (system).
lil/pure/set-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/pure/set (system).
lil/pure/alist-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/eq (system).
lil/interface/group (system).
lil/pure/alist (system).
lil/pure/tree-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/order (system).
lil/pure/tree (system).
lil/pure/hash-table-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/pure/hash-table (system).
lil/pure/fmim-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/box (system).
lil/pure/tree (system).
lil/pure/fmim (system).
lil/pure/encoded-key-map-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
alexandria (system).
lil/pure/encoded-key-map (system).
lil/pure/queue-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/pure/queue (system).
lil/stateful/allFrancois-Rene Rideau
MIT
lil/interface/all (system).
closer-mop (system).
fare-utils (system).
alexandria (system).
lil/interface/base (system).
lil/interface/eq (system).
lil/interface/order (system).
lil/interface/group (system).
lil/stateful/empty (system).
lil/stateful/collection (system).
lil/stateful/iterator (system).
lil/stateful/map (system).
lil/stateful/tree (system).
lil/stateful/hash-table (system).
lil/stateful/encoded-key-map (system).
lil/stateful/queue (system).
lil/stateful/iterator-implementation (system).
lil/stateful/map-implementation (system).
lil/stateful/tree-implementation (system).
lil/stateful/hash-table-implementation (system).
lil/stateful/encoded-key-map-implementation (system).
lil/stateful/queue-implementation (system).
lil/stateful/emptyFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/empty (system).
lil/stateful/collectionFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/stateful/empty (system).
lil/interface/collection (system).
lil/stateful/iteratorFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/iterator (system).
lil/stateful/mapFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/map (system).
lil/interface/fold (system).
lil/stateful/iterator (system).
lil/stateful/collection (system).
lil/stateful/treeFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/order (system).
lil/interface/tree (system).
lil/stateful/map (system).
lil/stateful/hash-tableFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/stateful/tree (system).
lil/stateful/encoded-key-map (system).
lil/interface/eq (system).
lil/stateful/map (system).
lil/stateful/encoded-key-mapFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/stateful/map (system).
lil/stateful/queueFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/stateful/iterator (system).
lil/stateful/collection (system).
lil/stateful/iterator-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/box (system).
lil/stateful/iterator (system).
lil/stateful/map-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/group (system).
lil/interface/fold (system).
lil/stateful/map (system).
lil/stateful/tree-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/order (system).
lil/stateful/tree (system).
lil/stateful/hash-table-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/stateful/map-implementation (system).
lil/stateful/hash-table (system).
lil/stateful/encoded-key-map-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
alexandria (system).
lil/stateful/encoded-key-map (system).
lil/stateful/queue-implementationFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/stateful/queue (system).
lil/transform/allFrancois-Rene Rideau
MIT
lil/pure/all (system).
lil/stateful/all (system).
lil/transform/linearize (system).
lil/transform/linearized-map (system).
lil/transform/mutating (system).
lil/transform/mutating-map (system).
lil/transform/classify (system).
lil/transform/classy (system).
lil/transform/posh (system).
lil/transform/linearizeFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/box (system).
fare-utils (system).
alexandria (system).
lil/transform/linearized-mapFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/box (system).
lil/transform/linearize (system).
lil/pure/map (system).
lil/stateful/map (system).
lil/transform/mutatingFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/box (system).
fare-utils (system).
alexandria (system).
lil/transform/mutating-mapFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/box (system).
lil/transform/mutating (system).
lil/stateful/map (system).
lil/pure/map (system).
lil/pure/alist (system).
lil/transform/classifyFrancois-Rene Rideau
MIT
closer-mop (system).
lil/core/all (system).
lil/interface/base (system).
lil/interface/box (system).
fare-utils (system).
alexandria (system).
lil/transform/classyFrancois-Rene Rideau
MIT
closer-mop (system).
lil/transform/classify (system).
lil/interface/box (system).
fare-utils (system).
alexandria (system).
lil/stateful/tree (system).
lil/stateful/map (system).
lil/stateful/queue (system).
lil/transform/poshFrancois-Rene Rideau
MIT
closer-mop (system).
lil/transform/classify (system).
lil/interface/box (system).
fare-utils (system).
alexandria (system).
lil/pure/tree (system).
lil/pure/map (system).
lil/pure/hash-table (system).
lil/pure/queue (system).
lil/transform/classy (system).
Files are sorted by type and then listed depth-first from the systems components trees.
lisp-interface-library/lisp-interface-library.asdlil/lil.asdlil/core/all/file-type.lisplil/core/metaclass/file-type.lisplil/core/utility/file-type.lisplil/core/interface/file-type.lisplil/interface/all/file-type.lisplil/interface/base/file-type.lisplil/interface/group/file-type.lisplil/interface/empty/file-type.lisplil/interface/size/file-type.lisplil/interface/fold/file-type.lisplil/interface/iterator/file-type.lisplil/interface/collection/file-type.lisplil/interface/box/file-type.lisplil/interface/eq/file-type.lisplil/interface/order/file-type.lisplil/interface/sequence/file-type.lisplil/interface/map/file-type.lisplil/interface/set/file-type.lisplil/interface/tree/file-type.lisplil/interface/tree-implementation/file-type.lisplil/interface/monad/file-type.lisplil/interface/run/file-type.lisplil/interface/monad/continuation/file-type.lisplil/interface/monad/identity/file-type.lisplil/interface/monad/list/file-type.lisplil/interface/monad/maybe/file-type.lisplil/interface/monad/state/file-type.lisplil/interface/monad/transformer/list/file-type.lisplil/interface/monad/transformer/file-type.lisplil/interface/monad/transformer/maybe/file-type.lisplil/pure/all/file-type.lisplil/pure/empty/file-type.lisplil/pure/collection/file-type.lisplil/pure/iterator/file-type.lisplil/pure/map/file-type.lisplil/pure/set/file-type.lisplil/pure/sequence/file-type.lisplil/pure/lexicographic/file-type.lisplil/pure/alist/file-type.lisplil/pure/tree/file-type.lisplil/pure/hash-table/file-type.lisplil/pure/encoded-key-map/file-type.lisplil/pure/fmim/file-type.lisplil/pure/queue/file-type.lisplil/pure/iterator-implementation/file-type.lisplil/pure/map-implementation/file-type.lisplil/pure/set-implementation/file-type.lisplil/pure/alist-implementation/file-type.lisplil/pure/tree-implementation/file-type.lisplil/pure/hash-table-implementation/file-type.lisplil/pure/fmim-implementation/file-type.lisplil/pure/encoded-key-map-implementation/file-type.lisplil/pure/queue-implementation/file-type.lisplil/stateful/all/file-type.lisplil/stateful/empty/file-type.lisplil/stateful/collection/file-type.lisplil/stateful/iterator/file-type.lisplil/stateful/map/file-type.lisplil/stateful/tree/file-type.lisplil/stateful/hash-table/file-type.lisplil/stateful/encoded-key-map/file-type.lisplil/stateful/queue/file-type.lisplil/stateful/iterator-implementation/file-type.lisplil/stateful/map-implementation/file-type.lisplil/stateful/tree-implementation/file-type.lisplil/stateful/hash-table-implementation/file-type.lisplil/stateful/encoded-key-map-implementation/file-type.lisplil/stateful/queue-implementation/file-type.lisplil/transform/all/file-type.lisplil/transform/linearize/file-type.lisplil/transform/linearized-map/file-type.lisplil/transform/mutating/file-type.lisplil/transform/mutating-map/file-type.lisplil/transform/classify/file-type.lisplil/transform/classy/file-type.lisplil/transform/posh/file-type.lisplisp-interface-library/lisp-interface-library.asdlisp-interface-library (system).
lil/lil.asdlil (system).
lil.
lil/core/all.
lil/core/metaclass.
lil/core/utility.
lil/core/interface.
lil/interface/all.
lil/interface/base.
lil/interface/group.
lil/interface/empty.
lil/interface/size.
lil/interface/fold.
lil/interface/iterator.
lil/interface/collection.
lil/interface/box.
lil/interface/eq.
lil/interface/order.
lil/interface/sequence.
lil/interface/map.
lil/interface/set.
lil/interface/tree.
lil/interface/tree-implementation.
lil/interface/monad.
lil/interface/run.
lil/interface/monad/continuation.
lil/interface/monad/identity.
lil/interface/monad/list.
lil/interface/monad/maybe.
lil/interface/monad/state.
lil/interface/monad/transformer/list.
lil/interface/monad/transformer.
lil/interface/monad/transformer/maybe.
lil/pure/all.
lil/pure/empty.
lil/pure/collection.
lil/pure/iterator.
lil/pure/map.
lil/pure/set.
lil/pure/sequence.
lil/pure/lexicographic.
lil/pure/alist.
lil/pure/tree.
lil/pure/hash-table.
lil/pure/encoded-key-map.
lil/pure/fmim.
lil/pure/queue.
lil/pure/iterator-implementation.
lil/pure/map-implementation.
lil/pure/set-implementation.
lil/pure/alist-implementation.
lil/pure/tree-implementation.
lil/pure/hash-table-implementation.
lil/pure/fmim-implementation.
lil/pure/encoded-key-map-implementation.
lil/pure/queue-implementation.
lil/stateful/all.
lil/stateful/empty.
lil/stateful/collection.
lil/stateful/iterator.
lil/stateful/map.
lil/stateful/tree.
lil/stateful/hash-table.
lil/stateful/encoded-key-map.
lil/stateful/queue.
lil/stateful/iterator-implementation.
lil/stateful/map-implementation.
lil/stateful/tree-implementation.
lil/stateful/hash-table-implementation.
lil/stateful/encoded-key-map-implementation.
lil/stateful/queue-implementation.
lil/transform/all.
lil/transform/linearize.
lil/transform/linearized-map.
lil/transform/mutating.
lil/transform/mutating-map.
lil/transform/classify.
lil/transform/classy.
lil/transform/posh.
lil/core/metaclass/file-type.lisplil/core/metaclass (system).
all-interface-generics (function).
all-super-interfaces (generic function).
collect-all-super-interfaces (generic function).
collect-function-names (function).
define-interface (macro).
define-interface-generic (macro).
define-interface-generic> (macro).
define-interface-method (macro).
define-interface-methods (macro).
define-interface-specialized-functions (macro).
expand-interface-method> (function).
interface-abstract-p (reader method).
interface-class (class).
interface-class-p (function).
interface-direct-generics (function).
interface-generics (reader method).
(setf interface-generics) (writer method).
interface-gf-options (function).
register-interface-generic (function).
search-gf-options (function).
un<>ate (function).
validate-superclass (method).
with-interface (macro).
%all-super-interfaces (reader method).
(setf %all-super-interfaces) (writer method).
%define-interface-generic (macro).
direct-super-interfaces (generic function).
normalize-gf-io (function).
lil/core/utility/file-type.lisplil/core/utility (system).
boolean-integer (function).
decompose-function-name (function).
find-multiple-clos-options (function).
find-unique-clos-option (function).
find-unique-clos-option/0 (function).
find-unique-clos-option/1 (function).
find-unique-clos-option/1* (function).
keep-keyed-clos-options (function).
lambda-list-mimicker (function).
make-local-name (function).
memberp (function).
number-of-required-arguments (function).
remove-keyed-clos-options (function).
with-unique-collector (macro).
call-with-unique-collector (function).
lil/core/interface/file-type.lisplil/core/interface (system).
<interface> (class).
shared-initialize (method).
lil/interface/base/file-type.lisplil/interface/base (system).
<any> (special variable).
<any> (class).
<classy> (class).
<copy-is-identity> (class).
<copyable> (class).
<has-base-interface> (class).
<makeable> (class).
<type> (class).
base-interface (generic reader).
check-invariant (generic function).
contents (generic function).
convert (generic function).
copy (generic function).
create (generic function).
interface-class (reader method).
make (generic function).
lil/interface/group/file-type.lisplil/interface/group (system).
<group> (class).
<magma> (class).
<monoid> (class).
<semigroup> (class).
<semiring> (class).
id (generic function).
inverse (generic function).
multiplicative-operation (generic function).
op (generic function).
op/list (generic function).
<identity> (class).
<zero-plus> (class).
plus (generic function).
zero (generic function).
lil/interface/empty/file-type.lisplil/interface/empty (system).
<empty-is-empty-object> (class).
<empty-is-nil> (class).
<emptyable> (class).
check-invariant (method).
check-invariant (method).
empty (generic function).
empty-object (class).
empty-object-p (function).
empty-p (generic function).
make-empty-object (function).
lil/interface/size/file-type.lisplil/interface/size (system).
<sizable-size<=n-p-from-size> (class).
<sizable> (class).
size (generic function).
size<=n-p (generic function).
lil/interface/fold/file-type.lisplil/interface/fold (system).
<foldable-*-from> (class).
<foldable-fold-right-from-fold-left> (class).
<foldable-for-each-from-fold-left> (class).
<foldable-monoid-fold-from-fold-left> (class).
<foldable-size-from-fold-left> (class).
<foldable> (class).
fold-left (generic function).
fold-left* (generic function).
fold-right (generic function).
fold-right* (generic function).
for-each (method).
for-each* (method).
monoid-fold (generic function).
monoid-fold* (generic function).
size (method).
lil/interface/iterator/file-type.lisplil/interface/iterator (system).
<decreasing-number-iterator> (class).
<for-each> (special variable).
<for-each> (class).
<increasing-number-iterator> (class).
<number-iterator> (class).
for-each (generic function).
for-each* (generic function).
iterator-end (reader method).
iterator-increment (reader method).
iterator-start (reader method).
make-number-iterator (function).
lil/interface/collection/file-type.lisplil/interface/collection (system).
<collection-has-key-p-from-get-entry> (class).
<encoded-key-collection> (class).
<finite-collection> (class).
<parametric-encoded-key-collection> (class).
base-interface (reader method).
decode-key (generic function).
encode-key (generic function).
entry-values (generic function).
first-entry (generic function).
get-entry (generic function).
has-key-p (generic function).
key-decoder (reader method).
key-encoder (reader method).
key-interface (generic function).
singleton (generic function).
singleton-p (generic function).
lil/interface/box/file-type.lisplil/interface/box (system).
<box!> (class).
<box> (class).
<emptyable-box> (class).
<mutable-box> (class).
<one-use-box> (class).
<one-use-thunk-box> (class).
<one-use-value-box> (special variable).
<one-use-value-box> (class).
<promise-box> (class).
<thunk-box> (class).
<value-box> (special variable).
<value-box> (class).
box (class).
box! (function).
box! (class).
box-ref (generic function).
(setf box-ref) (generic function).
box-set! (generic function).
box-value (reader method).
box-value (reader method).
(setf box-value) (writer method).
delay (macro).
empty (method).
empty-p (method).
emptyable-box (class).
force (function).
immutable-box (class).
make-box (generic function).
make-one-use-function (function).
mutable-box (class).
one-use-box (class).
one-use-lambda (macro).
one-use-thunk-box (class).
one-use-value-box (function).
one-use-value-box (class).
promise-box (class).
set-box! (generic function).
set-box-value (writer method).
simple-thunk-box (class).
simple-value-box (class).
thunk-box (class).
unbox (generic function).
value-box (class).
box-thunk (reader method).
box-usedp (reader method).
(setf box-usedp) (writer method).
lil/interface/eq/file-type.lisplil/interface/eq (system).
<eq-from-==> (class).
<eq-from-eq-function> (class).
<eq> (class).
<eql> (special variable).
<eql> (class).
<equal> (special variable).
<equal> (class).
<hashable> (class).
== (generic function).
eq-function (generic function).
hash (generic function).
lil/interface/order/file-type.lisplil/interface/order (system).
<boolean> (special variable).
<boolean> (class).
<case-insensitive-string> (special variable).
<case-insensitive-string> (class).
<char> (special variable).
<char> (class).
<compare> (class).
<integer> (special variable).
<integer> (class).
<lessp> (class).
<number> (special variable).
<number> (class).
<order-from-compare> (class).
<order-from-lessp> (class).
<order-parameter> (class).
<order> (class).
<string> (special variable).
<string> (class).
== (method).
== (method).
== (method).
== (method).
== (method).
== (method).
== (method).
== (method).
compare (generic function).
eq-function (method).
id (method).
inverse (method).
op (method).
op/list (method).
order-interface (reader method).
order< (generic function).
order<= (generic function).
order> (generic function).
order>= (generic function).
call-compare (function).
call< (function).
call<= (function).
call= (function).
call> (function).
call>= (function).
compare-function (reader method).
lessp-function (reader method).
sorted-list-differences (function).
lil/interface/sequence/file-type.lisplil/interface/sequence (system).
<sequence> (class).
lil/interface/map/file-type.lisplil/interface/map (system).
<map-fold-right*-from-fold-left*> (class).
<map-foldable-from-*> (class).
<map-for-each*-from-fold-left*> (class).
<map-has-key-p-from-lookup> (class).
<map-monoid-fold*-from-fold-left*> (class).
<map> (class).
alist-map (generic function).
first-key-value (generic function).
fold-left (method).
fold-left* (method).
fold-right (method).
fold-right* (method).
for-each (method).
for-each* (method).
has-key-p (method).
lookup (generic function).
map-alist (generic function).
monoid-fold (method).
monoid-fold* (method).
value-interface (generic function).
<map-fold-left*-from-fold-right*> (class).
lil/interface/set/file-type.lisplil/interface/set (system).
<multiset-from-map> (class).
<multiset-from-set> (class).
<multiset> (class).
<set*-from-collection> (class).
<set*> (class).
<set-from-map> (class).
<set-from-multiset> (class).
<set> (class).
base-interface (reader method).
base-interface (reader method).
base-interface (reader method).
empty (method).
empty-p (method).
fold-left (method).
fold-left* (method).
fold-left* (method).
fold-right (method).
fold-right* (method).
fold-right* (method).
for-each (method).
for-each* (method).
for-each* (method).
key-interface (method).
list-multiset (generic function).
list-set (generic function).
member-count (generic function).
member-p (generic function).
multiset-list (generic function).
set-list (generic function).
size (method).
size (method).
size (method).
value-interface (method).
value-interface (method).
value-interface (method).
lil/interface/tree/file-type.lisplil/interface/tree (system).
<avl-tree> (class).
<binary-tree> (class).
<heighted-binary-tree> (class).
<number-map> (class).
<tree> (class).
association-pair (class).
avl-tree-node (class).
binary-branch (class).
binary-tree-node (class).
heighted-binary-tree-node (class).
key-interface (reader method).
left (reader method).
leftmost (generic function).
leftmost-node (generic function).
locate (generic function).
node (generic function).
node-balance (generic function).
node-class (generic function).
node-height (reader method).
node-key (reader method).
node-key-value (generic function).
node-value (reader method).
right (reader method).
rightmost (generic function).
rightmost-node (generic function).
lil/interface/tree-implementation/file-type.lisplil/interface/tree-implementation (system).
binary-tree-sexp (function).
check-invariant (method).
check-invariant (method).
first-key-value (method).
fold-left* (method).
fold-right* (method).
for-each* (method).
leftmost (method).
leftmost-node (method).
locate (method).
lookup (method).
node (method).
node-balance (method).
node-balance (method).
node-balance (method).
node-class (method).
node-height (method).
node-height (method).
node-key-value (method).
print-object (method).
rightmost (method).
rightmost-node (method).
lil/interface/monad/file-type.lisplil/interface/monad (system).
lil/interface/run/file-type.lisplil/interface/run (system).
lil/interface/monad/continuation/file-type.lisplil/interface/monad/continuation (system).
<continuation> (special variable).
<continuation> (class).
bind (method).
call/cc (generic function).
result (method).
run (method).
lil/interface/monad/identity/file-type.lisplil/interface/monad/identity (system).
<identity> (special variable).
<identity> (class).
bind (method).
result (method).
lil/interface/monad/list/file-type.lisplil/interface/monad/list (system).
lil/interface/monad/maybe/file-type.lisplil/interface/monad/maybe (system).
<maybe-empty> (special variable).
<maybe-empty> (class).
<maybe> (special variable).
<maybe> (class).
bind (method).
fail (method).
maybe-or (generic function).
maybe.empty-interface (reader method).
(setf maybe.empty-interface) (writer method).
print-object (method).
result (method).
lil/interface/monad/state/file-type.lisplil/interface/monad/state (system).
lil/interface/monad/transformer/list/file-type.lisplil/interface/monad/transformer/list (system).
<list-transformer> (special variable).
<list-transformer> (class).
bind (method).
lift (method).
result (method).
lil/interface/monad/transformer/file-type.lisplil/interface/monad/transformer (system).
<transformer> (special variable).
<transformer> (class).
bind (method).
fail (method).
inner (reader method).
(setf inner) (writer method).
lift (generic function).
print-object (method).
result (method).
lil/interface/monad/transformer/maybe/file-type.lisplil/interface/monad/transformer/maybe (system).
<maybe-transformer> (special variable).
<maybe-transformer> (class).
bind (method).
result (method).
lil/pure/empty/file-type.lisplil/pure/empty (system).
<empty!able> (class).
empty! (generic function).
lil/pure/collection/file-type.lisplil/pure/collection (system).
<finite-collection> (class).
conj (generic function).
deconj (generic function).
disj (generic function).
divide (generic function).
divide/list (generic function).
join (generic function).
join/list (generic function).
restriction (generic function).
lil/pure/iterator/file-type.lisplil/pure/iterator (system).
lil/pure/map/file-type.lisplil/pure/map (system).
<map-decons-from-first-key-value-drop> (class).
<map-divide/list-from-divide> (class).
<map-empty-is-nil> (class).
<map-join-from-fold-left*-insert> (class).
<map-join/list-from-join> (class).
<map-map/2-from-fold-left*-lookup-insert-drop> (class).
<map-monoid-fold*-from-divide/list> (class).
<map-monoid-fold*-from-divide> (class).
<map-singleton-from-insert> (class).
<map-singleton-p-from-decons> (class).
<map-size<=n-p-from-decons> (class).
<map-update-key-from-lookup-insert-drop> (class).
<map> (class).
decons (generic function).
drop (generic function).
insert (generic function).
map/2 (generic function).
update-key (generic function).
lil/pure/set/file-type.lisplil/pure/set (system).
<multiset-from-map> (class).
<multiset-from-set> (class).
<multiset> (class).
<set*-from-collection> (class).
<set*> (class).
<set-from-map> (class).
<set-from-multiset> (class).
<set> (class).
decrease-member-count (generic function).
increase-member-count (generic function).
proper-subset-p (generic function).
set-disjunction (generic function).
set-intersection (generic function).
set-intersection/list (generic function).
set-union (generic function).
set-union/list (generic function).
subset-p (generic function).
lil/pure/sequence/file-type.lisplil/pure/sequence (system).
<sequence> (class).
lil/pure/lexicographic/file-type.lisplil/pure/lexicographic (system).
<lexicographic> (class).
compare (method).
element-interface (reader method).
lil/pure/alist/file-type.lisplil/pure/alist (system).
<alist> (special variable).
<alist> (class).
key-interface (reader method).
value-interface (reader method).
lil/pure/tree/file-type.lisplil/pure/tree (system).
<avl-tree> (class).
<binary-tree> (class).
<nm> (special variable).
<number-map> (special variable).
<number-map> (class).
<parametric-avl-tree> (class).
<string-map> (special variable).
<tree> (class).
association-pair (class).
avl-tree-node (class).
binary-tree-node (class).
key-interface (reader method).
value-interface (reader method).
lil/pure/hash-table/file-type.lisplil/pure/hash-table (system).
<hash-table> (special variable).
<hash-table> (class).
bucketmap-interface (reader method).
hashmap-interface (reader method).
key-interface (reader method).
value-interface (reader method).
lil/pure/encoded-key-map/file-type.lisplil/pure/encoded-key-map (system).
<encoded-key-map> (class).
<parametric-encoded-key-map> (class).
lil/pure/fmim/file-type.lisplil/pure/fmim (system).
<fmim> (special variable).
<fmim> (class).
full-trie-branch (class).
key-interface (method).
node-height (reader method).
node-prefix-bits (reader method).
node-prefix-length (reader method).
trie-branch (class).
trie-head (class).
trie-node (class).
trie-skip (class).
value-interface (method).
lil/pure/queue/file-type.lisplil/pure/queue (system).
<queue> (class).
dequeue (generic function).
dequeue-all (generic function).
enqueue (generic function).
enqueue-first (generic function).
enqueue-last (generic function).
enqueue-many (generic function).
lil/pure/iterator-implementation/file-type.lisplil/pure/iterator-implementation (system).
lil/pure/map-implementation/file-type.lisplil/pure/map-implementation (system).
collect (method).
collector (method).
convert (method).
decons (method).
divide/list (method).
iterator (method).
join (method).
join/list (method).
map/2 (method).
monoid-fold* (method).
monoid-fold* (method).
next (method).
node-key-value (method).
result (method).
singleton (method).
singleton-p (method).
size<=n-p (method).
update-key (method).
lil/pure/set-implementation/file-type.lisplil/pure/set-implementation (system).
decrease-member-count (method).
empty (method).
empty! (method).
empty-p (method).
increase-member-count (method).
proper-subset-p (method).
set-disjunction (method).
set-intersection (method).
set-intersection/list (method).
set-union (method).
set-union (method).
set-union/list (method).
set-union/list (method).
singleton (method).
singleton (method).
singleton-p (method).
subset-p (method).
lil/pure/alist-implementation/file-type.lisplil/pure/alist-implementation (system).
alist-map (method).
check-invariant (method).
convert (method).
divide (method).
drop (method).
first-key-value (method).
fold-left* (method).
fold-right* (method).
for-each* (method).
id (method).
insert (method).
lookup (method).
map-alist (method).
op (method).
op/list (method).
size (method).
lil/pure/tree-implementation/file-type.lisplil/pure/tree-implementation (system).
divide (method).
divide/list (method).
drop (method).
insert (method).
node (method).
node-class (method).
node-class (method).
lil/pure/hash-table-implementation/file-type.lisplil/pure/hash-table-implementation (system).
check-invariant (method).
decons (method).
divide (method).
divide/list (method).
drop (method).
empty (method).
empty-p (method).
first-key-value (method).
fold-left* (method).
fold-right* (method).
for-each* (method).
insert (method).
lookup (method).
monoid-fold* (method).
singleton (method).
size (method).
lil/pure/fmim-implementation/file-type.lisplil/pure/fmim-implementation (system).
check-invariant (method).
divide (method).
drop (method).
first-key-value (method).
fold-left* (method).
fold-right* (method).
insert (method).
join (method).
leftmost (method).
lookup (method).
print-object (method).
print-object (method).
print-object (method).
rightmost (method).
make-trie-branch (function).
make-trie-head (function).
make-trie-leaf (function).
make-trie-skip (function).
trie-check-invariant (function).
trie-drop (function).
trie-fold-left (function).
trie-fold-right (function).
trie-insert (function).
trie-join (function).
trie-leftmost (function).
trie-lookup (function).
trie-rightmost (function).
lil/pure/encoded-key-map-implementation/file-type.lisplil/pure/encoded-key-map-implementation (system).
<encoded-key-map> (function).
check-invariant (method).
decons (method).
divide (method).
divide/list (method).
drop (method).
empty (method).
empty-p (method).
first-key-value (method).
fold-left* (method).
fold-right* (method).
for-each* (method).
insert (method).
join (method).
join/list (method).
lookup (method).
map/2 (method).
singleton-p (method).
size (method).
update-key (method).
lil/pure/queue-implementation/file-type.lisplil/pure/queue-implementation (system).
<fifo-queue> (special variable).
<fifo-queue> (class).
<lifo-queue> (special variable).
<lifo-queue> (class).
<queue-enqueue-first> (class).
<queue-enqueue-last> (class).
<simple-queue> (class).
check-invariant (method).
contents (method).
create (method).
dequeue (method).
enqueue (method).
enqueue (method).
enqueue-first (method).
enqueue-last (method).
enqueue-many (method).
first-entry (method).
lil/stateful/empty/file-type.lisplil/stateful/empty (system).
<empty!able> (class).
empty! (generic function).
lil/stateful/collection/file-type.lisplil/stateful/collection (system).
<finite-collection> (class).
conj (generic function).
deconj (generic function).
disj (generic function).
divide (generic function).
divide/list (generic function).
join (generic function).
join/list (generic function).
restriction (generic function).
lil/stateful/iterator/file-type.lisplil/stateful/iterator (system).
lil/stateful/map/file-type.lisplil/stateful/map (system).
<map-copy-from-join-empty> (class).
<map-decons-from-first-key-value-drop> (class).
<map-divide-from-for-each*> (class).
<map-divide/list-from-divide> (class).
<map-empty-is-empty-object> (class).
<map-first-key-value-from-for-each*> (class).
<map-fold-left*-from-for-each*> (class).
<map-join-from-for-each*-lookup-insert> (class).
<map-join/list-from-join> (class).
<map-map/2-from-for-each*-lookup-insert-drop> (class).
<map-update-key-from-lookup-insert-drop> (class).
<map> (class).
copy (method).
decons (generic function).
drop (generic function).
insert (generic function).
map/2 (generic function).
update-key (generic function).
lil/stateful/tree/file-type.lisplil/stateful/tree (system).
<avl-tree> (class).
<binary-tree> (class).
<heighted-binary-tree> (class).
<nm> (special variable).
<number-map> (special variable).
<number-map> (class).
<parametric-avl-tree> (class).
<post-self-balanced-binary-tree> (class).
<string-map> (special variable).
<tree> (class).
association-pair (class).
avl-tree-node (class).
balance-node (generic function).
binary-branch (class).
binary-tree-node (class).
heighted-binary-tree-node (class).
key-interface (reader method).
left (reader method).
(setf left) (writer method).
node-height (reader method).
(setf node-height) (writer method).
node-key (reader method).
(setf node-key) (writer method).
node-value (reader method).
(setf node-value) (writer method).
right (reader method).
(setf right) (writer method).
rotate-node-left (generic function).
rotate-node-right (generic function).
update-height (generic function).
value-interface (reader method).
lil/stateful/hash-table/file-type.lisplil/stateful/hash-table (system).
<hash-table> (special variable).
<hash-table> (class).
key-interface (reader method).
lil/stateful/encoded-key-map/file-type.lisplil/stateful/encoded-key-map (system).
<encoded-key-map> (class).
<parametric-encoded-key-map> (class).
lil/stateful/queue/file-type.lisplil/stateful/queue (system).
<queue> (class).
dequeue (generic function).
dequeue-all (generic function).
enqueue (generic function).
enqueue-first (generic function).
enqueue-last (generic function).
enqueue-many (generic function).
lil/stateful/iterator-implementation/file-type.lisplil/stateful/iterator-implementation (system).
<devnull> (class).
lil/stateful/map-implementation/file-type.lisplil/stateful/map-implementation (system).
collect (method).
collector (method).
convert (method).
decons (method).
divide (method).
divide/list (method).
empty! (method).
first-key-value (method).
fold-left* (method).
iterator (method).
join (method).
join/list (method).
map/2 (method).
next (method).
node-key-value (method).
result (method).
update-key (method).
lil/stateful/tree-implementation/file-type.lisplil/stateful/tree-implementation (system).
balance-node (method).
balance-node (method).
divide (method).
divide/list (method).
drop (method).
drop (method).
insert (method).
insert (method).
node (method).
node-class (method).
node-class (method).
rotate-node-left (method).
rotate-node-left (method).
rotate-node-right (method).
rotate-node-right (method).
update-height (method).
copy-node (generic function).
lil/stateful/hash-table-implementation/file-type.lisplil/stateful/hash-table-implementation (system).
normalize-eq-function (function).
same-eq-function-p (function).
lil/stateful/encoded-key-map-implementation/file-type.lisp<encoded-key-map> (function).
check-invariant (method).
decons (method).
divide (method).
divide/list (method).
drop (method).
empty (method).
empty! (method).
empty-p (method).
first-key-value (method).
fold-left* (method).
fold-right* (method).
for-each* (method).
insert (method).
join (method).
join/list (method).
lookup (method).
map/2 (method).
size (method).
update-key (method).
lil/stateful/queue-implementation/file-type.lisplil/stateful/queue-implementation (system).
<fifo-queue> (special variable).
<fifo-queue> (class).
<lifo-queue> (special variable).
<lifo-queue> (class).
<queue-enqueue-first> (class).
<queue-enqueue-last> (class).
<simple-queue> (class).
check-invariant (method).
contents (method).
create (method).
dequeue (method).
dequeue-all (method).
empty (method).
empty! (method).
empty-p (method).
enqueue (method).
enqueue (method).
enqueue-first (method).
enqueue-last (method).
enqueue-many (method).
first-entry (method).
lil/transform/all/file-type.lisplil/transform/all (system).
lil/transform/linearize/file-type.lisplil/transform/linearize (system).
<linear> (class).
<linearized> (class).
define-linearized-interface (macro).
define-linearized-method (macro).
stateful-interface (reader method).
lil/transform/linearized-map/file-type.lisplil/transform/linearized-map (system).
<linearized-map> (class).
alist-map (method).
check-invariant (method).
conj (method).
contents (method).
convert (method).
copy (method).
create (method).
deconj (method).
decons (method).
disj (method).
divide (method).
divide/list (method).
drop (method).
empty (method).
empty! (method).
empty-p (method).
first-entry (method).
first-key-value (method).
fold-left (method).
fold-left* (method).
fold-right (method).
fold-right* (method).
for-each (method).
for-each* (method).
get-entry (method).
has-key-p (method).
insert (method).
join (method).
join/list (method).
lookup (method).
map-alist (method).
map/2 (method).
monoid-fold (method).
monoid-fold* (method).
restriction (method).
singleton (method).
singleton-p (method).
size (method).
size<=n-p (method).
update-key (method).
lil/transform/mutating/file-type.lisplil/transform/mutating (system).
<mutating> (class).
define-mutating-interface (macro).
define-mutating-method (macro).
pure-interface (reader method).
lil/transform/mutating-map/file-type.lisplil/transform/mutating-map (system).
<alist> (special variable).
<mutating-map> (class).
alist-map (method).
check-invariant (method).
conj (method).
contents (method).
convert (method).
copy (method).
create (method).
deconj (method).
decons (method).
disj (method).
divide (method).
divide/list (method).
drop (method).
empty (method).
empty! (method).
empty-p (method).
first-entry (method).
first-key-value (method).
fold-left (method).
fold-left* (method).
fold-right (method).
fold-right* (method).
for-each (method).
for-each* (method).
get-entry (method).
has-key-p (method).
insert (method).
join (method).
join/list (method).
lookup (method).
map-alist (method).
map/2 (method).
monoid-fold (method).
monoid-fold* (method).
restriction (method).
singleton (method).
singleton-p (method).
size (method).
size<=n-p (method).
update-key (method).
lil/transform/classify/file-type.lisplil/transform/classify (system).
define-classified-interface-class (macro).
define-classified-method (macro).
lil/transform/classy/file-type.lisplil/transform/classy (system).
>fifo-queue< (class).
>map< (class).
>number-map< (class).
>queue< (class).
check-invariant (method).
check-invariant (method).
check-invariant (method).
check-invariant (method).
class-interface (reader method).
contents (method).
contents (method).
contents (method).
contents (method).
convert (method).
convert (method).
copy (method).
copy (method).
copy (method).
copy (method).
create (method).
create (method).
create-fifo-queue (function).
create-number-map (function).
decons (method).
decons (method).
dequeue (method).
dequeue (method).
dequeue-all (method).
dequeue-all (method).
divide (method).
divide (method).
drop (method).
drop (method).
empty (method).
empty (method).
empty! (method).
empty! (method).
empty! (method).
empty! (method).
empty-fifo-queue (function).
empty-number-map (function).
empty-p (method).
empty-p (method).
empty-p (method).
empty-p (method).
empty-p (method).
enqueue (method).
enqueue (method).
enqueue-first (method).
enqueue-first (method).
enqueue-last (method).
enqueue-last (method).
enqueue-many (method).
enqueue-many (method).
first-entry (method).
first-entry (method).
first-entry (method).
first-entry (method).
first-key-value (method).
first-key-value (method).
fold-left (method).
fold-left (method).
fold-left (method).
fold-left (method).
fold-left* (method).
fold-left* (method).
fold-left* (method).
fold-left* (method).
fold-right (method).
fold-right (method).
fold-right (method).
fold-right (method).
fold-right* (method).
fold-right* (method).
fold-right* (method).
fold-right* (method).
for-each (method).
for-each (method).
for-each (method).
for-each (method).
for-each* (method).
for-each* (method).
for-each* (method).
for-each* (method).
get-entry (method).
get-entry (method).
get-entry (method).
get-entry (method).
has-key-p (method).
has-key-p (method).
has-key-p (method).
has-key-p (method).
insert (method).
insert (method).
join (method).
join (method).
lookup (method).
lookup (method).
map/2 (method).
map/2 (method).
object-box (class).
print-object (method).
singleton (method).
singleton (method).
singleton-p (method).
singleton-p (method).
singleton-p (method).
singleton-p (method).
size (method).
size (method).
size (method).
size (method).
size<=n-p (method).
size<=n-p (method).
size<=n-p (method).
size<=n-p (method).
update-key (method).
update-key (method).
alist-map (method).
alist-map-number-map (function).
conj (method).
conj (method).
convert-fifo-queue (function).
convert-number-map (function).
deconj (method).
deconj (method).
disj (method).
disj (method).
map-alist (method).
map-alist (method).
monoid-fold (method).
monoid-fold (method).
monoid-fold (method).
monoid-fold (method).
monoid-fold* (method).
monoid-fold* (method).
monoid-fold* (method).
monoid-fold* (method).
restriction (method).
restriction (method).
singleton-fifo-queue (function).
singleton-number-map (function).
lil/transform/posh/file-type.lisplil/transform/posh (system).
>fifo-queue< (class).
>hash-table< (class).
>map< (class).
>number-map< (class).
>queue< (class).
check-invariant (method).
check-invariant (method).
check-invariant (method).
check-invariant (method).
check-invariant (method).
class-interface (reader method).
contents (method).
contents (method).
contents (method).
contents (method).
contents (method).
convert (method).
convert (method).
copy (method).
copy (method).
copy (method).
copy (method).
copy (method).
create (method).
create (method).
create-number-map (function).
decons (method).
decons (method).
decons (method).
dequeue (method).
dequeue (method).
dequeue-all (method).
dequeue-all (method).
divide (method).
divide (method).
divide (method).
divide (method).
divide (method).
drop (method).
drop (method).
drop (method).
empty (method).
empty (method).
empty! (method).
empty! (method).
empty! (method).
empty! (method).
empty! (method).
empty-number-map (function).
empty-p (method).
empty-p (method).
empty-p (method).
empty-p (method).
empty-p (method).
empty-p (method).
empty-p (method).
enqueue (method).
enqueue (method).
enqueue-first (method).
enqueue-first (method).
enqueue-last (method).
enqueue-last (method).
enqueue-many (method).
enqueue-many (method).
first-entry (method).
first-entry (method).
first-entry (method).
first-entry (method).
first-entry (method).
first-key-value (method).
first-key-value (method).
first-key-value (method).
fold-left (method).
fold-left (method).
fold-left (method).
fold-left (method).
fold-left (method).
fold-left* (method).
fold-left* (method).
fold-left* (method).
fold-left* (method).
fold-left* (method).
fold-right (method).
fold-right (method).
fold-right (method).
fold-right (method).
fold-right (method).
fold-right* (method).
fold-right* (method).
fold-right* (method).
fold-right* (method).
fold-right* (method).
for-each (method).
for-each (method).
for-each (method).
for-each (method).
for-each (method).
for-each* (method).
for-each* (method).
for-each* (method).
for-each* (method).
for-each* (method).
get-entry (method).
get-entry (method).
get-entry (method).
get-entry (method).
get-entry (method).
has-key-p (method).
has-key-p (method).
has-key-p (method).
has-key-p (method).
has-key-p (method).
insert (method).
insert (method).
insert (method).
join (method).
join (method).
join (method).
join (method).
join (method).
lookup (method).
lookup (method).
lookup (method).
map/2 (method).
map/2 (method).
map/2 (method).
object-box (class).
print-object (method).
singleton (method).
singleton (method).
singleton-p (method).
singleton-p (method).
singleton-p (method).
singleton-p (method).
singleton-p (method).
size (method).
size (method).
size (method).
size (method).
size (method).
size<=n-p (method).
size<=n-p (method).
size<=n-p (method).
size<=n-p (method).
size<=n-p (method).
update-key (method).
update-key (method).
update-key (method).
alist-map (method).
alist-map-hash-table (function).
alist-map-number-map (function).
conj (method).
conj (method).
conj (method).
conj (method).
conj (method).
convert-hash-table (function).
convert-number-map (function).
convert-queue (function).
create-hash-table (function).
create-queue (function).
deconj (method).
deconj (method).
deconj (method).
deconj (method).
deconj (method).
disj (method).
disj (method).
disj (method).
disj (method).
disj (method).
empty-hash-table (function).
empty-queue (function).
map-alist (method).
map-alist (method).
map-alist (method).
monoid-fold (method).
monoid-fold (method).
monoid-fold (method).
monoid-fold (method).
monoid-fold (method).
monoid-fold* (method).
monoid-fold* (method).
monoid-fold* (method).
monoid-fold* (method).
monoid-fold* (method).
restriction (method).
restriction (method).
restriction (method).
restriction (method).
restriction (method).
singleton-hash-table (function).
singleton-number-map (function).
singleton-queue (function).
Packages are listed by definition order.
lil/transform/classylil/pure/map-implementationlil/interface/monad/transformerlil/pure/hash-tablelil/interface/monad/identitylil/transform/linearizelil/pure/alist-implementationlil/core/interfacelil/pure/emptylil/core/metaclasslil/stateful/iteratorlil/interface/monad/statelil/stateful/iterator-implementationlil/pure/encoded-key-map-implementationlil/core/alllil/interface/foldlil/stateful/queuelil/pure/tree-implementationlil/pure/iterator-implementationlil/stateful/hash-table-implementationlil/interface/grouplil/stateful/tree-implementationlil/stateful/treelil/pure/queuelil/pure/queue-implementationlil/pure/set-implementationlil/interface/eqlil/interface/monad/transformer/listlil/transform/linearized-maplil/interface/setlil/interface/monadlil/transform/alllil/interface/maplil/pure/fmim-implementationlil/interface/monad/listlil/interface/baselil/pure/treelil/interface/sizelil/stateful/map-implementationlil/transform/mutating-maplil/pure/hash-table-implementationlil/transform/poshlil/core/utilitylil/pure/encoded-key-maplil/interface/emptylil/pure/lexicographiclil/stateful/encoded-key-map-implementationlil/pure/alllil/interface/tree-implementationlil/interface/alllil/transform/classifylil/stateful/hash-tablelil/pure/setlil/interface/sequencelil/interface/monad/continuationlil/stateful/alllil/pure/sequencelil/interface/monad/maybelil/transform/mutatinglil/interface/runlil/interface/collectionlil/stateful/maplil/stateful/collectionlil/interface/iteratorlil/pure/collectionlil/stateful/queue-implementationlil/interface/monad/transformer/maybelil/interface/boxlil/pure/alistlil/interface/treelil/stateful/emptylil/stateful/encoded-key-maplil/pure/maplil/pure/fmimlil/interface/orderlil/pure/iteratorlil/transform/classytraditional classy APIs for LIL data structure
classy
alexandria.
closer-common-lisp.
fare-utils.
lil/interface/box.
lil/transform/classify.
uiop/driver.
>fifo-queue< (class).
>map< (class).
>number-map< (class).
>queue< (class).
check-invariant (generic function).
contents (generic function).
convert (generic function).
copy (generic function).
create (generic function).
create-fifo-queue (function).
create-number-map (function).
decons (generic function).
dequeue (generic function).
dequeue-all (generic function).
divide (generic function).
drop (generic function).
empty (generic function).
empty! (generic function).
empty-fifo-queue (function).
empty-number-map (function).
empty-p (generic function).
enqueue (generic function).
enqueue-first (generic function).
enqueue-last (generic function).
enqueue-many (generic function).
first-entry (generic function).
first-key-value (generic function).
fold-left (generic function).
fold-left* (generic function).
fold-right (generic function).
fold-right* (generic function).
for-each (generic function).
for-each* (generic function).
get-entry (generic function).
has-key-p (generic function).
insert (generic function).
join (generic function).
lookup (generic function).
map/2 (generic function).
object-box (class).
singleton (generic function).
singleton-p (generic function).
size (generic function).
size<=n-p (generic function).
update-key (generic function).
alist-map (generic function).
alist-map-number-map (function).
conj (generic function).
convert-fifo-queue (function).
convert-number-map (function).
deconj (generic function).
disj (generic function).
interface (slot).
interface (slot).
interface (slot).
interface (slot).
interface (slot).
interface (slot).
map-alist (generic function).
monoid-fold (generic function).
monoid-fold* (generic function).
restriction (generic function).
singleton-fifo-queue (function).
singleton-number-map (function).
lil/pure/map-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/fold.
lil/interface/group.
lil/pure/map.
lil/interface/monad/transformercommon-lisp.
lil/core/all.
lil/interface/monad.
<transformer> (special variable).
<transformer> (class).
inner (generic reader).
(setf inner) (generic writer).
lift (generic function).
lil/pure/hash-tablecloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/eq.
lil/pure/alist.
lil/pure/encoded-key-map.
lil/pure/map.
lil/pure/tree.
<hash-table> (special variable).
<hash-table> (class).
bucketmap-interface (generic reader).
hashmap-interface (generic reader).
lil/interface/monad/identitycommon-lisp.
lil/core/all.
lil/interface/monad.
<identity> (special variable).
<identity> (class).
lil/transform/linearizealexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
lil/interface/box.
uiop/driver.
<linear> (class).
<linearized> (class).
define-linearized-interface (macro).
define-linearized-method (macro).
stateful-interface (generic reader).
lil/pure/alist-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/eq.
lil/interface/group.
lil/pure/alist.
lil/core/interfacecloser-common-lisp.
closer-mop.
lil/core/metaclass.
lil/core/utility.
lil/pure/emptycloser-common-lisp.
lil/core/all.
lil/interface/empty.
<empty!able> (class).
empty! (generic function).
lil/core/metaclassalexandria.
closer-common-lisp.
closer-mop.
fare-memoization.
fare-utils.
lil/core/utility.
uiop/driver.
<interface> (class).
all-interface-generics (function).
all-super-interfaces (generic function).
collect-all-super-interfaces (generic function).
collect-function-names (function).
define-interface (macro).
define-interface-generic (macro).
define-interface-generic> (macro).
define-interface-method (macro).
define-interface-methods (macro).
define-interface-specialized-functions (macro).
expand-interface-method> (function).
interface-abstract-p (generic reader).
interface-class (generic reader).
interface-class (class).
interface-class-p (function).
interface-direct-generics (function).
interface-generics (generic reader).
(setf interface-generics) (generic writer).
interface-gf-options (function).
register-interface-generic (function).
search-gf-options (function).
un<>ate (function).
with-interface (macro).
%all-super-interfaces (generic reader).
(setf %all-super-interfaces) (generic writer).
%define-interface-generic (macro).
direct-super-interfaces (generic function).
normalize-gf-io (function).
lil/stateful/iteratorcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/iterator.
lil/interface/monad/statecommon-lisp.
lil/core/all.
lil/interface/monad.
lil/stateful/iterator-implementationcloser-common-lisp.
lil/core/all.
lil/interface/box.
lil/stateful/iterator.
<devnull> (class).
lil/pure/encoded-key-map-implementationalexandria.
closer-common-lisp.
lil/core/all.
lil/interface/base.
lil/pure/encoded-key-map.
lil/core/alllil/core
alexandria.
closer-common-lisp.
fare-utils.
lil/core/interface.
lil/core/metaclass.
lil/core/utility.
uiop/driver.
lil/interface/base.
lil/interface/box.
lil/interface/collection.
lil/interface/empty.
lil/interface/eq.
lil/interface/fold.
lil/interface/group.
lil/interface/iterator.
lil/interface/map.
lil/interface/monad/continuation.
lil/interface/monad/identity.
lil/interface/monad/list.
lil/interface/monad/maybe.
lil/interface/monad/state.
lil/interface/monad/transformer.
lil/interface/monad/transformer/list.
lil/interface/monad/transformer/maybe.
lil/interface/order.
lil/interface/sequence.
lil/interface/set.
lil/interface/size.
lil/interface/tree.
lil/interface/tree-implementation.
lil/pure/alist.
lil/pure/alist-implementation.
lil/pure/collection.
lil/pure/empty.
lil/pure/encoded-key-map.
lil/pure/encoded-key-map-implementation.
lil/pure/fmim.
lil/pure/fmim-implementation.
lil/pure/hash-table.
lil/pure/hash-table-implementation.
lil/pure/iterator.
lil/pure/iterator-implementation.
lil/pure/lexicographic.
lil/pure/map.
lil/pure/map-implementation.
lil/pure/queue.
lil/pure/queue-implementation.
lil/pure/sequence.
lil/pure/set.
lil/pure/set-implementation.
lil/pure/tree.
lil/pure/tree-implementation.
lil/stateful/collection.
lil/stateful/empty.
lil/stateful/encoded-key-map.
lil/stateful/encoded-key-map-implementation.
lil/stateful/hash-table.
lil/stateful/hash-table-implementation.
lil/stateful/iterator.
lil/stateful/iterator-implementation.
lil/stateful/map.
lil/stateful/map-implementation.
lil/stateful/queue.
lil/stateful/queue-implementation.
lil/stateful/tree.
lil/stateful/tree-implementation.
lil/transform/classify.
lil/transform/linearize.
lil/transform/linearized-map.
lil/transform/mutating.
lil/transform/mutating-map.
lil/interface/foldcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/empty.
lil/interface/group.
lil/interface/iterator.
lil/interface/size.
uiop/driver.
<foldable-*-from> (class).
<foldable-fold-right-from-fold-left> (class).
<foldable-for-each-from-fold-left> (class).
<foldable-monoid-fold-from-fold-left> (class).
<foldable-size-from-fold-left> (class).
<foldable> (class).
fold-left (generic function).
fold-left* (generic function).
fold-right (generic function).
fold-right* (generic function).
monoid-fold (generic function).
monoid-fold* (generic function).
lil/stateful/queuecloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/stateful/collection.
lil/stateful/iterator.
<fifo-queue> (special variable).
<fifo-queue> (class).
<lifo-queue> (special variable).
<lifo-queue> (class).
<queue-enqueue-first> (class).
<queue-enqueue-last> (class).
<queue> (class).
<simple-queue> (class).
dequeue (generic function).
dequeue-all (generic function).
enqueue (generic function).
enqueue-first (generic function).
enqueue-last (generic function).
enqueue-many (generic function).
lil/pure/tree-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/order.
lil/pure/tree.
lil/pure/iterator-implementationcloser-common-lisp.
lil/core/all.
lil/pure/iterator.
lil/stateful/hash-table-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/stateful/hash-table.
lil/stateful/map-implementation.
normalize-eq-function (function).
same-eq-function-p (function).
lil/interface/groupalexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
uiop/driver.
<group> (class).
<magma> (class).
<monoid> (class).
<semigroup> (class).
<semiring> (class).
id (generic function).
inverse (generic function).
multiplicative-operation (generic function).
op (generic function).
op/list (generic function).
<identity> (class).
<zero-plus> (class).
plus (generic function).
zero (generic function).
lil/stateful/tree-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/order.
lil/stateful/tree.
copy-node (generic function).
lil/stateful/treecloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/order.
lil/interface/tree.
lil/stateful/map.
<avl-tree> (class).
<binary-tree> (class).
<heighted-binary-tree> (class).
<nm> (special variable).
<number-map> (special variable).
<number-map> (class).
<parametric-avl-tree> (class).
<post-self-balanced-binary-tree> (class).
<string-map> (special variable).
<tree> (class).
association-pair (class).
avl-tree-node (class).
balance-node (generic function).
binary-branch (class).
binary-tree-node (class).
heighted-binary-tree-node (class).
rotate-node-left (generic function).
rotate-node-right (generic function).
update-height (generic function).
lil/pure/queuecloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/pure/collection.
lil/pure/iterator.
<fifo-queue> (special variable).
<fifo-queue> (class).
<lifo-queue> (special variable).
<lifo-queue> (class).
<queue-enqueue-first> (class).
<queue-enqueue-last> (class).
<queue> (class).
<simple-queue> (class).
dequeue (generic function).
dequeue-all (generic function).
enqueue (generic function).
enqueue-first (generic function).
enqueue-last (generic function).
enqueue-many (generic function).
lil/pure/queue-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/pure/queue.
lil/pure/set-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/pure/set.
lil/interface/eqalexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
uiop/driver.
<eq-from-==> (class).
<eq-from-eq-function> (class).
<eq> (class).
<eql> (special variable).
<eql> (class).
<equal> (special variable).
<equal> (class).
<hashable> (class).
== (generic function).
eq-function (generic function).
hash (generic function).
lil/interface/monad/transformer/list<list-transformer> (special variable).
<list-transformer> (class).
lil/transform/linearized-mapcloser-common-lisp.
lil/core/all.
lil/interface/box.
lil/pure/map.
lil/transform/linearize.
<linearized-map> (class).
lil/interface/setalexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
lil/interface/collection.
lil/interface/fold.
lil/interface/map.
lil/interface/order.
uiop/driver.
<multiset-from-map> (class).
<multiset-from-set> (class).
<multiset> (class).
<set*-from-collection> (class).
<set*> (class).
<set-from-map> (class).
<set-from-multiset> (class).
<set> (class).
list-multiset (generic function).
list-set (generic function).
member-count (generic function).
member-p (generic function).
multiset-list (generic function).
set-list (generic function).
lil/interface/monadThis package is the <MONAD> interface.
It contains and exports:
<MONAD>
RESULT
BIND
FAIL
MLET*
common-lisp.
lil/interface/mapalexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
lil/interface/collection.
lil/interface/fold.
lil/interface/group.
uiop/driver.
<map-fold-right*-from-fold-left*> (class).
<map-foldable-from-*> (class).
<map-for-each*-from-fold-left*> (class).
<map-has-key-p-from-lookup> (class).
<map-monoid-fold*-from-fold-left*> (class).
<map> (class).
alist-map (generic function).
first-key-value (generic function).
left (slot).
left (generic reader).
(setf left) (generic writer).
left (slot).
left (slot).
leftmost (generic function).
leftmost-node (generic function).
locate (generic function).
lookup (generic function).
map-alist (generic function).
node (generic function).
node-balance (generic function).
node-class (generic function).
node-height (generic function).
(setf node-height) (generic writer).
node-key (generic reader).
(setf node-key) (generic writer).
node-key-value (generic function).
node-value (generic reader).
(setf node-value) (generic writer).
right (slot).
right (generic reader).
(setf right) (generic writer).
right (slot).
right (slot).
rightmost (generic function).
rightmost-node (generic function).
value-interface (slot).
value-interface (slot).
value-interface (generic function).
value-interface (slot).
value-interface (slot).
<map-fold-left*-from-fold-right*> (class).
lil/pure/fmim-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/box.
lil/pure/fmim.
lil/pure/tree.
make-trie-branch (function).
make-trie-head (function).
make-trie-leaf (function).
make-trie-skip (function).
trie-check-invariant (function).
trie-drop (function).
trie-fold-left (function).
trie-fold-right (function).
trie-insert (function).
trie-join (function).
trie-leftmost (function).
trie-lookup (function).
trie-rightmost (function).
lil/interface/monad/listcommon-lisp.
lil/core/all.
lil/interface/monad.
lil/interface/basecloser-common-lisp.
lil/core/all.
lil/interface/all.
lil/interface/box.
lil/interface/collection.
lil/interface/empty.
lil/interface/eq.
lil/interface/fold.
lil/interface/group.
lil/interface/iterator.
lil/interface/map.
lil/interface/order.
lil/interface/sequence.
lil/interface/set.
lil/interface/size.
lil/interface/tree.
lil/interface/tree-implementation.
lil/pure/alist.
lil/pure/alist-implementation.
lil/pure/all.
lil/pure/collection.
lil/pure/encoded-key-map.
lil/pure/encoded-key-map-implementation.
lil/pure/fmim.
lil/pure/fmim-implementation.
lil/pure/hash-table.
lil/pure/hash-table-implementation.
lil/pure/iterator.
lil/pure/lexicographic.
lil/pure/map.
lil/pure/map-implementation.
lil/pure/queue.
lil/pure/queue-implementation.
lil/pure/sequence.
lil/pure/set.
lil/pure/set-implementation.
lil/pure/tree.
lil/pure/tree-implementation.
lil/stateful/all.
lil/stateful/collection.
lil/stateful/encoded-key-map.
lil/stateful/encoded-key-map-implementation.
lil/stateful/hash-table.
lil/stateful/hash-table-implementation.
lil/stateful/iterator.
lil/stateful/map.
lil/stateful/map-implementation.
lil/stateful/queue.
lil/stateful/queue-implementation.
lil/stateful/tree.
lil/stateful/tree-implementation.
lil/transform/classify.
lil/transform/linearize.
lil/transform/mutating.
<any> (special variable).
<any> (class).
<classy> (class).
<copy-is-identity> (class).
<copyable> (class).
<has-base-interface> (class).
<makeable> (class).
<type> (class).
base-interface (slot).
base-interface (slot).
base-interface (slot).
base-interface (generic reader).
base-interface (slot).
base-interface (slot).
base-interface (slot).
base-interface (slot).
base-interface (slot).
check-invariant (generic function).
contents (generic function).
convert (generic function).
copy (generic function).
create (generic function).
make (generic function).
lil/pure/treecloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/order.
lil/interface/tree.
lil/pure/map.
<avl-tree> (class).
<binary-tree> (class).
<nm> (special variable).
<number-map> (special variable).
<number-map> (class).
<parametric-avl-tree> (class).
<string-map> (special variable).
<tree> (class).
association-pair (class).
avl-tree-node (class).
binary-tree-node (class).
lil/interface/sizecloser-common-lisp.
lil/core/all.
lil/interface/base.
uiop/driver.
<sizable-size<=n-p-from-size> (class).
<sizable> (class).
size (generic function).
size<=n-p (generic function).
lil/stateful/map-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/fold.
lil/interface/group.
lil/stateful/map.
lil/transform/mutating-mapcloser-common-lisp.
lil/core/all.
lil/interface/box.
lil/stateful/map.
lil/transform/mutating.
<alist> (special variable).
<mutating-map> (class).
lil/pure/hash-table-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/pure/hash-table.
lil/transform/poshPure Object-Oriented Structure Hierarchy, classy APIs for pure LIL data structure
posh
alexandria.
closer-common-lisp.
fare-utils.
lil/interface/box.
lil/transform/classify.
uiop/driver.
>fifo-queue< (class).
>hash-table< (class).
>map< (class).
>number-map< (class).
>queue< (class).
create-number-map (function).
decons (generic function).
dequeue (generic function).
dequeue-all (generic function).
divide (generic function).
drop (generic function).
empty! (generic function).
empty-number-map (function).
enqueue (generic function).
enqueue-first (generic function).
enqueue-last (generic function).
enqueue-many (generic function).
first-key-value (generic function).
fold-left (generic function).
fold-left* (generic function).
fold-right (generic function).
fold-right* (generic function).
for-each (generic function).
for-each* (generic function).
insert (generic function).
join (generic function).
lookup (generic function).
map/2 (generic function).
object-box (class).
update-key (generic function).
alist-map (generic function).
alist-map-hash-table (function).
alist-map-number-map (function).
conj (generic function).
convert-hash-table (function).
convert-number-map (function).
convert-queue (function).
create-hash-table (function).
create-queue (function).
deconj (generic function).
disj (generic function).
empty-hash-table (function).
empty-queue (function).
map-alist (generic function).
monoid-fold (generic function).
monoid-fold* (generic function).
restriction (generic function).
singleton-hash-table (function).
singleton-number-map (function).
singleton-queue (function).
lil/core/utilityalexandria.
closer-common-lisp.
closer-mop.
fare-utils.
uiop/driver.
boolean-integer (function).
decompose-function-name (function).
find-multiple-clos-options (function).
find-unique-clos-option (function).
find-unique-clos-option/0 (function).
find-unique-clos-option/1 (function).
find-unique-clos-option/1* (function).
keep-keyed-clos-options (function).
lambda-list-mimicker (function).
make-local-name (function).
memberp (function).
number-of-required-arguments (function).
remove-keyed-clos-options (function).
with-unique-collector (macro).
call-with-unique-collector (function).
lil/pure/encoded-key-mapcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/pure/map.
<encoded-key-map> (function).
<encoded-key-map> (class).
<parametric-encoded-key-map> (class).
lil/interface/emptycloser-common-lisp.
lil/core/all.
lil/interface/base.
<empty-is-empty-object> (class).
<empty-is-nil> (class).
<emptyable> (class).
empty (generic function).
empty-object (class).
empty-object-p (function).
empty-p (generic function).
make-empty-object (function).
lil/pure/lexicographicalexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
lil/interface/eq.
lil/interface/order.
lil/pure/sequence.
uiop/driver.
<lexicographic> (class).
element-interface (generic reader).
lil/stateful/encoded-key-map-implementationalexandria.
closer-common-lisp.
lil/core/all.
lil/interface/base.
lil/stateful/encoded-key-map.
lil/pure/allpure
alexandria.
closer-common-lisp.
fare-utils.
lil/interface/base.
lil/interface/eq.
lil/interface/group.
lil/interface/order.
lil/pure/alist.
lil/pure/alist-implementation.
lil/pure/collection.
lil/pure/empty.
lil/pure/encoded-key-map.
lil/pure/encoded-key-map-implementation.
lil/pure/fmim.
lil/pure/fmim-implementation.
lil/pure/hash-table.
lil/pure/hash-table-implementation.
lil/pure/iterator.
lil/pure/iterator-implementation.
lil/pure/lexicographic.
lil/pure/map.
lil/pure/map-implementation.
lil/pure/queue.
lil/pure/queue-implementation.
lil/pure/sequence.
lil/pure/set.
lil/pure/set-implementation.
lil/pure/tree.
lil/pure/tree-implementation.
uiop/driver.
lil/interface/tree-implementationalexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
lil/interface/empty.
lil/interface/fold.
lil/interface/iterator.
lil/interface/map.
lil/interface/order.
lil/interface/tree.
uiop/driver.
binary-tree-sexp (function).
lil/interface/allinterface
alexandria.
closer-common-lisp.
fare-utils.
lil/interface/base.
lil/interface/box.
lil/interface/collection.
lil/interface/empty.
lil/interface/eq.
lil/interface/fold.
lil/interface/group.
lil/interface/iterator.
lil/interface/map.
lil/interface/monad.
lil/interface/monad/continuation.
lil/interface/monad/identity.
lil/interface/monad/list.
lil/interface/monad/maybe.
lil/interface/monad/state.
lil/interface/monad/transformer/list.
lil/interface/monad/transformer/maybe.
lil/interface/order.
lil/interface/run.
lil/interface/sequence.
lil/interface/set.
lil/interface/size.
lil/interface/tree.
lil/interface/tree-implementation.
uiop/driver.
lil/transform/classifyalexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
lil/interface/box.
uiop/driver.
class-interface (generic reader).
define-classified-interface-class (macro).
define-classified-method (macro).
lil/stateful/hash-tablecloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/eq.
lil/stateful/encoded-key-map.
lil/stateful/map.
lil/stateful/tree.
<hash-table> (special variable).
<hash-table> (class).
lil/pure/setcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/set.
lil/pure/collection.
lil/pure/map.
<multiset-from-map> (class).
<multiset-from-set> (class).
<multiset> (class).
<set*-from-collection> (class).
<set*> (class).
<set-from-map> (class).
<set-from-multiset> (class).
<set> (class).
decrease-member-count (generic function).
increase-member-count (generic function).
proper-subset-p (generic function).
set-disjunction (generic function).
set-intersection (generic function).
set-intersection/list (generic function).
set-union (generic function).
set-union/list (generic function).
subset-p (generic function).
lil/interface/sequencecloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/collection.
lil/interface/empty.
lil/interface/fold.
lil/interface/iterator.
lil/interface/size.
<sequence> (class).
lil/interface/monad/continuationcommon-lisp.
lil/core/all.
lil/interface/monad.
<continuation> (special variable).
<continuation> (class).
call/cc (generic function).
lil/stateful/allstateful
alexandria.
closer-common-lisp.
fare-utils.
lil/interface/base.
lil/interface/eq.
lil/interface/group.
lil/interface/order.
lil/stateful/collection.
lil/stateful/empty.
lil/stateful/encoded-key-map.
lil/stateful/encoded-key-map-implementation.
lil/stateful/hash-table.
lil/stateful/hash-table-implementation.
lil/stateful/iterator.
lil/stateful/iterator-implementation.
lil/stateful/map.
lil/stateful/map-implementation.
lil/stateful/queue.
lil/stateful/queue-implementation.
lil/stateful/tree.
lil/stateful/tree-implementation.
uiop/driver.
lil/interface/monad/maybecommon-lisp.
lil/core/all.
lil/interface/empty.
lil/interface/monad.
<maybe-empty> (special variable).
<maybe-empty> (class).
<maybe> (special variable).
<maybe> (class).
maybe-or (generic function).
maybe.empty-interface (generic reader).
(setf maybe.empty-interface) (generic writer).
lil/transform/mutatingalexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
lil/interface/box.
uiop/driver.
<mutating> (class).
define-mutating-interface (macro).
define-mutating-method (macro).
pure-interface (generic reader).
lil/interface/collectioncloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/empty.
lil/interface/fold.
lil/interface/iterator.
lil/interface/size.
<collection-has-key-p-from-get-entry> (class).
<encoded-key-collection> (class).
<finite-collection> (class).
<parametric-encoded-key-collection> (class).
decode-key (generic function).
encode-key (generic function).
entry-values (generic function).
first-entry (generic function).
get-entry (generic function).
has-key-p (generic function).
key-decoder (generic reader).
key-encoder (generic reader).
key-interface (slot).
key-interface (slot).
key-interface (slot).
key-interface (slot).
key-interface (generic function).
key-interface (slot).
key-interface (slot).
singleton (generic function).
singleton-p (generic function).
lil/stateful/mapcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/fold.
lil/interface/map.
lil/stateful/collection.
lil/stateful/iterator.
<map-copy-from-join-empty> (class).
<map-decons-from-first-key-value-drop> (class).
<map-divide-from-for-each*> (class).
<map-divide/list-from-divide> (class).
<map-empty-is-empty-object> (class).
<map-first-key-value-from-for-each*> (class).
<map-fold-left*-from-for-each*> (class).
<map-join-from-for-each*-lookup-insert> (class).
<map-join/list-from-join> (class).
<map-map/2-from-for-each*-lookup-insert-drop> (class).
<map-update-key-from-lookup-insert-drop> (class).
<map> (class).
decons (generic function).
drop (generic function).
insert (generic function).
map/2 (generic function).
update-key (generic function).
lil/stateful/collectioncloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/collection.
lil/stateful/empty.
<finite-collection> (class).
conj (generic function).
deconj (generic function).
disj (generic function).
divide (generic function).
divide/list (generic function).
join (generic function).
join/list (generic function).
restriction (generic function).
lil/interface/iteratoralexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
uiop/driver.
<decreasing-number-iterator> (class).
<for-each> (special variable).
<for-each> (class).
<increasing-number-iterator> (class).
<number-iterator> (class).
for-each (generic function).
for-each* (generic function).
iterator-end (generic reader).
iterator-increment (generic reader).
iterator-start (generic reader).
make-number-iterator (function).
lil/pure/collectioncloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/collection.
lil/pure/empty.
<finite-collection> (class).
conj (generic function).
deconj (generic function).
disj (generic function).
divide (generic function).
divide/list (generic function).
join (generic function).
join/list (generic function).
restriction (generic function).
lil/stateful/queue-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/stateful/queue.
lil/interface/monad/transformer/maybecommon-lisp.
lil/core/all.
lil/interface/monad.
<maybe-transformer> (special variable).
<maybe-transformer> (class).
lil/interface/boxalexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
lil/interface/empty.
uiop/driver.
<box!> (class).
<box> (class).
<emptyable-box> (class).
<mutable-box> (class).
<one-use-box> (class).
<one-use-thunk-box> (class).
<one-use-value-box> (special variable).
<one-use-value-box> (class).
<promise-box> (class).
<thunk-box> (class).
<value-box> (special variable).
<value-box> (class).
box (class).
box! (function).
box! (class).
box-ref (generic function).
(setf box-ref) (generic function).
box-set! (generic function).
box-value (generic reader).
(setf box-value) (generic writer).
delay (macro).
emptyable-box (class).
force (function).
immutable-box (class).
make-box (generic function).
make-one-use-function (function).
mutable-box (class).
one-use-box (class).
one-use-lambda (macro).
one-use-thunk-box (class).
one-use-value-box (function).
one-use-value-box (class).
promise-box (class).
set-box! (generic function).
set-box-value (generic writer).
simple-thunk-box (class).
simple-value-box (class).
thunk-box (class).
unbox (generic function).
value-box (class).
box-thunk (generic reader).
box-usedp (generic reader).
(setf box-usedp) (generic writer).
lil/pure/alistcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/eq.
lil/interface/group.
lil/pure/map.
lil/interface/treealexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
lil/interface/fold.
lil/interface/map.
lil/interface/order.
uiop/driver.
<avl-tree> (class).
<binary-tree> (class).
<heighted-binary-tree> (class).
<number-map> (class).
<tree> (class).
association-pair (class).
avl-tree-node (class).
binary-branch (class).
binary-tree-node (class).
height (slot).
height (slot).
heighted-binary-tree-node (class).
key (slot).
value (slot).
lil/stateful/emptycloser-common-lisp.
lil/core/all.
lil/interface/empty.
<empty!able> (class).
empty! (generic function).
lil/stateful/encoded-key-mapcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/stateful/map.
<encoded-key-map> (function).
<encoded-key-map> (class).
<parametric-encoded-key-map> (class).
lil/pure/mapcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/fold.
lil/interface/map.
lil/pure/collection.
lil/pure/iterator.
<map-decons-from-first-key-value-drop> (class).
<map-divide/list-from-divide> (class).
<map-empty-is-nil> (class).
<map-join-from-fold-left*-insert> (class).
<map-join/list-from-join> (class).
<map-map/2-from-fold-left*-lookup-insert-drop> (class).
<map-monoid-fold*-from-divide/list> (class).
<map-monoid-fold*-from-divide> (class).
<map-singleton-from-insert> (class).
<map-singleton-p-from-decons> (class).
<map-size<=n-p-from-decons> (class).
<map-update-key-from-lookup-insert-drop> (class).
<map> (class).
decons (generic function).
drop (generic function).
insert (generic function).
map/2 (generic function).
update-key (generic function).
lil/pure/fmimcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/box.
lil/interface/order.
lil/pure/alist.
lil/pure/map.
lil/pure/tree.
<fmim> (special variable).
<fmim> (class).
full-trie-branch (class).
node-prefix-bits (generic reader).
node-prefix-length (generic reader).
trie-branch (class).
trie-head (class).
trie-node (class).
trie-skip (class).
lil/interface/orderalexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
lil/interface/eq.
lil/interface/group.
uiop/driver.
<boolean> (special variable).
<boolean> (class).
<case-insensitive-string> (special variable).
<case-insensitive-string> (class).
<char> (special variable).
<char> (class).
<compare> (class).
<integer> (special variable).
<integer> (class).
<lessp> (class).
<number> (special variable).
<number> (class).
<order-from-compare> (class).
<order-from-lessp> (class).
<order-parameter> (class).
<order> (class).
<string> (special variable).
<string> (class).
compare (generic function).
order-interface (generic reader).
order< (generic function).
order<= (generic function).
order> (generic function).
order>= (generic function).
call-compare (function).
call< (function).
call<= (function).
call= (function).
call> (function).
call>= (function).
compare-function (generic reader).
lessp-function (generic reader).
sorted-list-differences (function).
lil/pure/iteratorcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/iterator.
Definitions are sorted by export status, category, package, and then by lexicographic order.
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)))
Like UIOP:WHILE-COLLECTING, but doesn’t collect duplicates.
Make a number iterator in the style of LOOP
<order-parameter>) x y) ¶<case-insensitive-string>) x y) ¶<order-from-compare>) x y) ¶<order-from-lessp>) x y) ¶<eq-from-eq-function>) x y) ¶Convert an alist to a map of given interface
<mutating-map>) alist) ¶<linearized-map>) alist) ¶symbol)) ¶interface-class)) ¶cons)) ¶balance a node in a tree
<avl-tree>) (node avl-tree-node)) ¶<avl-tree>) (node empty-object)) ¶from a functor, extract the base interface parameter
<multiset-from-set>)) ¶automatically generated reader method
<multiset-from-map>)) ¶automatically generated reader method
<set*-from-collection>)) ¶automatically generated reader method
<parametric-encoded-key-collection>)) ¶automatically generated reader method
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))))
<maybe-transformer>) mv mf) ¶<list-transformer>) mv mf) ¶<transformer>) mv mf) ¶<identity>) mv mf) ¶FUNCALLs the MF with the MV
<continuation>) mv mf) ¶open a box and return its contents
one-use-thunk-box)) ¶one-use-value-box)) ¶one-use-box)) ¶one-use-box)) ¶simple-thunk-box)) ¶simple-value-box)) ¶set the contents of a BOX (if applicable). Return VALUE.
immutable-box) value) ¶<hash-table>)) ¶automatically generated reader method
<continuation>) fn) ¶>fifo-queue<) &rest keys431 &key &allow-other-keys) ¶>number-map<) &rest keys246 &key &allow-other-keys) ¶>hash-table<) &rest keys38 &key &allow-other-keys) ¶>fifo-queue<) &rest keys293 &key &allow-other-keys) ¶>number-map<) &rest keys248 &key &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.
<mutating-map>) object &rest keys1188 &key &allow-other-keys) ¶<linearized-map>) object &rest keys934 &key &allow-other-keys) ¶<simple-queue>) q &key) ¶<encoded-key-map>) m &key) ¶<hash-table>) map &key) ¶<simple-queue>) q &key) ¶<encoded-key-map>) m &key) ¶<hash-table>) map &key) ¶<avl-tree>) (node avl-tree-node) &key) ¶<binary-tree>) (node binary-branch) &key lower lowerp upper upperp) ¶<empty-is-nil>) (m null) &key &allow-other-keys) ¶<empty-is-empty-object>) (m empty-object) &key &allow-other-keys) ¶object-box)) ¶automatically generated reader method
object-box)) ¶automatically generated reader method
Given a <SINK> interface, a COLLECTOR state some VALUES, return no values.
Given a <SINK> interface, a COLLECTOR state some VALUES, return a new COLLECTOR state to which the values were added
symbol) collector) ¶interface-class) collector) ¶cons) collector) ¶Given a <SINK> interface and a SINK object, return
an initial COLLECTOR state with which to start collecting.
Given a <SINK> interface and a SINK object, return
an initial COLLECTOR state with which to start collecting.
<lexicographic>) x y) ¶<order-parameter>) x y) ¶<order-from-lessp>) x y) ¶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.
<mutating-map>) 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.
<linearized-map>) collection entry) ¶>fifo-queue<) &rest keys513 &key &allow-other-keys) ¶>number-map<) &rest keys328 &key &allow-other-keys) ¶>hash-table<) &rest keys120 &key &allow-other-keys) ¶>fifo-queue<) &rest keys375 &key &allow-other-keys) ¶>number-map<) &rest keys330 &key &allow-other-keys) ¶Given an object, return contents sufficient to re-CREATE a similar object.
<mutating-map>) object &rest keys1276 &key &allow-other-keys) ¶<linearized-map>) object &rest keys1062 &key &allow-other-keys) ¶<simple-queue>) q &key) ¶<simple-queue>) q &key) ¶Convert an OBJECT following interface <ORIGIN>
into a new object following interface <DESTINATION>.
<mutating-map>) <origin> object) ¶<linearized-map>) <origin> object) ¶>fifo-queue<)) ¶>number-map<)) ¶>hash-table<)) ¶>fifo-queue<)) ¶>number-map<)) ¶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.
<mutating-map>) object) ¶<linearized-map>) object) ¶<map-copy-from-join-empty>) map) ¶<copy-is-identity>) x) ¶create an object conforming to the interface
based on CONTENTS and provided keyword options, returning the object.
<mutating-map>) contents &rest keys1232 &key &allow-other-keys) ¶<linearized-map>) contents &rest keys1018 &key &allow-other-keys) ¶<simple-queue>) contents &key) ¶<simple-queue>) entries &key) ¶decode user-visible key from internal key
<parametric-encoded-key-collection>) k) ¶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.
<mutating-map>) 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.
<linearized-map>) collection) ¶>number-map<)) ¶>number-map<)) ¶>hash-table<)) ¶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.
<mutating-map>) map) ¶<encoded-key-map>) map) ¶<map-decons-from-first-key-value-drop>) 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.
<linearized-map>) map) ¶<encoded-key-map>) map) ¶<hash-table>) map) ¶<map-decons-from-first-key-value-drop>) map) ¶<multiset>) collection key &optional count) ¶>fifo-queue<)) ¶Dequeue a datum from a queue
<simple-queue>) q) ¶Dequeue a datum from a queue
<simple-queue>) q) ¶>fifo-queue<)) ¶>fifo-queue<)) ¶Empty the queue, return the former contents
<simple-queue>) q) ¶Empty the queue, return the former contents
>fifo-queue<)) ¶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.
<mutating-map>) 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.
<linearized-map>) collection key) ¶>number-map<)) ¶>fifo-queue<)) ¶>number-map<)) ¶>hash-table<)) ¶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.
<mutating-map>) collection) ¶<encoded-key-map>) map) ¶<binary-tree>) node) ¶<map-divide-from-for-each*>) map) ¶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.
<linearized-map>) collection) ¶<encoded-key-map>) map) ¶<hash-table>) map) ¶<binary-tree>) node) ¶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.
<mutating-map>) map) ¶<encoded-key-map>) map) ¶<binary-tree>) node) ¶<map-divide/list-from-divide>) map) ¶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.
<linearized-map>) map) ¶<encoded-key-map>) map) ¶<hash-table>) map) ¶<binary-tree>) node) ¶<map-divide/list-from-divide>) map) ¶>number-map<) key) ¶>number-map<) key) ¶>hash-table<) 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.
<mutating-map>) map key) ¶<encoded-key-map>) map key) ¶<hash-table>) map key) ¶<post-self-balanced-binary-tree>) node key) ¶<binary-tree>) node 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.
<linearized-map>) map key) ¶<encoded-key-map>) map key) ¶<hash-table>) map key) ¶<binary-tree>) node key) ¶Return an empty object of the emptyable type. A constant one is pure, a new one if stateful.
<mutating-map>)) ¶<linearized-map>)) ¶<simple-queue>)) ¶<encoded-key-map>)) ¶<hash-table>)) ¶<encoded-key-map>)) ¶<hash-table>)) ¶<set*-from-collection>)) ¶<set*-from-collection>)) ¶<empty-is-nil>)) ¶<empty-is-empty-object>)) ¶>fifo-queue<)) ¶>number-map<)) ¶This function is pretty useless to call, but allows for automatic generation of mutating interface wrappers.
<linearized-map>) ignored) ¶<set*-from-collection>) x) ¶<empty!able>) ignored) ¶>fifo-queue<)) ¶>number-map<)) ¶>hash-table<)) ¶Clear the collection and make it empty. Return no value.
<mutating-map>) x) ¶<simple-queue>) q) ¶<encoded-key-map>) map) ¶<map-empty-is-empty-object>) map) ¶>fifo-queue<)) ¶