Cell.h

Go to the documentation of this file.

#ifndef CELL_H_INCLUDED
#define CELL_H_INCLUDED
/*
 * Copyright 2011-2016 Universiteit Antwerpen
 *
 * Licensed under the EUPL, Version 1.1 or  as soon they will be approved by
 * the European Commission - subsequent versions of the EUPL (the "Licence");
 * You may not use this work except in compliance with the Licence.
 * You may obtain a copy of the Licence at: http://ec.europa.eu/idabc/eupl5
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the Licence is distributed on an "AS IS" basis,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the Licence for the specific language governing
 * permissions and limitations under the Licence.
 */
#include "CellAttributes.h"
#include "GeoData.h"
#include "util/container/SegmentedVector.h"

#include <boost/property_tree/ptree.hpp>
#include <array>
#include <list>
#include <memory>
#include <vector>

namespace SimPT_Editor {
        class EditableMesh;
}

namespace SimPT_Sim {

using boost::property_tree::ptree;
class Edge;
class Mesh;
class Node;
class Wall;

class Cell: public CellAttributes
{
public:
        virtual ~Cell() {}

        void AddWall(Wall* w);

        ptree GeometryToPtree() const;

        double GetArea() const;

        double GetSignedArea() const;

        std::array<double, 3> GetCentroid() const;

        double GetCircumference() const;

        GeoData GetGeoData() const;

        int GetIndex() const { return m_index; }

        const std::vector<Node*>& GetNodes() const { return m_nodes; }

        std::vector<Node*>& GetNodes() { return m_nodes; }

        double GetSumTransporters(unsigned int ch) const;

        const std::list<Wall*>& GetWalls() const { return m_walls; }

        std::list<Wall*>& GetWalls() { return m_walls; }

        bool HasEdge(const Edge& edge) const;

        bool HasBoundaryWall() const;

        bool HasNeighborOfTypeZero() const;

        bool IsBoundaryPolygon() const { return m_index == -1; }

        bool IsWallNeighbor(Cell* cell) const;

        //bool IsWallNeighbor(Cell* cell) const { return IsWallNeighbor(cell); }

        void Move(const std::array<double, 3>& a);

        bool MoveSelfIntersects(Node* moving_node, std::array<double, 3> new_pos);

        virtual std::ostream& Print(std::ostream& os) const;

        virtual void ReadPtree(const ptree& cell_pt);

        void ReassignWall(Wall* w, Cell* to);

        void SetGeoDirty();

        void SetTransporters(unsigned int chem, double conc);

        void SetTransporters(unsigned int chem, double conc, double lat);

        void SetTransportersLight(unsigned int chem, double conc, double lat);


        virtual ptree ToPtree() const;

private:
        friend class Mesh;
        template<typename T, size_t N>
        friend class SimPT_Sim::Container::SegmentedVector;
        friend class SimPT_Editor::EditableMesh;

private:
        Cell(int index, unsigned int chem_count);      
        Cell(const Cell& src) = delete;                
        Cell& operator=(const Cell& src) = delete;     

private:
        void CalculateArea() const;

        void CalculateCentroid() const;

        void CalculateGeoData() const;

private:
        int                    m_index;
        std::vector<Node*>     m_nodes;
        std::list<Wall*>       m_walls;

private:
        mutable bool           m_dirty_area;
        mutable bool           m_dirty_centroid;
        mutable bool           m_dirty_geo_data;
        mutable GeoData        m_geo_data;
};

std::ostream& operator<<(std::ostream& os, Cell const& v);

} // namespace

#endif // end_of_include_guard