]> https://gitweb.dealii.org/ - dealii.git/commit
Generalize the data structure used to represent an edge set. 3224/head
authorWolfgang Bangerth <bangerth@colostate.edu>
Tue, 11 Oct 2016 22:20:02 +0000 (16:20 -0600)
committerWolfgang Bangerth <bangerth@colostate.edu>
Wed, 12 Oct 2016 07:35:47 +0000 (01:35 -0600)
commit5d1258a1b26d228f05305cdab7b27d09290f83dc
treed174734b9607d1b649688d4dec8b79eaeb10c865
parent92e0dfdfa7e97c0411da473854100455e8e6fb11
Generalize the data structure used to represent an edge set.

Specifically, the class is used to represent the set of edges by which the parallel
set can grow in each iteration. In 2d, this set can only have zero, one, or two
elements, and we can use a corresponding, O(1) data structure to store them.

In 3d, the set can be of arbitrary size and we represent it as a std::set.

Creating generic data structures also allows to write the algorithm that uses it
in a more concise way using iterators.
source/grid/grid_reordering.cc

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


Typeset in Trocchi and Trocchi Bold Sans Serif.