
Now that we've established a proper eval in tree, this PR is reboots of our agent loop back to a set of minimal tools and simpler prompts. We should aim to get this branch feeling subjectively competitive with what's on main and then merge it, and build from there. Let's invest in our eval and use it to drive better performance of the agent loop. How you can help: Pick an example, and then make the outcome faster or better. It's fine to even use your own subjective judgment, as our evaluation criteria likely need tuning as well at this point. Focus on making the agent work better in your own subjective experience first. Let's focus on simple/practical improvements to make this thing work better, then determine how we can craft our judgment criteria to lock those improvements in. Release Notes: - N/A --------- Co-authored-by: Max <max@zed.dev> Co-authored-by: Antonio <antonio@zed.dev> Co-authored-by: Agus <agus@zed.dev> Co-authored-by: Richard <richard@zed.dev> Co-authored-by: Max Brunsfeld <maxbrunsfeld@gmail.com> Co-authored-by: Antonio Scandurra <me@as-cii.com> Co-authored-by: Michael Sloan <mgsloan@gmail.com>
836 B
836 B
- A
JOIN
query with conditions on both sides (LHS and RHS) correctly triggers subscription updates when only the LHS table is updated. - Callback functions (
on_insert
,on_update
) are invoked exactly once and in the expected order. - Queries with logically equivalent WHERE conditions (e.g.,
x > 0 and x < 5
vs.0 < x and x < 5
) yield consistent subscription behavior. - Complex disjoint queries that restrict the RHS via additional constraints (e.g.,
u.n != 1
) still properly identify matching LHS updates. - Type inference and expression normalization correctly handle literals on the left-hand side of binary operations in WHERE clauses.
- Physical execution plans normalize expressions like
3 < l.x
intol.x > 3
with appropriate operator inversion (Lt ↔ Gt
,Lte ↔ Gte
), maintaining logical correctness.