tracy/server/TracyVector.hpp

#ifndef __TRACYVECTOR_HPP__
#define __TRACYVECTOR_HPP__

#include <assert.h>
#include <stdint.h>

#include "TracyMemory.hpp"

namespace tracy
{

#if 0
template<typename T>
using Vector = std::vector<T>;
#else
template<typename T>
class Vector
{
public:
    Vector()
        : m_ptr( nullptr )
        , m_size( 0 )
        , m_capacity( 0 )
    {
    }

    Vector( const Vector& ) = delete;
    Vector( Vector&& src )
        : m_ptr( src.m_ptr )
        , m_size( src.m_size )
        , m_capacity( src.m_capacity )
    {
        src.m_ptr = nullptr;
    }

    ~Vector()
    {
        memUsage.fetch_sub( m_capacity * sizeof( T ), std::memory_order_relaxed );
        delete[] m_ptr;
    }

    Vector& operator=( const Vector& ) = delete;
    Vector& operator=( Vector&& src )
    {
        delete[] m_ptr;
        m_ptr = src.m_ptr;
        m_size = src.m_size;
        m_capacity = src.m_capacity;
        src.m_ptr = nullptr;
        return *this;
    }

    bool empty() const { return m_size == 0; }
    size_t size() const { return m_size; }

    const T* data() { return m_ptr; };

    T* begin() { return m_ptr; }
    const T* begin() const { return m_ptr; }
    T* end() { return m_ptr + m_size; }
    const T* end() const { return m_ptr + m_size; }

    T& back() { assert( m_size > 0 ); return m_ptr[m_size - 1]; }
    const T& back() const { assert( m_size > 0 ); return m_ptr[m_size - 1]; }

    T& operator[]( size_t idx ) { return m_ptr[idx]; }
    const T& operator[]( size_t idx ) const { return m_ptr[idx]; }

    void push_back( const T& v )
    {
        if( m_size == m_capacity ) AllocMore();
        m_ptr[m_size++] = v;
    }

    void push_back( T&& v )
    {
        if( m_size == m_capacity ) AllocMore();
        m_ptr[m_size++] = std::move( v );
    }

    T* insert( T* it, const T& v )
    {
        assert( it >= m_ptr && it <= m_ptr + m_size );
        const auto dist = it - m_ptr;
        if( m_size == m_capacity ) AllocMore();
        if( dist != m_size ) memmove( m_ptr + dist + 1, m_ptr + dist, ( m_size - dist ) * sizeof( T ) );
        m_size++;
        m_ptr[dist] = v;
        return m_ptr + dist;
    }

    T* insert( T* it, T&& v )
    {
        assert( it >= m_ptr && it <= m_ptr + m_size );
        const auto dist = it - m_ptr;
        if( m_size == m_capacity ) AllocMore();
        if( dist != m_size ) memmove( m_ptr + dist + 1, m_ptr + dist, ( m_size - dist ) * sizeof( T ) );
        m_size++;
        m_ptr[dist] = std::move( v );
        return m_ptr + dist;
    }

    T* erase( T* begin, T* end )
    {
        assert( begin >= m_ptr && begin <= m_ptr + m_size );
        assert( end >= m_ptr && end <= m_ptr + m_size );
        assert( begin <= end );

        const auto dist = end - begin;
        if( dist > 0 )
        {
            memmove( begin, end, ( m_size - ( end - m_ptr ) ) * sizeof( T ) );
            m_size -= dist;
        }
        return begin;
    }

    void reserve( size_t cap )
    {
        if( cap <= m_capacity ) return;
        memUsage.fetch_add( ( cap - m_capacity ) * sizeof( T ), std::memory_order_relaxed );
        m_capacity = cap;
        Realloc();
    }

private:
    void AllocMore()
    {
        if( m_capacity == 0 )
        {
            m_capacity = 1;
            memUsage.fetch_add( m_capacity * sizeof( T ), std::memory_order_relaxed );
        }
        else
        {
            memUsage.fetch_add( m_capacity * sizeof( T ), std::memory_order_relaxed );
            m_capacity *= 2;
        }
        Realloc();
    }

    void Realloc()
    {
        T* ptr = new T[m_capacity];
        if( m_size != 0 )
        {
            memcpy( ptr, m_ptr, m_size * sizeof( T ) );
            delete[] m_ptr;
        }
        m_ptr = ptr;
    }

    T* m_ptr;
    uint32_t m_size;
    uint32_t m_capacity;
};
#endif

}

#endif