one cell to work on.
git-svn-id: https://svn.dealii.org/trunk@8007
0785d39b-7218-0410-832d-
ea1e28bc413d
<h3>General</h3>
<ol>
+ <li> <p> Fixed: The step-14 program had a bug in the rare case that
+ there are more CPUs in a machine than there are cells. This is
+ now fixed.
+ <br>
+ (WB 2003/09/23)
+ </p>
+
<li> <p> Fixed: In the step-14 example program, overly conservative
quadrature formulas were chosen (with 2N+1 quadrature points per space
dimension, where N is the degree of polynomials). This is unnecessary,
for (unsigned int t=0;
(t<this_thread) && (cell!=dual_solver.dof_handler.end());
++t, ++cell);
-
+
+ // If there are no cells for this
+ // thread (for example if there
+ // are a total of less cells than
+ // there are threads), then go
+ // back right now
+ if (cell == dual_solver.dof_handler.end())
+ return;
+
// Next loop over all cells. The
// check for loop end is done at
// the end of the loop, along
In the beginning the Universe was created. This has made a lot of
people very angry and has been widely regarded as a bad move.
Douglas Adams