[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Guile-commits] GNU Guile branch, master, updated. release_1-9-6-7-g72b3
|
From: |
Neil Jerram |
|
Subject: |
[Guile-commits] GNU Guile branch, master, updated. release_1-9-6-7-g72b3aa5 |
|
Date: |
Fri, 18 Dec 2009 00:59:13 +0000 |
This is an automated email from the git hooks/post-receive script. It was
generated because a ref change was pushed to the repository containing
the project "GNU Guile".
http://git.savannah.gnu.org/cgit/guile.git/commit/?id=72b3aa56afc776506a0b51c008c808a536a4f1c3
The branch, master has been updated
via 72b3aa56afc776506a0b51c008c808a536a4f1c3 (commit)
via 2e4ef7eda16ccf708f9822573d016567eb916f43 (commit)
via 93b645239b8518c7fe449663a9611008497038e4 (commit)
via 8d7ee181bee73bb755cbd3167f868e78e6647e68 (commit)
from e163dd343b17120f342b597fe03efa854ad34566 (commit)
Those revisions listed above that are new to this repository have
not appeared on any other notification email; so we list those
revisions in full, below.
- Log -----------------------------------------------------------------
commit 72b3aa56afc776506a0b51c008c808a536a4f1c3
Author: Brian Gough <address@hidden>
Date: Tue Dec 15 10:16:14 2009 +0000
more typo fixes
More spelling corrections and fixes for doubled words (e.g. "the the")
--
Brian Gough
Network Theory Ltd,
Publishing Free Software Manuals --- http://www.network-theory.co.uk/
>From 7be02beedc739c32cce2c8ec8f4ac814c994a13f Mon Sep 17 00:00:00 2001
From: Brian Gough <address@hidden>
Date: Mon, 14 Dec 2009 22:06:22 +0000
Subject: [PATCH] fix various documentation typos (spelling & doubled words)
commit 2e4ef7eda16ccf708f9822573d016567eb916f43
Author: Brian Gough <address@hidden>
Date: Tue Dec 15 10:14:48 2009 +0000
typo fix
Correction for garbled sentence.
--
Brian Gough
Network Theory Ltd,
Publishing Free Software Manuals --- http://www.network-theory.co.uk/
>From f819b597a46ad4ed23597e5a81d1acab46f15147 Mon Sep 17 00:00:00 2001
From: Brian Gough <address@hidden>
Date: Mon, 14 Dec 2009 20:04:34 +0000
Subject: [PATCH] typo fix
commit 93b645239b8518c7fe449663a9611008497038e4
Author: Brian Gough <address@hidden>
Date: Tue Dec 15 10:12:07 2009 +0000
added brief introduction about SLIB
This patch adds a short introduction to the SLIB section of the manual
with a link to the SLIB homepage.
--
Brian Gough
Network Theory Ltd,
Publishing Free Software Manuals --- http://www.network-theory.co.uk/
>From 60548b6e039bf57694b7841996cfda011cb8a4bf Mon Sep 17 00:00:00 2001
From: Brian Gough <address@hidden>
Date: Mon, 14 Dec 2009 20:49:27 +0000
Subject: [PATCH] added brief introduction about SLIB
commit 8d7ee181bee73bb755cbd3167f868e78e6647e68
Author: Brian Gough <address@hidden>
Date: Mon Dec 14 22:19:32 2009 +0000
Hash Table examples - hashq takes different number of arguments
In the "Hash Tables Example" in the manual, hashq needs 2 arguments
instead of 1 (patch below). I've updated the hash table output as
well to match the current version.
--
Brian Gough
Network Theory Ltd,
Publishing Free Software Manuals --- http://www.network-theory.co.uk/
>From fdb6101d2e064620746ebfc9f9cd28bbdd2470e8 Mon Sep 17 00:00:00 2001
From: Brian Gough <address@hidden>
Date: Mon, 14 Dec 2009 19:59:32 +0000
Subject: [PATCH] update docs for Hash Table Examples
hashq now takes two arguments
order of elements in hash table is different now
-----------------------------------------------------------------------
Summary of changes:
doc/ref/api-compound.texi | 24 ++++++++++++------------
doc/ref/api-control.texi | 2 +-
doc/ref/api-data.texi | 2 +-
doc/ref/api-i18n.texi | 2 +-
doc/ref/api-io.texi | 2 +-
doc/ref/api-procedures.texi | 2 +-
doc/ref/api-utility.texi | 4 ++--
doc/ref/history.texi | 6 +++---
doc/ref/libguile-concepts.texi | 8 ++++----
doc/ref/libguile-smobs.texi | 2 +-
doc/ref/libguile-snarf.texi | 2 +-
doc/ref/misc-modules.texi | 4 ++--
doc/ref/scheme-scripts.texi | 2 +-
doc/ref/slib.texi | 11 +++++++++--
doc/ref/srfi-modules.texi | 6 +++---
15 files changed, 43 insertions(+), 36 deletions(-)
diff --git a/doc/ref/api-compound.texi b/doc/ref/api-compound.texi
index 059390b..5c1bd88 100644
--- a/doc/ref/api-compound.texi
+++ b/doc/ref/api-compound.texi
@@ -470,7 +470,7 @@ Return a list comprising the elements of @var{lst}, in
reverse order.
@code{reverse} constructs a new list, @code{reverse!} modifies
@var{lst} in constructing its return.
-For @code{reverse!}, the optional @var{newtail} is appended to to the
+For @code{reverse!}, the optional @var{newtail} is appended to the
result. @var{newtail} isn't reversed, it simply becomes the list
tail. For @code{scm_reverse_x}, the @var{newtail} parameter is
mandatory, but can be @code{SCM_EOL} if no further tail is required.
@@ -1057,7 +1057,7 @@ being a @code{double}
The external representation (ie.@: read syntax) for these vectors is
similar to normal Scheme vectors, but with an additional tag from the
-table above indiciating the vector's type. For example,
+table above indicating the vector's type. For example,
@lisp
#u16(1 2 3)
@@ -1475,7 +1475,7 @@ are displayed as a sequence of @code{0}s and @code{1}s
prefixed by
#*00000000
@end example
-Bit vectors are are also generalized vectors, @xref{Generalized
+Bit vectors are also generalized vectors, @xref{Generalized
Vectors}, and can thus be used with the array procedures, @xref{Arrays}.
Bit vectors are the special case of one dimensional bit arrays.
@@ -1567,7 +1567,7 @@ Return a count of how many entries in @var{bitvector} are
equal to
@deffn {Scheme Procedure} bit-position bool bitvector start
@deffnx {C Function} scm_bit_position (bool, bitvector, start)
-Return the index of the first occurrance of @var{bool} in
+Return the index of the first occurrence of @var{bool} in
@var{bitvector}, starting from @var{start}. If there is no @var{bool}
entry between @var{start} and the end of @var{bitvector}, then return
@code{#f}. For example,
@@ -1777,7 +1777,7 @@ In more words, the array tag is of the form
where @code{<rank>} is a positive integer in decimal giving the rank of
the array. It is omitted when the rank is 1 and the array is non-shared
and has zero-origin (see below). For shared arrays and for a non-zero
-origin, the rank is always printed even when it is 1 to dinstinguish
+origin, the rank is always printed even when it is 1 to distinguish
them from ordinary vectors.
The @code{<vectag>} part is the tag for a uniform numeric vector, like
@@ -1902,7 +1902,7 @@ Equivalent to @code{(make-typed-array #t @var{fill}
@var{bound} ...)}.
Create and return an array that has as many dimensions as there are
@var{bound}s and (maybe) fill it with @var{fill}.
-The underlaying storage vector is created according to @var{type},
+The underlying storage vector is created according to @var{type},
which must be a symbol whose name is the `vectag' of the array as
explained above, or @code{#t} for ordinary, non-specialized arrays.
@@ -2025,7 +2025,7 @@ For example,
@deffn {Scheme Procedure} array-shape array
@deffnx {Scheme Procedure} array-dimensions array
@deffnx {C Function} scm_array_dimensions (array)
-Return a list of the bounds for each dimenson of @var{array}.
+Return a list of the bounds for each dimension of @var{array}.
@code{array-shape} gives @code{(@var{lower} @var{upper})} for each
dimension. @code{array-dimensions} instead returns just
@@ -2485,7 +2485,7 @@ for (i = 0; i < RANK; i++)
Compute the position corresponding to @var{indices}, a list of
indices. The position is computed as described above for
@code{scm_array_handle_dims}. The number of the indices and their
-range is checked and an approrpiate error is signalled for invalid
+range is checked and an appropriate error is signalled for invalid
indices.
@end deftypefn
@@ -3379,7 +3379,7 @@ Return the value from the first entry in @var{alist} with
the given
@code{eqv?} and @code{assoc-ref} uses @code{equal?}.
Notice these functions have the @var{key} argument last, like other
address@hidden functions, but this is opposite to what what @code{assq}
address@hidden functions, but this is opposite to what @code{assq}
etc above use.
When the return is @code{#f} it can be either @var{key} not found, or
@@ -3626,11 +3626,11 @@ h
;; entry is at index (hashq 'frob).
h
@result{}
-#(() () () () ((frob . #f) (braz . "zonk")) () ((foo . "bar")))
+#(((braz . "zonk")) ((foo . "bar")) () () () () ((frob . #f)))
-(hashq 'frob)
+(hashq 'frob 7)
@result{}
-4
+6
@end lisp
diff --git a/doc/ref/api-control.texi b/doc/ref/api-control.texi
index 66fb99e..b220355 100644
--- a/doc/ref/api-control.texi
+++ b/doc/ref/api-control.texi
@@ -1284,7 +1284,7 @@ table.
@table @code
@item SCM_F_DYNWIND_REWINDABLE
The dynamic context is @dfn{rewindable}. This means that it can be
-reentered non-locally (via the invokation of a continuation). The
+reentered non-locally (via the invocation of a continuation). The
default is that a dynwind context can not be reentered non-locally.
@end table
diff --git a/doc/ref/api-data.texi b/doc/ref/api-data.texi
index 3096b35..81f44de 100755
--- a/doc/ref/api-data.texi
+++ b/doc/ref/api-data.texi
@@ -3477,7 +3477,7 @@ with the strings in the list @var{ls}.
@deffn {Scheme Procedure} string-concatenate-reverse/shared ls [final_string
[end]]
@deffnx {C Function} scm_string_concatenate_reverse_shared (ls, final_string,
end)
Like @code{string-concatenate-reverse}, but the result may
-share memory with the the strings in the @var{ls} arguments.
+share memory with the strings in the @var{ls} arguments.
@end deffn
@node Mapping Folding and Unfolding
diff --git a/doc/ref/api-i18n.texi b/doc/ref/api-i18n.texi
index 8bc9896..ee76544 100644
--- a/doc/ref/api-i18n.texi
+++ b/doc/ref/api-i18n.texi
@@ -459,7 +459,7 @@ be used (@pxref{Gettext Support}).
Example uses of some of these functions are the implementation of the
@code{number->locale-string} and @code{monetary-amount->locale-string}
procedures (@pxref{Number Input and Output}), as well as that the
-SRFI-19 date and time convertion to/from strings (@pxref{SRFI-19}).
+SRFI-19 date and time conversion to/from strings (@pxref{SRFI-19}).
@node Gettext Support, , Accessing Locale Information, Internationalization
diff --git a/doc/ref/api-io.texi b/doc/ref/api-io.texi
index b64ff67..eb5338c 100644
--- a/doc/ref/api-io.texi
+++ b/doc/ref/api-io.texi
@@ -114,7 +114,7 @@ encoding names are those
@end deffn
@defvr {Scheme Variable} %default-port-encoding
-A fluid containing containing @code{#f} or the name of the encoding to
+A fluid containing @code{#f} or the name of the encoding to
be used by default for newly created ports (@pxref{Fluids and Dynamic
States}). The value @code{#f} is equivalent to @code{"ISO-8859-1"}.
diff --git a/doc/ref/api-procedures.texi b/doc/ref/api-procedures.texi
index 9609fef..0f89612 100644
--- a/doc/ref/api-procedures.texi
+++ b/doc/ref/api-procedures.texi
@@ -36,7 +36,7 @@ When a procedure created by @code{lambda} is called with some
actual
arguments, the environment enclosed in the procedure is extended by
binding the variables named in the formal argument list to new locations
and storing the actual arguments into these locations. Then the body of
-the @code{lambda} expression is evaluation sequentially. The result of
+the @code{lambda} expression is evaluated sequentially. The result of
the last expression in the procedure body is then the result of the
procedure invocation.
diff --git a/doc/ref/api-utility.texi b/doc/ref/api-utility.texi
index 4a90212..edc002b 100644
--- a/doc/ref/api-utility.texi
+++ b/doc/ref/api-utility.texi
@@ -138,7 +138,7 @@ Return @code{#t} if @var{x} and @var{y} are the same type,
and their
contents or value are equal.
For a pair, string, vector, array or structure, @code{equal?} compares the
-contents, and does so using using the same @code{equal?} recursively,
+contents, and does so using the same @code{equal?} recursively,
so a deep structure can be traversed.
@example
@@ -819,7 +819,7 @@ accessible from C with the name @code{scm_after_gc_hook}.)
@end defvr
All the C hooks listed here have type @code{SCM_C_HOOK_NORMAL}, are
-initialized with hook closure data NULL, are are invoked by
+initialized with hook closure data NULL, are invoked by
@code{scm_c_hook_run} with call closure data NULL.
@cindex guardians, testing for GC'd objects
diff --git a/doc/ref/history.texi b/doc/ref/history.texi
index b14b449..7454cfe 100644
--- a/doc/ref/history.texi
+++ b/doc/ref/history.texi
@@ -71,7 +71,7 @@ Lisp.
Due to a naming conflict with another programming language, Jim Blandy
suggested a new name for GEL: ``Guile''. Besides being a recursive
-acroymn, ``Guile'' craftily follows the naming of its ancestors,
+acronym, ``Guile'' craftily follows the naming of its ancestors,
``Planner'', ``Conniver'', and ``Schemer''. (The latter was truncated
to ``Scheme'' due to a 6-character file name limit on an old operating
system.) Finally, ``Guile'' suggests ``guy-ell'', or ``Guy L.
@@ -102,7 +102,7 @@ applications and a more fully dynamic programming
environment is still
with us today.
@node A Scheme of Many Maintainers
address@hidden A Scheme of Many Mantainers
address@hidden A Scheme of Many Maintainers
Surveying the field, it seems that Scheme implementations correspond
with their maintainers on an N-to-1 relationship. That is to say, that
@@ -112,7 +112,7 @@ maintainership of one individual.
Guile is atypical in this regard.
-Tom Lord maintaned Guile for its first year and a half or so,
+Tom Lord maintained Guile for its first year and a half or so,
corresponding to the end of 1994 through the middle of 1996. The
releases made in this time constitute an arc from SCM as a standalone
program to Guile as a reusable, embeddable library, but passing
diff --git a/doc/ref/libguile-concepts.texi b/doc/ref/libguile-concepts.texi
index 15d54f5..ffdc5f0 100644
--- a/doc/ref/libguile-concepts.texi
+++ b/doc/ref/libguile-concepts.texi
@@ -109,7 +109,7 @@ my_incrementing_function (SCM a, SCM flag)
@}
@end example
-Often, you need to convert between @code{SCM} values and approriate C
+Often, you need to convert between @code{SCM} values and appropriate C
values. For example, we needed to convert the integer @code{1} to its
@code{SCM} representation in order to add it to @var{a}. Libguile
provides many function to do these conversions, both from C to
@@ -206,7 +206,7 @@ Other references to @code{SCM} objects, such as global
variables of type
@code{SCM} or other random data structures in the heap that contain
fields of type @code{SCM}, can be made visible to the garbage collector
by calling the functions @code{scm_gc_protect} or
address@hidden You normally use these funtions for long
address@hidden You normally use these functions for long
lived objects such as a hash table that is stored in a global variable.
For temporary references in local variables or function arguments, using
these functions would be too expensive.
@@ -239,7 +239,7 @@ However, a local variable or function parameter is only
protected as
long as it is really on the stack (or in some register). As an
optimization, the C compiler might reuse its location for some other
value and the @code{SCM} object would no longer be protected. Normally,
-this leads to exactly the right behabvior: the compiler will only
+this leads to exactly the right behavior: the compiler will only
overwrite a reference when it is no longer needed and thus the object
becomes unprotected precisely when the reference disappears, just as
wanted.
@@ -311,7 +311,7 @@ Scheme offers a few syntactic abstractions (@code{do} and
@dfn{named}
But only Scheme functions can call other functions in a tail position:
C functions can not. This matters when you have, say, two functions
that call each other recursively to form a common loop. The following
-(unrealistic) example shows how one might go about determing whether a
+(unrealistic) example shows how one might go about determining whether a
non-negative integer @var{n} is even or odd.
@lisp
diff --git a/doc/ref/libguile-smobs.texi b/doc/ref/libguile-smobs.texi
index 738809d..213312c 100644
--- a/doc/ref/libguile-smobs.texi
+++ b/doc/ref/libguile-smobs.texi
@@ -192,7 +192,7 @@ This procedure ensures that the smob is in a valid state as
soon as it
exists, that all resources that are allocated for the smob are
properly associated with it so that they can be properly freed, and
that no @code{SCM} values that need to be protected are stored in it
-while the smob does not yet competely exist and thus can not protect
+while the smob does not yet completely exist and thus can not protect
them.
Continuing the example from above, if the global variable
diff --git a/doc/ref/libguile-snarf.texi b/doc/ref/libguile-snarf.texi
index 38fdb6c..b295270 100644
--- a/doc/ref/libguile-snarf.texi
+++ b/doc/ref/libguile-snarf.texi
@@ -21,7 +21,7 @@ will extract this information from your source code, and
automatically
generate a file of calls to @code{scm_c_define_gsubr} which you can
@code{#include} into an initialization function.
-The snarfing mechanism works for many kind of initialiation actions,
+The snarfing mechanism works for many kind of initialization actions,
not just for collecting calls to @code{scm_c_define_gsubr}. For a
full list of what can be done, @xref{Snarfing Macros}.
diff --git a/doc/ref/misc-modules.texi b/doc/ref/misc-modules.texi
index 35fe564..28a636f 100644
--- a/doc/ref/misc-modules.texi
+++ b/doc/ref/misc-modules.texi
@@ -629,7 +629,7 @@ argument list, a reverse of what the @nicode{@@} modifier
does.
(format #t "~#*~2:*~a" 'a 'b 'c 'd) @print{} c
@end example
-At the end of the format string the current argument postion doesn't
+At the end of the format string the current argument position doesn't
matter, any further arguments are ignored.
@item @nicode{~t}
@@ -1273,7 +1273,7 @@ is empty, a @code{q-empty} exception is thrown.
@end deffn
@deffn {Scheme Procedure} q-remove! q obj
-Remove all occurences of @var{obj} from @var{q}, and return @var{q}.
+Remove all occurrences of @var{obj} from @var{q}, and return @var{q}.
@var{obj} is compared to queue elements using @code{eq?}.
@end deffn
diff --git a/doc/ref/scheme-scripts.texi b/doc/ref/scheme-scripts.texi
index f47ecf7..5e9f16a 100644
--- a/doc/ref/scheme-scripts.texi
+++ b/doc/ref/scheme-scripts.texi
@@ -144,7 +144,7 @@ start with @code{@@}), which is equivalent to @code{(@@
(symbol ...)
main)}, or @code{(symbol ...) symbol} (that is, a list of only symbols
followed by a symbol), which is equivalent to @code{(@@ (symbol ...)
symbol)}. We recommend to use the equivalent forms directly since they
-corresponf to the @code{(@@ ...)} read syntax that can be used in
+correspond to the @code{(@@ ...)} read syntax that can be used in
normal code, @xref{Using Guile Modules}.
@xref{Scripting Examples}.
diff --git a/doc/ref/slib.texi b/doc/ref/slib.texi
index d3357c9..5fe382d 100644
--- a/doc/ref/slib.texi
+++ b/doc/ref/slib.texi
@@ -8,14 +8,21 @@
@section SLIB
@cindex SLIB
-Before the SLIB facilities can be used, the following Scheme expression
-must be executed:
+SLIB is a portable library of Scheme packages which can be used with
+Guile and other Scheme implementations. SLIB is not included in the
+Guile distribution, but can be installed separately (@pxref{SLIB
+installation}). It is available from
address@hidden://people.csail.mit.edu/jaffer/SLIB.html}.
+
+After SLIB is installed, the following Scheme expression must be
+executed before the SLIB facilities can be used:
@lisp
(use-modules (ice-9 slib))
@end lisp
@findex require
address@hidden
@code{require} can then be used in the usual way (@pxref{Require,,,
slib, The SLIB Manual}). For example,
diff --git a/doc/ref/srfi-modules.texi b/doc/ref/srfi-modules.texi
index 5e8d762..043490d 100644
--- a/doc/ref/srfi-modules.texi
+++ b/doc/ref/srfi-modules.texi
@@ -2815,7 +2815,7 @@ specified by @var{c}.
If @var{c} is a compound condition, extract the field values from the
subcondition belonging to @var{type} that appeared first in the call to
address@hidden that created the the condition.
address@hidden that created the condition.
@end deffn
Convenience macros are also available to create condition types and
@@ -3030,7 +3030,7 @@ the new locations.
(my-param) @result{} 456
@end example
-Parameters are like dynamically bound variables in other Lisp dialets.
+Parameters are like dynamically bound variables in other Lisp dialects.
They allow an application to establish parameter settings (as the name
suggests) just for the execution of a particular bit of code,
restoring when done. Examples of such parameters might be
@@ -3038,7 +3038,7 @@ case-sensitivity for a search, or a prompt for user input.
Global variables are not as good as parameter objects for this sort of
thing. Changes to them are visible to all threads, but in Guile
-parameter object locations are per-thread, thereby truely limiting the
+parameter object locations are per-thread, thereby truly limiting the
effect of @code{parameterize} to just its dynamic execution.
Passing arguments to functions is thread-safe, but that soon becomes
hooks/post-receive
--
GNU Guile
| [Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Guile-commits] GNU Guile branch, master, updated. release_1-9-6-7-g72b3aa5,
Neil Jerram <=