MathGroup Archive 2002

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

Search the Archive

Re: Keeping order with Union


I think the following linear time algorithm was Allen Hayes's idea:

removeDups[l_] := Block[{i},
  i[n_] := (i[n] = Sequence[]; n);
  i /@ l]


--- \/   FROM Dave Snead AT 02.01.30 08:37 (Today)   \/ ---

> 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
>
>
>
>



  • Prev by Date: Re: Keeping order with Union
  • Next by Date: Re: mice wheels
  • Previous by thread: Re: Keeping order with Union
  • Next by thread: Re: Keeping order with Union