Commit 4eb6268b authored by Peter Bastian's avatar Peter Bastian
Browse files

Beispiel mit Ausgabe

[[Imported from SVN: r59]]
parent de86ca7d
......@@ -94,6 +94,7 @@ void timeloop (G& grid, double tend, int lmin, int lmax)
{
k++;
evolve(grid,mapper,c,t,dt);
return;
t += dt;
if (k%modulo==0) vtkout(grid,c,"concentration",k/modulo);
std::cout << "s=" << grid.size(0) << " k=" << k
......
......@@ -53,7 +53,7 @@ void evolve (const G& grid, const M& mapper, V& c, double t, double& dt)
// variable to compute sum of positive factors
double sumfactor = 0.0;
//std::cout << "LEAF ELEMENT index=" << indexi << " pos=" << global << std::endl;
std::cout << "LEAF ELEMENT "<< " pos=" << global << " index=" << indexi << std::endl;
// run through all intersections with neighbors and boundary
IntersectionIterator isend = it->iend();
......@@ -92,8 +92,8 @@ void evolve (const G& grid, const M& mapper, V& c, double t, double& dt)
EntityPointer outside = is.outside();
int indexj = mapper.map(*outside);
// std::cout << " NEIGHBOR index=" << indexj
// << " pos=" << outside->geometry().global(local) << std::endl;
std::cout << " NEIGHBOR index=" << indexj
<< " pos=" << outside->geometry().global(local) << std::endl;
// compute flux from one side only
// this should become easier with the new IntersectionIterator functionality!
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment