aboutsummaryrefslogtreecommitdiff
path: root/ch2
diff options
context:
space:
mode:
authorIsa Hassen <hassen.isa@gmail.com>2015-12-18 19:40:12 -0500
committerzlg <zlg@zlg.space>2015-12-19 17:43:20 -0800
commit032b64e37a23541e136dcf082a4564023579ed39 (patch)
tree25d4aa1bab0316ed9fc28f353bb1b38d5e02cc87 /ch2
parentSolve Exercise 7-1: `upper` and `lower` (diff)
downloadknr-032b64e37a23541e136dcf082a4564023579ed39.tar.gz
knr-032b64e37a23541e136dcf082a4564023579ed39.tar.bz2
knr-032b64e37a23541e136dcf082a4564023579ed39.tar.xz
knr-032b64e37a23541e136dcf082a4564023579ed39.zip
Re-solve Exercise 1-16: arbitrarily long maxline
A completely rewritten solution which follows the spec given in the book exactly; make the program work for arbitrarily long input lines while modifying `main()` only. I've only changed the name of the macro MAXLINE to BUFFSIZE for clarity - otherwise the code is typed up exactly as found in the book. It demonstrates the use of a buffer without modifying any of the helper functions.
Diffstat (limited to '')
0 files changed, 0 insertions, 0 deletions