pond-ts 0.26.0 → 0.28.0

package/CHANGELOG.md

@@ -7,7 +7,9 @@ The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.1.0/).
 file covers both packages. Pre-1.0: minor bumps may include new features and
 type-level changes; patch bumps are strictly additive.
 
-[Unreleased]: https://github.com/pjm17971/pond-ts/compare/v0.26.0...HEAD
+[Unreleased]: https://github.com/pjm17971/pond-ts/compare/v0.28.0...HEAD
+[0.28.0]: https://github.com/pjm17971/pond-ts/compare/v0.27.0...v0.28.0
+[0.27.0]: https://github.com/pjm17971/pond-ts/compare/v0.26.0...v0.27.0
 [0.26.0]: https://github.com/pjm17971/pond-ts/compare/v0.25.0...v0.26.0
 [0.25.0]: https://github.com/pjm17971/pond-ts/compare/v0.24.0...v0.25.0
 [0.24.0]: https://github.com/pjm17971/pond-ts/compare/v0.23.0...v0.24.0
@@ -20,7 +22,44 @@ type-level changes; patch bumps are strictly additive.
 
 ## [Unreleased]
 
-## [0.26.0] — 2026-06-15
+## [0.28.0] — 2026-06-17
+
+### Added
+
+- **`TimeSeries.rollingByColumn(col, { radius }, mapping)` — windowed value-axis
+  aggregation.** The sliding-window sibling of `byColumn`: slides a centered
+  `±radius` window along a **non-decreasing** numeric column and reduces it at
+  every row, returning one record per row (positionally aligned with the
+  series). Where `byColumn` collapses rows into disjoint value-bins (the
+  value-axis analogue of `aggregate`), `rollingByColumn` is the value-axis
+  analogue of `rolling`. Built for windowed-percentile bands over a derived axis
+  (e.g. a spread band over cumulative distance). A missing/non-finite axis row is
+  excluded from every window and emits each reducer's empty value. O(n) two-pointer
+  sweep. See `docs/notes/rolling-by-column.md`.
+- **`TimeSeries.withColumn(name, values)` — attach a computed numeric column.**
+  Appends a `Float64Array` / `(number | undefined)[]` as a new `number` column
+  (the schema type widens to include it), so a derived array — cumulative
+  distance, speed, gradient — can re-enter the pond pipeline as a real column
+  that `aggregate` / `byColumn` / `rollingByColumn` / `column(name)` can
+  reference. Existing key + value columns are shared by reference (zero-copy);
+  only the new column is added. `values` must match `series.length`; defined
+  cells are validated against the numeric intake contract (**non-finite is
+  rejected** — pass `undefined` for a missing cell, not `NaN`).
+
+### Added
+
+- **`TimeSeries.byColumn(col, { width, origin? } | { edges }, mapping)` —
+  value-axis aggregation.** Where `aggregate` buckets the temporal key,
+  `byColumn` buckets rows by the **value** of a numeric column and reduces each
+  bin, returning an ordered array of `{ start, end, ...aggregates }` records
+  (one per bin) — not a `TimeSeries`, since value-bins (distance / power ranges)
+  aren't time-indexed. `{ width }` gives even bins emitted contiguously from the
+  lowest to highest occupied bin (monotonic source → splits / profile;
+  non-monotonic → histogram); `{ edges }` gives explicit ascending bins (e.g.
+  power zones). Reuses the reducer mapping + non-finite policy. Rows whose bin
+  value is missing / non-finite (or, for `edges`, out of range) are dropped;
+  empty bins emit the reducer's empty value; a non-finite / wrong-kind reducer
+  result throws `ValidationError`. See `docs/notes/bycolumn-value-axis.md`.
 
 ### Changed
 
@@ -36,7 +75,7 @@ type-level changes; patch bumps are strictly additive.
   - **Behavior note — `array` columns:** an identity-comparing reducer (`keep`,
     or a custom reducer using `===` on the cell) on an `array`-kind source
     column now compares the value stored in the column, not the original object
-    reference passed at construction. Two rows given the *same* array object
+    reference passed at construction. Two rows given the _same_ array object
     therefore read as distinct. Scalar columns (number / string / boolean) are
     unaffected. A non-finite or wrong-kind reducer result is still rejected with
     a `ValidationError`, exactly as the constructor's intake did.

package/dist/batch/by-column.d.ts

@@ -0,0 +1,29 @@
+import type { ColumnSchema, ColumnarStore } from '../columnar/index.js';
+import type { ColumnValue } from '../schema/index.js';
+import type { AggregateColumnSpec } from './aggregate-columns.js';
+/**
+ * Binning for {@link TimeSeries.byColumn}: even-`width` bins (optionally shifted
+ * by `origin`, default 0) or explicit ascending `edges`. See
+ * `docs/notes/bycolumn-value-axis.md`.
+ */
+export type BinSpec = {
+    width: number;
+    origin?: number;
+} | {
+    edges: readonly number[];
+};
+/** One value-bin's record: its `[start, end)` range plus the mapped aggregates. */
+export type BinRecord = {
+    start: number;
+    end: number;
+} & Record<string, ColumnValue | undefined>;
+/**
+ * Value-axis aggregation runtime. Buckets the store's rows by the value of
+ * `binColName` and reduces each bin via `columnSpecs`, returning one
+ * {@link BinRecord} per bin in ascending order. Reads straight off the columnar
+ * store (no event materialization); rows whose bin value is missing / non-finite
+ * (or, for `edges`, out of range) contribute to no bin. Empty bins emit each
+ * reducer's empty value, like an empty `aggregate` bucket.
+ */
+export declare function computeByColumn(store: ColumnarStore<ColumnSchema>, binColName: string, spec: BinSpec, columnSpecs: ReadonlyArray<AggregateColumnSpec>): BinRecord[];
+//# sourceMappingURL=by-column.d.ts.map

package/dist/batch/by-column.js

@@ -0,0 +1,166 @@
+import { bucketStateFor } from '../reducers/index.js';
+// Guards a `width` spec from an accidental explosion (e.g. a sub-unit width over
+// a huge range) that would allocate millions of empty output records.
+const MAX_WIDTH_BINS = 1_000_000;
+/**
+ * Value-axis aggregation runtime. Buckets the store's rows by the value of
+ * `binColName` and reduces each bin via `columnSpecs`, returning one
+ * {@link BinRecord} per bin in ascending order. Reads straight off the columnar
+ * store (no event materialization); rows whose bin value is missing / non-finite
+ * (or, for `edges`, out of range) contribute to no bin. Empty bins emit each
+ * reducer's empty value, like an empty `aggregate` bucket.
+ */
+export function computeByColumn(store, binColName, spec, columnSpecs) {
+    const binCol = store.columns.get(binColName);
+    if (binCol === undefined) {
+        throw new RangeError(`byColumn: unknown column '${binColName}'`);
+    }
+    if (binCol.kind !== 'number') {
+        throw new TypeError(`byColumn: column '${binColName}' must be a number column (got '${binCol.kind}')`);
+    }
+    // `start` / `end` carry the bin range in every record, so a mapping output
+    // can't claim them (it would silently overwrite the range).
+    for (const s of columnSpecs) {
+        if (s.output === 'start' || s.output === 'end') {
+            throw new RangeError(`byColumn: output name '${s.output}' is reserved for the bin range`);
+        }
+    }
+    const sourceCols = columnSpecs.map((s) => store.columns.get(s.source));
+    const n = store.length;
+    // Resolve the bin assignment + the [start, end) of a given bin index.
+    const usesEdges = 'edges' in spec;
+    let binOf;
+    let rangeOf;
+    if (usesEdges) {
+        const edges = spec.edges;
+        if (edges.length < 2) {
+            throw new RangeError('byColumn: edges must have at least 2 entries');
+        }
+        for (let i = 0; i < edges.length; i += 1) {
+            if (!Number.isFinite(edges[i])) {
+                throw new RangeError(`byColumn: edges[${i}] is not finite`);
+            }
+            if (i > 0 && edges[i] <= edges[i - 1]) {
+                throw new RangeError('byColumn: edges must be strictly ascending');
+            }
+        }
+        const last = edges.length - 1;
+        binOf = (v) => {
+            if (v < edges[0] || v >= edges[last])
+                return NaN; // out of range → drop
+            // rightmost edge <= v, clamped to a valid bin [0, last)
+            let lo = 0;
+            let hi = last; // bins are [0, last)
+            while (lo < hi) {
+                const mid = (lo + hi + 1) >>> 1;
+                if (edges[mid] <= v)
+                    lo = mid;
+                else
+                    hi = mid - 1;
+            }
+            return lo;
+        };
+        rangeOf = (i) => ({ start: edges[i], end: edges[i + 1] });
+    }
+    else {
+        const width = spec.width;
+        const origin = spec.origin ?? 0;
+        if (!Number.isFinite(width) || width <= 0) {
+            throw new RangeError('byColumn: width must be a positive finite number');
+        }
+        if (!Number.isFinite(origin)) {
+            throw new RangeError('byColumn: origin must be finite');
+        }
+        binOf = (v) => {
+            let bin = Math.floor((v - origin) / width);
+            // `floor((v−origin)/width)` (division) and the emitted boundary
+            // `origin + i*width` (multiplication) round independently, so for
+            // fractional widths a value can land just outside its floored bin's
+            // `[start, end)` (e.g. width 0.1, v = −3*0.1 → bin −4 whose end *is* v).
+            // Nudge the bin so `v ∈ [origin + bin*width, origin + (bin+1)*width)` —
+            // a ≤1-step correction for normal inputs. The counter caps the loop so a
+            // collapsed range (origin/width beyond float precision) can't spin; emit's
+            // representability check then rejects that bin.
+            let guard = 0;
+            while (v < origin + bin * width && guard++ < 4)
+                bin -= 1;
+            while (v >= origin + (bin + 1) * width && guard++ < 4)
+                bin += 1;
+            return bin;
+        };
+        rangeOf = (i) => ({
+            start: origin + i * width,
+            end: origin + (i + 1) * width,
+        });
+    }
+    // Scatter: one bucket-state set per occupied bin index.
+    const states = new Map();
+    let minBin = Infinity;
+    let maxBin = -Infinity;
+    for (let i = 0; i < n; i += 1) {
+        const bv = binCol.read(i);
+        if (typeof bv !== 'number' || !Number.isFinite(bv))
+            continue;
+        const bin = binOf(bv);
+        if (Number.isNaN(bin))
+            continue; // edges out-of-range (width bins may be negative)
+        let cells = states.get(bin);
+        if (cells === undefined) {
+            cells = columnSpecs.map((s) => bucketStateFor(s.reducer));
+            states.set(bin, cells);
+        }
+        for (let c = 0; c < columnSpecs.length; c += 1) {
+            cells[c].add(sourceCols[c].read(i));
+        }
+        if (bin < minBin)
+            minBin = bin;
+        if (bin > maxBin)
+            maxBin = bin;
+    }
+    const out = [];
+    const emit = (binIndex) => {
+        const { start, end } = rangeOf(binIndex);
+        // Every emitted bin must be a representable half-open `[start, end)`. A safe
+        // bin INDEX doesn't guarantee representable BOUNDARIES: at extreme
+        // magnitudes `origin + i*width` can collapse (`start === end`, e.g.
+        // origin 1e20 + width 1) or overflow (`end === Infinity`, e.g. width 1e308).
+        // (Edges are pre-validated finite + strictly ascending, so this only ever
+        // fires on a pathological width/origin.)
+        if (!Number.isFinite(start) || !Number.isFinite(end) || end <= start) {
+            throw new RangeError(`byColumn: bin [${start}, ${end}) is not a representable range — the origin/width magnitude exceeds float precision; use a larger width or explicit edges`);
+        }
+        const cells = states.get(binIndex);
+        const rec = { start, end };
+        for (let c = 0; c < columnSpecs.length; c += 1) {
+            // Occupied bin → that bin's own accumulated snapshot. Empty bin → a FRESH
+            // empty snapshot per bin (not a cached/shared value): array-kind reducers
+            // would otherwise alias one `[]` across bins, and a custom reducer's empty
+            // is `fn([])` which `aggregate` evaluates per empty bucket — match that.
+            rec[columnSpecs[c].output] = cells
+                ? cells[c].snapshot()
+                : bucketStateFor(columnSpecs[c].reducer).snapshot();
+        }
+        out.push(rec);
+    };
+    if (usesEdges) {
+        const binCount = spec.edges.length - 1;
+        for (let b = 0; b < binCount; b += 1)
+            emit(b);
+    }
+    else if (states.size > 0) {
+        // A finite-but-huge value can floor to a bin index past the safe-integer
+        // range (or to ±Infinity on overflow); the emit loop's `b += 1` would then
+        // never advance. Reject it rather than spin.
+        if (!Number.isSafeInteger(minBin) || !Number.isSafeInteger(maxBin)) {
+            throw new RangeError('byColumn: the data range and width produce a bin index outside the safe integer range; use a larger width');
+        }
+        const binCount = maxBin - minBin + 1;
+        if (binCount > MAX_WIDTH_BINS) {
+            throw new RangeError(`byColumn: width produces ${binCount} bins (> ${MAX_WIDTH_BINS}); use a larger width or explicit edges`);
+        }
+        for (let b = minBin; b <= maxBin; b += 1)
+            emit(b);
+    }
+    return out;
+}
+//# sourceMappingURL=by-column.js.map

package/dist/batch/operators/column-builders.d.ts

@@ -2,9 +2,12 @@ import { type Column } from '../../columnar/index.js';
 /**
  * Build a typed {@link Column} from a per-row value array, dispatching on the
  * column's `kind`. An `undefined` cell becomes missing (its validity bit is
- * left unset, so `read(i)` returns `undefined`). Numeric arrays reject
- * non-finite values at construction (`float64ColumnFromArray`) — packed
- * numeric columns stay NaN-free.
+ * left unset, so `read(i)` returns `undefined`). These builders do **not**
+ * enforce the intake contract: `float64ColumnFromArray` *stores* a non-finite
+ * number (flagging the column non-finite for the guarded reducer path) rather
+ * than rejecting it, and the `*FromArray` builders coerce a kind mismatch to a
+ * missing cell. A caller that must uphold intake (finite-or-missing, no NaN in
+ * a packed numeric column) calls {@link assertColumnValuesMatchKind} first.
  *
  * This is the shared form of the kind→builder dispatch that `fill`
  * (`buildFilledColumn`), `map` (its inline builder), and `collapse`

package/dist/batch/operators/column-builders.js

@@ -3,9 +3,12 @@ import { ValidationError } from '../../core/errors.js';
 /**
  * Build a typed {@link Column} from a per-row value array, dispatching on the
  * column's `kind`. An `undefined` cell becomes missing (its validity bit is
- * left unset, so `read(i)` returns `undefined`). Numeric arrays reject
- * non-finite values at construction (`float64ColumnFromArray`) — packed
- * numeric columns stay NaN-free.
+ * left unset, so `read(i)` returns `undefined`). These builders do **not**
+ * enforce the intake contract: `float64ColumnFromArray` *stores* a non-finite
+ * number (flagging the column non-finite for the guarded reducer path) rather
+ * than rejecting it, and the `*FromArray` builders coerce a kind mismatch to a
+ * missing cell. A caller that must uphold intake (finite-or-missing, no NaN in
+ * a packed numeric column) calls {@link assertColumnValuesMatchKind} first.
  *
  * This is the shared form of the kind→builder dispatch that `fill`
  * (`buildFilledColumn`), `map` (its inline builder), and `collapse`

package/dist/batch/rolling-by-column.d.ts

@@ -0,0 +1,36 @@
+import type { ColumnSchema, ColumnarStore } from '../columnar/index.js';
+import type { ColumnValue } from '../schema/index.js';
+import type { AggregateColumnSpec } from './aggregate-columns.js';
+/**
+ * Window spec for {@link TimeSeries.rollingByColumn}: a **centered** window of
+ * half-width `radius`, in the axis column's own units. The window for a row is
+ * every row whose axis value lies within `±radius` of it. See
+ * `docs/notes/rolling-by-column.md`.
+ */
+export type WindowSpec = {
+    radius: number;
+};
+/** One windowed record: the mapped aggregates over the window centered at a row. */
+export type WindowRecord = Record<string, ColumnValue | undefined>;
+/**
+ * Windowed value-axis aggregation runtime — the sliding-window sibling of
+ * {@link computeByColumn}. For each row, reduces (via `columnSpecs`) the rows
+ * whose `axisColName` value lies within `±spec.radius` of that row's value,
+ * returning one {@link WindowRecord} per row, **positionally aligned with the
+ * store** (`out[i]` is the window centered at row `i`).
+ *
+ * The axis column must be **non-decreasing** — that ordering is what makes a
+ * sliding window meaningful (vs `byColumn`'s order-free group-by) and is what
+ * lets the window advance as a single O(n) two-pointer rather than a per-row
+ * range scan. A row whose axis value is missing / non-finite can't be placed in
+ * the ordering: it is excluded from every window, and its own output slot gets
+ * each reducer's empty snapshot (so the result stays positionally aligned). The
+ * reducer non-finite policy still applies to the *source* columns.
+ *
+ * Reads straight off the columnar store (`Column.read(i)`, no event
+ * materialization). Uses `rollingStateFor` (add/remove/snapshot) rather than the
+ * append-only `bucketStateFor`, because the window is a moving multiset; the two
+ * pointers `add` rows entering the right edge and `remove` rows leaving the left.
+ */
+export declare function computeRollingByColumn(store: ColumnarStore<ColumnSchema>, axisColName: string, spec: WindowSpec, columnSpecs: ReadonlyArray<AggregateColumnSpec>): WindowRecord[];
+//# sourceMappingURL=rolling-by-column.d.ts.map

package/dist/batch/rolling-by-column.js

@@ -0,0 +1,102 @@
+import { rollingStateFor } from '../reducers/index.js';
+/**
+ * Windowed value-axis aggregation runtime — the sliding-window sibling of
+ * {@link computeByColumn}. For each row, reduces (via `columnSpecs`) the rows
+ * whose `axisColName` value lies within `±spec.radius` of that row's value,
+ * returning one {@link WindowRecord} per row, **positionally aligned with the
+ * store** (`out[i]` is the window centered at row `i`).
+ *
+ * The axis column must be **non-decreasing** — that ordering is what makes a
+ * sliding window meaningful (vs `byColumn`'s order-free group-by) and is what
+ * lets the window advance as a single O(n) two-pointer rather than a per-row
+ * range scan. A row whose axis value is missing / non-finite can't be placed in
+ * the ordering: it is excluded from every window, and its own output slot gets
+ * each reducer's empty snapshot (so the result stays positionally aligned). The
+ * reducer non-finite policy still applies to the *source* columns.
+ *
+ * Reads straight off the columnar store (`Column.read(i)`, no event
+ * materialization). Uses `rollingStateFor` (add/remove/snapshot) rather than the
+ * append-only `bucketStateFor`, because the window is a moving multiset; the two
+ * pointers `add` rows entering the right edge and `remove` rows leaving the left.
+ */
+export function computeRollingByColumn(store, axisColName, spec, columnSpecs) {
+    const axisCol = store.columns.get(axisColName);
+    if (axisCol === undefined) {
+        throw new RangeError(`rollingByColumn: unknown column '${axisColName}'`);
+    }
+    if (axisCol.kind !== 'number') {
+        throw new TypeError(`rollingByColumn: column '${axisColName}' must be a number column (got '${axisCol.kind}')`);
+    }
+    const { radius } = spec;
+    if (!Number.isFinite(radius) || radius <= 0) {
+        throw new RangeError('rollingByColumn: radius must be a positive finite number');
+    }
+    const sourceCols = columnSpecs.map((s) => store.columns.get(s.source));
+    const n = store.length;
+    // Compact the finite-axis rows in row order: `ax[k]` is the axis value, `idx[k]`
+    // the real row index. Validate non-decreasing — a sliding window over an
+    // unsorted axis is meaningless, and a descending step would break the
+    // monotonic two-pointer below (it only ever moves `lo`/`hi` to the right).
+    const ax = new Float64Array(n);
+    const idx = new Int32Array(n);
+    let m = 0;
+    for (let i = 0; i < n; i += 1) {
+        const av = axisCol.read(i);
+        if (typeof av !== 'number' || !Number.isFinite(av))
+            continue;
+        if (m > 0 && av < ax[m - 1]) {
+            throw new RangeError(`rollingByColumn: axis column '${axisColName}' must be non-decreasing; row ${i} (${av}) < previous (${ax[m - 1]})`);
+        }
+        ax[m] = av;
+        idx[m] = i;
+        m += 1;
+    }
+    // One shared rolling state per output column, maintained incrementally across
+    // the whole sweep — this is what makes it O(n) rather than O(n · window).
+    const states = columnSpecs.map((s) => rollingStateFor(s.reducer));
+    const specCount = columnSpecs.length;
+    const out = new Array(n);
+    let lo = 0;
+    let hi = 0; // the window currently holds compact positions [lo, hi)
+    for (let i = 0; i < n; i += 1) {
+        const av = axisCol.read(i);
+        if (typeof av !== 'number' || !Number.isFinite(av)) {
+            // No axis position → empty window. A FRESH empty snapshot per row (per
+            // spec), not a shared/cached value: an array-kind reducer would otherwise
+            // alias one `[]` across rows. Matches byColumn's empty-bin handling.
+            const rec = {};
+            for (let c = 0; c < specCount; c += 1) {
+                rec[columnSpecs[c].output] = rollingStateFor(columnSpecs[c].reducer).snapshot();
+            }
+            out[i] = rec;
+            continue;
+        }
+        const wlo = av - radius;
+        const whi = av + radius;
+        // Expand the right edge: add finite-axis rows with `ax ≤ center + radius`.
+        while (hi < m && ax[hi] <= whi) {
+            const r = idx[hi];
+            for (let c = 0; c < specCount; c += 1) {
+                states[c].add(r, sourceCols[c].read(r));
+            }
+            hi += 1;
+        }
+        // Contract the left edge: drop rows with `ax < center − radius`. The center
+        // row itself satisfies `wlo ≤ av ≤ whi`, so `lo` never passes it (`lo < hi`
+        // always holds here) and the window is non-empty.
+        while (lo < hi && ax[lo] < wlo) {
+            const r = idx[lo];
+            for (let c = 0; c < specCount; c += 1) {
+                states[c].remove(r, sourceCols[c].read(r));
+            }
+            lo += 1;
+        }
+        const rec = {};
+        for (let c = 0; c < specCount; c += 1) {
+            rec[columnSpecs[c].output] = states[c].snapshot();
+        }
+        out[i] = rec;
+    }
+    return out;
+}
+//# sourceMappingURL=rolling-by-column.js.map

package/dist/batch/time-series.d.ts

@@ -1,5 +1,7 @@
-import type { AlignSchema, MaterializeSchema, ArrayAggregateAppendSchema, ArrayAggregateReplaceSchema, ArrayColumnNameForSchema, ArrayExplodeAppendSchema, ArrayExplodeReplaceSchema, BaselineSchema, AggregateReducer, AggregateSchema, CollapseSchema, EventDataForSchema, EventForSchema, FirstColKind, IntervalKeyedSchema, JsonRowFormat, JoinManySchema, JoinSchema, JoinType, NumericColumnNameForSchema, NormalizedObjectRow, NormalizedRowForSchema, PivotByGroupSchema, PointRowForSchema, PrefixedJoinManySchema, PrefixedJoinSchema, ReduceResult, RenameMap, ValidatedAggregateMap } from '../schema/index.js';
+import type { AlignSchema, MaterializeSchema, ArrayAggregateAppendSchema, ArrayAggregateReplaceSchema, ArrayColumnNameForSchema, ArrayExplodeAppendSchema, ArrayExplodeReplaceSchema, BaselineSchema, AggregateReducer, AggregateSchema, AppendColumn, CollapseSchema, EventDataForSchema, EventForSchema, FirstColKind, IntervalKeyedSchema, JsonRowFormat, JoinManySchema, JoinSchema, JoinType, NumericColumnNameForSchema, NormalizedObjectRow, NormalizedRowForSchema, PivotByGroupSchema, PointRowForSchema, PrefixedJoinManySchema, PrefixedJoinSchema, ReduceResult, RenameMap, ValidatedAggregateMap } from '../schema/index.js';
 import type { RenameSchema, RollingAlignment, RollingSchema, ColumnValue, DedupeKeep, DiffSchema, FillMapping, FillStrategy, ScalarKind, ScalarValue, SmoothMethod, SmoothAppendSchema, SmoothSchema, SelectSchema, SeriesSchema, TimeKeyedSchema, TimeSeriesJsonInput, TimeSeriesInput, TimeRangeKeyedSchema, ValueColumnKindForName, ValueColumnNameForSchema, ValueColumnsForSchema } from '../schema/index.js';
+import { type BinSpec } from './by-column.js';
+import { type WindowSpec } from './rolling-by-column.js';
 import { BoundedSequence } from '../sequence/bounded-sequence.js';
 import { type TimeZoneOptions } from '../core/calendar.js';
 import { TimeRange } from '../core/time-range.js';
@@ -519,6 +521,63 @@ export declare class TimeSeries<S extends SeriesSchema> {
      */
     reduce(column: ValueColumnsForSchema<S>[number]['name'], reducer: AggregateReducer): ColumnValue | undefined;
     reduce<const Mapping extends ValidatedAggregateMap<S, Mapping>>(mapping: Mapping): ReduceResult<S, Mapping>;
+    /**
+     * Example:
+     * `series.byColumn('cumDist', { width: 1000 }, { gain: { from: 'ele', using: 'sum' } })`.
+     *
+     * **Value-axis aggregation.** Where `aggregate` buckets the temporal key and
+     * `reduce` collapses the whole series to one record, `byColumn` buckets rows
+     * by the **value** of a numeric column and collapses **each value-bin** to one
+     * record. Returns an ordered array of `{ start, end, ...aggregates }` — the
+     * bin's `[start, end)` range plus the mapped reducers — *not* a `TimeSeries`,
+     * because value-bins (distance / power ranges) are not time-indexed.
+     *
+     * Two binning modes:
+     * - `{ width, origin? }` — even-width bins (`origin` defaults to `0`). Bins are
+     *   emitted contiguously from the lowest to the highest occupied bin (interior
+     *   empty bins included), so a histogram / profile has no gaps. A monotonic
+     *   source (cumulative distance / work) yields contiguous ranges (per-km
+     *   splits, elevation-vs-distance profile); a non-monotonic source (power)
+     *   yields a histogram (distribution).
+     * - `{ edges }` — explicit ascending edges `[e₀ … eₙ]` → `n` bins, bin `i` =
+     *   `[eᵢ, eᵢ₊₁)` (e.g. FTP / Coggan power zones). Always emits all `n` bins.
+     *
+     * A row whose bin value is missing / non-finite (or, for `edges`, outside
+     * `[e₀, eₙ)`) contributes to no bin. The reducer non-finite policy still
+     * applies to the *source* columns. Empty bins emit each reducer's empty value
+     * (`count` → 0, `avg` / `min` / … → `undefined`), like an empty `aggregate`
+     * bucket. See `docs/notes/bycolumn-value-axis.md`.
+     */
+    byColumn<const Mapping extends ValidatedAggregateMap<S, Mapping>>(col: NumericColumnNameForSchema<S>, spec: BinSpec, mapping: Mapping): Array<{
+        start: number;
+        end: number;
+    } & ReduceResult<S, Mapping>>;
+    /**
+     * Example:
+     * `series.rollingByColumn('cumDist', { radius: 120 }, { lo: { from: 'speed', using: 'p5' }, hi: { from: 'speed', using: 'p95' } })`.
+     *
+     * **Windowed value-axis aggregation — the sliding-window sibling of
+     * `byColumn`.** Where `byColumn` collapses rows into disjoint value-bins (the
+     * value-axis analogue of `aggregate`), `rollingByColumn` slides a **centered
+     * window** along a value axis and reduces the window at every row (the
+     * value-axis analogue of `rolling`). For each row it reduces the rows whose
+     * `col` value lies within `±radius` of that row's value, and returns **one
+     * record per row, positionally aligned with the series** (`out[i]` is the
+     * window centered at row `i`) — *not* a `TimeSeries`, and with no `start`/`end`
+     * range (the caller already has the axis column to zip against).
+     *
+     * `col` must be a **non-decreasing** numeric column — the ordering is what
+     * makes a sliding window meaningful (vs `byColumn`'s order-free group-by) and
+     * is enforced (a descending step throws). A row whose `col` value is missing /
+     * non-finite is excluded from every window and its own slot gets each
+     * reducer's empty snapshot, so the result stays positionally aligned. The
+     * reducer non-finite policy still applies to the *source* columns.
+     *
+     * The window is centered and inclusive (`col[i] − radius ≤ col[j] ≤ col[i] +
+     * radius`); a single O(n) two-pointer sweep maintains the window. See
+     * `docs/notes/rolling-by-column.md`.
+     */
+    rollingByColumn<const Mapping extends ValidatedAggregateMap<S, Mapping>>(col: NumericColumnNameForSchema<S>, spec: WindowSpec, mapping: Mapping): Array<ReduceResult<S, Mapping>>;
     /**
      * Example: `series.groupBy("host")`.
      * Partitions the series into groups keyed by the distinct values of a payload column.
@@ -1080,6 +1139,31 @@ export declare class TimeSeries<S extends SeriesSchema> {
     select<const Keys extends readonly (keyof EventDataForSchema<S>)[]>(...keys: Keys): TimeSeries<SelectSchema<S, Keys[number] & string>>;
     /** Example: `series.rename({ cpu: "usage" })`. Returns a new series with payload field names renamed according to the supplied mapping. */
     rename<const Mapping extends RenameMap<EventDataForSchema<S>>>(mapping: Mapping): TimeSeries<RenameSchema<S, Mapping>>;
+    /**
+     * Example:
+     * `series.withColumn('cumDist', cumulativeDistances)` (a `Float64Array`).
+     *
+     * **Attach a computed numeric column.** Returns a new series with `values`
+     * appended as a new `number` column named `name`, so downstream pond ops
+     * (`aggregate`, `byColumn`, `rollingByColumn`, `column(name)`) can reference
+     * it. The existing key + value columns are shared by reference (zero-copy);
+     * only the new column is added. This is the seam that lets a derived array
+     * (cumulative distance, speed, gradient) re-enter the pond pipeline as a real
+     * column instead of staying a side-channel.
+     *
+     * `values` is a `Float64Array` (dense) or a `(number | undefined)[]` (where
+     * `undefined` marks a missing cell), and must have exactly `series.length`
+     * entries. Defined values are validated against the numeric intake contract —
+     * **non-finite (`NaN` / `±Infinity`) is rejected** (a `ValidationError`,
+     * matching construction), so packed numeric columns stay NaN-free; pass
+     * `undefined` for a missing cell, never `NaN`. `name` must not collide with an
+     * existing column.
+     *
+     * This is the *validated* attach. A trusted bulk-construction path
+     * (`fromTrustedColumns`, skipping the finite scan) is a deferred sibling for
+     * when a perf-critical consumer earns it.
+     */
+    withColumn<const Name extends string>(name: Name, values: ReadonlyArray<number | undefined> | Float64Array): TimeSeries<AppendColumn<S, Name, 'number'>>;
     /** Example: `series.collapse(["in", "out"], "avg", fn)`. Collapses selected payload fields into a single derived field across each event in the series. */
     collapse<const Keys extends readonly (keyof EventDataForSchema<S>)[], Name extends string, R extends ScalarValue>(keys: Keys, output: Name, reducer: (values: Pick<EventDataForSchema<S>, Keys[number]>) => R): TimeSeries<CollapseSchema<S, Keys[number] & string, Name, R>>;
     collapse<const Keys extends readonly (keyof EventDataForSchema<S>)[], Name extends string, R extends ScalarValue>(keys: Keys, output: Name, reducer: (values: Pick<EventDataForSchema<S>, Keys[number]>) => R, options: {

package/dist/batch/time-series.js

@@ -6,6 +6,8 @@ import { mapOp } from './operators/map.js';
 import { shiftOp } from './operators/shift.js';
 import { collapseOp } from './operators/collapse.js';
 import { assertColumnValuesMatchKind, columnFromValuesByKind, } from './operators/column-builders.js';
+import { computeByColumn } from './by-column.js';
+import { computeRollingByColumn, } from './rolling-by-column.js';
 import { BoundedSequence } from '../sequence/bounded-sequence.js';
 import { Interval } from '../core/interval.js';
 import { Time } from '../core/time.js';
@@ -13,7 +15,7 @@ import { TimeRange } from '../core/time-range.js';
 import { compareEventKeys } from '../core/temporal.js';
 import { PartitionedTimeSeries } from './partitioned-time-series.js';
 import { Sequence } from '../sequence/sequence.js';
-import { ColumnarStore, IntervalKeyColumn, TimeKeyColumn, TimeRangeKeyColumn, float64ColumnFromArray, stringColumnFromArray, withColumnsRenamed, withColumnsSelected, withKeyColumn, withRowRange, withRowSelection, } from '../columnar/index.js';
+import { ColumnarStore, IntervalKeyColumn, TimeKeyColumn, TimeRangeKeyColumn, float64ColumnFromArray, stringColumnFromArray, withColumnAppended, withColumnsRenamed, withColumnsSelected, withKeyColumn, withRowRange, withRowSelection, } from '../columnar/index.js';
 import { SeriesStore } from '../live/series-store.js';
 import { parseDuration } from '../core/duration.js';
 import { resolveReducer, bucketStateFor, rollingStateFor, } from '../reducers/index.js';
@@ -1371,6 +1373,66 @@ export class TimeSeries {
         }
         return result;
     }
+    /**
+     * Example:
+     * `series.byColumn('cumDist', { width: 1000 }, { gain: { from: 'ele', using: 'sum' } })`.
+     *
+     * **Value-axis aggregation.** Where `aggregate` buckets the temporal key and
+     * `reduce` collapses the whole series to one record, `byColumn` buckets rows
+     * by the **value** of a numeric column and collapses **each value-bin** to one
+     * record. Returns an ordered array of `{ start, end, ...aggregates }` — the
+     * bin's `[start, end)` range plus the mapped reducers — *not* a `TimeSeries`,
+     * because value-bins (distance / power ranges) are not time-indexed.
+     *
+     * Two binning modes:
+     * - `{ width, origin? }` — even-width bins (`origin` defaults to `0`). Bins are
+     *   emitted contiguously from the lowest to the highest occupied bin (interior
+     *   empty bins included), so a histogram / profile has no gaps. A monotonic
+     *   source (cumulative distance / work) yields contiguous ranges (per-km
+     *   splits, elevation-vs-distance profile); a non-monotonic source (power)
+     *   yields a histogram (distribution).
+     * - `{ edges }` — explicit ascending edges `[e₀ … eₙ]` → `n` bins, bin `i` =
+     *   `[eᵢ, eᵢ₊₁)` (e.g. FTP / Coggan power zones). Always emits all `n` bins.
+     *
+     * A row whose bin value is missing / non-finite (or, for `edges`, outside
+     * `[e₀, eₙ)`) contributes to no bin. The reducer non-finite policy still
+     * applies to the *source* columns. Empty bins emit each reducer's empty value
+     * (`count` → 0, `avg` / `min` / … → `undefined`), like an empty `aggregate`
+     * bucket. See `docs/notes/bycolumn-value-axis.md`.
+     */
+    byColumn(col, spec, mapping) {
+        const columnSpecs = normalizeAggregateColumns(this.schema, mapping);
+        return computeByColumn(this.#store.store, col, spec, columnSpecs);
+    }
+    /**
+     * Example:
+     * `series.rollingByColumn('cumDist', { radius: 120 }, { lo: { from: 'speed', using: 'p5' }, hi: { from: 'speed', using: 'p95' } })`.
+     *
+     * **Windowed value-axis aggregation — the sliding-window sibling of
+     * `byColumn`.** Where `byColumn` collapses rows into disjoint value-bins (the
+     * value-axis analogue of `aggregate`), `rollingByColumn` slides a **centered
+     * window** along a value axis and reduces the window at every row (the
+     * value-axis analogue of `rolling`). For each row it reduces the rows whose
+     * `col` value lies within `±radius` of that row's value, and returns **one
+     * record per row, positionally aligned with the series** (`out[i]` is the
+     * window centered at row `i`) — *not* a `TimeSeries`, and with no `start`/`end`
+     * range (the caller already has the axis column to zip against).
+     *
+     * `col` must be a **non-decreasing** numeric column — the ordering is what
+     * makes a sliding window meaningful (vs `byColumn`'s order-free group-by) and
+     * is enforced (a descending step throws). A row whose `col` value is missing /
+     * non-finite is excluded from every window and its own slot gets each
+     * reducer's empty snapshot, so the result stays positionally aligned. The
+     * reducer non-finite policy still applies to the *source* columns.
+     *
+     * The window is centered and inclusive (`col[i] − radius ≤ col[j] ≤ col[i] +
+     * radius`); a single O(n) two-pointer sweep maintains the window. See
+     * `docs/notes/rolling-by-column.md`.
+     */
+    rollingByColumn(col, spec, mapping) {
+        const columnSpecs = normalizeAggregateColumns(this.schema, mapping);
+        return computeRollingByColumn(this.#store.store, col, spec, columnSpecs);
+    }
     groupBy(column, transform) {
         const buckets = new Map();
         for (const event of this.events) {
@@ -2688,6 +2750,47 @@ export class TimeSeries {
         const reshaped = withColumnsRenamed(this.#store.store, mapping);
         return TimeSeries.#fromTrustedStore(this.name, resultSchema, reshaped);
     }
+    /**
+     * Example:
+     * `series.withColumn('cumDist', cumulativeDistances)` (a `Float64Array`).
+     *
+     * **Attach a computed numeric column.** Returns a new series with `values`
+     * appended as a new `number` column named `name`, so downstream pond ops
+     * (`aggregate`, `byColumn`, `rollingByColumn`, `column(name)`) can reference
+     * it. The existing key + value columns are shared by reference (zero-copy);
+     * only the new column is added. This is the seam that lets a derived array
+     * (cumulative distance, speed, gradient) re-enter the pond pipeline as a real
+     * column instead of staying a side-channel.
+     *
+     * `values` is a `Float64Array` (dense) or a `(number | undefined)[]` (where
+     * `undefined` marks a missing cell), and must have exactly `series.length`
+     * entries. Defined values are validated against the numeric intake contract —
+     * **non-finite (`NaN` / `±Infinity`) is rejected** (a `ValidationError`,
+     * matching construction), so packed numeric columns stay NaN-free; pass
+     * `undefined` for a missing cell, never `NaN`. `name` must not collide with an
+     * existing column.
+     *
+     * This is the *validated* attach. A trusted bulk-construction path
+     * (`fromTrustedColumns`, skipping the finite scan) is a deferred sibling for
+     * when a perf-critical consumer earns it.
+     */
+    withColumn(name, values) {
+        if (values.length !== this.length) {
+            throw new RangeError(`withColumn: values length ${values.length} does not match series length ${this.length}`);
+        }
+        // Re-assert the numeric intake contract (finite-or-missing) — trusted
+        // construction below bypasses the constructor's strict intake, so a
+        // non-finite cell would otherwise pack into the column and break the
+        // reducer non-finite policy's NaN-free invariant.
+        assertColumnValuesMatchKind('number', values, `withColumn '${String(name)}'`);
+        const column = columnFromValuesByKind('number', values);
+        const reshaped = withColumnAppended(this.#store.store, name, column);
+        const resultSchema = Object.freeze([
+            ...this.schema,
+            { name, kind: 'number' },
+        ]);
+        return TimeSeries.#fromTrustedStore(this.name, resultSchema, reshaped);
+    }
     collapse(keys, output, reducer, options) {
         // Column-native (Step 4): the reducer runs over the keyed columns read
         // straight off the store in the extracted `collapseOp` — no

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "pond-ts",
-  "version": "0.26.0",
+  "version": "0.28.0",
   "description": "TypeScript-first time series primitives",
   "license": "MIT",
   "repository": {