Eventual-Inc/Daft - CodSpeed

Daft

Blog Docs Changelog

Performance History

Latest Results

fix: allow lazy typed missing files

everettVT/droid-hdf5-stack

1 hour ago

feat: asof_join_aligned distributed (#7177) Re-opens #7107. Same branch and commits, recreated as a fresh PR. Implements the shuffle-skipping execution path for `join_asof(..., _assume_sorted_and_aligned=True)`. - Instead of a separate `AsofJoinAlignedNode`, `AsofJoinNode` takes an `assume_aligned` flag: the aligned path zips input partitions by index (validating partition counts at execution time) and skips sampling + range shuffle entirely. Both paths share the carryover and join-dispatch machinery. - Fixes a latent carryover bug in the shuffle path along the way: the per-bucket `top_n(1)` reduction kept only one row per bucket (the lexicographically extreme `(by, on)` tuple), losing other groups' cross-partition matches. Carryovers are now per-group extreme rows, and each partition's join task receives the extremes of all preceding/following partitions, so matches survive empty and group-sparse partitions. The ≥3-partition tests fail without this and pass with it. - Re-enables the partition-count-mismatch validation test. Note: for very high cardinality `by` keys over many partitions, shipping all per-partition extremes to every join task is O(P²·G) rows worst case; a cumulative per-group merge (O(P·G), but a sequential task chain) is a profile-first follow-up. 🤖 Generated with [Claude Code](https://claude.com/claude-code) --------- Co-authored-by: Colin Ho <colin.ho99@gmail.com> Co-authored-by: Claude Fable 5 <noreply@anthropic.com>

main

4 hours ago

Update src/daft-io/src/lib.rs Co-authored-by: greptile-apps[bot] <165735046+greptile-apps[bot]@users.noreply.github.com>

slade/formatted-errors

4 hours ago

fix: nearest asof join misses the closer candidate for one-sided offers search_nearest offers each right row only to its floor/ceil left rows, and nearest_fill skipped any row already holding a direct match — so the first left row in a gap kept the backward candidate even when forward was strictly closer (left=[593, 597], right=[577, 608]: 593 matched 577, dist 16, instead of 608, dist 15). nearest_fill now reconciles every row against the two nearest distinct neighboring matches in each direction (two levels, because duplicate on-keys share a match and would otherwise shadow the other gap endpoint), keeping the nearer per is_nearer. The aligned suite's nearest differential tests flip from xfail to hard assertions. Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>

euanlimzx:euan/asof-join-aligned-distributed-v2

5 hours ago

Update docstring regarding columns with names matching method params

ben594:4167-with-column-improvements

6 hours ago

Some edge cases for kwargs, added unit tests for empty dict and kwargs

ben594:4167-with-column-improvements

7 hours ago

Merge branch 'main' into codex-sql-read-parquet-ignore-corrupt-files

jackylee-ch:codex-sql-read-parquet-ignore-corrupt-files

17 hours ago

fix: defer file existence checks to open

everettVT/droid-hdf5-stack

1 day ago

Latest Branches

0%

feat: streamline HDF5 file access#7160

2 hours ago

f668037

everettVT/droid-hdf5-stack

0%

fix: Format nested Rust errors as a simplified backtrace in Python#7178

5 hours ago

4bf5696

slade/formatted-errors

0%

feat: asof_join_aligned distributed#7177

19 days ago

9356e21

euanlimzx:euan/asof-join-aligned-distributed-v2

© 2026 CodSpeed Technology

Home Terms Privacy Docs