This is the enumerations Reference Manual, generated automatically by Declt version 4.0 beta 2 "William Riker" on Tue Jul 15 03:48:51 2025 GMT+0.
enumerations/enumerations.asdenumerations/enumerations-pkg.lispenumerations/enumerations.lispenumerations/sequence-enumeration.lispenumerations/list-enumerations.lispenumerations/vector-enumerations.lispenumerations/string-enumerations.lispenumerations/hash-table-enumerations.lispenumerations/array-enumerations.lispenumerations/number-enumerations.lispenumerations/foreach.lispThe main system appears first, followed by any subsystem dependency.
enumerationsThe CL-ENUMERATIONS project contains a Common Lisp
Java-like enumeration/iteration library and protocol. Most basic
Common Lisp types are handled.
The project page can be found at http://common-lisp.net/project/cl-enumeration.
Marco Antoniotti
BSD like
enumerations-pkg.lisp (file).
enumerations.lisp (file).
sequence-enumeration.lisp (file).
list-enumerations.lisp (file).
vector-enumerations.lisp (file).
string-enumerations.lisp (file).
hash-table-enumerations.lisp (file).
array-enumerations.lisp (file).
number-enumerations.lisp (file).
foreach.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
enumerations/enumerations.asdenumerations/enumerations-pkg.lispenumerations/enumerations.lispenumerations/sequence-enumeration.lispenumerations/list-enumerations.lispenumerations/vector-enumerations.lispenumerations/string-enumerations.lispenumerations/hash-table-enumerations.lispenumerations/array-enumerations.lispenumerations/number-enumerations.lispenumerations/foreach.lispenumerations/enumerations-pkg.lispenumerations (system).
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
enumerations/enumerations.lispenumerations-pkg.lisp (file).
enumerations (system).
bi-directional-enumeration (class).
bi-directional-enumeration-p (generic function).
bounded-enumeration (class).
bounded-enumeration-p (generic function).
current (generic function).
enumerate (generic function).
enumeration (class).
enumerationp (generic function).
functional-enumeration (class).
functional-enumeration-p (generic function).
has-more-elements-p (generic function).
has-next-p (generic function).
has-previous-p (generic function).
next (generic function).
no-such-element (condition).
previous (generic function).
print-object (method).
reset (generic function).
element-type (generic function).
enumeration-cursor (reader method).
(setf enumeration-cursor) (writer method).
enumeration-end (reader method).
(setf enumeration-end) (writer method).
enumeration-object (reader method).
enumeration-start (reader method).
(setf enumeration-start) (writer method).
no-such-element-enumeration (reader method).
enumerations/sequence-enumeration.lispenumerations-pkg.lisp (file).
enumerations (system).
sequence-enumeration (class).
sequence-enumeration-p (generic function).
enumerations/list-enumerations.lispsequence-enumeration.lisp (file).
enumerations (system).
current (method).
enumerate (method).
has-more-elements-p (method).
has-next-p (method).
initialize-instance (method).
list-enumeration (class).
list-enumeration-p (generic function).
next (method).
reset (method).
end-cons (reader method).
(setf end-cons) (writer method).
enumerations/vector-enumerations.lispsequence-enumeration.lisp (file).
enumerations (system).
current (method).
enumerate (method).
has-more-elements-p (method).
has-next-p (method).
has-previous-p (method).
initialize-instance (method).
next (method).
previous (method).
reset (method).
vector-enumeration (class).
vector-enumeration-p (generic function).
enumerations/string-enumerations.lispvector-enumerations.lisp (file).
enumerations (system).
enumerate (method).
next (method).
previous (method).
simple-string-enumeration (class).
simple-string-enumeration-p (generic function).
string-enumeration (class).
string-enumeration-p (generic function).
enumerations/hash-table-enumerations.lispenumerations.lisp (file).
enumerations (system).
current (method).
enumerate (method).
has-more-elements-p (method).
has-next-p (method).
hash-table-enumeration (class).
hash-table-enumeration-p (generic function).
initialize-instance (method).
next (method).
reset (method).
enumerate-key-value-pairs (function).
enumerate-keys (function).
enumerate-values (function).
key-value-pairs-p (reader method).
keysp (reader method).
underlying-enumeration (reader method).
(setf underlying-enumeration) (writer method).
valuesp (reader method).
enumerations/array-enumerations.lispenumerations.lisp (file).
enumerations (system).
array-table-enumeration (class).
array-table-enumeration-p (generic function).
current (method).
enumerate (method).
has-more-elements-p (method).
has-next-p (method).
has-previous-p (method).
initialize-instance (method).
next (method).
previous (method).
reset (method).
enumerations/number-enumerations.lispenumerations.lisp (file).
enumerations (system).
current (method).
enumerate (method).
has-more-elements-p (method).
has-next-p (method).
has-previous-p (method).
initialize-instance (method).
next (method).
number-enumeration (class).
number-enumeration-p (generic function).
previous (method).
print-object (method).
range (function).
reset (method).
number-enumeration-increment (reader method).
(setf number-enumeration-increment) (writer method).
number-enumeration-reverse-increment (reader method).
(setf number-enumeration-reverse-increment) (writer method).
enumerations/foreach.lispenumerations.lisp (file).
enumerations (system).
foreach (macro).
Packages are listed by definition order.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerationsThe CL Extensions Enumeration Package.
The package containing the API for a generic enumeration protocol in
Common Lisp.
Notes:
The package name is long because it indicates how to position the
library functionality within the breakdown in chapters of the ANSI
specification.
The lower-case "enum" package nickname is provided in order to appease
ACL Modern mode.
The "CL.EXT..." nicknames are provided as a suggestion about how to ’standardize’ package names according to a meaninguful scheme.
enum
enum
cl.extensions.enumerations
cl.ext.enumerations
cl.extensions.dacf.enumerations
cl.ext.dacf.enumerations
common-lisp.extensions.data-and-control-flow.enumerations
common-lisp.
array-table-enumeration (class).
array-table-enumeration-p (generic function).
bi-directional-enumeration (class).
bi-directional-enumeration-p (generic function).
bounded-enumeration (class).
bounded-enumeration-p (generic function).
current (generic function).
enumerate (generic function).
enumeration (class).
enumerationp (generic function).
foreach (macro).
functional-enumeration (class).
functional-enumeration-p (generic function).
has-more-elements-p (generic function).
has-next-p (generic function).
has-previous-p (generic function).
hash-table-enumeration (class).
hash-table-enumeration-p (generic function).
list-enumeration (class).
list-enumeration-p (generic function).
next (generic function).
no-such-element (condition).
number-enumeration (class).
number-enumeration-p (generic function).
previous (generic function).
range (function).
reset (generic function).
simple-string-enumeration (class).
simple-string-enumeration-p (generic function).
string-enumeration (class).
string-enumeration-p (generic function).
vector-enumeration (class).
vector-enumeration-p (generic function).
element-type (generic function).
end-cons (generic reader).
(setf end-cons) (generic writer).
enumerate-key-value-pairs (function).
enumerate-keys (function).
enumerate-values (function).
enumeration-cursor (generic reader).
(setf enumeration-cursor) (generic writer).
enumeration-end (generic reader).
(setf enumeration-end) (generic writer).
enumeration-object (generic reader).
enumeration-start (generic reader).
(setf enumeration-start) (generic writer).
key-value-pairs-p (generic reader).
keysp (generic reader).
no-such-element-enumeration (generic reader).
number-enumeration-increment (generic reader).
(setf number-enumeration-increment) (generic writer).
number-enumeration-reverse-increment (generic reader).
(setf number-enumeration-reverse-increment) (generic writer).
sequence-enumeration (class).
sequence-enumeration-p (generic function).
underlying-enumeration (generic reader).
(setf underlying-enumeration) (generic writer).
valuesp (generic reader).
Definitions are sorted by export status, category, package, and then by lexicographic order.
Simplified iteration construct over an ‘enumerable’ object.
FOREACH is a thin macro over LOOP and it mixes, in a hybrid, and maybe
not so beautiful, style the DOTIMES/DOLIST shape with LOOP clauses.
FORMS-AND-CLAUSES are executed in an environment where VAR is bound to the
elements of the result of (APPLY #’ENUM:ENUMERATE OBJECT KEYS).
If KEYS contains a non-NIL :REVERSE keyword, then the enumeration must
be bi-directional and PREVIOUS and HAS-PREVIOUS-P will be used to
traverse it. :REVERSE and its value will be still passed to the
embedded call to ENUMERATE. This is obviously only useful only for
enumerations that can start "in the middle".
FORMS-AND-CLAUSES can start with some declarations and then continue
with either regular forms or LOOP clauses. After the first LOOP
clause appears in FORMS-AND-CLAUSES, standard LOOP rules should be
followed.
FOREACH returns whatever is returned by FORMS-AND-CLAUSES according to
standard LOOP semantics.
Examples:
;;; Here are some examples of FOREACH.
cl-prompt> (setf le (enumerate ’(1 2 3)))
#<CONS enumeration ...>
cl-prompt> (foreach (i le) (print i))
1
2
3
NIL
;;; Of course, FOREACH is smarter than that:
cl-prompt> (foreach (i (vector ’a ’s ’d))
(declare (type symbol i))
(print i))
A
S
D
NIL
;;; Apart from declarations, FOREACH is just a macro built on top of
;;; LOOP, therefore you can leverage all the LOOP functionality.
cl-prompt> (foreach (i ’(1 2 3 4))
(declare (type fixnum i))
when (evenp i)
collect i)
(2 4)
;;; While this creates an admittedly strange hybrid between the
;;; standard DO... operators and LOOP, it does serve the purpose. The
;;; right thing would be to have a standardized way of extending LOOP.
;;; Alas, there is no such luxury.
;;; Finally an example of a reverse enumeration:
cl-prompt> (foreach (i (vector 1 2 3 4 5 6 7 8) :reverse t :start 4)
when (evenp i)
collect i)
(4 2)
The function RANGE is a utility function the produce a "stream"
(quote mandatory) of numbers. It is almost equivalent to the APL/J
iota operator and to Python xrange type.
The main use of RANGE is in conjunction with FOREACH and other
iteration constructs.
Arguments and Values:
START : a NUMBER
END : a NUMBER or NIL
INCR : a NUMBER or a function of one argument (default is #’1+)
result : a NUMBER-ENUMERATION
Examples:
;;;; The two calls below are equivalent:
cl-prompt> (range 2 10 3)
#<Number enumeration [2 10) at 2 by #<FUNCTION> XXXXXX>
cl-prompt> (enumerate ’number :start 2 :end 10 :by 3)
#<Number enumeration [2 10) at 2 by #<FUNCTION> XXXXXX>
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
array-table-enumeration)) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
bi-directional-enumeration)) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
bounded-enumeration)) ¶Returns the "current" element in the enumeration ENUM.
Each ENUMERATION instance maintains a reference to its "current"
element (if within "range"). Given an ENUMERATION instance
enumeration, the generic function CURRENT returns the object in such
reference.
If ERRORP is non-NIL and no "current" element is available, then
CURRENT signals an error: either NO-SUCH-ELEMENT or a continuable
error. If ERRORP is NIL and no "current" element is available then
DEFAULT is returned.
Arguments and Values:
ENUM : an ENUMERATION instance
ERRORP : a generalized BOOLEAN
DEFAULT : a T
result : a T.
Exceptional Situations:
CURRENT may signal a continuable error or NO-SUCH-ELEMENT. See above for an explanation.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
number-enumeration) &optional errorp default) ¶array-table-enumeration) &optional errorp default) ¶hash-table-enumeration) &optional errorp default) ¶vector-enumeration) &optional errorp default) ¶list-enumeration) &optional errorp default) ¶enumeration) &optional errorp default) ¶Creates a (specialized) ENUMERATION object.
If applicable START and END delimit the range of the actual enumeration.
The generic function ENUMERATE is the main entry point in the
ENUMERATIONS machinery. It takes a CL object (ENUMERABLE-ITEM) and
some additional parameters, which may or may not be used depending on
the type of the object to be enumerated.
Arguments and Values:
ENUMERABLE-ITEM : an Common Lisp object
START : an object (usually a non-negative integer)
END : an object or NIL
result : an ENUMERATION instance
Exceptional Situations:
ENUMERATE calls MAKE-INSTANCE on the appropriate ENUMERATION sub-class. The instance initialization machinery may signal various errors. See the documentation for each ENUMERATION sub-class for details.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
(eql number)) &key start end by &allow-other-keys) ¶Calling ENUMERATE on a the symbol NUMBER returns a NUMBER-ENUMERATION instance.
NUMBER-ENUMERATIONs are not real enumerations per se, but they have a
nice interface and serve to render things like Python xrange type.
START must be a number, while END can be a number or NIL. The next (or
previous) element is obtained by changing the current element by BY.
BY can be a function (#’1+ is the default) or a number, in which case
it is always summed to the current element.
A NUMBER-ENUMERATION can also enumerate COMPLEX numbers, but in this
case the actual enumeration properties are completely determined by
the value of BY.
array) &key start end &allow-other-keys) ¶Calling ENUMERATE on an ARRAY returns an ARRAY-ENUMERATION instance.
START must be either an integer between 0 and (array-total-size a), or
a LIST of indices between 0 and the appropriate limit on the
array-dimension. end must be an integer between 0 and
(array-total-size A), or a LIST of indices between 0 and the
appropriate limit on the array-dimension, or NIL. If END is NIL then
it is set to (array-total-size A).
The enumeration of a multidimensional array follows the row-major
order of Common Lisp Arrays.
Examples:
;;; The following example uses ENUM:FOREACH.
cl-prompt> (foreach (e #3A(((1 2 3) (4 5 6)) ((7 8 9) (10 11 12)))
:start (list 1 0 1))
(print e))
8
9
10
11
12
NIL
hash-table) &key start end keys values key-value-pairs &allow-other-keys) ¶Calling ENUMERATE on a HASH-TABLE returns a HASH-TABLE-ENUMERATION instance.
If KEYS is true, the HASH-TABLE-ENUMERATION scans the keys of the
underlying HASH-TABLE. If VALUES is true (the default), the
HASH-TABLE-ENUMERATION scans the values of the underlying HASH-TABLE.
If KEY-VALUE-PAIRS is true, then the HASH-TABLE-ENUMERATION yields
key-values dotted pairs.
Note that it makes no sense to set "bounds" on a
HASH-TABLE-ENUMERATION, as an HASH-TABLE is an unordered data
structure. START and END are ignored.
string) &key start end &allow-other-keys) ¶Calling ENUMERATE on a STRING returns a STRING-ENUMERATION instance.
A STRING-ENUMERATION traverses the STRING s using the accessor CHAR.
START must be an integer between 0 and (length S). end must be an integer between 0 and (length S) or NIL. The usual CL semantics regarding sequence traversals applies.
vector) &key start end &allow-other-keys) ¶Calling ENUMERATE on a VECTOR returns a VECTOR-ENUMERATION instance.
START must be an integer between 0 and (length V). end must be an integer between 0 and (length V) or NIL. The usual CL semantics regarding sequence traversals applies.
list) &key start end &allow-other-keys) ¶Calling ENUMERATE on a LIST returns a LIST-ENUMERATION instance.
L should be a proper list. The behavior of ENUMERATE when passed a non
proper list is undefined.
START must be an integer between 0 and (length l). END must be an integer between 0 and (length L) or NIL. The usual CL semantics regarding sequence traversals applies.
enumeration) &key start end &allow-other-keys) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
enumeration)) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
functional-enumeration)) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
number-enumeration)) ¶array-table-enumeration)) ¶hash-table-enumeration)) ¶vector-enumeration)) ¶list-enumeration)) ¶enumeration)) ¶The generic function HAS-NEXT-P checks whether the enumeration
enumeration has another element that follows the current one in the
traversal order. If so it returns a non-NIL result, otherwise, result
is NIL.
Arguments and Values:
X : an ENUMERATION instance
result : a T.
Examples:
cl-prompt> (defvar ve (enumerate (vector 1 2 3)))
VE
cl-prompt> (has-next-p ve)
T
cl-prompt> (loop repeat 3 do (print (next ve)))
1
2
3
NIL
cl-prompt> (has-next-p ve)
NIL
Exceptional Situations:
HAS-NEXT-P signals an error (i.e., NO-APPLICABLE-METHOD is run) if X is not an ENUMERATION instance.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
number-enumeration)) ¶array-table-enumeration)) ¶hash-table-enumeration)) ¶vector-enumeration)) ¶list-enumeration)) ¶enumeration)) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
number-enumeration)) ¶array-table-enumeration)) ¶vector-enumeration)) ¶enumeration)) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
hash-table-enumeration)) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
list-enumeration)) ¶The generic function NEXT returns the "next" object in the
enumeration enumeration if there is one, as determined by calling
HAS-NEXT-P. If HAS-NEXT-P returns NIL and DEFAULT is supplied, then
DEFAULT is returned. Otherwise the condition NO-SUCH-ELEMENT is
signaled.
Arguments and Values:
E : an ENUMERATION instance
DEFAULT : a T
result : a T.
Exceptional Situations:
NEXT signals the NO-SUCH-ELEMENT condition when there are no more elements in the enumeration and no default was supplied.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
number-enumeration) &optional default) ¶array-table-enumeration) &optional default) ¶hash-table-enumeration) &optional default) ¶string-enumeration) &optional default) ¶vector-enumeration) &optional default) ¶list-enumeration) &optional default) ¶enumeration) &optional default) ¶enumeration) &optional default) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
number-enumeration)) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
number-enumeration) &optional default) ¶array-table-enumeration) &optional default) ¶string-enumeration) &optional default) ¶vector-enumeration) &optional default) ¶enumeration) &optional default) ¶enumeration) &optional default) ¶Resets the enumeration ENUM internal state to its "initial" element.
The "initial" element of the enumeration ENUM obviously depends on
the actual enumerate object.
Arguments and Values:
ENUM : an ENUMERATION instance
result : a T.
Examples:
cl-prompt> (defvar *se* (enumerate "foobar" :start 2))
*SE*
cl-prompt> (loop repeat 3 do (print (next *se*)))
#o
#b
#a
NIL
cl-prompt> (current *se*)
#r
cl-prompt> (reset *se*)
2
cl-prompt> (current *se*)
#o
cl-prompt> (loop repeat 3 do (print (next *se*)))
#o
#b
#a
NIL
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
number-enumeration)) ¶array-table-enumeration)) ¶hash-table-enumeration)) ¶vector-enumeration)) ¶list-enumeration)) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
simple-string-enumeration)) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
string-enumeration)) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
vector-enumeration)) ¶vector-enumeration) &key) ¶list-enumeration) &key) ¶array-table-enumeration) &key start end) ¶hash-table-enumeration) &key keys values key-value-pairs &allow-other-keys) ¶number-enumeration) &key) ¶number-enumeration) s) ¶enumeration) stream) ¶The condition signalled when no reasonable element is available.
Many methods (e.g., NEXT) signal this condition if no element is available in and ENUMERATION of some (enumerable) object.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
error.
:enumeration
This slot is read-only.
The Array Table Enumeration Class.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
The Bi-directional Enumeration Class. Enumerations that can be traversed back and forth.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
| Initarg | Value |
|---|---|
:start | 0 |
:end | nil |
:start
:end
The CL Extensions Enumeration Class.
The ’root’ of all the different enumeration classes.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
| Initarg | Value |
|---|---|
:object | nil |
:object
This slot is read-only.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
The Hash Table Enumeration Class.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
| Initarg | Value |
|---|---|
:keys | nil |
:values | t |
:key-value-pairs | nil |
:key-value-pairs
This slot is read-only.
The List Enumeration Class.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
number
function
:by
function
The Simple String Enumeration Class.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
The String Enumeration Class.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
fixnum
Returns the type of the elements in the underlying data structure.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
enumeration)) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
list-enumeration)) ¶automatically generated reader method
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
list-enumeration)) ¶automatically generated writer method
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
enumeration)) ¶automatically generated reader method
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
enumeration)) ¶automatically generated writer method
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
bounded-enumeration)) ¶automatically generated reader method
end.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
bounded-enumeration)) ¶automatically generated writer method
end.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
enumeration)) ¶automatically generated reader method
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
bounded-enumeration)) ¶automatically generated reader method
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
bounded-enumeration)) ¶automatically generated writer method
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
hash-table-enumeration)) ¶automatically generated reader method
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
hash-table-enumeration)) ¶automatically generated reader method
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
no-such-element)) ¶enum.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
number-enumeration)) ¶automatically generated reader method
by.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
number-enumeration)) ¶automatically generated writer method
by.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
number-enumeration)) ¶automatically generated reader method
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
number-enumeration)) ¶automatically generated writer method
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
sequence-enumeration)) ¶it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
hash-table-enumeration)) ¶automatically generated reader method
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
hash-table-enumeration)) ¶automatically generated writer method
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
hash-table-enumeration)) ¶automatically generated reader method
The Sequence Enumeration Class.
it.unimib.disco.ma.common-lisp.extensions.data-and-control-flow.enumerations.
| Jump to: | (
A B C E F G H I K L M N P R S U V |
|---|
| Jump to: | (
A B C E F G H I K L M N P R S U V |
|---|
| Jump to: | B C E K R S U V |
|---|
| Jump to: | B C E K R S U V |
|---|
| Jump to: | A B C E F H I L N P S V |
|---|
| Jump to: | A B C E F H I L N P S V |
|---|