virtualized m_row/col height/widths arrays

[wxWidgets.git] / src / common / hash.cpp

diff --git a/src/common/hash.cpp b/src/common/hash.cpp
index 69b17fd56ea5a17824088b8a79a44995448435ce..cfc590327ce3b1d1b60c21ffa599d8eeb07eb0c7 100644 (file)
--- a/src/common/hash.cpp
+++ b/src/common/hash.cpp
@@ -29,12 +29,16 @@
 #include <string.h>
 #include <stdarg.h>
 
 #include <string.h>
 #include <stdarg.h>
 

-#if !USE_SHARED_LIBRARY

 IMPLEMENT_DYNAMIC_CLASS(wxHashTable, wxObject)
 IMPLEMENT_DYNAMIC_CLASS(wxHashTable, wxObject)

-#endif

 
 wxHashTable::wxHashTable (int the_key_type, int size)
 {
 
 wxHashTable::wxHashTable (int the_key_type, int size)
 {

+  n = 0;
+  hash_table = (wxList**) NULL;
+  Create(the_key_type, size);
+  m_count = 0;
+  m_deleteContents = FALSE;
+/*

   n = size;
   current_position = -1;
   current_node = (wxNode *) NULL;
   n = size;
   current_position = -1;
   current_node = (wxNode *) NULL;


@@ -44,6 +48,7 @@ wxHashTable::wxHashTable (int the_key_type, int size)
   int i;
   for (i = 0; i < size; i++)
     hash_table[i] = (wxList *) NULL;
   int i;
   for (i = 0; i < size; i++)
     hash_table[i] = (wxList *) NULL;

+*/

 }
 
 wxHashTable::~wxHashTable (void)
 }
 
 wxHashTable::~wxHashTable (void)


@@ -64,13 +69,13 @@ void wxHashTable::Destroy(void)
 
 bool wxHashTable::Create(int the_key_type, int size)
 {
 
 bool wxHashTable::Create(int the_key_type, int size)
 {

+  Destroy();
+

   n = size;
   current_position = -1;
   current_node = (wxNode *) NULL;
 
   key_type = the_key_type;
   n = size;
   current_position = -1;
   current_node = (wxNode *) NULL;
 
   key_type = the_key_type;

-  if (hash_table)
-    delete[] hash_table;

   hash_table = new wxList *[size];
   int i;
   for (i = 0; i < size; i++)
   hash_table = new wxList *[size];
   int i;
   for (i = 0; i < size; i++)


@@ -78,66 +83,102 @@ bool wxHashTable::Create(int the_key_type, int size)
   return TRUE;
 }
 
   return TRUE;
 }
 

+
+void wxHashTable::DoCopy(const wxHashTable& table)
+{
+  n = table.n;
+  current_position = table.current_position;
+  current_node = NULL; // doesn't matter - Next() will reconstruct it
+  key_type = table.key_type;
+
+  hash_table = new wxList *[n];
+  for (int i = 0; i < n; i++) {
+    if (table.hash_table[i] == NULL)
+      hash_table[i] = NULL;
+    else {
+      hash_table[i] = new wxList(key_type);
+      *(hash_table[i]) = *(table.hash_table[i]);
+    }
+  }
+}
+

 void wxHashTable::Put (long key, long value, wxObject * object)
 {
   // Should NEVER be
   long k = (long) key;
 void wxHashTable::Put (long key, long value, wxObject * object)
 {
   // Should NEVER be
   long k = (long) key;

-  if (k < 0)
-    k = -k;

 
   int position = (int) (k % n);
 
   int position = (int) (k % n);

+  if (position < 0) position = -position;
+

   if (!hash_table[position])
   if (!hash_table[position])

+  {

     hash_table[position] = new wxList (wxKEY_INTEGER);
     hash_table[position] = new wxList (wxKEY_INTEGER);

+    if (m_deleteContents) hash_table[position]->DeleteContents(TRUE);
+  }

 
   hash_table[position]->Append (value, object);
 
   hash_table[position]->Append (value, object);

+  m_count++;

 }
 
 }
 

-void wxHashTable::Put (long key, const char *value, wxObject * object)
+void wxHashTable::Put (long key, const wxChar *value, wxObject * object)

 {
   // Should NEVER be
 {
   // Should NEVER be

-  long k = (long) key;
-  if (k < 0)
-    k = -k;
+  long k = (long) key; 

 
   int position = (int) (k % n);
 
   int position = (int) (k % n);

+  if (position < 0) position = -position;
+ 

   if (!hash_table[position])
   if (!hash_table[position])

+  {

     hash_table[position] = new wxList (wxKEY_INTEGER);
     hash_table[position] = new wxList (wxKEY_INTEGER);

+    if (m_deleteContents) hash_table[position]->DeleteContents(TRUE);
+  }

 
   hash_table[position]->Append (value, object);
 
   hash_table[position]->Append (value, object);

+  m_count++;

 }
 
 void wxHashTable::Put (long key, wxObject * object)
 {
   // Should NEVER be
   long k = (long) key;
 }
 
 void wxHashTable::Put (long key, wxObject * object)
 {
   // Should NEVER be
   long k = (long) key;

-  if (k < 0)
-    k = -k;
-
+  

   int position = (int) (k % n);
   int position = (int) (k % n);

+  if (position < 0) position = -position;
+

   if (!hash_table[position])
   if (!hash_table[position])

+  {

     hash_table[position] = new wxList (wxKEY_INTEGER);
     hash_table[position] = new wxList (wxKEY_INTEGER);

-
+    if (m_deleteContents) hash_table[position]->DeleteContents(TRUE);
+  }
+  

   hash_table[position]->Append (k, object);
   hash_table[position]->Append (k, object);

+  m_count++;

 }
 
 }
 

-void wxHashTable::Put (const char *key, wxObject * object)
+void wxHashTable::Put (const wxChar *key, wxObject * object)

 {
   int position = (int) (MakeKey (key) % n);
 {
   int position = (int) (MakeKey (key) % n);

+  if (position < 0) position = -position;

 
   if (!hash_table[position])
 
   if (!hash_table[position])

+  {

     hash_table[position] = new wxList (wxKEY_STRING);
     hash_table[position] = new wxList (wxKEY_STRING);

+    if (m_deleteContents) hash_table[position]->DeleteContents(TRUE);
+  }

 
   hash_table[position]->Append (key, object);
 
   hash_table[position]->Append (key, object);

+  m_count++;

 }
 
 wxObject *wxHashTable::Get (long key, long value) const
 {
   // Should NEVER be
   long k = (long) key;
 }
 
 wxObject *wxHashTable::Get (long key, long value) const
 {
   // Should NEVER be
   long k = (long) key;

-  if (k < 0)
-    k = -k;

 
   int position = (int) (k % n);
 
   int position = (int) (k % n);

+  if (position < 0) position = -position;
+

   if (!hash_table[position])
     return (wxObject *) NULL;
   else
   if (!hash_table[position])
     return (wxObject *) NULL;
   else


@@ -150,14 +191,14 @@ wxObject *wxHashTable::Get (long key, long value) const
     }
 }
 
     }
 }
 

-wxObject *wxHashTable::Get (long key, const char *value) const
+wxObject *wxHashTable::Get (long key, const wxChar *value) const

 {
   // Should NEVER be
   long k = (long) key;
 {
   // Should NEVER be
   long k = (long) key;

-  if (k < 0)
-    k = -k;
-
+ 

   int position = (int) (k % n);
   int position = (int) (k % n);

+  if (position < 0) position = -position;
+

   if (!hash_table[position])
     return (wxObject *) NULL;
   else
   if (!hash_table[position])
     return (wxObject *) NULL;
   else


@@ -174,10 +215,10 @@ wxObject *wxHashTable::Get (long key) const
 {
   // Should NEVER be
   long k = (long) key;
 {
   // Should NEVER be
   long k = (long) key;

-  if (k < 0)
-    k = -k;

 
   int position = (int) (k % n);
 
   int position = (int) (k % n);

+  if (position < 0) position = -position;
+

   if (!hash_table[position])
     return (wxObject *) NULL;
   else
   if (!hash_table[position])
     return (wxObject *) NULL;
   else


@@ -187,9 +228,10 @@ wxObject *wxHashTable::Get (long key) const
     }
 }
 
     }
 }
 

-wxObject *wxHashTable::Get (const char *key) const
+wxObject *wxHashTable::Get (const wxChar *key) const

 {
   int position = (int) (MakeKey (key) % n);
 {
   int position = (int) (MakeKey (key) % n);

+  if (position < 0) position = -position;

 
   if (!hash_table[position])
     return (wxObject *) NULL;
 
   if (!hash_table[position])
     return (wxObject *) NULL;


@@ -204,10 +246,10 @@ wxObject *wxHashTable::Delete (long key)
 {
   // Should NEVER be
   long k = (long) key;
 {
   // Should NEVER be
   long k = (long) key;

-  if (k < 0)
-    k = -k;

 
   int position = (int) (k % n);
 
   int position = (int) (k % n);

+  if (position < 0) position = -position;
+

   if (!hash_table[position])
     return (wxObject *) NULL;
   else
   if (!hash_table[position])
     return (wxObject *) NULL;
   else


@@ -217,6 +259,7 @@ wxObject *wxHashTable::Delete (long key)
        {
          wxObject *data = node->Data ();
          delete node;
        {
          wxObject *data = node->Data ();
          delete node;

+         m_count--;

          return data;
        }
       else
          return data;
        }
       else


@@ -224,9 +267,11 @@ wxObject *wxHashTable::Delete (long key)
     }
 }
 
     }
 }
 

-wxObject *wxHashTable::Delete (const char *key)
+wxObject *wxHashTable::Delete (const wxChar *key)

 {
   int position = (int) (MakeKey (key) % n);
 {
   int position = (int) (MakeKey (key) % n);

+  if (position < 0) position = -position;
+

   if (!hash_table[position])
     return (wxObject *) NULL;
   else
   if (!hash_table[position])
     return (wxObject *) NULL;
   else


@@ -236,6 +281,7 @@ wxObject *wxHashTable::Delete (const char *key)
        {
          wxObject *data = node->Data ();
          delete node;
        {
          wxObject *data = node->Data ();
          delete node;

+         m_count--;

          return data;
        }
       else
          return data;
        }
       else


@@ -246,11 +292,11 @@ wxObject *wxHashTable::Delete (const char *key)
 wxObject *wxHashTable::Delete (long key, int value)
 {
   // Should NEVER be
 wxObject *wxHashTable::Delete (long key, int value)
 {
   // Should NEVER be

-  long k = (long) key;
-  if (k < 0)
-    k = -k;
+  long k = (long) key; 

 
   int position = (int) (k % n);
 
   int position = (int) (k % n);

+  if (position < 0) position = -position;
+

   if (!hash_table[position])
     return (wxObject *) NULL;
   else
   if (!hash_table[position])
     return (wxObject *) NULL;
   else


@@ -260,6 +306,7 @@ wxObject *wxHashTable::Delete (long key, int value)
        {
          wxObject *data = node->Data ();
          delete node;
        {
          wxObject *data = node->Data ();
          delete node;

+         m_count--;

          return data;
        }
       else
          return data;
        }
       else


@@ -267,9 +314,11 @@ wxObject *wxHashTable::Delete (long key, int value)
     }
 }
 
     }
 }
 

-wxObject *wxHashTable::Delete (long key, const char *value)
+wxObject *wxHashTable::Delete (long key, const wxChar *value)

 {
   int position = (int) (key % n);
 {
   int position = (int) (key % n);

+  if (position < 0) position = -position;
+

   if (!hash_table[position])
     return (wxObject *) NULL;
   else
   if (!hash_table[position])
     return (wxObject *) NULL;
   else


@@ -279,6 +328,7 @@ wxObject *wxHashTable::Delete (long key, const char *value)
        {
          wxObject *data = node->Data ();
          delete node;
        {
          wxObject *data = node->Data ();
          delete node;

+         m_count--;

          return data;
        }
       else
          return data;
        }
       else


@@ -286,12 +336,12 @@ wxObject *wxHashTable::Delete (long key, const char *value)
     }
 }
 
     }
 }
 

-long wxHashTable::MakeKey (const char *string) const
+long wxHashTable::MakeKey (const wxChar *string) const

 {
   long int_key = 0;
 
   while (*string)
 {
   long int_key = 0;
 
   while (*string)

-    int_key += (unsigned char) *string++;
+    int_key += (wxUChar) *string++;

 
   return int_key;
 }
 
   return int_key;
 }


@@ -338,6 +388,7 @@ wxNode *wxHashTable::Next (void)
 void wxHashTable::DeleteContents (bool flag)
 {
   int i;
 void wxHashTable::DeleteContents (bool flag)
 {
   int i;

+  m_deleteContents = flag;

   for (i = 0; i < n; i++)
     {
       if (hash_table[i])
   for (i = 0; i < n; i++)
     {
       if (hash_table[i])


@@ -353,5 +404,6 @@ void wxHashTable::Clear (void)
       if (hash_table[i])
        hash_table[i]->Clear ();
     }
       if (hash_table[i])
        hash_table[i]->Clear ();
     }

+  m_count = 0;

 }
 
 }