summaryrefslogtreecommitdiffstats
path: root/ChangeLog (follow)
Commit message (Expand)AuthorAgeFilesLines
* Fix build due to incomplete tarball.Gravatar Dan Dennedy 2009-06-301-0/+2
* Update ChangeLog from git log.v2.0.3Gravatar Dan Dennedy 2009-06-291-10/+982
* bump versions, build fixes, and doc updatesGravatar ddennedy 2004-10-301-0/+14
* File doesn't really seem needed. The NEWS file gives a good overview, andGravatar bencollins 2003-07-131-4/+0
* merged weihs branchGravatar ddennedy 2002-10-231-0/+4
* Initial revisionGravatar abombe 1999-12-021-0/+0
ighlight'> 2021-07-26queryparse: remove literal setGravatar Peter McGoron 2-17/+14 2021-07-26queryparse: add function to build SQL queriesGravatar 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-26queryparse: use demorgan's laws to simplify parsed expressionGravatar Peter McGoron 2-1/+17 2021-07-26update README.mdGravatar Peter McGoron 1-0/+10 2021-07-26queryparse: collect literals into set and return itGravatar Peter McGoron 2-16/+22 2021-07-26gitea wants .md suffixes for web renderingGravatar Peter McGoron 2-0/+0 2021-07-26example/query.md: change to what the code actually implementsGravatar Peter McGoron 1-3/+3