graph::_EmptyEdgeContent | Empty class used as default for edge content |
graph::Arc< EdgeContent > | Type of a undirected edge (or arc) |
util::Shapes::BSplineSurface | Class describing a bspline surface |
util::Buffer< T, size > | A ranged checked array |
algorithms::TriangleSurface::Cell | Type of a cell, i.e |
tissue::CellPinchingParams | Parameters of the cell pinching algorithm |
cell_system::CellSystem< Complex, MyModel > | Full cell-system model |
cell_system::CellSystemCell | Content of a vertex for the 2D cell system |
cell_system::CellSystemDivisionParams | Parameters for cell-system division |
cell_system::CellSystemJunction | Content of a vertex for the 2D cell system |
util::CircIterator< ForwardIterator > | Creates a circular iterator from a range of forward iterators |
tissue::ClosestMidAlgoParams | Parameters for the closest mid |
tissue::ClosestWallAlgoParams | Parameters for the closest wall algorithm |
util::Color< T > | A utility class to encapsulate color data |
bspline_tissue_model::TissueModel< RealModel, TissueClass >::CompareSize | Operator class to compare the size of cells |
tissue_model::TissueModel< RealModel, TissueClass >::CompareSize | Operator class to compare the size of cells |
util::Contour | Contour utility class |
storage::ConvertType< From, To > | Convert object of type from to object of type to |
graph::CountedContent< Content > | Type of the reference counted content |
util::CrossProductType< 2, T > | For 2d -> a scalar |
util::CrossProductType< 3, T > | For 3d -> a vector |
util::GraphInset::Data | Data structure used to store the time stamped values |
vvcomplex::VVComplexGraph< CellContent, JunctionContent, CellJunctionContent, JunctionCellContent, compact >::division_result_t | Describe the result of a cell division |
vvcomplex::DivisionData< JunctionContent > | Class holding the data needed to actually divide a cell |
cell_system::DivisionParams | Structure storing the right hand side of a division rule |
graph::Edge< EdgeContent > | Edge of a vv graph |
util::FileObject | This class is the base class for any object that might be watched by the WatchDog |
storage::Frame | Data holding properties of a frame |
util::Function | A utility class for functions |
util::GraphInset | Class used to draw a graph of time stamped data in the model window |
complex_factory::HexFiller< Complex, Model > | For internal use only! |
vvcomplex::InModelDivisionParam | Class used to define the division parameters from within the model class |
algorithms::Insert< vvgraph, do_checks > | Insert a new vertex on an edge |
util::KeyFramer | Class describing the evolution of a bspline surface through time |
util::Materials::Material | The material data structure |
util::Materials | A utility class for materials |
util::Matrix< nRows, nCols, T > | Class representing a fixed-size matrix |
Model | Simulation class |
graph::VVGraph< VertexContent, EdgeContent, compact >::neighbor_t | Structure maintaining the data for a single neighbor |
complex_factory::ObjReaderError | Error object returned by the complex_factory::objreader functions |
util::Palette | A utility class for palettes |
ParallelControler | This class is used to control how many threads are used for parallel processing |
util::Parms | A utility class to parse L-Studio like parameter files |
util::Point< T > | A 3D point/vector class |
algorithms::TriangleSurface::Position | Structure describing the position of a point on a triangulated surface, relatively to this surface |
geometry::Quaternion | Implements the quaternion operations |
util::range< Iterator > | Class representing a range of values from two iterators |
util::refpair< T, U > | Class used to hold references for the util::tie() function |
graph::VVGraph< VertexContent, EdgeContent, compact >::search_result_t< Neighborhood, Iterator > | Type of the result of the search for a vertex in a neighborhood |
graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::search_result_t< Neighborhood, Iterator > | Type of the result of the search for a vertex in a neighborhood |
util::SelectMemberIterator< Iterator, T, member, Reference, Pointer > | Iterate over a container of structure, dereferencing only a member of it |
util::set_vector< T, Equal, Alloc > | Define a class using (small) vectors as unordered sets |
tissue::ShortWallAlgoParams | Parameters for the shortest wall algorithm |
graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact >::single_neighborhood_t< VertexSrcContent, VertexTgtContent, EdgeSrcContent > | Type of the neighborhood of a vertex |
graph::VVGraph< VertexContent, EdgeContent, compact >::single_neighborhood_t | Type of the neighborhood of a vertex |
solver::Solver< nb_vars, identifier > | Implement a set of solvers for ODE on a graph |
complex_factory::SquareFiller< Complex, Model > | For internal use only! |
util::Tensor< T > | A growth tensor class |
util::Texture1D | A utility class for one-dimensional textures |
util::Texture2D | A utility class for two-dimensional textures |
parallel::ThreadEval | Base class for function evaluated in a thread |
tissue::Tissue< Model, CellContent, JunctionContent, WallContent, CellEdgeContent, CellJunctionContent, JunctionCellContent, compact, LeafClass > | Class handling the development and representation of a cell tissue |
tissue_model::TissueModel< RealModel, TissueClass > | Base class for the tissue_model helper |
bspline_tissue_model::TissueModel< RealModel, TissueClass > | Base class for the bspline tissue model helper |
algorithms::TriangleGrowth | Growth description using a set of triangles moving |
algorithms::TriangleSurface | Class representing a triangulated surface |
storage::TypeTraits< T > | Defines main traits for types directly handled |
util::Vector< dim, T > | Vector class supporting all classic classic vector operations |
algorithms::TriangleSurface::Vertex | Type of a vertex, i.e |
graph::Vertex< VertexContent > | Vertex of a vv graph |
Viewer | Viewer widget |
graph::VVBiGraph< Vertex1Content, Vertex2Content, Edge1Content, Edge2Content_, compact > | Class representing a VV graph |
vvcomplex::VVComplex< Model, CellContent, JunctionContent, WallContent, CellEdgeContent, CellJunctionContent, JunctionCellContent, compact, LeafClass > | Class handling the representation and development of 2D cell complex |
vvcomplex::VVComplexGraph< CellContent, JunctionContent, CellJunctionContent, JunctionCellContent, compact > | Definition of the bipartite graph with specialized methods for the complex graph |
storage::VVEStorage | Abstract base class defining the interactions with the persistence module |
storage::old::VVEStorage_BINReader | Implementation reading an BIN file |
storage::VVEStorage_BINReader | Implementation reading an BIN file |
storage::VVEStorage_BINWriter | Implementation writing an BIN file |
storage::VVEStorage_XMLReader | Implementation reading an XML file |
storage::VVEStorage_XMLWriter | Implementation writing an XML file |
graph::VVGraph< VertexContent, EdgeContent, compact > | Class representing a VV graph |
util::WatchDog | Watch the modifications of file objects for you |
graph::WeakVertex< VertexContent > | Weak pointer on a vertex |