AuroraMiddleware/v8
1
0
Fork 0
Code Issues 2 Pull Requests Releases Wiki Activity

Fix Windows compilation.

Browse Source 
TBR=svenpanne@chromium.org
Review URL: https://chromiumcodereview.appspot.com/9456006

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@10807 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
This commit is contained in:
fschneider@chromium.org 2012-02-23 10:12:50 +00:00
parent d1172448ad
commit 67c6e9260b
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
src/hashmap.h
View File

@ -116,7 +116,7 @@ TemplateHashMap<P>::~TemplateHashMap() {
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 @@ void TemplateHashMap<P>::Clear() {
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 @@ struct TemplateHashMap<P>::Entry* TemplateHashMap<P>::Next(Entry* p) const {
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);