Hello there, i’m kinda new to grasshopper and I have a question regarding data matching between data trees ( sorry if my terminology isn’t 100% accurate)
I was wondering how a component that has two data trees (as inputs) with sublists behave, does it behave with the longest list algorithm as in data matching between two lists ?
Well since you post your issue in this category … this means that you are familiar with some language?
Anyway … if this is C# and you want a demo on that matter notify.
Changed to regular Grasshopper.