Re: UNIQ without SORT [message #34085] |
Tue, 18 February 2003 17:38 |
Thomas Gutzler
Messages: 44 Registered: November 2002
|
Member |
|
|
Reimar Bauer wrote:
> Thomas Gutzler wrote:
>
>> Hi,
>>
>> what would be the fastest way to change this:
>> [[1,1], [2,3], [1,2], [1,1], [2,1], [3,2]]
>>
>> into this:
>> [[1,1], [2,3], [1,2], [2,1], [3,2]] ?
>>
>> It should delete every coordinate-tuple appearing more than once
>> without changing the order of the other elements.
>>
>> Thx for racking brains,
>> Tom
>>
>
> Dear Thomas,
>
> you can use my unsorted_uniq
>
> http://www.fz-juelich.de/icg/icg-i/idl_icglib/idl_source/idl _html/dbase/download/unsorted_uniq.tar.gz
Thanx, that helps
Tom
|
|
|
Re: UNIQ without SORT [message #34100 is a reply to message #34085] |
Tue, 18 February 2003 00:47  |
R.Bauer
Messages: 1424 Registered: November 1998
|
Senior Member |
|
|
Thomas Gutzler wrote:
> Hi,
>
> what would be the fastest way to change this:
> [[1,1], [2,3], [1,2], [1,1], [2,1], [3,2]]
>
> into this:
> [[1,1], [2,3], [1,2], [2,1], [3,2]] ?
>
> I don't mean: array = array[*,[0, 1, 2, 4, 5]] which would be fast, but
> not very dynamic :)
> It should delete every coordinate-tuple appearing more than once without
> changing the order of the other elements.
>
> Thx for racking brains,
> Tom
>
Dear Thomas,
you can use my unsorted_uniq
http://www.fz-juelich.de/icg/icg-i/idl_icglib/idl_source/idl _html/dbase/download/unsorted_uniq.tar.gz
or as idl binary
http://www.fz-juelich.de/icg/icg-i/idl_icglib/idl_source/idl _html/dbase/download/unsorted_uniq.sav
for further routines and licensing please have a look at
http://www.fz-juelich.de/icg/icg-i/idl_icglib/idl_lib_intro. html
regards
Reimar
--
Reimar Bauer
Institut fuer Stratosphaerische Chemie (ICG-I)
Forschungszentrum Juelich
email: R.Bauer@fz-juelich.de
------------------------------------------------------------ -------
a IDL library at ForschungsZentrum Juelich
http://www.fz-juelich.de/icg/icg-i/idl_icglib/idl_lib_intro. html
============================================================ =======
|
|
|