On 21 March 2014, lith <[email protected]> wrote:
> > In other words, I'd expect this for example:
> >
> > :echo uniq([1, 2, 3, 3, 2, 2, 1])
> > [1, 2, 3, 2, 1]
>
> I think some of us would be rather surprised if the result weren't
> [1,2,3].
Well, the more experienced among us would know that full (unsorted)
unique would be nice, but expensive. :)
On a side note: how does Vim handle hash keys? It's the exact same
problem; if it's done in less than O(N^2), perhaps the same algorithm
could be used here.
/lcd
--
--
You received this message from the "vim_dev" maillist.
Do not top-post! Type your reply below the text you are replying to.
For more information, visit http://www.vim.org/maillist.php
---
You received this message because you are subscribed to the Google Groups
"vim_dev" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/d/optout.
