vector_dist_operators_list_ker.hpp

/*
 * vector_dist_operators_list_ker.hpp
 *
 *  Created on: Jun 7, 2019
 *      Author: i-bird
 */

#ifndef VECTOR_DIST_OPERATORS_LIST_KER_HPP_
#define VECTOR_DIST_OPERATORS_LIST_KER_HPP_

template<typename T>
struct ref_wrap
{
    bool is_sorted;
    T & v;

    ref_wrap(T & v, bool is_sorted)
    :v(v),is_sorted(is_sorted)
    {}

    ref_wrap & operator=(const ref_wrap<T> & rw)
    {
        v = rw.v;
        return *this;
    }
};

template<typename vector_dist_ker_type>
class vector_dist_ker_list
{
    openfpm::vector<ref_wrap<vector_dist_ker_type>> vkers;

public:

    void add(vector_dist_ker_type & v, bool is_sorted)
    {
        ref_wrap<vector_dist_ker_type> rw(v,is_sorted);

        vkers.add(rw);

        if (vkers.size() >= 64)
        {
            std::cout << __FILE__ << ":" << __LINE__ << " The array of tracked vector_dist_ker become suspiciously big, are there memory leak ? " << std::endl;
        }
    }

    void update(const vector_dist_ker_type & v)
    {
        for (size_t i = 0 ; i < vkers.size() ; i++)
        {
            if (vkers.get(i).is_sorted == false)
            {vkers.get(i).v = v;}
        }
    }

    void update_sort(const vector_dist_ker_type & vs)
    {
        for (size_t i = 0 ; i < vkers.size() ; i++)
        {
            if (vkers.get(i).is_sorted == true)
            {vkers.get(i).v = vs;}
        }
    }

    void remove(vector_dist_ker_type & v)
    {
        for (size_t i = 0 ; i < vkers.size() ; i++)
        {
            if (&vkers.get(i).v == &v)
            {
                vkers.remove(i);
                break;
            }
        }
    }

    size_t n_entry()
    {
        return vkers.size();
    }

    bool check(const vector_dist_ker_type & v)
    {
        for (size_t i = 0 ; i < vkers.size() ; i++)
        {
            if (!(vkers.get(i).v == v))
            {
                return false;
            }
        }

        return true;
    }
};

#endif /* VECTOR_DIST_OPERATORS_LIST_KER_HPP_ */