improve result aggregation performance

Using a list comprehension is faster than an explicit for loop
FelikZ · May 19, 2016 · 7ad13f5 · 7ad13f5
1 parent 4ea203b
commit 7ad13f5
Showing 1 changed file with 1 addition and 4 deletions.
diff --git a/autoload/pymatcher.py b/autoload/pymatcher.py
@@ -71,10 +71,7 @@ def path_score(line):
     else:
         res = [(path_score(line), line) for line in items]
 
-    #rez.extend([line for score, line in heapq.nlargest(limit, res)])
-    for score, line in heapq.nlargest(limit, res):
-        if score != 0:
-            rez.extend([line])
+    rez.extend([line for score, line in heapq.nlargest(limit, res) if score != 0])
 
     # Use double quoted vim strings and escape \
     vimrez = ['"' + line.replace('\\', '\\\\').replace('"', '\\"') + '"' for line in rez]