I have bunch of ints that I need to insert into set and read in increasing 
order avoiding duplicates. They are produced at a different time so I don't 
have them in a seq.

I can probably knock-up a quick SortedSeq as a distinct seq in my code. I have 
a good capacity estimate for my sue case, so performance would be ok. However, 
it sounds as rather common problem so I assume Nim has solution for it, I just 
can't find it.

Any ideas?

Thank you

Reply via email to