summaryrefslogtreecommitdiff
path: root/fitz/base_hash.c
diff options
context:
space:
mode:
authorSebastian Rasmussen <sebras@gmail.com>2012-01-10 01:10:28 +0100
committerSebastian Rasmussen <sebras@gmail.com>2012-01-10 01:10:28 +0100
commit7d920025a2eaca1ec879d2e78b46576ca3351cc9 (patch)
treee13ad7288976df91e4f40285f9401a148ce4ddd7 /fitz/base_hash.c
parent6de45df10e024813ad7c62f31394f86fbcb364a7 (diff)
downloadmupdf-7d920025a2eaca1ec879d2e78b46576ca3351cc9.tar.xz
Fix many spelling errors.
Diffstat (limited to 'fitz/base_hash.c')
-rw-r--r--fitz/base_hash.c4
1 files changed, 2 insertions, 2 deletions
diff --git a/fitz/base_hash.c b/fitz/base_hash.c
index 02acc8f1..2cbd9f4b 100644
--- a/fitz/base_hash.c
+++ b/fitz/base_hash.c
@@ -1,7 +1,7 @@
#include "fitz.h"
/*
-Simple hashtable with open adressing linear probe.
+Simple hashtable with open addressing linear probe.
Unlike text book examples, removing entries works
correctly in this implementation, so it wont start
exhibiting bad behaviour if entries are inserted
@@ -194,7 +194,7 @@ fz_hash_remove(fz_hash_table *table, void *key)
{
if (!ents[pos].val)
{
- fz_warn(table->ctx, "assert: remove inexistant hash entry");
+ fz_warn(table->ctx, "assert: remove inexistent hash entry");
return;
}