* doc/ref/api-foreign.texi, doc/ref/srfi-modules.texi: Fix typos. --- doc/ref/api-foreign.texi | 2 +- doc/ref/srfi-modules.texi | 32 ++++++++++++++++---------------- 2 files changed, 17 insertions(+), 17 deletions(-) diff --git a/doc/ref/api-foreign.texi b/doc/ref/api-foreign.texi index 2bd460a88..a1a1016b0 100644 --- a/doc/ref/api-foreign.texi +++ b/doc/ref/api-foreign.texi @@ -606,7 +606,7 @@ Mutating the returned bytevector mutates the memory pointed to by @deffn {Scheme Procedure} bytevector->pointer bv [offset] @deffnx {C Function} scm_bytevector_to_pointer (bv, offset) -Return a pointer pointer aliasing the memory pointed to by @var{bv} or +Return a pointer aliasing the memory pointed to by @var{bv} or @var{offset} bytes after @var{bv} when @var{offset} is passed. @end deffn diff --git a/doc/ref/srfi-modules.texi b/doc/ref/srfi-modules.texi index 2e66bafb9..e12ab8d75 100644 --- a/doc/ref/srfi-modules.texi +++ b/doc/ref/srfi-modules.texi @@ -5616,7 +5616,7 @@ since combining N of them builds @code{(- N 1)} intermediate lists. Transducers are oblivious to what kind of process they are used in, and are composable without building intermediate collections. This means we -can create a transducer that squares all even numbers: +can create a transducer that squares all odd numbers: @example (compose (tfilter odd?) (tmap (lambda (x) (* x x)))) @@ -5689,7 +5689,7 @@ reducer with result-so-far and the maybe-transformed input. A simple example is as following: @example -(list-transduce (tfilter odd?)+ '(1 2 3 4 5)). +(list-transduce (tfilter odd?) + '(1 2 3 4 5)). @end example This first returns a transducer filtering all odd @@ -5763,12 +5763,12 @@ and SRFI-158-styled generators respectively. @deffnx {Scheme Procedure} port-transduce xform f reader port @deffnx {Scheme Procedure} port-transduce xform f identity reader port -Same as @code{list-reduce} but for ports. Called without a port, it -reduces over the results of applying @var{reader} until the -EOF-object is returned, presumably to read from -@code{current-input-port}. With a port @var{reader} is applied to -@var{port} instead of without any arguments. If @var{identity} is -provided, that is used as the initial identity in the reduction. +Same as @code{list-transduce} but for ports. Called without a port, it +reduces over the results of applying @var{reader} until the EOF-object +is returned, presumably to read from @code{current-input-port}. With a +port @var{reader} is applied to @var{port} instead of without any +arguments. If @var{identity} is provided, that is used as the initial +identity in the reduction. @end deffn @@ -5844,7 +5844,7 @@ transduction. Returns a transducer that applies @var{proc} to all values. Stateless. @end deffn -@deffn tfilter pred? +@deffn {Scheme Procedure} tfilter pred? Returns a transducer that removes values for which @var{pred?} returns #f. Stateless. @@ -5889,7 +5889,7 @@ Stateful. @deffn {Scheme Procedure} tdrop-while pred? -Returns a transducer that discards the the first values for which +Returns a transducer that discards the first values for which @var{pred?} returns true. Stateful. @@ -5949,9 +5949,9 @@ Stateful. @end deffn @deffn {Scheme Procedure} tsegment n -Returns a transducer that groups @var{n} inputs in lists of @var{n} -elements. When the transduction stops, it flushes any remaining -collection, even if it contains fewer than @var{n} elements. +Returns a transducer that groups inputs into lists of @var{n} elements. +When the transduction stops, it flushes any remaining collection, even +if it contains fewer than @var{n} elements. Stateful. @end deffn @@ -6080,13 +6080,13 @@ The bytevector-u8 version of list-reduce. @end deffn @deffn {Scheme Procedure} port-reduce f identity reader port -The port version of list-reducer. It reduces over port using reader +The port version of list-reduce. It reduces over port using reader until reader returns the EOF object. @end deffn @deffn {Scheme Procedure} generator-reduce f identity gen -The port version of list-reduce. It reduces over @code{gen} until it -returns the EOF object +The generator version of list-reduce. It reduces over @code{gen} until +it returns the EOF object @end deffn @c srfi-modules.texi ends here -- 2.32.0
As the author of most of the part with corrections: thank you. I am cleaning up the reference implementation as well, so this is very welcome!
--
Linus Björnstam
On Thu, 19 Aug 2021, at 22:18, Arun Isaac wrote:
> * doc/ref/api-foreign.texi, doc/ref/srfi-modules.texi: Fix typos.
> ---
> doc/ref/api-foreign.texi | 2 +-
> doc/ref/srfi-modules.texi | 32 ++++++++++++++++----------------
> 2 files changed, 17 insertions(+), 17 deletions(-)
>
> diff --git a/doc/ref/api-foreign.texi b/doc/ref/api-foreign.texi
> index 2bd460a88..a1a1016b0 100644
> --- a/doc/ref/api-foreign.texi
> +++ b/doc/ref/api-foreign.texi
> @@ -606,7 +606,7 @@ Mutating the returned bytevector mutates the memory
> pointed to by
>
> @deffn {Scheme Procedure} bytevector->pointer bv [offset]
> @deffnx {C Function} scm_bytevector_to_pointer (bv, offset)
> -Return a pointer pointer aliasing the memory pointed to by @var{bv} or
> +Return a pointer aliasing the memory pointed to by @var{bv} or
> @var{offset} bytes after @var{bv} when @var{offset} is passed.
> @end deffn
>
> diff --git a/doc/ref/srfi-modules.texi b/doc/ref/srfi-modules.texi
> index 2e66bafb9..e12ab8d75 100644
> --- a/doc/ref/srfi-modules.texi
> +++ b/doc/ref/srfi-modules.texi
> @@ -5616,7 +5616,7 @@ since combining N of them builds @code{(- N 1)}
> intermediate lists.
>
> Transducers are oblivious to what kind of process they are used in, and
> are composable without building intermediate collections. This means we
> -can create a transducer that squares all even numbers:
> +can create a transducer that squares all odd numbers:
>
> @example
> (compose (tfilter odd?) (tmap (lambda (x) (* x x))))
> @@ -5689,7 +5689,7 @@ reducer with result-so-far and the
> maybe-transformed input.
> A simple example is as following:
>
> @example
> -(list-transduce (tfilter odd?)+ '(1 2 3 4 5)).
> +(list-transduce (tfilter odd?) + '(1 2 3 4 5)).
> @end example
>
> This first returns a transducer filtering all odd
> @@ -5763,12 +5763,12 @@ and SRFI-158-styled generators respectively.
> @deffnx {Scheme Procedure} port-transduce xform f reader port
> @deffnx {Scheme Procedure} port-transduce xform f identity reader port
>
> -Same as @code{list-reduce} but for ports. Called without a port, it
> -reduces over the results of applying @var{reader} until the
> -EOF-object is returned, presumably to read from
> -@code{current-input-port}. With a port @var{reader} is applied to
> -@var{port} instead of without any arguments. If @var{identity} is
> -provided, that is used as the initial identity in the reduction.
> +Same as @code{list-transduce} but for ports. Called without a port, it
> +reduces over the results of applying @var{reader} until the EOF-object
> +is returned, presumably to read from @code{current-input-port}. With a
> +port @var{reader} is applied to @var{port} instead of without any
> +arguments. If @var{identity} is provided, that is used as the initial
> +identity in the reduction.
> @end deffn
>
>
> @@ -5844,7 +5844,7 @@ transduction.
> Returns a transducer that applies @var{proc} to all values. Stateless.
> @end deffn
>
> -@deffn tfilter pred?
> +@deffn {Scheme Procedure} tfilter pred?
> Returns a transducer that removes values for which @var{pred?} returns #f.
>
> Stateless.
> @@ -5889,7 +5889,7 @@ Stateful.
>
>
> @deffn {Scheme Procedure} tdrop-while pred?
> -Returns a transducer that discards the the first values for which
> +Returns a transducer that discards the first values for which
> @var{pred?} returns true.
>
> Stateful.
> @@ -5949,9 +5949,9 @@ Stateful.
> @end deffn
>
> @deffn {Scheme Procedure} tsegment n
> -Returns a transducer that groups @var{n} inputs in lists of @var{n}
> -elements. When the transduction stops, it flushes any remaining
> -collection, even if it contains fewer than @var{n} elements.
> +Returns a transducer that groups inputs into lists of @var{n} elements.
> +When the transduction stops, it flushes any remaining collection, even
> +if it contains fewer than @var{n} elements.
>
> Stateful.
> @end deffn
> @@ -6080,13 +6080,13 @@ The bytevector-u8 version of list-reduce.
> @end deffn
>
> @deffn {Scheme Procedure} port-reduce f identity reader port
> -The port version of list-reducer. It reduces over port using reader
> +The port version of list-reduce. It reduces over port using reader
> until reader returns the EOF object.
> @end deffn
>
> @deffn {Scheme Procedure} generator-reduce f identity gen
> -The port version of list-reduce. It reduces over @code{gen} until it
> -returns the EOF object
> +The generator version of list-reduce. It reduces over @code{gen} until
> +it returns the EOF object
> @end deffn
>
> @c srfi-modules.texi ends here
> --
> 2.32.0
>
>
>
>
>
[-- Attachment #1: Type: text/plain, Size: 250 bytes --] > As the author of most of the part with corrections: thank you. I am > cleaning up the reference implementation as well, so this is very > welcome! You're welcome! :-) I find SRFI-171 to be very useful. It has changed the way I write scheme code. [-- Attachment #2: signature.asc --] [-- Type: application/pgp-signature, Size: 524 bytes --]
Patch applied in c5f443de79d1cb16ddf34873adb185599836a91b. Thanks!