44 Commits

Author	SHA1	Message	Date
Jean SIMARD	d1f34f926e	[ci] Add all target to check	2021-03-02 20:48:57 +01:00
mpostma	81f343a46a	add word limit to search queries	2021-01-08 16:23:23 +01:00
mpostma	808be4678a	fix style	2021-01-05 15:21:05 +01:00
mpostma	db64e19b8d	all tests pass	2021-01-05 15:21:05 +01:00
mpostma	b574960755	fix split_query_string	2021-01-05 15:21:05 +01:00
mpostma	c6434f609c	fix indexing length	2021-01-05 15:21:05 +01:00
mpostma	206308c1aa	replace hashset with fst::Set	2021-01-05 15:21:05 +01:00
mpostma	6527d3e492	better separator handling	2021-01-05 15:21:05 +01:00
mpostma	e616b1e356	hard separator offset	2021-01-05 15:21:05 +01:00
mpostma	8843062604	fix indexer tests	2021-01-05 15:21:05 +01:00
mpostma	5e00842087	integration with new tokenizer wip	2021-01-05 15:21:05 +01:00
mpostma	d69180ec67	refactor errors / isolate core/http errors	2020-05-28 16:23:46 +02:00
Kerollmops	bc7b0a38fd	Use fst 0.4.4 in the project	2020-05-22 15:01:55 +02:00
Clément Renault	c18e907f96	Construct a Set using the from_dirty method ... This commit fixes #566 by ensuring that the slice of matches is ordered and deduplicated.	2020-03-30 20:56:30 +02:00
qdequele	559c2f8907	Add stop words on query	2020-02-11 15:28:00 +01:00
Quentin de Quelen	dc6907e748	rebase from master	2020-02-11 15:28:00 +01:00
Clément Renault	a9adbda2cd	Make the engine support non-exact multi-words synonyms	2020-01-22 18:11:58 +01:00
Clément Renault	0b9fe2c072	Introduce the new Query Tree creation supporting more operations	2020-01-22 17:46:46 +01:00
Clément Renault	789e05304c	Replace prints by debug logs	2020-01-21 11:05:34 +01:00
Clément Renault	daffcaf4c6	Make the docids OR operation method conditional	2020-01-19 12:29:06 +01:00
Clément Renault	e44d498c94	Display more debug info for prefix tolerant fetches	2020-01-19 11:07:32 +01:00
Clément Renault	c334d6b7fe	Avoid sorting sorted sequences, prefer using set operations	2020-01-19 10:58:01 +01:00
Clément Renault	9cc3c56c9c	Fix the prefix system	2020-01-16 18:41:27 +01:00
Clément Renault	d7a7560220	Use an union instead of a sort for prefix fetching	2020-01-16 17:09:27 +01:00
Clément Renault	96139da0d2	Reintroduce the distinct search system	2020-01-16 15:55:55 +01:00
Clément Renault	74fa9ee4df	Introduce a better higlighting system	2020-01-16 14:56:16 +01:00
Clément Renault	00336c5154	Reintroduce a basic highlight display	2020-01-16 14:24:45 +01:00
Clément Renault	3912d1ec4b	Improve query parsing and interpretation	2020-01-16 14:11:17 +01:00
Clément Renault	70d4f47f37	Differentiate short words as prefix or exact matches	2020-01-16 12:01:51 +01:00
Clément Renault	9809ded23d	Implement synonym fetching	2020-01-16 11:38:23 +01:00
Clément Renault	5f9a3546e0	Use an union instead of a sort for OR ops	2020-01-15 15:14:24 +01:00
Clément Renault	44fec1b6c9	Cache prefixes of a length of 2	2020-01-14 18:17:52 +01:00
Clément Renault	21c1473e0c	Introduce the distance data	2020-01-14 11:38:04 +01:00
Clément Renault	da8abebfa2	Introduce the query words mapping along with the query tree	2020-01-13 13:29:47 +01:00
Clément Renault	d6c9ba8f08	Store the postings lists	2020-01-09 15:04:53 +01:00
Clément Renault	ec8916bf54	Change the debug outputs	2020-01-09 12:05:39 +01:00
Clément Renault	81c573ec92	Add the raw document IDs to the postings lists	2020-01-08 15:30:43 +01:00
Clément Renault	d724a7659e	Introduce a query tree context struct	2020-01-08 13:37:22 +01:00
Clément Renault	887c212b49	Add more logs about the docids construction	2020-01-08 13:22:42 +01:00
Clément Renault	07937ed6d7	Use the prefix caches	2020-01-08 13:14:07 +01:00
Clément Renault	a262c67ec3	limit the search in the FST	2020-01-08 13:06:12 +01:00
Clément Renault	13ca30c4d8	WIP: Made the query tree traversing support prefix search	2020-01-08 12:02:58 +01:00
Clément Renault	fbcec2975d	wip: Impl a basic tree traversing	2020-01-07 18:24:13 +01:00
Clément Renault	6e1f4af833	wip: Create a tree from query but need to show synonyms	2020-01-07 18:24:13 +01:00