|
| 1 | +/** |
| 2 | + * Benchmark: mergeOrdered with left_by grouping — two 3k-row DataFrames, 10 groups. |
| 3 | + * Outputs JSON: {"function": "merge_ordered_by", "mean_ms": ..., "iterations": ..., "total_ms": ...} |
| 4 | + */ |
| 5 | +import { DataFrame, mergeOrdered } from "../../src/index.ts"; |
| 6 | + |
| 7 | +const N = 3_000; |
| 8 | +const GROUPS = 10; |
| 9 | +const PER_GROUP = N / GROUPS; |
| 10 | +const WARMUP = 2; |
| 11 | +const ITERATIONS = 8; |
| 12 | + |
| 13 | +// Build sorted data by (grp, t) |
| 14 | +const grpLeft: string[] = []; |
| 15 | +const tLeft: number[] = []; |
| 16 | +const v1: number[] = []; |
| 17 | +for (let g = 0; g < GROUPS; g++) { |
| 18 | + for (let j = 0; j < PER_GROUP; j++) { |
| 19 | + grpLeft.push(`g${g}`); |
| 20 | + tLeft.push(j * 2); |
| 21 | + v1.push(g * PER_GROUP + j); |
| 22 | + } |
| 23 | +} |
| 24 | + |
| 25 | +const grpRight: string[] = []; |
| 26 | +const tRight: number[] = []; |
| 27 | +const v2: number[] = []; |
| 28 | +for (let g = 0; g < GROUPS; g++) { |
| 29 | + for (let j = 0; j < PER_GROUP; j++) { |
| 30 | + grpRight.push(`g${g}`); |
| 31 | + tRight.push(j * 3); |
| 32 | + v2.push(g * PER_GROUP + j); |
| 33 | + } |
| 34 | +} |
| 35 | + |
| 36 | +const df1 = DataFrame.fromColumns({ grp: grpLeft, t: tLeft, val1: v1 }); |
| 37 | +const df2 = DataFrame.fromColumns({ grp: grpRight, t: tRight, val2: v2 }); |
| 38 | + |
| 39 | +for (let i = 0; i < WARMUP; i++) { |
| 40 | + mergeOrdered(df1, df2, { on: "t", left_by: "grp", right_by: "grp" }); |
| 41 | +} |
| 42 | + |
| 43 | +const start = performance.now(); |
| 44 | +for (let i = 0; i < ITERATIONS; i++) { |
| 45 | + mergeOrdered(df1, df2, { on: "t", left_by: "grp", right_by: "grp" }); |
| 46 | +} |
| 47 | +const total = performance.now() - start; |
| 48 | + |
| 49 | +console.log( |
| 50 | + JSON.stringify({ |
| 51 | + function: "merge_ordered_by", |
| 52 | + mean_ms: total / ITERATIONS, |
| 53 | + iterations: ITERATIONS, |
| 54 | + total_ms: total, |
| 55 | + }), |
| 56 | +); |
0 commit comments