One way is to use a hash. But it takes a lot of time when number of values is increased.I'm not sure if this is a good answer to your problem, but it may indeed depend on how you store the key-value pairs in you hash. You may be interested in the use of keys as an lvalue.
In reply to Re: How to remove duplicates from a large set of keys
by blazar
in thread How to remove duplicates from a large set of keys
by nite_man
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |