Added a list template class, seems to work pretty well for now, I may have

forgotten proper cleanup in the deconstructor, but besides that you can do
almost everything you need.  I'll make a slist/stack next, probably with the
same basic code, just a different structure (not doubley-linked).

The xml system from old-libbu++ is almost completely converted, I was going to
re-write it, but this seemed easier at first, it may not have been, we'll see.
It almost parses everything again, and almost outputs again, and it does use
streams now.

The FString is partway to doing minimum chunk allocations, so that adding
single-characters will be really fast up to the minimum chunk size.  I also
figured out how to add this optimization without any extra variables taking
up space, and it's optional in the template, which is cool.  You can specify
the size of the blocks (default 256 bytes), if it's 0 then they'll be like the
old FString, 1 chunk per operation.

The next FString update should be allowing efficient removal from the begining
of the string by faking it, and simply moving a secondary base pointer ahead,
and then optimizing appends after that fact to simply move the existing data
around if you shouldn't have to re-allocate (alla FlexBuf).  The final fun
addition that I'm planning is a simple switch in the template (boolean) that
will switch an FString into a thread-safe mode without changing the interface
or anything that you can do with them at all.  It may increasing memory usage,
but they should still be better than std::strings, and totally thread-safe.

The best part of that is that if it's done with a boolean template parameter and
if statements that only test that parameter controlling flow, the code that you
don't want (threadsafe/non-threadsafe) won't be included at all
post-optimization.

1 files changed, 9 insertions, 5 deletions

diff --git a/src/fstring.h b/src/fstring.h
index 877e5a7..f738f63 100644
--- a/src/fstring.h
+++ b/src/fstring.h
@@ -28,7 +28,7 @@ namespace Bu
          * data is actually copied.  This also means that you never need to put any
          * FBasicString into a ref-counting container class.
          */
-        template< typename chr, typename chralloc=std::allocator<chr>, typename chunkalloc=std::allocator<struct FStringChunk<chr> > >
+        template< typename chr, int nMinSize=256, typename chralloc=std::allocator<chr>, typename chunkalloc=std::allocator<struct FStringChunk<chr> > >
         class FBasicString : public Archival
         {
 #ifndef VALTEST
@@ -36,7 +36,7 @@ namespace Bu
 #endif
         private:
                 typedef struct FStringChunk<chr> Chunk;
-                typedef struct FBasicString<chr, chralloc, chunkalloc> MyType;
+                typedef struct FBasicString<chr, nMinSize, chralloc, chunkalloc> MyType;
 
         public:
                 FBasicString() :
@@ -131,6 +131,11 @@ namespace Bu
                         appendChunk( pNew );
                 }
 
+                void append( const chr cData )
+                {
+                        append( &cData, 1 );
+                }
+
                 void prepend( const chr *pData )
                 {
                         long nLen;
@@ -231,8 +236,7 @@ namespace Bu
 
                 MyType &operator +=( const chr pData )
                 {
-                        chr tmp[2] = { pData, (chr)0 };
-                        append( tmp );
+                        append( &pData, 1 );
 
                         return (*this);
                 }
@@ -475,7 +479,7 @@ namespace Bu
                         }
                 }
                 
-                void copyFrom( const FBasicString<chr, chralloc, chunkalloc> &rSrc )
+                void copyFrom( const FBasicString<chr, nMinSize, chralloc, chunkalloc> &rSrc )
                 {
                         if( rSrc.pFirst == NULL )
                                 return;