summaryrefslogtreecommitdiff
path: root/src/sort.c
diff options
context:
space:
mode:
authorJim Meyering <meyering@redhat.com>2011-05-19 21:36:33 +0200
committerJim Meyering <meyering@redhat.com>2011-05-19 21:36:33 +0200
commitcb4a0e31e282924f86046557980a2b5e16111ddd (patch)
tree92624e3912998c5a6e3e72cfdbd0ee2502194b54 /src/sort.c
parentbeaa94931345271fd288480d7ea952f9551ef991 (diff)
downloadcoreutils-cb4a0e31e282924f86046557980a2b5e16111ddd.tar.xz
maint: correct typos involving misuse of "a" and "an"
* NEWS: "an misleading" * src/expr.c: "a integer * src/ptx.c (find_occurs_in_text): "a end" * src/shred.c (do_wipefd): "a infinite" * src/sort.c (SUBTHREAD_LINES_HEURISTIC): "an dual-core" (compare_random): "an checksum" * cfg.mk (old_NEWS_hash): Update, since the typo was in old news.
Diffstat (limited to 'src/sort.c')
-rw-r--r--src/sort.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/sort.c b/src/sort.c
index e10159a9b..084addf49 100644
--- a/src/sort.c
+++ b/src/sort.c
@@ -112,7 +112,7 @@ struct rlimit { size_t rlim_cur; };
/* Heuristic value for the number of lines for which it is worth creating
a subthread, during an internal merge sort. I.e., it is a small number
of "average" lines for which sorting via two threads is faster than
- sorting via one on an "average" system. On an dual-core 2.0 GHz i686
+ sorting via one on an "average" system. On a dual-core 2.0 GHz i686
system with 3GB of RAM and 2MB of L2 cache, a file containing 128K
lines of gensort -a output is sorted slightly faster with --parallel=2
than with --parallel=1. By contrast, using --parallel=1 is about 10%
@@ -2029,7 +2029,7 @@ compare_random (char *restrict texta, size_t lena,
char *restrict textb, size_t lenb)
{
/* XFRM_DIFF records the equivalent of memcmp on the transformed
- data. This is used to break ties if there is an checksum
+ data. This is used to break ties if there is a checksum
collision, and this is good enough given the astronomically low
probability of a collision. */
int xfrm_diff = 0;