bsnes/purify/phoenix/nall/reference_array.hpp

#ifndef NALL_REFERENCE_ARRAY_HPP
#define NALL_REFERENCE_ARRAY_HPP

#include <algorithm>
#include <type_traits>
#include <nall/bit.hpp>

namespace nall {
  template<typename T> struct reference_array {
    struct exception_out_of_bounds{};

  protected:
    typedef typename std::remove_reference<T>::type type_t;
    type_t **pool;
    unsigned poolsize, buffersize;

  public:
    unsigned size() const { return buffersize; }
    unsigned capacity() const { return poolsize; }

    void reset() {
      if(pool) free(pool);
      pool = nullptr;
      poolsize = 0;
      buffersize = 0;
    }

    void reserve(unsigned newsize) {
      if(newsize == poolsize) return;

      pool = (type_t**)realloc(pool, sizeof(type_t*) * newsize);
      poolsize = newsize;
      buffersize = min(buffersize, newsize);
    }

    void resize(unsigned newsize) {
      if(newsize > poolsize) reserve(bit::round(newsize));
      buffersize = newsize;
    }

    template<typename... Args>
    bool append(type_t& data, Args&&... args) {
      bool result = append(data);
      append(std::forward<Args>(args)...);
      return result;
    }

    bool append(type_t& data) {
      for(unsigned index = 0; index < buffersize; index++) {
        if(pool[index] == &data) return false;
      }

      unsigned index = buffersize++;
      if(index >= poolsize) resize(index + 1);
      pool[index] = &data;
      return true;
    }

    bool remove(type_t& data) {
      for(unsigned index = 0; index < buffersize; index++) {
        if(pool[index] == &data) {
          for(unsigned i = index; i < buffersize - 1; i++) pool[i] = pool[i + 1];
          resize(buffersize - 1);
          return true;
        }
      }
      return false;
    }

    template<typename... Args> reference_array(Args&... args) : pool(nullptr), poolsize(0), buffersize(0) {
      construct(args...);
    }

    ~reference_array() {
      reset();
    }

    reference_array& operator=(const reference_array &source) {
      if(pool) free(pool);
      buffersize = source.buffersize;
      poolsize = source.poolsize;
      pool = (type_t**)malloc(sizeof(type_t*) * poolsize);
      memcpy(pool, source.pool, sizeof(type_t*) * buffersize);
      return *this;
    }

    reference_array& operator=(const reference_array &&source) {
      if(pool) free(pool);
      pool = source.pool;
      poolsize = source.poolsize;
      buffersize = source.buffersize;
      source.pool = nullptr;
      source.reset();
      return *this;
    }

    inline type_t& operator[](unsigned index) {
      if(index >= buffersize) throw exception_out_of_bounds();
      return *pool[index];
    }

    inline type_t& operator[](unsigned index) const {
      if(index >= buffersize) throw exception_out_of_bounds();
      return *pool[index];
    }

    //iteration
    struct iterator {
      bool operator!=(const iterator &source) const { return index != source.index; }
      type_t& operator*() { return array.operator[](index); }
      iterator& operator++() { index++; return *this; }
      iterator(const reference_array &array, unsigned index) : array(array), index(index) {}
    private:
      const reference_array &array;
      unsigned index;
    };

    iterator begin() { return iterator(*this, 0); }
    iterator end() { return iterator(*this, buffersize); }
    const iterator begin() const { return iterator(*this, 0); }
    const iterator end() const { return iterator(*this, buffersize); }

  private:
    void construct() {
    }

    void construct(const reference_array &source) {
      operator=(source);
    }

    void construct(const reference_array &&source) {
      operator=(std::move(source));
    }

    template<typename... Args> void construct(T data, Args&... args) {
      append(data);
      construct(args...);
    }
  };
}

#endif