diff options
| author | Erik Dubbelboer <erik@dubbelboer.com> | 2012-04-07 14:40:29 +0200 |
|---|---|---|
| committer | Erik Dubbelboer <erik@dubbelboer.com> | 2012-04-07 14:40:29 +0200 |
| commit | 65fd32ab0a7ff1d3d052e3b70dcceac6719de58c (patch) | |
| tree | 85e6bcd5e02db6083e60aacfb7eaab021bc73c5e /src/dict.c | |
| parent | 69e7958918a7e7644654cc00d2846251b3f7b4d5 (diff) | |
| download | redis-65fd32ab0a7ff1d3d052e3b70dcceac6719de58c.tar.gz | |
Fixed some spelling errors in the comments
Diffstat (limited to 'src/dict.c')
| -rw-r--r-- | src/dict.c | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/src/dict.c b/src/dict.c index 6fd4584ee..629a93917 100644 --- a/src/dict.c +++ b/src/dict.c @@ -116,8 +116,8 @@ unsigned int dictGenCaseHashFunction(const unsigned char *buf, int len) { /* ----------------------------- API implementation ------------------------- */ -/* Reset an hashtable already initialized with ht_init(). - * NOTE: This function should only called by ht_destroy(). */ +/* Reset a hash table already initialized with ht_init(). + * NOTE: This function should only be called by ht_destroy(). */ static void _dictReset(dictht *ht) { ht->table = NULL; @@ -162,18 +162,18 @@ int dictResize(dict *d) return dictExpand(d, minimal); } -/* Expand or create the hashtable */ +/* Expand or create the hash table */ int dictExpand(dict *d, unsigned long size) { - dictht n; /* the new hashtable */ + dictht n; /* the new hash table */ unsigned long realsize = _dictNextPower(size); /* the size is invalid if it is smaller than the number of - * elements already inside the hashtable */ + * elements already inside the hash table */ if (dictIsRehashing(d) || d->ht[0].used > size) return DICT_ERR; - /* Allocate the new hashtable and initialize all pointers to NULL */ + /* Allocate the new hash table and initialize all pointers to NULL */ n.size = realsize; n.sizemask = realsize-1; n.table = zcalloc(realsize*sizeof(dictEntry*)); @@ -280,7 +280,7 @@ int dictAdd(dict *d, void *key, void *val) * a value returns the dictEntry structure to the user, that will make * sure to fill the value field as he wishes. * - * This function is also directly expoed to user API to be called + * This function is also directly exposed to user API to be called * mainly in order to store non-pointers inside the hash value, example: * * entry = dictAddRaw(dict,mykey); @@ -607,7 +607,7 @@ static int _dictKeyIndex(dict *d, const void *key) unsigned int h, idx, table; dictEntry *he; - /* Expand the hashtable if needed */ + /* Expand the hash table if needed */ if (_dictExpandIfNeeded(d) == DICT_ERR) return -1; /* Compute the key hash value */ |