Merge pull request #693 from ghurrell/dict-h-typos

Fix (cosmetic) typos in dict.h

diff --combined src/dict.h
index f480ae539232fbe374feeb96661a3088d8b12e20,0bfa0a94abb946f41166185f80c92d8850b9865b..3a311f171110f52602f485c9889633baa5c0c899
--- 1/src/dict.h
--- 2/src/dict.h
+++ b/src/dict.h
@@@ -1,11 -1,11 +1,11 @@@
  /* Hash Tables Implementation.
   *
-  * This file implements in memory hash tables with insert/del/replace/find/
-  * get-random-element operations. Hash tables will auto resize if needed
+  * This file implements in-memory hash tables with insert/del/replace/find/
+  * get-random-element operations. Hash tables will auto-resize if needed
   * tables of power of two in size are used, collisions are handled by
   * chaining. See the source code for more information... :)
   *
-  * Copyright (c) 2006-2010, Salvatore Sanfilippo <antirez at gmail dot com>
+  * Copyright (c) 2006-2012, Salvatore Sanfilippo <antirez at gmail dot com>
   * All rights reserved.
   *
   * Redistribution and use in source and binary forms, with or without
@@@ -80,7 -80,7 +80,7 @@@ typedef struct dict 
      int iterators; /* number of iterators currently running */
  } dict;
  
- /* If safe is set to 1 this is a safe iteartor, that means, you can call
+ /* If safe is set to 1 this is a safe iterator, that means, you can call
   * dictAdd, dictFind, and other functions against the dictionary even while
   * iterating. Otherwise it is a non safe iterator, and only dictNext()
   * should be called while iterating. */
@@@ -155,7 -155,7 +155,7 @@@ dictEntry *dictNext(dictIterator *iter)
  void dictReleaseIterator(dictIterator *iter);
  dictEntry *dictGetRandomKey(dict *d);
  void dictPrintStats(dict *d);
 -unsigned int dictGenHashFunction(const unsigned char *buf, int len);
 +unsigned int dictGenHashFunction(const void *key, int len);
  unsigned int dictGenCaseHashFunction(const unsigned char *buf, int len);
  void dictEmpty(dict *d);
  void dictEnableResize(void);