>From a68a49404cdbc4be46d764374f79dfb8b6d93aaf Mon Sep 17 00:00:00 2001 From: Ralf Wildenhues Date: Tue, 8 Feb 2011 21:20:57 +0100 Subject: [PATCH 2/5] docs: fix typos in manual, and a couple in code comments. * doc/ref/api-binding.texi, doc/ref/api-compound.texi, doc/ref/api-control.texi, doc/ref/api-debug.texi, doc/ref/api-io.texi, doc/ref/api-macros.texi, doc/ref/api-procedures.texi, doc/ref/api-scheduling.texi, doc/ref/api-undocumented.texi, doc/ref/api-utility.texi, doc/ref/compiler.texi, doc/ref/goops.texi, doc/ref/libguile-concepts.texi, doc/ref/misc-modules.texi, doc/ref/posix.texi, doc/ref/r6rs.texi, doc/ref/slib.texi, doc/ref/srfi-modules.texi, doc/ref/sxml-match.texi, doc/ref/tools.texi, doc/ref/vm.texi, doc/ref/web.texi, doc/sources/env.texi, doc/sources/jimb-org.texi, doc/sources/scheme-concepts.texi, doc/sources/unix.texi, module/ice-9/optargs.scm: Fix typos. * doc/r4rs/r5rs.texi: Likewise. Do not capitalize code symbols even at the start of a sentence. * doc/ref/api-data.texi: Likewise. Also, remove executable bit. --- doc/r5rs/r5rs.texi | 6 +++--- doc/ref/api-binding.texi | 2 +- doc/ref/api-compound.texi | 8 ++++---- doc/ref/api-control.texi | 4 ++-- doc/ref/api-data.texi | 26 +++++++++++++------------- doc/ref/api-debug.texi | 2 +- doc/ref/api-io.texi | 4 ++-- doc/ref/api-macros.texi | 8 ++++---- doc/ref/api-procedures.texi | 2 +- doc/ref/api-scheduling.texi | 2 +- doc/ref/api-undocumented.texi | 6 +++--- doc/ref/api-utility.texi | 2 +- doc/ref/compiler.texi | 8 ++++---- doc/ref/goops.texi | 4 ++-- doc/ref/libguile-concepts.texi | 2 +- doc/ref/misc-modules.texi | 6 +++--- doc/ref/posix.texi | 2 +- doc/ref/r6rs.texi | 10 +++++----- doc/ref/slib.texi | 2 +- doc/ref/srfi-modules.texi | 16 ++++++++-------- doc/ref/sxml-match.texi | 2 +- doc/ref/tools.texi | 2 +- doc/ref/vm.texi | 10 +++++----- doc/ref/web.texi | 4 ++-- doc/sources/env.texi | 6 +++--- doc/sources/jimb-org.texi | 2 +- doc/sources/scheme-concepts.texi | 2 +- doc/sources/unix.texi | 4 ++-- module/ice-9/optargs.scm | 2 +- 29 files changed, 78 insertions(+), 78 deletions(-) mode change 100755 => 100644 doc/ref/api-data.texi diff --git a/doc/r5rs/r5rs.texi b/doc/r5rs/r5rs.texi index 605a976..1c3df60 100644 --- a/doc/r5rs/r5rs.texi +++ b/doc/r5rs/r5rs.texi @@ -4429,9 +4429,9 @@ all. These procedures are part of every implementation that supports @c %R4%% general -real numbers; they compute the usual transcendental functions. @samp{Log} +real numbers; they compute the usual transcendental functions. @samp{log} computes the natural logarithm of @var{z} (not the base ten logarithm). address@hidden, @samp{acos}, and @samp{atan} compute arcsine (sin^-1), address@hidden, @samp{acos}, and @samp{atan} compute arcsine (sin^-1), arccosine (cos^-1), and arctangent (tan^-1), respectively. The two-argument variant of @samp{atan} computes @t{(angle (make-rectangular @var{x} @var{y}))} (see below), even in implementations @@ -5988,7 +5988,7 @@ unspecified value. -Vectors are heterogenous structures whose elements are indexed +Vectors are heterogeneous structures whose elements are indexed by integers. A vector typically occupies less space than a list of the same length, and the average time required to access a randomly chosen element is typically less for the vector than for the list. diff --git a/doc/ref/api-binding.texi b/doc/ref/api-binding.texi index 60af456..a954f4d 100644 --- a/doc/ref/api-binding.texi +++ b/doc/ref/api-binding.texi @@ -142,7 +142,7 @@ The @var{init} expressions are not allowed to refer to any of the @var{variables}. @end deffn -The other binding contructs are variations on the same theme: making new +The other binding constructs are variations on the same theme: making new values, binding them to variables, and executing a body in that new, extended lexical context. diff --git a/doc/ref/api-compound.texi b/doc/ref/api-compound.texi index f5e8c97..e108da8 100644 --- a/doc/ref/api-compound.texi +++ b/doc/ref/api-compound.texi @@ -909,7 +909,7 @@ Sets the element at position @var{idx} in the simple vector Acquire a handle for the vector @var{vec} and return a pointer to the elements of it. This pointer can only be used to read the elements of @var{vec}. When @var{vec} is not a vector, an error is signaled. The -handle mustr eventually be released with +handle must eventually be released with @code{scm_array_handle_release}. The variables pointed to by @var{lenp} and @var{incp} are filled with @@ -1820,7 +1820,7 @@ have smaller rank than @var{array}. @subsubsection Accessing Arrays from C Arrays, especially uniform numeric arrays, are useful to efficiently -represent large amounts of rectangularily organized information, such as +represent large amounts of information organized in a rectangular way, such as matrices, images, or generally blobs of binary data. It is desirable to access these blobs in a C like manner so that they can be handed to external C code such as linear algebra libraries or image processing @@ -2377,7 +2377,7 @@ to be stored along side usual Scheme @code{SCM} values. A vtable is a structure type, specifying its layout, and other information. A vtable is actually itself a structure, but there's no -need to worray about that initially (@pxref{Vtable Contents}.) +need to worry about that initially (@pxref{Vtable Contents}.) @deffn {Scheme Procedure} make-vtable fields [print] Create a new vtable. @@ -2786,7 +2786,7 @@ of tools for using either association lists or hash tables. @tpindex Alist @cindex association List @cindex alist address@hidden aatabase address@hidden database An association list is a conventional data structure that is often used to implement simple key-value databases. It consists of a list of diff --git a/doc/ref/api-control.texi b/doc/ref/api-control.texi index 2375a64..7a5fb1e 100644 --- a/doc/ref/api-control.texi +++ b/doc/ref/api-control.texi @@ -148,7 +148,7 @@ and the last @var{clause} may have the form @end lisp All @var{datum}s must be distinct. First, @var{key} is evaluated. The -the result of this evaluation is compared against all @var{datum}s using +result of this evaluation is compared against all @var{datum} values using @code{eqv?}. When this comparison succeeds, the expression(s) following the @var{datum} are evaluated from left to right, returning the value of the last expression as the result of the @code{case} expression. @@ -1303,7 +1303,7 @@ frees the memory. But once the memory is freed, we can not get it back on reentry. Thus reentry can not be allowed. The consequence is that continuations become less useful when -non-reenterable contexts are captured, but you don't need to worry +non-reentrant contexts are captured, but you don't need to worry about that too much. The context is ended either implicitly when a non-local exit happens, diff --git a/doc/ref/api-data.texi b/doc/ref/api-data.texi old mode 100755 new mode 100644 index 9b065a5..8c50941 --- a/doc/ref/api-data.texi +++ b/doc/ref/api-data.texi @@ -225,8 +225,8 @@ rational is also real, and every real number is also a complex number In addition to the classification into integers, rationals, reals and complex numbers, Scheme also distinguishes between whether a number is represented exactly or not. For example, the result of address@hidden(\pi/4),2*sin(pi/4)} is exactly @m{\sqrt{2},2^(1/2)}, but Guile -can represent neither @m{\pi/4,pi/4} nor @m{\sqrt{2},2^(1/2)} exactly. address@hidden(\pi/4),2*sin(pi/4)} is exactly @m{\sqrt2,2^(1/2)}, but Guile +can represent neither @m{\pi/4,pi/4} nor @m{\sqrt2,2^(1/2)} exactly. Instead, it stores an inexact approximation, using the C type @code{double}. @@ -572,7 +572,7 @@ is an integer number or a rational number. @deffnx {C Function} scm_rational_p (x) Return @code{#t} if @var{x} is a rational number, @code{#f} otherwise. Note that the set of integer values forms a subset of the set of -rational numbers, i. e. the predicate will also be fulfilled if +rational numbers, i.e.@: the predicate will also be fulfilled if @var{x} is an integer number. @end deffn @@ -1155,7 +1155,7 @@ Returns the magnitude or angle of @var{z} as a @code{double}. The C arithmetic functions below always takes two arguments, while the Scheme functions can take an arbitrary number. When you need to invoke them with just one argument, for example to compute the -equivalent od @code{(- x)}, pass @code{SCM_UNDEFINED} as the second +equivalent of @code{(- x)}, pass @code{SCM_UNDEFINED} as the second one: @code{scm_difference (x, SCM_UNDEFINED)}. @c begin (texi-doc-string "guile" "+") @@ -1327,7 +1327,7 @@ including complex numbers. @c begin (texi-doc-string "guile" "sqrt") @deffn {Scheme Procedure} sqrt z Return the square root of @var{z}. Of the two possible roots -(positive and negative), the one with the a positive real part is +(positive and negative), the one with the positive real part is returned, or if that's zero then a positive imaginary part. Thus, @example @@ -2989,7 +2989,7 @@ Convert the string @var{str} into a list of characters. @deffn {Scheme Procedure} string-split str chr @deffnx {C Function} scm_string_split (str, chr) -Split the string @var{str} into the a list of the substrings delimited +Split the string @var{str} into the list of the substrings delimited by appearances of the character @var{chr}. Note that an empty substring between separator characters will result in an empty string in the result list. @@ -3422,12 +3422,12 @@ case-insensitively. @deffn {Scheme Procedure} string-hash s [bound [start [end]]] @deffnx {C Function} scm_substring_hash (s, bound, start, end) -Compute a hash value for @var{S}. the optional argument @var{bound} is a non-negative exact integer specifying the range of the hash function. A positive value restricts the return value to the range [0,bound). +Compute a hash value for @var{S}. The optional argument @var{bound} is a non-negative exact integer specifying the range of the hash function. A positive value restricts the return value to the range [0,bound). @end deffn @deffn {Scheme Procedure} string-hash-ci s [bound [start [end]]] @deffnx {C Function} scm_substring_hash_ci (s, bound, start, end) -Compute a hash value for @var{S}. the optional argument @var{bound} is a non-negative exact integer specifying the range of the hash function. A positive value restricts the return value to the range [0,bound). +Compute a hash value for @var{S}. The optional argument @var{bound} is a non-negative exact integer specifying the range of the hash function. A positive value restricts the return value to the range [0,bound). @end deffn Because the same visual appearance of an abstract Unicode character can @@ -3449,7 +3449,7 @@ Unicode Standard; and composition, which performs the converse. There are two decomposition operations. ``Canonical decomposition'' produces character sequences that share the same visual appearance as -the original characters, while ``compatiblity decomposition'' produces +the original characters, while ``compatibility decomposition'' produces ones whose visual appearances may differ from the originals but which represent the same abstract character. @@ -4069,7 +4069,7 @@ If a character in @var{str} cannot be represented in the locale encoding of the current output port, the port conversion strategy of the current output port will determine the result, @xref{Ports}. If output port's conversion strategy is @code{error}, an error will be raised. If it is address@hidden, a replacement character, such as a question mark, will address@hidden, a replacement character, such as a question mark, will be inserted in its place. If it is @code{escape}, a hex escape will be inserted in its place. @end deftypefn @@ -4550,7 +4550,7 @@ representing the contents of @var{bv}, decoded according to @deffnx {Scheme Procedure} sint-list->bytevector lst endianness size @deffnx {C Function} scm_uint_list_to_bytevector (lst, endianness, size) @deffnx {C Function} scm_sint_list_to_bytevector (lst, endianness, size) -Return a new bytevector containing the unsigned (resp. signed) integers +Return a new bytevector containing the unsigned (resp.@: signed) integers listed in @var{lst} and encoded on @var{size} bytes according to @var{endianness}. @end deffn @@ -5128,8 +5128,8 @@ Guile currently retains some elements of the traditional structure in case they turn out to be useful when implementing translators for other languages, in particular Emacs Lisp. -Specifically, Guile symbols have two extra slots. for a symbol's -property list, and for its ``function value.'' The following procedures +Specifically, Guile symbols have two extra slots, one for a symbol's +property list, and one for its ``function value.'' The following procedures are provided to access these slots. @deffn {Scheme Procedure} symbol-fref symbol diff --git a/doc/ref/api-debug.texi b/doc/ref/api-debug.texi index 7efbb75..765b4ad 100644 --- a/doc/ref/api-debug.texi +++ b/doc/ref/api-debug.texi @@ -1030,7 +1030,7 @@ of an application of @var{proc}. @deffn {Scheme Procedure} trap-instructions-in-dynamic-extent proc @ next-handler [#:current-frame] [#:vm] [#:closure?] -A trap that calls @var{next-handler} for all retired intructions within +A trap that calls @var{next-handler} for all retired instructions within the dynamic extent of a call to @var{proc}. @end deffn diff --git a/doc/ref/api-io.texi b/doc/ref/api-io.texi index e02daeb..52dfdd4 100644 --- a/doc/ref/api-io.texi +++ b/doc/ref/api-io.texi @@ -871,7 +871,7 @@ requested, @code{open-file} throws an exception. When the file is opened, this procedure will scan for a coding declaration (@pxref{Character Encoding of Source Files}). If present will use that encoding for interpreting the file. Otherwise, the -port's encoding will be used. To supress this behavior, open +port's encoding will be used. To suppress this behavior, open the file in binary mode and then set the port encoding explicitly using @code{set-port-encoding!}. @@ -976,7 +976,7 @@ Determine whether @var{obj} is a port that is related to a file. @cindex String port @cindex Port, string -The following allow string ports to be opened by analogy to R4R* +The following allow string ports to be opened by analogy to R4RS file port facilities: With string ports, the port-encoding is treated differently than other diff --git a/doc/ref/api-macros.texi b/doc/ref/api-macros.texi index 5f15fb7..f0eeb6e 100644 --- a/doc/ref/api-macros.texi +++ b/doc/ref/api-macros.texi @@ -299,7 +299,7 @@ expression. This property is sometimes known as @dfn{hygiene}, and it does aid in code cleanliness. In your macro definitions, you can feel free to introduce temporary -variables, without worrying about inadvertantly introducing bindings into the +variables, without worrying about inadvertently introducing bindings into the macro expansion. Consider the definition of @code{my-or} from the previous section: @@ -461,7 +461,7 @@ found @var{exp} referenced outside a @code{syntax} form. Since @code{syntax} appears frequently in macro-heavy code, it has a special reader macro: @code{#'}. @code{#'foo} is transformed by the reader into address@hidden(syntax foo)}, just as @code{'foo} is tranformed into @code{(quote foo)}. address@hidden(syntax foo)}, just as @code{'foo} is transformed into @code{(quote foo)}. The pattern language used by @code{syntax-case} is conveniently the same language used by @code{syntax-rules}. Given this, Guile actually defines @@ -763,7 +763,7 @@ macro. @code{syntax-rules} provides some syntax to effect this transformation more easily. @deffn {Syntax} identifier-syntax exp -Returns a macro transformer that will replace occurences of the macro with +Returns a macro transformer that will replace occurrences of the macro with @var{exp}. @end deffn @@ -814,7 +814,7 @@ bar-alias @result{} 30 @end example @end deffn -There is an extension to identifer-syntax which allows it to handle the +There is an extension to identifier-syntax which allows it to handle the @code{set!} case as well: @deffn {Syntax} identifier-syntax (var exp1) ((set! var val) exp2) diff --git a/doc/ref/api-procedures.texi b/doc/ref/api-procedures.texi index c087f4c..02889c4 100644 --- a/doc/ref/api-procedures.texi +++ b/doc/ref/api-procedures.texi @@ -489,7 +489,7 @@ take @code{lambda*}-style extended parameter lists, where @code{#:optional}, semantics. Here is an example of a macro with an optional argument: @lisp -(defmacro* transmorgify (a #:optional b) +(defmacro* transmogrify (a #:optional b) (a 1)) @end lisp @end deffn diff --git a/doc/ref/api-scheduling.texi b/doc/ref/api-scheduling.texi index 248d8b7..f7ba508 100644 --- a/doc/ref/api-scheduling.texi +++ b/doc/ref/api-scheduling.texi @@ -743,7 +743,7 @@ Set @var{fluids} to @var{values} temporary, and call @var{thunk}. @var{fluids} must be a list of fluids and @var{values} must be the same number of their values to be applied. Each substitution is done in the order given. @var{thunk} must be a procedure with no argument. -it is called inside a @code{dynamic-wind} and the fluids are +It is called inside a @code{dynamic-wind} and the fluids are set/restored when control enter or leaves the established dynamic extent. @end deffn diff --git a/doc/ref/api-undocumented.texi b/doc/ref/api-undocumented.texi index 774061d..1e36ad8 100644 --- a/doc/ref/api-undocumented.texi +++ b/doc/ref/api-undocumented.texi @@ -568,7 +568,7 @@ as @var{array}, if used as the @var{prototype} for @deffn {Scheme Procedure} call-with-dynamic-root thunk handler @deffnx {C Function} scm_call_with_dynamic_root (thunk, handler) -Call @var{thunk} with a new dynamic state and withina continuation barrier. The @var{handler} catches allotherwise uncaught throws and executes within the samedynamic context as @var{thunk}. +Call @var{thunk} with a new dynamic state and within a continuation barrier. The @var{handler} catches all otherwise uncaught throws and executes within the same dynamic context as @var{thunk}. @end deffn @deffn {Scheme Procedure} dynamic-root @@ -587,13 +587,13 @@ Return @code{#t} if @var{obj} is a uniform vector. @deffn {Scheme Procedure} uniform-vector-ref v idx @deffnx {C Function} scm_uniform_vector_ref (v, idx) Return the element at index @var{idx} of the -homogenous numeric vector @var{v}. +homogeneous numeric vector @var{v}. @end deffn @deffn {Scheme Procedure} uniform-vector-set! v idx val @deffnx {C Function} scm_uniform_vector_set_x (v, idx, val) Set the element at index @var{idx} of the -homogenous numeric vector @var{v} to @var{val}. +homogeneous numeric vector @var{v} to @var{val}. @end deffn @deffn {Scheme Procedure} uniform-vector->list uvec diff --git a/doc/ref/api-utility.texi b/doc/ref/api-utility.texi index 8fdfb22..fb747ee 100644 --- a/doc/ref/api-utility.texi +++ b/doc/ref/api-utility.texi @@ -432,7 +432,7 @@ copies any pairs in the cars of the input lists. @deffn {Scheme Procedure} copy-tree obj @deffnx {C Function} scm_copy_tree (obj) -Recursively copy the data tree that is bound to @var{obj}, and return a +Recursively copy the data tree that is bound to @var{obj}, and return the new data structure. @code{copy-tree} recurses down the contents of both pairs and vectors (since both cons cells and vector cells may point to arbitrary objects), and stops recursing when it hits diff --git a/doc/ref/compiler.texi b/doc/ref/compiler.texi index b3a1dc6..3c35cc8 100644 --- a/doc/ref/compiler.texi +++ b/doc/ref/compiler.texi @@ -295,7 +295,7 @@ Properties}, for more information. Although Tree-IL objects are represented internally using records, there is also an equivalent S-expression external representation for -each kind of Tree-IL. For example, an the S-expression representation +each kind of Tree-IL. For example, the S-expression representation of @code{#} expression would be: @example @@ -418,7 +418,7 @@ argument, or @code{#f}. (@var{keyword} @var{name} @var{var}) ...)}, where @var{keyword} is the keyword corresponding to the argument named @var{name}, and whose corresponding gensym is @var{var}. @var{inits} are tree-il expressions -corresponding to all of the optional and keyword argumens, evaluated +corresponding to all of the optional and keyword arguments, evaluated to bind variables whose value is not supplied by the procedure caller. Each @var{init} expression is evaluated in the lexical context of previously bound variables, from left to right. @@ -855,7 +855,7 @@ for more information about the Brainfuck language itself. At this point, we break with the impersonal tone of the rest of the manual, and make an intervention. Admit it: if you've read this far into the compiler internals manual, you are a junkie. Perhaps a course -at your university left you unsated, or perhaps you've always harbored +at your university left you unsatisfied, or perhaps you've always harbored a sublimated desire to hack the holy of computer science holies: a compiler. Well you're in good company, and in a good position. Guile's compiler needs your help. @@ -877,7 +877,7 @@ next step. The compiler also needs help at the top end, enhancing the Scheme that it knows to also understand R6RS, and adding new high-level compilers. We have JavaScript and Emacs Lisp mostly complete, but they could use -some love; Lua would be nice as well, butq whatever language it is +some love; Lua would be nice as well, but whatever language it is that strikes your fancy would be welcome too. Compilers are for hacking, not for admiring or for complaining about. diff --git a/doc/ref/goops.texi b/doc/ref/goops.texi index 0dd7b0e..381dfe9 100644 --- a/doc/ref/goops.texi +++ b/doc/ref/goops.texi @@ -535,7 +535,7 @@ other. A better solution is to use virtual slots, like this: @end lisp -In this class definition, the magniture @code{m} and angle @code{a} +In this class definition, the magnitude @code{m} and angle @code{a} slots are virtual, and are calculated, when referenced, from the normal (i.e. @code{#:allocation #:instance}) slots @code{r} and @code{i}, by calling the function defined in the relevant @code{#:slot-ref} option. @@ -619,7 +619,7 @@ different sets of specializing argument classes; for example: @lisp (define-method (+ (x ) (y ) (y )) ...) -(define-method (+ (f ) (b )) ...) +(define-method (+ (f ) (b )) ...) (define-method (+ (a ) (b ) (c )) ...) @end lisp diff --git a/doc/ref/libguile-concepts.texi b/doc/ref/libguile-concepts.texi index 1e4cb1e..6ebeb63 100644 --- a/doc/ref/libguile-concepts.texi +++ b/doc/ref/libguile-concepts.texi @@ -515,7 +515,7 @@ modified in another thread while the loop iterates over it. Thus, while copying its elements into the vector, the list might get longer or shorter. For this reason, the loop must check both that it doesn't overrun the vector (@code{SCM_SIMPLE_VECTOR_SET} does no range-checking) -and that it doesn't overrung the list (@code{SCM_CAR} and @code{SCM_CDR} +and that it doesn't overrun the list (@code{SCM_CAR} and @code{SCM_CDR} likewise do no type checking). It is safe to use @code{SCM_CAR} and @code{SCM_CDR} on the local diff --git a/doc/ref/misc-modules.texi b/doc/ref/misc-modules.texi index 7071dad..fc35ff8 100644 --- a/doc/ref/misc-modules.texi +++ b/doc/ref/misc-modules.texi @@ -91,11 +91,11 @@ dots.}, or in the worst case, displayed as @nicode{#}. @deffn {Scheme Procedure} truncated-print obj [port] [keyword-options] Print @var{obj}, truncating the output, if necessary, to make it fit into @var{width} characters. By default, @var{x} will be printed using address@hidden, though that behavior can be overriden via the address@hidden, though that behavior can be overridden via the @var{display?} keyword argument. The default behaviour is to print depth-first, meaning that the entire -remaining width will be available to each sub-expressoin of @var{x} -- +remaining width will be available to each sub-expression of @var{x} -- e.g., if @var{x} is a vector, each member of @var{x}. One can attempt to ``ration'' the available width, trying to allocate it equally to each sub-expression, via the @var{breadth-first?} keyword argument. @@ -1260,7 +1260,7 @@ The return value from @code{nftw} is @code{#t} if it ran to completion, or otherwise the address@hidden value from @var{proc} which caused the stop. address@hidden For reference, one reason not to esacpe is that the current address@hidden For reference, one reason not to escape is that the current @c directory is not saved and restored with dynamic-wind. Maybe @c changing that would be enough to allow escaping. @c diff --git a/doc/ref/posix.texi b/doc/ref/posix.texi index 4c43248..704fe63 100644 --- a/doc/ref/posix.texi +++ b/doc/ref/posix.texi @@ -2456,7 +2456,7 @@ When given, @var{hint_family} should specify the requested address family, e.g., @code{AF_INET6}. Similarly, @var{hint_socktype} should specify the requested socket type (e.g., @code{SOCK_DGRAM}), and @var{hint_protocol} should -specify the requested protocol (its value is interpretered +specify the requested protocol (its value is interpreted as in calls to @code{socket}). On error, an exception with key @code{getaddrinfo-error} is diff --git a/doc/ref/r6rs.texi b/doc/ref/r6rs.texi index ffd238d..4df05e0 100644 --- a/doc/ref/r6rs.texi +++ b/doc/ref/r6rs.texi @@ -1125,7 +1125,7 @@ called on exceptions thrown by the corresponding @code{raise} procedure. @deffn {Scheme Procedure} with-exception-handler handler thunk Installs @var{handler}, which must be a procedure taking one argument, -as the current exception handler during the invokation of @var{thunk}, a +as the current exception handler during the invocation of @var{thunk}, a procedure taking zero arguments. The handler in place at the time @code{with-exception-handler} is called is made current again once either @var{thunk} returns or @var{handler} is invoked after an @@ -1290,7 +1290,7 @@ condition in a compound condition. @deffn {Condition Type} &who @deffnx {Scheme Procedure} make-who-condition who @deffnx {Scheme Procedure} who-condition? obj address@hidden {Scheme Procedure} condiction-who condition address@hidden {Scheme Procedure} condition-who condition A base type used for storing the identity, a string or symbol, of the entity responsible for another condition in a compound condition. @end deffn @@ -1544,7 +1544,7 @@ value, and the maximum fixnum value. @deffnx {Scheme Procedure} fx<=? fx1 fx2 fx3 ... These procedures return @code{#t} if their fixnum arguments are (respectively): equal, monotonically increasing, monotonically -decreasing, monotonically nondecreasing, or monotonically nonincrasing; +decreasing, monotonically nondecreasing, or monotonically nonincreasing; @code{#f} otherwise. @end deffn @@ -1716,7 +1716,7 @@ Returns the flonum that is numerically closest to the real number @deffnx {Scheme Procedure} fl>=? fl1 fl2 fl3 ... These procedures return @code{#t} if their flonum arguments are (respectively): equal, monotonically increasing, monotonically -decreasing, monotonically nondecreasing, or monotonically nonincrasing; +decreasing, monotonically nondecreasing, or monotonically nonincreasing; @code{#f} otherwise. @end deffn @@ -1915,7 +1915,7 @@ in the direction of more significant bits. @end deffn @deffn {Scheme Procedure} bitwise-reverse-bit-field ei1 ei2 ei3 -Returns the result of reversing the order of the bits of @var{e1} +Returns the result of reversing the order of the bits of @var{ei1} between position @var{ei2} (inclusive) and position @var{ei3} (exclusive). @end deffn diff --git a/doc/ref/slib.texi b/doc/ref/slib.texi index 5fe382d..388dae1 100644 --- a/doc/ref/slib.texi +++ b/doc/ref/slib.texi @@ -55,7 +55,7 @@ Library}): @item Unpack SLIB and install it using @code{make install} from its directory. By default, this will install SLIB in @file{/usr/local/lib/slib/}. -Running @code{make installinfo} installs its documentation, by default +Running @code{make install-info} installs its documentation, by default under @file{/usr/local/info/}. @item diff --git a/doc/ref/srfi-modules.texi b/doc/ref/srfi-modules.texi index b214483..a6b98ee 100644 --- a/doc/ref/srfi-modules.texi +++ b/doc/ref/srfi-modules.texi @@ -391,13 +391,13 @@ Return a list containing all but the first @var{i} elements of @end deffn @deffn {Scheme Procedure} take-right lst i -Return the a list containing the @var{i} last elements of @var{lst}. +Return a list containing the @var{i} last elements of @var{lst}. The return shares a common tail with @var{lst}. @end deffn @deffn {Scheme Procedure} drop-right lst i @deffnx {Scheme Procedure} drop-right! lst i -Return the a list containing all but the @var{i} last elements of +Return a list containing all but the @var{i} last elements of @var{lst}. @code{drop-right} always returns a new list, even when @var{i} is @@ -633,7 +633,7 @@ Determines when to stop unfolding. Maps each seed value to the corresponding list element. @item g -Maps each seed value to next seed valu. +Maps each seed value to next seed value. @item seed The state value for the unfold. @@ -665,7 +665,7 @@ Determines when to stop unfolding. Maps each seed value to the corresponding list element. @item g -Maps each seed value to next seed valu. +Maps each seed value to next seed value. @item seed The state value for the unfold. @@ -1678,7 +1678,7 @@ at the following odd index. @deftypefnx {C Function} {const scm_t_int32 *} scm_s32vector_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) @deftypefnx {C Function} {const scm_t_uint64 *} scm_u64vector_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) @deftypefnx {C Function} {const scm_t_int64 *} scm_s64vector_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) address@hidden {C Function} {const float *} scm_f23vector_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) address@hidden {C Function} {const float *} scm_f32vector_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) @deftypefnx {C Function} {const double *} scm_f64vector_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) @deftypefnx {C Function} {const float *} scm_c32vector_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) @deftypefnx {C Function} {const double *} scm_c64vector_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) @@ -1695,7 +1695,7 @@ indicated kind. @deftypefnx {C Function} {scm_t_int32 *} scm_s32vector_writable_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) @deftypefnx {C Function} {scm_t_uint64 *} scm_u64vector_writable_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) @deftypefnx {C Function} {scm_t_int64 *} scm_s64vector_writable_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) address@hidden {C Function} {float *} scm_f23vector_writable_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) address@hidden {C Function} {float *} scm_f32vector_writable_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) @deftypefnx {C Function} {double *} scm_f64vector_writable_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) @deftypefnx {C Function} {float *} scm_c32vector_writable_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) @deftypefnx {C Function} {double *} scm_c64vector_writable_elements (SCM vec, scm_t_array_handle *handle, size_t *lenp, ssize_t *incp) @@ -1884,7 +1884,7 @@ The @var{fieldname}s provide the names for the record fields, as per the core @code{record-type-fields} etc, and are referred to in the subsequent accessor/modifier forms. address@hidden is bound to a function to be called as address@hidden is bound to a function to be called as @code{(@var{predicate} obj)}. It returns @code{#t} or @code{#f} according to whether @var{obj} is a record of this type. @@ -4117,7 +4117,7 @@ stream-filter algorithm, expressed in a hypothetical lazy language as (stream-filter p? t))))) @end lisp -This algorithm can be espressed as follows in Scheme: +This algorithm can be expressed as follows in Scheme: @lisp (define (stream-filter p? s) diff --git a/doc/ref/sxml-match.texi b/doc/ref/sxml-match.texi index f92331b..7b82e11 100644 --- a/doc/ref/sxml-match.texi +++ b/doc/ref/sxml-match.texi @@ -298,7 +298,7 @@ basic arithmetic operations, which are represented by the XML elements @end lisp Using the catamorphism feature of @code{sxml-match}, a more concise version of address@hidden can be written. The pattern @code{,[x]} recusively invokes address@hidden can be written. The pattern @code{,[x]} recursively invokes the pattern matcher on the value bound in this position. @lisp diff --git a/doc/ref/tools.texi b/doc/ref/tools.texi index 2158344..2f4f59a 100644 --- a/doc/ref/tools.texi +++ b/doc/ref/tools.texi @@ -252,7 +252,7 @@ functions. @node Writing your own snarfing macros @subsubsection Writing your own snarfing macros -When you want to use the general snarfing machanism, but none of the +When you want to use the general snarfing mechanism, but none of the provided macros fits your need, you can use the macro @code{SCM_SNARF_INIT}. diff --git a/doc/ref/vm.texi b/doc/ref/vm.texi index 2c279bf..51fe8c4 100644 --- a/doc/ref/vm.texi +++ b/doc/ref/vm.texi @@ -746,7 +746,7 @@ Jump to @var{offset} if the number of arguments is not equal to, greater than, or less than @var{n}. @var{n} is encoded over two bytes, and @var{offset} has the normal three-byte encoding. -These instructions are used to implement muliple arities, as in +These instructions are used to implement multiple arities, as in @code{case-lambda}. @xref{Case-lambda}, for more information. @end deffn @@ -803,7 +803,7 @@ keyword arguments to their local variable indices. There are two bitflags that affect the parser, @code{allow-other-keys?} (@code{0x1}) and @code{rest?} (@code{0x2}). Unless @code{allow-other-keys?} is set, the parser will signal an error if an -unknown key is found. If @code{rest?} is set, errors parsing the the +unknown key is found. If @code{rest?} is set, errors parsing the keyword arguments will be ignored, as a later @code{bind-rest} instruction will collect all of the tail arguments, including the keywords, into a list. Otherwise if the keyword arguments are invalid, @@ -940,7 +940,7 @@ Jump to @var{offset} if the object on the stack is not @code{'()}. @subsubsection Data Constructor Instructions These instructions push simple immediate values onto the stack, -or constructo compound data structures from values the stack. +or constructor compound data structures from values the stack. @deffn Instruction make-int8 value Push @var{value}, an 8-bit integer, onto the stack. @@ -1067,7 +1067,7 @@ encoded in the ``latin1'' locale. @end deffn @deffn Instruction load-wide-string length Load a UTF-32 string from the instruction stream. @var{length} is the -length in bytes, not in codepoints +length in bytes, not in codepoints. @end deffn @deffn Instruction load-symbol length Load a symbol from the instruction stream. The symbol is assumed to be @@ -1228,7 +1228,7 @@ Since most of these operations are historically implemented as C primitives, not inlining them would entail constantly calling out from the VM to the interpreter, which has some costs---registers must be saved, the interpreter has to dispatch, called procedures have to do -much typechecking, etc. It's much more efficient to inline these +much type checking, etc. It's much more efficient to inline these operations in the virtual machine itself. All of these instructions pop their arguments from the stack and push diff --git a/doc/ref/web.texi b/doc/ref/web.texi index e285c2a..c7018e9 100644 --- a/doc/ref/web.texi +++ b/doc/ref/web.texi @@ -762,7 +762,7 @@ list is itself a list, in the same format as @code{content-type}. (parse-header 'accept "text/html,text/plain;charset=utf-8") @result{} ((text/html) (text/plain (charset . "utf-8"))) @end example -Preference is expressed with qualitiy values: +Preference is expressed with quality values: @example (parse-header 'accept "text/html;q=0.8,text/plain;q=0.6") @result{} ((text/html (q . 800)) (text/plain (q . 600))) @@ -1008,7 +1008,7 @@ A string identifying the server. @deftypevr {HTTP Header} *|List vary A set of request headers that were used in computing this response. -Used to indicate that server-side content negotation was performed, for +Used to indicate that server-side content negotiation was performed, for example in response to the @code{accept-language} header. Can also be the symbol @code{*}, indicating that all headers were considered. @example diff --git a/doc/sources/env.texi b/doc/sources/env.texi index 3f51568..a3efce2 100644 --- a/doc/sources/env.texi +++ b/doc/sources/env.texi @@ -80,7 +80,7 @@ we document the Scheme procedure only, and call it a "Primitive". If a Scheme function is marked as a primitive, you can derive the name of the corresponding C function by changing @code{-} to @code{_}, @code{!} to @code{_x}, @code{?} to @code{_p}, and prepending @code{scm_}. The C -function's arguments will be all of the Scheme procedure's argumements, +function's arguments will be all of the Scheme procedure's arguments, both required and optional; if the Scheme procedure takes a ``rest'' argument, that will be a final argument to the C function. The C function's arguments, as well as its return type, will be @code{SCM}. @@ -735,7 +735,7 @@ changes the bindings of @var{local} or @var{imported}, those changes will be visible in @var{eval}. Since most Scheme evaluation takes place in @var{eval} environments, -they transparenty cache the bindings received from @var{local} and +they transparently cache the bindings received from @var{local} and @var{imported}. Thus, the first time the program looks up a symbol in @var{eval}, @var{eval} may make calls to @var{local} or @var{imported} to find their bindings, but subsequent references to that symbol will be @@ -1086,7 +1086,7 @@ Once this is done, we can make the following simplifications to Guile: @item A good portion of symbols.c can go away. Symbols no longer need value -slots. The mismash of @code{scm_sym2ovcell}, +slots. The mishmash of @code{scm_sym2ovcell}, @code{scm_intern_obarray_soft}, etc. can go away. @code{intern} becomes simpler. diff --git a/doc/sources/jimb-org.texi b/doc/sources/jimb-org.texi index 5ec4216..c4ad9ea 100644 --- a/doc/sources/jimb-org.texi +++ b/doc/sources/jimb-org.texi @@ -27,7 +27,7 @@ Part I: Guile Scheme Keywords Exceptions Modules - --- the preceeding three come first, because we need them + --- the preceding three come first, because we need them in order to explain the behavior of some things later Exception Handling --- mention that repls usually establish default exception handlers diff --git a/doc/sources/scheme-concepts.texi b/doc/sources/scheme-concepts.texi index e8e78f1..0e9ae6c 100644 --- a/doc/sources/scheme-concepts.texi +++ b/doc/sources/scheme-concepts.texi @@ -204,7 +204,7 @@ arrays, uniform arrays, bit vectors: @deffn procedure array-prototype ra @end deffn -Unform arrays can be written and read, but @code{read} won't recognize +Uniform arrays can be written and read, but @code{read} won't recognize them unless the optional @code{read-sharp} parameter is supplied, e.g, @smalllisp diff --git a/doc/sources/unix.texi b/doc/sources/unix.texi index 0ef894a..6754f8a 100644 --- a/doc/sources/unix.texi +++ b/doc/sources/unix.texi @@ -28,7 +28,7 @@ be required to make them available. The low-level interfaces are designed to give Scheme programs access to as much functionality as possible from the underlying Unix system. They can be used to implement higher level -intefaces such as the Scheme shell @ref{scsh}. +interfaces such as the Scheme shell @ref{scsh}. Generally there is a single procedure for each corresponding Unix facility. However some of the procedures are implemented for @@ -53,7 +53,7 @@ facility. Underscores in Unix names are converted to hyphens. @item Procedures which destructively modify Scheme data gain postpended -exclaimation marks, e.g., @code{recv!}. +exclamation marks, e.g., @code{recv!}. @item Predicates are postpended with question marks, e.g., @code{access?}. @item diff --git a/module/ice-9/optargs.scm b/module/ice-9/optargs.scm index 4e3267d..50a8299 100644 --- a/module/ice-9/optargs.scm +++ b/module/ice-9/optargs.scm @@ -269,7 +269,7 @@ ;; take lambda*-style extended paramter lists, where #:optional, ;; #:key, #:allow-other-keys and #:rest are allowed with the usual ;; semantics. Here is an example of a macro with an optional argument: -;; (defmacro* transmorgify (a #:optional b) +;; (defmacro* transmogrify (a #:optional b) (define-syntax defmacro* (lambda (x) -- 1.7.4.rc1.6.gb704ef.dirty