vector_property.h

/*
 * Copyright 2016 Ophidian
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements.  See the NOTICE file
distributed with this work for additional information
regarding copyright ownership.  The ASF licenses this file
to you under the Apache License, Version 2.0 (the
"License"); you may not use this file except in compliance
with the License.  You may obtain a copy of the License at

  http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing,
software distributed under the License is distributed on an
"AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
KIND, either express or implied.  See the License for the
specific language governing permissions and limitations
under the License.
 */

#ifndef SRC_ENTITY_SYSTEM_VECTOR_PROPERTY_H
#define SRC_ENTITY_SYSTEM_VECTOR_PROPERTY_H

#include <vector>
#include "property.h"
#include <stdexcept>

namespace ophidian{
namespace entity_system{


template <class T>
class vector_property : public property {

    std::vector<T> m_values;

    inline void m_range_check(size_t index) const {
        if(index >= m_values.size())
            throw std::out_of_range("vector::_M_range_check");
    }


    void destroy(entity_index e ) {
        std::size_t last_index = m_values.size() - 1;
        m_values[e] = m_values[last_index];
        m_values.pop_back();
    }


    void create( ) {
        m_values.push_back(T());
    }


    void preallocate( std::size_t qnt ) {
        m_values.reserve(std::max(m_values.capacity(), qnt));
    }

public:

    vector_property(){

    }
    ~vector_property(){

    }


    T &operator[](entity_index e) {
        return m_values[e];
    }


    const T &operator[](entity_index e) const {
        return m_values[e];
    }


    T & at(entity_index e) {
#ifndef NDEBUG
        m_range_check(e);
#endif
        return m_values[e];
    }


    const T & at(entity_index e) const {
#ifndef NDEBUG
        m_range_check(e);
#endif
        return m_values[e];
    }


    typename std::vector<T>::const_iterator begin() const {
        return m_values.begin();
    }


    typename std::vector<T>::const_iterator end() const {
        return m_values.end();
    }

    T* data() {
        return m_values.data();
    }

    const T* data() const {
        return m_values.data();
    }
};

template <>
class vector_property<bool> : public property {
    std::vector<bool> m_values;

    inline void m_range_check(size_t index) const {
        if(index >= m_values.size())
            throw std::out_of_range("vector::_M_range_check");
    }

    void destroy( entity_index e ) {
        std::size_t last_index = m_values.size() - 1;
        m_values[e] = m_values[last_index];
        m_values.pop_back();
    }

    void create( ) {
        m_values.push_back(bool());
    }

    void preallocate( std::size_t qnt ) {
        m_values.reserve(std::max(m_values.capacity(), qnt));
    }

public:
    vector_property() {

    }

    vector_property(bool default_value) : m_values(default_value) {

    }    

    bool operator[](std::size_t entity_index) const {
        return m_values[entity_index];
    }

    std::vector<bool>::reference operator[](std::size_t entity_index) {
        return m_values[entity_index];
    }

    bool at(std::size_t entity_index) const {
#ifndef NDEBUG
        m_range_check(entity_index);
#endif
        return m_values[entity_index];
    }

    std::vector<bool>::reference at(std::size_t entity_index) {
#ifndef NDEBUG
        m_range_check(entity_index);
#endif
        return m_values[entity_index];
    }

    std::vector<bool>::const_iterator begin() const {
        return m_values.begin();
    }

    std::vector<bool>::const_iterator end() const {
        return m_values.end();
    }
};

} /* namespace entity system */
} /* namespace ophidian */


#endif //SRC_ENTITY_SYSTEM_VECTOR_PROPERTY_H