4 commits

Author	SHA1	Message	Date
Xymist	7fb8be541a	Reduce lock contention (round 1) ... - Use an async (i.e. unlimited buffer) MPSC channel instead of an Arc<Mutex<Vec>> for storing the scored matches in Sorter - Use Arc<Matcher> instead of Arc<Mutex<Matcher>> for the matcher, as it's not mutated and appears to be threadsafe. This cuts average iteration time (on the benchmarked machine) from 25.98ms to 16.08ms for the ivy_files benchmark.	2022-08-26 16:01:22 +01:00
Xymist	ce28b248fa	Add results to .gitignore	2022-08-26 15:17:23 +01:00
Ade Attwood	e7b7dc1e4c	feat: experimental first rust implementation of libivy	2022-08-25 20:19:01 +01:00
Ade Attwood	3f6149d3e1	feat: add initial implementation of cpp file finder ... This uses lua ffi and a cpp shard library to implement a file finder in cpp so we can use threads more effectively and get better performance.	2022-07-23 08:49:45 +01:00