Fix a bunch of spelling mistakes :\

src/hashmap.h

 // Copyright 2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 41 matching lines @@
   HashMap();
 
   // initial_capacity is the size of the initial hash map;
   // it must be a power of 2 (and thus must not be 0).
   HashMap(MatchFun match,
           Allocator* allocator = &DefaultAllocator,
           uint32_t initial_capacity = 8);
 
   ~HashMap();
 
-  // HashMap entries are (key, value, hash) tripplets.
+  // HashMap entries are (key, value, hash) triplets.
   // Some clients may not need to use the value slot
   // (e.g. implementers of sets, where the key is the value).
   struct Entry {
     void* key;
     void* value;
     uint32_t hash;  // the full hash value for key
   };
 
   // If an entry with matching key is found, Lookup()
   // returns that entry. If no matching entry is found,
@@ skipping 34 matching lines @@
   Entry* map_end() const  { return map_ + capacity_; }
   Entry* Probe(void* key, uint32_t hash);
   void Initialize(uint32_t capacity);
   void Resize();
 };
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_HASHMAP_H_