/

	Commit message (Collapse)	Author	Files	Lines
2021-07-27	natargs: return None when no function handles an argument	Peter McGoron	1	-0/+2

2021-07-27	remove unused functions	Peter McGoron	1	-15/+1

2021-07-27	queryparse: fix NOT	Peter McGoron	1	-7/+8
	NOT queries are now two-step: the list is queries and then all elements in the cards table that are also in the query are discarded.
2021-07-26	add command line option for search	Peter McGoron	2	-12/+28
	As of right now NOT queries do not work correctly for cards with more than one tag.
2021-07-26	natargs: add missing import	Peter McGoron	1	-0/+2

2021-07-26	queryparse: remove literal set	Peter McGoron	2	-17/+14

2021-07-26	queryparse: add function to build SQL queries	Peter McGoron	2	-1/+73
	SQLite allows for UNIONs and INTERSECTIONs between SELECT statements, but it does not support grouping them. By recursively applying DeMorgan's laws, the parser can reduce the parse tree to only * Literals * NOT literals (i.e. "all items not belonging to this tag") * ANDs * ORs What SQLite /can/ do is have SELECT statements come from other SELECT statements. A query like (X & Y & Z) \| (A & B & C) in pseudo-SQLite becomes SELECT * FROM ( SELECT * FROM tbl WHERE name IN X INTERSECTION SELECT * FROM tbl WHERE name IN Y INTERSECTION SELECT * FROM tbl WHERE name IN Z ) UNION SELECT * FROM ( SELECT * FROM tbl WHERE name IN A INTERSECTION SELECT * FROM tbl WHERE name IN B INTERSECTION SELECT * FROM tbl WHERE name IN C ) One future optimization would be to group all literals at a certain level with each other, so that there are less direct queries to the entire tag table.
2021-07-26	queryparse: use demorgan's laws to simplify parsed expression	Peter McGoron	2	-1/+17

2021-07-26	update README.md	Peter McGoron	1	-0/+10

2021-07-26	queryparse: collect literals into set and return it	Peter McGoron	2	-16/+22

2021-07-26	gitea wants .md suffixes for web rendering	Peter McGoron	2	-0/+0

2021-07-26	example/query.md: change to what the code actually implements	Peter McGoron	1	-3/+3