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 Tue Apr 15 05:50:31 2025 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/interface/emptylil/pure/map-implementationlil/core/utilitylil/pure/iterator-implementationlil/transform/linearizelil/pure/encoded-key-map-implementationlil/pure/hash-table-implementationlil/interface/baselil/stateful/map-implementationlil/interface/sequencelil/interface/sizelil/transform/classifylil/stateful/hash-table-implementationlil/stateful/maplil/stateful/collectionlil/pure/alllil/pure/emptylil/pure/treelil/transform/classylil/transform/poshlil/interface/monad/continuationlil/stateful/encoded-key-map-implementationlil/pure/set-implementationlil/interface/iteratorlil/stateful/queuelil/pure/tree-implementationlil/interface/monad/transformer/listlil/core/interfacelil/stateful/queue-implementationlil/interface/eqlil/interface/foldlil/pure/iteratorlil/stateful/iteratorlil/interface/monad/maybelil/transform/linearized-maplil/pure/setlil/pure/hash-tablelil/interface/alllil/transform/mutatinglil/transform/mutating-maplil/interface/grouplil/interface/treelil/interface/boxlil/pure/lexicographiclil/pure/fmimlil/pure/queue-implementationlil/pure/alist-implementationlil/interface/tree-implementationlil/core/alllil/interface/setlil/interface/orderlil/interface/maplil/stateful/tree-implementationlil/stateful/encoded-key-maplil/stateful/iterator-implementationlil/interface/monad/transformer/maybelil/interface/monad/transformerlil/pure/encoded-key-maplil/interface/monad/identitylil/interface/monadlil/stateful/hash-tablelil/pure/alistlil/pure/collectionlil/interface/monad/listlil/pure/queuelil/pure/fmim-implementationlil/pure/sequencelil/pure/maplil/transform/alllil/stateful/treelil/interface/runlil/stateful/emptylil/interface/monad/statelil/core/metaclasslil/interface/collectionlil/stateful/allThe 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).
lil/interface/map (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/interface/order (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).
value-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).
has-key-p (method).
insert (method).
join (method).
leftmost (method).
lookup (method).
print-object (method).
print-object (method).
print-object (method).
rightmost (method).
singleton-p (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/interface/emptylil/pure/map-implementationlil/core/utilitylil/pure/iterator-implementationlil/transform/linearizelil/pure/encoded-key-map-implementationlil/pure/hash-table-implementationlil/interface/baselil/stateful/map-implementationlil/interface/sequencelil/interface/sizelil/transform/classifylil/stateful/hash-table-implementationlil/stateful/maplil/stateful/collectionlil/pure/alllil/pure/emptylil/pure/treelil/transform/classylil/transform/poshlil/interface/monad/continuationlil/stateful/encoded-key-map-implementationlil/pure/set-implementationlil/interface/iteratorlil/stateful/queuelil/pure/tree-implementationlil/interface/monad/transformer/listlil/core/interfacelil/stateful/queue-implementationlil/interface/eqlil/interface/foldlil/pure/iteratorlil/stateful/iteratorlil/interface/monad/maybelil/transform/linearized-maplil/pure/setlil/pure/hash-tablelil/interface/alllil/transform/mutatinglil/transform/mutating-maplil/interface/grouplil/interface/treelil/interface/boxlil/pure/lexicographiclil/pure/fmimlil/pure/queue-implementationlil/pure/alist-implementationlil/interface/tree-implementationlil/core/alllil/interface/setlil/interface/orderlil/interface/maplil/stateful/tree-implementationlil/stateful/encoded-key-maplil/stateful/iterator-implementationlil/interface/monad/transformer/maybelil/interface/monad/transformerlil/pure/encoded-key-maplil/interface/monad/identitylil/interface/monadlil/stateful/hash-tablelil/pure/alistlil/pure/collectionlil/interface/monad/listlil/pure/queuelil/pure/fmim-implementationlil/pure/sequencelil/pure/maplil/transform/alllil/stateful/treelil/interface/runlil/stateful/emptylil/interface/monad/statelil/core/metaclasslil/interface/collectionlil/stateful/alllil/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/map-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/fold.
lil/interface/group.
lil/interface/order.
lil/pure/map.
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/iterator-implementationcloser-common-lisp.
lil/core/all.
lil/pure/iterator.
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/encoded-key-map-implementationalexandria.
closer-common-lisp.
lil/core/all.
lil/interface/base.
lil/pure/encoded-key-map.
lil/pure/hash-table-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/pure/hash-table.
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 (generic reader).
base-interface (slot).
base-interface (slot).
base-interface (slot).
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/stateful/map-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/fold.
lil/interface/group.
lil/stateful/map.
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/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/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-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/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/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/pure/emptycloser-common-lisp.
lil/core/all.
lil/interface/empty.
<empty!able> (class).
empty! (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/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/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/interface/monad/continuationcommon-lisp.
lil/core/all.
lil/interface/monad.
<continuation> (special variable).
<continuation> (class).
call/cc (generic function).
lil/stateful/encoded-key-map-implementationalexandria.
closer-common-lisp.
lil/core/all.
lil/interface/base.
lil/stateful/encoded-key-map.
lil/pure/set-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/pure/set.
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/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/interface/monad/transformer/list<list-transformer> (special variable).
<list-transformer> (class).
lil/core/interfacecloser-common-lisp.
closer-mop.
lil/core/metaclass.
lil/core/utility.
lil/stateful/queue-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/stateful/queue.
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/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/pure/iteratorcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/iterator.
lil/stateful/iteratorcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/iterator.
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/linearized-mapcloser-common-lisp.
lil/core/all.
lil/interface/box.
lil/pure/map.
lil/transform/linearize.
<linearized-map> (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/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/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/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/transform/mutating-mapcloser-common-lisp.
lil/core/all.
lil/interface/box.
lil/stateful/map.
lil/transform/mutating.
<alist> (special variable).
<mutating-map> (class).
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/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/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/lexicographicalexandria.
closer-common-lisp.
fare-utils.
lil/core/all.
lil/interface/base.
lil/interface/eq.
lil/interface/map.
lil/interface/order.
lil/pure/sequence.
uiop/driver.
<lexicographic> (class).
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/pure/queue-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/pure/queue.
lil/pure/alist-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/eq.
lil/interface/group.
lil/pure/alist.
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/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/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/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/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 (slot).
left (generic reader).
(setf left) (generic writer).
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 (slot).
right (generic reader).
(setf right) (generic writer).
right (slot).
rightmost (generic function).
rightmost-node (generic function).
value-interface (slot).
value-interface (slot).
value-interface (slot).
value-interface (generic function).
value-interface (slot).
value-interface (slot).
<map-fold-left*-from-fold-right*> (class).
lil/stateful/tree-implementationcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/order.
lil/stateful/tree.
copy-node (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/stateful/iterator-implementationcloser-common-lisp.
lil/core/all.
lil/interface/box.
lil/stateful/iterator.
<devnull> (class).
lil/interface/monad/transformer/maybecommon-lisp.
lil/core/all.
lil/interface/monad.
<maybe-transformer> (special variable).
<maybe-transformer> (class).
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/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/monad/identitycommon-lisp.
lil/core/all.
lil/interface/monad.
<identity> (special variable).
<identity> (class).
lil/interface/monadThis package is the <MONAD> interface.
It contains and exports:
<MONAD>
RESULT
BIND
FAIL
MLET*
common-lisp.
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/alistcloser-common-lisp.
lil/core/all.
lil/interface/base.
lil/interface/eq.
lil/interface/group.
lil/pure/map.
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/interface/monad/listcommon-lisp.
lil/core/all.
lil/interface/monad.
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/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/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/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/stateful/emptycloser-common-lisp.
lil/core/all.
lil/interface/empty.
<empty!able> (class).
empty! (generic function).
lil/interface/monad/statecommon-lisp.
lil/core/all.
lil/interface/monad.
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/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 (slot).
key-interface (slot).
key-interface (generic function).
singleton (generic function).
singleton-p (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.
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) ¶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 keys1198 &key &allow-other-keys) ¶<linearized-map>) object &rest keys920 &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) ¶>fifo-queue<) &rest keys438 &key &allow-other-keys) ¶>number-map<) &rest keys248 &key &allow-other-keys) ¶>hash-table<) &rest keys40 &key &allow-other-keys) ¶>fifo-queue<) &rest keys300 &key &allow-other-keys) ¶>number-map<) &rest keys251 &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 a new COLLECTOR state to which the values were added
Given a <SINK> interface, a COLLECTOR state some VALUES, return no values.
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) ¶Given an object, return contents sufficient to re-CREATE a similar object.
<mutating-map>) object &rest keys1274 &key &allow-other-keys) ¶<linearized-map>) object &rest keys1056 &key &allow-other-keys) ¶<simple-queue>) q &key) ¶<simple-queue>) q &key) ¶>fifo-queue<) &rest keys509 &key &allow-other-keys) ¶>number-map<) &rest keys319 &key &allow-other-keys) ¶>hash-table<) &rest keys111 &key &allow-other-keys) ¶>fifo-queue<) &rest keys371 &key &allow-other-keys) ¶>number-map<) &rest keys322 &key &allow-other-keys) ¶Convert an OBJECT following interface <ORIGIN>
into a new object following interface <DESTINATION>.
<mutating-map>) <origin> object) ¶<linearized-map>) <origin> object) ¶Copy an OBJECT, returning a fresh object with
equivalent contains.
Beware: how deep the copy goes depends on the interface;
copying a data structure may lead to identical objects rather than copies
being left at leaves; or it may not.
If you work in a stateful style, then this matters a lot
because your side-effects may or may not be seen by more or fewer copies
than you think. Please consult the documentation of appropriate methods.
<mutating-map>) object) ¶<linearized-map>) object) ¶<map-copy-from-join-empty>) map) ¶<copy-is-identity>) x) ¶>fifo-queue<)) ¶>number-map<)) ¶>hash-table<)) ¶>fifo-queue<)) ¶>number-map<)) ¶create an object conforming to the interface
based on CONTENTS and provided keyword options, returning the object.
<mutating-map>) contents &rest keys1236 &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) ¶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) ¶>number-map<)) ¶>number-map<)) ¶>hash-table<)) ¶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<)) ¶>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
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) ¶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) ¶>number-map<)) ¶>fifo-queue<)) ¶>number-map<)) ¶>hash-table<)) ¶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) ¶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) ¶>number-map<) key) ¶>number-map<) key) ¶>hash-table<) 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>)) ¶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<)) ¶>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) ¶Return a boolean indicating whether the object is empty
<mutating-map>) object) ¶<linearized-map>) object) ¶<simple-queue>) q) ¶<encoded-key-map>) map) ¶<hash-table>) map) ¶<encoded-key-map>) map) ¶<hash-table>) map) ¶<set*-from-collection>) x) ¶<set*-from-collection>) x) ¶<empty-is-nil>) object) ¶<empty-is-empty-object>) object) ¶>fifo-queue<)) ¶>number-map<)) ¶>hash-table<)) ¶vector)) ¶list)) ¶>fifo-queue<)) ¶>number-map<)) ¶hash-table)) ¶encode user-visible key into internal key
<parametric-encoded-key-collection>) k) ¶>fifo-queue<) datum) ¶>fifo-queue<) datum) ¶Enqueue a datum into a queue, whether it’s first or last makes the queue LIFO or FIFO
<queue-enqueue-first>) q x) ¶<queue-enqueue-last>) q x) ¶Enqueue a datum into a queue, whether it’s first or last makes the queue LIFO or FIFO
<queue-enqueue-first>) q x) ¶<queue-enqueue-last>) q x) ¶>fifo-queue<) datum) ¶>fifo-queue<) datum) ¶Enqueue a datum where it will be dequeued first
<simple-queue>) q x) ¶Enqueue a datum where it will be dequeued first
<simple-queue>) q x) ¶>fifo-queue<) datum) ¶>fifo-queue<) datum) ¶Enqueue a datum where it will be dequeued last
<simple-queue>) q x) ¶Enqueue a datum where it will be dequeued last
<simple-queue>) q x) ¶>fifo-queue<) list) ¶>fifo-queue<) list) ¶Enqueue a list of data in order they should be dequeued
<simple-queue>) q list) ¶Enqueue a list of data in order they should be dequeued
<simple-queue>) q list) ¶Take one entry value, return as many values as makes sense for the entry.
test function for <eq> interface
<case-insensitive-string>)) ¶<eq-from-eq-function>)) ¶automatically generated reader method
<eq-from-==>)) ¶<transformer>)) ¶>fifo-queue<)) ¶>number-map<)) ¶>hash-table<)) ¶>fifo-queue<)) ¶>number-map<)) ¶Return two values:
1- a single value for an entry
2- a boolean a boolean indicating whether the collection was already empty.
What ’first’ means here may depend on the particular collection interface,
but generally means the element most easily accessible;
it is also the first (leftmost) key and value as used by fold-left and fold-right.
<mutating-map>) collection) ¶<linearized-map>) collection) ¶<simple-queue>) q) ¶<simple-queue>) q) ¶>number-map<)) ¶>number-map<)) ¶>hash-table<)) ¶Return three values:
1- a key,
2- a value, and
3- a boolean a boolean indicating whether the map was already empty.
What first means here may depend on the particular map interface,
but generally means the element most easily accessible;
it is also the first (leftmost) key and value as used by fold-left and fold-right.
<mutating-map>) map) ¶<linearized-map>) map) ¶<encoded-key-map>) map) ¶<map-first-key-value-from-for-each*>) map) ¶<encoded-key-map>) map) ¶<hash-table>) map) ¶<binary-tree>) map) ¶Return key and value with the least key
Given <FOUNT> and <SINK> interfaces and FOUNT and SINK objects, let data flow from the FOUNT to the SINK, and return the result
Given <FOUNT> and <SINK> interfaces and FOUNT and SINK objects, let data flow from the FOUNT to the SINK, and return the result
>fifo-queue<) function seed) ¶>number-map<) function seed) ¶>fifo-queue<) function seed) ¶>number-map<) function seed) ¶>hash-table<) function seed) ¶Fold the FOLDABLE with a FUNCTION accumulating from the SEED,
iterating on the contents from a notional left to a notional right.
The function takes as parameters
an accumulated value followed by
a single value for the content of each iteration
and returns a new accumulated value.
<mutating-map>) foldable function seed) ¶<linearized-map>) foldable function seed) ¶<set-from-map>) set f seed) ¶<map-foldable-from-*>) map fun seed) ¶>fifo-queue<) function seed) ¶>number-map<) function seed) ¶>fifo-queue<) function seed) ¶>number-map<) function seed) ¶>hash-table<) function seed) ¶Fold the FOLDABLE with a FUNCTION accumulating from the SEED,
iterating on the contents from a notional left to a notional right.
The function takes as parameters
an accumulated value followed by
as many values as make sense for the specific interface, i.e.
element for a set, element and count for a multi-set, key and value for a map,
and returns a new accumulated value.
<mutating-map>) foldable function seed) ¶<linearized-map>) foldable function seed) ¶<encoded-key-map>) map f seed) ¶<map-fold-left*-from-for-each*>) map f seed) ¶<encoded-key-map>) map f seed) ¶<hash-table>) map f seed) ¶<binary-tree>) node f seed) ¶<multiset-from-set>) multiset f seed) ¶<multiset-from-map>) multiset f seed) ¶<map-fold-left*-from-fold-right*>) map fun seed) ¶<foldable-*-from>) map function seed) ¶>fifo-queue<) function seed) ¶>number-map<) function seed) ¶>fifo-queue<) function seed) ¶>number-map<) function seed) ¶>hash-table<) function seed) ¶Fold the FOLDABLE with a FUNCTION accumulating from the SEED,
iterating on the contents from a notional right to a notional left.
The function takes as parameters
a single value for the content of each iteration
followed by an accumulated value
and returns a new accumulated value.
<mutating-map>) foldable function seed) ¶<linearized-map>) foldable function seed) ¶<set-from-map>) set f seed) ¶<map-foldable-from-*>) map fun seed) ¶<foldable-fold-right-from-fold-left>) map right-function seed) ¶>fifo-queue<) function seed) ¶>number-map<) function seed) ¶>fifo-queue<) function seed) ¶>number-map<) function seed) ¶>hash-table<) function seed) ¶Fold the FOLDABLE with a FUNCTION accumulating from the SEED,
iterating on the contents from a notional right to a notional left.
The function takes as parameters
as many values as make sense for the specific interface,
i.e. element for a set, element and count for a multi-set, key and value for a map,
followed by an accumulated value
and returns a new accumulated value.
<mutating-map>) map function seed) ¶<linearized-map>) map function seed) ¶<encoded-key-map>) map f seed) ¶<encoded-key-map>) map f seed) ¶<hash-table>) map f seed) ¶<binary-tree>) node f seed) ¶<multiset-from-set>) multiset f seed) ¶<multiset-from-map>) multiset f seed) ¶<map-fold-right*-from-fold-left*>) map fun seed) ¶<foldable-*-from>) map function seed) ¶>fifo-queue<) f) ¶>number-map<) f) ¶>fifo-queue<) f) ¶>number-map<) f) ¶>hash-table<) f) ¶For every step in iterator, apply f to one entry
<mutating-map>) iterator f) ¶<linearized-map>) iterator f) ¶<set-from-map>) set f) ¶<map-foldable-from-*>) map fun) ¶<foldable-for-each-from-fold-left>) map fun) ¶>fifo-queue<) f) ¶>number-map<) f) ¶>fifo-queue<) f) ¶>number-map<) f) ¶>hash-table<) f) ¶For every step in iterator, apply f to multiple values
<mutating-map>) iterator f) ¶<linearized-map>) iterator f) ¶<encoded-key-map>) map f) ¶<hash-table>) map f) ¶<encoded-key-map>) map f) ¶<hash-table>) map f) ¶<binary-tree>) node f) ¶<multiset-from-set>) multiset f) ¶<multiset-from-map>) multiset f) ¶<map-for-each*-from-fold-left*>) map fun) ¶<foldable-*-from>) map function) ¶>fifo-queue<) key) ¶>number-map<) key) ¶>hash-table<) key) ¶>fifo-queue<) key) ¶>number-map<) key) ¶Return two values:
1- a single value for an entry
2- a boolean a boolean indicating whether the entry was found.
<mutating-map>) collection key) ¶<linearized-map>) collection key) ¶>fifo-queue<) key) ¶>number-map<) key) ¶>hash-table<) key) ¶>fifo-queue<) key) ¶>number-map<) key) ¶Return a boolean indicating whether an entry was found for that key.
<mutating-map>) collection key) ¶<linearized-map>) collection key) ¶<map-has-key-p-from-lookup>) collection key) ¶<collection-has-key-p-from-get-entry>) collection key) ¶<hash-table>)) ¶automatically generated reader method
<multiset>) collection key &optional count) ¶<transformer>)) ¶automatically generated reader method
<transformer>)) ¶automatically generated writer method
Modify the map to add a key-value pair, replacing any previous association for this key. Return no value.
<mutating-map>) map key value) ¶<encoded-key-map>) map key value) ¶<hash-table>) map key value) ¶<post-self-balanced-binary-tree>) node key value) ¶<binary-tree>) node key value) ¶>number-map<) key value) ¶>number-map<) key value) ¶>hash-table<) key value) ¶Add a key-value pair to a map,
replacing any previous association for this key,
return a new map.
<linearized-map>) map key value) ¶<encoded-key-map>) map key value) ¶<hash-table>) map key value) ¶<binary-tree>) node key value) ¶interface-class)) ¶automatically generated reader method
interface-class)) ¶automatically generated reader method
interface-class)) ¶automatically generated writer method
Given a <FOUNT> interface and an object FOUNT, return an initial ITERATOR state with which to start iterating.
Given a <FOUNT> interface and an object FOUNT,
return an initial ITERATOR state with which to start iterating.
<number-iterator>)) ¶automatically generated reader method
end.
<number-iterator>)) ¶automatically generated reader method
<number-iterator>)) ¶automatically generated reader method
Join two collections into the first one.
How entries are combined depends on the specific interface.
Typically, entries from the first override entries from the second.
<mutating-map>) collection1 collection2) ¶<encoded-key-map>) map1 map2) ¶<map-join-from-for-each*-lookup-insert>) map1 map2) ¶>number-map<) (collection2 >number-map<)) ¶>fifo-queue<) (collection2 >fifo-queue<)) ¶>number-map<) (collection2 >number-map<)) ¶>hash-table<) (collection2 >hash-table<)) ¶Join two collections, returning a new joined collection.
How entries are combined depends on the specific interface.
Typically, entries from the first override entries from the second.
<linearized-map>) collection1 collection2) ¶<encoded-key-map>) map1 map2) ¶<map-join-from-fold-left*-insert>) map1 map2) ¶Join a list of COLLECTIONS, returning a new joined COLLECTION.
How entries are combined depends on the specific interface.
For instance, for maps, latter entries override those from earlier entries;
in other cases, entries from earlier collections may override entries from latter ones.
If the list is empty, a new empty collection is returned;
otherwise, the first collection is returned,
that has been updated with any additional mappings,
whereas the state of other maps is not specified (see method documentation).
<mutating-map>) list) ¶<encoded-key-map>) maplist) ¶<map-join-from-for-each*-lookup-insert>) maplist) ¶Join a list of COLLECTIONS, returning a new joined COLLECTION.
earlier entries override those from latter entries.
How entries are combined depends on the specific interface.
Typically, entries from earlier collections override entries from latter ones.
<linearized-map>) list) ¶<encoded-key-map>) maplist) ¶<map-join/list-from-join>) maplist) ¶<parametric-encoded-key-collection>)) ¶automatically generated reader method
<parametric-encoded-key-collection>)) ¶automatically generated reader method
Interface for the type of keys of a collection
<hash-table>)) ¶automatically generated reader method
<parametric-avl-tree>)) ¶automatically generated reader method
<hash-table>)) ¶automatically generated reader method
<parametric-avl-tree>)) ¶automatically generated reader method
<alist>)) ¶automatically generated reader method
<number-map>)) ¶automatically generated reader method
<set*-from-collection>)) ¶binary-branch)) ¶automatically generated reader method
left.
binary-branch)) ¶automatically generated reader method
left.
binary-branch)) ¶automatically generated writer method
left.
key, value and foundp from the leftmost node in TREE
<binary-tree>) node) ¶the leftmost node in TREE
<binary-tree>) node) ¶<list-transformer>) value) ¶<transformer>) inner-monadic-value) ¶Convert a list to a multiset of given interface
Convert a list to a set of given interface
<set-from-map>) list) ¶lookup a tree for a key, return a path to the proper node.
<binary-tree>) node key path) ¶>number-map<) key) ¶>number-map<) key) ¶>hash-table<) key) ¶Lookup what map associates to a key,
return two values, the associated value and
a boolean that is true iff an association was found
<mutating-map>) map key) ¶<linearized-map>) map key) ¶<encoded-key-map>) map key) ¶<hash-table>) map key) ¶<encoded-key-map>) map key) ¶<hash-table>) map key) ¶<binary-tree>) node key) ¶create an object conforming to the interface
based on provided initarg keywords, returning the object.
Make a box from a generator for the value inside the box
Convert a map of given interface to an alist
<mutating-map>) map) ¶<linearized-map>) map) ¶Join two maps into the first one, after merging elements from MAP2.
Return no values.
For each key K present in either MAP1 or MAP2,
the function FUN is called with arguments K V1 F1 V2 F2 where
V1 and F1 are the value and found flag for MAP1, and
V2 and F2 are the value and found flag for MAP2,
and FUN returns value V and found flag F,
that correspond the lookup for K in the result.
<mutating-map>) fun map1 map2) ¶<encoded-key-map>) fun map1 map2) ¶<map-map/2-from-for-each*-lookup-insert-drop>) fun map1 map2) ¶>number-map<) (map2 >number-map<)) ¶>number-map<) (map2 >number-map<)) ¶>hash-table<) (map2 >hash-table<)) ¶Join two maps, returning a joined map.
For each key K present in either MAP1 or MAP2,
the function FUN is called with arguments K V1 F1 V2 F2 where
V1 and F1 are the value and found flag for MAP1, and
V2 and F2 are the value and found flag for MAP2,
and FUN returns value V and found flag F,
that correspond the lookup for K in the result.
<linearized-map>) fun map1 map2) ¶<encoded-key-map>) fun map1 map2) ¶<map-map/2-from-fold-left*-lookup-insert-drop>) fun map1 map2) ¶How many times for the element appear in the set*?
<multiset-from-set>) element multiset) ¶<multiset-from-map>) element multiset) ¶Is a given object member of the set?
<set-from-multiset>) element set) ¶<set-from-map>) element set) ¶<multiset>) element multiset) ¶Fold the FOLDABLE according to a <MONOID> interface,
where each entry is mapped to the monoid using the provided function
<mutating-map>) <monoid> foldable function) ¶<linearized-map>) <monoid> foldable function) ¶<map-foldable-from-*>) <monoid> map fun) ¶<foldable-monoid-fold-from-fold-left>) <monoid> map fun) ¶Fold the FOLDABLE according to a <MONOID> interface,
where each entry’s values are mapped to the monoid using the provided function
<mutating-map>) <monoid> foldable function) ¶<linearized-map>) <monoid> foldable function) ¶<hash-table>) <monoid> map f) ¶<map-monoid-fold*-from-divide/list>) <monoid> map fun) ¶<map-monoid-fold*-from-divide>) <monoid> map fun) ¶<map-monoid-fold*-from-fold-left*>) <monoid> map fun) ¶<foldable-*-from>) <monoid> map function) ¶Convert a multiset of given interface to a list
<multiset-from-set>) multiset) ¶<multiset-from-map>) multiset) ¶Given a <FOUNT> interface and an ITERATOR state, return two or more values:
1- a boolean DATAP which is true if there is data, false if the end was reached;
2- the NEXT iterator state if any (can be NIL for some interfaces or if the end is reached);
3- zero, one or more VALUES produced by this iteration step.
<increasing-number-iterator>) n) ¶<decreasing-number-iterator>) n) ¶Given a <FOUNT> interface and an ITERATOR state,
raise an END-OF-ITERATION condition if the iterator has reached its end,
otherwise, side-effect the iterator to go to its next state and
return values produced by this iteration step.
<increasing-number-iterator>) counter-box) ¶<decreasing-number-iterator>) counter-box) ¶make a node for a tree interface
<binary-tree>) &key left right key value) ¶<binary-tree>) &key left right key value) ¶<avl-tree>) &key left right key value) ¶avl-tree-node)) ¶empty-object)) ¶null)) ¶return the node class associated with an interface.
<avl-tree>)) ¶<binary-tree>)) ¶<avl-tree>)) ¶<binary-tree>)) ¶<binary-tree>)) ¶heighted-binary-tree-node)) ¶automatically generated reader method
trie-head)) ¶automatically generated reader method
empty-object)) ¶null)) ¶heighted-binary-tree-node)) ¶automatically generated reader method
heighted-binary-tree-node)) ¶automatically generated writer method
association-pair)) ¶automatically generated reader method
key.
association-pair)) ¶automatically generated reader method
key.
association-pair)) ¶automatically generated writer method
key.
key and value associated with a node in a TREE
<map-empty-is-empty-object>) (m empty-object)) ¶<map-empty-is-nil>) (m null)) ¶<binary-tree>) (node binary-tree-node)) ¶association-pair)) ¶automatically generated reader method
association-pair)) ¶automatically generated reader method
association-pair)) ¶automatically generated writer method
<order-parameter>)) ¶automatically generated reader method
<order-parameter>) x y) ¶<case-insensitive-string>) x y) ¶<order-from-compare>) x y) ¶<order-parameter>) x y) ¶<case-insensitive-string>) x y) ¶<order-from-compare>) x y) ¶<order-from-lessp>) x y) ¶<order-parameter>) x y) ¶<case-insensitive-string>) x y) ¶<order-from-compare>) x y) ¶<order-from-lessp>) x y) ¶<order-parameter>) x y) ¶<case-insensitive-string>) x y) ¶<order-from-compare>) x y) ¶<order-from-lessp>) x y) ¶Return a boolean, TRUE iff SET1 is a proper subset of SET2
<set-from-map>) set1 set2) ¶<mutating>)) ¶automatically generated reader method
Restriction of the collection to the keys that verify the predicate
<mutating-map>) predicate collection) ¶Restriction of the collection to the keys that verify the predicate
<linearized-map>) predicate collection) ¶Given a <SINK> interface and a COLLECTOR, return the final RESULT from the collecting process
Given a <SINK> interface and a COLLECTOR, return the final RESULT from the collecting process
Takes a value of TYPE T and returns a monadic value that contains VALUE.
VALUE : anything
MONADIC-VALUE : The value of the type expected by the monad.
RESULT is the constructor of monad values.
<maybe-transformer>) value) ¶<list-transformer>) value) ¶<transformer>) v) ¶<identity>) value) ¶Returns the VALUE. like CL:IDENTITY
<continuation>) value) ¶binary-branch)) ¶automatically generated reader method
binary-branch)) ¶automatically generated reader method
binary-branch)) ¶automatically generated writer method
key, value and foundp from the rightmost node in TREE
<binary-tree>) node) ¶the rightmost node in TREE
<binary-tree>) node) ¶heighted-binary-tree-node)) ¶binary-tree-node)) ¶heighted-binary-tree-node)) ¶binary-tree-node)) ¶<continuation>) mv &rest args) ¶Return a new (multi)SET, SET1 minus SET2
<set-from-map>) set1 set2) ¶Return a new (multi)SET, intersection of SET1 and SET2
<set-from-map>) set1 set2) ¶Return a new (multi)SET, intersection of a LIST of sets
<set-from-map>) list) ¶Convert a set of given interface to a list
<set-from-map>) set) ¶Return a new (multi)SET, union of SET1 and SET2
<set-from-map>) set1 set2) ¶Return a new (multi)SET, union of a LIST of sets
<set-from-map>) list) ¶Make a singleton from a single entry
<mutating-map>) entry) ¶<linearized-map>) entry) ¶<hash-table>) pair) ¶<set-from-multiset>) element) ¶<set-from-map>) element) ¶<map-singleton-from-insert>) pair) ¶>fifo-queue<)) ¶>number-map<)) ¶>hash-table<)) ¶>fifo-queue<)) ¶>number-map<)) ¶Is the collection a singleton?
<mutating-map>) collection) ¶<linearized-map>) collection) ¶<encoded-key-map>) map) ¶<set-from-map>) set) ¶<map-singleton-p-from-decons>) map) ¶Size the object, e.g. number of elements in a collection
<mutating-map>) object) ¶<linearized-map>) object) ¶<encoded-key-map>) map) ¶<hash-table>) map) ¶<encoded-key-map>) map) ¶<hash-table>) map) ¶<multiset-from-set>) multiset) ¶<multiset-from-map>) multiset) ¶<set-from-map>) set) ¶<foldable-size-from-fold-left>) map) ¶>fifo-queue<)) ¶>number-map<)) ¶>hash-table<)) ¶>fifo-queue<)) ¶>number-map<)) ¶Is the size of the object less or equal to integer n?
<mutating-map>) object n) ¶<linearized-map>) object n) ¶<map-size<=n-p-from-decons>) map n) ¶<sizable-size<=n-p-from-size>) map n) ¶>fifo-queue<) n) ¶>number-map<) n) ¶>hash-table<) n) ¶>fifo-queue<) n) ¶>number-map<) n) ¶<linearized>)) ¶automatically generated reader method
Return a boolean, TRUE iff SET1 is a subset of SET2
<set-from-map>) set1 set2) ¶Return the value inside the box
The UPDATE function takes the state and returns
it. It also calls the THING with the current state and makes the
result into the new state.
heighted-binary-tree-node)) ¶Update the association of a map for a given key
calling fun with the previous associated value and T if found, with NIL and NIL otherwise,
and return no values,
where fun will return two values,
the new value and a boolean,
the association being dropped if the boolean is NIL,
otherwise a new association being setup with the new value.
<mutating-map>) map key fun) ¶<encoded-key-map>) map key fun) ¶<map-update-key-from-lookup-insert-drop>) map key fun) ¶>number-map<) key fun) ¶>number-map<) key fun) ¶>hash-table<) key fun) ¶Update the association of a map for a given key and
return a new updated map
calling fun with the previous associated value and T if found, with NIL and NIL otherwise,
where fun will return two values,
the new value and a boolean,
the association being dropped if the boolean is NIL,
otherwise a new association being setup with the new value.
<linearized-map>) map key fun) ¶<encoded-key-map>) map key fun) ¶<map-update-key-from-lookup-insert-drop>) map key fun) ¶Interface for the type of values of a map (codomain)
<parametric-avl-tree>)) ¶automatically generated reader method
<hash-table>)) ¶automatically generated reader method
<parametric-avl-tree>)) ¶automatically generated reader method
<alist>)) ¶automatically generated reader method
<lexicographic>)) ¶automatically generated reader method
<multiset>)) ¶binary-tree-node) stream) ¶trie-branch) stream) ¶<transformer>) stream) ¶interface-class) (super-class standard-class)) ¶sb-mop.
<copy-is-identity>.
<map-decons-from-first-key-value-drop>.
<map-divide/list-from-divide>.
<map-empty-is-nil>.
<map-foldable-from-*>.
<map-join-from-fold-left*-insert>.
<map-join/list-from-join>.
<map-map/2-from-fold-left*-lookup-insert-drop>.
<map-monoid-fold*-from-fold-left*>.
<map-singleton-from-insert>.
<map-singleton-p-from-decons>.
<map-update-key-from-lookup-insert-drop>.
<map>.
<monoid>.
lil/interface/eq:<eq>
:key-interface
This slot is read-only.
lil/interface/base:<type>
:value-interface
This slot is read-only.
Concrete interface for any object
Keys in binary trees increase from left to right
<binary-tree>.
<map-decons-from-first-key-value-drop>.
<map-empty-is-nil>.
<map-has-key-p-from-lookup>.
<map-join-from-fold-left*-insert>.
<map-join/list-from-join>.
<map-map/2-from-fold-left*-lookup-insert-drop>.
<map-monoid-fold*-from-divide/list>.
<map-update-key-from-lookup-insert-drop>.
<tree>.
divide.
divide/list.
drop.
insert.
node.
node-class.
Keys in binary trees increase from left to right
Keys in binary trees increase from left to right
<binary-tree>.
<foldable-size-from-fold-left>.
<map-copy-from-join-empty>.
<map-decons-from-first-key-value-drop>.
<map-empty-is-empty-object>.
<map-join-from-for-each*-lookup-insert>.
<map-join/list-from-join>.
<map-map/2-from-for-each*-lookup-insert-drop>.
<map-update-key-from-lookup-insert-drop>.
<map>.
<tree>.
divide.
divide/list.
drop.
insert.
node.
node-class.
common-lisp.
(quote lil/interface/box:box!)
common-lisp.
:class
This slot is read-only.
:compare
This slot is read-only.
Pure Persistent Data Structures have trivial copying
copy.
A type of objects that can be copied
==.
eq-function.
hash.
<map>.
<queue>.
<sequence>.
<set*>.
Fast Merge Integer Maps
<copy-is-identity>.
<foldable-size-from-fold-left>.
<map-decons-from-first-key-value-drop>.
<map-divide/list-from-divide>.
<map-empty-is-nil>.
<map-foldable-from-*>.
<map-for-each*-from-fold-left*>.
<map-has-key-p-from-lookup>.
<map-join-from-fold-left*-insert>.
<map-join/list-from-join>.
<map-map/2-from-fold-left*-lookup-insert-drop>.
<map-monoid-fold*-from-divide>.
<map-update-key-from-lookup-insert-drop>.
<map>.
<tree>.
size.
A type of objects that can be folded
<finite-collection>.
<foldable-*-from>.
<foldable-fold-right-from-fold-left>.
<foldable-for-each-from-fold-left>.
<foldable-monoid-fold-from-fold-left>.
<foldable-size-from-fold-left>.
<map-fold-left*-from-fold-right*>.
<map-fold-right*-from-fold-left*>.
<map-foldable-from-*>.
<map-for-each*-from-fold-left*>.
<map-monoid-fold*-from-divide/list>.
<map-monoid-fold*-from-divide>.
<map-monoid-fold*-from-fold-left*>.
pure hash table
lil/interface/eq:<hashable>
:key-interface
This slot is read-only.
lil/interface/base:<type>
:value-interface
This slot is read-only.
lil/pure/map:<map>
:hashmap-interface
This slot is read-only.
lil/pure/map:<map>
:bucketmap-interface
This slot is read-only.
stateful hash table
<map-copy-from-join-empty>.
<map-decons-from-first-key-value-drop>.
<map-divide-from-for-each*>.
<map-divide/list-from-divide>.
<map-first-key-value-from-for-each*>.
<map-fold-left*-from-for-each*>.
<map-fold-right*-from-fold-left*>.
<map-foldable-from-*>.
<map-join-from-for-each*-lookup-insert>.
<map-join/list-from-join>.
<map-map/2-from-for-each*-lookup-insert-drop>.
<map-monoid-fold*-from-fold-left*>.
<map-update-key-from-lookup-insert-drop>.
<map>.
<sizable-size<=n-p-from-size>.
:key-interface
This slot is read-only.
The RESULT function for <IDENTITY> is like CL:IDENTITY, and
simply returns the value passed to it.
The BIND function takes a monadic value, which in the case of <IDENTITY> is anything, and a monadic function, which is a one argument function. It FUNCALLs the function with the value, and returns the result.
An interface, encapsulating an algorithm
:lessp
This slot is read-only.
lil/interface/order:<order>
This slot is read-only.
alist-map.
check-invariant.
conj.
contents.
convert.
copy.
create.
deconj.
decons.
disj.
divide.
divide/list.
drop.
empty.
empty!.
empty-p.
first-entry.
first-key-value.
fold-left.
fold-left*.
fold-right.
fold-right*.
for-each.
for-each*.
get-entry.
has-key-p.
insert.
join.
join/list.
lookup.
map-alist.
map/2.
monoid-fold.
monoid-fold*.
restriction.
singleton.
singleton-p.
size.
size<=n-p.
update-key.
:stateful-interface
This slot is read-only.
Beware that join must be non-destructive of its second argument
copy.
join.
<binary-tree>.
<encoded-key-map>.
<hash-table>.
<map-copy-from-join-empty>.
<map-decons-from-first-key-value-drop>.
<map-divide-from-for-each*>.
<map-divide/list-from-divide>.
<map-empty-is-empty-object>.
<map-first-key-value-from-for-each*>.
<map-fold-left*-from-for-each*>.
<map-join-from-for-each*-lookup-insert>.
<map-join/list-from-join>.
<map-map/2-from-for-each*-lookup-insert-drop>.
<map-update-key-from-lookup-insert-drop>.
<mutating-map>.
<tree>.
<alist>.
<encoded-key-map>.
<fmim>.
<hash-table>.
<linearized-map>.
<map-decons-from-first-key-value-drop>.
<map-divide/list-from-divide>.
<map-empty-is-nil>.
<map-join-from-fold-left*-insert>.
<map-join/list-from-join>.
<map-map/2-from-fold-left*-lookup-insert-drop>.
<map-singleton-from-insert>.
<map-singleton-p-from-decons>.
<map-size<=n-p-from-decons>.
<map-update-key-from-lookup-insert-drop>.
<tree>.
lil/interface/monad/maybe:<maybe-empty>
:empty-interface
An INTERFACE with three functions, RESULT, BIND and FAIL.
To be a ’proper’ monad, it must also follow the Three Monad Laws.
CHECK-INVARIANT is available if the :INTERFACE/MONAD/TEST/MONAD is loaded.
lil/pure/map:<map>
lil/interface/map:<map>
:base-interface
This slot is read-only.
lil/pure/map:<map>
lil/interface/map:<map>
:base-interface
This slot is read-only.
alist-map.
check-invariant.
conj.
contents.
convert.
copy.
create.
deconj.
decons.
disj.
divide.
divide/list.
drop.
empty.
empty!.
empty-p.
first-entry.
first-key-value.
fold-left.
fold-left*.
fold-right.
fold-right*.
for-each.
for-each*.
get-entry.
has-key-p.
insert.
join.
join/list.
lookup.
map-alist.
map/2.
monoid-fold.
monoid-fold*.
restriction.
singleton.
singleton-p.
size.
size<=n-p.
update-key.
:pure-interface
This slot is read-only.
:class
lil/interface/order:<number>
This slot is read-only.
common-lisp.
(quote lil/interface/box:one-use-box)
common-lisp.
(quote lil/interface/box:one-use-thunk-box)
common-lisp.
(quote lil/interface/box:one-use-value-box)
:order
This slot is read-only.
lil/interface/order:<order>
:key-interface
This slot is read-only.
lil/interface/base:<type>
:value-interface
This slot is read-only.
lil/interface/order:<order>
:key-interface
This slot is read-only.
lil/interface/base:<type>
:value-interface
This slot is read-only.
:base-interface
This slot is read-only.
:key-encoder
This slot is read-only.
:key-decoder
This slot is read-only.
common-lisp.
(quote lil/interface/box:promise-box)
lil/interface/map:<map>
:base-interface
This slot is read-only.
lil/pure/map:<map>
lil/pure/set:<multiset>
common-lisp.
(quote lil/interface/box:simple-thunk-box)
bind.
fail.
(setf inner).
inner.
lift.
print-object.
result.
lil/interface/monad/identity:<identity>
lil/interface/monad/transformer:inner, :inner
abstract interface for trees
abstract interface for trees
abstract interface for stateful trees
An interface encapsulating a particular type of objects
<any>.
<copyable>.
<emptyable>.
<eq>.
<for-each>.
<fount>.
<magma>.
<makeable>.
<monad>.
<run>.
<sink>.
<sizable>.
common-lisp.
(quote lil/interface/box:simple-value-box)
:class
lil/stateful/queue:<fifo-queue>
check-invariant.
conj.
contents.
copy.
deconj.
dequeue.
dequeue-all.
disj.
divide.
empty!.
empty-p.
enqueue.
enqueue-first.
enqueue-last.
enqueue-many.
first-entry.
fold-left.
fold-left*.
fold-right.
fold-right*.
for-each.
for-each*.
get-entry.
has-key-p.
join.
monoid-fold.
monoid-fold*.
restriction.
singleton-p.
size.
size<=n-p.
:class
lil/pure/queue:<fifo-queue>
check-invariant.
conj.
contents.
copy.
deconj.
decons.
disj.
divide.
drop.
empty!.
empty-p.
first-entry.
first-key-value.
fold-left.
fold-left*.
fold-right.
fold-right*.
for-each.
for-each*.
get-entry.
has-key-p.
insert.
join.
lookup.
map-alist.
map/2.
monoid-fold.
monoid-fold*.
restriction.
singleton-p.
size.
size<=n-p.
update-key.
:class
lil/pure/hash-table:<hash-table>
check-invariant.
conj.
contents.
copy.
deconj.
decons.
disj.
divide.
drop.
empty!.
empty-p.
first-entry.
first-key-value.
fold-left.
fold-left*.
fold-right.
fold-right*.
for-each.
for-each*.
get-entry.
has-key-p.
insert.
join.
lookup.
map-alist.
map/2.
monoid-fold.
monoid-fold*.
restriction.
singleton-p.
size.
size<=n-p.
update-key.
:interface
check-invariant.
conj.
contents.
copy.
deconj.
decons.
disj.
divide.
drop.
empty!.
empty-p.
first-entry.
first-key-value.
fold-left.
fold-left*.
fold-right.
fold-right*.
for-each.
for-each*.
get-entry.
has-key-p.
insert.
join.
lookup.
map-alist.
map/2.
monoid-fold.
monoid-fold*.
restriction.
singleton-p.
size.
size<=n-p.
update-key.
:interface
check-invariant.
conj.
contents.
copy.
deconj.
decons.
disj.
divide.
drop.
empty!.
empty-p.
first-entry.
first-key-value.
fold-left.
fold-left*.
fold-right.
fold-right*.
for-each.
for-each*.
get-entry.
has-key-p.
insert.
join.
lookup.
map-alist.
map/2.
monoid-fold.
monoid-fold*.
restriction.
singleton-p.
size.
size<=n-p.
update-key.
:class
lil/stateful/tree:<number-map>
check-invariant.
conj.
contents.
copy.
deconj.
decons.
disj.
divide.
drop.
empty!.
empty-p.
first-entry.
first-key-value.
fold-left.
fold-left*.
fold-right.
fold-right*.
for-each.
for-each*.
get-entry.
has-key-p.
insert.
join.
lookup.
map-alist.
map/2.
monoid-fold.
monoid-fold*.
restriction.
singleton-p.
size.
size<=n-p.
update-key.
:class
lil/pure/tree:<number-map>
:interface
check-invariant.
conj.
contents.
copy.
deconj.
dequeue.
dequeue-all.
disj.
divide.
empty!.
empty-p.
enqueue.
enqueue-first.
enqueue-last.
enqueue-many.
first-entry.
fold-left.
fold-left*.
fold-right.
fold-right*.
for-each.
for-each*.
get-entry.
has-key-p.
join.
monoid-fold.
monoid-fold*.
print-object.
restriction.
singleton-p.
size.
size<=n-p.
:interface
:value
This slot is read-only.
integer
0
:height
This slot is read-only.
This slot is read-only.
:generator
box.
fixnum
0
:height
This slot is read-only.
box.
interface-class)) ¶automatically generated reader method
interface-class)) ¶automatically generated writer method
one-use-box)) ¶automatically generated reader method
one-use-box)) ¶automatically generated writer method
>number-map<) entry) ¶>fifo-queue<) entry) ¶>number-map<) entry) ¶>hash-table<) entry) ¶heighted-binary-tree-node) (origin-node heighted-binary-tree-node)) ¶binary-tree-node) (origin-node binary-tree-node)) ¶binary-tree-node) (origin-node empty-object)) ¶>number-map<)) ¶>fifo-queue<)) ¶>number-map<)) ¶>hash-table<)) ¶interface-class)) ¶>number-map<) key) ¶>fifo-queue<) key) ¶>number-map<) key) ¶>hash-table<) key) ¶>number-map<)) ¶>number-map<)) ¶>hash-table<)) ¶>fifo-queue<) function) ¶>number-map<) function) ¶>fifo-queue<) function) ¶>number-map<) function) ¶>hash-table<) function) ¶>fifo-queue<) function) ¶>number-map<) function) ¶>fifo-queue<) function) ¶>number-map<) function) ¶>hash-table<) function) ¶<maybe-transformer>) a b) ¶>number-map<)) ¶>fifo-queue<)) ¶>number-map<)) ¶>hash-table<)) ¶<maybe-transformer>)) ¶| Jump to: | %
(
<
=
A B C D E F G H I J K L M N O P R S T U V W Z |
|---|
| Jump to: | %
(
<
=
A B C D E F G H I J K L M N O P R S T U V W Z |
|---|
| Jump to: | %
<
A B C E G H I K L O P R S T U V |
|---|
| Jump to: | %
<
A B C E G H I K L O P R S T U V |
|---|
| Jump to: | <
>
A B C E F H I L M O P S T V |
|---|
| Jump to: | <
>
A B C E F H I L M O P S T V |
|---|