Primož Peterlin primoz.peterlin@biofiz.mf.uni-lj.si
http://sizif.mf.uni-lj.si/~peterlin/
Réjean Payette rejean.payette@rtsq.qc.ca
+Reuben Thomas rrt@sc3d.org
+ http://rrt.sc3d.org/
Ricard Torres torres@upf.es
Richard Plasun plasun@iue.tuwien.ac.at
Richard Stallman rms@gnu.org
+2008-02-19 François Pinard <pinard@iro.umontreal.ca>
+
+ * recode.texi: English corrections.
+ Reported by Reuben Thomas.
+
2008-02-16 François Pinard <pinard@iro.umontreal.ca>
* mdate-sh, texinfo.tex: Modified by Automake 1.10.
\1f
Indirect:
recode.info-1: 1138
-recode.info-2: 244475
+recode.info-2: 244436
\1f
Tag Table:
(Indirect)
Node: count-characters\7f109716
Node: dump-with-names\7f110389
Node: libiconv\7f112942
-Node: Tabular\7f124526
-Node: ASCII misc\7f146792
-Node: ASCII\7f147158
-Node: ISO 8859\7f147979
-Node: ASCII-BS\7f150278
-Node: flat\7f152117
-Node: IBM and MS\7f152790
-Node: EBCDIC\7f153363
-Node: IBM-PC\7f155477
-Ref: IBM-PC-Footnote-1\7f157599
-Node: Icon-QNX\7f157757
-Node: CDC\7f158184
-Node: Display Code\7f159888
-Ref: Display Code-Footnote-1\7f162172
-Node: CDC-NOS\7f162377
-Node: Bang-Bang\7f164341
-Node: Micros\7f166272
-Node: Apple-Mac\7f166657
-Node: AtariST\7f168713
-Node: Miscellaneous\7f169703
-Node: HTML\7f170440
-Node: LaTeX\7f176468
-Node: Texinfo\7f177244
-Node: Vietnamese\7f178024
-Node: African\7f179004
-Node: Others\7f180360
-Node: Texte\7f181818
-Ref: Texte-Footnote-1\7f186373
-Ref: Texte-Footnote-2\7f186453
-Ref: Texte-Footnote-3\7f186928
-Node: Mule\7f187025
-Ref: Mule-Footnote-1\7f188812
-Node: Surfaces\7f189331
-Ref: Surfaces-Footnote-1\7f192319
-Node: Permutations\7f192425
-Node: End lines\7f193270
-Node: MIME\7f195477
-Node: Dump\7f196668
-Node: Test\7f200862
-Node: Internals\7f203342
-Node: Main flow\7f204581
-Node: New charsets\7f207701
-Node: New surfaces\7f212244
-Node: Design\7f212972
-Ref: Design-Footnote-1\7f222198
-Node: Concept Index\7f222302
-Node: Option Index\7f237045
-Node: Library Index\7f239898
-Node: Charset and Surface Index\7f244475
+Node: Tabular\7f124499
+Node: ASCII misc\7f146765
+Node: ASCII\7f147131
+Node: ISO 8859\7f147951
+Node: ASCII-BS\7f150249
+Node: flat\7f152088
+Node: IBM and MS\7f152761
+Node: EBCDIC\7f153334
+Node: IBM-PC\7f155448
+Ref: IBM-PC-Footnote-1\7f157570
+Node: Icon-QNX\7f157729
+Node: CDC\7f158156
+Node: Display Code\7f159860
+Ref: Display Code-Footnote-1\7f162144
+Node: CDC-NOS\7f162349
+Node: Bang-Bang\7f164313
+Node: Micros\7f166244
+Node: Apple-Mac\7f166629
+Node: AtariST\7f168685
+Node: Miscellaneous\7f169675
+Node: HTML\7f170412
+Node: LaTeX\7f176440
+Node: Texinfo\7f177216
+Node: Vietnamese\7f177996
+Node: African\7f178976
+Node: Others\7f180332
+Node: Texte\7f181790
+Ref: Texte-Footnote-1\7f186345
+Ref: Texte-Footnote-2\7f186425
+Ref: Texte-Footnote-3\7f186900
+Node: Mule\7f186997
+Ref: Mule-Footnote-1\7f188784
+Node: Surfaces\7f189303
+Ref: Surfaces-Footnote-1\7f192291
+Node: Permutations\7f192397
+Node: End lines\7f193242
+Node: MIME\7f195449
+Node: Dump\7f196640
+Node: Test\7f200834
+Node: Internals\7f203314
+Node: Main flow\7f204553
+Node: New charsets\7f207673
+Node: New surfaces\7f212216
+Node: Design\7f212944
+Ref: Design-Footnote-1\7f222159
+Node: Concept Index\7f222263
+Node: Option Index\7f237006
+Node: Library Index\7f239859
+Node: Charset and Surface Index\7f244436
\1f
End Tag Table
`ISO-2022-KR'
`csISO2022KR' and `ISO2022KR' are aliases for this charset.
- `CHAR'
-
- `WCHAR_T'
-
\1f
File: recode.info, Node: Tabular, Next: ASCII misc, Prev: libiconv, Up: Top
===============
This charset is available in `recode' under the name `ASCII'. In fact,
-it's true name is `ANSI_X3.4-1968' as per RFC 1345, accepted aliases
+its true name is `ANSI_X3.4-1968' as per RFC 1345, accepted aliases
being `ANSI_X3.4-1986', `ASCII', `IBM367', `ISO646-US',
`ISO_646.irv:1991', `US-ASCII', `cp367', `iso-ir-6' and `us'. The
shortest way of specifying it in `recode' is `us'.
proposed).
The ISO Latin Alphabet 1 is available as a charset in `recode' under
-the name `Latin-1'. In fact, it's true name is `ISO_8859-1:1987' as
-per RFC 1345, accepted aliases being `CP819', `IBM819', `ISO-8859-1',
+the name `Latin-1'. In fact, its true name is `ISO_8859-1:1987' as per
+RFC 1345, accepted aliases being `CP819', `IBM819', `ISO-8859-1',
`ISO_8859-1', `iso-ir-100', `l1' and `Latin-1'. The shortest way of
specifying it in `recode' is `l1'.
---------- Footnotes ----------
(1) On DOS/Windows, stock shells do not know that apostrophes quote
-special characters like `|', so one need to use double quotes instead
+special characters like `|', so one needs to use double quotes instead
of apostrophes.
\1f
re-encodings are involved, as it happens in true life,
synchronising the input buffer back to where it should have
stopped, when the output buffer becomes full, is a difficult
- problem. Oh, we could make it simpler at the expense of loosing
+ problem. Oh, we could make it simpler at the expense of losing
space or speed: by inserting markers between each input character
and counting them at the output end; by processing only one
character in a time through the whole sequence; by repeatedly
attempting to recode various subsets of the input buffer, binary
searching on their length until the output just fits. The
- overhead of such solutions looks fully prohibitive to me, and the
- gain very minimal. I do not see a real advantage, nowadays,
- imposing a fixed length to an output buffer. It makes things so
- much simpler and efficient to just let the output buffer size
- float a bit.
+ overhead of such solutions looks prohibitive to me, and the gain
+ very minimal. I do not see a real advantage, nowadays, imposing a
+ fixed length to an output buffer. It makes things so much simpler
+ and efficient to just let the output buffer size float a bit.
Of course, if the above problem was solved, the `iconv' library
should be easily emulated, given that `recode' has similar
past experience, I think it is unduly hard to fully implement this
scheme. It would be awkward that we do contortions for the sole
purpose of implementing exactly its specification, without real,
- fairly sounded reasons (other then the fact some people once
+ properly grounded reasons (other then the fact some people once
thought it was worth standardising). It is much better to
immediately aim for the refinement we need, without uselessly
forcing us into the dubious detour `iconv' represents.
limitations. In the long run, we should not have to explain to
our users that some recodings may not be made available just
because they do not fit the simple model we had in mind when we
- did it. Instead, we should try to stay opened to the difficulties
+ did it. Instead, we should try to stay open to the difficulties
of real life. There is still a lot of complex needs for Asian
people, say, that `recode' does not currently address, while it
should. Not only the doors should stay open, but we should force
@tindex iso-ir-6
@tindex us
This charset is available in @code{recode} under the name @code{ASCII}.
-In fact, it's true name is @code{ANSI_X3.4-1968} as per @w{RFC 1345},
+In fact, its true name is @code{ANSI_X3.4-1968} as per @w{RFC 1345},
accepted aliases being @code{ANSI_X3.4-1986}, @code{ASCII},
@code{IBM367}, @code{ISO646-US}, @code{ISO_646.irv:1991},
@code{US-ASCII}, @code{cp367}, @code{iso-ir-6} and @code{us}. The
@tindex Latin-1
The ISO Latin Alphabet 1 is available as a charset in @code{recode} under
-the name @code{Latin-1}. In fact, it's true name is @code{ISO_8859-1:1987}
+the name @code{Latin-1}. In fact, its true name is @code{ISO_8859-1:1987}
as per @w{RFC 1345}, accepted aliases being @code{CP819}, @code{IBM819},
@code{ISO-8859-1}, @code{ISO_8859-1}, @code{iso-ir-100}, @code{l1}
and @code{Latin-1}. The shortest way of specifying it in @code{recode}
@w{RFC 1345} brings into @code{recode} 44 @samp{IBM} charsets or code pages,
and also 8 other code pages. You can get a list of these all these by
executing:@footnote{On DOS/Windows, stock shells do not know that apostrophes
-quote special characters like @kbd{|}, so one need to use double quotes
+quote special characters like @kbd{|}, so one needs to use double quotes
instead of apostrophes.}
@example
are involved, as it happens in true life, synchronising the input buffer
back to where it should have stopped, when the output buffer becomes full,
is a difficult problem. Oh, we could make it simpler at the expense of
-loosing space or speed: by inserting markers between each input character
+losing space or speed: by inserting markers between each input character
and counting them at the output end; by processing only one character in a
time through the whole sequence; by repeatedly attempting to recode various
subsets of the input buffer, binary searching on their length until the
-output just fits. The overhead of such solutions looks fully prohibitive
+output just fits. The overhead of such solutions looks prohibitive
to me, and the gain very minimal. I do not see a real advantage, nowadays,
imposing a fixed length to an output buffer. It makes things so much
simpler and efficient to just let the output buffer size float a bit.
for real cases. From past experience, I think it is unduly hard to fully
implement this scheme. It would be awkward that we do contortions for
the sole purpose of implementing exactly its specification, without real,
-fairly sounded reasons (other then the fact some people once thought it
+properly grounded reasons (other then the fact some people once thought it
was worth standardising). It is much better to immediately aim for the
refinement we need, without uselessly forcing us into the dubious detour
@code{iconv} represents.
arbitrary limitations. In the long run, we should not have to explain
to our users that some recodings may not be made available just because
they do not fit the simple model we had in mind when we did it. Instead,
-we should try to stay opened to the difficulties of real life. There is
+we should try to stay open to the difficulties of real life. There is
still a lot of complex needs for Asian people, say, that @code{recode}
does not currently address, while it should. Not only the doors should
stay open, but we should force them wider!
-@set UPDATED 18 February 2008
+@set UPDATED 19 February 2008
@set UPDATED-MONTH February 2008
@set EDITION 3.6
@set VERSION 3.6
-@set UPDATED 18 February 2008
+@set UPDATED 19 February 2008
@set UPDATED-MONTH February 2008
@set EDITION 3.6
@set VERSION 3.6