spine-runtimes/spine-cpp/spine-cpp/include/spine/SimpleArray.h

/******************************************************************************
 * Spine Runtimes Software License v2.5
 *
 * Copyright (c) 2013-2016, Esoteric Software
 * All rights reserved.
 *
 * You are granted a perpetual, non-exclusive, non-sublicensable, and
 * non-transferable license to use, install, execute, and perform the Spine
 * Runtimes software and derivative works solely for personal or internal
 * use. Without the written permission of Esoteric Software (see Section 2 of
 * the Spine Software License Agreement), you may not (a) modify, translate,
 * adapt, or develop new applications using the Spine Runtimes or otherwise
 * create derivative works or improvements of the Spine Runtimes or (b) remove,
 * delete, alter, or obscure any trademarks or any copyright, trademark, patent,
 * or other intellectual property or proprietary rights notices on or in the
 * Software, including any copy thereof. Redistributions in binary or source
 * form must include this license and terms.
 *
 * THIS SOFTWARE IS PROVIDED BY ESOTERIC SOFTWARE "AS IS" AND ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
 * EVENT SHALL ESOTERIC SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES, BUSINESS INTERRUPTION, OR LOSS OF
 * USE, DATA, OR PROFITS) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
 * IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
 * POSSIBILITY OF SUCH DAMAGE.
 *****************************************************************************/

#ifndef Spine_SimpleArray_h
#define Spine_SimpleArray_h

#include <memory>
#include <assert.h>

namespace Spine
{
    template <typename T>
    class SimpleArray
    {
    public:
        SimpleArray() : _size(0), _capacity(0), _buffer(nullptr)
        {
            // Empty
        }
        
        SimpleArray(const SimpleArray& inArray)
        {
            _size = inArray._size;
            _capacity = inArray._capacity;
            if (_capacity)
            {
                _buffer = allocate(_capacity);
                for (size_t i = 0; i < _size; ++i)
                {
                    construct(_buffer + i, inArray._buffer[i]);
                }
            }
        }
        
        ~SimpleArray()
        {
            clear();
            deallocate(_buffer);
        }
        
        void push_back(const T& _value)
        {
            if (_size == _capacity)
            {
                reserve();
            }
            
            construct(_buffer + _size++, _value);
        }
        
        void insert(size_t _index, const T& _value)
        {
            assert(_index < _size);
            
            if (_size == _capacity)
            {
                reserve();
            }
            
            for (size_t i = ++_size - 1; i > _index; --i)
            {
                construct(_buffer + i, _buffer[i - 1]);
                destroy(_buffer + (i - 1));
            }
            
            construct(_buffer + _index, _value);
        }
        
        void erase(size_t _index)
        {
            assert(_index < _size);
            
            --_size;
            
            if (_index != _size)
            {
                for (size_t i = _index; i < _size; ++i)
                {
                    _buffer[i] = std::move(_buffer[i + 1]);
                }
            }
            
            destroy(_buffer + _size);
        }
        
        void clear()
        {
            for (size_t i = 0; i < _size; ++i)
            {
                destroy(_buffer + (_size - 1 - i));
            }
            
            _size = 0;
        }
        
        size_t size() const
        {
            return _size;
        }
        
        T& operator[](size_t _index)
        {
            assert(_index < _size);
            
            return _buffer[_index];
        }
        
        void reserve(long inCapacity = -1)
        {
            size_t newCapacity = inCapacity != -1 ? inCapacity : _capacity ? _capacity * 2 : 1;
            _buffer = static_cast<T*>(realloc(_buffer, newCapacity * sizeof(T)));
            _capacity = newCapacity;
        }
        
        T* begin()
        {
            return &_buffer[0];
        }
        
        T* end()
        {
            return &_buffer[_size];
        }
        
    private:
        size_t _size;
        size_t _capacity;
        T* _buffer;
        
        T* allocate(size_t n)
        {
            assert(n > 0);
            
            void* ptr = malloc(n * sizeof(T));
            assert(ptr);
            
            return static_cast<T*>(ptr);
        }
        
        void deallocate(T* buffer)
        {
            free(buffer);
        }
        
        void construct(T* buffer, const T& val)
        {
            /// This is a placement new operator
            /// which basically means we are contructing a new object
            /// using pre-allocated memory
            new (buffer) T(val);
        }
        
        void destroy(T* buffer)
        {
            buffer->~T();
        }
    };
}

#endif /* Spine_SimpleArray_h */