diff options
author | Neil Jerram <neil@ossau.uklinux.net> | 2011-02-13 22:13:33 +0000 |
---|---|---|
committer | Neil Jerram <neil@ossau.uklinux.net> | 2011-02-13 22:13:33 +0000 |
commit | 679cceeda4e45ac03a10cc9c8adac1446571dd9a (patch) | |
tree | 07f5ec087c9de83847f7303e6cfbe7d81a16043b /doc/ref/srfi-modules.texi | |
parent | 4827afeb133db687eed06482bd912962da81c54b (diff) | |
download | guile-679cceeda4e45ac03a10cc9c8adac1446571dd9a.tar.gz |
Misc textual editing
* doc/ref/api-scheduling.texi (Asyncs): "queueing" -> "queuing".
* benchmark-suite/lib.scm, doc/sources/unix.texi (Unix conventions),
test-suite/lib.scm: "postpend" -> "append".
* doc/ref/api-compound.texi (Array Syntax, Dictionary Types),
doc/ref/api-control.texi (Catch), doc/ref/api-data.texi (Complex
Numbers, Conversion, Random, Symbol Props, Symbol Uninterned),
doc/ref/api-options.texi (Build Config, Common Feature Symbols),
doc/ref/api-regex.texi (Match Structures),
doc/ref/api-undocumented.texi, doc/ref/compiler.texi (Tree-IL,
GLIL), doc/ref/data-rep.texi (Immediate objects), doc/ref/goops.texi
(Slot Description Example), doc/ref/history.texi (A Scheme of Many
Maintainers, Status), doc/ref/libguile-program.texi (Available
Functionality), doc/ref/misc-modules.texi (Formatted Output),
doc/ref/mod-getopt-long.texi (getopt-long Reference),
doc/ref/posix.texi (Network Socket Address, Network Sockets and
Communication), doc/ref/srfi-modules.texi (SRFI-1 Association Lists,
SRFI-10, SRFI-19 String to date, SRFI-27 Random Sources),
doc/ref/vm.texi (Instruction Set, Top-Level Environment
Instructions, Procedure Call and Return Instructions),
doc/sources/unix.texi (Unix conventions): Correct spacing after
"i.e." and "e.g.".
Diffstat (limited to 'doc/ref/srfi-modules.texi')
-rw-r--r-- | doc/ref/srfi-modules.texi | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/doc/ref/srfi-modules.texi b/doc/ref/srfi-modules.texi index a6b98eeb4..bda7cbb37 100644 --- a/doc/ref/srfi-modules.texi +++ b/doc/ref/srfi-modules.texi @@ -976,7 +976,7 @@ extends the core @code{assoc} (@pxref{Retrieving Alist Entries}) by taking an optional @var{=} comparison procedure. The default comparison is @code{equal?}. If an @var{=} parameter is -given it's called @code{(@var{=} @var{key} @var{alistcar})}, ie. the +given it's called @code{(@var{=} @var{key} @var{alistcar})}, i.e.@: the given target @var{key} is the first argument, and a @code{car} from @var{alist} is second. @@ -1013,7 +1013,7 @@ elements will be in the same order as they were in @var{alist}. Equality is determined by the @var{=} predicate, or @code{equal?} if not given. The order in which elements are tested is unspecified, but -each equality call is made @code{(= key alistkey)}, ie. the given +each equality call is made @code{(= key alistkey)}, i.e.@: the given @var{key} parameter is first and the key from @var{alist} second. This means for instance all associations with a key greater than 5 can be removed with @code{(alist-delete 5 alist <)}. @@ -1978,7 +1978,7 @@ parameters. @var{tag}s are registered with the following procedure. @deffn {Scheme Procedure} define-reader-ctor tag proc Register @var{proc} as the constructor for a hash-comma read syntax -starting with symbol @var{tag}, ie. @nicode{#,(@var{tag} arg@dots{})}. +starting with symbol @var{tag}, i.e.@: @nicode{#,(@var{tag} arg@dots{})}. @var{proc} is called with the given arguments @code{(@var{proc} arg@dots{})} and the object it returns is the result of the read. @end deffn @@ -3010,7 +3010,7 @@ locale. @cindex date, from string @c FIXME: Can we say what happens when an incomplete date is -@c converted? Ie. fields left as 0, or what? The spec seems to be +@c converted? I.e. fields left as 0, or what? The spec seems to be @c silent on this. @defun string->date input template @@ -3337,7 +3337,7 @@ with the following procedures: @defunx random-source-state-set! source state Get and set the state of a random source. No assumptions should be made about the nature of the state object, besides it having an external -representation (i.e. it can be passed to @code{write} and subsequently +representation (i.e.@: it can be passed to @code{write} and subsequently @code{read} back). @end defun |