-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 Hi Tibor,
I've just pushed a new new version of SearchQueryParenthesisedParser, to my branch 'nested_parens_aima'. It uses portions of Peter Norvig's satisfiability library to compute the Conjunctive Normal Form of input queries at parse time. This is significantly more complex in terms of parsing, but it allows for arbitrarily complex input to be dealt with in linear time and constant space without any modification to the search engine. I believe very strongly this is a net win. I've tested this code extensively, both in situ and with unit tests, and have kept the unit tests up to date as I've worked. All tests pass. It's been kwalitee checked and pylint gives my original contribution at least 8/10. I believe it's ready to go into master. Thanks, Joe -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iQIcBAEBCAAGBQJL/cDDAAoJEGh+D3e/PaCrxVEP/1OINLaIp+Gpah1tozk7jrQ9 ZMtBfbvHXVus/BogOW3EgcST5ni8bwj9FlTdGdsGsOPffhcQpE0xtOOXAPjUSR5O X25OAhfrZNtl00XaubiGEV62KENbbFNm0B38Rbpc6m7pYWil9xQwbQh/WsZnWd/g 7oo6erGX2pWdZ3LFPFaMIodToEp5wMnbXXhbXsCywL4SpMG7gP0ONmfGJ0/M08hj aovq3AwqctXSlBasfGI3AghfiLez99i+BVoN+n9zteNks0LZS383udDIy+mqc1Kw qdx5zS/84z4GOScKg2T014+2s3eVn/GDVSXpqwWS10ACKWqF+131CAkJNKda4Gk6 w0EB6q/scIqnVw4FmVVJhI4bIhNHPofzG2H72giyMCWna/eshVpXPZErzkLKEt4O bXv9eAzIFtBmh6xQIX8IXXsgztna0nM6OjC+CRwl1by9VN6TZmnnrvfMI9W5E6tJ mkm3GTuGEgzt68uUyUZ8Vqg974H/ctuiEELEApfN8ofVIP+5pFKX3Fed0zs3seX/ G+aI+9AlC33DEPzmcBFj5EoDcue2QWYDPyl+b9D4yh5oXqQKX+cp+QAbNCrpr8ex dx95WpuaXsds/U6EVQqD2UrSMjYARW9QDrNLaTTDutvi0wmy2kQ/yg4tBM/s6wM8 f5yGu3CFqxsOvUIMlgLx =+4W0 -----END PGP SIGNATURE-----
