ion of the ElementMapping data structure.
This is used when we do not need to remember the indices.  This implementation permits to have the code identical
altough not requiring memory consumption.
This is particularly useful when processing node that are at the maximum computable depth in order to not
remember the mapping for its children that will not be computed.
</p></div></div>
    </li><li name="reforest.rf.slc.ElementMappingListBuffer" visbl="pub" data-isabs="false" fullComment="no" group="Ungrouped"