summaryrefslogtreecommitdiffstats
path: root/AUTHORS
diff options
context:
space:
mode:
authorGravatar Kristian Høgsberg 2007-04-12 14:11:20 -0400
committerGravatar Kristian Høgsberg 2007-04-12 14:11:20 -0400
commitfb1570efbf4cb8ff4ef45937408cee43874c863a (patch)
tree63c5bcdc50c0ee377ee51f7a0563578534da2027 /AUTHORS
parentRefactor packet queueing and use for both xmit and recv. (diff)
Wrap receive tail pointer correctly.
Diffstat (limited to '')
0 files changed, 0 insertions, 0 deletions
gan'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