test: add a seeded bounded SQL query generator - #54
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Emits queries from a bounded grammar — projections,
WHEREwith AND/OR/NOT andIS [NOT] NULL,ORDER BY,LIMIT, andGROUP BY/HAVINGwith aggregates — so the differential tests explore combinations a handwritten corpus would miss.Seeded, so any failure replays exactly. A coverage test asserts 400 queries actually reach every clause rather than emitting trivial selects.
Constructs where this engine and SQLite differ by design are not generated: integer division (SQLite floors it), cross-type comparisons (rejected here, coerced there), and booleans (stored as integers there). Operands always share a type, and aggregate queries always group by the column they project rather than relying on SQLite's bare-column extension.
Closes #46