Re: Typo fixes
Shiro Kawai <[email protected]> Wed, 22 Jan 2025 17:44:10 -1000
| Newsgroups | gmane.lisp.scheme.gauche |
|---|---|
| Message-ID | <CALN0JNGS0T-936imv1pN21EeY+32ACQL3Bgp+Lea89yHKFj3Qw@mail.gmail.com> |
--===============2821123317479071373== Content-Type: multipart/alternative; boundary="000000000000e8530b062c576c74" --000000000000e8530b062c576c74 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Thanks. Patch applied. On Wed, Jan 22, 2025 at 5:15=E2=80=AFAM Jens Thiele <[email protected]> wrote: > diff --git a/doc/modsrfi.texi b/doc/modsrfi.texi > index 391dcd3f6..490d3f878 100644 > --- a/doc/modsrfi.texi > +++ b/doc/modsrfi.texi > @@ -13433,7 +13433,7 @@ Same as @code{(map enum-name (enum-set->enum-list > eset))}. > @mdindex srfi.210 > @c EN > This module provides macros and procedures to blend multiple-value > -expressions naturally into the orinary single-value expressions. > +expressions naturally into the ordinary single-value expressions. > @c JP > =E3=81=93=E3=81=AE=E3=83=A2=E3=82=B8=E3=83=A5=E3=83=BC=E3=83=AB=E3=81=AF= =E3=80=81=E8=A4=87=E6=95=B0=E3=81=AE=E5=80=A4=E3=82=92=E8=BF=94=E3=81=99=E5= =BC=8F=E3=82=92=E9=80=9A=E5=B8=B8=E3=81=AE=E5=8D=98=E4=B8=80=E3=81=AE=E5=80= =A4=E3=82=92=E6=89=B1=E3=81=86=E5=BC=8F=E3=81=AB=E3=81=86=E3=81=BE=E3=81=8F= =E6=B7=B7=E3=81=9C=E3=81=A6=E4=BD=BF=E3=81=88=E3=82=8B=E3=82=88=E3=81=86=E3= =81=AB=E3=81=99=E3=82=8B > =E3=83=9E=E3=82=AF=E3=83=AD=E3=82=84=E6=89=8B=E7=B6=9A=E3=81=8D=E3=82=92= =E6=8F=90=E4=BE=9B=E3=81=97=E3=81=BE=E3=81=99=E3=80=82 > diff --git a/doc/modutil.texi b/doc/modutil.texi > index 6092151bb..e01d1216d 100644 > --- a/doc/modutil.texi > +++ b/doc/modutil.texi > @@ -2489,7 +2489,7 @@ returned input port. > This module provides high-level utilities to run code in parallel > using threads. > For example, the @code{pmap} procedure applies the given procedure > -on each elements in the collection and gathers the restuls into a list, > +on each elements in the collection and gathers the results into a list, > just like @code{map}, but the appliation of the procedure is done in > parallel. > @c JP > =E3=81=93=E3=81=AE=E3=83=A2=E3=82=B8=E3=83=A5=E3=83=BC=E3=83=AB=E3=81=AF= =E3=80=81=E3=82=B3=E3=83=BC=E3=83=89=E3=82=92=E8=A4=87=E6=95=B0=E3=82=B9=E3= =83=AC=E3=83=83=E3=83=89=E3=81=A7=E4=B8=A6=E5=88=97=E3=81=AB=E8=B5=B0=E3=82= =89=E3=81=9B=E3=82=8B=E9=AB=98=E3=83=AC=E3=83=99=E3=83=AB=E3=83=A6=E3=83=BC= =E3=83=86=E3=82=A3=E3=83=AA=E3=83=86=E3=82=A3=E3=82=92=E6=8F=90=E4=BE=9B=E3= =81=97=E3=81=BE=E3=81=99=E3=80=82 > @@ -2601,7 +2601,7 @@ cancelled and the condition is reraised. > @subheading Mappers > > @c EN > -A mapper is an object that encapsulates a storategy to run > +A mapper is an object that encapsulates a strategy to run > tasks in parallel. We provide the following mappers. > @c JP > mapper=E3=81=AF=E3=82=BF=E3=82=B9=E3=82=AF=E3=82=92=E4=B8=A6=E5=88=97=E3= =81=AB=E8=B5=B0=E3=82=89=E3=81=9B=E3=82=8B=E6=88=A6=E7=95=A5=E3=82=92=E3=82= =AB=E3=83=97=E3=82=BB=E3=83=AB=E5=8C=96=E3=81=97=E3=81=9F=E3=82=82=E3=81=AE= =E3=81=A7=E3=81=99=E3=80=82 > diff --git a/lib/control/future.scm b/lib/control/future.scm > index b512b505c..b0e17ed70 100644 > --- a/lib/control/future.scm > +++ b/lib/control/future.scm > @@ -34,7 +34,7 @@ > ;; This is a provisional implementation; we'll use implicit thread pool > ;; to avoid thread creation overhead eventually. > > -;; Guile and Racket uses 'touch' to retrive the result of a future, but > +;; Guile and Racket uses 'touch' to retrieve the result of a future, but > ;; that name seems too generic. We adopt 'future-get'. > > ;; If a future already finished computation, 'future-get' returns > immediately > diff --git a/lib/control/pmap.scm b/lib/control/pmap.scm > index 428a75ce6..69176efc4 100644 > --- a/lib/control/pmap.scm > +++ b/lib/control/pmap.scm > @@ -54,7 +54,7 @@ > ;; sequential-mapper - A sigleton mapper that runs in a single > (current) thread. > ;; If the running system is single-core, this is the default mapper= . > ;; > -;; pool-mapper - Use thread pool. This is ideal when each task requie= s > +;; pool-mapper - Use thread pool. This is ideal when each task requir= es > ;; some processing time, so that the overhead of thread pool is > ;; negligible. > ;; > diff --git a/lib/text/unicode/ucd.scm b/lib/text/unicode/ucd.scm > index 706f10137..111989fb0 100644 > --- a/lib/text/unicode/ucd.scm > +++ b/lib/text/unicode/ucd.scm > @@ -603,7 +603,7 @@ > ;;; > > ;; Dump format should be regarded as internal - we may change it at any > -;; tiem as we like. > +;; time as we like. > > ;; For now, we dump it in three parts, correspoinding to the unichar-db > ;; slots. To suppress the size of the dump, we use simple run-length > diff --git a/src/thread.c b/src/thread.c > index e26a22f5e..a78b0fdeb 100644 > --- a/src/thread.c > +++ b/src/thread.c > @@ -376,7 +376,7 @@ ScmObj Scm_ThreadSleep(ScmObj timeout) > in VM loop, it responds to the flag and terminates itself. > > If that fails, we send a signal to the thread. If the thread is > blocked > - by a system call, this most likely unblocks the thread and termnates > it. > + by a system call, this most likely unblocks the thread and terminates > it. > (We use a dedicated signal. > > There are cases when signals can fail. On POSIX platform, if the > thread > > _______________________________________________ > Gauche-devel mailing list > [email protected] > https://lists.sourceforge.net/lists/listinfo/gauche-devel > --000000000000e8530b062c576c74 Content-Type: text/html; charset="UTF-8" Content-Transfer-Encoding: quoted-printable <div dir=3D"ltr">Thanks.=C2=A0 Patch applied.<div><br></div></div><br><div = class=3D"gmail_quote gmail_quote_container"><div dir=3D"ltr" class=3D"gmail= _attr">On Wed, Jan 22, 2025 at 5:15=E2=80=AFAM Jens Thiele <<a href=3D"m= ailto:[email protected]">[email protected]</a>> wrote:<br></div><blockquote cl= ass=3D"gmail_quote" style=3D"margin:0px 0px 0px 0.8ex;border-left:1px solid= rgb(204,204,204);padding-left:1ex">diff --git a/doc/modsrfi.texi b/doc/mod= srfi.texi<br> index 391dcd3f6..490d3f878 100644<br> --- a/doc/modsrfi.texi<br> +++ b/doc/modsrfi.texi<br> @@ -13433,7 +13433,7 @@ Same as @code{(map enum-name (enum-set->enum-lis= t eset))}.<br> =C2=A0@mdindex srfi.210<br> =C2=A0@c EN<br> =C2=A0This module provides macros and procedures to blend multiple-value<br= > -expressions naturally into the orinary single-value expressions.<br> +expressions naturally into the ordinary single-value expressions.<br> =C2=A0@c JP<br> =C2=A0=E3=81=93=E3=81=AE=E3=83=A2=E3=82=B8=E3=83=A5=E3=83=BC=E3=83=AB=E3=81= =AF=E3=80=81=E8=A4=87=E6=95=B0=E3=81=AE=E5=80=A4=E3=82=92=E8=BF=94=E3=81=99= =E5=BC=8F=E3=82=92=E9=80=9A=E5=B8=B8=E3=81=AE=E5=8D=98=E4=B8=80=E3=81=AE=E5= =80=A4=E3=82=92=E6=89=B1=E3=81=86=E5=BC=8F=E3=81=AB=E3=81=86=E3=81=BE=E3=81= =8F=E6=B7=B7=E3=81=9C=E3=81=A6=E4=BD=BF=E3=81=88=E3=82=8B=E3=82=88=E3=81=86= =E3=81=AB=E3=81=99=E3=82=8B<br> =C2=A0=E3=83=9E=E3=82=AF=E3=83=AD=E3=82=84=E6=89=8B=E7=B6=9A=E3=81=8D=E3=82= =92=E6=8F=90=E4=BE=9B=E3=81=97=E3=81=BE=E3=81=99=E3=80=82<br> diff --git a/doc/modutil.texi b/doc/modutil.texi<br> index 6092151bb..e01d1216d 100644<br> --- a/doc/modutil.texi<br> +++ b/doc/modutil.texi<br> @@ -2489,7 +2489,7 @@ returned input port.<br> =C2=A0This module provides high-level utilities to run code in parallel<br> =C2=A0using threads.<br> =C2=A0For example, the @code{pmap} procedure applies the given procedure<br= > -on each elements in the collection and gathers the restuls into a list,<br= > +on each elements in the collection and gathers the results into a list,<br= > =C2=A0just like @code{map}, but the appliation of the procedure is done in = parallel.<br> =C2=A0@c JP<br> =C2=A0=E3=81=93=E3=81=AE=E3=83=A2=E3=82=B8=E3=83=A5=E3=83=BC=E3=83=AB=E3=81= =AF=E3=80=81=E3=82=B3=E3=83=BC=E3=83=89=E3=82=92=E8=A4=87=E6=95=B0=E3=82=B9= =E3=83=AC=E3=83=83=E3=83=89=E3=81=A7=E4=B8=A6=E5=88=97=E3=81=AB=E8=B5=B0=E3= =82=89=E3=81=9B=E3=82=8B=E9=AB=98=E3=83=AC=E3=83=99=E3=83=AB=E3=83=A6=E3=83= =BC=E3=83=86=E3=82=A3=E3=83=AA=E3=83=86=E3=82=A3=E3=82=92=E6=8F=90=E4=BE=9B= =E3=81=97=E3=81=BE=E3=81=99=E3=80=82<br> @@ -2601,7 +2601,7 @@ cancelled and the condition is reraised.<br> =C2=A0@subheading Mappers<br> <br> =C2=A0@c EN<br> -A mapper is an object that encapsulates a storategy to run<br> +A mapper is an object that encapsulates a strategy to run<br> =C2=A0tasks in parallel.=C2=A0 We provide the following mappers.<br> =C2=A0@c JP<br> =C2=A0mapper=E3=81=AF=E3=82=BF=E3=82=B9=E3=82=AF=E3=82=92=E4=B8=A6=E5=88=97= =E3=81=AB=E8=B5=B0=E3=82=89=E3=81=9B=E3=82=8B=E6=88=A6=E7=95=A5=E3=82=92=E3= =82=AB=E3=83=97=E3=82=BB=E3=83=AB=E5=8C=96=E3=81=97=E3=81=9F=E3=82=82=E3=81= =AE=E3=81=A7=E3=81=99=E3=80=82<br> diff --git a/lib/control/future.scm b/lib/control/future.scm<br> index b512b505c..b0e17ed70 100644<br> --- a/lib/control/future.scm<br> +++ b/lib/control/future.scm<br> @@ -34,7 +34,7 @@<br> =C2=A0;; This is a provisional implementation; we'll use implicit threa= d pool<br> =C2=A0;; to avoid thread creation overhead eventually.<br> <br> -;; Guile and Racket uses 'touch' to retrive the result of a future= , but<br> +;; Guile and Racket uses 'touch' to retrieve the result of a futur= e, but<br> =C2=A0;; that name seems too generic.=C2=A0 We adopt 'future-get'.<= br> <br> =C2=A0;; If a future already finished computation, 'future-get' ret= urns immediately<br> diff --git a/lib/control/pmap.scm b/lib/control/pmap.scm<br> index 428a75ce6..69176efc4 100644<br> --- a/lib/control/pmap.scm<br> +++ b/lib/control/pmap.scm<br> @@ -54,7 +54,7 @@<br> =C2=A0;;=C2=A0 =C2=A0sequential-mapper - A sigleton mapper that runs in a s= ingle (current) thread.<br> =C2=A0;;=C2=A0 =C2=A0 =C2=A0 If the running system is single-core, this is = the default mapper.<br> =C2=A0;;<br> -;;=C2=A0 =C2=A0pool-mapper - Use thread pool.=C2=A0 This is ideal when eac= h task requies<br> +;;=C2=A0 =C2=A0pool-mapper - Use thread pool.=C2=A0 This is ideal when eac= h task requires<br> =C2=A0;;=C2=A0 =C2=A0 =C2=A0 some processing time, so that the overhead of = thread pool is<br> =C2=A0;;=C2=A0 =C2=A0 =C2=A0 negligible.<br> =C2=A0;;<br> diff --git a/lib/text/unicode/ucd.scm b/lib/text/unicode/ucd.scm<br> index 706f10137..111989fb0 100644<br> --- a/lib/text/unicode/ucd.scm<br> +++ b/lib/text/unicode/ucd.scm<br> @@ -603,7 +603,7 @@<br> =C2=A0;;;<br> <br> =C2=A0;; Dump format should be regarded as internal - we may change it at a= ny<br> -;; tiem as we like.<br> +;; time as we like.<br> <br> =C2=A0;; For now, we dump it in three parts, correspoinding to the unichar-= db<br> =C2=A0;; slots.=C2=A0 To suppress the size of the dump, we use simple run-l= ength<br> diff --git a/src/thread.c b/src/thread.c<br> index e26a22f5e..a78b0fdeb 100644<br> --- a/src/thread.c<br> +++ b/src/thread.c<br> @@ -376,7 +376,7 @@ ScmObj Scm_ThreadSleep(ScmObj timeout)<br> =C2=A0 =C2=A0 in VM loop, it responds to the flag and terminates itself.<br= > <br> =C2=A0 =C2=A0 If that fails, we send a signal to the thread.=C2=A0 If the t= hread is blocked<br> -=C2=A0 =C2=A0by a system call, this most likely unblocks the thread and te= rmnates it.<br> +=C2=A0 =C2=A0by a system call, this most likely unblocks the thread and te= rminates it.<br> =C2=A0 =C2=A0 (We use a dedicated signal.<br> <br> =C2=A0 =C2=A0 There are cases when signals can fail.=C2=A0 On POSIX platfor= m, if the thread<br> <br> _______________________________________________<br> Gauche-devel mailing list<br> <a href=3D"mailto:[email protected]" target=3D"_blank">Gau= [email protected]</a><br> <a href=3D"https://lists.sourceforge.net/lists/listinfo/gauche-devel" rel= =3D"noreferrer" target=3D"_blank">https://lists.sourceforge.net/lists/listi= nfo/gauche-devel</a><br> </blockquote></div> --000000000000e8530b062c576c74-- --===============2821123317479071373== Content-Type: text/plain; charset="us-ascii" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Disposition: inline --===============2821123317479071373== Content-Type: text/plain; charset="us-ascii" MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Disposition: inline _______________________________________________ Gauche-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/gauche-devel --===============2821123317479071373==--