diff options
| author | Max Horn | 2006-10-03 11:33:06 +0000 |
|---|---|---|
| committer | Max Horn | 2006-10-03 11:33:06 +0000 |
| commit | 20d46ab409dfa77241f7d6c2d8cbefc243a25781 (patch) | |
| tree | 7223819ee723098a926d61fee8d7c99d5ab7c0d3 | |
| parent | af5c8eb1c3bb76df86a3506f006135577c0ac476 (diff) | |
| download | scummvm-rg350-20d46ab409dfa77241f7d6c2d8cbefc243a25781.tar.gz scummvm-rg350-20d46ab409dfa77241f7d6c2d8cbefc243a25781.tar.bz2 scummvm-rg350-20d46ab409dfa77241f7d6c2d8cbefc243a25781.zip | |
typo
svn-id: r24093
| -rw-r--r-- | common/hashmap.h | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/common/hashmap.h b/common/hashmap.h index 825f46ab37..1493b9ff3d 100644 --- a/common/hashmap.h +++ b/common/hashmap.h @@ -259,7 +259,7 @@ void HashMap<Key, Val, HashFunc, EqualFunc>::expand_array(uint newsize) { continue; // Insert the element from the old table into the new table. - // Since we know that no key exists twice the old table, we + // Since we know that no key exists twice in the old table, we // can do this slightly better than by calling lookup, since we // don't have to call _equal(). dex = _hash(old_arr[ctr]->_key) % _arrsize; |