X-Git-Url: https://git.saurik.com/wxWidgets.git/blobdiff_plain/8e33234f9356fabe3561574a9fe1268f6a0899e7..0508ba2a6b5806ce54ba290d9c651d09433e15a9:/src/common/hashmap.cpp

diff --git a/src/common/hashmap.cpp b/src/common/hashmap.cpp
new file mode 100644
index 0000000000..fe3628c329
--- /dev/null
+++ b/src/common/hashmap.cpp
@@ -0,0 +1,154 @@
+/////////////////////////////////////////////////////////////////////////////
+// Name:        hashmap.cpp
+// Purpose:     wxHashMap implementation
+// Author:      Mattia Barbon
+// Modified by: 
+// Created:     29/01/2002
+// RCS-ID:      $Id$
+// Copyright:   (c) Mattia Barbon
+// Licence:     wxWindows licence
+/////////////////////////////////////////////////////////////////////////////
+
+#ifdef __GNUG__
+#pragma implementation "hashmap.h"
+#endif
+
+// For compilers that support precompilation, includes "wx.h".
+#include "wx/wxprec.h"
+
+#ifdef __BORLANDC__
+#pragma hdrstop
+#endif
+
+#include "wx/hashmap.h"
+
+#include <assert.h>
+
+/* FYI: This is the "One-at-a-Time" algorithm by Bob Jenkins */
+/* 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 )
+{
+    unsigned long hash = 0;
+
+    while( *k )
+    {
+        hash += *k++;
+        hash += (hash << 10);
+        hash ^= (hash >> 6);
+    }
+    hash += (hash << 3);
+    hash ^= (hash >> 11);
+    
+    return hash + (hash << 15);
+}
+
+#if wxUSE_UNICODE
+unsigned long wxStringHash::charStringHash( const char* k )
+{
+    unsigned long hash = 0;
+
+    while( *k )
+    {
+        hash += *k++;
+        hash += (hash << 10);
+        hash ^= (hash >> 6);
+    }
+    hash += (hash << 3);
+    hash ^= (hash >> 11);
+    
+    return hash + (hash << 15);
+}
+#endif
+
+/* from SGI STL */
+const unsigned long _wxHashTableBase2::s_primes[prime_count] =
+{
+    7ul,          13ul,         29ul,
+    53ul,         97ul,         193ul,       389ul,       769ul,
+    1543ul,       3079ul,       6151ul,      12289ul,     24593ul,
+    49157ul,      98317ul,      196613ul,    393241ul,    786433ul,
+    1572869ul,    3145739ul,    6291469ul,   12582917ul,  25165843ul,
+    50331653ul,   100663319ul,  201326611ul, 402653189ul, 805306457ul, 
+    1610612741ul, 3221225473ul, 4294967291ul
+};
+
+unsigned long _wxHashTableBase2::GetNextPrime( unsigned long n )
+{
+    const unsigned long* ptr = &s_primes[0];
+    for( size_t i = 0; i < prime_count; ++i, ++ptr )
+    {
+        if( n < *ptr )
+            return *ptr;
+    }
+
+    /* someone might try to alloc a 2^32-element hash table */
+    assert(0);
+    /* quiet warning */
+    return 0;
+}
+
+unsigned long _wxHashTableBase2::GetPreviousPrime( unsigned long n )
+{
+    const unsigned long* ptr = &s_primes[prime_count - 1];
+
+    for( size_t i = 0; i < prime_count; ++i, --ptr )
+    {
+        if( n > *ptr )
+            return *ptr;
+    }
+
+    /* quiet warning */
+    return 1;
+}
+
+void _wxHashTableBase2::DeleteNodes( size_t buckets,
+                                     _wxHashTable_NodeBase** table,
+                                     NodeDtor dtor )
+{
+    size_t i;
+
+    for( i = 0; i < buckets; ++i )
+    {
+        _wxHashTable_NodeBase* node = table[i];
+        _wxHashTable_NodeBase* tmp;
+
+        while( node )
+        {
+            tmp = node->m_nxt;
+            dtor( node );
+            node = tmp;
+        }
+    }
+
+    memset( table, 0, buckets * sizeof(void*) );
+}
+
+void _wxHashTableBase2::CopyHashTable( _wxHashTable_NodeBase** srcTable,
+                                       size_t srcBuckets,
+                                       _wxHashTableBase2* dst,
+                                       _wxHashTable_NodeBase** dstTable,
+                                       BucketFromNode func, ProcessNode proc )
+{
+    for( size_t i = 0; i < srcBuckets; ++i )
+    {
+        _wxHashTable_NodeBase* nextnode;
+    
+        for( _wxHashTable_NodeBase* node = srcTable[i]; node; node = nextnode )
+        {
+            size_t bucket = func( dst, node );
+
+            nextnode = node->m_nxt;
+            _wxHashTable_NodeBase* newnode = proc( node );
+            newnode->m_nxt = dstTable[bucket];
+            dstTable[bucket] = newnode;
+        }
+    }
+}
+
+_wxHashTable_NodeBase* _wxHashTableBase2::DummyProcessNode(_wxHashTable_NodeBase* node)
+{
+    return node;
+}
+