Data Tree Management: What´s the logic behind this simple merge op?

Hi fellas,

I tried my best but failed miserably to find any logic behind the given merged data trees. Why do we have 1, then A, B, C, then 2 and 3 at the end?

I thought that D1, “A” should be the first in the list, but apparently not. What am I missing here? I guess it has something to do with the path names, but still…

p.s. I can clearly see the logic if I simplify both D1 and D2 data trees.

Thanks in advance.


DTM_MERGE_E1.gh (32.9 KB)

Because the data trees don’t match.

Thanks for the fast reply as usual @Joseph_Oster, but why do we have A, then 1, 2, 3, followed by 2 and 3? I mean, what´s the logic to generate that specific data structure?

Does it really matter? They are not matched so merge will not be correct.

DTM_MERGE_2024Jan13a
DTM_MERGE_2024Jan13a.gh (7.2 KB)

DTM_MERGE_2024Jan13b
DTM_MERGE_2024Jan13b.gh (6.1 KB)

Merge component merges data depending on the path of each branch and the order that data is connected to its inputs, so it’s important for it to be “sensible enough” to distinguish from {0} and {0;0} and {0,0,0}

generally speaking, for the GH components, it’s more in the direction of list matching, so for instance Concatenate will produce the wanted result despite the paths being different, because it’s 3 lists Vs 3 lists:

whenever you feel ready for something strong :rofl: have a look at this:


DTM_MERGE_E1_HELL.gh (12.3 KB)

and of course this, that I watch every night before going to sleep: https://www.youtube.com/watch?v=ob3ER12ut3Y

3 Likes

Thanks for taking your time to dig into this example, much appreciated @inno . I will definitely take a look at the “hell file” and the link you sent.

As weird as this may sound, I absolutely love to fiddle with GH and understand how it works. That´s just my nature, I guess.

p.s. I thought I was the only one watching GH´s tutorials on Youtube before going to sleep, LOL.

Grazie mille!

UPDATE: @inno, the “hell file script” makes perfect sense to me! phew!

2 Likes