allow sorting to be canceled

this removes all left over UI lag

src/lib.rs

@@ -12,6 +12,7 @@ use crate::worker::Woker;
 pub use nucleo_matcher::{chars, Matcher, MatcherConfig, Utf32Str};
 
 mod boxcar;
+mod par_sort;
 mod pattern;
 mod utf32_string;
 mod worker;

src/worker.rs

@@ -7,6 +7,7 @@ use nucleo_matcher::MatcherConfig;
 use parking_lot::Mutex;
 use rayon::{prelude::*, ThreadPool};
 
+use crate::par_sort::par_quicksort;
 use crate::pattern::{self, MultiPattern};
 use crate::{boxcar, Match};
 
@@ -200,14 +201,17 @@ impl<T: Sync + Send + 'static> Woker<T> {
                 });
         }
 
-        if self.canceled.load(atomic::Ordering::Relaxed) {
-            self.was_canceled = true;
-        } else {
-            // TODO: cancel sort in progress?
-            self.matches.par_sort_unstable_by(|match1, match2| {
-                match2.score.cmp(&match1.score).then_with(|| {
-                    if match1.idx == u32::MAX || match2.idx == u32::MAX {
-                        return match1.idx.cmp(&match2.idx);
+        let canceled = par_quicksort(
+            &mut self.matches,
+            |match1, match2| {
+                if match1.score > match2.score {
+                    return true;
+                }
+                if match1.idx == u32::MAX {
+                    return false;
+                }
+                if match2.idx == u32::MAX {
+                    return true;
                 }
                 // the tie breaker is comparitevly rarely needed so we keep it
                 // in a branch especially because we need to access the items
@@ -224,16 +228,23 @@ impl<T: Sync + Send + 'static> Woker<T> {
                     .iter()
                     .map(|haystack| haystack.len() as u32)
                     .sum();
-                    (len1, match1.idx).cmp(&(len2, match2.idx))
-                })
-            });
-            // let old = self.matches.clone();
+                if len1 == len2 {
+                    match1.idx < match2.idx
+                } else {
+                    len1 < len2
+                }
+            },
+            &self.canceled,
+        );
+
+        if canceled {
+            self.was_canceled = true;
+        } else {
             self.matches
                 .truncate(self.matches.len() - take(self.unmatched.get_mut()) as usize);
-        }
-
             if self.should_notify.load(atomic::Ordering::Acquire) {
                 (self.notify)();
             }
         }
     }
+}