Well, I don't know if a hashtable is exactly what I need since I'm not 100
percent familiar with that kind of datastructure.

But what I do need is a function that feeds in a long list of delminated
data and parses out one copy of each unique value (where each value might be
repeated several times).

If I have a list of (2,2,1,3,4,1,2,1)

How do I get (2,1,3,4) // order isn't important // ?

You ever do anything like this? Sample code to share? A suggested algorithm?

(Actually, as I write this, an idea springs to mind, but I'll post anyway in
case there's a better idea out there or something I can learn from).

H.

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Howard Owens
Internet Operations Coordinator
Ventura County Star / E.W. Scripps Co.
www.venturacountystar.com
[EMAIL PROTECTED]
AIM: GoCatGo1956
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~


[Todays Threads] [This Message] [Subscription] [Fast Unsubscribe] [User Settings]

Reply via email to