summaryrefslogtreecommitdiff
path: root/src/journal/lookup3.c
diff options
context:
space:
mode:
authorThomas Hindoe Paaboel Andersen <phomes@gmail.com>2012-09-04 19:24:16 +0200
committerLennart Poettering <lennart@poettering.net>2012-09-13 19:34:24 +0200
commitc53158818d8cdaf46b3f1b5299b9bda118a1043f (patch)
tree3ebddf2e2fd9d3280d59d80e382d83a0042a5706 /src/journal/lookup3.c
parentff89a42a8602443b9a74be276cf3ee351b3914c7 (diff)
man: fix a bunch of typos in docs
https://bugs.freedesktop.org/show_bug.cgi?id=54501
Diffstat (limited to 'src/journal/lookup3.c')
-rw-r--r--src/journal/lookup3.c2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/journal/lookup3.c b/src/journal/lookup3.c
index 31eac8c543..ee9a1834cf 100644
--- a/src/journal/lookup3.c
+++ b/src/journal/lookup3.c
@@ -14,7 +14,7 @@ if SELF_TEST is defined. You can use this free for any purpose. It's in
the public domain. It has no warranty.
You probably want to use hashlittle(). hashlittle() and hashbig()
-hash byte arrays. hashlittle() is is faster than hashbig() on
+hash byte arrays. hashlittle() is faster than hashbig() on
little-endian machines. Intel and AMD are little-endian machines.
On second thought, you probably want hashlittle2(), which is identical to
hashlittle() except it returns two 32-bit hashes for the price of one.