compare and cull

Hi,

I have this definition, where I need to cull out all numbers that there isn't two of (see attached definition) ... does anyone have an idea of how to do this, and is it possible without a script-component?

Thanks in advance!

Attachments:

SortOrCullByPairs.gh, 1 KB

Replies to This Discussion

Permalink Reply by Hannes Löschke on April 4, 2012 at 1:57am

You are looking for "CreateSet"

edit: sorry. Misread your post. If you can sort the List, then pairs occur on consequitve indices. You can shift the list by one and compare this with the original. If it is a pair both list items are equal. You can use this boolean pattern to cull one of the lists.

Permalink Reply by Giulio Piacentino on April 4, 2012 at 2:30am

Here is an example to remove duplicated pairs.

I hope this helps,

- Giulio
________________
giulio@mcneel.com

Permalink Reply by Giulio Piacentino on April 4, 2012 at 2:31am

Attachments:

CullSortedPairs.gh, 3 KB

Permalink Reply by Dedackelzucht on April 4, 2012 at 3:00am

Hey

I got two ways copied out of my libary.

Please ask any questions if you do not understand how the file works. It is a very useful way of how to create paths with equal informations. You can sort any type of geometry with this.

Best Regards

DeDackel

Attachments: