Fix Windows compilation.

src/hashmap.h

 // Copyright 2012 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 98 matching lines @@
 }
 
 
 template<class P>
 TemplateHashMap<P>::~TemplateHashMap() {
   P::Delete(map_);
 }
 
 
 template<class P>
-struct TemplateHashMap<P>::Entry* TemplateHashMap<P>::Lookup(
+typename TemplateHashMap<P>::Entry* TemplateHashMap<P>::Lookup(
     void* key, uint32_t hash, bool insert) {
   // Find a matching entry.
   Entry* p = Probe(key, hash);
   if (p->key != NULL) {
     return p;
   }
 
   // No entry found; insert one if necessary.
   if (insert) {
     p->key = key;
@@ skipping 80 matching lines @@
   // Mark all entries as empty.
   const Entry* end = map_end();
   for (Entry* p = map_; p < end; p++) {
     p->key = NULL;
   }
   occupancy_ = 0;
 }
 
 
 template<class P>
-struct TemplateHashMap<P>::Entry* TemplateHashMap<P>::Start() const {
+typename TemplateHashMap<P>::Entry* TemplateHashMap<P>::Start() const {
   return Next(map_ - 1);
 }
 
 
 template<class P>
-struct TemplateHashMap<P>::Entry* TemplateHashMap<P>::Next(Entry* p) const {
+typename TemplateHashMap<P>::Entry* TemplateHashMap<P>::Next(Entry* p) const {
   const Entry* end = map_end();
   ASSERT(map_ - 1 <= p && p < end);
   for (p++; p < end; p++) {
     if (p->key != NULL) {
       return p;
     }
   }
   return NULL;
 }
 
 
 template<class P>
-struct TemplateHashMap<P>::Entry* TemplateHashMap<P>::Probe(void* key,
+typename TemplateHashMap<P>::Entry* TemplateHashMap<P>::Probe(void* key,
                                                             uint32_t hash) {
   ASSERT(key != NULL);
 
   ASSERT(IsPowerOf2(capacity_));
   Entry* p = map_ + (hash & (capacity_ - 1));
   const Entry* end = map_end();
   ASSERT(map_ <= p && p < end);
 
   ASSERT(occupancy_ < capacity_);  // Guarantees loop termination.
   while (p->key != NULL && (hash != p->hash || !match_(key, p->key))) {
@@ skipping 36 matching lines @@
     }
   }
 
   // Delete old map.
   P::Delete(map);
 }
 
 } }  // namespace v8::internal
 
 #endif  // V8_HASHMAP_H_