vector_dist_cell_list_tests.cpp

/*
 * vector_dist_cell_list_tests.hpp
 *
 *  Created on: Aug 16, 2016
 *      Author: i-bird
 */
 
#include "config.h"
#define BOOST_TEST_DYN_LINK
#include <boost/test/unit_test.hpp>
#include "Point_test.hpp"
#include "Vector/performance/vector_dist_performance_common.hpp"
#include "Vector/vector_dist.hpp"
 
extern void print_test_v(std::string test, size_t sz);
extern long int decrement(long int k, long int step);
 
 
void test_reorder_sfc(reorder_opt opt)
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 48)
        return;
 
    // set the seed
    // create the random generator engine
    std::srand(v_cl.getProcessUnitID());
    std::default_random_engine eg;
    std::uniform_real_distribution<float> ud(0.0f, 1.0f);
 
#ifdef TEST_COVERAGE_MODE
    long int k = 24288 * v_cl.getProcessingUnits();
#else
    long int k = 524288 * v_cl.getProcessingUnits();
#endif
 
    long int big_step = k / 4;
    big_step = (big_step == 0)?1:big_step;
 
    print_test_v( "Testing 2D vector with sfc curve reordering k<=",k);
 
    // 2D test
    for ( ; k >= 2 ; k-= decrement(k,big_step) )
    {
        BOOST_TEST_CHECKPOINT( "Testing 2D vector with sfc curve reordering k=" << k );
 
        Box<2,float> box({0.0,0.0},{1.0,1.0});
 
        // Boundary conditions
        size_t bc[2]={NON_PERIODIC,NON_PERIODIC};
 
        vector_dist<2,float, Point_test<float> > vd(k,box,bc,Ghost<2,float>(0.01));
 
        auto it = vd.getIterator();
 
        while (it.isNext())
        {
            auto key = it.get();
 
            vd.getPos(key)[0] = ud(eg);
            vd.getPos(key)[1] = ud(eg);
 
            ++it;
        }
 
        vd.map();
 
        // in case of SE_CLASS3 get a cell-list without ghost get is an error
 
        // Create first cell list
 
        auto NN1 = vd.getCellList(0.01,true);
 
        //An order of a curve
        int32_t m = 6;
 
        //Reorder a vector
        vd.reorder(m,opt);
 
        // Create second cell list
        auto NN2 = vd.getCellList(0.01,true);
 
        //Check equality of cell sizes
        for (size_t i = 0 ; i < NN1.getGrid().size() ; i++)
        {
            size_t n1 = NN1.getNelements(i);
            size_t n2 = NN2.getNelements(i);
 
            BOOST_REQUIRE_EQUAL(n1,n2);
        }
    }
}
 
 
void test_reorder_cl()
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 48)
        return;
 
    // set the seed
    // create the random generator engine
    std::srand(v_cl.getProcessUnitID());
    std::default_random_engine eg;
    std::uniform_real_distribution<float> ud(0.0f, 1.0f);
 
#ifdef TEST_COVERAGE_MODE
    long int k = 24288 * v_cl.getProcessingUnits();
#else
    long int k = 524288 * v_cl.getProcessingUnits();
#endif
 
    long int big_step = k / 4;
    big_step = (big_step == 0)?1:big_step;
 
    print_test_v( "Testing 2D vector with sfc curve reordering k<=",k);
 
    // 2D test
    for ( ; k >= 2 ; k-= decrement(k,big_step) )
    {
        BOOST_TEST_CHECKPOINT( "Testing 2D vector with sfc curve reordering k=" << k );
 
        Box<2,float> box({0.0,0.0},{1.0,1.0});
 
        // Boundary conditions
        size_t bc[2]={NON_PERIODIC,NON_PERIODIC};
 
        vector_dist<2,float, Point_test<float> > vd(k,box,bc,Ghost<2,float>(0.01));
 
        auto it = vd.getIterator();
 
        while (it.isNext())
        {
            auto key = it.get();
 
            vd.getPos(key)[0] = ud(eg);
            vd.getPos(key)[1] = ud(eg);
 
            ++it;
        }
 
        vd.map();
 
        // in case of SE_CLASS3 get a cell-list without ghost get is an error
 
        // Create first cell list
 
        auto NN1 = vd.getCellList(0.01,true);
 
        //Reorder a vector
        vd.reorder_rcut(0.01);
 
        // Create second cell list
        auto NN2 = vd.getCellList(0.01,true);
 
        //Check equality of cell sizes
        for (size_t i = 0 ; i < NN1.getGrid().size() ; i++)
        {
            size_t n1 = NN1.getNelements(i);
            size_t n2 = NN2.getNelements(i);
 
            BOOST_REQUIRE_EQUAL(n1,n2);
        }
    }
}
 
BOOST_AUTO_TEST_SUITE( vector_dist_cell_list_test_suite )
 
BOOST_AUTO_TEST_CASE( vector_dist_reorder_2d_test )
{
    test_reorder_sfc(reorder_opt::HILBERT);
    test_reorder_sfc(reorder_opt::LINEAR);
}
 
BOOST_AUTO_TEST_CASE( vector_dist_reorder_cl_test )
{
    test_reorder_cl();
}
 
BOOST_AUTO_TEST_CASE( vector_dist_cl_random_vs_hilb_forces_test )
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 48)
    {return;}
 
 
    // Dimensionality of the space
    const size_t dim = 3;
    // Cut-off radiuses. Can be put different number of values
    openfpm::vector<float> cl_r_cutoff {0.05};
    // The starting amount of particles (remember that this number is multiplied by number of processors you use for testing)
    size_t cl_k_start = 10000;
    // The lower threshold for number of particles
    size_t cl_k_min = 1000;
    // Ghost part of distributed vector
    double ghost_part = 0.05;
 
 
    //For different r_cut
    for (size_t r = 0; r < cl_r_cutoff.size(); r++ )
    {
        //Cut-off radius
        float r_cut = cl_r_cutoff.get(r);
 
        //Number of particles
        size_t k = cl_k_start * v_cl.getProcessingUnits();
 
        std::string str("Testing " + std::to_string(dim) + "D vector's forces (random vs hilb celllist) k<=");
 
        print_test_v(str,k);
 
        //For different number of particles
        for (size_t k_int = k ; k_int >= cl_k_min ; k_int/=2 )
        {
            BOOST_TEST_CHECKPOINT( "Testing " << dim << "D vector's forces (random vs hilb celllist) k<=" << k_int );
 
            Box<dim,float> box;
 
            for (size_t i = 0; i < dim; i++)
            {
                box.setLow(i,0.0);
                box.setHigh(i,1.0);
            }
 
            // Boundary conditions
            size_t bc[dim];
 
            for (size_t i = 0; i < dim; i++)
                bc[i] = PERIODIC;
 
            vector_dist<dim,float, aggregate<float[dim]> > vd(k_int,box,bc,Ghost<dim,float>(ghost_part));
 
            vector_dist<dim,float, aggregate<float[dim]> > vd2(k_int,box,bc,Ghost<dim,float>(ghost_part));
 
            // Initialize dist vectors
            vd_initialize_double<dim>(vd, vd2, v_cl, k_int);
 
            vd.ghost_get<0>();
            vd2.ghost_get<0>();
 
            //Get a cell list
 
            auto NN = vd.getCellList(r_cut);
 
            //Calculate forces
 
            calc_forces<dim>(NN,vd,r_cut);
 
            //Get a cell list hilb
 
            auto NN_hilb = vd2.getCellList_hilb(r_cut);
 
            //Calculate forces
            calc_forces_hilb<dim>(NN_hilb,vd2,r_cut);
 
            // Calculate average
            size_t count = 1;
            Point<dim,float> avg;
            for (size_t i = 0 ; i < dim ; i++)  {avg.get(i) = 0.0;}
 
            auto it_v2 = vd.getIterator();
            while (it_v2.isNext())
            {
                //key
                vect_dist_key_dx key = it_v2.get();
 
                for (size_t i = 0; i < dim; i++)
                {avg.get(i) += fabs(vd.getProp<0>(key)[i]);}
 
                ++count;
                ++it_v2;
            }
 
            for (size_t i = 0 ; i < dim ; i++)  {avg.get(i) /= count;}
 
            auto it_v = vd.getIterator();
            while (it_v.isNext())
            {
                //key
                vect_dist_key_dx key = it_v.get();
 
                for (size_t i = 0; i < dim; i++)
                {
                    auto a1 = vd.getProp<0>(key)[i];
                    auto a2 = vd2.getProp<0>(key)[i];
 
                    //Check that the forces are (almost) equal
                    float per = 0.1;
                    if (a1 != 0.0)
                        per = fabs(0.1*avg.get(i)/a1);
 
                    BOOST_REQUIRE_CLOSE((float)a1,(float)a2,per);
                }
 
                ++it_v;
            }
        }
    }
}
 
BOOST_AUTO_TEST_CASE( vector_dist_cl_random_vs_reorder_forces_test )
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 48)
        return;
 
 
    // Dimensionality of the space
    const size_t dim = 3;
    // Cut-off radiuses. Can be put different number of values
    openfpm::vector<float> cl_r_cutoff {0.01};
    // The starting amount of particles (remember that this number is multiplied by number of processors you use for testing)
    size_t cl_k_start = 10000;
    // The lower threshold for number of particles
    size_t cl_k_min = 1000;
    // Ghost part of distributed vector
    double ghost_part = 0.01;
 
 
    //For different r_cut
    for (size_t r = 0; r < cl_r_cutoff.size(); r++ )
    {
        //Cut-off radius
        float r_cut = cl_r_cutoff.get(r);
 
        //Number of particles
        size_t k = cl_k_start * v_cl.getProcessingUnits();
 
        std::string str("Testing " + std::to_string(dim) + "D vector's forces (random vs reorder) k<=");
 
        print_test_v(str,k);
 
        //For different number of particles
        for (size_t k_int = k ; k_int >= cl_k_min ; k_int/=2 )
        {
            BOOST_TEST_CHECKPOINT( "Testing " << dim << "D vector's forces (random vs reorder) k<=" << k_int );
 
            Box<dim,float> box;
 
            for (size_t i = 0; i < dim; i++)
            {
                box.setLow(i,0.0);
                box.setHigh(i,1.0);
            }
 
            // Boundary conditions
            size_t bc[dim];
 
            for (size_t i = 0; i < dim; i++)
                bc[i] = PERIODIC;
 
            vector_dist<dim,float, aggregate<float[dim], float[dim]> > vd(k_int,box,bc,Ghost<dim,float>(ghost_part));
 
            // Initialize vd
            vd_initialize<dim,decltype(vd)>(vd, v_cl);
 
            vd.ghost_get<0>();
 
            //Get a cell list
 
            auto NN1 = vd.getCellList(r_cut);
 
            //Calculate forces '0'
 
            calc_forces<dim>(NN1,vd,r_cut);
 
            //Reorder and get a cell list again
 
            vd.reorder(4);
 
            vd.ghost_get<0>();
 
            auto NN2 = vd.getCellList(r_cut);
 
            //Calculate forces '1'
            calc_forces<dim,1>(NN2,vd,r_cut);
 
            // Calculate average (For Coverty scan we start from 1)
            size_t count = 1;
            Point<dim,float> avg;
            for (size_t i = 0 ; i < dim ; i++)  {avg.get(i) = 0.0;}
 
            auto it_v2 = vd.getIterator();
            while (it_v2.isNext())
            {
                //key
                vect_dist_key_dx key = it_v2.get();
 
                for (size_t i = 0; i < dim; i++)
                    avg.get(i) += fabs(vd.getProp<0>(key)[i]);
 
                ++count;
                ++it_v2;
            }
 
            for (size_t i = 0 ; i < dim ; i++)  {avg.get(i) /= count;}
 
            //Test for equality of forces
            auto it_v = vd.getDomainIterator();
 
            while (it_v.isNext())
            {
                //key
                vect_dist_key_dx key = it_v.get();
 
                for (size_t i = 0; i < dim; i++)
                {
                    float a1 = vd.getProp<0>(key)[i];
                    float a2 = vd.getProp<1>(key)[i];
 
                    //Check that the forces are (almost) equal
                    float per = 0.1;
                    if (a1 != 0.0)
                        per = fabs(0.1*avg.get(i)/a1);
 
                    BOOST_REQUIRE_CLOSE(a1,a2,per);
                }
 
                ++it_v;
            }
        }
    }
}
 
BOOST_AUTO_TEST_CASE( vector_dist_symmetric_cell_list )
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 24)
        return;
 
    float L = 1000.0;
 
    // set the seed
    // create the random generator engine
    std::srand(0);
    std::default_random_engine eg;
    std::uniform_real_distribution<float> ud(-L,L);
 
    long int k = 4096 * v_cl.getProcessingUnits();
 
    long int big_step = k / 4;
    big_step = (big_step == 0)?1:big_step;
 
    print_test_v("Testing 3D periodic vector symmetric cell-list k=",k);
    BOOST_TEST_CHECKPOINT( "Testing 3D periodic vector symmetric cell-list k=" << k );
 
    Box<3,float> box({-L,-L,-L},{L,L,L});
 
    // Boundary conditions
    size_t bc[3]={PERIODIC,PERIODIC,PERIODIC};
 
    float r_cut = 100.0;
 
    // ghost
    Ghost<3,float> ghost(r_cut);
 
    // Point and global id
    struct point_and_gid
    {
        size_t id;
        Point<3,float> xq;
 
        bool operator<(const struct point_and_gid & pag) const
        {
            return (id < pag.id);
        }
    };
 
    typedef  aggregate<size_t,size_t,size_t,openfpm::vector<point_and_gid>,openfpm::vector<point_and_gid>> part_prop;
 
    // Distributed vector
    vector_dist<3,float, part_prop > vd(k,box,bc,ghost,BIND_DEC_TO_GHOST);
    size_t start = vd.init_size_accum(k);
 
    auto it = vd.getIterator();
 
    while (it.isNext())
    {
        auto key = it.get();
 
        vd.getPosWrite(key)[0] = ud(eg);
        vd.getPosWrite(key)[1] = ud(eg);
        vd.getPosWrite(key)[2] = ud(eg);
 
        // Fill some properties randomly
 
        vd.getPropWrite<0>(key) = 0;
        vd.getPropWrite<1>(key) = 0;
        vd.getPropWrite<2>(key) = key.getKey() + start;
 
        ++it;
    }
 
    vd.map();
 
    // sync the ghost
    vd.ghost_get<0,2>();
 
    auto NN = vd.getCellList(r_cut);
    auto p_it = vd.getDomainIterator();
 
    while (p_it.isNext())
    {
        auto p = p_it.get();
 
        Point<3,float> xp = vd.getPosRead(p);
 
        auto Np = NN.getNNIterator(NN.getCell(xp));
 
        while (Np.isNext())
        {
            auto q = Np.get();
 
            if (p.getKey() == q)
            {
                ++Np;
                continue;
            }
 
            // repulsive
 
            Point<3,float> xq = vd.getPosRead(q);
            Point<3,float> f = (xp - xq);
 
            float distance = f.norm();
 
            // Particle should be inside 2 * r_cut range
 
            if (distance < r_cut )
            {
                vd.getPropWrite<0>(p)++;
                vd.getPropWrite<3>(p).add();
                vd.getPropWrite<3>(p).last().xq = xq;
                vd.getPropWrite<3>(p).last().id = vd.getPropWrite<2>(q);
            }
 
            ++Np;
        }
 
        ++p_it;
    }
 
    // We now try symmetric  Cell-list
 
    auto NN2 = vd.getCellListSym(r_cut);
 
    auto p_it2 = vd.getDomainIterator();
 
    while (p_it2.isNext())
    {
        auto p = p_it2.get();
 
        Point<3,float> xp = vd.getPosRead(p);
 
        auto Np = NN2.getNNIteratorSym<NO_CHECK>(NN2.getCell(xp),p.getKey(),vd.getPosVector());
 
        while (Np.isNext())
        {
            auto q = Np.get();
 
            if (p.getKey() == q)
            {
                ++Np;
                continue;
            }
 
            // repulsive
 
            Point<3,float> xq = vd.getPosRead(q);
            Point<3,float> f = (xp - xq);
 
            float distance = f.norm();
 
            // Particle should be inside r_cut range
 
            if (distance < r_cut )
            {
                vd.getPropWrite<1>(p)++;
                vd.getPropWrite<1>(q)++;
 
                vd.getPropWrite<4>(p).add();
                vd.getPropWrite<4>(q).add();
 
                vd.getPropWrite<4>(p).last().xq = xq;
                vd.getPropWrite<4>(q).last().xq = xp;
                vd.getPropWrite<4>(p).last().id = vd.getProp<2>(q);
                vd.getPropWrite<4>(q).last().id = vd.getProp<2>(p);
            }
 
            ++Np;
        }
 
        ++p_it2;
    }
 
    vd.ghost_put<add_,1>();
    vd.ghost_put<merge_,4>();
 
    auto p_it3 = vd.getDomainIterator();
 
    bool ret = true;
    while (p_it3.isNext())
    {
        auto p = p_it3.get();
 
        ret &= vd.getPropRead<1>(p) == vd.getPropRead<0>(p);
 
        vd.getPropWrite<3>(p).sort();
        vd.getPropWrite<4>(p).sort();
 
        ret &= vd.getPropRead<3>(p).size() == vd.getPropRead<4>(p).size();
 
        for (size_t i = 0 ; i < vd.getPropRead<3>(p).size() ; i++)
            ret &= vd.getPropRead<3>(p).get(i).id == vd.getPropRead<4>(p).get(i).id;
 
        if (ret == false)
        {
            std::cout << vd.getPropRead<3>(p).size() << "   " << vd.getPropRead<4>(p).size() << std::endl;
 
            for (size_t i = 0 ; i < vd.getPropRead<3>(p).size() ; i++)
                std::cout << vd.getPropRead<3>(p).get(i).id << "    " << vd.getPropRead<4>(p).get(i).id << std::endl;
 
            std::cout << vd.getPropRead<1>(p) << "  A  " << vd.getPropRead<0>(p) << std::endl;
 
            break;
        }
 
        ++p_it3;
    }
 
    BOOST_REQUIRE_EQUAL(ret,true);
}
 
BOOST_AUTO_TEST_CASE( vector_dist_symmetric_crs_cell_list )
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 24)
        return;
 
    float L = 1000.0;
 
    // set the seed
    // create the random generator engine
    std::default_random_engine eg(1132312*v_cl.getProcessUnitID());
    std::uniform_real_distribution<float> ud(-L,L);
 
    long int k = 4096 * v_cl.getProcessingUnits();
 
    long int big_step = k / 4;
    big_step = (big_step == 0)?1:big_step;
 
    print_test_v("Testing 3D periodic vector symmetric crs cell-list k=",k);
    BOOST_TEST_CHECKPOINT( "Testing 3D periodic vector symmetric crs cell-list k=" << k );
 
    Box<3,float> box({-L,-L,-L},{L,L,L});
 
    // Boundary conditions
    size_t bc[3]={PERIODIC,PERIODIC,PERIODIC};
 
    float r_cut = 100.0;
 
    // ghost
    Ghost<3,float> ghost(r_cut);
    Ghost<3,float> ghost2(r_cut);
    ghost2.setLow(0,0.0);
    ghost2.setLow(1,0.0);
    ghost2.setLow(2,0.0);
 
    // Point and global id
    struct point_and_gid
    {
        size_t id;
        Point<3,float> xq;
 
        bool operator<(const struct point_and_gid & pag) const
        {
            return (id < pag.id);
        }
    };
 
    typedef  aggregate<size_t,size_t,size_t,openfpm::vector<point_and_gid>,openfpm::vector<point_and_gid>> part_prop;
 
    // Distributed vector
    vector_dist<3,float, part_prop > vd(k,box,bc,ghost,BIND_DEC_TO_GHOST);
    vector_dist<3,float, part_prop > vd2(k,box,bc,ghost2,BIND_DEC_TO_GHOST);
    size_t start = vd.init_size_accum(k);
 
    auto it = vd.getIterator();
 
    while (it.isNext())
    {
        auto key = it.get();
 
        vd.getPosWrite(key)[0] = ud(eg);
        vd.getPosWrite(key)[1] = ud(eg);
        vd.getPosWrite(key)[2] = ud(eg);
 
        vd2.getPosWrite(key)[0] = vd.getPosRead(key)[0];
        vd2.getPosWrite(key)[1] = vd.getPosRead(key)[1];
        vd2.getPosWrite(key)[2] = vd.getPosRead(key)[2];
 
        // Fill some properties randomly
 
        vd.getPropWrite<0>(key) = 0;
        vd.getPropWrite<1>(key) = 0;
        vd.getPropWrite<2>(key) = key.getKey() + start;
 
        vd2.getPropWrite<0>(key) = 0;
        vd2.getPropWrite<1>(key) = 0;
        vd2.getPropWrite<2>(key) = key.getKey() + start;
 
        ++it;
    }
 
    vd.map();
    vd2.map();
 
    // sync the ghost
    vd.ghost_get<0,2>();
    vd2.ghost_get<0,2>();
 
    auto NN = vd.getCellList(r_cut);
    auto p_it = vd.getDomainIterator();
 
    while (p_it.isNext())
    {
        auto p = p_it.get();
 
        Point<3,float> xp = vd.getPosRead(p);
 
        auto Np = NN.getNNIterator(NN.getCell(xp));
 
        while (Np.isNext())
        {
            auto q = Np.get();
 
            if (p.getKey() == q)
            {
                ++Np;
                continue;
            }
 
            // repulsive
 
            Point<3,float> xq = vd.getPosRead(q);
            Point<3,float> f = (xp - xq);
 
            float distance = f.norm();
 
            // Particle should be inside 2 * r_cut range
 
            if (distance < r_cut )
            {
                vd.getPropWrite<0>(p)++;
                vd.getPropWrite<3>(p).add();
                vd.getPropWrite<3>(p).last().xq = xq;
                vd.getPropWrite<3>(p).last().id = vd.getPropRead<2>(q);
            }
 
            ++Np;
        }
 
        ++p_it;
    }
 
    // We now try symmetric  Cell-list
 
    auto NN2 = vd2.getCellListSym(r_cut);
 
    // In case of CRS we have to iterate particles within some cells
    // here we define whichone
    auto p_it2 = vd2.getParticleIteratorCRS_Cell(NN2);
 
    // For each particle
    while (p_it2.isNext())
    {
        auto p = p_it2.get();
 
        Point<3,float> xp = vd2.getPosRead(p);
 
        auto Np = p_it2.getNNIteratorCSR(vd2.getPosVector());
 
        while (Np.isNext())
        {
            auto q = Np.get();
 
            if (p == q)
            {
                ++Np;
                continue;
            }
 
            // repulsive
 
            Point<3,float> xq = vd2.getPosRead(q);
            Point<3,float> f = (xp - xq);
 
            float distance = f.norm();
 
            // Particle should be inside r_cut range
 
            if (distance < r_cut )
            {
                vd2.getPropWrite<1>(p)++;
                vd2.getPropWrite<1>(q)++;
 
                vd2.getPropWrite<4>(p).add();
                vd2.getPropWrite<4>(q).add();
 
                vd2.getPropWrite<4>(p).last().xq = xq;
                vd2.getPropWrite<4>(q).last().xq = xp;
                vd2.getPropWrite<4>(p).last().id = vd2.getPropRead<2>(q);
                vd2.getPropWrite<4>(q).last().id = vd2.getPropRead<2>(p);
            }
 
            ++Np;
        }
 
        ++p_it2;
    }
 
    vd2.ghost_put<add_,1>(NO_CHANGE_ELEMENTS);
    vd2.ghost_put<merge_,4>();
 
#ifdef SE_CLASS3
    vd2.getDomainIterator();
#endif
 
    auto p_it3 = vd.getDomainIterator();
 
    bool ret = true;
    while (p_it3.isNext())
    {
        auto p = p_it3.get();
 
        ret &= vd2.getPropRead<1>(p) == vd.getPropRead<0>(p);
 
 
        vd.getPropWrite<3>(p).sort();
        vd2.getPropWrite<4>(p).sort();
 
        ret &= vd.getPropRead<3>(p).size() == vd2.getPropRead<4>(p).size();
 
        for (size_t i = 0 ; i < vd.getPropRead<3>(p).size() ; i++)
            ret &= vd.getPropRead<3>(p).get(i).id == vd2.getPropRead<4>(p).get(i).id;
 
        if (ret == false)
            break;
 
        ++p_it3;
    }
 
    BOOST_REQUIRE_EQUAL(ret,true);
}
 
template<typename VerletList>
void test_vd_symmetric_verlet_list()
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 24)
        return;
 
    float L = 1000.0;
 
    // set the seed
    // create the random generator engine
    std::srand(0);
    std::default_random_engine eg;
    std::uniform_real_distribution<float> ud(-L,L);
 
    long int k = 4096 * v_cl.getProcessingUnits();
 
    long int big_step = k / 4;
    big_step = (big_step == 0)?1:big_step;
 
    print_test_v("Testing 3D periodic vector symmetric cell-list k=",k);
    BOOST_TEST_CHECKPOINT( "Testing 3D periodic vector symmetric verlet-list k=" << k );
 
    Box<3,float> box({-L,-L,-L},{L,L,L});
 
    // Boundary conditions
    size_t bc[3]={PERIODIC,PERIODIC,PERIODIC};
 
    float r_cut = 100.0;
 
    // ghost
    Ghost<3,float> ghost(r_cut);
 
    // Point and global id
    struct point_and_gid
    {
        size_t id;
        Point<3,float> xq;
 
        bool operator<(const struct point_and_gid & pag) const
        {
            return (id < pag.id);
        }
    };
 
    typedef  aggregate<size_t,size_t,size_t,openfpm::vector<point_and_gid>,openfpm::vector<point_and_gid>> part_prop;
 
    // Distributed vector
    vector_dist<3,float, part_prop > vd(k,box,bc,ghost,BIND_DEC_TO_GHOST);
    size_t start = vd.init_size_accum(k);
 
    auto it = vd.getIterator();
 
    while (it.isNext())
    {
        auto key = it.get();
 
        vd.getPosWrite(key)[0] = ud(eg);
        vd.getPosWrite(key)[1] = ud(eg);
        vd.getPosWrite(key)[2] = ud(eg);
 
        // Fill some properties randomly
 
        vd.template getPropWrite<0>(key) = 0;
        vd.template getPropWrite<1>(key) = 0;
        vd.template getPropWrite<2>(key) = key.getKey() + start;
 
        ++it;
    }
 
    vd.map();
 
    // sync the ghost
    vd.template ghost_get<0,2>();
 
    auto NN = vd.template getVerlet<VerletList>(r_cut);
    auto p_it = vd.getDomainIterator();
 
    while (p_it.isNext())
    {
        auto p = p_it.get();
 
        Point<3,float> xp = vd.getPosRead(p);
 
        auto Np = NN.getNNIterator(p.getKey());
 
        while (Np.isNext())
        {
            auto q = Np.get();
 
            if (p.getKey() == q)
            {
                ++Np;
                continue;
            }
 
            // repulsive
 
            Point<3,float> xq = vd.getPosRead(q);
            Point<3,float> f = (xp - xq);
 
            float distance = f.norm();
 
            // Particle should be inside 2 * r_cut range
 
            if (distance < r_cut )
            {
                vd.template getPropWrite<0>(p)++;
                vd.template getPropWrite<3>(p).add();
                vd.template getPropWrite<3>(p).last().xq = xq;
                vd.template getPropWrite<3>(p).last().id = vd.template getPropRead<2>(q);
            }
 
            ++Np;
        }
 
        ++p_it;
    }
 
    // We now try symmetric  Cell-list
 
    auto NN2 = vd.template getVerletSym<VerletList>(r_cut);
 
    auto p_it2 = vd.getDomainIterator();
 
    while (p_it2.isNext())
    {
        auto p = p_it2.get();
 
        Point<3,float> xp = vd.getPosRead(p);
 
        auto Np = NN2.template getNNIterator<NO_CHECK>(p.getKey());
 
        while (Np.isNext())
        {
            auto q = Np.get();
 
            if (p.getKey() == q)
            {
                ++Np;
                continue;
            }
 
            // repulsive
 
            Point<3,float> xq = vd.getPosRead(q);
            Point<3,float> f = (xp - xq);
 
            float distance = f.norm();
 
            // Particle should be inside r_cut range
 
            if (distance < r_cut )
            {
                vd.template getPropWrite<1>(p)++;
                vd.template getPropWrite<1>(q)++;
 
                vd.template getPropWrite<4>(p).add();
                vd.template getPropWrite<4>(q).add();
 
                vd.template getPropWrite<4>(p).last().xq = xq;
                vd.template getPropWrite<4>(q).last().xq = xp;
                vd.template getPropWrite<4>(p).last().id = vd.template getPropRead<2>(q);
                vd.template getPropWrite<4>(q).last().id = vd.template getPropRead<2>(p);
            }
 
            ++Np;
        }
 
        ++p_it2;
    }
 
    vd.template ghost_put<add_,1>();
    vd.template ghost_put<merge_,4>();
 
    auto p_it3 = vd.getDomainIterator();
 
    bool ret = true;
    while (p_it3.isNext())
    {
        auto p = p_it3.get();
 
        ret &= vd.template getPropRead<1>(p) == vd.template getPropRead<0>(p);
 
        vd.template getPropWrite<3>(p).sort();
        vd.template getPropWrite<4>(p).sort();
 
        ret &= vd.template getPropRead<3>(p).size() == vd.template getPropRead<4>(p).size();
 
        for (size_t i = 0 ; i < vd.template getPropRead<3>(p).size() ; i++)
            ret &= vd.template getPropRead<3>(p).get(i).id == vd.template getPropRead<4>(p).get(i).id;
 
        if (ret == false)
            break;
 
        ++p_it3;
    }
 
    BOOST_REQUIRE_EQUAL(ret,true);
}
 
BOOST_AUTO_TEST_CASE( vector_dist_symmetric_verlet_list )
{
    test_vd_symmetric_verlet_list<VERLET_MEMFAST(3,float)>();
    test_vd_symmetric_verlet_list<VERLET_MEMBAL(3,float)>();
    test_vd_symmetric_verlet_list<VERLET_MEMMW(3,float)>();
}
 
template<typename VerletList>
void vector_sym_verlet_list_nb()
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 24)
        return;
 
    float L = 1000.0;
 
    // set the seed
    // create the random generator engine
    std::srand(0);
    std::default_random_engine eg;
    std::uniform_real_distribution<float> ud(-L,L);
 
    long int k = 4096 * v_cl.getProcessingUnits();
 
    long int big_step = k / 4;
    big_step = (big_step == 0)?1:big_step;
 
    print_test_v("Testing 3D periodic vector symmetric cell-list no bottom k=",k);
    BOOST_TEST_CHECKPOINT( "Testing 3D periodic vector symmetric cell-list no bottom k=" << k );
 
    Box<3,float> box({-L,-L,-L},{L,L,L});
 
    // Boundary conditions
    size_t bc[3]={PERIODIC,PERIODIC,PERIODIC};
 
    float r_cut = 100.0;
 
    // ghost
    Ghost<3,float> ghost(r_cut);
    Ghost<3,float> ghost2(r_cut);
    ghost2.setLow(2,0.0);
 
    // Point and global id
    struct point_and_gid
    {
        size_t id;
        Point<3,float> xq;
 
        bool operator<(const struct point_and_gid & pag) const
        {
            return (id < pag.id);
        }
    };
 
    typedef  aggregate<size_t,size_t,size_t,openfpm::vector<point_and_gid>,openfpm::vector<point_and_gid>> part_prop;
 
    // 3D test
    for (size_t s = 0 ; s < 8 ; s++)
    {
 
        // Distributed vector
        vector_dist<3,float, part_prop > vd(k,box,bc,ghost,BIND_DEC_TO_GHOST);
        vector_dist<3,float, part_prop > vd2(k,box,bc,ghost2,BIND_DEC_TO_GHOST);
        size_t start = vd.init_size_accum(k);
 
        auto it = vd.getIterator();
 
        while (it.isNext())
        {
            auto key = it.get();
 
            vd.getPosWrite(key)[0] = ud(eg);
            vd.getPosWrite(key)[1] = ud(eg);
            vd.getPosWrite(key)[2] = ud(eg);
 
            vd2.getPosWrite(key)[0] = vd.getPosRead(key)[0];
            vd2.getPosWrite(key)[1] = vd.getPosRead(key)[1];
            vd2.getPosWrite(key)[2] = vd.getPosRead(key)[2];
 
            // Fill some properties randomly
 
            vd.template getPropWrite<0>(key) = 0;
            vd.template getPropWrite<1>(key) = 0;
            vd.template getPropWrite<2>(key) = key.getKey() + start;
 
            vd2.template getPropWrite<0>(key) = 0;
            vd2.template getPropWrite<1>(key) = 0;
            vd2.template getPropWrite<2>(key) = key.getKey() + start;
 
            ++it;
        }
 
        vd.map();
        vd2.map();
 
        // sync the ghost
        vd.template ghost_get<0,2>();
        vd2.template ghost_get<0,2>();
 
        auto NN = vd.template getVerlet<VerletList>(r_cut);
        auto p_it = vd.getDomainIterator();
 
        while (p_it.isNext())
        {
            auto p = p_it.get();
 
            Point<3,float> xp = vd.getPosRead(p);
 
            auto Np = NN.getNNIterator(p.getKey());
 
            while (Np.isNext())
            {
                auto q = Np.get();
 
                if (p.getKey() == q)
                {
                    ++Np;
                    continue;
                }
 
                // repulsive
 
                Point<3,float> xq = vd.getPosRead(q);
                Point<3,float> f = (xp - xq);
 
                float distance = f.norm();
 
                // Particle should be inside 2 * r_cut range
 
                if (distance < r_cut )
                {
                    vd.template getPropWrite<0>(p)++;
                    vd.template getPropWrite<3>(p).add();
                    vd.template getPropWrite<3>(p).last().xq = xq;
                    vd.template getPropWrite<3>(p).last().id = vd.template getPropRead<2>(q);
                }
 
                ++Np;
            }
 
            ++p_it;
        }
 
        // We now try symmetric  Cell-list
 
        auto NN2 = vd2.template getVerletSym<VerletList>(r_cut);
 
        auto p_it2 = vd2.getDomainIterator();
 
        while (p_it2.isNext())
        {
            auto p = p_it2.get();
 
            Point<3,float> xp = vd2.getPosRead(p);
 
            auto Np = NN2.template getNNIterator<NO_CHECK>(p.getKey());
 
            while (Np.isNext())
            {
                auto q = Np.get();
 
                if (p.getKey() == q)
                {
                    ++Np;
                    continue;
                }
 
                // repulsive
 
                Point<3,float> xq = vd2.getPosRead(q);
                Point<3,float> f = (xp - xq);
 
                float distance = f.norm();
 
                // Particle should be inside r_cut range
 
                if (distance < r_cut )
                {
                    vd2.template getPropWrite<1>(p)++;
                    vd2.template getPropWrite<1>(q)++;
 
                    vd2.template getPropWrite<4>(p).add();
                    vd2.template getPropWrite<4>(q).add();
 
                    vd2.template getPropWrite<4>(p).last().xq = xq;
                    vd2.template getPropWrite<4>(q).last().xq = xp;
                    vd2.template getPropWrite<4>(p).last().id = vd2.template getPropRead<2>(q);
                    vd2.template getPropWrite<4>(q).last().id = vd2.template getPropRead<2>(p);
                }
 
                ++Np;
            }
 
 
            ++p_it2;
        }
 
        vd2.template ghost_put<add_,1>();
        vd2.template ghost_put<merge_,4>();
 
#ifdef SE_CLASS3
        vd2.getDomainIterator();
#endif
 
        auto p_it3 = vd.getDomainIterator();
 
        bool ret = true;
        while (p_it3.isNext())
        {
            auto p = p_it3.get();
 
            ret &= vd2.template getPropRead<1>(p) == vd.template getPropRead<0>(p);
 
            vd.template getPropWrite<3>(p).sort();
            vd2.template getPropWrite<4>(p).sort();
 
            ret &= vd.template getPropRead<3>(p).size() == vd2.template getPropRead<4>(p).size();
 
            for (size_t i = 0 ; i < vd.template getPropRead<3>(p).size() ; i++)
                ret &= vd.template getPropRead<3>(p).get(i).id == vd2.template getPropRead<4>(p).get(i).id;
 
            if (ret == false)
                break;
 
            ++p_it3;
        }
 
        BOOST_REQUIRE_EQUAL(ret,true);
    }
}
 
BOOST_AUTO_TEST_CASE( vector_dist_symmetric_verlet_list_no_bottom )
{
    vector_sym_verlet_list_nb<VERLET_MEMFAST(3,float)>();
    vector_sym_verlet_list_nb<VERLET_MEMBAL(3,float)>();
    vector_sym_verlet_list_nb<VERLET_MEMMW(3,float)>();
 
    vector_sym_verlet_list_nb<VERLET_MEMFAST_INT(3,float)>();
    vector_sym_verlet_list_nb<VERLET_MEMBAL_INT(3,float)>();
    vector_sym_verlet_list_nb<VERLET_MEMMW_INT(3,float)>();
}
 
template<typename VerletList, typename part_prop> void test_crs_full(vector_dist<3,float, part_prop > & vd,
                                                vector_dist<3,float, part_prop > & vd2,
                                                std::default_random_engine & eg,
                                                std::uniform_real_distribution<float> & ud,
                                                size_t start,
                                                float r_cut)
{
    auto it = vd.getIterator();
 
    while (it.isNext())
    {
        auto key = it.get();
 
        vd.getPosWrite(key)[0] = ud(eg);
        vd.getPosWrite(key)[1] = ud(eg);
        vd.getPosWrite(key)[2] = ud(eg);
 
        vd2.getPosWrite(key)[0] = vd.getPosRead(key)[0];
        vd2.getPosWrite(key)[1] = vd.getPosRead(key)[1];
        vd2.getPosWrite(key)[2] = vd.getPosRead(key)[2];
 
        // Fill some properties randomly
 
        vd.template getPropWrite<0>(key) = 0;
        vd.template getPropWrite<1>(key) = 0;
        vd.template getPropWrite<2>(key) = key.getKey() + start;
 
        vd2.template getPropWrite<0>(key) = 0;
        vd2.template getPropWrite<1>(key) = 0;
        vd2.template getPropWrite<2>(key) = key.getKey() + start;
 
        ++it;
    }
 
    vd.map();
    vd2.map();
 
    // sync the ghost
    vd.template ghost_get<0,2>();
    vd2.template ghost_get<0,2>();
 
    auto NN = vd.template getVerlet<VerletList>(r_cut);
    auto p_it = vd.getDomainIterator();
 
    while (p_it.isNext())
    {
        auto p = p_it.get();
 
        Point<3,float> xp = vd.getPosRead(p);
 
        auto Np = NN.getNNIterator(p.getKey());
 
        while (Np.isNext())
        {
            auto q = Np.get();
 
            if (p.getKey() == q)
            {
                ++Np;
                continue;
            }
 
            // repulsive
 
            Point<3,float> xq = vd.getPosRead(q);
            Point<3,float> f = (xp - xq);
 
            float distance = f.norm();
 
            // Particle should be inside 2 * r_cut range
 
            if (distance < r_cut )
            {
                vd.template getPropWrite<0>(p)++;
                vd.template getPropWrite<3>(p).add();
                vd.template getPropWrite<3>(p).last().xq = xq;
                vd.template getPropWrite<3>(p).last().id = vd.template getPropRead<2>(q);
            }
 
            ++Np;
        }
 
        ++p_it;
    }
 
    // We now try symmetric Verlet-list Crs scheme
 
    auto NN2 = vd2.template getVerletCrs<VerletList>(r_cut);
 
    // Because iterating across particles in the CSR scheme require a Cell-list
    auto p_it2 = vd2.getParticleIteratorCRS_Cell(NN2.getInternalCellList());
 
    while (p_it2.isNext())
    {
        auto p = p_it2.get();
 
        Point<3,float> xp = vd2.getPosRead(p);
 
        auto Np = NN2.template getNNIterator<NO_CHECK>(p);
 
        while (Np.isNext())
        {
            auto q = Np.get();
 
            if (p == q)
            {
                ++Np;
                continue;
            }
 
            // repulsive
 
            Point<3,float> xq = vd2.getPosRead(q);
            Point<3,float> f = (xp - xq);
 
            float distance = f.norm();
 
            if (distance < r_cut )
            {
                vd2.template getPropWrite<1>(p)++;
                vd2.template getPropWrite<1>(q)++;
 
                vd2.template getPropWrite<4>(p).add();
                vd2.template getPropWrite<4>(q).add();
 
                vd2.template getPropWrite<4>(p).last().xq = xq;
                vd2.template getPropWrite<4>(q).last().xq = xp;
                vd2.template getPropWrite<4>(p).last().id = vd2.template getPropRead<2>(q);
                vd2.template getPropWrite<4>(q).last().id = vd2.template getPropRead<2>(p);
            }
 
            ++Np;
        }
 
        ++p_it2;
    }
 
    vd2.template ghost_put<add_,1>();
    vd2.template ghost_put<merge_,4>();
 
#ifdef SE_CLASS3
    vd2.getDomainIterator();
#endif
 
    auto p_it3 = vd.getDomainIterator();
 
    bool ret = true;
    while (p_it3.isNext())
    {
        auto p = p_it3.get();
 
        ret &= vd2.template getPropRead<1>(p) == vd.template getPropRead<0>(p);
 
        if (ret == false)
        {
            Point<3,float> xp = vd2.getPosRead(p);
            std::cout << "ERROR " << vd2.template getPropWrite<1>(p) << "   " << vd.template getPropWrite<0>(p) <<  "    " << xp.toString() << std::endl;
        }
 
        vd.template getPropWrite<3>(p).sort();
        vd2.template getPropWrite<4>(p).sort();
 
        ret &= vd.template getPropRead<3>(p).size() == vd2.template getPropRead<4>(p).size();
 
        for (size_t i = 0 ; i < vd.template getPropRead<3>(p).size() ; i++)
            ret &= vd.template getPropRead<3>(p).get(i).id == vd2.template getPropRead<4>(p).get(i).id;
 
        if (ret == false)
            break;
 
        ++p_it3;
    }
 
    BOOST_REQUIRE_EQUAL(ret,true);
}
 
template<typename VerletList>
void test_csr_verlet_list()
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 24)
        return;
 
    float L = 1000.0;
 
    // set the seed
    // create the random generator engine
    std::srand(0);
    std::default_random_engine eg;
    std::uniform_real_distribution<float> ud(-L,L);
 
    long int k = 4096 * v_cl.getProcessingUnits();
 
    long int big_step = k / 4;
    big_step = (big_step == 0)?1:big_step;
 
    print_test_v("Testing 3D periodic vector symmetric cell-list k=",k);
    BOOST_TEST_CHECKPOINT( "Testing 3D periodic vector symmetric cell-list k=" << k );
 
    Box<3,float> box({-L,-L,-L},{L,L,L});
 
    // Boundary conditions
    size_t bc[3]={PERIODIC,PERIODIC,PERIODIC};
 
    float r_cut = 100.0;
 
    // ghost
    Ghost<3,float> ghost(r_cut);
    Ghost<3,float> ghost2(r_cut);
    ghost2.setLow(0,0.0);
    ghost2.setLow(1,0.0);
    ghost2.setLow(2,0.0);
 
    // Point and global id
    struct point_and_gid
    {
        size_t id;
        Point<3,float> xq;
 
        bool operator<(const struct point_and_gid & pag) const
        {
            return (id < pag.id);
        }
    };
 
    typedef  aggregate<size_t,size_t,size_t,openfpm::vector<point_and_gid>,openfpm::vector<point_and_gid>> part_prop;
 
    // Distributed vector
    vector_dist<3,float, part_prop > vd(k,box,bc,ghost,BIND_DEC_TO_GHOST);
    vector_dist<3,float, part_prop > vd2(k,box,bc,ghost2,BIND_DEC_TO_GHOST);
    size_t start = vd.init_size_accum(k);
 
    test_crs_full<VerletList>(vd,vd2,eg,ud,start,r_cut);
}
 
template<typename VerletList>
void test_csr_verlet_list_override()
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 24)
        return;
 
    float L = 1000.0;
 
    // set the seed
    // create the random generator engine
    std::srand(0);
    std::default_random_engine eg;
    std::uniform_real_distribution<float> ud(-L,L);
 
    long int k = 4096 * v_cl.getProcessingUnits();
 
    long int big_step = k / 4;
    big_step = (big_step == 0)?1:big_step;
 
    print_test_v("Testing 3D periodic vector symmetric cell-list k=",k);
    BOOST_TEST_CHECKPOINT( "Testing 3D periodic vector symmetric cell-list k=" << k );
 
    Box<3,float> box({-L,-L,-L},{L,L,L});
 
    // Boundary conditions
    size_t bc[3]={PERIODIC,PERIODIC,PERIODIC};
 
    float r_cut = 100.0;
 
    // ghost
    Ghost<3,float> ghost(r_cut);
    Ghost<3,float> ghost2(r_cut);
    ghost2.setLow(0,0.0);
    ghost2.setLow(1,0.0);
    ghost2.setLow(2,0.0);
 
    // Point and global id
    struct point_and_gid
    {
        size_t id;
        Point<3,float> xq;
 
        bool operator<(const struct point_and_gid & pag) const
        {
            return (id < pag.id);
        }
    };
 
    typedef  aggregate<size_t,size_t,size_t,openfpm::vector<point_and_gid>,openfpm::vector<point_and_gid>> part_prop;
 
    size_t gdist_d[3];
    size_t gdist2_d[3];
 
    gdist_d[0] = 1;
    gdist_d[1] = 2;
    gdist_d[2] = 5;
 
    gdist2_d[0] = 1;
    gdist2_d[1] = 2;
    gdist2_d[2] = 5;
 
    grid_sm<3,void> gdist(gdist_d);
    grid_sm<3,void> gdist2(gdist2_d);
 
    // Distributed vector
    vector_dist<3,float, part_prop > vd(k,box,bc,ghost,BIND_DEC_TO_GHOST,gdist_d);
    vector_dist<3,float, part_prop > vd2(k,box,bc,ghost2,BIND_DEC_TO_GHOST,gdist2_d);
    size_t start = vd.init_size_accum(k);
 
    test_crs_full<VerletList>(vd,vd2,eg,ud,start,r_cut);
}
 
BOOST_AUTO_TEST_CASE( vector_dist_symmetric_crs_verlet_list )
{
    test_csr_verlet_list<VERLET_MEMFAST(3,float)>();
    test_csr_verlet_list<VERLET_MEMBAL(3,float)>();
    test_csr_verlet_list<VERLET_MEMMW(3,float)>();
}
 
BOOST_AUTO_TEST_CASE( vector_dist_symmetric_crs_verlet_list_dec_override )
{
    test_csr_verlet_list_override<VERLET_MEMFAST(3,float)>();
    test_csr_verlet_list_override<VERLET_MEMBAL(3,float)>();
    test_csr_verlet_list_override<VERLET_MEMMW(3,float)>();
}
 
template <typename VerletList>
void test_vd_symmetric_crs_verlet()
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 24)
        return;
 
    float L = 1000.0;
 
    bool ret = true;
 
    // set the seed
    // create the random generator engine
    std::srand(0);
    std::default_random_engine eg;
    std::uniform_real_distribution<float> ud(-L,L);
 
    long int k = 4096 * v_cl.getProcessingUnits();
 
    long int big_step = k / 4;
    big_step = (big_step == 0)?1:big_step;
 
    print_test_v("Testing 3D periodic vector symmetric cell-list k=",k);
    BOOST_TEST_CHECKPOINT( "Testing 3D periodic vector symmetric cell-list k=" << k );
 
    Box<3,float> box({-L,-L,-L},{L,L,L});
 
    // Boundary conditions
    size_t bc[3]={PERIODIC,PERIODIC,PERIODIC};
 
    float r_cut = 100.0;
 
    // ghost
    Ghost<3,float> ghost(r_cut);
    Ghost<3,float> ghost2(r_cut);
    ghost2.setLow(0,0.0);
    ghost2.setLow(1,0.0);
    ghost2.setLow(2,0.0);
 
 
    typedef  aggregate<size_t> part_prop;
 
    // Distributed vector
    vector_dist<3,float, part_prop > vd(k,box,bc,ghost,BIND_DEC_TO_GHOST);
 
    auto it = vd.getIterator();
 
    while (it.isNext())
    {
        auto key = it.get();
 
        vd.getPos(key)[0] = ud(eg);
        vd.getPos(key)[1] = ud(eg);
        vd.getPos(key)[2] = ud(eg);
 
        // Fill some properties randomly
 
        vd.getProp<0>(key) = 0;
 
        ++it;
    }
 
    vd.map();
 
    // sync the ghost
    vd.ghost_get<0>();
 
    // We now try symmetric Verlet-list Crs scheme
 
    auto NN2 = vd.template getVerletCrs<VerletList>(r_cut);
 
    // Because iterating across particles in the CSR scheme require a Cell-list
    auto p_it2 = vd.getParticleIteratorCRS_Cell(NN2.getInternalCellList());
    auto p_it3 = vd.getParticleIteratorCRS(NN2);
 
    while (p_it2.isNext())
    {
        auto p = p_it2.get();
        auto p2 = p_it3.get();
 
        ret &= (p == p2);
 
        if (ret == false)
            break;
 
        ++p_it2;
        ++p_it3;
    }
 
    BOOST_REQUIRE_EQUAL(ret,true);
}
 
BOOST_AUTO_TEST_CASE( vector_dist_symmetric_crs_verlet_list_partit )
{
    test_vd_symmetric_crs_verlet<VERLET_MEMFAST(3,float)>();
    test_vd_symmetric_crs_verlet<VERLET_MEMBAL(3,float)>();
    test_vd_symmetric_crs_verlet<VERLET_MEMMW(3,float)>();
}
 
BOOST_AUTO_TEST_CASE( vector_dist_checking_unloaded_processors )
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 24)
        return;
 
    float L = 200.0;
 
    // set the seed
    // create the random generator engine
    std::srand(0);
    std::default_random_engine eg;
    std::uniform_real_distribution<float> ud(0,L);
 
    long int k = 4096 * v_cl.getProcessingUnits();
 
    long int big_step = k / 4;
    big_step = (big_step == 0)?1:big_step;
 
    print_test_v("Testing 3D periodic vector symmetric cell-list (unload processors) k=",k);
    BOOST_TEST_CHECKPOINT( "Testing 3D periodic vector symmetric cell-list (unload processors) k=" << k );
 
    Box<3,float> box({0,0,0},{L,L,L});
 
    // Boundary conditions
    size_t bc[3]={PERIODIC,PERIODIC,PERIODIC};
 
    float r_cut = 100.0;
 
    // ghost
    Ghost<3,float> ghost(r_cut);
    Ghost<3,float> ghost2(r_cut);
    ghost2.setLow(0,0.0);
    ghost2.setLow(1,0.0);
    ghost2.setLow(2,0.0);
 
 
    typedef  aggregate<size_t> part_prop;
 
    // Distributed vector
    vector_dist<3,float, part_prop > vd(k,box,bc,ghost,BIND_DEC_TO_GHOST);
 
    auto it = vd.getIterator();
 
    while (it.isNext())
    {
        auto key = it.get();
 
        vd.getPos(key)[0] = ud(eg);
        vd.getPos(key)[1] = ud(eg);
        vd.getPos(key)[2] = ud(eg);
 
        // Fill some properties randomly
 
        vd.getProp<0>(key) = 0;
 
        ++it;
    }
 
    vd.map();
 
    //
    if (v_cl.getProcessingUnits() >= 9)
    {
        size_t min = vd.size_local();
 
        v_cl.min(min);
        v_cl.execute();
 
        BOOST_REQUIRE_EQUAL(min,0ul);
    }
 
 
    // sync the ghost
    vd.ghost_get<0>();
 
    //
    if (v_cl.getProcessingUnits() >= 9)
    {
        size_t min = vd.size_local_with_ghost() - vd.size_local();
 
        v_cl.min(min);
        v_cl.execute();
 
        BOOST_REQUIRE_EQUAL(min,0ul);
    }
}
 
BOOST_AUTO_TEST_CASE( vector_dist_cell_list_multi_type )
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 24)
        return;
 
    float L = 1000.0;
 
    // set the seed
    // create the random generator engine
    std::srand(0);
    std::default_random_engine eg;
    std::uniform_real_distribution<float> ud(-L,L);
 
    long int k = 4096 * v_cl.getProcessingUnits();
 
    long int big_step = k / 4;
    big_step = (big_step == 0)?1:big_step;
 
    print_test_v("Testing 3D periodic vector symmetric cell-list k=",k);
    BOOST_TEST_CHECKPOINT( "Testing 3D periodic vector symmetric cell-list k=" << k );
 
    Box<3,float> box({-L,-L,-L},{L,L,L});
 
    // Boundary conditions
    size_t bc[3]={PERIODIC,PERIODIC,PERIODIC};
 
    float r_cut = 100.0;
 
    // ghost
    Ghost<3,float> ghost(r_cut);
 
    typedef  aggregate<size_t> part_prop;
 
    // Distributed vector
    vector_dist<3,float, part_prop > vd(k,box,bc,ghost);
 
    auto it = vd.getIterator();
 
    while (it.isNext())
    {
        auto key = it.get();
 
        vd.getPos(key)[0] = ud(eg);
        vd.getPos(key)[1] = ud(eg);
        vd.getPos(key)[2] = ud(eg);
 
        ++it;
    }
 
    vd.map();
 
    // sync the ghost
    vd.ghost_get<0>();
 
 
    bool ret = true;
 
    // We take different type of Cell-list
    auto NN = vd.getCellList<CELL_MEMFAST(3,float)>(r_cut);
    auto NN2 = vd.getCellList<CELL_MEMBAL(3,float)>(r_cut);
    auto NN3 = vd.getCellList<CELL_MEMMW(3,float)>(r_cut);
 
    auto p_it = vd.getDomainIterator();
 
    while (p_it.isNext())
    {
        auto p = p_it.get();
 
        Point<3,float> xp = vd.getPos(p);
 
        auto Np = NN.getNNIterator(NN.getCell(xp));
        auto Np2 = NN2.getNNIterator(NN2.getCell(xp));
        auto Np3 = NN3.getNNIterator(NN3.getCell(xp));
 
        while (Np.isNext())
        {
            // first all cell-list must agree
 
            ret &= (Np.isNext() == Np2.isNext()) && (Np3.isNext() == Np.isNext());
 
            if (ret == false)
                break;
 
            auto q = Np.get();
            auto q2 = Np2.get();
            auto q3 = Np3.get();
 
            ret &= (q == q2) && (q == q3);
 
            if (ret == false)
                break;
 
            ++Np;
            ++Np2;
            ++Np3;
        }
 
        ret &= (Np.isNext() == Np2.isNext()) && (Np.isNext() == Np3.isNext());
 
        if (ret == false)
            break;
 
        ++p_it;
    }
 
    BOOST_REQUIRE_EQUAL(ret,true);
}
 
// Point and global id
struct point_and_gid
{
    size_t id;
    Point<3,float> xq;
 
    bool operator<(const struct point_and_gid & pag) const
    {
        return (id < pag.id);
    }
};
 
template<typename vector_dist_mp>
void test_vector_dist_particle_NN_MP_iteration()
{
    Vcluster<> & v_cl = create_vcluster();
 
    if (v_cl.getProcessingUnits() > 24)
    {return;}
 
    float L = 1000.0;
 
    // set the seed
    // create the random generator engine
    std::default_random_engine eg;
    eg.seed(v_cl.rank()*4533);
    std::uniform_real_distribution<float> ud(-L,L);
 
    long int k = 4096 * v_cl.getProcessingUnits();
 
    long int big_step = k / 4;
    big_step = (big_step == 0)?1:big_step;
 
    print_test_v("Testing 3D periodic vector symmetric cell-list k=",k);
    BOOST_TEST_CHECKPOINT( "Testing 3D periodic vector symmetric cell-list k=" << k );
 
    Box<3,float> box({-L,-L,-L},{L,L,L});
 
    // Boundary conditions
    size_t bc[3]={PERIODIC,PERIODIC,PERIODIC};
 
    float r_cut = 100.0;
 
    // ghost
    Ghost<3,float> ghost(r_cut);
 
//  typedef  aggregate<size_t,size_t,size_t,openfpm::vector<point_and_gid>,openfpm::vector<point_and_gid>> part_prop;
 
    // Distributed vector
    vector_dist_mp vd(k,box,bc,ghost,BIND_DEC_TO_GHOST);
    size_t start = vd.init_size_accum(k);
 
    auto it = vd.getIterator();
 
    while (it.isNext())
    {
        auto key = it.get();
 
        vd.getPosWrite(key)[0] = ud(eg);
        vd.getPosWrite(key)[1] = ud(eg);
        vd.getPosWrite(key)[2] = ud(eg);
 
        // Fill some properties randomly
 
        vd.template getPropWrite<0>(key) = 0;
        vd.template getPropWrite<1>(key) = 0;
        vd.template getPropWrite<2>(key) = key.getKey() + start;
 
        ++it;
    }
 
    vd.map();
 
    // sync the ghost
    vd.template ghost_get<0,2>();
 
    auto NN = vd.getCellList(r_cut);
    auto p_it = vd.getDomainIterator();
 
    while (p_it.isNext())
    {
        auto p = p_it.get();
 
        Point<3,float> xp = vd.getPosRead(p);
 
        auto Np = NN.getNNIterator(NN.getCell(xp));
 
        while (Np.isNext())
        {
            auto q = Np.get();
 
            if (p.getKey() == q)
            {
                ++Np;
                continue;
            }
 
            // repulsive
 
            Point<3,float> xq = vd.getPosRead(q);
            Point<3,float> f = (xp - xq);
 
            float distance = f.norm();
 
            // Particle should be inside 2 * r_cut range
 
            if (distance < r_cut )
            {
                vd.template getPropWrite<0>(p)++;
                vd.template getPropWrite<3>(p).add();
                vd.template getPropWrite<3>(p).last().xq = xq;
                vd.template getPropWrite<3>(p).last().id = vd.template getPropWrite<2>(q);
            }
 
            ++Np;
        }
 
        ++p_it;
    }
 
    // We now divide the particles on 4 phases
 
    openfpm::vector<vector_dist_mp> phases;
    phases.add( vector_dist_mp(vd.getDecomposition(),0));
    phases.add( vector_dist_mp(phases.get(0).getDecomposition(),0));
    phases.add( vector_dist_mp(phases.get(0).getDecomposition(),0));
    phases.add( vector_dist_mp(phases.get(0).getDecomposition(),0));
 
    auto it2 = vd.getDomainIterator();
 
    while (it2.isNext())
    {
        auto p = it2.get();
 
        if (p.getKey() % 4 == 0)
        {
            phases.get(0).add();
            phases.get(0).getLastPos()[0] = vd.getPos(p)[0];
            phases.get(0).getLastPos()[1] = vd.getPos(p)[1];
            phases.get(0).getLastPos()[2] = vd.getPos(p)[2];
 
            phases.get(0).template getLastProp<1>() = 0;
 
            phases.get(0).template getLastProp<2>() = vd.template getProp<2>(p);
        }
        else if (p.getKey() % 4 == 1)
        {
            phases.get(1).add();
            phases.get(1).getLastPos()[0] = vd.getPos(p)[0];
            phases.get(1).getLastPos()[1] = vd.getPos(p)[1];
            phases.get(1).getLastPos()[2] = vd.getPos(p)[2];
 
            phases.get(1).template getLastProp<1>() = 0;
 
            phases.get(1).template getLastProp<2>() = vd.template getProp<2>(p);
        }
        else if (p.getKey() % 4 == 2)
        {
            phases.get(2).add();
            phases.get(2).getLastPos()[0] = vd.getPos(p)[0];
            phases.get(2).getLastPos()[1] = vd.getPos(p)[1];
            phases.get(2).getLastPos()[2] = vd.getPos(p)[2];
 
            phases.get(2).template getLastProp<1>() = 0;
 
            phases.get(2).template getLastProp<2>() = vd.template getProp<2>(p);
        }
        else
        {
            phases.get(3).add();
            phases.get(3).getLastPos()[0] = vd.getPos(p)[0];
            phases.get(3).getLastPos()[1] = vd.getPos(p)[1];
            phases.get(3).getLastPos()[2] = vd.getPos(p)[2];
 
            phases.get(3).template getLastProp<1>() = 0;
 
            phases.get(3).template getLastProp<2>() = vd.template getProp<2>(p);
        }
 
        ++it2;
    }
 
    // now we get all the Cell-lists
 
    for (size_t i = 0 ; i < phases.size() ; i++)
    {
        phases.get(i).template ghost_get<0,1,2>();
    }
 
    openfpm::vector<CellList<3, float, Mem_fast<>, shift<3, float> >> NN_ptr;
 
    for (size_t i = 0 ; i < phases.size() ; i++)
    {
        NN_ptr.add(phases.get(i).getCellListSym(r_cut));
    }
 
    // We now interact all the phases
 
    for (size_t i = 0 ; i < phases.size() ; i++)
    {
        for (size_t j = 0 ; j < phases.size() ; j++)
        {
            auto p_it2 = phases.get(i).getDomainIterator();
 
            while (p_it2.isNext())
            {
                auto p = p_it2.get();
 
                Point<3,float> xp = phases.get(i).getPosRead(p);
 
                auto Np = NN_ptr.get(j).getNNIteratorSymMP<NO_CHECK>(NN_ptr.get(j).getCell(xp),p.getKey(),phases.get(i).getPosVector(),phases.get(j).getPosVector());
 
                while (Np.isNext())
                {
                    auto q = Np.get();
 
                    if (p.getKey() == q && i == j)
                    {
                        ++Np;
                        continue;
                    }
 
                    // repulsive
 
                    Point<3,float> xq = phases.get(j).getPosRead(q);
                    Point<3,float> f = (xp - xq);
 
                    float distance = f.norm();
 
                    // Particle should be inside r_cut range
 
                    if (distance < r_cut )
                    {
                        phases.get(i).template getPropWrite<1>(p)++;
                        phases.get(j).template getPropWrite<1>(q)++;
 
                        phases.get(i).template getPropWrite<4>(p).add();
                        phases.get(j).template getPropWrite<4>(q).add();
 
                        phases.get(i).template getPropWrite<4>(p).last().xq = xq;
                        phases.get(j).template getPropWrite<4>(q).last().xq = xp;
                        phases.get(i).template getPropWrite<4>(p).last().id = phases.get(j).template getProp<2>(q);
                        phases.get(j).template getPropWrite<4>(q).last().id = phases.get(i).template getProp<2>(p);
                    }
 
                    ++Np;
                }
 
                ++p_it2;
            }
        }
    }
 
    for (size_t i = 0 ; i < phases.size() ; i++)
    {
        phases.get(i).template ghost_put<add_,1>();
        phases.get(i).template ghost_put<merge_,4>();
    }
 
    auto p_it3 = vd.getDomainIterator();
 
    bool ret = true;
    while (p_it3.isNext())
    {
        auto p = p_it3.get();
 
        int ph;
 
        if (p.getKey() % 4 == 0)
        {ph = 0;}
        else if (p.getKey() % 4 == 1)
        {ph = 1;}
        else if (p.getKey() % 4 == 2)
        {ph = 2;}
        else
        {ph = 3;}
 
        size_t pah = p.getKey()/4;
        ret &= phases.get(ph).template getPropRead<1>(pah) == vd.template getPropRead<0>(p);
 
        vd.template getPropWrite<3>(p).sort();
        phases.get(ph).template getPropWrite<4>(pah).sort();
 
        ret &= vd.template getPropRead<3>(p).size() == phases.get(ph).template getPropRead<4>(pah).size();
 
        for (size_t i = 0 ; i < vd.template getPropRead<3>(p).size() ; i++)
            ret &= vd.template getPropRead<3>(p).get(i).id == phases.get(ph).template getPropRead<4>(pah).get(i).id;
 
        if (ret == false)
        {
            std::cout << "Error on particle: " << vd.template getPropRead<2>(p) << "   " << v_cl.rank() << std::endl;
 
            std::cout << vd.template getPropRead<3>(p).size() << "   " << phases.get(ph).template getPropRead<4>(pah).size() << "  " << v_cl.rank() << std::endl;
 
            for (size_t i = 0 ; i < vd.template getPropRead<3>(p).size() ; i++)
                std::cout << vd.template getPropRead<3>(p).get(i).id << "    " << phases.get(ph).template getPropRead<4>(pah).get(i).id << "  " << v_cl.rank() << std::endl;
 
            std::cout << phases.get(ph).template getPropRead<1>(pah) << "  A  " << vd.template getPropRead<0>(p) << std::endl;
 
            break;
        }
 
        ++p_it3;
    }
 
    BOOST_REQUIRE_EQUAL(ret,true);
}
 
BOOST_AUTO_TEST_CASE( vector_dist_particle_NN_MP_iteration )
{
    typedef  aggregate<size_t,size_t,size_t,openfpm::vector<point_and_gid>,openfpm::vector<point_and_gid>> part_prop;
 
    test_vector_dist_particle_NN_MP_iteration<vector_dist<3,float, part_prop >>();
}
 
BOOST_AUTO_TEST_SUITE_END()