Added some append and prepend functions and operators to Bu::List, now you can

append one list to another and the like.

Also, wow, I found a bug that's been around for ages, I guess we don't copy
hash tables often.  The interesting thing is that it actually worked, it copied
but it would include any data that had been deleted in the old hash table but
not reclaimed yet and insert it as new data.  Usually the key had been
completely destroyed (like with a string) so it came out as keyed to blank
string.  So in cases like that, all deleted keys would collapse into one deleted
key in the new hash table.

1 files changed, 7 insertions, 8 deletions

diff --git a/src/hash.h b/src/hash.h
index 8c58645..8856860 100644
--- a/src/hash.h
+++ b/src/hash.h
@@ -268,7 +268,7 @@ namespace Bu
 
                         for( uint32_t j = 0; j < src.nCapacity; j++ )
                         {
-                                if( src.isFilled( j ) )
+                                if( src.isFilled( j ) && !src.isDeleted( j ) )
                                 {
                                         insert( src.aKeys[j], src.aValues[j] );
                                 }
@@ -283,12 +283,11 @@ namespace Bu
                 {
                         for( uint32_t j = 0; j < nCapacity; j++ )
                         {
-                                if( isFilled( j ) )
-                                        if( !isDeleted( j ) )
-                                        {
-                                                va.destroy( &aValues[j] );
-                                                ka.destroy( &aKeys[j] );
-                                        }
+                                if( isFilled( j ) && !isDeleted( j ) )
+                                {
+                                        va.destroy( &aValues[j] );
+                                        ka.destroy( &aKeys[j] );
+                                }
                         }
                         va.deallocate( aValues, nCapacity );
                         ka.deallocate( aKeys, nCapacity );
@@ -310,7 +309,7 @@ namespace Bu
 
                         for( uint32_t j = 0; j < src.nCapacity; j++ )
                         {
-                                if( src.isFilled( j ) )
+                                if( src.isFilled( j ) && !src.isDeleted( j ) )
                                 {
                                         insert( src.aKeys[j], src.aValues[j] );
                                 }