[Date Index] [Thread Index] [Author Index]

Re: Keeping order with Union

• To: mathgroup at smc.vnet.net
• Subject: [mg32648] Re: [mg32590] Keeping order with Union
• From: Ken Levasseur <Kenneth_Levasseur at uml.edu>
• Date: Fri, 1 Feb 2002 16:10:47 -0500 (EST)
• References: <200201300819.DAA29991@smc.vnet.net>
• Sender: owner-wri-mathgroup at wolfram.com

Dave:

When Al Hibbard and I developed our AbstractAlgebra packages (see
http://www.central.edu/eaam.html), we needed exactly such a function.  Al
came up with a good solution.  He called it UnionNoSort and it is in the
Core context of the packages, which you can download for free.

Ken Levasseur

Dave Snead wrote:

> I'd like a function that throws out duplicate entries in a list and keeps
> the
> original list order.  (when it sees 2 equal entries it throws out the one
> that is later in the list).   I'd use Union, but it sometimes changes the
> order of the elements in the list.  What's the tersest way to do this?
> Thanks in advance,
> Dave Snead