CatalogueChainMesh.h

Go to the documentation of this file.

/********************************************************************
 *  Copyright (C) 2010 by Federico Marulli                          *
 *  federico.marulli3@unibo.it                                      *
 *                                                                  *
 *  This program is free software; you can redistribute it and/or   *
 *  modify it under the terms of the GNU General Public License as  *
 *  published by the Free Software Foundation; either version 2 of  *
 *  the License, or (at your option) any later version.             *
 *                                                                  *
 *  This program is distributed in the hope that it will be useful, *
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of  *
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the   *
 *  GNU General Public License for more details.                    *
 *                                                                  *
 *  You should have received a copy of the GNU General Public       *
 *  License along with this program; if not, write to the Free      *
 *  Software Foundation, Inc.,                                      *
 *  59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.       *
 ********************************************************************/
 
#include "Catalogue.h"
 
#ifndef __CATALOGUECHAINMESH__
#define __CATALOGUECHAINMESH__
 
namespace cbl {
 
  namespace catalogue {
    
    class CatalogueChainMesh : public Catalogue {
 
    private :
 
      // size of cells in CatalogueChainMesh
      double m_cellsize;
 
      std::vector<std::vector<double>> m_lim;
 
      std::shared_ptr<cbl::catalogue::Catalogue> m_part_catalogue;
 
      std::shared_ptr<cbl::catalogue::Catalogue> m_part_catalogue2={};   
 
      unsigned int m_dimension;
 
    public :
      CatalogueChainMesh () = default;
 
      CatalogueChainMesh (const CatalogueChainMesh& obj) : Catalogue (obj) {
        m_cellsize = obj.m_cellsize;
        m_lim = obj.m_lim;
        m_part_catalogue = obj.m_part_catalogue;
        m_part_catalogue2 = obj.m_part_catalogue2;
        m_dimension = obj.m_dimension;
      };
 
      CatalogueChainMesh (CatalogueChainMesh&& obj) : Catalogue (obj) {
        m_cellsize = std::move(obj.m_cellsize);
        m_lim = std::move(obj.m_lim);
        m_part_catalogue = std::move(obj.m_part_catalogue);
        m_part_catalogue2 = std::move(obj.m_part_catalogue2);
        m_dimension = std::move(obj.m_dimension);
      };
 
      CatalogueChainMesh& operator=(const CatalogueChainMesh& obj) 
      {
        Catalogue::operator=(obj);
        m_cellsize = obj.m_cellsize;
        m_lim = obj.m_lim;
        m_part_catalogue = obj.m_part_catalogue;
        m_part_catalogue2 = obj.m_part_catalogue2;
        m_dimension = obj.m_dimension;
        return *this;
      }
 
      CatalogueChainMesh& operator=(CatalogueChainMesh&& obj) noexcept
      { 
        if (this == &obj) return *this;
        Catalogue::operator=(obj);
        m_cellsize = std::move(obj.m_cellsize);
        m_lim = std::move(obj.m_lim);
        m_part_catalogue = std::move(obj.m_part_catalogue);
        m_part_catalogue2 = std::move(obj.m_part_catalogue2);
        m_dimension = std::move(obj.m_dimension);
        return *this;
      } 
 
      ~CatalogueChainMesh () = default;
 
      CatalogueChainMesh (std::vector<catalogue::Var> variables, double cellsize, std::shared_ptr<cbl::catalogue::Catalogue> cat, std::shared_ptr<cbl::catalogue::Catalogue> cat2={});
    
 
 
 
      std::vector<unsigned int> Closer_object (const std::vector<double> pos); 
 
      std::vector<unsigned int> Close_objects (const std::vector<double> pos, const double rMax, const double rMin=0.); 
 
      unsigned int Count_objects (const std::vector<double> pos, const double rMax, const double rMin=0.); 
 
      std::vector<unsigned int> N_nearest_objects (const std::vector<double> pos, const unsigned int N);
 
      std::vector<unsigned int> N_nearest_objects (const unsigned int obj, const unsigned int N);
 
      std::vector<std::vector<unsigned int>> N_nearest_objects_cat (const unsigned int N); 
 
 
      void deletePart (const unsigned int index);
 
      void deletePart (const unsigned int i, const unsigned int p);
 
 
      double cellsize() const { return m_cellsize; }
 
      std::vector<std::vector<double>> lim() const {return m_lim; }
 
      unsigned int dimension() const {return m_dimension; }
 
        };
    }
}
 
#endif