| Index: src/hashmap.h
|
| ===================================================================
|
| --- src/hashmap.h (revision 10806)
|
| +++ src/hashmap.h (working copy)
|
| @@ -116,7 +116,7 @@
|
|
|
|
|
| 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);
|
| @@ -217,13 +217,13 @@
|
|
|
|
|
| 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++) {
|
| @@ -236,7 +236,7 @@
|
|
|
|
|
| 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);
|
|
|
|
|