That is correct. But I want to find the occurrence of all items inside the first branch of tree A inside the first branch of tree B. So it is a comparison of two trees, but branch one with one, two with two, etc.
For branch {2} you receive Item Index 2, 0, 1 in B with path {2;0}, {2,1}, {2,2}. In my case, it is necessary to receive all three index numbers inside one branch. So all resulting Indexes for {2] should inside one branch. I do not know how to receive this structure
I received my final result. Thanks a lot for your time!
When you have a little bit more time, there is no hurry:
I do not know much about sets, but I read somewhere else that there is not any difference between lists (trees, branches, etc) and sets. I still do not know when to use tree components and when set components.
Just for our example right now. Is there any possibility to solve this thing with tree components. So just with lists, shifting branches, etc. ?
Maybe they look similar, but they’re playing a different role, so they’re divided.
The components in the Tree tab are tools for manipulating or selecting when using the Datatree of GH.
The components in the Sets tab are mainly useful for boolean, selection, and manipulation of set of points or numbers.
Just one more example with same tree problem but a bit different. First branch of tree “Numbers” should be tested inside first branch of tree “Domains”.
I am not sure if this could be done with the solution from above. Do you know how to handle that?