/////////////////////////////////////////////////////////////////////////////
-// Name: hashmap.cpp
+// Name: src/common/hashmap.cpp
// Purpose: wxHashMap implementation
// Author: Mattia Barbon
// Modified by:
// Created: 29/01/2002
-// RCS-ID: $Id$
// Copyright: (c) Mattia Barbon
// Licence: wxWindows licence
/////////////////////////////////////////////////////////////////////////////
#include "wx/wxprec.h"
#ifdef __BORLANDC__
-#pragma hdrstop
+ #pragma hdrstop
#endif
#include "wx/hashmap.h"
/* from requirements by Colin Plumb. */
/* (http://burtleburtle.net/bob/hash/doobs.html) */
/* adapted from Perl sources ( hv.h ) */
-unsigned long wxStringHash::wxCharStringHash( const wxChar* k )
+template<typename T>
+static unsigned long DoStringHash(T *k)
{
unsigned long hash = 0;
return hash + (hash << 15);
}
-#if wxUSE_UNICODE
-unsigned long wxStringHash::charStringHash( const char* k )
-{
- unsigned long hash = 0;
+unsigned long wxStringHash::stringHash( const char* k )
+ { return DoStringHash(k); }
- while( *k )
- {
- hash += *k++;
- hash += (hash << 10);
- hash ^= (hash >> 6);
- }
- hash += (hash << 3);
- hash ^= (hash >> 11);
+unsigned long wxStringHash::stringHash( const wchar_t* k )
+ { return DoStringHash(k); }
- return hash + (hash << 15);
-}
-#endif
-#if !wxUSE_STL || !defined(HAVE_STL_HASH_MAP)
+#ifdef wxNEEDS_WX_HASH_MAP
/* from SGI STL */
const unsigned long _wxHashTableBase2::ms_primes[prime_count] =
}
/* someone might try to alloc a 2^32-element hash table */
- wxFAIL_MSG( _T("hash table too big?") );
+ wxFAIL_MSG( wxT("hash table too big?") );
/* quiet warning */
return 0;
while( node )
{
- tmp = node->m_nxt;
+ tmp = node->m_next;
dtor( node );
node = tmp;
}
{
size_t bucket = func( dst, node );
- nextnode = node->m_nxt;
+ nextnode = node->m_next;
_wxHashTable_NodeBase* newnode = proc( node );
- newnode->m_nxt = dstTable[bucket];
+ newnode->m_next = dstTable[bucket];
dstTable[bucket] = newnode;
}
}
return node;
}
-#endif // !wxUSE_STL || !defined(HAVE_STL_HASH_MAP)
+#endif // wxNEEDS_WX_HASH_MAP