The gtwiwtg Reference Manual

This is the gtwiwtg Reference Manual, version 0.5.0, generated automatically by Declt version 4.0 beta 2 "William Riker" on Sun Dec 08 18:17:28 2024 GMT+0.

Table of Contents


1 Introduction


2 Systems

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


2.1 gtwiwtg

Lazy-ish iterators

Author

Colin <>

License

GPLv3

Version

0.5.0

Source

gtwiwtg.asd.

Child Components

3 Files

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


3.1 Lisp


3.1.1 gtwiwtg/gtwiwtg.asd

Source

gtwiwtg.asd.

Parent Component

gtwiwtg (system).

ASDF Systems

gtwiwtg.


3.1.2 gtwiwtg/package.lisp

Source

gtwiwtg.asd.

Parent Component

gtwiwtg (system).

Packages

3.1.3 gtwiwtg/gtwiwtg.lisp

Dependency

package.lisp (file).

Source

gtwiwtg.asd.

Parent Component

gtwiwtg (system).

Public Interface
Internals

3.1.4 gtwiwtg/anaphora.lisp

Dependency

gtwiwtg.lisp (file).

Source

gtwiwtg.asd.

Parent Component

gtwiwtg (system).

Public Interface

4 Packages

Packages are listed by definition order.


4.1 gtwiwtg

Source

package.lisp.

Use List

common-lisp.

Public Interface
Internals

4.2 gtwiwtg.anaphora

Source

package.lisp.

Use List

common-lisp.

Public Interface

5 Definitions

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


5.1 Public Interface


5.1.1 Macros

Macro: afold (init generator update)

Anaphoric FOLD. Binds the values produced by GENERATOR to IT, and binds the accumulating variable to ACC.

Example:

> (afold 0 (times 10) (+ acc it))
45

Package

gtwiwtg.anaphora.

Source

anaphora.lisp.

Macro: afor (generator &body body)

Anaphoric FOR. Binds the values produced by GENERATOR to the variable IT.

Example:

> (afor (times 3) (print it))
0
1
2

Package

gtwiwtg.anaphora.

Source

anaphora.lisp.

Macro: fold ((acc init-val) (var-exp gen) expr)

The accumulating generator consumer.

ACC is a symbol and INIT-VAL is any lisp expression. ACC is where
intermediate results are accmulated. INIT-VAL is evaluated to
initialize ACC.

VAR-EXP can be either a symbol, or a form suitable for using as the
binding form in DESTRUCTURING-BIND.

GEN is an expression that should evaluate to a generator.

EXPR is a sigle lisp expression the value of which becomes bound to
ACC on each iteration.

When iteration has concluded, ACC becomes the value of the FOLD form.

Example: standard summing

> (fold (sum 0) (x (times 10)) (+ sum x))

45

Example: a usless calculation

> (fold (acc 0)
((x y) (zip! (times 10) (range :by -1)))
(sqrt (+ acc (* x y))))

#C(0.444279 8.986663)

Example: building data

> (fold (plist nil)
((key val)
(zip! (seq ’(:name :occupation :hobbies))
(seq ’("buckaroo banzai"
"rocker"
("neuroscience" "particle physics" "piloting fighter jets"))))) (cons key (cons val plist)))

(:HOBBIES ("neuroscience" "particle physics" "piloting fighter jets") :OCCUPATION "rocker" :NAME "buckaroo banzai")

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Macro: for (var-exp gen &body body)

The basic generator consumer.

VAR-EXP can be either a symbol, or a form suitable for using as the binding form in a DESTRUCTURING-BIND.

GEN is an expression that should evaluate to a generator.

BODY is a list of any forms you like. These forms will be evaluated for each value produced by GEN.

FOR akes care of running any clean up that the generator requires. E.g. If the generator is backed by an open stream, the stream will be closed. E.g. If the generator was built using FROM-THUNK-UNTIL, then the CLEAN-UP thunk will be run before FOR exits.

Every other consumer is built on top of FOR, and hence, every other consumer will also perform clean up.

Example:

(for (x y) (zip! (repeater ’a ’b ’c) (times 5))
(format t "~a – ~a~%" x y))

A – 0
B – 1
A – 2
B – 3
A – 4

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Macro: with-generator ((var gen) &body body)

Use this if you absolutely must manually call NEXT and HAS-NEXT-P. It will ensure that the generator bound to VAR will be stopped and cleaned up properly.

Package

gtwiwtg.

Source

gtwiwtg.lisp.


5.1.2 Ordinary functions

Function: argmax (fn gen)

Consumes GEN. Returns a pair (X . VALUE) such that (FUNCALL FN X)
is maximal among the values of GEN. VALUE is the value of (FUNCALL FN X)

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: argmin (fn gen)

Consumes GEN. Returns a pair (X . VALUE) such that (FUNCALL FN X)
is minimal among the values of GEN. VALUE is the value of (FUNCALL FN X)

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: average (gen)

Consumes GEN, returning its average value.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: best (chooser gen)

Consumes GEN. CHOOSER is a function of two arguments that returns one of them. Returns the member of GEN that is consistently chosen. Chooser should be transitive. Returns NIL if GEN is empty.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: collect (gen)

Consumes GEN by collecting its values into a list.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: concat! (gen &rest gens)

Returns a generator that is the concatenation of the generators
passed as arguments.

Error Conditions:
- If any of the generators compare EQL, an error will be signalled.
- If any of the generators has been used elsewhere, an error will be sigalled.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: file-bytes (file)

Creates a generator that produces the bytes of a file. The stream to the file is closed when the generator finishes.

FILE is a path to a file.

The last generated value of the returned generator will be NIL.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: file-chars (file)

Creates a generator that produces the characters of a file. The stream to the file is closed when the generator finishes.

FILE is a path to a file.

The last generated value of the returned generator will be NIL.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: file-lines (file)

Creates a generator that produces the lines of a file. See FROM-INPUT-STREAM for more details about stream-backed-generators.

FILE is a path to a file.

The last generated value of the returned generator will be NIL.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: filter! (pred gen)

Creats a generator that generates the values of GEN for which PRED is non null.

Error Condition:
- If GEN has been used elsewhere, an error will be signalled.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: from-input-stream (stream stream-reader)

Create a generator from a STREAM.

You must supply as STREAM-READER function that accepts the stream as its only argument and returns NIL when the stream has run out of data, Non-NIL otherwise.

The new generator will return NIL as its final generated value..

Consumers of the new generator (forms like FOR, FOLD, COLLECT, and so on) will ensure that the stream is properly closed - you don’t need to worry. If, however, you create a stream-backed-generator but do not actually consume it, then the stream will not be properly closed. Always consume your generators by passing them to a consumer!

Here is an example:

(take 2 (from-input-stream
(open "hey.txt")
(lambda (s) (read-char s nil nil))))

(#\h #\e)

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: from-recurrence (rec n-1 &rest n-m)

Creates a generator from a recurrence relation.

REC is a function of M arguments.

The Nth value of the series generated by the new generator is the result of calling REC on the previoius M results.

N-1 and N-M are used to initialize the recurrence. (1+ (LENGTH N-M)) should be M, the number of arguments acepted by REC.

Example

> (let ((fibs (from-recurrence #’+ 1 0)))
(take 10 fibs))

(1 2 3 5 8 13 21 34 55 89)

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: from-thunk (thunk)

Creates a generator that produces an inifinte series of values that are the return value of (FUNCALL THUNK).

If you need to create a stopping condition on your thunk-backed generator, see FROM-THUNK-UNTIL.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: from-thunk-times (thunk times)

Creates a generator that produces its values by calling (FUNCALL THUNK) exactly TIMES times.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: from-thunk-until (thunk &key until clean-up)

Creates a generator that produces a series of values by successively calling (FUNCALL THUNK). The iterator stops whenever (FUNCALL UNTIL) is non null.

If a CLEAN-UP thunk is supplied, it will be run after the consumption of the new generator has finished. (Consumers are forms like FOR, COLLECT, FOLD, and so on.)

By default, UNTIL is the function (CONSTANTLY NIL). I.e. it will generate forever.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: indexed! (gen)

Is shorthand for (ZIP! (RANGE) GEN)

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: inflate! (fn gen &key extra-cleanup)

FN is expected to be a function that accepts elements of GEN and
returns a new generator.

The generator (INFLATE! FN GEN) generates each element of an
intermediate generator (FN X) for each X generated by GEN.

When a thunk is supplied to EXTRA-CLEANUP, then that thunk will be
called when the inflated generator is stopped. EXTRA-CLEANUP exists
for the case when FN returns generators that are not being created
within the body of FN, but are merely being "looked up" somehow. See
the implementation of CONCAT! for an example.

Here is an example:

> (let ((keys (seq ’(:name :occupation :hobbies)))
(vals (seq ’("buckaroo banzai"
"rocker"
("neuroscience" "particle physics" "piloting fighter jets"))))) (collect (inflate! #’seq (zip! keys vals))))

(:NAME "buckaroo banzai"
:OCCUPATION "rocker"
:HOBBIES ("neuroscience" "particle physics" "piloting fighter jets"))

Error Conditions:
- If GEN has been used elsewhere, an error will be signalled.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: inject! (fn gen)

Injects an effect into a generator. Use this to add a side-effect to the value generation process.

Under most circumstances, the new generator produces exactly the same values as GEN. If, however, the values generated by GEN are being looked up in some remote memory location, and if FN is mutating that memory, then the new generator may produce different values.

Possibly good for debugging.

Example:

> (map! #’reverse
(inject! #’print ; look at values before they’re reversed (zip! (range)
(repeater :cool :beans)
(seq "banzai!"))))

> (collect *)

(0 :COOL #b) ;these are printed to stdout
(1 :BEANS #a)
(2 :COOL #n)
(3 :BEANS #z)
(4 :COOL #a)
(5 :BEANS #i)

((#b :COOL 0) ; and this is what collect returns
(#a :BEANS 1)
(#n :COOL 2)
(#z :BEANS 3)
(#a :COOL 4)
(#i :BEANS 5))

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: intersperse! (gen1 gen2 &rest gens)

Produces a generator that intersperses one value from each of its argument generators, one after the other, until any of those generators run out of values.

Examples:

> (intersperse! (seq ’(:name :job :hobbies))
(seq ’("buckaroo banzai" "rocker" ("neuroscience"
"particle physics"
"flying fighter jets"))))

> (collect *)

(:NAME "buckaroo banzai" :JOB "rocker" :HOBBIES ("neuroscience" "particle physics" "flying fighter jets"))

> (intersperse! (times 5) (repeater ’a ’b ’c) (range :by -10))

> (collect *)

(0 A 0 1 B -10 2 C -20 3 A -30 4 B -40)

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: make-resumable! (gen)

Makes a generator resumable.

> (defvar *foobar* (make-resumable! (range))) *FOOBAR*

> (take 10 *foobar*)
(0 1 2 3 4 5 6 7 8 9)

> (setf *foobar* (resume! *foobar*))

> (take 10 *foobar*)
(10 11 12 13 14 15 16 17 18 19)

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: map! (map-fn gen &rest gens)

Maps a function over a number of generators, returning a generator
that produces values that result from calling MAP-FN on those
generators’ values, in sequence.

The resulting generator will stop producing values as soon as any one
of the source generators runs out of arguments to pass to
MAP-FN. I.e. The new generator is as long as the shortest argument.

Error Conditions:
- If any of the generators compare EQL an error will be signalled
- If any of the generators have been used elsewhere, an error will be signalled.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: maximum (gen)

Consumes GEN, returning its maximum value.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: merge! (comparator gen1 gen2 &rest gens)

Emulates the behavior of MERGE (in the ANSI standard), but for generators.

The emulation is not perfect, but it holds in the following sense: If
all the inputs are sorted according to COMPARATOR then the output will
also be sorted according to COMPARATOR.

The generator created through a merge has a length that is the sum of
the lengths of the arguments to MERGE!. Hence, if any of the arguments
is an infinite generator, then the new generator is also infinite.

An example:

> (collect (merge! #’<
(times 4)
(range :from 4 :to 10 :by 2)
(range :from -10 :to 28 :by 6)))

(-10 -4 0 1 2 2 3 4 6 8 8 14 20 26)

Error Conditions:
- If any of the generators compare EQL, an error will be signalled.
- If any of the generators have been used elsewhere, an error will be signalled.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: minimum (gen)

Consumes GEN, returning its minimum value.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: noise (&optional arg)

Creates a generator that produces an infinite series of random numbers that are the result of calling (RANDOM ARG).

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: pick-out (indexes gen)

Consumes GEN by picking out certain members by their index.

INDEXES is a list of non-negative integers.

Returns a list of values from GEN such that each value was an element of indexes.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: range (&key from to by inclusive)

Create a generator that produces a series of numbers between FROM and TO with a step size of BY.

When INCLUSIVE is non NIL, then TO will be produced by the generator if it would be the last member of generate series.

E.g.

> (collect (range :to 10))

(0 1 2 3 4 5 6 7 8 9)

> (collect (range :to 10 :inclusive t))

(0 1 2 3 4 5 6 7 8 9 10)

> (collect (range :to 10 :by 2 :inclusive t))

(0 2 4 6 8 10)

> (collect (range :to 10 :by 3 :inclusive t))

(0 3 6 9)

If TO is NIL, then the generator produces an infinite series of values.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: repeater (&rest args)

Creates a generator that produces an infinite series consisting in the the values of ARGS looped forever.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: resume! (resumable)

Resumes a resumable generator. Creates a new generator from RESUMABLE.

A particular resumable generator instance can only be resumed once. Here is how you would resume a generator several times:

> (defvar *foobar* (make-resumable! (range)))
*FOOBAR*

> (take 10 *foobar*)
(0 1 2 3 4 5 6 7 8 9)

> (defvar *new-foobar* (resume! *foobar*))

> (defvar *wont-work* (resume! *foobar*)) ;; THROWS AN ERROR

> (take 10 *new-foobar*)
(10 11 12 13 14 15 16 17 18 19)

;; but *new-foobar* can be resumed
> (setf *new-foobar* (resume! *new-foobar*))

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: seq (sequence &key start)

Turns a sequecne (a list, vector, string, etc) into a
generator. The resulting generator will generate exactly the members of the sequence.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: size (gen)

Consumes GEN by calculating its size.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: take (n gen)

Consumes GEN by collecting its first N values into a list

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: times (n)

Shorthand for (RANGE :TO N)

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: truncate! (n gen)

Shrinks a generator to generate a series of at most N values.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: zip! (gen &rest gens)

Is a shortcut for (MAP! #’LIST GEN1 GEN2 ...)

Package

gtwiwtg.

Source

gtwiwtg.lisp.


5.2 Internals


5.2.1 Macros

Macro: a-generator-class (name supers &body slots)
Package

gtwiwtg.

Source

gtwiwtg.lisp.


5.2.2 Ordinary functions

Function: all-clean (gens)
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: all-different (things)
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: all-good (gens)
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: can-be-resumed-p (gen)
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: make-dirty (g)
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: make-keyword (symb)
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: resumablep (gen)
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Function: sully-when-clean (gens)
Package

gtwiwtg.

Source

gtwiwtg.lisp.


5.2.3 Generic functions

Generic Reader: dirty-p (object)
Generic Writer: (setf dirty-p) (object)
Package

gtwiwtg.

Methods
Reader Method: dirty-p ((generator! generator!))
Writer Method: (setf dirty-p) ((generator! generator!))

Indicates whether or not this generator has
generated any values yet, or if it should behave as if it has.

Source

gtwiwtg.lisp.

Target Slot

dirty-p.

Generic Function: has-next-p (gen)

Returns true if next can be called on the generator GEN.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Methods
Method: has-next-p ((gen resumable-generator!))
Method: has-next-p ((gen filtered-generator!))
Method: has-next-p ((g stream-backed-generator!))
Method: has-next-p ((g thunk-backed-generator!))
Method: has-next-p ((g list-backed-generator!))
Method: has-next-p ((g sequence-backed-generator!))
Method: has-next-p ((g range-backed-generator!))
Method: has-next-p :around ((g generator!))
Generic Function: next (gen)

Returns the next value of the generator GEN, if
available. Unspecified behavior if the GEN has been exhausted.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Methods
Method: next ((gen resumable-generator!))
Method: next ((gen filtered-generator!))
Method: next ((g stream-backed-generator!))
Method: next ((g thunk-backed-generator!))
Method: next ((g list-backed-generator!))
Method: next ((g sequence-backed-generator!))
Method: next ((g range-backed-generator!))
Generic Function: stop (gen)

Explicitly stops the generator. Specialize :after
methods to implement any clean up that needs to be done when the generator has been consumed.

Package

gtwiwtg.

Source

gtwiwtg.lisp.

Methods
Method: stop :after ((gen filtered-generator!))
Method: stop :after ((g stream-backed-generator!))
Method: stop :after ((g thunk-backed-generator!))
Method: stop ((g generator!))
Generic Reader: stopped-p (object)
Generic Writer: (setf stopped-p) (object)
Package

gtwiwtg.

Methods
Reader Method: stopped-p ((generator! generator!))
Writer Method: (setf stopped-p) ((generator! generator!))

Indicates whether or not this generator has been
explicitly stopped. All consumers explicitly stop the generators they consume.

Source

gtwiwtg.lisp.

Target Slot

stopped-p.


5.2.4 Classes

Class: filtered-generator!
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Direct superclasses

generator!.

Direct methods
Direct slots
Slot: on-deck
Initform

(list)

Initargs

:on-deck

Slot: source-generator
Initform

(error "filtered generator must have a source")

Initargs

:source-generator

Slot: predicate
Initform

(error "filtered generator must have a predicate")

Initargs

:predicate

Class: generator!
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Direct subclasses
Direct methods
Direct slots
Slot: dirty-p

Indicates whether or not this generator has
generated any values yet, or if it should behave as if it has.

Readers

dirty-p.

Writers

(setf dirty-p).

Slot: stopped-p

Indicates whether or not this generator has been
explicitly stopped. All consumers explicitly stop the generators they consume.

Readers

stopped-p.

Writers

(setf stopped-p).

Class: list-backed-generator!
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Direct superclasses

generator!.

Direct methods
Direct slots
Slot: list
Package

common-lisp.

Initargs

:list

Class: range-backed-generator!
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Direct superclasses

generator!.

Direct methods
Direct slots
Slot: at
Initform

0

Initargs

:at

Slot: to
Initargs

:to

Slot: by
Initform

1

Initargs

:by

Slot: comparator
Initform

(function <)

Initargs

:comparator

Class: resumable-generator!
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Direct superclasses

generator!.

Direct methods
Direct slots
Slot: already-resumed-p
Initargs

:already-resumed-p

Slot: wrapped
Initform

(error "resumable generators must wrap another generator")

Initargs

:wrapped

Class: sequence-backed-generator!
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Direct superclasses

generator!.

Direct methods
Direct slots
Slot: sequence
Package

common-lisp.

Initargs

:sequence

Slot: index
Initargs

:index

Class: stream-backed-generator!
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Direct superclasses

generator!.

Direct methods
Direct slots
Slot: stream
Package

common-lisp.

Initargs

:stream

Slot: reader
Initargs

:reader

Class: thunk-backed-generator!
Package

gtwiwtg.

Source

gtwiwtg.lisp.

Direct superclasses

generator!.

Direct methods
Direct slots
Slot: next-p-fn
Initargs

:next-p-fn

Slot: next-fn
Initargs

:next-fn

Slot: stop-fn
Initargs

:stop-fn


Appendix A Indexes


A.1 Concepts


A.2 Functions

Jump to:   (  
A   B   C   D   F   G   H   I   M   N   P   R   S   T   W   Z  
Index Entry  Section

(
(setf dirty-p): Private generic functions
(setf dirty-p): Private generic functions
(setf stopped-p): Private generic functions
(setf stopped-p): Private generic functions

A
a-generator-class: Private macros
afold: Public macros
afor: Public macros
all-clean: Private ordinary functions
all-different: Private ordinary functions
all-good: Private ordinary functions
argmax: Public ordinary functions
argmin: Public ordinary functions
average: Public ordinary functions

B
best: Public ordinary functions

C
can-be-resumed-p: Private ordinary functions
collect: Public ordinary functions
concat!: Public ordinary functions

D
dirty-p: Private generic functions
dirty-p: Private generic functions

F
file-bytes: Public ordinary functions
file-chars: Public ordinary functions
file-lines: Public ordinary functions
filter!: Public ordinary functions
fold: Public macros
for: Public macros
from-input-stream: Public ordinary functions
from-recurrence: Public ordinary functions
from-thunk: Public ordinary functions
from-thunk-times: Public ordinary functions
from-thunk-until: Public ordinary functions
Function, all-clean: Private ordinary functions
Function, all-different: Private ordinary functions
Function, all-good: Private ordinary functions
Function, argmax: Public ordinary functions
Function, argmin: Public ordinary functions
Function, average: Public ordinary functions
Function, best: Public ordinary functions
Function, can-be-resumed-p: Private ordinary functions
Function, collect: Public ordinary functions
Function, concat!: Public ordinary functions
Function, file-bytes: Public ordinary functions
Function, file-chars: Public ordinary functions
Function, file-lines: Public ordinary functions
Function, filter!: Public ordinary functions
Function, from-input-stream: Public ordinary functions
Function, from-recurrence: Public ordinary functions
Function, from-thunk: Public ordinary functions
Function, from-thunk-times: Public ordinary functions
Function, from-thunk-until: Public ordinary functions
Function, indexed!: Public ordinary functions
Function, inflate!: Public ordinary functions
Function, inject!: Public ordinary functions
Function, intersperse!: Public ordinary functions
Function, make-dirty: Private ordinary functions
Function, make-keyword: Private ordinary functions
Function, make-resumable!: Public ordinary functions
Function, map!: Public ordinary functions
Function, maximum: Public ordinary functions
Function, merge!: Public ordinary functions
Function, minimum: Public ordinary functions
Function, noise: Public ordinary functions
Function, pick-out: Public ordinary functions
Function, range: Public ordinary functions
Function, repeater: Public ordinary functions
Function, resumablep: Private ordinary functions
Function, resume!: Public ordinary functions
Function, seq: Public ordinary functions
Function, size: Public ordinary functions
Function, sully-when-clean: Private ordinary functions
Function, take: Public ordinary functions
Function, times: Public ordinary functions
Function, truncate!: Public ordinary functions
Function, zip!: Public ordinary functions

G
Generic Function, (setf dirty-p): Private generic functions
Generic Function, (setf stopped-p): Private generic functions
Generic Function, dirty-p: Private generic functions
Generic Function, has-next-p: Private generic functions
Generic Function, next: Private generic functions
Generic Function, stop: Private generic functions
Generic Function, stopped-p: Private generic functions

H
has-next-p: Private generic functions
has-next-p: Private generic functions
has-next-p: Private generic functions
has-next-p: Private generic functions
has-next-p: Private generic functions
has-next-p: Private generic functions
has-next-p: Private generic functions
has-next-p: Private generic functions
has-next-p: Private generic functions

I
indexed!: Public ordinary functions
inflate!: Public ordinary functions
inject!: Public ordinary functions
intersperse!: Public ordinary functions

M
Macro, a-generator-class: Private macros
Macro, afold: Public macros
Macro, afor: Public macros
Macro, fold: Public macros
Macro, for: Public macros
Macro, with-generator: Public macros
make-dirty: Private ordinary functions
make-keyword: Private ordinary functions
make-resumable!: Public ordinary functions
map!: Public ordinary functions
maximum: Public ordinary functions
merge!: Public ordinary functions
Method, (setf dirty-p): Private generic functions
Method, (setf stopped-p): Private generic functions
Method, dirty-p: Private generic functions
Method, has-next-p: Private generic functions
Method, has-next-p: Private generic functions
Method, has-next-p: Private generic functions
Method, has-next-p: Private generic functions
Method, has-next-p: Private generic functions
Method, has-next-p: Private generic functions
Method, has-next-p: Private generic functions
Method, has-next-p: Private generic functions
Method, next: Private generic functions
Method, next: Private generic functions
Method, next: Private generic functions
Method, next: Private generic functions
Method, next: Private generic functions
Method, next: Private generic functions
Method, next: Private generic functions
Method, stop: Private generic functions
Method, stop: Private generic functions
Method, stop: Private generic functions
Method, stop: Private generic functions
Method, stopped-p: Private generic functions
minimum: Public ordinary functions

N
next: Private generic functions
next: Private generic functions
next: Private generic functions
next: Private generic functions
next: Private generic functions
next: Private generic functions
next: Private generic functions
next: Private generic functions
noise: Public ordinary functions

P
pick-out: Public ordinary functions

R
range: Public ordinary functions
repeater: Public ordinary functions
resumablep: Private ordinary functions
resume!: Public ordinary functions

S
seq: Public ordinary functions
size: Public ordinary functions
stop: Private generic functions
stop: Private generic functions
stop: Private generic functions
stop: Private generic functions
stop: Private generic functions
stopped-p: Private generic functions
stopped-p: Private generic functions
sully-when-clean: Private ordinary functions

T
take: Public ordinary functions
times: Public ordinary functions
truncate!: Public ordinary functions

W
with-generator: Public macros

Z
zip!: Public ordinary functions


A.4 Data types