Eventual-Inc/Daft - CodSpeed

Daft

Blog Docs Changelog

Performance History

Latest Results

style(droid): fix ruff docstring and formatting issues

everettVT/droid-hdf5-stack

5 minutes ago

feat(droid): add scene filtering, trajectory schema, and HF classifications Extend the DROID dataset helpers with explicit trajectory dtypes, filter_scenes joining HF-hosted scene classifications, simplified camera_frames validation, docs/examples, and an upload script for the Parquet mirror on Hugging Face.

everettVT/droid-hdf5-stack

2 hours ago

fix the io test

slade/formatted-errors

3 hours ago

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

Lucas61000:issue-7180

3 hours ago

slade/formatted-errors

5 hours ago

fix: allow lazy typed missing files

everettVT/droid-hdf5-stack

8 hours 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

10 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

10 hours ago

Latest Branches

0%

feat: streamline HDF5 file access#7160

59 minutes ago

7386cd6

everettVT/droid-hdf5-stack

0%

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

3 hours ago

78b3187

slade/formatted-errors

0%

feat(scan): expose StorageConfig.multiline_display() to Python#7181

4 hours ago

21b1ed2

Lucas61000:issue-7180

© 2026 CodSpeed Technology

Home Terms Privacy Docs