GitHub PushEvent at 2014-11-22 07:23:53
Repository: dealii
Actor: kronbichler
Payload: {"shas":[["c07e2596b5fb3297ad3ad6b426f6d17acfa462c2","2e3d2014db6219dd9d7132eb1cf1b9af2c824588@lnm.mw.tum.de","Improved comparison operators for TriaAccessorBase\n\nThe previous commit was a bit too aggressive because it is still useful to catch the case when comparing iterators to two different triangulations (leading to infinite loops).\n\nTherefore, I now merely extended the assertion to not trigger when one of the two objects is default constructed, i.e., does contain a null pointer to tria. The comparison then does not need tria == a.tria because invalid iterators use invalid cell and level index, too (leading to !=).","Martin Kronbichler",true],["84e4cc73aeaee4502c6075f6b2dc7d7578e24a1d","2e3d2014db6219dd9d7132eb1cf1b9af2c824588@lnm.mw.tum.de","Initialization of FEEvaluation like FEValues\n\nA new way to initialize an FEEvaluation object (fast tensor product evaluation routines) has been introduced.\nIt takes the same arguments as the initialization method of FEValues, namely a Mapping, a FiniteElement, a\none-dimensional Quadrature<1> object, and update flags. This enables using FEEvaluation on the fly just as\nFEValues. Since FEEvaluation treats objects of one base element only, this class can select which components\nto read.\n\nThe concept is explained in the documentation of the FEEvaluation class and an example for the Laplace matrix\nis given. However, it also works for the Stokes operator as shown by the test program assemble_matrix_02.","Martin Kronbichler",true],["f5dbafcce80fa6339fe5252329d8cfdceada884c","2e3d2014db6219dd9d7132eb1cf1b9af2c824588@lnm.mw.tum.de","Merge pull request #258 from kronbichler/matrix_free_assembly\n\nInitialization of FEEvaluation like FEValues","Martin Kronbichler",true]],"size":3,"ref":"refs/heads/master","head":"f5dbafcce80fa6339fe5252329d8cfdceada884c"}