On 21 March 2014, Cade Forester <ahx2...@gmail.com> wrote: > > How about separating it from sort()? That is, an uniq() > > function that would remove duplicates from an already sorted list > > (results would be undefined if the input list is not sorted). That > > would be consistent with how uniq(1) works on UNIX. > > This patch add uniq() function. uniq(list) will remove copies of > repeated adjacent items
Excellent. But now f_sort() and f_uniq() are identical, except at the very end. How about merging them in a single function, and making f_sort() and f_uniq() wrappers to that. /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 vim_dev+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.