Combining two trees

I have 2 trees with a structure like this:

{4;0} {4;0}

{4;1} {4;1}

{5;0} {5;0}

{5;1} {5;1}

etc. etc.

their structure is the same, but they have different values. What I want to do is combine them so that the structure would be something like:

{4;0}

{4;1}

{4;2}

{4;3}

{5;0}

{5;1}

{5;2}

{5;3}

I tried the method here, but it didn't give me what I wanted, it was just tacking the new values onto the end, and not maintaining their paths. Any help would be appreciated. Thanks!

Attachments:

Capture.PNG, 17 KB
Tree Combine.gh, 8 KB

Replies to This Discussion

Permalink Reply by Daniel González Abalde on February 10, 2016 at 8:50am

Attachments:

TreeCombine.gh, 12 KB

Permalink Reply by Dennis Goff on February 10, 2016 at 9:17am

Thanks Daniel,

That works in this specific example, but it doesn't work when it comes to trees where the number of branches is different. what I want is to be able to find the last {0;?} value in the first list and add on all of the {0;?} values from the second tree to that. So if the first tree's 0 values ended at {0;49}, it would take value {0;0} from the second tree and place it at {0;50} and so on.

Permalink Reply by Daniel González Abalde on February 10, 2016 at 9:53am

Your tree should have a structure like {A;B} for this to work.

Attachments:

TreeCombine.gh, 13 KB

Permalink Reply by Daniel González Abalde on February 10, 2016 at 10:19am

Sorry, this works bad. Try with this:

I feel I'm missing something (to make it simpler).

Attachments:

TreeCombine.gh, 12 KB

Permalink Reply by Andrew Heumann on February 10, 2016 at 10:46am

What about this? Maybe I'm missing something about the nuances of the problem but seems to me this works - provided your branches each only has one item to start with.

Permalink Reply by Dennis Goff on February 10, 2016 at 10:54am

Yes Andrew that did exactly what I needed, thank you. I currently only have one item in each branch but might need more later, what would change to make that work?

Permalink Reply by Andrew Heumann on February 10, 2016 at 12:14pm

For geometry you could group the elements prior to the pshift and then ungroup after the merge... for non-geometric data you'd need some sort of a trick. Something like Daniel's approach could work - if it were me I'd use some python/c# script to do the equivalent of "group and ungroup" for non-geometric data. in python these are extremely easy to write - for the "group" it's just a = [x] (with list access set for the x input) and for the ungroup it's just a = x (with item access for the x input) - see the attached script for examples.

Attachments:

Multi-item-interleave.gh, 9 KB

Permalink Reply by Andrew Heumann on February 10, 2016 at 12:17pm

Incidentally the C# equivalents are also simple (if slightly less than python) - but may run ever so slightly faster:

Group: A = new object[]{x}; (with x given list access)

Ungroup: A = x; (with x given item access)

Permalink Reply by Dennis Goff on February 10, 2016 at 2:53pm

Thanks Andrew, I'll give that a shot.

Permalink Reply by Dennis Goff on February 11, 2016 at 12:18pm

So i tried this out. My tree branches consist of 2 items, a poly line and a string. The python ones worked up until ungrouping at which point, it seemed to lose the polyline, returning a null in that slot. However, the C# method worked perfectly. Thanks a lot!

Permalink Reply by Daniel González Abalde on February 10, 2016 at 10:55am

If branches have only one element, that is the right way.
Today is not my day XD

Permalink Reply by ng5 Alex on February 10, 2016 at 10:55am