[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[gawk-diffs] [SCM] gawk branch, gawk-4.1-stable, updated. gawk-4.1.0-577
|
From: |
Arnold Robbins |
|
Subject: |
[gawk-diffs] [SCM] gawk branch, gawk-4.1-stable, updated. gawk-4.1.0-577-g38162ad |
|
Date: |
Fri, 06 Feb 2015 08:29:28 +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 "gawk".
The branch, gawk-4.1-stable has been updated
via 38162ad82080f1dd6f347fe2bc4e83478a7dc9c4 (commit)
from 1736b4db53dc60f1e7a9659dc201e0562d43aa02 (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 -----------------------------------------------------------------
http://git.sv.gnu.org/cgit/gawk.git/commit/?id=38162ad82080f1dd6f347fe2bc4e83478a7dc9c4
commit 38162ad82080f1dd6f347fe2bc4e83478a7dc9c4
Author: Arnold D. Robbins <address@hidden>
Date: Fri Feb 6 10:29:11 2015 +0200
O'Reilly edits.
diff --git a/doc/ChangeLog b/doc/ChangeLog
index 95022ee..9fc7bdc 100644
--- a/doc/ChangeLog
+++ b/doc/ChangeLog
@@ -1,3 +1,7 @@
+2015-02-06 Arnold D. Robbins <address@hidden>
+
+ * gawktexi.in: O'Reilly fixes.
+
2015-02-04 Arnold D. Robbins <address@hidden>
* gawktexi.in: O'Reilly fixes.
@@ -50,7 +54,7 @@
2015-01-19 Arnold D. Robbins <address@hidden>
* gawkinet.texi: Fix capitalization in document title.
- * gawktexi.in: Here we again: Starting on more O'Reilly fixes.
+ * gawktexi.in: Here we go again: Starting on more O'Reilly fixes.
2014-12-26 Antonio Giovanni Colombo <address@hidden>
diff --git a/doc/gawk.info b/doc/gawk.info
index 8e6a4f2..9381b50 100644
--- a/doc/gawk.info
+++ b/doc/gawk.info
@@ -18981,7 +18981,7 @@ File: gawk.info, Node: Programs Summary, Next:
Programs Exercises, Prev: Misc
the separator can considerably simplify such tasks.
* The examples here demonstrate the usefulness of the library
- functions from *note Library Functions:: for a number of real (if
+ functions from *note Library Functions::, for a number of real (if
small) programs.
* Besides reinventing POSIX wheels, other programs solved a
@@ -19103,16 +19103,16 @@ File: gawk.info, Node: Advanced Features, Next:
Internationalization, Prev: S
This major node discusses advanced features in `gawk'. It's a bit
of a "grab bag" of items that are otherwise unrelated to each other.
-First, a command-line option allows `gawk' to recognize nondecimal
-numbers in input data, not just in `awk' programs. Then, `gawk''s
-special features for sorting arrays are presented. Next, two-way I/O,
-discussed briefly in earlier parts of this Info file, is described in
-full detail, along with the basics of TCP/IP networking. Finally,
-`gawk' can "profile" an `awk' program, making it possible to tune it
-for performance.
+First, we look at a command-line option that allows `gawk' to recognize
+nondecimal numbers in input data, not just in `awk' programs. Then,
+`gawk''s special features for sorting arrays are presented. Next,
+two-way I/O, discussed briefly in earlier parts of this Info file, is
+described in full detail, along with the basics of TCP/IP networking.
+Finally, we see how `gawk' can "profile" an `awk' program, making it
+possible to tune it for performance.
- A number of advanced features require separate major nodes of their
-own:
+ Additional advanced features are discussed in separate major nodes
+of their own:
* *note Internationalization::, discusses how to internationalize
your `awk' programs, so that they can speak multiple national
@@ -19186,7 +19186,7 @@ File: gawk.info, Node: Array Sorting, Next: Two-way
I/O, Prev: Nondecimal Dat
12.2 Controlling Array Traversal and Array Sorting
==================================================
-`gawk' lets you control the order in which a `for (i in array)' loop
+`gawk' lets you control the order in which a `for (INDX in ARRAY)' loop
traverses an array.
In addition, two built-in functions, `asort()' and `asorti()', let
@@ -19205,9 +19205,9 @@ File: gawk.info, Node: Controlling Array Traversal,
Next: Array Sorting Functi
12.2.1 Controlling Array Traversal
----------------------------------
-By default, the order in which a `for (i in array)' loop scans an array
-is not defined; it is generally based upon the internal implementation
-of arrays inside `awk'.
+By default, the order in which a `for (INDX in ARRAY)' loop scans an
+array is not defined; it is generally based upon the internal
+implementation of arrays inside `awk'.
Often, though, it is desirable to be able to loop over the elements
in a particular order that you, the programmer, choose. `gawk' lets
@@ -19229,21 +19229,22 @@ arguments:
RETURN < 0; 0; OR > 0
}
- Here, I1 and I2 are the indices, and V1 and V2 are the corresponding
-values of the two elements being compared. Either V1 or V2, or both,
-can be arrays if the array being traversed contains subarrays as values.
-(*Note Arrays of Arrays::, for more information about subarrays.) The
-three possible return values are interpreted as follows:
+ Here, `i1' and `i2' are the indices, and `v1' and `v2' are the
+corresponding values of the two elements being compared. Either `v1'
+or `v2', or both, can be arrays if the array being traversed contains
+subarrays as values. (*Note Arrays of Arrays::, for more information
+about subarrays.) The three possible return values are interpreted as
+follows:
`comp_func(i1, v1, i2, v2) < 0'
- Index I1 comes before index I2 during loop traversal.
+ Index `i1' comes before index `i2' during loop traversal.
`comp_func(i1, v1, i2, v2) == 0'
- Indices I1 and I2 come together but the relative order with
+ Indices `i1' and `i2' come together, but the relative order with
respect to each other is undefined.
`comp_func(i1, v1, i2, v2) > 0'
- Index I1 comes after index I2 during loop traversal.
+ Index `i1' comes after index `i2' during loop traversal.
Our first comparison function can be used to scan an array in
numerical order of the indices:
@@ -19386,7 +19387,7 @@ elements compare equal. This is usually not a problem,
but letting the
tied elements come out in arbitrary order can be an issue, especially
when comparing item values. The partial ordering of the equal elements
may change the next time the array is traversed, if other elements are
-added or removed from the array. One way to resolve ties when
+added to or removed from the array. One way to resolve ties when
comparing elements with otherwise equal values is to include the
indices in the comparison rules. Note that doing this may make the
loop traversal less efficient, so consider it only if necessary. The
@@ -19420,14 +19421,14 @@ lowercase letters as equivalent or distinct.
Another point to keep in mind is that in the case of subarrays, the
element values can themselves be arrays; a production comparison
-function should use the `isarray()' function (*note Type Functions::),
+function should use the `isarray()' function (*note Type Functions::)
to check for this, and choose a defined sorting order for subarrays.
All sorting based on `PROCINFO["sorted_in"]' is disabled in POSIX
mode, because the `PROCINFO' array is not special in that case.
As a side note, sorting the array indices before traversing the
-array has been reported to add 15% to 20% overhead to the execution
+array has been reported to add a 15% to 20% overhead to the execution
time of `awk' programs. For this reason, sorted array traversal is not
the default.
@@ -19476,8 +19477,8 @@ array is not affected.
Often, what's needed is to sort on the values of the _indices_
instead of the values of the elements. To do that, use the `asorti()'
function. The interface and behavior are identical to that of
-`asort()', except that the index values are used for sorting, and
-become the values of the result array:
+`asort()', except that the index values are used for sorting and become
+the values of the result array:
{ source[$0] = some_func($0) }
@@ -19509,8 +19510,8 @@ chooses_, taking into account just the indices, just
the values, or
both. This is extremely powerful.
Once the array is sorted, `asort()' takes the _values_ in their
-final order, and uses them to fill in the result array, whereas
-`asorti()' takes the _indices_ in their final order, and uses them to
+final order and uses them to fill in the result array, whereas
+`asorti()' takes the _indices_ in their final order and uses them to
fill in the result array.
NOTE: Copying array indices and elements isn't expensive in terms
@@ -19708,7 +19709,7 @@ REMOTE-PORT
name.
NOTE: Failure in opening a two-way socket will result in a
- non-fatal error being returned to the calling code. The value of
+ nonfatal error being returned to the calling code. The value of
`ERRNO' indicates the error (*note Auto-set::).
Consider the following very simple example:
@@ -19789,8 +19790,8 @@ First, the `awk' program:
junk
Here is the `awkprof.out' that results from running the `gawk'
-profiler on this program and data. (This example also illustrates that
-`awk' programmers sometimes get up very early in the morning to work.)
+profiler on this program and data (this example also illustrates that
+`awk' programmers sometimes get up very early in the morning to work):
# gawk profile, created Mon Sep 29 05:16:21 2014
@@ -19843,7 +19844,7 @@ profiler on this program and data. (This example also
illustrates that
output. They are as follows:
* The program is printed in the order `BEGIN' rules, `BEGINFILE'
- rules, pattern/action rules, `ENDFILE' rules, `END' rules and
+ rules, pattern-action rules, `ENDFILE' rules, `END' rules, and
functions, listed alphabetically. Multiple `BEGIN' and `END'
rules retain their separate identities, as do multiple `BEGINFILE'
and `ENDFILE' rules.
@@ -19888,15 +19889,15 @@ output. They are as follows:
scalar, it gets parenthesized.
* `gawk' supplies leading comments in front of the `BEGIN' and `END'
- rules, the `BEGINFILE' and `ENDFILE' rules, the pattern/action
+ rules, the `BEGINFILE' and `ENDFILE' rules, the pattern-action
rules, and the functions.
The profiled version of your program may not look exactly like what
you typed when you wrote it. This is because `gawk' creates the
-profiled version by "pretty printing" its internal representation of
+profiled version by "pretty-printing" its internal representation of
the program. The advantage to this is that `gawk' can produce a
-standard representation. The disadvantage is that all source-code
+standard representation. The disadvantage is that all source code
comments are lost. Also, things such as:
/foo/
@@ -19945,15 +19946,15 @@ output profile file.
produces the profile and the function call trace and then exits.
When `gawk' runs on MS-Windows systems, it uses the `INT' and `QUIT'
-signals for producing the profile and, in the case of the `INT' signal,
+signals for producing the profile, and in the case of the `INT' signal,
`gawk' exits. This is because these systems don't support the `kill'
command, so the only signals you can deliver to a program are those
generated by the keyboard. The `INT' signal is generated by the
-`Ctrl-<C>' or `Ctrl-<BREAK>' key, while the `QUIT' signal is generated
-by the `Ctrl-<\>' key.
+`Ctrl-c' or `Ctrl-BREAK' key, while the `QUIT' signal is generated by
+the `Ctrl-\' key.
Finally, `gawk' also accepts another option, `--pretty-print'. When
-called this way, `gawk' "pretty prints" the program into `awkprof.out',
+called this way, `gawk' "pretty-prints" the program into `awkprof.out',
without any execution counts.
NOTE: The `--pretty-print' option still runs your program. This
@@ -19989,7 +19990,7 @@ File: gawk.info, Node: Advanced Features Summary,
Prev: Profiling, Up: Advanc
two-way communications.
* By using special file names with the `|&' operator, you can open a
- TCP/IP (or UDP/IP) connection to remote hosts in the Internet.
+ TCP/IP (or UDP/IP) connection to remote hosts on the Internet.
`gawk' supports both IPv4 and IPv6.
* You can generate statement count profiles of your program. This
@@ -19998,7 +19999,7 @@ File: gawk.info, Node: Advanced Features Summary,
Prev: Profiling, Up: Advanc
`USR1' signal while profiling causes `gawk' to dump the profile
and keep going, including a function call stack.
- * You can also just "pretty print" the program. This currently also
+ * You can also just "pretty-print" the program. This currently also
runs the program, but that will change in the next major release.
@@ -34812,224 +34813,224 @@ Ref: Igawk Program-Footnote-3764907
Node: Anagram Program765022
Node: Signature Program768083
Node: Programs Summary769330
-Node: Programs Exercises770550
-Ref: Programs Exercises-Footnote-1774681
-Node: Advanced Features774772
-Node: Nondecimal Data776720
-Node: Array Sorting778310
-Node: Controlling Array Traversal779007
-Ref: Controlling Array Traversal-Footnote-1787340
-Node: Array Sorting Functions787458
-Ref: Array Sorting Functions-Footnote-1791347
-Node: Two-way I/O791543
-Ref: Two-way I/O-Footnote-1796488
-Ref: Two-way I/O-Footnote-2796674
-Node: TCP/IP Networking796756
-Node: Profiling799629
-Node: Advanced Features Summary807176
-Node: Internationalization809109
-Node: I18N and L10N810589
-Node: Explaining gettext811275
-Ref: Explaining gettext-Footnote-1816300
-Ref: Explaining gettext-Footnote-2816484
-Node: Programmer i18n816649
-Ref: Programmer i18n-Footnote-1821515
-Node: Translator i18n821564
-Node: String Extraction822358
-Ref: String Extraction-Footnote-1823489
-Node: Printf Ordering823575
-Ref: Printf Ordering-Footnote-1826361
-Node: I18N Portability826425
-Ref: I18N Portability-Footnote-1828880
-Node: I18N Example828943
-Ref: I18N Example-Footnote-1831746
-Node: Gawk I18N831818
-Node: I18N Summary832456
-Node: Debugger833795
-Node: Debugging834817
-Node: Debugging Concepts835258
-Node: Debugging Terms837111
-Node: Awk Debugging839683
-Node: Sample Debugging Session840577
-Node: Debugger Invocation841097
-Node: Finding The Bug842481
-Node: List of Debugger Commands848956
-Node: Breakpoint Control850289
-Node: Debugger Execution Control853985
-Node: Viewing And Changing Data857349
-Node: Execution Stack860727
-Node: Debugger Info862364
-Node: Miscellaneous Debugger Commands866381
-Node: Readline Support871410
-Node: Limitations872302
-Node: Debugging Summary874416
-Node: Arbitrary Precision Arithmetic875584
-Node: Computer Arithmetic877000
-Ref: table-numeric-ranges880598
-Ref: Computer Arithmetic-Footnote-1881457
-Node: Math Definitions881514
-Ref: table-ieee-formats884802
-Ref: Math Definitions-Footnote-1885406
-Node: MPFR features885511
-Node: FP Math Caution887182
-Ref: FP Math Caution-Footnote-1888232
-Node: Inexactness of computations888601
-Node: Inexact representation889560
-Node: Comparing FP Values890917
-Node: Errors accumulate891999
-Node: Getting Accuracy893432
-Node: Try To Round896094
-Node: Setting precision896993
-Ref: table-predefined-precision-strings897677
-Node: Setting the rounding mode899466
-Ref: table-gawk-rounding-modes899830
-Ref: Setting the rounding mode-Footnote-1903285
-Node: Arbitrary Precision Integers903464
-Ref: Arbitrary Precision Integers-Footnote-1906450
-Node: POSIX Floating Point Problems906599
-Ref: POSIX Floating Point Problems-Footnote-1910472
-Node: Floating point summary910510
-Node: Dynamic Extensions912704
-Node: Extension Intro914256
-Node: Plugin License915522
-Node: Extension Mechanism Outline916319
-Ref: figure-load-extension916747
-Ref: figure-register-new-function918227
-Ref: figure-call-new-function919231
-Node: Extension API Description921217
-Node: Extension API Functions Introduction922667
-Node: General Data Types927491
-Ref: General Data Types-Footnote-1933230
-Node: Memory Allocation Functions933529
-Ref: Memory Allocation Functions-Footnote-1936368
-Node: Constructor Functions936464
-Node: Registration Functions938198
-Node: Extension Functions938883
-Node: Exit Callback Functions941180
-Node: Extension Version String942428
-Node: Input Parsers943093
-Node: Output Wrappers952972
-Node: Two-way processors957487
-Node: Printing Messages959691
-Ref: Printing Messages-Footnote-1960767
-Node: Updating `ERRNO'960919
-Node: Requesting Values961659
-Ref: table-value-types-returned962387
-Node: Accessing Parameters963344
-Node: Symbol Table Access964575
-Node: Symbol table by name965089
-Node: Symbol table by cookie967070
-Ref: Symbol table by cookie-Footnote-1971214
-Node: Cached values971277
-Ref: Cached values-Footnote-1974776
-Node: Array Manipulation974867
-Ref: Array Manipulation-Footnote-1975965
-Node: Array Data Types976002
-Ref: Array Data Types-Footnote-1978657
-Node: Array Functions978749
-Node: Flattening Arrays982603
-Node: Creating Arrays989495
-Node: Extension API Variables994266
-Node: Extension Versioning994902
-Node: Extension API Informational Variables996803
-Node: Extension API Boilerplate997868
-Node: Finding Extensions1001677
-Node: Extension Example1002237
-Node: Internal File Description1003009
-Node: Internal File Ops1007076
-Ref: Internal File Ops-Footnote-11018746
-Node: Using Internal File Ops1018886
-Ref: Using Internal File Ops-Footnote-11021269
-Node: Extension Samples1021542
-Node: Extension Sample File Functions1023068
-Node: Extension Sample Fnmatch1030706
-Node: Extension Sample Fork1032197
-Node: Extension Sample Inplace1033412
-Node: Extension Sample Ord1035087
-Node: Extension Sample Readdir1035923
-Ref: table-readdir-file-types1036799
-Node: Extension Sample Revout1037610
-Node: Extension Sample Rev2way1038200
-Node: Extension Sample Read write array1038940
-Node: Extension Sample Readfile1040880
-Node: Extension Sample Time1041975
-Node: Extension Sample API Tests1043324
-Node: gawkextlib1043815
-Node: Extension summary1046473
-Node: Extension Exercises1050162
-Node: Language History1050884
-Node: V7/SVR3.11052540
-Node: SVR41054721
-Node: POSIX1056166
-Node: BTL1057555
-Node: POSIX/GNU1058289
-Node: Feature History1063853
-Node: Common Extensions1076951
-Node: Ranges and Locales1078275
-Ref: Ranges and Locales-Footnote-11082893
-Ref: Ranges and Locales-Footnote-21082920
-Ref: Ranges and Locales-Footnote-31083154
-Node: Contributors1083375
-Node: History summary1088916
-Node: Installation1090286
-Node: Gawk Distribution1091232
-Node: Getting1091716
-Node: Extracting1092539
-Node: Distribution contents1094174
-Node: Unix Installation1099891
-Node: Quick Installation1100508
-Node: Additional Configuration Options1102932
-Node: Configuration Philosophy1104670
-Node: Non-Unix Installation1107039
-Node: PC Installation1107497
-Node: PC Binary Installation1108816
-Node: PC Compiling1110664
-Ref: PC Compiling-Footnote-11113685
-Node: PC Testing1113794
-Node: PC Using1114970
-Node: Cygwin1119085
-Node: MSYS1119908
-Node: VMS Installation1120408
-Node: VMS Compilation1121200
-Ref: VMS Compilation-Footnote-11122422
-Node: VMS Dynamic Extensions1122480
-Node: VMS Installation Details1124164
-Node: VMS Running1126416
-Node: VMS GNV1129252
-Node: VMS Old Gawk1129986
-Node: Bugs1130456
-Node: Other Versions1134339
-Node: Installation summary1140763
-Node: Notes1141819
-Node: Compatibility Mode1142684
-Node: Additions1143466
-Node: Accessing The Source1144391
-Node: Adding Code1145826
-Node: New Ports1151983
-Node: Derived Files1156465
-Ref: Derived Files-Footnote-11161940
-Ref: Derived Files-Footnote-21161974
-Ref: Derived Files-Footnote-31162570
-Node: Future Extensions1162684
-Node: Implementation Limitations1163290
-Node: Extension Design1164538
-Node: Old Extension Problems1165692
-Ref: Old Extension Problems-Footnote-11167209
-Node: Extension New Mechanism Goals1167266
-Ref: Extension New Mechanism Goals-Footnote-11170626
-Node: Extension Other Design Decisions1170815
-Node: Extension Future Growth1172923
-Node: Old Extension Mechanism1173759
-Node: Notes summary1175521
-Node: Basic Concepts1176707
-Node: Basic High Level1177388
-Ref: figure-general-flow1177660
-Ref: figure-process-flow1178259
-Ref: Basic High Level-Footnote-11181488
-Node: Basic Data Typing1181673
-Node: Glossary1185001
-Node: Copying1216930
-Node: GNU Free Documentation License1254486
-Node: Index1279622
+Node: Programs Exercises770551
+Ref: Programs Exercises-Footnote-1774682
+Node: Advanced Features774773
+Node: Nondecimal Data776755
+Node: Array Sorting778345
+Node: Controlling Array Traversal779045
+Ref: Controlling Array Traversal-Footnote-1787411
+Node: Array Sorting Functions787529
+Ref: Array Sorting Functions-Footnote-1791415
+Node: Two-way I/O791611
+Ref: Two-way I/O-Footnote-1796556
+Ref: Two-way I/O-Footnote-2796742
+Node: TCP/IP Networking796824
+Node: Profiling799696
+Node: Advanced Features Summary807237
+Node: Internationalization809170
+Node: I18N and L10N810650
+Node: Explaining gettext811336
+Ref: Explaining gettext-Footnote-1816361
+Ref: Explaining gettext-Footnote-2816545
+Node: Programmer i18n816710
+Ref: Programmer i18n-Footnote-1821576
+Node: Translator i18n821625
+Node: String Extraction822419
+Ref: String Extraction-Footnote-1823550
+Node: Printf Ordering823636
+Ref: Printf Ordering-Footnote-1826422
+Node: I18N Portability826486
+Ref: I18N Portability-Footnote-1828941
+Node: I18N Example829004
+Ref: I18N Example-Footnote-1831807
+Node: Gawk I18N831879
+Node: I18N Summary832517
+Node: Debugger833856
+Node: Debugging834878
+Node: Debugging Concepts835319
+Node: Debugging Terms837172
+Node: Awk Debugging839744
+Node: Sample Debugging Session840638
+Node: Debugger Invocation841158
+Node: Finding The Bug842542
+Node: List of Debugger Commands849017
+Node: Breakpoint Control850350
+Node: Debugger Execution Control854046
+Node: Viewing And Changing Data857410
+Node: Execution Stack860788
+Node: Debugger Info862425
+Node: Miscellaneous Debugger Commands866442
+Node: Readline Support871471
+Node: Limitations872363
+Node: Debugging Summary874477
+Node: Arbitrary Precision Arithmetic875645
+Node: Computer Arithmetic877061
+Ref: table-numeric-ranges880659
+Ref: Computer Arithmetic-Footnote-1881518
+Node: Math Definitions881575
+Ref: table-ieee-formats884863
+Ref: Math Definitions-Footnote-1885467
+Node: MPFR features885572
+Node: FP Math Caution887243
+Ref: FP Math Caution-Footnote-1888293
+Node: Inexactness of computations888662
+Node: Inexact representation889621
+Node: Comparing FP Values890978
+Node: Errors accumulate892060
+Node: Getting Accuracy893493
+Node: Try To Round896155
+Node: Setting precision897054
+Ref: table-predefined-precision-strings897738
+Node: Setting the rounding mode899527
+Ref: table-gawk-rounding-modes899891
+Ref: Setting the rounding mode-Footnote-1903346
+Node: Arbitrary Precision Integers903525
+Ref: Arbitrary Precision Integers-Footnote-1906511
+Node: POSIX Floating Point Problems906660
+Ref: POSIX Floating Point Problems-Footnote-1910533
+Node: Floating point summary910571
+Node: Dynamic Extensions912765
+Node: Extension Intro914317
+Node: Plugin License915583
+Node: Extension Mechanism Outline916380
+Ref: figure-load-extension916808
+Ref: figure-register-new-function918288
+Ref: figure-call-new-function919292
+Node: Extension API Description921278
+Node: Extension API Functions Introduction922728
+Node: General Data Types927552
+Ref: General Data Types-Footnote-1933291
+Node: Memory Allocation Functions933590
+Ref: Memory Allocation Functions-Footnote-1936429
+Node: Constructor Functions936525
+Node: Registration Functions938259
+Node: Extension Functions938944
+Node: Exit Callback Functions941241
+Node: Extension Version String942489
+Node: Input Parsers943154
+Node: Output Wrappers953033
+Node: Two-way processors957548
+Node: Printing Messages959752
+Ref: Printing Messages-Footnote-1960828
+Node: Updating `ERRNO'960980
+Node: Requesting Values961720
+Ref: table-value-types-returned962448
+Node: Accessing Parameters963405
+Node: Symbol Table Access964636
+Node: Symbol table by name965150
+Node: Symbol table by cookie967131
+Ref: Symbol table by cookie-Footnote-1971275
+Node: Cached values971338
+Ref: Cached values-Footnote-1974837
+Node: Array Manipulation974928
+Ref: Array Manipulation-Footnote-1976026
+Node: Array Data Types976063
+Ref: Array Data Types-Footnote-1978718
+Node: Array Functions978810
+Node: Flattening Arrays982664
+Node: Creating Arrays989556
+Node: Extension API Variables994327
+Node: Extension Versioning994963
+Node: Extension API Informational Variables996864
+Node: Extension API Boilerplate997929
+Node: Finding Extensions1001738
+Node: Extension Example1002298
+Node: Internal File Description1003070
+Node: Internal File Ops1007137
+Ref: Internal File Ops-Footnote-11018807
+Node: Using Internal File Ops1018947
+Ref: Using Internal File Ops-Footnote-11021330
+Node: Extension Samples1021603
+Node: Extension Sample File Functions1023129
+Node: Extension Sample Fnmatch1030767
+Node: Extension Sample Fork1032258
+Node: Extension Sample Inplace1033473
+Node: Extension Sample Ord1035148
+Node: Extension Sample Readdir1035984
+Ref: table-readdir-file-types1036860
+Node: Extension Sample Revout1037671
+Node: Extension Sample Rev2way1038261
+Node: Extension Sample Read write array1039001
+Node: Extension Sample Readfile1040941
+Node: Extension Sample Time1042036
+Node: Extension Sample API Tests1043385
+Node: gawkextlib1043876
+Node: Extension summary1046534
+Node: Extension Exercises1050223
+Node: Language History1050945
+Node: V7/SVR3.11052601
+Node: SVR41054782
+Node: POSIX1056227
+Node: BTL1057616
+Node: POSIX/GNU1058350
+Node: Feature History1063914
+Node: Common Extensions1077012
+Node: Ranges and Locales1078336
+Ref: Ranges and Locales-Footnote-11082954
+Ref: Ranges and Locales-Footnote-21082981
+Ref: Ranges and Locales-Footnote-31083215
+Node: Contributors1083436
+Node: History summary1088977
+Node: Installation1090347
+Node: Gawk Distribution1091293
+Node: Getting1091777
+Node: Extracting1092600
+Node: Distribution contents1094235
+Node: Unix Installation1099952
+Node: Quick Installation1100569
+Node: Additional Configuration Options1102993
+Node: Configuration Philosophy1104731
+Node: Non-Unix Installation1107100
+Node: PC Installation1107558
+Node: PC Binary Installation1108877
+Node: PC Compiling1110725
+Ref: PC Compiling-Footnote-11113746
+Node: PC Testing1113855
+Node: PC Using1115031
+Node: Cygwin1119146
+Node: MSYS1119969
+Node: VMS Installation1120469
+Node: VMS Compilation1121261
+Ref: VMS Compilation-Footnote-11122483
+Node: VMS Dynamic Extensions1122541
+Node: VMS Installation Details1124225
+Node: VMS Running1126477
+Node: VMS GNV1129313
+Node: VMS Old Gawk1130047
+Node: Bugs1130517
+Node: Other Versions1134400
+Node: Installation summary1140824
+Node: Notes1141880
+Node: Compatibility Mode1142745
+Node: Additions1143527
+Node: Accessing The Source1144452
+Node: Adding Code1145887
+Node: New Ports1152044
+Node: Derived Files1156526
+Ref: Derived Files-Footnote-11162001
+Ref: Derived Files-Footnote-21162035
+Ref: Derived Files-Footnote-31162631
+Node: Future Extensions1162745
+Node: Implementation Limitations1163351
+Node: Extension Design1164599
+Node: Old Extension Problems1165753
+Ref: Old Extension Problems-Footnote-11167270
+Node: Extension New Mechanism Goals1167327
+Ref: Extension New Mechanism Goals-Footnote-11170687
+Node: Extension Other Design Decisions1170876
+Node: Extension Future Growth1172984
+Node: Old Extension Mechanism1173820
+Node: Notes summary1175582
+Node: Basic Concepts1176768
+Node: Basic High Level1177449
+Ref: figure-general-flow1177721
+Ref: figure-process-flow1178320
+Ref: Basic High Level-Footnote-11181549
+Node: Basic Data Typing1181734
+Node: Glossary1185062
+Node: Copying1216991
+Node: GNU Free Documentation License1254547
+Node: Index1279683
End Tag Table
diff --git a/doc/gawk.texi b/doc/gawk.texi
index 9f06740..59f11ca 100644
--- a/doc/gawk.texi
+++ b/doc/gawk.texi
@@ -55,6 +55,7 @@
@set VERSION 4.1
@set PATCHLEVEL 2
address@hidden GAWKINETTITLE TCP/IP Internetworking with @command{gawk}
@ifset FOR_PRINT
@set TITLE Effective awk Programming
@end ifset
@@ -1495,7 +1496,7 @@ In May 1997, J@"urgen Kahrs felt the need for network
access
from @command{awk}, and with a little help from me, set about adding
features to do this for @command{gawk}. At that time, he also
wrote the bulk of
address@hidden/IP Internetworking with @command{gawk}}
address@hidden@value{GAWKINETTITLE}}
(a separate document, available as part of the @command{gawk} distribution).
His code finally became part of the main @command{gawk} distribution
with @command{gawk} @value{PVERSION} 3.1.
@@ -26510,7 +26511,7 @@ the separator can considerably simplify such tasks.
@item
The examples here demonstrate the usefulness of the library
-functions from @ref{Library Functions}
+functions from @DBREF{Library Functions}
for a number of real (if small) programs.
@item
@@ -26711,18 +26712,18 @@ a violent psychopath who knows where you live.}
This @value{CHAPTER} discusses advanced features in @command{gawk}.
It's a bit of a ``grab bag'' of items that are otherwise unrelated
to each other.
-First, a command-line option allows @command{gawk} to recognize
+First, we look at a command-line option that allows @command{gawk} to recognize
nondecimal numbers in input data, not just in @command{awk}
programs.
Then, @command{gawk}'s special features for sorting arrays are presented.
Next, two-way I/O, discussed briefly in earlier parts of this
@value{DOCUMENT}, is described in full detail, along with the basics
-of TCP/IP networking. Finally, @command{gawk}
+of TCP/IP networking. Finally, we see how @command{gawk}
can @dfn{profile} an @command{awk} program, making it possible to tune
it for performance.
@c FULLXREF ON
-A number of advanced features require separate @value{CHAPTER}s of their
+Additional advanced features are discussed in separate @value{CHAPTER}s of
their
own:
@itemize @value{BULLET}
@@ -26816,7 +26817,8 @@ This option may disappear in a future version of
@command{gawk}.
@node Array Sorting
@section Controlling Array Traversal and Array Sorting
address@hidden lets you control the order in which a @samp{for (i in array)}
address@hidden lets you control the order in which a
address@hidden (@var{indx} in @var{array})}
loop traverses an array.
In addition, two built-in functions, @code{asort()} and @code{asorti()},
@@ -26832,7 +26834,7 @@ to order the elements during sorting.
@node Controlling Array Traversal
@subsection Controlling Array Traversal
-By default, the order in which a @samp{for (i in array)} loop
+By default, the order in which a @samp{for (@var{indx} in @var{array})} loop
scans an array is not defined; it is generally based upon
the internal implementation of arrays inside @command{awk}.
@@ -26861,23 +26863,23 @@ function comp_func(i1, v1, i2, v2)
@}
@end example
-Here, @var{i1} and @var{i2} are the indices, and @var{v1} and @var{v2}
+Here, @code{i1} and @code{i2} are the indices, and @code{v1} and @code{v2}
are the corresponding values of the two elements being compared.
-Either @var{v1} or @var{v2}, or both, can be arrays if the array being
+Either @code{v1} or @code{v2}, or both, can be arrays if the array being
traversed contains subarrays as values.
(@DBXREF{Arrays of Arrays} for more information about subarrays.)
The three possible return values are interpreted as follows:
@table @code
@item comp_func(i1, v1, i2, v2) < 0
-Index @var{i1} comes before index @var{i2} during loop traversal.
+Index @code{i1} comes before index @code{i2} during loop traversal.
@item comp_func(i1, v1, i2, v2) == 0
-Indices @var{i1} and @var{i2}
-come together but the relative order with respect to each other is undefined.
+Indices @code{i1} and @code{i2}
+come together, but the relative order with respect to each other is undefined.
@item comp_func(i1, v1, i2, v2) > 0
-Index @var{i1} comes after index @var{i2} during loop traversal.
+Index @code{i1} comes after index @code{i2} during loop traversal.
@end table
Our first comparison function can be used to scan an array in
@@ -27038,7 +27040,7 @@ As already mentioned, the order of the indices is
arbitrary if two
elements compare equal. This is usually not a problem, but letting
the tied elements come out in arbitrary order can be an issue, especially
when comparing item values. The partial ordering of the equal elements
-may change the next time the array is traversed, if other elements are added or
+may change the next time the array is traversed, if other elements are added
to or
removed from the array. One way to resolve ties when comparing elements
with otherwise equal values is to include the indices in the comparison
rules. Note that doing this may make the loop traversal less efficient,
@@ -27081,7 +27083,7 @@ equivalent or distinct.
Another point to keep in mind is that in the case of subarrays,
the element values can themselves be arrays; a production comparison
function should use the @code{isarray()} function
-(@pxref{Type Functions}),
+(@pxref{Type Functions})
to check for this, and choose a defined sorting order for subarrays.
All sorting based on @code{PROCINFO["sorted_in"]}
@@ -27089,7 +27091,7 @@ is disabled in POSIX mode,
because the @code{PROCINFO} array is not special in that case.
As a side note, sorting the array indices before traversing
-the array has been reported to add 15% to 20% overhead to the
+the array has been reported to add a 15% to 20% overhead to the
execution time of @command{awk} programs. For this reason,
sorted array traversal is not the default.
@@ -27148,7 +27150,7 @@ However, the @code{source} array is not affected.
Often, what's needed is to sort on the values of the @emph{indices}
instead of the values of the elements. To do that, use the
@code{asorti()} function. The interface and behavior are identical to
-that of @code{asort()}, except that the index values are used for sorting,
+that of @code{asort()}, except that the index values are used for sorting
and become the values of the result array:
@example
@@ -27183,8 +27185,8 @@ it chooses}, taking into account just the indices, just
the values,
or both. This is extremely powerful.
Once the array is sorted, @code{asort()} takes the @emph{values} in
-their final order, and uses them to fill in the result array, whereas
address@hidden()} takes the @emph{indices} in their final order, and uses
+their final order and uses them to fill in the result array, whereas
address@hidden()} takes the @emph{indices} in their final order and uses
them to fill in the result array.
@cindex reference counting, sorting arrays
@@ -27481,7 +27483,7 @@ service name.
@cindex @command{gawk}, @code{ERRNO} variable in
@cindex @code{ERRNO} variable
@quotation NOTE
-Failure in opening a two-way socket will result in a non-fatal error
+Failure in opening a two-way socket will result in a nonfatal error
being returned to the calling code. The value of @code{ERRNO} indicates
the error (@pxref{Auto-set}).
@end quotation
@@ -27498,19 +27500,19 @@ BEGIN @{
@end example
This program reads the current date and time from the local system's
-TCP @samp{daytime} server.
+TCP @code{daytime} server.
It then prints the results and closes the connection.
Because this topic is extensive, the use of @command{gawk} for
TCP/IP programming is documented separately.
@ifinfo
See
address@hidden, , General Introduction, gawkinet, TCP/IP Internetworking with
@command{gawk}},
address@hidden, , General Introduction, gawkinet, @value{GAWKINETTITLE}},
@end ifinfo
@ifnotinfo
See
@uref{http://www.gnu.org/software/gawk/manual/gawkinet/,
address@hidden/IP Internetworking with @command{gawk}}},
address@hidden@value{GAWKINETTITLE}}},
which comes as part of the @command{gawk} distribution,
@end ifnotinfo
for a much more complete introduction and discussion, as well as
@@ -27586,9 +27588,9 @@ junk
@end example
Here is the @file{awkprof.out} that results from running the
address@hidden profiler on this program and data. (This example also
address@hidden profiler on this program and data (this example also
illustrates that @command{awk} programmers sometimes get up very early
-in the morning to work.)
+in the morning to work):
@cindex @code{BEGIN} pattern, and profiling
@cindex @code{END} pattern, and profiling
@@ -27648,8 +27650,8 @@ They are as follows:
@item
The program is printed in the order @code{BEGIN} rules,
@code{BEGINFILE} rules,
-pattern/action rules,
address@hidden rules, @code{END} rules and functions, listed
+pattern--action rules,
address@hidden rules, @code{END} rules, and functions, listed
alphabetically.
Multiple @code{BEGIN} and @code{END} rules retain their
separate identities, as do
@@ -27657,7 +27659,7 @@ multiple @code{BEGINFILE} and @code{ENDFILE} rules.
@cindex patterns, counts, in a profile
@item
-Pattern-action rules have two counts.
+Pattern--action rules have two counts.
The first count, to the left of the rule, shows how many times
the rule's pattern was @emph{tested}.
The second count, to the right of the rule's opening left brace
@@ -27724,15 +27726,15 @@ the target of a redirection isn't a scalar, it gets
parenthesized.
@command{gawk} supplies leading comments in
front of the @code{BEGIN} and @code{END} rules,
the @code{BEGINFILE} and @code{ENDFILE} rules,
-the pattern/action rules, and the functions.
+the pattern--action rules, and the functions.
@end itemize
The profiled version of your program may not look exactly like what you
typed when you wrote it. This is because @command{gawk} creates the
-profiled version by ``pretty printing'' its internal representation of
+profiled version by ``pretty-printing'' its internal representation of
the program. The advantage to this is that @command{gawk} can produce
-a standard representation. The disadvantage is that all source-code
+a standard representation. The disadvantage is that all source code
comments are lost.
Also, things such as:
@@ -27814,16 +27816,16 @@ If you use the @code{HUP} signal instead of the
@code{USR1} signal,
@cindex @code{SIGQUIT} signal (MS-Windows)
@cindex signals, @code{QUIT}/@code{SIGQUIT} (MS-Windows)
When @command{gawk} runs on MS-Windows systems, it uses the
address@hidden and @code{QUIT} signals for producing the profile and, in
address@hidden and @code{QUIT} signals for producing the profile, and in
the case of the @code{INT} signal, @command{gawk} exits. This is
because these systems don't support the @command{kill} command, so the
only signals you can deliver to a program are those generated by the
keyboard. The @code{INT} signal is generated by the
address@hidden@key{C}} or @address@hidden key, while the
address@hidden signal is generated by the @address@hidden key.
address@hidden or @kbd{Ctrl-BREAK} key, while the
address@hidden signal is generated by the @kbd{Ctrl-\} key.
Finally, @command{gawk} also accepts another option, @option{--pretty-print}.
-When called this way, @command{gawk} ``pretty prints'' the program into
+When called this way, @command{gawk} ``pretty-prints'' the program into
@file{awkprof.out}, without any execution counts.
@quotation NOTE
@@ -27861,7 +27863,7 @@ optionally, close off one side of the two-way
communications.
@item
By using special @value{FN}s with the @samp{|&} operator, you can open a
-TCP/IP (or UDP/IP) connection to remote hosts in the Internet. @command{gawk}
+TCP/IP (or UDP/IP) connection to remote hosts on the Internet. @command{gawk}
supports both IPv4 and IPv6.
@item
@@ -27871,7 +27873,7 @@ you tune them more easily. Sending the @code{USR1}
signal while profiling cause
@command{gawk} to dump the profile and keep going, including a function call
stack.
@item
-You can also just ``pretty print'' the program. This currently also runs
+You can also just ``pretty-print'' the program. This currently also runs
the program, but that will change in the next major release.
@end itemize
@@ -36970,10 +36972,10 @@ The generated Info file for this @value{DOCUMENT}.
@item doc/gawkinet.texi
The Texinfo source file for
@ifinfo
address@hidden, , General Introduction, gawkinet, TCP/IP Internetworking with
@command{gawk}}.
address@hidden, , General Introduction, gawkinet, @value{GAWKINETTITLE}}.
@end ifinfo
@ifnotinfo
address@hidden/IP Internetworking with @command{gawk}}.
address@hidden@value{GAWKINETTITLE}}.
@end ifnotinfo
It should be processed with @TeX{}
(via @command{texi2dvi} or @command{texi2pdf})
@@ -36982,7 +36984,7 @@ with @command{makeinfo} to produce an Info or HTML file.
@item doc/gawkinet.info
The generated Info file for
address@hidden/IP Internetworking with @command{gawk}}.
address@hidden@value{GAWKINETTITLE}}.
@item doc/igawk.1
The @command{troff} source for a manual page describing the @command{igawk}
diff --git a/doc/gawktexi.in b/doc/gawktexi.in
index cfddbd1..e02318b 100644
--- a/doc/gawktexi.in
+++ b/doc/gawktexi.in
@@ -50,6 +50,7 @@
@set VERSION 4.1
@set PATCHLEVEL 2
address@hidden GAWKINETTITLE TCP/IP Internetworking with @command{gawk}
@ifset FOR_PRINT
@set TITLE Effective awk Programming
@end ifset
@@ -1462,7 +1463,7 @@ In May 1997, J@"urgen Kahrs felt the need for network
access
from @command{awk}, and with a little help from me, set about adding
features to do this for @command{gawk}. At that time, he also
wrote the bulk of
address@hidden/IP Internetworking with @command{gawk}}
address@hidden@value{GAWKINETTITLE}}
(a separate document, available as part of the @command{gawk} distribution).
His code finally became part of the main @command{gawk} distribution
with @command{gawk} @value{PVERSION} 3.1.
@@ -25802,18 +25803,18 @@ a violent psychopath who knows where you live.}
This @value{CHAPTER} discusses advanced features in @command{gawk}.
It's a bit of a ``grab bag'' of items that are otherwise unrelated
to each other.
-First, a command-line option allows @command{gawk} to recognize
+First, we look at a command-line option that allows @command{gawk} to recognize
nondecimal numbers in input data, not just in @command{awk}
programs.
Then, @command{gawk}'s special features for sorting arrays are presented.
Next, two-way I/O, discussed briefly in earlier parts of this
@value{DOCUMENT}, is described in full detail, along with the basics
-of TCP/IP networking. Finally, @command{gawk}
+of TCP/IP networking. Finally, we see how @command{gawk}
can @dfn{profile} an @command{awk} program, making it possible to tune
it for performance.
@c FULLXREF ON
-A number of advanced features require separate @value{CHAPTER}s of their
+Additional advanced features are discussed in separate @value{CHAPTER}s of
their
own:
@itemize @value{BULLET}
@@ -25907,7 +25908,8 @@ This option may disappear in a future version of
@command{gawk}.
@node Array Sorting
@section Controlling Array Traversal and Array Sorting
address@hidden lets you control the order in which a @samp{for (i in array)}
address@hidden lets you control the order in which a
address@hidden (@var{indx} in @var{array})}
loop traverses an array.
In addition, two built-in functions, @code{asort()} and @code{asorti()},
@@ -25923,7 +25925,7 @@ to order the elements during sorting.
@node Controlling Array Traversal
@subsection Controlling Array Traversal
-By default, the order in which a @samp{for (i in array)} loop
+By default, the order in which a @samp{for (@var{indx} in @var{array})} loop
scans an array is not defined; it is generally based upon
the internal implementation of arrays inside @command{awk}.
@@ -25952,23 +25954,23 @@ function comp_func(i1, v1, i2, v2)
@}
@end example
-Here, @var{i1} and @var{i2} are the indices, and @var{v1} and @var{v2}
+Here, @code{i1} and @code{i2} are the indices, and @code{v1} and @code{v2}
are the corresponding values of the two elements being compared.
-Either @var{v1} or @var{v2}, or both, can be arrays if the array being
+Either @code{v1} or @code{v2}, or both, can be arrays if the array being
traversed contains subarrays as values.
(@DBXREF{Arrays of Arrays} for more information about subarrays.)
The three possible return values are interpreted as follows:
@table @code
@item comp_func(i1, v1, i2, v2) < 0
-Index @var{i1} comes before index @var{i2} during loop traversal.
+Index @code{i1} comes before index @code{i2} during loop traversal.
@item comp_func(i1, v1, i2, v2) == 0
-Indices @var{i1} and @var{i2}
-come together but the relative order with respect to each other is undefined.
+Indices @code{i1} and @code{i2}
+come together, but the relative order with respect to each other is undefined.
@item comp_func(i1, v1, i2, v2) > 0
-Index @var{i1} comes after index @var{i2} during loop traversal.
+Index @code{i1} comes after index @code{i2} during loop traversal.
@end table
Our first comparison function can be used to scan an array in
@@ -26129,7 +26131,7 @@ As already mentioned, the order of the indices is
arbitrary if two
elements compare equal. This is usually not a problem, but letting
the tied elements come out in arbitrary order can be an issue, especially
when comparing item values. The partial ordering of the equal elements
-may change the next time the array is traversed, if other elements are added or
+may change the next time the array is traversed, if other elements are added
to or
removed from the array. One way to resolve ties when comparing elements
with otherwise equal values is to include the indices in the comparison
rules. Note that doing this may make the loop traversal less efficient,
@@ -26172,7 +26174,7 @@ equivalent or distinct.
Another point to keep in mind is that in the case of subarrays,
the element values can themselves be arrays; a production comparison
function should use the @code{isarray()} function
-(@pxref{Type Functions}),
+(@pxref{Type Functions})
to check for this, and choose a defined sorting order for subarrays.
All sorting based on @code{PROCINFO["sorted_in"]}
@@ -26180,7 +26182,7 @@ is disabled in POSIX mode,
because the @code{PROCINFO} array is not special in that case.
As a side note, sorting the array indices before traversing
-the array has been reported to add 15% to 20% overhead to the
+the array has been reported to add a 15% to 20% overhead to the
execution time of @command{awk} programs. For this reason,
sorted array traversal is not the default.
@@ -26239,7 +26241,7 @@ However, the @code{source} array is not affected.
Often, what's needed is to sort on the values of the @emph{indices}
instead of the values of the elements. To do that, use the
@code{asorti()} function. The interface and behavior are identical to
-that of @code{asort()}, except that the index values are used for sorting,
+that of @code{asort()}, except that the index values are used for sorting
and become the values of the result array:
@example
@@ -26274,8 +26276,8 @@ it chooses}, taking into account just the indices, just
the values,
or both. This is extremely powerful.
Once the array is sorted, @code{asort()} takes the @emph{values} in
-their final order, and uses them to fill in the result array, whereas
address@hidden()} takes the @emph{indices} in their final order, and uses
+their final order and uses them to fill in the result array, whereas
address@hidden()} takes the @emph{indices} in their final order and uses
them to fill in the result array.
@cindex reference counting, sorting arrays
@@ -26572,7 +26574,7 @@ service name.
@cindex @command{gawk}, @code{ERRNO} variable in
@cindex @code{ERRNO} variable
@quotation NOTE
-Failure in opening a two-way socket will result in a non-fatal error
+Failure in opening a two-way socket will result in a nonfatal error
being returned to the calling code. The value of @code{ERRNO} indicates
the error (@pxref{Auto-set}).
@end quotation
@@ -26589,19 +26591,19 @@ BEGIN @{
@end example
This program reads the current date and time from the local system's
-TCP @samp{daytime} server.
+TCP @code{daytime} server.
It then prints the results and closes the connection.
Because this topic is extensive, the use of @command{gawk} for
TCP/IP programming is documented separately.
@ifinfo
See
address@hidden, , General Introduction, gawkinet, TCP/IP Internetworking with
@command{gawk}},
address@hidden, , General Introduction, gawkinet, @value{GAWKINETTITLE}},
@end ifinfo
@ifnotinfo
See
@uref{http://www.gnu.org/software/gawk/manual/gawkinet/,
address@hidden/IP Internetworking with @command{gawk}}},
address@hidden@value{GAWKINETTITLE}}},
which comes as part of the @command{gawk} distribution,
@end ifnotinfo
for a much more complete introduction and discussion, as well as
@@ -26677,9 +26679,9 @@ junk
@end example
Here is the @file{awkprof.out} that results from running the
address@hidden profiler on this program and data. (This example also
address@hidden profiler on this program and data (this example also
illustrates that @command{awk} programmers sometimes get up very early
-in the morning to work.)
+in the morning to work):
@cindex @code{BEGIN} pattern, and profiling
@cindex @code{END} pattern, and profiling
@@ -26739,8 +26741,8 @@ They are as follows:
@item
The program is printed in the order @code{BEGIN} rules,
@code{BEGINFILE} rules,
-pattern/action rules,
address@hidden rules, @code{END} rules and functions, listed
+pattern--action rules,
address@hidden rules, @code{END} rules, and functions, listed
alphabetically.
Multiple @code{BEGIN} and @code{END} rules retain their
separate identities, as do
@@ -26748,7 +26750,7 @@ multiple @code{BEGINFILE} and @code{ENDFILE} rules.
@cindex patterns, counts, in a profile
@item
-Pattern-action rules have two counts.
+Pattern--action rules have two counts.
The first count, to the left of the rule, shows how many times
the rule's pattern was @emph{tested}.
The second count, to the right of the rule's opening left brace
@@ -26815,15 +26817,15 @@ the target of a redirection isn't a scalar, it gets
parenthesized.
@command{gawk} supplies leading comments in
front of the @code{BEGIN} and @code{END} rules,
the @code{BEGINFILE} and @code{ENDFILE} rules,
-the pattern/action rules, and the functions.
+the pattern--action rules, and the functions.
@end itemize
The profiled version of your program may not look exactly like what you
typed when you wrote it. This is because @command{gawk} creates the
-profiled version by ``pretty printing'' its internal representation of
+profiled version by ``pretty-printing'' its internal representation of
the program. The advantage to this is that @command{gawk} can produce
-a standard representation. The disadvantage is that all source-code
+a standard representation. The disadvantage is that all source code
comments are lost.
Also, things such as:
@@ -26905,16 +26907,16 @@ If you use the @code{HUP} signal instead of the
@code{USR1} signal,
@cindex @code{SIGQUIT} signal (MS-Windows)
@cindex signals, @code{QUIT}/@code{SIGQUIT} (MS-Windows)
When @command{gawk} runs on MS-Windows systems, it uses the
address@hidden and @code{QUIT} signals for producing the profile and, in
address@hidden and @code{QUIT} signals for producing the profile, and in
the case of the @code{INT} signal, @command{gawk} exits. This is
because these systems don't support the @command{kill} command, so the
only signals you can deliver to a program are those generated by the
keyboard. The @code{INT} signal is generated by the
address@hidden@key{C}} or @address@hidden key, while the
address@hidden signal is generated by the @address@hidden key.
address@hidden or @kbd{Ctrl-BREAK} key, while the
address@hidden signal is generated by the @kbd{Ctrl-\} key.
Finally, @command{gawk} also accepts another option, @option{--pretty-print}.
-When called this way, @command{gawk} ``pretty prints'' the program into
+When called this way, @command{gawk} ``pretty-prints'' the program into
@file{awkprof.out}, without any execution counts.
@quotation NOTE
@@ -26952,7 +26954,7 @@ optionally, close off one side of the two-way
communications.
@item
By using special @value{FN}s with the @samp{|&} operator, you can open a
-TCP/IP (or UDP/IP) connection to remote hosts in the Internet. @command{gawk}
+TCP/IP (or UDP/IP) connection to remote hosts on the Internet. @command{gawk}
supports both IPv4 and IPv6.
@item
@@ -26962,7 +26964,7 @@ you tune them more easily. Sending the @code{USR1}
signal while profiling cause
@command{gawk} to dump the profile and keep going, including a function call
stack.
@item
-You can also just ``pretty print'' the program. This currently also runs
+You can also just ``pretty-print'' the program. This currently also runs
the program, but that will change in the next major release.
@end itemize
@@ -36061,10 +36063,10 @@ The generated Info file for this @value{DOCUMENT}.
@item doc/gawkinet.texi
The Texinfo source file for
@ifinfo
address@hidden, , General Introduction, gawkinet, TCP/IP Internetworking with
@command{gawk}}.
address@hidden, , General Introduction, gawkinet, @value{GAWKINETTITLE}}.
@end ifinfo
@ifnotinfo
address@hidden/IP Internetworking with @command{gawk}}.
address@hidden@value{GAWKINETTITLE}}.
@end ifnotinfo
It should be processed with @TeX{}
(via @command{texi2dvi} or @command{texi2pdf})
@@ -36073,7 +36075,7 @@ with @command{makeinfo} to produce an Info or HTML file.
@item doc/gawkinet.info
The generated Info file for
address@hidden/IP Internetworking with @command{gawk}}.
address@hidden@value{GAWKINETTITLE}}.
@item doc/igawk.1
The @command{troff} source for a manual page describing the @command{igawk}
-----------------------------------------------------------------------
Summary of changes:
doc/ChangeLog | 6 +-
doc/gawk.info | 523 ++++++++++++++++++++++++++++---------------------------
doc/gawk.texi | 82 +++++-----
doc/gawktexi.in | 80 +++++----
4 files changed, 350 insertions(+), 341 deletions(-)
hooks/post-receive
--
gawk
| [Prev in Thread] |
Current Thread |
[Next in Thread] |
- [gawk-diffs] [SCM] gawk branch, gawk-4.1-stable, updated. gawk-4.1.0-577-g38162ad,
Arnold Robbins <=