This new method is a more powerfull version of the
buildInnerBoundariesAlongM1Group method because it naturally handle non
connex and complex M1 groups
wip: fix cycling over nodal connectivity
fix shared_ptr<set<int>> allocation
wip: no more memleak !
TODO: for now this method only treat the mesh at level 0. The mesh at
level -1 and the groups lying on it should be taken care of.
wip: Duplicate faces inplace and replace old node number with new ones
wip: removing useless shared_ptr, adding doc
wip: moving duplicateFaces to CrackAlgo.cxx
wip: refactor CrackAlgo and treat elements families
missing node families
feat: functional new duplicateFaces method
fix: changing API and preparing methods for test
feat: separate tests on crackAlong method
wip: using M1 and not Mf
fix: case when cell has no neighbor
feat: test mesh at level -1
This test checks that the crack mesh has twice as many cells than the
starting crack mesh, and that they are both equivalent after merging the
nodes.
wip: fixing connectivity of faces which are not duplicated
fix: manage connectivity of m1 elements touching crack
wip: add python tests
Still figuring out why using M1 non connex group erease the families at lev -2
fix: crackAlong exceptions with boolean param
A boolean is added to change the method behavior in the case when a face
is duplicated but not modified (there is no real separation between
volumes)
feat: new tests and OpenCrack binding
fix: Copy family at lev0 and set them back
Because suprisingly they tend to disapear.
refactor: OpenCrack -> openCrack
fix: remove french comments, better use of stl
refactor: better documentation, less auto, more const
