Retrieve Branch Path according to Number of contained Items

Replies to This Discussion

Permalink Reply by Matt Gaydon on March 10, 2016 at 6:17am

Try This.. 

Its as simple as I can think to do it. It make possible to do it with less components but may not be so readable.

Attachments:

• Tree Contains.gh, 9 KB

Permalink Reply by ChristianF on March 10, 2016 at 8:53am

Thanks a lot for your simple but easily comprehensible solution, Matt.

Your approach solves my problem (A) since it is about the amount of items cotained in a specific branch.

Regarding problem (B) I am looking for a method to evaluate the items as the determining constraint on the basis of which I then want to retrieve a specific branch.

In other words:

I want to check if the value of an item inequals 0.0 or 1.0 and if this condition is satisfied (e.g. the value could be 0.54998), I then want to retrieve the respective branch (path).

Any ideas on that?

Permalink Reply by ChristianF on March 10, 2016 at 9:52am

And I'd like to add one more request to that topic:

now that I have a data tree containing all desired branches, where each branch represents a line I later on want to further work with, how can I convert the branch paths into a list where each entry equals the original branch number/ "ID"?

Permalink Reply by Matt Gaydon on March 10, 2016 at 9:56am

Does this Work?

As for you new question I can't updated the attached code with the Ids in this reply but use a Deconstuct Path Component as below in the screen capture

Attachments:

• Tree Contains 01.gh, 14 KB

Permalink Reply by ChristianF on March 10, 2016 at 3:07pm

I am still not done with Problem (B), which is probably on my behalf:

The way you dealt with my question was to design a data tree, in which branches with only one item are the only ones to contain the floating point items (i.e items with value of e.g. 0.54998). By this, you only need to cull all branches with the length of N=1, as you did it, and you would have all branches with floating points.

In fact, my data tree also comprises branches with only one item, which could be of the value 0.0 or 1.0 too.

As I stated in my initial post (and I admit, I actually didn't do that precisely), my culling criteria are

(A) branches with TWO items, no matter if the values are

0| 0.0

1| 0.4235

or

0| 1.0

1| 0.0

or

...

(B) branches with ONE item (since the two-item-branches are already culled with criterion (A)) of the value inequal to 0.0 and 1.0 

It is therefore crucial to pick all the (remaining) branches (with one item) and check the contained item for inequality against 0.0 and 1.0 and not to check for the length of branches only.

Anyways, I appreciate all your efforts, you invested so far. Thank you Matt!

Permalink Reply by Matt Gaydon on March 11, 2016 at 2:46am

Ok, I had made a list of number with 0,1  as sets of 2 per tree and floating points as singles so was not getting the 'error'/ answer you required.

This update should work how you want it to now, just added the extra condition.

Attachments:

• Tree Contains 02.gh, 12 KB

Permalink Reply by ChristianF on March 11, 2016 at 9:02am

And here we are, thats what I was looking for.

Many thanks to you, Matt.

Permalink Reply by Matt Gaydon on March 11, 2016 at 9:21am

If you can post up the portion of your code with the data internalised for the question, it should help speed up the answers another time. ;)

As may miss something like {0.0, 0.055 } when making the demo based on your screen capture only. 

P.s Glad it finally works as expected.

Permalink Reply by ChristianF on March 11, 2016 at 9:50am

Good advice! I will store it directly behind my forehead ;)

Once again, thanks a lot.

Permalink Reply by Pieter Segeren on March 11, 2016 at 11:28am

As I understand it, you want only branches that contain a single item, that is not 0 or 1, right?

Attachments:

• TreeContains_PSG.gh, 18 KB

Permalink Reply by ChristianF on March 18, 2016 at 2:28am

Thank you, too, Pieter. I applied your approach to my problem and kept it as an alternative method. Getting to know new components (Prune Tree, Mass Addition) and how they could be applied is benefit enough.

On this occasion, may you tell me what the logic of the Mass Addition component is in detail? Your example shows, that true/false entries are added up in a way that

False+False = 0

True + False = True + True = 1

but, to be honest and by this probably compromising myself, I do not recognize the superior mathematical logic behind it. In other words, is there a specific term for this kind of boolean operation?

I'd appreciate a short explanation.

Thanks in advance!

Permalink Reply by Pieter Segeren on March 18, 2016 at 4:55am

Hi Christian,
I never claimed I was using any superior logic there...;) but anyway,  
the PruneTree culls all branches that contain more (or less) than one value (I figured that was a quick partial solution).
Then I tested whether the value is 0 or 1, then I used MassAddition to end up with a single result. I have this tendency to use MassAddition in conbination with the boolean value property that anything but 0 results in a True value (auto conversion I guess). Hope that makes sense to you and explains what I did there... ~

(Just curious: wieso schreibst du Constance statt Konstanz? )

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