Re: Deleting duplicates from a list

• To: mathgroup at smc.vnet.net
• Subject: [mg76055] Re: Deleting duplicates from a list
• From: "Drago Ganic" <dganic at vodatel.net>
• Date: Tue, 15 May 2007 05:01:50 -0400 (EDT)
• References: <200705140725.DAA22641@smc.vnet.net> <f29bb9\$pes\$1@smc.vnet.net>

```Hi,
A better name for this function is Distinct[]. Im Version6 this
implementation can also be coded as:

Distinct [x_] := First /@ Tally[x]
and
Distinct [x_, test_] := First /@ Tally[x, test]

Greetings,
Drago

news:f29bb9\$pes\$1 at smc.vnet.net...
> This is the unsorted union problem, which can be efficiently solved
> using Sow and Reap (see Help Browser > Reap > Further Examples)
>
> In[8]:=UnsortedUnion[x_] := Reap[Sow[1, x], _, #1 & ][[2]]
>
> In[9]:=UnsortedUnion[{8, 8, 11, 11, 19}]
>
> Out[9]={8, 11, 19}
>
>
> On 14 mag 2007, at 09:25, Raul Martinez wrote:
>
>> Hi all,
>>
>> I have a list, e.g., {8, 8, 11, 11, 19}. I want to eliminate all
>> duplicates so the list becomes {8, 11, 19}. Can anyone suggest a
>> command that will do this?
>>
>> TIA,
>>
>> Raul Martinez
>>
>
>

```

• Prev by Date: Re: Deleting duplicates from a list
• Next by Date: Re: Converting Binary form to a desired array
• Previous by thread: Re: Deleting duplicates from a list
• Next by thread: Re: Deleting duplicates from a list