Swap value for branch??

Replies to This Discussion

Permalink Reply by peter fotiadis on March 7, 2015 at 12:06am

Path mapper is a very good thing but ... you MUST be 100% sure about your input (as regards dimensions).

This is very easily doable with code - notify if you want such a solution. It's also doable with components but personally I prefer always the code way when dealing with data trees "managerial" matters.

Permalink Reply by James on March 7, 2015 at 5:59am

Thanks Peter,

I know that both the trees are equal in input (i.e: 192 values in each with 62 branches in each) 

So I thought it would be just simple path mapper solution, but is it just cleaner/quicker with code?

Also I can join the 2 trees and be left with 62 branches with 284 pairs of numbers with no pair in the same branch

If you think that code would be the way to go then I would be very grateful with your solution.

Otherwise the only way I can think to do the path mapper is to convert the index to the numeric value? and then {A;B;C}(i) >> {A;B;i}(C) and merge the 2 trees? But this doesn't look right to me.

The manufacturing format should look like 1_4_6: that 4 is related to 1 and 6 at either end of 4's line (if this info helps I dont know?) this I can do in a formatting function.

Thanks again 

Permalink Reply by peter fotiadis on March 7, 2015 at 6:17am

OK, here's the deal: post some stuff of yours and I'll do it both ways (and maybe you could been attracted by The Dark Side, who knows? he he).

That said dealing with ANY "managerial" issue directly (code) appears (to me) far easier/cleaner/etc etc not to mention a VAST amount of capabilities/methods available for manipulating  Lists (because a DataTree is an "ordered" collection of Lists).

PS: in this case equal dimensions is good (mapper) but what if the next week appears some other case that ... blah, blah (especially in the "middle" of some complex def that is constantly changing as you refine the whole solution/add capabilities/add-delete components/add-delete whatever).

Moral: post the test stuff.

Permalink Reply by James on March 7, 2015 at 6:48am

I'm not gonna lie, the Dark Side looks scary but then again I am easily swayed...

Attachments:

• DataMatching.gh, 26 KB

Permalink Reply by peter fotiadis on March 7, 2015 at 9:39am

BTW: Is some reason for NOT simplifying indices DataTees? (Good case "against" mapper, I'm kidding but .. well ... you get the gist of my meaning, I do hope).

Or you want (at some later time) to operate with Lists (or Trees) of meshes? (thus ... obviously ... blah blah)

Permalink Reply by peter fotiadis on March 7, 2015 at 12:29pm

Get the Dark Side first (what else? he he)

Attachments:

• DataMatching_Come_To_The_Dark_Side_V1.gh, 40 KB

Permalink Reply by James on March 7, 2015 at 1:17pm

Nice one!

No reason for not simplifying, the data's just for a print list/visual que.

The thing I find is it much easier to produce definitions through visual programming (GH) then code, and Although I kinda can see what you did, I cant (yet) speak the language. This is why I was leaning towards the PathMapper.

Thank you Peter! I am very grateful.

Permalink Reply by peter fotiadis on March 7, 2015 at 2:27pm

Glad to help. Get the trad update (with user defined dimensions - just in case). Added some visual check (better safe than sorry).

Visual  programming is certainly a good thing  but I'm attracted by the cookies.

take care

Attachments:

• DataMatching_Come_To_The_Dark_Side_V2.gh, 50 KB

Permalink Reply by James on March 7, 2015 at 3:55pm

This shows which thing goes on what doodad.

Thanks Again!

Permalink Reply by James on March 7, 2015 at 9:58pm

Well this is embarrassing!

Could I ask for one last favour?

I have a similar issue with these lists. 

I tried bastardising your code, but my computer audibly laughed at me. 

Attachments:

• DataMatching_Padowan_lvl1.gh, 17 KB

Permalink Reply by peter fotiadis on March 8, 2015 at 1:15am

I do hope that nobody else read this ... but the Truth (out There) is that code "elevates" you to another level.

In fact ... in order to prove exactly that I've just took delivery of my personal elevator: cost me some dollars (but hey who's counting?) but it proves the theory quite well.

take care, Lord of Darkness

Attachments:

• DataMatching_Padowan_lvl1_Come_To_The_Dark_Side_V1.gh, 44 KB

Permalink Reply by peter fotiadis on March 8, 2015 at 1:49am

Added something fun for you (brep massacre, that is).

BTW: I have a lot of Dark Side stuff that prepare anything (most notably: complex trusses, space frames, domes and the likes) for construction (node connectivity, angles, lengths, vectors, dihedrals, umbrella sticks (don't ask), cats, dogs and one alligator).

Notify if you want something.

Attachments:

• DataMatching_Padowan_lvl1_Come_To_The_Dark_Side_V2.gh, 344 KB

• ‹ Previous
• 1
• 2
• Next ›
• Page