[Dune] How children which are copies of their father handled in DUNE?

[Oliver Sander]

Am 08.04.2014 16:12, schrieb Casagrande Raffael:
> Hi Oliver,
> 
>> -----Original Message-----
>> From: sander at igpm.rwth-aachen.de [mailto:sander at igpm.rwth-aachen.de]
>> Sent: Dienstag, 8. April 2014 16:02
>> To: dune at dune-project.org; Casagrande Raffael
>> Subject: Re: [Dune] How children which are copies of their father handled in
>> DUNE?
>>
>> Hi Raffael,
>>
>>>
>>> Hmm what I meant with std::distance(begin,end) is just the number of
>>> times that I have to increment begin until begin == end. So if I take
>>> again the example from my original question,
>>>
>>> (a)-------------(i)------(b)    level 0
>>> (c)------(d)----(j)               level 1,
>>>
>>> Then the leaf view contains nodes (c), (d), (i), (j), (b) so I assume
>>> that when I iterate through all nodes of the leaf view I will
>>> effectively get 5 nodes? (i.e. std::distance(leafView().begin<1>(),
>>> leafView().end<1>()) == 5 but
>>> leafView().size(1) == 4)
>>>
>>
>> The vertices in a leaf view are equivalence classes of actual vertices.  Therefore
>> in your example (i) and (j) are actually the same thing.  Upon iterating over all
>> leaf vertices you will get (c), (c), (i/j), (b), i.e., four vertices.
>>
> 
> Okay that makes sense. I think what confused me is the level() function of a codim>0 entity because it implied for me that one node object can only belong to exactly one level. Do you know how the level of node (i/j) would be defined in the described setting?
> 

I suppose that would be the number of the finest grid level the vertex is on.
--
Oliver

> Thanks a lot,
> Raffael
> 
>> Hope that helps,
>> Oliver
>>
>>
>>>
>>>>
>>>>> 2) But I guess for any levelView this equality will hold because
>>>>> there are no
>>>> children and fathers (which could be copies of each other) in the
>>>> same level view?
>>>>>
>>>>> If this is so then I would suggest to update the documentation of
>>>>> the IndexSet
>>>> to something like this:
>>>>>
>>>>> The index map \f$ m \f$ has the following properties:
>>>>>   - Two entities have the same index if one is an exact copy of the other, i.e.
>>>> for any \f$ e, e' \in E_g^c \f$ we have \f$ e \mathcal{C} e'
>>>> \rightarrow m(e) = m(e')\f$ (this is only possible in leaf views)
>>>>>   - Otherwise they have different indices: For any \f$ e, e' \in
>>>>> E_g^c\f$ such
>>>> that \f$ e \neq e' \wedge  \neg( e \mathcal{C} e' ) \f$ then \f$ m(e)
>>>> != m(e') \f$
>>>>>   - It is consecutive and zero-based within the subsets \f$ E_g^c /
>>>>> \mathcal{C}
>>>> \f$, i.e. we have \f$ 0 \leq m(e) < |E_g^c / \mathcal{C} | \f$ for
>>>> any \f$ e \in E_g^c\f$.
>>>>>
>>>>
>>>> Please open a bug report about this at
>>>> <http://www.dune-project.org/flyspray>. On this list it might simply get lost.
>>>
>>> Okay, I'll do that in a moment when I'm sure I've understood the
>>> problem ;)
>>>
>>> Thanks a lot in advance,
>>> Raffael
>>>
>>>>
>>>> Cheers,
>>>>
>>>> Markus
>>>> --
>>>> Dr. Markus Blatt - HPC-Simulation-Software & Services
>>>> http://www.dr-blatt.de Hans-Bunte-Str. 8-10, 69123 Heidelberg,
>>>> Germany,  USt-Id: DE279960836
>>>> Tel.: +49 (0) 160 97590858
>>>
>>> _______________________________________________
>>> Dune mailing list
>>> Dune at dune-project.org
>>> http://lists.dune-project.org/mailman/listinfo/dune
>>>
>>
> 


-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 534 bytes
Desc: OpenPGP digital signature
URL: <https://lists.dune-project.org/pipermail/dune/attachments/20140408/aea284f1/attachment.sig>