From 9cabfbd1d09b41b7b78ebf57a42957ba87ff136f Mon Sep 17 00:00:00 2001 From: Bart Kroon Date: Wed, 7 Sep 2011 22:22:05 +0200 Subject: Made list#unique about 5 times faster using filter(). --- list.vim | 15 +++------------ 1 file changed, 3 insertions(+), 12 deletions(-) diff --git a/list.vim b/list.vim index 44d6b20..ee243d4 100644 --- a/list.vim +++ b/list.vim @@ -6,18 +6,9 @@ " Remove duplicate values from {list} in-place (preserves order). function! xolox#misc#list#unique(list) - let index = 0 - while index < len(a:list) - let value = a:list[index] - let match = index(a:list, value, index+1) - if match >= 0 - call remove(a:list, match) - else - let index += 1 - endif - unlet value - endwhile - return a:list + call reverse(a:list) + call filter(a:list, 'count(a:list, v:val) == 1') + return reverse(a:list) endfunction " Binary insertion (more efficient than calling sort() after each insertion). -- cgit v1.2.3