More tweaks and informational functions.

1 files changed, 50 insertions, 0 deletions

diff --git a/src/array.h b/src/array.h
index 39efb9e..ede43cc 100644
--- a/src/array.h
+++ b/src/array.h
@@ -297,6 +297,17 @@ namespace Bu
                                 return *this;
                         }
                         
+                        iterator operator+( int iAmnt )
+                        {
+                                if( iPos < 0 )
+                                        throw ArrayException(
+                                                "Cannot increment iterator past end of array.");
+                                        iPos += iAmnt;
+                                if( iPos >= src.getSize() )
+                                        iPos = -1;
+                                return *this;
+                        }
+                        
                         iterator operator--( int )
                         {
                                 if( iPos < 0 )
@@ -316,6 +327,15 @@ namespace Bu
                                         iPos = -1;
                                 return *this;
                         }
+                        
+                        iterator operator-( int iAmnt )
+                        {
+                                if( iPos < src.getSize() )
+                                        iPos -= iAmnt;
+                                if( iPos <= 0 )
+                                        iPos = -1;
+                                return *this;
+                        }
 
                         bool operator==( const iterator &oth ) const
                         {
@@ -477,6 +497,36 @@ namespace Bu
                         return const_iterator( *this, -1 );
                 }
 
+                MyType &insert( iterator i, const value &rVal )
+                {
+                        if( i.iPos == -1 )
+                        {
+                                append( rVal );
+                                return *this;
+                        }
+
+                        _hardCopy();
+                        if( core->iSize == core->iCapacity )
+                        {
+                                core->setCapacity( core->iCapacity + inc );
+                        }
+                        core->iSize++;
+
+                        core->va.construct(
+                                &core->pData[core->iSize-1],
+                                core->pData[core->iSize-2]
+                                );
+                        for( int iPos = core->iSize-2; iPos > i.iPos; iPos-- )
+                        {
+                                core->va.destroy( &core->pData[iPos] );
+                                core->va.construct( &core->pData[iPos], core->pData[iPos-1] );
+                        }
+                        core->va.destroy( &core->pData[i.iPos] );
+                        core->va.construct( &core->pData[i.iPos], rVal );
+
+                        return *this;
+                }
+
                 /**
                  * If order is important, use this.  It will delete the suggested item
                  * and move the rest of the data up a spot.  This is a time O(n)