Re: Re: rule based program for "Deleting repeated members of a list."
- To: mathgroup at smc.vnet.net
- Subject: [mg82001] Re: [mg81993] Re: rule based program for "Deleting repeated members of a list."
- From: DrMajorBob <drmajorbob at bigfoot.com>
- Date: Tue, 9 Oct 2007 05:35:50 -0400 (EDT)
- References: <fe7j44$qga$1@smc.vnet.net> <3917603.1191869840479.JavaMail.root@m35>
- Reply-to: drmajorbob at bigfoot.com
Union with one argument is the same thing as Union, and it sorts; the OP
didn't want it sorted.
Bobby
On Mon, 08 Oct 2007 01:07:55 -0500, sean_incali <sean_incali at yahoo.com>
wrote:
> How about a simplests way of using intersection, instead of rule
> based.
>
> s = {a, b, c, c, d, e, e, f, g, g, g, h, a, b} // Intersection
> {a, b, c, d, e, f, g, h}
>
>
>
>
> On Oct 6, 2:05 am, mumat <csar... at gmail.com> wrote:
>> Hi,
>>
>> I have a list s={a,b,c,c,d,e,e,f,g,g,g,h,a,b};
>>
>> I need to write a program so that it reads the list and ignors
>> repeated elements; so it outputs the following:
>>
>> RepeatRemover[s]={a,b,c,d,e,f,g,h,a,b};
>>
>> I am looking for a rule-based program to do this!
>>
>> Any help would be greatly appreciated.
>>
>> C.S.
>
>
>
>
--
DrMajorBob at bigfoot.com