src/eventloop.c: redo the undo (git-svn virgin at the controls) - libraw1394 - Fork of libraw1394 that allows for externally managed buffers

diff options

author	ddennedy	2008-03-27 21:32:51 +0000
committer	ddennedy	2008-03-27 21:32:51 +0000
commit	342b660afa618b5b4d4e7194854fdd7895fcd1e4 (patch)
tree	9928bedfcda1253996f394c309b07ea03151e5e1 /debian
parent	eventloop.c: apply patch from Jonas Bonn to retrty read when failed with EINTR. (diff)

src/eventloop.c: redo the undo (git-svn virgin at the controls)

git-svn-id: svn://svn.linux1394.org/libraw1394/trunk@179 53a565d1-3bb7-0310-b661-cf11e63c67ab

Diffstat (limited to '')

0 files changed, 0 insertions, 0 deletions

ass='logmsg'> 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 expression

Peter McGoron 2-1/+17 2021-07-26update README.md

Peter McGoron 1-0/+10 2021-07-26queryparse: collect literals into set and return it

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

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

Peter McGoron 1-3/+3


context:
space:
mode: