vortex-data/vortex - CodSpeed

vortex

Blog Docs Changelog

Performance History

Latest Results

docs: guide readers through versioning explanations Signed-off-by: "Connor Tsui" <connor.tsui20@gmail.com>

ct/versioning-docs

34 minutes ago

docs: tighten versioning prose and restore compatibility matrix Signed-off-by: "Connor Tsui" <connor.tsui20@gmail.com>

ct/versioning-docs

43 minutes ago

docs: organize versioning around guarantees and design Signed-off-by: "Connor Tsui" <connor.tsui20@gmail.com>

ct/versioning-docs

1 hour ago

docs: preserve versioning proof for separate review Signed-off-by: "Connor Tsui" <connor.tsui20@gmail.com>

ct/versioning-proof-draft

2 hours ago

docs: move versioning proof out of documentation PR Signed-off-by: "Connor Tsui" <connor.tsui20@gmail.com>

ct/versioning-docs

2 hours ago

Make ScalarFn array validity lazy when the function defines a validity expression Previously ValidityVTable<ScalarFn> always eagerly executed the validity expression via the legacy session. Now, when the scalar function provides a validity expression over its inputs, the expression is converted into a lazy ScalarFn array DAG instead: Literal nodes become ConstantArrays, ArrayExpr leaves unwrap to the child arrays they hold, and interior nodes become lazy ScalarFn arrays. Constant results are folded back into AllValid/AllInvalid via child_to_validity. Functions that do not define a validity expression (e.g. Kleene logic and/or, where validity depends on the computed values) keep the eager path. The erased fallback for these is is_not_null over the expression itself, so a lazy representation would be self-referential: resolving the validity of the inner node spawns another is_not_null DAG, which recurses without ever shrinking (this manifested as a stack overflow in element-wise execution paths). ScalarFnRef::validity_opt is added to expose whether a function defines its own validity expression. Signed-off-by: Joe Isaacs <joe.isaacs@live.co.uk> Co-Authored-By: Claude Fable 5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01VPQ7dfZtijfrsjAipwXvEj

claude/cool-bardeen-l8jlsy-4-lazy-scalarfn-validity

14 hours ago

perf: pack primitive comparison results in fixed-size chunks Reuse collect_bool_word for primitive comparison bitmaps while preserving execution-context allocation and comparison semantics. Cover bitmap boundaries, all primitive types, nulls, and constant operand orientation. Signed-off-by: "Matt Katz" <mhkatz97@gmail.com>

mk/primitive-compare-bitmap

2 days ago

docs: explain crate versioning and editions Signed-off-by: "Connor Tsui" <connor.tsui20@gmail.com>

ct/versioning-docs

2 days ago

Latest Branches

-10%

docs: explain versioning guarantees and format evolution#9947

38 minutes ago

8afbe4f

ct/versioning-docs

-2%

docs: versioning model and proofs (draft)#9950

2 hours ago

4595fc3

ct/versioning-proof-draft

-6%

Make ScalarFn array validity lazy when the function defines a validity expression#8336

3 months ago

70cdf0c

claude/cool-bardeen-l8jlsy-4-lazy-scalarfn-validity

© 2026 CodSpeed Technology

Home Terms Privacy Docs