Namespaces | |
| namespace | numeric_types |
| namespace | algebraic_operators |
| namespace | assignment_operators |
| namespace | heterogeneous_list |
| namespace | relational_operators |
| namespace | sequence |
| namespace | algebraic_operators_with_scalars_on_arrays |
| namespace | binary_algebraic_operators_on_arrays |
| namespace | geometric_shapes |
| namespace | vcg |
| namespace | archetype_0D |
| Support for 0-dimensional archetypes. | |
| namespace | type_tags |
| Tags for differentiating between fixed and variable dimensions. | |
| namespace | generic_edge |
| enclosing namespace for generic edge components | |
| namespace | generic_facet |
| enclosing namespace for generic facet components | |
| namespace | connected_components |
| Tools for handling connected components of grids. | |
| namespace | cut_grid_view |
| A view to a grid with some components cut off. | |
| namespace | disjoint_union_view |
| enlosing namespace for disjoint_union_view | |
| namespace | extrusion_view |
| Extrusion of a 2D triangular grid. | |
| namespace | restricted_grid_component_view |
| Provide a view on a connected grid part defined by a predicate. | |
| namespace | restricted_grid_view |
| Provide a view on a grid part defined by a cell predicate. | |
| namespace | shrink_grid_view |
| An ``exploded'' view of a grid. | |
Classes | |
| class | checked_istream |
| class | io_context |
| struct | copy_traits_base |
| struct | copy_traits |
| class | guard |
| class | observer |
| class | notifier |
| class | temporary |
| class | ref_ptr |
| class | copy_on_write_ptr |
| class | file_interactive |
| class | selective_ostream |
| struct | type_name_traits |
| struct | type_name_traits< bool > |
| struct | type_name_traits< int > |
| struct | type_name_traits< unsigned > |
| struct | type_name_traits< short > |
| struct | type_name_traits< long > |
| struct | type_name_traits< char > |
| struct | type_name_traits< float > |
| struct | type_name_traits< double > |
| struct | type_name_traits< std::string > |
| class | back_pusher |
| struct | fail_if_undefined |
| struct | identity_if_undefined |
| class | printer_of_bij_mapping |
| class | bijective_mapping |
| class | inverse_mapping |
| class | domain_of_bijective_mapping |
| class | range_of_bijective_mapping |
| class | bivector |
| class | ValueMask |
| class | counting_output_iterator |
| class | dummy_container |
| class | dummy_mapping |
| class | unary_fct_ref |
| class | unary_map_composition |
| class | constant |
| class | map_is_equal |
| class | and_pred |
| class | or_pred |
| class | not_pred |
| class | histogram_table |
| class | index_map_nd |
| class | integer_iterator |
| struct | get_first |
| struct | get_second |
| class | mapped_value_const_iterator |
| class | mapped_value_iterator |
| class | partial_mapping |
| class | write_only_proxy |
| class | quantization |
| struct | iter_range |
| class | sequence_io_helper |
| class | is_element_of_pred |
| class | set_traits |
| class | tuple |
| struct | use_componentwise_operations< tuple< T, N > > |
| class | union_find |
| struct | xnumeric_limits |
| class | affine_mapping |
| struct | algebraic_primitives |
| struct | use_componentwise_operations |
| struct | use_componentwise_operations_with_scalar |
| struct | use_algebraic_array_operators |
| struct | use_array_operator_plus |
| struct | use_array_operator_minus |
| struct | use_scalar_mult_from_right |
| struct | use_scalar_mult_from_left |
| struct | use_scalar_division |
| struct | clamper |
| struct | basic_algebraic_primitives |
| class | box |
| class | coordN |
| class | space_point |
| class | segment |
| class | triangle |
| class | tetrahedron |
| class | ray |
| class | line |
| class | hyper_plane |
| class | intersection_segment_triangle |
| class | intersection_ray_triangle |
| class | line_projector |
| class | polytope_directions_base |
| class | polytope_directions |
| class | polytope_directions< space_point< P > > |
| class | polytope_directions< segment< P > > |
| class | polytope_directions< triangle< P > > |
| class | polytope_directions< tetrahedron< P > > |
| class | intersection_by_separating_axes |
| class | interval |
| struct | matrix_traits |
| class | matrix |
| struct | matrix_traits_matrixNMOFF |
| class | piecewise_function |
| class | piecewise_linear_function |
| struct | point_traits |
| struct | scalar_point_traits |
| struct | array_operators |
| struct | point_traits_builtin_base |
| class | convert_scalar |
| class | polynomial |
| struct | dimension_dependent_primitives_2d |
| struct | dimension_dependent_primitives_3d |
| struct | real_type |
| struct | test_algebraic_primitives |
| class | BoundaryRange< Complex3D > |
| struct | grid_types< BoundaryRange< Complex3D > > |
| struct | grid_types_Complex3D_base |
| class | Complex3D |
| struct | grid_types< Complex3D > |
| class | grid_function< Vertex_Complex3D, T > |
| class | grid_function< Cell_Complex3D, T > |
| class | grid_function< Complex3D::Edge, T > |
| class | grid_function< Complex3D::Facet, T > |
| class | BoundaryRange< Complex2D > |
| struct | grid_types< BoundaryRange< Complex2D > > |
| class | Complex2D |
| struct | grid_types< Complex2D > |
| class | custom_grids |
| class | grid_function< Vertex2D, T > |
| class | grid_function< Cell2D, T > |
| class | grid_function< Edge2D, T > |
| struct | stored_geometry_complex2D |
| class | TestComplex2D |
| class | BoundaryRange< cartesian2d::RegGrid2D > |
| struct | grid_types< BoundaryRange< cartesian2d::RegGrid2D > > |
| struct | grid_types< cartesian2d::RegGrid2D > |
| class | grid_function< cartesian2d::RegGrid2D::Vertex, T > |
| class | grid_function< cartesian2d::RegGrid2D::Edge, T > |
| class | grid_function< cartesian2d::RegGrid2D::Cell, T > |
| class | xmjr_indexmap2D |
| struct | grid_types< cartesian2d::SubrangeReg2D > |
| class | grid_function< Triang2D_Vertex, T > |
| class | grid_function< Triang2D_Cell, T > |
| class | grid_function< Triang2D::Edge, T > |
| class | stored_geometry_triang2d |
| class | Triang2D |
| struct | incidence_hull_cfg |
| Default config class for incidence_hull. More... | |
| class | incidence_hull |
| Calculate incidence hull. More... | |
| class | incidence_stencil |
| Representation of incidence stencils. More... | |
| class | archetype_geometry |
| Geometry to provide local coordinates for an archetype. More... | |
| class | archetype_map |
| Mapping between the archetypes of two grids. More... | |
| class | archetypes_from_base |
| Helper class to reuse the archetype functionality of a base grid. More... | |
| struct | archetypes_from_base_grid_types |
| Helper class to reuse the archetype definitions of base grid types. More... | |
| class | BoundaryRange |
| A reference to the combinatorial boundary of a grid. More... | |
| class | cell_iterator_int |
| Generic cell / cell iterator type, based on cells being numbered consecutively starting from 0. More... | |
| struct | vertex_handle_int |
| Integer based vertex handle. More... | |
| struct | edge_handle_int |
| Integer based edge handle. More... | |
| struct | face_handle_int |
| Integer based face handle. More... | |
| struct | facet_handle_int |
| Integer based facet handle. More... | |
| struct | cell_handle_int |
| Integer based cell handle. More... | |
| class | element_numbering |
| Provide a consecutive numbering of grid elements. More... | |
| class | vertex_seq_ref |
| View of a grid as sequence of vertices. More... | |
| class | edge_seq_ref |
| View of a grid as sequence of edges. More... | |
| class | cell_seq_ref |
| View of a grid as sequence of cells. More... | |
| class | vertex_set_of_facets_iterator |
| Iterator over the vertex set of a set of grid facets.
This is a "fat" iterator due to the table keeping track of already visited vertices, so either we must be careful with copying or there should be some shallow copy semantics (copy-on-write ?). More... | |
| class | vertex_set_of_facets |
| View to the vertex set of a set of grid facets.
The main work is done by vertex_set_of_facets_iterator. More... | |
| class | vertex_set_of_cells_iterator |
| Iterator over the vertex set of a set of grid cells.
This is a "fat" iterator due to the table keeping track of already visited vertices, so either we must be careful with copying or there should be some shallow copy semantics (copy-on-write ?). More... | |
| class | vertex_set_of_cells |
| View to the vertex set of a set of grid cells
The main work is done by vertex_set_of_cells_iterator. More... | |
| class | facet_span_of_vertices_iterator |
| Iterator over facets incident to a set of grid vertices Model of More... | |
| class | facet_span_of_vertices |
| View of range of facets incident to a set of grid vertices
A view of type facets_span_of_vertices contains all facets incident to a cell incident to a vertex of the underlying vertex range. More... | |
| struct | element_traits |
| Primary template to be specialized. More... | |
| struct | non_consecutive_tag |
| Tag for providing info on numbering of elements. More... | |
| struct | consecutive_integer_tag |
| Tag for providing info on numbering of elements. More... | |
| struct | element_traits_vertex_base |
basic definition to derive from for actual specializations of element_traits for vertex types More... | |
| struct | element_traits_edge_base |
basic definition to derive from for actual specializations of element_traits for edge types More... | |
| struct | element_traits_face_base |
basic definition to derive from for actual specializations of element_traits for face types More... | |
| struct | element_traits_facet_base |
basic definition to derive from for actual specializations of element_trait for facet types More... | |
| struct | element_traits_cell_base |
basic definition to derive from for actual specializations of element_traits for cell types More... | |
| struct | element_traits_base |
| Dispatching elements to basic predefined traits. More... | |
| struct | xgt |
factory for type-wise changes to a grid_types specialization. More... | |
| class | facet_handle_corr |
| Mapping of facet handle of a source grid to that of a target grid. More... | |
| struct | facet_handle |
| A generic facet handle. More... | |
| class | facet_on_cell_function |
| Associate data which each cell-facet incidence. More... | |
| class | flag |
| Representation of a flag (tuple of incident elements, one of each dimension). More... | |
| class | gf_const_iterator |
| Iterator for a grid function via the element iterator of the underlying grid. More... | |
| struct | point_traits< gf_array_adapter::value_type< T, N > > |
| specialization of point_traits<> More... | |
| struct | point_traits< gf_array_adapter::value_proxy< T, N > > |
| class | grid_function_array_adapter |
| Adapter for plain arrays to grid function interface
The array is assumed to have the following layout: | |
| class | grid_function_hash_base |
| Implements a grid_function on hash-basis.
This can be used if arrays are not possible, or for partial grid functions. More... | |
| class | grid_function_hash |
| Implements a total grid_function on hash-basis.
Model of TotalGridFunction. More... | |
| class | grid_function_vector |
| Implements a grid_function on vector-basis.
Model of TotalGridFunction. More... | |
| class | grid_function |
| empty template for total grid functions.
This template has to be specialized for concrete types of grid elements E. For example, E = Complex2D::Vertex , E = RegGrid2D::Edge, ... T is a user-selected type More... | |
| struct | cell2handle_map |
| Map cells to their handles
Model of Adaptable Unary Function Cell -> handle. More... | |
| struct | handle2cell_map |
| Map handles to corresponding cells
Model of Adaptable Unary Function handle -> Cell. More... | |
| struct | vertex2handle_map |
| Map vertices to their handles
Model of Adaptable Unary Function vertex -> handle. More... | |
| struct | handle2vertex_map |
| Map handles to corresponding vertices
Model of Adaptable Unary Function handle -> Vertex. More... | |
| struct | element2handle_map |
| Map elements to their handles
Model of Adaptable Unary Function Element -> handle | |
| struct | handle2element_map |
| Map handles to corresponding elements
Model of Adaptable Unary Function handle -> Element | |
| class | iscellinside_pred |
| Predicate returning true iff a Cell is not an `outer' cell
An outer cell is an artificial cell denoting the outside of a grid. For each valid cell c of a grid, F(c) is true. More... | |
| class | isonboundary_pred |
| Predicate returning true iff a Edge/Facet is on the boundary. More... | |
| class | cell_nb_degree |
| Functor giving number of neighbors of a Cell. More... | |
| class | cell_vtx_degree |
| Functor giving number of vertices of a Cell. More... | |
| class | cell_is_nb_pred |
| Predicate returning true iff two cells are neighbors Template parameters:
| |
| class | vertex_morphism |
| Grid vertex isomorphism. More... | |
| class | cell_morphism |
| Grid cell isomorphism. More... | |
| class | element_morphism |
| Grid element morphism. More... | |
| struct | grid_types |
| Empty traits class for parameterized namespaces associated with a grid.
This has to be specialized for concrete grid types. More... | |
| struct | grid_types_base |
| Plugin-in base class for grid_types<> specializations. More... | |
| struct | iterator |
Meta-function returning iterator with anchor A and value E. More... | |
| struct | iterator_d |
Type map of iterator with anchor A and value of dimension D. More... | |
| struct | iterator_cd |
Type map of iterator with anchor A and value of codimension CD. More... | |
| struct | map_element_iter_name |
| Map generic names like 'ElementIterator' to specific ones like 'CellIterator'. More... | |
| struct | map_element_iter_name< EIt, ER, cell_type_tag > |
| Specialization for cell types. More... | |
| class | mapped_grid_function |
| View to a value-mapped grid function. More... | |
| class | mapped_element_ra_seq_iterator |
| Maps STL-style random-access iterator (range [b,e) pairs) to IsDone()-style iterator. More... | |
| class | mapped_element_seq_iterator |
| Maps STL-style Forward Iterator (range [b,e) pairs) to IsDone()-style iterator. More... | |
| class | mapped_element_iterator |
| Maps IsDone()-style iterators by composing with function object. More... | |
| class | mapped_cell_sequence |
| A cell sequence defined by another cell sequence and a mapping. More... | |
| class | multi_grid_function |
Total grid function defined on all element types of Grid.
multi_grid_function<Grid,T> defines a mapping | |
| class | partial_grid_function |
| Implements a partial grid function using hash tables. More... | |
| class | partial_grid_morphism |
| Partial morphism of grids. More... | |
| class | partial_multi_grid_function |
| Partial grid function defined on all element types of <Grid>.
partial_multi_grid_function<Grid,T> defines a mapping | |
| struct | incidence |
| Map element types pairs to corresponding incidence iterator types. More... | |
| struct | VertexOn |
| Meta-function to get VertexOn<E> incidence iterator. More... | |
| class | restricted_grid_function_adapter |
| Restricts a grid function of type GF to the range of an element-iterator
For example, a grid function may be the ElementIterator of a subrange. There is no copying involved, this class has reference semantics with respect to the underlying grid function. More... | |
| class | grid_function_view |
| Wrapper for grid functions of base grid. More... | |
| class | tp |
| workaround for missing explicit specialization of function template arguments. More... | |
| class | vertex_type_tag |
| Type tag for vertices. More... | |
| struct | int2element_tag |
| Map dimensions to element tags. More... | |
| struct | element_dim_tag |
| Combinatorial element dimension. More... | |
| struct | element_codim_tag |
| Combinatorial element co-dimension. More... | |
| struct | grid_dim_tag |
| Combinatorial grid dimension. More... | |
| struct | fixity |
| Meta-function for returning the fixity type of grid dimension. More... | |
| struct | grid_element_category |
| Element category. More... | |
| struct | grid_range_category |
| Range category. More... | |
| class | vertex_iterator_int |
| class | vertex_set |
| sorted vertex set of a grid element More... | |
| class | general_vertex_set |
| sorted general vertex subset of a grid More... | |
| struct | vtuple_2d |
| [OBSOLETE] Vertex set of a facet with comparision and hashing
This is to be replacet by vertex_set (which has to be optimized for the 2D case, especially the hash function) More... | |
| class | wrapped_element |
| A type wrapper for a grid element. More... | |
| class | wrapped_incidence_iterator |
| A type wrapper for a grid incidence iterator. More... | |
| class | wrapped_sequence_iterator |
| A type wrapper for a grid sequence iterator. More... | |
| struct | wrap_all_element_types_aux |
| Convenience class to wrap all undefined element types. More... | |
| struct | wrap_all_downward_incidence_iterator_types_dim |
| Convenience class to lift all incidence iterator types of base grid. More... | |
| class | cell_as_volume |
| View a cell as spatial volume. More... | |
| class | cell_is_contained |
| Predicate to (approximately) decide whether a cell is contained a geometric body (volume) or not. More... | |
| class | cell_intersects |
| Predicate to decide whether a cell intersects a geometric body (volume) or not. More... | |
| class | dummy_geometry |
| Dummy geometry for places where one is formally required. More... | |
| class | Segment |
| Geometric segment corresponding to combinatorial edge. More... | |
| class | Polygon2d |
| Geometric polygon corresponding to geometric face. More... | |
| class | polytope |
| Map combinatorial grid elements to geometric entities (polytopes). More... | |
| class | grid_as_volume |
| View to a grid as spatial volume. More... | |
| class | edge_facet_intersection |
| class | point_location_result |
| Result type for point location algorithms. More... | |
| class | solid_angle_plugin_dim< GEOM, GRID, COORD, 2 > |
| Extension of simple_geometry for 3D meshes. More... | |
| class | solid_angle_plugin_dim< GEOM, GRID, COORD, 3 > |
| Extension of simple_geometry for 3D meshes. More... | |
| class | simple_geometry |
| Simple geometry, just storing vertex coordinates. More... | |
| class | transformed_geom |
| Grid geometry transformed by a mapping. More... | |
| class | wrapped_geometry |
| Simple wrapper for a grid geometry and grid view / subrange. More... | |
| class | VertexIterator_istream_complex2d |
| Vertex iterator for IstreamComplex2DFmt_base
Model of VertexIterator. More... | |
| class | CellIterator_istream_complex2d |
| Cell iterator for IstreamComplex2DFmt_base
Model of CellIterator. More... | |
| class | VertexOnCellIterator_istream_complex2d |
| VertexOnCell iterator for IstreamComplex2DFmt_base
Model of Vertex-On-CellIterator. More... | |
| struct | grid_types< IstreamComplex2DFmt_base > |
Specialization of grid_types for IstreamComplex2DFmt_base. More... | |
| class | IstreamComplex2DFmt |
| Input adapter for Complex2D Format. More... | |
| class | IstreamComplex2DCombFmt |
| Input adapter for combinatorial Complex2D Format
This class assumes a modified format without geometry information. Model of Cell-VertexInputGridRange. More... | |
| class | OstreamComplex2DFmt |
| Output adapter for Complex2D file format. More... | |
| struct | grid_types< OstreamComplex2DFmt > |
Specialization of grid_types for OstreamComplex2DFmt. More... | |
| class | stream_grid_mask |
| Grid defined by an integer stream. More... | |
| class | stream_geom_mask |
| Geometry for stream_grid_mask. More... | |
| class | BoundaryComponentIterator2D |
| Iterator visiting vertices and edges of a boundary component of a 2D grid. More... | |
| class | BoundaryComponentVertexIterator2D |
| Iterator visiting the vertices of a boundary component of a 2D grid. More... | |
| class | BoundaryComponentEdgeIterator2D |
| Iterator visiting the edges of a boundary component of a 2D grid. More... | |
| class | cell_on_cell_iterator |
| A generic CellOnCellIterator. More... | |
| class | cell_on_vertex_iterator |
| A generic CellOnVertexIterator. More... | |
| class | closure_iterator |
| Iterator over the k-elements incident to a set of n-elements. More... | |
| class | dummy_element |
| Dummy element
This can be used with generic components formally requiring certain elements which will not be used in the concrete case. More... | |
| class | dummy_sequence_iterator |
| Dummy sequence iterator
This can be used with generic components formally requiring certain iterators which will not be used in the concrete case. More... | |
| class | dummy_incidence_iterator |
| Dummy incidence iterator
This can be used with generic components formally requiring certain iterators which will not be used in the concrete case. More... | |
| class | edge_iterator_of_cell_set |
| Iterator over the edges incident to a set of cells. More... | |
| class | ExtendedCellOnCellIterator |
| An iterator over all cells having at least one common vertex with a given cell. More... | |
| class | IndirectCellOnCellIterator |
| An iterator over all cells having at least one vertex but no facet in common with a given cell. More... | |
| class | facet_iterator_of_cell_set |
| Iterator over the facets of a set of cells. More... | |
| class | FacetIterator |
| A generic iterator over the facets of a grid.
This works by iterating over the cells of the grid and over the facets of the cells, skipping facets that already have been visited from the other side, i.e. the opposite cell. To this end we require the cells to be ordered by a relation < and define that facets will be visited from the smaller cells. More... | |
| class | sequence_iter_base |
| Base class for sequence iterators to help standard conformance. More... | |
| class | incidence_iter_base |
| Base class for incidence iterators to help standard conformance. More... | |
| class | sequence_element_iterator |
| Sequence iterator adaptor for a sequence of element handles. More... | |
| class | single_element_iterator |
| An iterator iterating over a single element. More... | |
| class | vertex_iterator_of_cell_set |
| Iterator over the vertices incident to a set of cells. More... | |
| class | vertex_on_edge_iterator |
| Generic VertexOnEdge Iterator. More... | |
| class | vertex_on_vertex_iterator |
| A generic VertexOnVertexIterator. More... | |
| class | boundary_grid |
| Boundary grid of a grid element.
The grid's and element's dimensions are deduced at compile-time, in order to use the correct specialization of boundary_grid_aux. More... | |
| class | boundary_range_generic |
| Class representing the boundary of a grid. More... | |
| class | boundary_range_nd |
| Generic boundary range for arbitrary grids. More... | |
| class | element_range_ref |
| reference to a (possibly subset of) element range
The dimension of the element remains unspecified. See vertex_range_ref, edge_range_ref, facet_range_ref, cell_range_ref for specializations. More... | |
| class | vertex_range_ref |
| Reference to a (possibly subset of) vertex range. More... | |
| class | edge_range_ref |
| Reference to a (possibly subset of) edge range. More... | |
| class | facet_range_ref |
| Reference to a (possibly subset of) facet range. More... | |
| class | cell_range_ref |
| Reference to a subset of a cell range. More... | |
| class | enumerated_element_range |
| Subrange of a grid element range, defined by listing its members. More... | |
| class | enumerated_vertex_range |
| Vertex subrange of a grid, defined by listing the member vertices. More... | |
| class | enumerated_edge_range |
| Edge subrange of a grid, defined by listing the member edges. More... | |
| class | enumerated_facet_range |
| Facet subrange of a grid, defined by listing the member facets. More... | |
| class | enumerated_cell_range |
| cell subrange of a grid, defined by listing the member cells More... | |
| class | enumerated_subrange_ref |
| A grid subrange view that is a simple enumeration of its elements. More... | |
| struct | grid_types< enumerated_subrange_ref< Grid, GT > > |
| class | enumerated_subrange |
| A grid subrange that is a simple enumeration of its elements. More... | |
| struct | grid_types< enumerated_subrange< Grid, GT > > |
| class | facet_grid |
| View a facet subrange as a d-1 dimensional grid. More... | |
| class | layered_vertex_range |
| Layered vertex range
A layered vertex range gives efficient access to consecutive layers of vertices. More... | |
| class | layered_cell_range |
| Layered cell range. More... | |
| struct | grid_types< restricted_grid_view::grid_view< CFG > > |
| Specialization of grid_types template. More... | |
| class | grid_function< restricted_grid_view::vertex< CFG >, T > |
| Vertex grid function specialization. More... | |
| class | grid_function< restricted_grid_view::cell< CFG >, T > |
| Cell grid function specialization. More... | |
| class | grid_function< shrink_grid_view::cell_iterator< GRID >, T > |
Typedefs | |
| typedef ptrdiff_t | signed_size_t |
|
typedef grid_element_handle_category_d< 0 > | grid_vertex_handle_category |
|
typedef grid_element_handle_category_d< 1 > | grid_edge_handle_category |
|
typedef grid_element_handle_category_d< 2 > | grid_face_handle_category |
|
typedef grid_element_handle_category_cd< 1 > | grid_facet_handle_category |
|
typedef grid_element_handle_category_cd< 0 > | grid_cell_handle_category |
|
typedef grid_element_category_d< 0 > | grid_vertex_category |
|
typedef grid_element_category_d< 1 > | grid_edge_category |
|
typedef grid_element_category_d< 2 > | grid_face_category |
|
typedef grid_element_category_cd< 1 > | grid_facet_category |
|
typedef grid_element_category_cd< 0 > | grid_cell_category |
|
typedef grid_sequence_iterator_category_d< 0 > | grid_vertex_iterator_category |
|
typedef grid_sequence_iterator_category_d< 1 > | grid_edge_iterator_category |
|
typedef grid_sequence_iterator_category_d< 2 > | grid_face_iterator_category |
|
typedef grid_sequence_iterator_category_cd< 1 > | grid_facet_iterator_category |
|
typedef grid_sequence_iterator_category_cd< 0 > | grid_cell_iterator_category |
|
typedef grid_types < archetype_0D::archetype_t > | gt |
| typedef cartesiannd::grid< 2 > | def_grid_type |
| typedef Complex2D | img_grid_type |
| typedef grid_types< def_grid_type > | gt_def |
| typedef grid_types< img_grid_type > | gt_img |
Enumerations | |
| enum | grid_element_tag { vertex_tag, edge_tag, facet_tag, face_tag, cell_tag, invalid_tag } |
Functions | |
| template<class GRID , class GERMS > | |
| void | calculate_vertex_stars (GRID const &G,GERMS &germs) |
| Get a germ flag for the star of each vertex of G. | |
| template<class GRID , class GERMS , class DET > | |
| void | calculate_positive_vertex_stars (GRID const &G,GERMS &germs,DET const &det) |
| Get a germ flag for the star of each vertex of G. | |
| template<class NBF , class CELLSET , class FACETMAP , class CGT > | |
| void | CalculateNeighborCells (NBF &Nb, CELLSET const &cell_set, FACETMAP &facet_map, CGT const &) |
| calculate the neighborhood relationship on a set of cells. | |
| template<class NBF , class CELLSET , class FACETMAP > | |
| void | CalculateNeighborCells (NBF &Nb, CELLSET const &cell_set, FACETMAP &facet_map) |
| convenience wrapper for CalculateNeighborCells | |
| template<class NBF , class CELLSET > | |
| void | CalculateNeighborCells (NBF &Nb, CELLSET const &cell_set) |
| convenience wrapper for CalculateNeighborCells | |
| template<class GRID1 , class GRID2 , class GT1 , class GT2 , class PHI > | |
| bool | construct_isomorphism (GRID1 const &G1, GRID2 const &G2, GT1 gt1, GT2 gt2, PHI &phi) |
| Construct an isomorphism between two grids. | |
| template<class GRID1 , class GRID2 , class PHI > | |
| bool | construct_isomorphism (GRID1 const &G1, GRID2 const &G2, PHI &phi) |
| Convenience wrapper for general construct_isomorphism. | |
| template<class CELL1 , class CELL2 , class GRID1 , class GRID2 , class PHI > | |
| bool | extend_isomorphism (CELL1 const &c1, CELL2 const &c2, GRID1 const &G1, GRID2 const &G2, PHI &phi) |
| Extend a given isomorphism to the whole grid. | |
| template<class G1 , class G2 , class CCorr12 > | |
| void | ConstructCellCorrespondence (G1 const &g1, G2 const &g2, CCorr12 &ccorr) |
| template<class GFsrc , class GFdest , class ElemCorr > | |
| void | copy_grid_function (GFsrc const &src, GFdest &dest, ElemCorr const &src2dest) |
Copy gridfunction src to dest. | |
| template<class GT , class CellIt , class VtxSeq , class EltMarker > | |
| void | mark_vertices_on_cells (CellIt seed, VtxSeq &vertex_seq, EltMarker &visited, int level) |
| template<class GT , class CellIt , class CellSeq , class EltMarker , class CellPred > | |
| void | mark_cells_on_cells (CellIt seed, CellSeq &cell_seq, EltMarker &visited, int level, CellPred inside) |
| template<class GT , class VertexIt , class CellSeq , class EltMarker , class CellPred > | |
| void | mark_cells_on_vertices (VertexIt seed, CellSeq &cell_seq, EltMarker &visited, int level, CellPred inside) |
| template<class GT , class CellIt , class VSeq , class CSeq , class EltMarker , class AdjSeq , class CellPred > | |
| void | mark_on_cells (CellIt seed, VSeq &vertex_seq, CSeq &cell_seq, EltMarker &visited, AdjSeq &adj_queue, int &level, CellPred inside, bool &end) |
| Calculate incidence hull on cell germ set. | |
| template<class GT , class VertexIt , class VSeq , class CSeq , class EltMarker , class AdjSeq , class CellPred > | |
| void | mark_on_vertices (VertexIt seed, VSeq &vertex_seq, CSeq &cell_seq, EltMarker &visited, AdjSeq &adj_queue, int &level, CellPred inside, bool &end) |
| Calculate incidence hull on vertex germ set. | |
| template<class CELL1 , class CELL2 , class GRID1 , class GRID2 , class GT1 , class GT2 , class PHI > | |
| bool | extend_isomorphism (CELL1 const &c1, CELL2 const &c2, GRID1 const &G1, GRID2 const &G2, GT1 gt1, GT2 gt2, PHI &phi) |
| template<class E1_IT , class E2OnE1_IT , class RANGE , class GF_E2 > | |
| void | compute_incidence (RANGE const &R, GF_E2 &e1_of_e2) |
| template<class V , class C > | |
| grid_types< typename element_traits< V >::grid_type > ::Facet | incident_facet (V v, C c) |
| template<class RANGE , class GF_F , class GF_V > | |
| bool | check_manifold_property (RANGE const &R, GF_F &singular_facets, GF_V &isolated_vertices, GF_V &singular_interior_vertices, GF_V &singular_boundary_vertices) |
| Check whether G is a manifold-with-boundary mesh (2D only). | |
| template<class G , class GT > | |
| bool | get_orientation (G const &g, GT &orientation) |
| Determine relative orientation of cells. | |
| template<class G , class C > | |
| bool | fix_orientation (G &g, C guide_cell) |
| Change orientation of cells such that it is consistent. | |
| template<class G > | |
| bool | fix_orientation (G &g) |
| Convenience wrapper for orientation. | |
| template<class ElemIter , class F > | |
| F::result_type | it_range_min (ElemIter e, F f) |
| template<class ElemSet , class F > | |
| F::result_type | range_min (const ElemSet &S, F f) |
| template<class ElemSet , class F > | |
| F::result_type | range_max (const ElemSet &S, F f) |
| template<class ElemSet , class F , class T > | |
| T | range_sum (const ElemSet &S, F f, T &res) |
| template<class GF , class Iterator , class T > | |
| void | range_assign (GF &gf, Iterator e, const T &t) |
| template<class EltIter , class OutputIter > | |
| EltIter | copy_it_range (EltIter src, OutputIter dest) |
| template<class EltIter , class OutputIter , class F > | |
| EltIter | copy_it_range_filter (EltIter src, OutputIter dest, const F &f) |
| template<class EltIter , class OutputIter , class Pred > | |
| EltIter | copy_it_range_if (EltIter src, OutputIter dest, const Pred &p) |
| template<class EltIter , class OutputIter , class Pred , class F > | |
| EltIter | copy_it_range_if_filter (EltIter src, OutputIter dest, const Pred &p, const F &f) |
| template<class V_CORR , class C_CORR > | |
| void | ConstructGrid0 (archetype_0D::archetype_t &dst, archetype_0D::archetype_t const &src, V_CORR &v_corr, C_CORR &c_corr) |
| template<class GT > | |
| bool | operator== (cell_iterator_int< GT > const &lhs, cell_iterator_int< GT > const &rhs) |
| template<class GT > | |
| bool | operator< (cell_iterator_int< GT > const &lhs, cell_iterator_int< GT > const &rhs) |
| template<class GT > | |
| bool | operator!= (cell_iterator_int< GT > const &lhs, cell_iterator_int< GT > const &rhs) |
| template<class GT > | |
| bool | operator> (cell_iterator_int< GT > const &lhs, cell_iterator_int< GT > const &rhs) |
| template<class GT > | |
| bool | operator<= (cell_iterator_int< GT > const &lhs, cell_iterator_int< GT > const &rhs) |
| template<class GT > | |
| bool | operator>= (cell_iterator_int< GT > const &lhs, cell_iterator_int< GT > const &rhs) |
| template<class G_DEST , class G_SRC > | |
| void | ConstructGrid0 (G_DEST &destG, G_SRC const &srcG) |
| template<class G_DEST , class G_SRC , class V_CORR > | |
| void | ConstructGrid0 (G_DEST &destG, G_SRC const &srcG, V_CORR &VertexCorr) |
| template<class G_DEST , class GEOM_DEST , class G_SRC , class GEOM_SRC , class VCORR , class CCORR > | |
| void | ConstructGridVC_generic (G_DEST &G_dest, GEOM_DEST &Geom_dest, G_SRC const &G_src, GEOM_SRC const &Geom_src, VCORR &v_corr, CCORR &c_corr) |
| template<class G_DEST , class GEOM_DEST , class G_SRC , class GEOM_SRC , class VCORR > | |
| void | ConstructGridV (G_DEST &G_dest, GEOM_DEST &Geom_dest, G_SRC const &G_src, GEOM_SRC const &Geom_src, VCORR &v_corr) |
| template<class G_DEST , class GEOM_DEST , class G_SRC , class GEOM_SRC > | |
| void | ConstructGrid (G_DEST &G_dest, GEOM_DEST &Geom_dest, G_SRC const &G_src, GEOM_SRC const &Geom_src) |
| template<class GRID , class element_tag , class GT > | |
| std::istream & | operator>> (std::istream &in, element_handle_int< GRID, element_tag, GT > &h) |
| template<class GRID , class GT > | |
| std::istream & | operator>> (std::istream &in, vertex_handle_int< GRID, GT > &h) |
| template<class GRID , class GT > | |
| std::istream & | operator>> (std::istream &in, edge_handle_int< GRID, GT > &h) |
| template<class GRID , class GT > | |
| std::istream & | operator>> (std::istream &in, face_handle_int< GRID, GT > &h) |
| template<class GRID , class GT > | |
| std::istream & | operator>> (std::istream &in, facet_handle_int< GRID, GT > &h) |
| template<class GRID , class GT > | |
| std::istream & | operator>> (std::istream &in, cell_handle_int< GRID, GT > &h) |
| DEFINE_OVERRIDE (vertex_handle) | |
| DEFINE_OVERRIDE (edge_handle) | |
| DEFINE_OVERRIDE (face_handle) | |
| DEFINE_OVERRIDE (facet_handle) | |
| DEFINE_OVERRIDE (cell_handle) | |
| DEFINE_OVERRIDE (Vertex) | |
| DEFINE_OVERRIDE (Edge) | |
| DEFINE_OVERRIDE (Face) | |
| DEFINE_OVERRIDE (Facet) | |
| DEFINE_OVERRIDE (Cell) | |
| DEFINE_OVERRIDE (VertexIterator) | |
| DEFINE_OVERRIDE (EdgeIterator) | |
| DEFINE_OVERRIDE (FaceIterator) | |
| DEFINE_OVERRIDE (FacetIterator) | |
| DEFINE_OVERRIDE (CellIterator) | |
| DEFINE_OVERRIDE (VertexOnVertexIterator) | |
| DEFINE_OVERRIDE (EdgeOnVertexIterator) | |
| DEFINE_OVERRIDE (FaceOnVertexIterator) | |
| DEFINE_OVERRIDE (FacetOnVertexIterator) | |
| DEFINE_OVERRIDE (CellOnVertexIterator) | |
| DEFINE_OVERRIDE (VertexOnEdgeIterator) | |
| DEFINE_OVERRIDE (FaceOnEdgeIterator) | |
| DEFINE_OVERRIDE (FacetOnEdgeIterator) | |
| DEFINE_OVERRIDE (CellOnEdgeIterator) | |
| DEFINE_OVERRIDE (VertexOnFaceIterator) | |
| DEFINE_OVERRIDE (EdgeOnFaceIterator) | |
| DEFINE_OVERRIDE (CellOnFaceIterator) | |
| DEFINE_OVERRIDE (VertexOnFacetIterator) | |
| DEFINE_OVERRIDE (EdgeOnFacetIterator) | |
| DEFINE_OVERRIDE (CellOnFacetIterator) | |
| DEFINE_OVERRIDE (VertexOnCellIterator) | |
| DEFINE_OVERRIDE (EdgeOnCellIterator) | |
| DEFINE_OVERRIDE (FaceOnCellIterator) | |
| DEFINE_OVERRIDE (FacetOnCellIterator) | |
| DEFINE_OVERRIDE (CellOnCellIterator) | |
| SPEC_XGT (vertex_handle) | |
| SPEC_XGT (edge_handle) | |
| SPEC_XGT (face_handle) | |
| SPEC_XGT (facet_handle) | |
| SPEC_XGT (cell_handle) | |
| SPEC_XGT (Vertex) | |
| SPEC_XGT (Edge) | |
| SPEC_XGT (Face) | |
| SPEC_XGT (Facet) | |
| SPEC_XGT (Cell) | |
| SPEC_XGT (VertexIterator) | |
| SPEC_XGT (EdgeIterator) | |
| SPEC_XGT (FaceIterator) | |
| SPEC_XGT (FacetIterator) | |
| SPEC_XGT (CellIterator) | |
| SPEC_XGT (VertexOnVertexIterator) | |
| SPEC_XGT (EdgeOnVertexIterator) | |
| SPEC_XGT (FaceOnVertexIterator) | |
| SPEC_XGT (FacetOnVertexIterator) | |
| SPEC_XGT (CellOnVertexIterator) | |
| SPEC_XGT (VertexOnEdgeIterator) | |
| SPEC_XGT (FaceOnEdgeIterator) | |
| SPEC_XGT (FacetOnEdgeIterator) | |
| SPEC_XGT (CellOnEdgeIterator) | |
| SPEC_XGT (VertexOnFaceIterator) | |
| SPEC_XGT (EdgeOnFaceIterator) | |
| SPEC_XGT (CellOnFaceIterator) | |
| SPEC_XGT (VertexOnFacetIterator) | |
| SPEC_XGT (EdgeOnFacetIterator) | |
| SPEC_XGT (CellOnFacetIterator) | |
| SPEC_XGT (VertexOnCellIterator) | |
| SPEC_XGT (EdgeOnCellIterator) | |
| SPEC_XGT (FaceOnCellIterator) | |
| SPEC_XGT (FacetOnCellIterator) | |
| SPEC_XGT (CellOnCellIterator) | |
| template<class CHandle > | |
| bool | operator== (facet_handle< CHandle > const &ls, facet_handle< CHandle > const &rs) |
| Equality test. | |
| template<class CHandle > | |
| bool | operator!= (facet_handle< CHandle > const &ls, facet_handle< CHandle > const &rs) |
| template<class CHandle > | |
| bool | operator< (facet_handle< CHandle > const &ls, facet_handle< CHandle > const &rs) |
| Ordering test. | |
| template<class CHandle > | |
| std::ostream & | operator<< (::std::ostream &out, facet_handle< CHandle > const &e) |
| template<class CHandle > | |
| std::istream & | operator>> (::std::istream &in, facet_handle< CHandle > &e) |
| size_t | hash_facet_handle (facet_handle< int > const &h) |
| template<class CellMap > | |
| facet_on_cell_grid_function < CellMap > | MakeFacetOnCellGridFunction (CellMap &cm) |
| template<class G > | |
| iscellinside_pred< G > | IsCellInside (const G &g) |
| Creator function for iscellinside_pred. | |
| template<class Cell > | |
| cell_is_nb_pred< Cell > | IsNeighbourCell (const Cell &rs) |
| Creator function for cell_is_nb_pred. | |
| template<class It > | |
| int | iterator_range_size (It it) |
| Compute the range of a GrAL-iterator. | |
| template<class E , class A > | |
| iterator< E, A >::type | begin (A const &a) |
| Getting the first iterator of an anchor (grid or grid element). | |
| template<class E , class A > | |
| iterator< E, A >::type | end (A const &a) |
| Getting the past-the-end iterator of an anchor (grid or grid element). | |
| template<class E , class A > | |
| grid_types_of< A >::type::size_type | size (A const &a) |
| Getting the size of an element sequence of an anchor (grid or grid element). | |
| template<class GT , class E , class A > | |
| iterator< E, A, GT >::type | begin_gt (A const &a) |
| Getting the first iterator of an anchor (grid or grid element). | |
| template<class GT , class E , class A > | |
| iterator< E, A, GT >::type | end_gt (A const &a) |
| Getting the past-the-end iterator of an anchor (grid or grid element). | |
| template<class GT , class E , class A > | |
| GT::size_type | size_gt (A const &a) |
| Getting the size of an element sequence of an anchor (grid or grid element). | |
| template<class A > | |
| grid_types_detail::begin_iter< A > | begin_x (A const &a) |
| Getting the first iterator of an anchor (grid or grid element). | |
| template<class A > | |
| grid_types_detail::end_iter< A > | end_x (A const &a) |
| Getting the past-the-end iterator of an anchor (grid or grid element). | |
| template<int D, class A > | |
| iterator_d< D, A >::type | begin_d (A const &a) |
| Getting the first iterator of an anchor (grid or grid element). | |
| template<int D, class A > | |
| iterator_d< D, A >::type | end_d (A const &a) |
| Getting the past-the-end iterator of an anchor (grid or grid element). | |
| template<int D, class A > | |
| grid_types_of< A >::type::size_type | size_d (A const &a) |
| Getting the size of an element sequence of an anchor (grid or grid element). | |
| template<int CD, class A > | |
| iterator_cd< CD, A >::type | begin_cd (A const &a) |
| Getting the first iterator of an anchor (grid or grid element). | |
| template<int CD, class A > | |
| iterator_cd< CD, A >::type | end_cd (A const &a) |
| Getting the past-the-end iterator of an anchor (grid or grid element). | |
| template<int CD, class A > | |
| grid_types_of< A >::type::size_type | size_cd (A const &a) |
| Getting the size of an element sequence of an anchor (grid or grid element). | |
| template<class XOnCell > | |
| grid2archetype< typename XOnCell::value_type > ::element_type | archetype_element (XOnCell it) |
| GRAL_DEFINE_ENTITY_FOR_ALL_GRID_TYPES (DEFINE_HAS_MEMBER) | |
| DEFINE_HAS_MEMBER (category) | |
| DEFINE_HAS_MEMBER (uses_root_class) | |
| DEFINE_HAS_MEMBER (grid_type) | |
| DEFINE_HAS_MEMBER (element_type_tag) | |
| DEFINE_HAS_MEMBER (test_type) | |
| DEFINE_HAS_MEMBER (EdgeOnEdgeIterator) | |
| DEFINE_HAS_MEMBER (FaceOnFaceIterator) | |
| DEFINE_HAS_MEMBER (FacetOnFacetIterator) | |
| GRAL_DEFINE_ENTITY_FOR_ALL_GRID_TYPES (DEFINE_GET_MEMBER) | |
| DEFINE_GET_MEMBER (grid_type) | |
| template<class GT , class OSTREAM > | |
| void | checkgt (OSTREAM &out) |
| template<class GT , class OSTREAM > | |
| void | checkgt_terse (OSTREAM &out) |
| GRAL_DEFINE_ENTITY_FOR_ALL_GRID_TYPES (DEFINE_GET_FROM_BASE_GT) | |
| template<class GSRC , class VCORR , class CCORR > | |
| void | ConstructGrid0 (polygon1d::polygon &G_dst, GSRC const &G_src, VCORR &v_corr, CCORR &c_corr) |
| template<class E1 , class E2 > | |
| bool | incident (E1 const &e1, E2 const &e2) |
| Predicate to decide whether two elements are incident. | |
| template<class GF , class E_iter > | |
| bool | operator== (restr_gf_iterator_adapter< GF, E_iter > const &ls, restr_gf_iterator_adapter< GF, E_iter > const &rs) |
| template<class GF , class E_iter > | |
| bool | operator!= (restr_gf_iterator_adapter< GF, E_iter > const &ls, restr_gf_iterator_adapter< GF, E_iter > const &rs) |
| template<class GF , class E_iter > | |
| bool | operator< (restr_gf_iterator_adapter< GF, E_iter > const &ls, restr_gf_iterator_adapter< GF, E_iter > const &rs) |
| template<class GF , class ERange > | |
| restricted_grid_function_adapter < GF, typename ERange::const_iterator > | Restriction (GF &gf, const ERange &R) |
| Creator function for restricted_grid_function_adapter. | |
| template<class VIEW , class GF > | |
| get_grid_function_view< VIEW, GF >::type | make_grid_function_view (VIEW const &g, GF &gf) |
| template<class GT > | |
| bool | operator== (vertex_iterator_int< GT > const &lhs, vertex_iterator_int< GT > const &rhs) |
| template<class GT > | |
| bool | operator< (vertex_iterator_int< GT > const &lhs, vertex_iterator_int< GT > const &rhs) |
| template<class GT > | |
| bool | operator!= (vertex_iterator_int< GT > const &lhs, vertex_iterator_int< GT > const &rhs) |
| template<class GT > | |
| bool | operator> (vertex_iterator_int< GT > const &lhs, vertex_iterator_int< GT > const &rhs) |
| template<class GT > | |
| bool | operator<= (vertex_iterator_int< GT > const &lhs, vertex_iterator_int< GT > const &rhs) |
| template<class GT > | |
| bool | operator>= (vertex_iterator_int< GT > const &lhs, vertex_iterator_int< GT > const &rhs) |
| template<class GRID > | |
| bool | operator< (vtuple_2d< GRID > const &ls, vtuple_2d< GRID > const &rs) |
| template<class GRID > | |
| bool | operator== (vtuple_2d< GRID > const &ls, vtuple_2d< GRID > const &rs) |
| template<class NEW_GRID , class OLD_EH > | |
| std::ostream & | operator<< (std::ostream &out, wrapped_element_handle< NEW_GRID, OLD_EH > h) |
| template<class NEW_GRID , class OLD_EH > | |
| std::istream & | operator>> (std::ostream &in, wrapped_element_handle< NEW_GRID, OLD_EH > &h) |
| DEFINE_WRAP_BASE_ELEM (Vertex, vertex_handle) | |
| DEFINE_WRAP_BASE_ELEM (Edge, edge_handle) | |
| DEFINE_WRAP_BASE_ELEM (Face, face_handle) | |
| DEFINE_WRAP_BASE_ELEM (Facet, facet_handle) | |
| DEFINE_WRAP_BASE_ELEM (Cell, cell_handle) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Vertex, Vertex, vertex_handle, VertexOnVertexIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Vertex, Edge, edge_handle, EdgeOnVertexIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Vertex, Face, face_handle, FaceOnVertexIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Vertex, Facet, facet_handle, FacetOnVertexIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Vertex, Cell, cell_handle, CellOnVertexIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Edge, Vertex, vertex_handle, VertexOnEdgeIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Edge, Face, face_handle, FaceOnEdgeIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Edge, Facet, facet_handle, FacetOnEdgeIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Edge, Cell, cell_handle, CellOnEdgeIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Face, Vertex, vertex_handle, VertexOnFaceIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Face, Edge, edge_handle, EdgeOnFaceIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Face, Facet, facet_handle, FacetOnFaceIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Face, Cell, cell_handle, CellOnFaceIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Facet, Vertex, vertex_handle, VertexOnFacetIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Facet, Edge, edge_handle, EdgeOnFacetIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Facet, Face, face_handle, FaceOnFacetIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Facet, Cell, cell_handle, CellOnFacetIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Cell, Vertex, vertex_handle, VertexOnCellIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Cell, Edge, edge_handle, EdgeOnCellIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Cell, Face, face_handle, FaceOnCellIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Cell, Facet, facet_handle, FacetOnCellIterator) | |
| DEFINE_WRAP_BASE_INCIDENCE_ITERATOR (Cell, Cell, cell_handle, CellOnCellIterator) | |
| template<class GRID , class ANCHOR , class E , class EH , class IT , class GT > | |
| wrapped_incidence_iterator < GRID, ANCHOR, E, EH, IT, GT > | gral_begin (ANCHOR const &a, wrapped_incidence_iterator< GRID, ANCHOR, E, EH, IT, GT >) |
| template<class GRID , class ANCHOR , class E , class EH , class IT , class GT > | |
| wrapped_incidence_iterator < GRID, ANCHOR, E, EH, IT, GT > | gral_end (ANCHOR const &a, wrapped_incidence_iterator< GRID, ANCHOR, E, EH, IT, GT >) |
| template<class GRID , class ANCHOR , class E , class EH , class IT , class GT > | |
| wrapped_incidence_iterator < GRID, ANCHOR, E, EH, IT, GT > ::size_type | gral_size (ANCHOR const &a, wrapped_incidence_iterator< GRID, ANCHOR, E, EH, IT, GT >) |
| template<class GRID , class E , class EH , class IT > | |
| wrapped_sequence_iterator < GRID, E, EH, IT > | gral_begin (GRID const &a, wrapped_sequence_iterator< GRID, E, EH, IT >) |
| template<class GRID , class E , class EH , class IT > | |
| wrapped_sequence_iterator < GRID, E, EH, IT > | gral_end (GRID const &a, wrapped_sequence_iterator< GRID, E, EH, IT >) |
| template<class GRID , class E , class EH , class IT > | |
| wrapped_sequence_iterator < GRID, E, EH, IT >::size_type | gral_size (GRID const &a, wrapped_sequence_iterator< GRID, E, EH, IT >) |
| template<class VERTEXITER , class GEOM > | |
| box< typename GEOM::coord_type > | get_grid_iter_bounding_box (VERTEXITER V, GEOM const &Geom) |
| template<class GRID , class GEOM > | |
| box< typename GEOM::coord_type > | get_grid_bounding_box (GRID const &G, GEOM const &Geom) |
| convenience wrapper for get_grid_iter_bounding_box | |
| template<class CELL , class GEOM > | |
| box< typename GEOM::coord_type > | get_cell_bounding_box (CELL const &C, GEOM const &Geom) |
| Get bounding box of a cell. | |
| template<class Face , class geom > | |
| bool | operator== (vertex_iterator_Polygon2d< Face, geom > const &, vertex_iterator_Polygon2d< Face, geom > const &) |
| template<class Face , class geom > | |
| bool | operator!= (vertex_iterator_Polygon2d< Face, geom > const &, vertex_iterator_Polygon2d< Face, geom > const &) |
| template<class Face , class geom > | |
| bool | operator< (vertex_iterator_Polygon2d< Face, geom > const &, vertex_iterator_Polygon2d< Face, geom > const &) |
| gt::VertexIterator | gral_begin (gt::grid_type const &g, gt::VertexIterator) |
| gt::VertexIterator | gral_end (gt::grid_type const &g, gt::VertexIterator) |
| gt::size_type | gral_size (gt::grid_type const &g, gt::VertexIterator) |
| gt::CellIterator | gral_begin (gt::grid_type const &g, gt::CellIterator) |
| gt::CellIterator | gral_end (gt::grid_type const &g, gt::CellIterator) |
| gt::size_type | gral_size (gt::grid_type const &g, gt::CellIterator) |
| gt::VertexOnCellIterator | gral_begin (gt::CellIterator const &c, gt::VertexOnCellIterator) |
| gt::VertexOnCellIterator | gral_end (gt::CellIterator const &c, gt::VertexOnCellIterator) |
| gt::size_type | gral_size (gt::CellIterator const &c, gt::VertexOnCellIterator) |
| gt::VertexIterator | gral_begin (IstreamComplex2DCombFmt const &g, gt::VertexIterator) |
| gt::VertexIterator | gral_end (IstreamComplex2DCombFmt const &g, gt::VertexIterator) |
| gt::size_type | gral_size (IstreamComplex2DCombFmt const &g, gt::VertexIterator) |
| gt::CellIterator | gral_begin (IstreamComplex2DCombFmt const &g, gt::CellIterator) |
| gt::CellIterator | gral_end (IstreamComplex2DCombFmt const &g, gt::CellIterator) |
| gt::size_type | gral_size (IstreamComplex2DCombFmt const &g, gt::CellIterator) |
| template<class GRID , class VCORR , class CCORR > | |
| void | ConstructGrid0 (OstreamComplex2DFmt &Out, GRID const &G, VCORR &G2Out_v, CCORR &G2Out_c) |
| template<class It > | |
| stream_grid_mask< It > | StreamGridMask (int nv, int nc, It it) |
| Creator function for stream_grid_mask. | |
| template<class It > | |
| stream_grid_mask< It > | StreamGridMask (int nv, int nc, It it, int off) |
| Creator function for stream_grid_mask. | |
| template<class It > | |
| stream_geom_mask< It > | StreamGeomMask (It it) |
| Creator function for stream_geom_mask. | |
| template<class It > | |
| gt::VertexIterator | gral_begin (stream_grid_mask< It > const &g, typename gt::VertexIterator) |
| template<class It > | |
| gt::VertexIterator | gral_end (stream_grid_mask< It > const &g, typename gt::VertexIterator) |
| template<class It > | |
| gt::size_type | gral_size (stream_grid_mask< It > const &g, typename gt::VertexIterator) |
| template<class It > | |
| gt::CellIterator | gral_begin (stream_grid_mask< It > const &g, typename gt::CellIterator) |
| template<class It > | |
| gt::CellIterator | gral_end (stream_grid_mask< It > const &g, typename gt::CellIterator) |
| template<class It > | |
| gt::size_type | gral_size (stream_grid_mask< It > const &g, typename gt::CellIterator) |
| template<class It > | |
| gt::VertexOnCellIterator | gral_begin (stream_grid_mask_cell< It > const &g, typename gt::VertexOnCellIterator) |
| template<class It > | |
| gt::VertexOnCellIterator | gral_end (stream_grid_mask_cell< It > const &g, typename gt::VertexOnCellIterator) |
| template<class It > | |
| gt::size_type | gral_size (stream_grid_mask_cell< It > const &g, typename gt::VertexOnCellIterator) |
| template<class GRID > | |
| void | write_complex2d (GRID const &G,::std::ostream &out, int offset) |
| template<class GRID , class VCORR , class CCORR > | |
| void | write_complex2d (GRID const &G,::std::ostream &out, VCORR &G2Out_v, CCORR &G2Out_c) |
| template<class GRID , class VCORR , class CCORR > | |
| void | write_complex2d (GRID const &G,::std::ostream &out, int offset, VCORR &G2Out_v, CCORR &G2Out_c) |
| template<class GRID , class GEOM > | |
| void | write_complex2d (GRID const &G, GEOM const &Geo,::std::ostream &out) |
| template<class GRID , class GEOM > | |
| void | write_complex2d (GRID const &G, GEOM const &Geo,::std::ostream &out, int offset) |
| template<class GRID , class GEOM > | |
| bool | write_stl_ascii (std::ostream &out, GRID const &G, GEOM const &GeomG, std::string const &geom_name, int &num_non_triangles) |
| Write grid to ASCII STL file. | |
| template<class G , class NBTABLE , class GT > | |
| cell_on_cell_iterator< G, NBTABLE, GT > | gral_begin (typename GT::Cell const &c, cell_on_cell_iterator< G, NBTABLE, GT >) |
| template<class G , class NBTABLE , class GT > | |
| cell_on_cell_iterator< G, NBTABLE, GT > | gral_end (typename GT::Cell const &c, cell_on_cell_iterator< G, NBTABLE, GT >) |
| template<class MAJORIT , class MINORIT , class GT > | |
| closure_iterator< MAJORIT, MINORIT, GT > | gral_begin (typename MAJORIT::anchor_type const &a, closure_iterator< MAJORIT, MINORIT, GT >) |
| template<class MAJORIT , class MINORIT , class GT > | |
| closure_iterator< MAJORIT, MINORIT, GT > | gral_end (typename MAJORIT::anchor_type const &a, closure_iterator< MAJORIT, MINORIT, GT >) |
| template<class MAJORIT , class MINORIT , class GT > | |
| GT::size_type | gral_size (typename MAJORIT::anchor_type const &a, closure_iterator< MAJORIT, MINORIT, GT >) |
| template<class Grid > | |
| void | test_extended_cell_on_cell_iterator (const Grid &g) |
| template<class E , class R > | |
| element_range_ref< E, R > ::ElementIterator | gral_begin (element_range_ref< E, R > const &a, typename element_range_ref< E, R >::ElementIterator) |
| template<class E , class R > | |
| element_range_ref< E, R > ::ElementIterator | gral_end (element_range_ref< E, R > const &a, typename element_range_ref< E, R >::ElementIterator) |
| template<class E , class R > | |
| element_range_ref< E, R > ::size_type | gral_size (element_range_ref< E, R > const &a, typename element_range_ref< E, R >::ElementIterator) |
| template<class E , class R > | |
| grid_types < enumerated_element_range< E, R > >::ElementIterator | gral_begin (enumerated_element_range< E, R > const &a, typename grid_types< enumerated_element_range< E, R > >::ElementIterator) |
| template<class E , class R > | |
| grid_types < enumerated_element_range< E, R > >::ElementIterator | gral_end (enumerated_element_range< E, R > const &a, typename grid_types< enumerated_element_range< E, R > >::ElementIterator) |
| template<class E , class R > | |
| grid_types < enumerated_element_range< E, R > >::size_type | gral_size (enumerated_element_range< E, R > const &a, typename grid_types< enumerated_element_range< E, R > >::ElementIterator) |
| template<class Grid , class GT > | |
| gt::VertexIterator | gral_begin (enumerated_subrange_ref< Grid, GT > const &g, typename gt::VertexIterator) |
| template<class Grid , class GT > | |
| gt::VertexIterator | gral_end (enumerated_subrange_ref< Grid, GT > const &g, typename gt::VertexIterator) |
| template<class Grid , class GT > | |
| gt::size_type | gral_size (enumerated_subrange_ref< Grid, GT > const &g, typename gt::VertexIterator) |
| template<class Grid , class GT > | |
| gt::CellIterator | gral_begin (enumerated_subrange_ref< Grid, GT > const &g, typename gt::CellIterator) |
| template<class Grid , class GT > | |
| gt::CellIterator | gral_end (enumerated_subrange_ref< Grid, GT > const &g, typename gt::CellIterator) |
| template<class Grid , class GT > | |
| gt::size_type | gral_size (enumerated_subrange_ref< Grid, GT > const &g, typename gt::CellIterator) |
| template<class CELLRANGE , class VERTEXRANGE > | |
| void | ConstructVertexRange (CELLRANGE const &CR, VERTEXRANGE &VR) |
| template<class Range , class CellIt > | |
| void | ConstructSubrangeFromCells (Range &R, CellIt Cit) |
| template<class Grid , class GT > | |
| gt::VertexIterator | gral_begin (enumerated_subrange< Grid, GT > const &g, typename gt::VertexIterator) |
| template<class Grid , class GT > | |
| gt::VertexIterator | gral_end (enumerated_subrange< Grid, GT > const &g, typename gt::VertexIterator) |
| template<class Grid , class GT > | |
| gt::size_type | gral_size (enumerated_subrange< Grid, GT > const &g, typename gt::VertexIterator) |
| template<class Grid , class GT > | |
| gt::CellIterator | gral_begin (enumerated_subrange< Grid, GT > const &g, typename gt::CellIterator) |
| template<class Grid , class GT > | |
| gt::CellIterator | gral_end (enumerated_subrange< Grid, GT > const &g, typename gt::CellIterator) |
| template<class Grid , class GT > | |
| gt::size_type | gral_size (enumerated_subrange< Grid, GT > const &g, typename gt::CellIterator) |
| template<class FACETRANGE > | |
| gt::VertexIterator | gral_begin (facet_grid< FACETRANGE > const &a, typename enumerated_vertex_range< typename FACETRANGE::grid_type >::VertexIterator) |
| template<class FACETRANGE > | |
| gt::VertexIterator | gral_end (facet_grid< FACETRANGE > const &a, typename grid_types< FACETRANGE >::VertexIterator) |
| template<class FACETRANGE > | |
| gt::VertexIterator | gral_size (facet_grid< FACETRANGE > const &a, typename grid_types< FACETRANGE >::VertexIterator) |
| template<class FACETRANGE > | |
| gt::CellIterator | gral_begin (facet_grid< FACETRANGE > const &a, typename grid_types< FACETRANGE >::CellIterator) |
| template<class FACETRANGE > | |
| gt::CellIterator | gral_end (facet_grid< FACETRANGE > const &a, typename grid_types< FACETRANGE >::CellIterator) |
| template<class FACETRANGE > | |
| gt::CellIterator | gral_size (facet_grid< FACETRANGE > const &a, typename grid_types< FACETRANGE >::CellIterator) |
| template<class GRID > | |
| int | count_boundary_facets (GRID const &G) |
| Count the number of boundary facets. | |
| template<class GRID > | |
| int | count_boundary_components (GRID const &G) |
| Count the number of boundary components. | |
| template<class GRID , class FACETSET > | |
| void | find_boundary_component_germs (GRID const &G, FACETSET &C) |
| Find a facet for each component of the boundary of G. | |
| template<class GRID , class FACETSET > | |
| void | find_boundary_component_germs (GRID const &G, FACETSET &C, int &num_comps, int &num_facets) |
| Find a facet for each component of the boundary of G, and number of boundary components and facets. | |
| typedef ptrdiff_t GrAL::signed_size_t |
We use a signed type for sizes because it is safer (think of G1.NumOfVertices() - G2.NumOfVertices()).
Definition at line 129 of file grid-types.h.
| void GrAL::write_complex2d | ( | GRID const & | G, | |
| ::std::ostream & | out, | |||
| int | offset, | |||
| VCORR & | G2Out_v, | |||
| CCORR & | G2Out_c | |||
| ) | [inline] |
Does not write any vertex coordinates Procuces a mapping from G to integer numbers, starting from 0 (that is, essentially a enumeration of the vertices and cells of G).
Definition at line 48 of file write-complex2d.C.
References begin_x().
| bool GrAL::write_stl_ascii | ( | std::ostream & | out, | |
| GRID const & | G, | |||
| GEOM const & | GeomG, | |||
| std::string const & | geom_name, | |||
| int & | num_non_triangles | |||
| ) | [inline] |
Write grid to ASCII STL file.
STL is an inferior format for surface meshes used by a number of commercial tools ("industry standard"). It contains a simple list of triangles given by vertex coordinates and thus looses connectivity information. This information can only be recovered if no vertices have the same coordinates.
All triangular cells of the grid G will be written to out.
GeomG is a 3D geometry for G
Definition at line 42 of file write-stl.h.
1.5.8