45 typedef typename GridView::template Codim< 0 >::Iterator ElementIterator;
48 typedef typename ElementIterator :: Entity Element ;
49 typedef typename Element :: EntitySeed ElementSeed ;
53 typedef ReferenceElement< typename Grid::ctype, dimGrid > RefElement;
54 typedef ReferenceElements< typename Grid::ctype, dimGrid > RefElements;
72 void write ( std::ostream &gridout,
73 const std::vector< Index >& newElemOrder,
74 const std::stringstream& addParams = std::stringstream() )
const;
80 void write ( std::ostream &gridout )
const;
88 void write ( std::ostream &gridout,
89 const std::stringstream& addParams )
const;
95 void write (
const std::string &fileName )
const;
107 const IndexSet& indexSet,
108 const GeometryType& elementType,
109 const std::vector< Index >& vertexIndex,
110 std::ostream &gridout )
const
112 if (!elementSeeds.empty()) {
114 for (
const auto& seed : elementSeeds) {
115 const Element element =
gridView_.grid().entity(seed);
116 writeElement(element, indexSet, elementType, vertexIndex, gridout);
121 for (
const auto& element : elements(
gridView_))
122 writeElement(element, indexSet, elementType, vertexIndex, gridout);
128 const IndexSet& indexSet,
129 const GeometryType& elementType,
130 const std::vector< Index >& vertexIndex,
131 std::ostream &gridout )
const
134 if( element.type() != elementType )
138 const size_t vxSize = element.subEntities( Element::dimension );
139 std::vector<Index> vertices(vxSize);
140 for(
size_t i = 0; i < vxSize; ++i )
141 vertices[ i ] = vertexIndex[ indexSet.subIndex( element, i,
dimGrid ) ];
143 gridout << vertices[ 0 ];
144 for(
size_t i = 1; i < vxSize; ++i )
145 gridout <<
" " << vertices[ i ];
146 gridout << std::endl;
153 write ( std::ostream &gridout,
154 const std::vector< Index >& newElemOrder,
155 const std::stringstream& addParams )
const
158 gridout.setf( std::ios_base::scientific, std::ios_base::floatfield );
159 gridout.precision( 16 );
161 const IndexSet &indexSet = gridView_.indexSet();
164 std::vector< ElementSeed > elementSeeds;
167 const size_t orderSize = newElemOrder.size() ;
168 if( orderSize == indexSet.size( 0 ) )
170 const ElementIterator end = gridView_.template end< 0 >();
171 ElementIterator it = gridView_.template begin< 0 >();
175 elementSeeds.resize( orderSize, (*it).seed() ) ;
176 size_t countElements = 0 ;
177 for( ; it != end; ++it, ++countElements )
179 const Element& element = *it ;
180 assert( newElemOrder[ indexSet.index( element ) ] < orderSize );
181 elementSeeds[ newElemOrder[ indexSet.index( element ) ] ] = element.seed();
186 if( countElements != orderSize )
187 DUNE_THROW(InvalidStateException,
"DGFWriter::write: IndexSet not consecutive");
192 gridout <<
"DGF" << std::endl;
194 const Index vxSize = indexSet.size( dimGrid );
195 std::vector< Index > vertexIndex( vxSize, vxSize );
197 gridout <<
"%" <<
" Elements = " << indexSet.size( 0 ) <<
" | Vertices = " << vxSize << std::endl;
200 gridout << std::endl <<
"VERTEX" << std::endl;
201 Index vertexCount = 0;
202 const ElementIterator end = gridView_.template end< 0 >();
203 for( ElementIterator it = gridView_.template begin< 0 >(); it != end; ++it )
205 const Element& element = *it ;
206 const int numCorners = element.subEntities( dimGrid );
207 for(
int i=0; i<numCorners; ++i )
209 const Index vxIndex = indexSet.subIndex( element, i, dimGrid );
210 assert( vxIndex < vxSize );
211 if( vertexIndex[ vxIndex ] == vxSize )
213 vertexIndex[ vxIndex ] = vertexCount++;
214 gridout << element.geometry().corner( i ) << std::endl;
218 gridout <<
"#" << std::endl;
219 if( vertexCount != vxSize )
220 DUNE_THROW(
GridError,
"Index set reports wrong number of vertices." );
225 GeometryType simplex( GeometryType::simplex, dimGrid );
228 if( indexSet.size( simplex ) > 0 )
231 gridout << std::endl <<
"SIMPLEX" << std::endl;
234 writeAllElements( elementSeeds, indexSet, simplex, vertexIndex, gridout );
237 gridout <<
"#" << std::endl;
243 GeometryType cube( GeometryType::cube, dimGrid );
246 if( indexSet.size( cube ) > 0 )
249 gridout << std::endl <<
"CUBE" << std::endl;
252 writeAllElements( elementSeeds, indexSet, cube, vertexIndex, gridout );
255 gridout <<
"#" << std::endl;
260#if DUNE_GRID_EXPERIMENTAL_GRID_EXTENSIONS
261 gridout << std::endl <<
"BOUNDARYSEGMENTS" << std::endl;
262 for( ElementIterator it = gridView_.template begin< 0 >(); it != end; ++it )
264 const Element& element = *it ;
265 if( !it->hasBoundaryIntersections() )
268 const RefElement &refElement = RefElements::general( element.type() );
270 const IntersectionIterator iend = gridView_.iend( element ) ;
271 for( IntersectionIterator iit = gridView_.ibegin( element ); iit != iend; ++iit )
273 if( !iit->boundary() )
276 const int boundaryId = iit->boundaryId();
277 if( boundaryId <= 0 )
279 std::cerr <<
"Warning: Ignoring nonpositive boundary id: "
280 << boundaryId <<
"." << std::endl;
284 const int faceNumber = iit->indexInInside();
285 const unsigned int faceSize = refElement.size( faceNumber, 1, dimGrid );
286 std::vector< Index > vertices( faceSize );
287 for(
unsigned int i = 0; i < faceSize; ++i )
289 const int j = refElement.subEntity( faceNumber, 1, i, dimGrid );
290 vertices[ i ] = vertexIndex[ indexSet.subIndex( element, j, dimGrid ) ];
292 gridout << boundaryId <<
" " << vertices[ 0 ];
293 for(
unsigned int i = 1; i < faceSize; ++i )
294 gridout <<
" " << vertices[ i ];
295 gridout << std::endl;
298 gridout <<
"#" << std::endl << std::endl;
302 gridout << addParams.str() << std::endl;
304 gridout << std::endl <<
"#" << std::endl;