There's going to need to be some discovery time on this to find out which data matching schemes would make sense for dealing with paths. I would almost prefer a "Data Matching Editor" in which the flow from node to node or tree to tree can be manually created. I guess that circumvents having to have 20 different data matching schemes that deal with paths as you would be able to just "hook it up" in the DMeditor. I know that putting something like that together is easier said than done. Either way, there seam to be bigger fish to fry at the moment.
-Damien On Mar 20, 7:23 am, David Rutten <[email protected]> wrote: > > 4. Is there any plan to have alternate data matching schemes that > > could honor (in some way) the incoming path structure. > > Yes, very much so. But I need to grow my understanding of data-trees- > in-real-life first. > > At the moment all the branches are simply compared in sequence (using > an algorithm very similar to Longest List Matching). Obviously at some > point Grasshopper needs to pay attention to the entire structure, and > only work with lists that plausibly belong together. > > -- > David Rutten > [email protected] > Robert McNeel & Associates
