summaryrefslogtreecommitdiff
path: root/source/fitz/hash.c
diff options
context:
space:
mode:
authorSebastian Rasmussen <sebras@gmail.com>2017-01-04 20:06:57 +0100
committerSebastian Rasmussen <sebras@gmail.com>2017-01-17 20:24:24 +0100
commitb1085c6816c093409c745a41567c8c3009917e27 (patch)
tree53404678b5ea5a816528f0e5ebd589a241cab447 /source/fitz/hash.c
parentf45ed2539978f86e9a7fe0185f8bbeec398fb087 (diff)
downloadmupdf-b1085c6816c093409c745a41567c8c3009917e27.tar.xz
Fix typos.
Diffstat (limited to 'source/fitz/hash.c')
-rw-r--r--source/fitz/hash.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/source/fitz/hash.c b/source/fitz/hash.c
index 7e4f49f1..fe6ae6f8 100644
--- a/source/fitz/hash.c
+++ b/source/fitz/hash.c
@@ -3,7 +3,7 @@
/*
Simple hashtable with open addressing linear probe.
Unlike text book examples, removing entries works
-correctly in this implementation, so it wont start
+correctly in this implementation, so it won't start
exhibiting bad behaviour if entries are inserted
and removed frequently.
*/
@@ -117,7 +117,7 @@ do_hash_insert(fz_context *ctx, fz_hash_table *table, const void *key, void *val
if (memcmp(key, ents[pos].key, table->keylen) == 0)
{
- /* This is legal, but should happen rarely. */
+ /* This is legal, but should rarely happen. */
fz_warn(ctx, "assert: overwrite hash slot");
return ents[pos].val;
}