summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorJim Meyering <jim@meyering.net>2003-01-07 17:12:11 +0000
committerJim Meyering <jim@meyering.net>2003-01-07 17:12:11 +0000
commit7d1c7640986a846caf7463107af8d1e692c3eb17 (patch)
tree8355814c495d308a04f6fc3e044118f7e209774b /src
parentd31fd7a77ee2a8d6f951befef1833899f8cf3c89 (diff)
downloadcoreutils-7d1c7640986a846caf7463107af8d1e692c3eb17.tar.xz
(set_fields): Fix typo in comment.
Diffstat (limited to 'src')
-rw-r--r--src/cut.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/cut.c b/src/cut.c
index 4ca787768..97358cb66 100644
--- a/src/cut.c
+++ b/src/cut.c
@@ -1,5 +1,5 @@
/* cut - remove parts of lines of files
- Copyright (C) 1984, 1997, 1998, 1999, 2000, 2001, 2002 by David M. Ihnat
+ Copyright (C) 1984, 1997, 1998, 1999, 2000, 2001, 2002, 2003 by David M. Ihnat
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
@@ -227,7 +227,7 @@ print_kth (unsigned int k)
one field specification, zero otherwise. */
/* FIXME-someday: What if the user wants to cut out the 1,000,000-th field
- of some huge input file? This function shouldn't have to alloate a table
+ of some huge input file? This function shouldn't have to allocate a table
of a million ints just so we can test every field < 10^6 with an array
dereference. Instead, consider using a dynamic hash table. It would be
simpler and nearly as good a solution to use a 32K x 4-byte table with