Data tree structuring

I am confused about this definition. How can equality compute from two different data structures? One has only 1 branch and the other having 45 branches. Can someone please explain this?

You are flattening the Data B here. The definition which I posted doesn’t flatten the Data B.

This is a core concept of Grasshopper by default called “Longest List Matching”. When 2 trees don’t match then the last branch of the shorter tree gets used for each remaining branch of the longer tree. Same logic goes for items per branch. The last item of the shorter branch will get used for each remaining item in the longer branch it is matching with. You can of course override this behavior with components like Shortest List and Cross Reference. You can even do different types of longest list matching with the Longest List component.


Oh okay. Understood.
So, while making a definition would this approach be okay or another approach should be taken into consideration?

Thank you

If the results are what you intend then it is what you should do.

Yeah. Alright, I shall further experiment to get a clear understanding of it.