@toclocoinc/lattice-grid 1.8.0 → 1.9.0

package/lattice-grid.esm.min.js

@@ -1,5 +1,5 @@
 /*!
- * Lattice Grid 1.8.0 — core + DOM renderer
+ * Lattice Grid 1.9.0 — core + DOM renderer
  * Copyright (c) 2026 TOCLOCO Inc. All rights reserved.
  * https://latticegrid.dev
  */
@@ -51,7 +51,7 @@ Object.defineProperty(__exports,"cancelFrame",{enumerable:true,get:function(){re
 Object.defineProperty(__exports,"frameBatched",{enumerable:true,get:function(){return frameBatched;}});
 Object.defineProperty(__exports,"whenIdle",{enumerable:true,get:function(){return whenIdle;}});
 Object.defineProperty(__exports,"uid",{enumerable:true,get:function(){return uid;}});
-const VERSION='1.8.0';
+const VERSION='1.9.0';
 const warned=new Set();
 const reported=[];
 const REPORT_LIMIT=500;
@@ -3396,9 +3396,65 @@ other:'{count} cells updated',
 'panel.quickFilter':'Quick filter',
 'panel.formatting':'Formatting',
 'panel.statistics':'Statistics',
+'panel.compare':'Compare',
+'compare.first':'First column',
+'compare.second':'Second column',
+'compare.needTwo':'Two numeric columns are needed to compare',
+'compare.noPairs':'No rows have a value in both',
+'compare.pairs':'{count} pairs',
+'compare.pearson':'Correlation (Pearson)',
+'compare.spearman':'Rank correlation (Spearman)',
+'compare.kendall':'Kendall’s tau',
+'compare.covariance':'Covariance',
+'compare.slope':'Slope',
+'compare.intercept':'Intercept',
+'compare.r2':'R²',
+'compare.stdError':'Standard error',
+'compare.weighted':'Weighted average',
 'panel.zone.group':'row groups',
 'panel.zone.values':'values',
 'panel.zone.pivot':'pivot columns',
+'total.sum':'Sum',
+'total.avg':'Average',
+'total.min':'Min',
+'total.max':'Max',
+'total.count':'Count',
+'total.countValues':'Count of values',
+'total.first':'First',
+'total.last':'Last',
+'total.median':'Median',
+'total.p25':'25th percentile',
+'total.p75':'75th percentile',
+'total.p90':'90th percentile',
+'total.p95':'95th percentile',
+'total.p99':'99th percentile',
+'total.iqr':'Interquartile range',
+'total.mad':'Median absolute deviation',
+'total.variance':'Variance',
+'total.varianceP':'Variance (population)',
+'total.stddev':'Standard deviation',
+'total.stddevP':'Standard deviation (population)',
+'total.range':'Range',
+'total.distinct':'Distinct',
+'total.mode':'Mode',
+'total.skewness':'Skewness',
+'total.kurtosis':'Kurtosis',
+'total.geomean':'Geometric mean',
+'total.harmean':'Harmonic mean',
+'total.sumSquares':'Sum of squares',
+'total.weightedAvg':'Weighted average',
+'total.argmin':'Lowest by',
+'total.argmax':'Highest by',
+'total.hhi':'Concentration (HHI)',
+'total.entropy':'Entropy',
+'total.evenness':'Evenness',
+'total.top3Share':'Top 3 share',
+'total.top10Share':'Top 10 share',
+'total.gini':'Gini coefficient',
+'total.trimmedMean':'Trimmed mean',
+'total.winsorizedMean':'Winsorized mean',
+'total.robustOutliers':'Outliers (robust)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Column',
 'stats.choose':'Choose a column to profile',
 'stats.noColumns':'No numeric columns to profile',
@@ -3418,6 +3474,15 @@ other:'{count} cells updated',
 'stats.outliers':'Outliers',
 'stats.distribution':'Distribution',
 'stats.bin':'{count} between {from} and {to}',
+'stats.section.shape':'Shape',
+'stats.section.robust':'Robust',
+'stats.section.concentration':'Concentration',
+'stats.section.capability':'Capability',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Out of specification',
 'stats.filtered':'Over the {count} filtered rows',
 'menu.sortAscending':'Sort ascending',
 'menu.sortDescending':'Sort descending',
@@ -4184,6 +4249,69 @@ unit('gon',Math.PI/200,['grad','gradian','gradians'],{auto:false}),
 unit('rad',1,['radian','radians']),
 unit('turn',2*Math.PI,['rev','revolution','revolutions'],{auto:false}),
 ]),
+angularVelocity:Object.freeze([
+unit('°/s',Math.PI/180,['degps','deg/s','degrees/s'],{auto:false}),
+unit('rad/s',1,['radps','radians/s']),
+unit('rpm',(2*Math.PI)/60,['rev/min','r/min','revolutions/min'],{auto:false}),
+unit('rps',2*Math.PI,['rev/s','r/s','revolutions/s'],{auto:false}),
+]),
+fraction:Object.freeze([
+unit('ppt',1e-12,['partspertrillion'],{auto:false}),
+unit('ppb',1e-9,['partsperbillion']),
+unit('ppm',1e-6,['partspermillion']),
+unit('bp',1e-4,['bps-finance','basispoint','basispoints','bips'],{auto:false}),
+unit('‰',1e-3,['permille','permil'],{auto:false}),
+unit('%',1e-2,['pct','percent']),
+unit('×',1,['x','ratio','times']),
+]),
+molarity:Object.freeze([
+unit('pM',1e-12,['picomolar','picomolarity']),
+unit('nM',1e-9,['nanomolar','nanomolarity']),
+unit('µM',1e-6,['um-molar','micromolar','micromolarity']),
+unit('mM',1e-3,['millimolar','millimolarity']),
+unit('M',1,['molar','mol/l','mol/L','molarity']),
+unit('mol/m³',1e-3,['mol/m3'],{auto:false}),
+]),
+massFlow:Object.freeze([
+unit('mg/s',1e-6,['milligrams/s']),
+unit('g/s',1e-3,['grams/s']),
+unit('kg/h',1/3600,['kilograms/h','kgph'],{auto:false}),
+unit('kg/s',1,['kilograms/s','kgps']),
+unit('t/h',1000/3600,['tonnes/h','tph'],{auto:false}),
+unit('lb/h',0.45359237/3600,['pounds/h','pph'],{auto:false}),
+unit('t/s',1000,['tonnes/s'],{auto:false}),
+]),
+viscosity:Object.freeze([
+unit('µPa·s',1e-6,['upas','micropascalsecond']),
+unit('cP',1e-3,['centipoise'],{auto:false}),
+unit('mPa·s',1e-3,['mpas','millipascalsecond']),
+unit('P',0.1,['poise'],{auto:false}),
+unit('Pa·s',1,['pas','pascalsecond']),
+]),
+kinematicViscosity:Object.freeze([
+unit('cSt',1e-6,['centistokes','centistoke']),
+unit('mm²/s',1e-6,['mm2/s'],{auto:false}),
+unit('St',1e-4,['stokes','stoke'],{auto:false}),
+unit('m²/s',1,['m2/s']),
+]),
+thermalConductivity:Object.freeze([
+unit('mW/(m·K)',1e-3,['mw/mk']),
+unit('W/(m·K)',1,['w/mk','wmk']),
+unit('kW/(m·K)',1e3,['kw/mk'],{auto:false}),
+unit('BTU/(hr·ft·°F)',1.730734666,['btu/hrftf'],{auto:false}),
+]),
+specificHeat:Object.freeze([
+unit('J/(kg·K)',1,['j/kgk','jkgk']),
+unit('kJ/(kg·K)',1e3,['kj/kgk']),
+unit('cal/(g·°C)',4184,['cal/gc'],{auto:false}),
+]),
+doseRate:Object.freeze([
+unit('nSv/h',1e-9,['nsvh']),
+unit('µSv/h',1e-6,['usv/h','usvh']),
+unit('mSv/h',1e-3,['msvh']),
+unit('Sv/h',1,['svh']),
+unit('mSv/a',1e-3/8766,['msv/year','msvpa'],{auto:false}),
+]),
 });
 const AMBIGUOUS=Symbol('ambiguous');
 const indexes=new Map();
@@ -4304,6 +4432,7 @@ return out;
 }
 const SPACES=/[\s   ]/g;
 const NUMBER_HEAD=/^[+-]?[\d   '’ .,]*(?:[eE][+-]?\d+)?/;
+const LEADING_SYMBOL=/^[^\d+\-(.,\s]+\s*/;
 const PLAIN_NUMBER=/^[+-]?(?:\d+(?:\.\d*)?|\.\d+)(?:[eE][+-]?\d+)?$/;
 function parseLocaleNumber(text,locale){
 const{group,decimal}=localeSeparators(locale);
@@ -4343,11 +4472,18 @@ let s=String(text).trim();
 if(s==='')return null;
 let negative=false;
 if(s.startsWith('(')&&s.endsWith(')')){negative=true;s=s.slice(1,-1).trim();}
+let leading=null;
+const front=LEADING_SYMBOL.exec(s);
+if(front&&front[0]){
+const candidate=resolveToken(front[0].trim(),ctx.index,ctx.binary);
+if(candidate){leading=candidate;s=s.slice(front[0].length).trim();}
+}
 const head=NUMBER_HEAD.exec(s)[0];
 const n=parseLocaleNumber(head,opts&&opts.locale);
 if(n===null)return null;
 const suffix=s.slice(head.length).trim();
-const from=suffix===''?ctx.base:resolveToken(suffix,ctx.index,ctx.binary);
+if(leading&&suffix!=='')return null;
+const from=leading||(suffix===''?ctx.base:resolveToken(suffix,ctx.index,ctx.binary));
 if(!from)return null;
 const value=convert(n,from,ctx.base);
 return negative?-value:value;
@@ -4427,7 +4563,10 @@ min=significantDecimals(shown,figures);
 max=min;
 }
 const text=numberFormat(cfg.locale,min,max,cfg.group!==false).format(shown);
-return`${text}${cfg.space??' '}${target.symbol}`;
+const gap=cfg.space??' ';
+return cfg.placement==='prefix'
+?`${target.symbol}${cfg.space??''}${text}`
+:`${text}${gap}${target.symbol}`;
 }
 function compareUnit(a,b){
 const an=isNil(a)||Number.isNaN(a)?null:Number(a);
@@ -4555,6 +4694,21 @@ system:'angle',unit:'rad',maxDecimals:4,totals:angularTotals(2*Math.PI),
 degrees:createUnitType({
 system:'angle',unit:'°',maxDecimals:2,totals:angularTotals(360),
 }),
+rpm:createUnitType({system:'angularVelocity',unit:'rpm',maxDecimals:0}),
+angularVelocity:createUnitType({system:'angularVelocity',unit:'rad/s',maxDecimals:3}),
+ppm:createUnitType({system:'fraction',unit:'ppm',maxDecimals:2}),
+ppb:createUnitType({system:'fraction',unit:'ppb',maxDecimals:2}),
+basisPoints:createUnitType({system:'fraction',unit:'bp',maxDecimals:1}),
+molarity:createUnitType({system:'molarity',unit:'M',display:'auto',maxDecimals:3}),
+massFlow:createUnitType({system:'massFlow',unit:'kg/s',maxDecimals:3}),
+tonnesPerHour:createUnitType({system:'massFlow',unit:'t/h',maxDecimals:2}),
+viscosity:createUnitType({system:'viscosity',unit:'Pa·s',display:'auto',maxDecimals:3}),
+kinematicViscosity:createUnitType({system:'kinematicViscosity',unit:'cSt',maxDecimals:2}),
+thermalConductivity:createUnitType({
+system:'thermalConductivity',unit:'W/(m·K)',maxDecimals:3,
+}),
+specificHeat:createUnitType({system:'specificHeat',unit:'J/(kg·K)',maxDecimals:1}),
+doseRate:createUnitType({system:'doseRate',unit:'µSv/h',display:'auto',maxDecimals:2}),
 });
 });
 __def("packages/core/src/columns/types/si.js",function(__exports,__req){
@@ -4651,6 +4805,7 @@ extra:[defineUnit('G',1e-4,['gauss'],{auto:false})],
 }),
 luminousFlux:createSiType('luminousFlux',{base:'lm',name:'lumen',prefixes:['m','','k']}),
 illuminance:createSiType('illuminance',{base:'lx',name:'lux',prefixes:['m','','k']}),
+luminousIntensity:createSiType('luminousIntensity',{base:'cd',name:'candela',prefixes:['m','','k']}),
 substance:createSiType('substance',{
 base:'mol',name:'mole',prefixes:['n','µ','m','','k'],
 }),
@@ -6550,7 +6705,22 @@ compute:(deps,ctx)=>{
 const api=ctx.grid&&ctx.grid.statistics;
 if(!api)return null;
 const key=(ctx.row&&ctx.row.key)||api.keyOf(ctx.data);
-return key?api.shadow(watched,spec.kind,key):null;
+return key?api.shadow(watched,spec.kind,key,spec.scope):null;
+},
+};
+}
+if(def.running&&!isFunction(m.value&&m.value.compute)){
+const spec=typeof def.running==='string'?{kind:def.running}:def.running;
+const source=spec.of||def.field||id;
+m.value={
+...(m.value||{}),
+deps:[source],
+pure:false,
+compute:(deps,ctx)=>{
+const api=ctx.grid&&ctx.grid.statistics;
+if(!api||!isFunction(api.running))return null;
+const key=(ctx.row&&ctx.row.key)||api.keyOf(ctx.data);
+return key?api.running(source,spec.kind||'total',key):null;
 },
 };
 }
@@ -6560,7 +6730,9 @@ const column={
 id,
 field,
 shadow:def.shadow||null,
-volatile:!!def.shadow,
+running:def.running||null,
+spec:def.spec||null,
+volatile:!!(def.shadow||def.running),
 title:m.title??humanise(field||id),
 type:typeName,
 dataType:type,
@@ -7196,6 +7368,7 @@ class ShadowTracker{
 #max;
 #now;
 #summary=null;
+#filtered=null;
 constructor(opts){
 this.#colId=opts.colId;
 this.#depth=Math.max(2,opts.depth||DEFAULT_DEPTH);
@@ -7210,6 +7383,7 @@ const value=toNumber(raw);
 if(value===null)return;
 if(!this.#latest.has(key)){
 this.#summary=null;
+this.#filtered=null;
 this.#evictIfFull();
 this.#baseline.set(key,value);
 this.#latest.set(key,value);
@@ -7222,6 +7396,7 @@ return;
 const previous=this.#latest.get(key);
 if(previous===value)return;
 this.#summary=null;
+this.#filtered=null;
 this.#latest.set(key,value);
 this.#counts.set(key,(this.#counts.get(key)||0)+1);
 this.#stamps.set(key,this.#now());
@@ -7248,6 +7423,7 @@ this.#forgotten++;
 rebase(){
 for(const[key,value]of this.#latest)this.#baseline.set(key,value);
 this.#summary=null;
+this.#filtered=null;
 }
 reset(){
 this.#baseline.clear();
@@ -7258,6 +7434,7 @@ this.#history.clear();
 this.#streaks.clear();
 this.#forgotten=0;
 this.#summary=null;
+this.#filtered=null;
 }
 retain(keys){
 const living=keys instanceof Set?keys:new Set(keys);
@@ -7272,10 +7449,10 @@ this.#history.delete(key);
 this.#streaks.delete(key);
 dropped++;
 }
-if(dropped)this.#summary=null;
+if(dropped){this.#summary=null;this.#filtered=null;}
 return dropped;
 }
-read(kind,key){
+read(kind,key,only){
 switch(kind){
 case'updates':
 return this.#counts.has(key)?this.#counts.get(key):0;
@@ -7312,12 +7489,27 @@ return this.#history.has(key)?[...this.#history.get(key)]:null;
 case'streak':
 return this.#streaks.has(key)?this.#streaks.get(key):0;
 default:
-return POSITIONAL_KINDS.includes(kind)?this.#position(kind,key):null;
+return POSITIONAL_KINDS.includes(kind)?this.#position(kind,key,only):null;
+}
 }
+#view(only){
+if(only){
+if(this.#filtered&&this.#filtered.only===only)return this.#filtered.view;
+const view=this.#build(only);
+this.#filtered={only,view};
+return view;
 }
-#view(){
 if(this.#summary)return this.#summary;
-const sorted=[...this.#latest.values()].sort((a,b)=>a-b);
+this.#summary=this.#build(null);
+return this.#summary;
+}
+#build(only){
+const values=[];
+for(const[key,value]of this.#latest){
+if(only&&!only.has(key))continue;
+values.push(value);
+}
+const sorted=values.sort((a,b)=>a-b);
 let n=0;
 let mean=0;
 let m2=0;
@@ -7329,19 +7521,24 @@ const delta=x-mean;
 mean+=delta/n;
 m2+=delta*(x-mean);
 }
-this.#summary={
+const baseline=[];
+for(const[key,value]of this.#baseline){
+if(only&&!only.has(key))continue;
+baseline.push(value);
+}
+return{
 sorted,
-baseline:[...this.#baseline.values()].sort((a,b)=>a-b),
+baseline:baseline.sort((a,b)=>a-b),
 sum,
 mean:n?mean:0,
 sd:n>1?Math.sqrt(m2/(n-1)):0,
 };
-return this.#summary;
 }
-#position(kind,key){
+#position(kind,key,only){
 if(!this.#latest.has(key))return null;
+if(only&&!only.has(key))return null;
 const value=this.#latest.get(key);
-const view=this.#view();
+const view=this.#view(only);
 const n=view.sorted.length;
 if(!n)return null;
 switch(kind){
@@ -7601,8 +7798,15 @@ return v===null||v===undefined||(typeof v==='number'&&Number.isNaN(v));
 });
 __def("packages/core/src/compute/statistics.js",function(__exports,__req){
 'use strict';
+Object.defineProperty(__exports,"KENDALL_LIMIT",{enumerable:true,get:function(){return KENDALL_LIMIT;}});
 Object.defineProperty(__exports,"MAINTENANCE",{enumerable:true,get:function(){return MAINTENANCE;}});
 Object.defineProperty(__exports,"numbers",{enumerable:true,get:function(){return numbers;}});
+Object.defineProperty(__exports,"frequencies",{enumerable:true,get:function(){return frequencies;}});
+Object.defineProperty(__exports,"herfindahl",{enumerable:true,get:function(){return herfindahl;}});
+Object.defineProperty(__exports,"entropy",{enumerable:true,get:function(){return entropy;}});
+Object.defineProperty(__exports,"evenness",{enumerable:true,get:function(){return evenness;}});
+Object.defineProperty(__exports,"topShare",{enumerable:true,get:function(){return topShare;}});
+Object.defineProperty(__exports,"gini",{enumerable:true,get:function(){return gini;}});
 Object.defineProperty(__exports,"moments",{enumerable:true,get:function(){return moments;}});
 Object.defineProperty(__exports,"quantileSorted",{enumerable:true,get:function(){return quantileSorted;}});
 Object.defineProperty(__exports,"quantile",{enumerable:true,get:function(){return quantile;}});
@@ -7611,11 +7815,28 @@ Object.defineProperty(__exports,"STAT_LABELS",{enumerable:true,get:function(){re
 Object.defineProperty(__exports,"weightedAverage",{enumerable:true,get:function(){return weightedAverage;}});
 Object.defineProperty(__exports,"extremeRow",{enumerable:true,get:function(){return extremeRow;}});
 Object.defineProperty(__exports,"correlation",{enumerable:true,get:function(){return correlation;}});
+Object.defineProperty(__exports,"trimmedMean",{enumerable:true,get:function(){return trimmedMean;}});
+Object.defineProperty(__exports,"winsorizedMean",{enumerable:true,get:function(){return winsorizedMean;}});
+Object.defineProperty(__exports,"modifiedZOutliers",{enumerable:true,get:function(){return modifiedZOutliers;}});
+Object.defineProperty(__exports,"jarqueBera",{enumerable:true,get:function(){return jarqueBera;}});
+Object.defineProperty(__exports,"weightedQuantile",{enumerable:true,get:function(){return weightedQuantile;}});
+Object.defineProperty(__exports,"pairs",{enumerable:true,get:function(){return pairs;}});
+Object.defineProperty(__exports,"covariance",{enumerable:true,get:function(){return covariance;}});
+Object.defineProperty(__exports,"regression",{enumerable:true,get:function(){return regression;}});
+Object.defineProperty(__exports,"spearman",{enumerable:true,get:function(){return spearman;}});
+Object.defineProperty(__exports,"kendall",{enumerable:true,get:function(){return kendall;}});
+Object.defineProperty(__exports,"seriesStats",{enumerable:true,get:function(){return seriesStats;}});
+Object.defineProperty(__exports,"D2_N2",{enumerable:true,get:function(){return D2_N2;}});
+Object.defineProperty(__exports,"withinSigma",{enumerable:true,get:function(){return withinSigma;}});
+Object.defineProperty(__exports,"capability",{enumerable:true,get:function(){return capability;}});
+Object.defineProperty(__exports,"controlLimits",{enumerable:true,get:function(){return controlLimits;}});
+Object.defineProperty(__exports,"controlViolations",{enumerable:true,get:function(){return controlViolations;}});
 Object.defineProperty(__exports,"countOutside",{enumerable:true,get:function(){return countOutside;}});
 Object.defineProperty(__exports,"histogram",{enumerable:true,get:function(){return histogram;}});
 const __m0=__req("packages/core/src/compute/handle.js");
 const presenceReader=__m0["presenceReader"];
 const valueReader=__m0["valueReader"];
+const KENDALL_LIMIT=5000;
 const MAINTENANCE=Object.freeze({
 variance:'maintained',
 varianceP:'maintained',
@@ -7640,6 +7861,16 @@ harmean:'rescan',
 mad:'rescan',
 argmin:'rescan',
 argmax:'rescan',
+hhi:'rescan',
+entropy:'rescan',
+evenness:'rescan',
+top3Share:'rescan',
+top10Share:'rescan',
+gini:'rescan',
+trimmedMean:'rescan',
+winsorizedMean:'rescan',
+robustOutliers:'rescan',
+jarqueBera:'rescan',
 });
 function numbers(handle,indices){
 const n=indices.length;
@@ -7668,6 +7899,68 @@ out[count++]=v;
 }
 return out.subarray(0,count);
 }
+function frequencies(handle,indices){
+const seen=new Map();
+const read=valueReader(handle);
+let total=0;
+for(let i=0;i<indices.length;i++){
+const raw=read(indices[i]);
+if(raw===null||raw===undefined||raw==='')continue;
+if(typeof raw==='number'&&Number.isNaN(raw))continue;
+const key=typeof raw==='object'?String(raw):raw;
+seen.set(key,(seen.get(key)||0)+1);
+total++;
+}
+const counts=[...seen.values()].sort((a,b)=>b-a);
+return{counts,total,distinct:counts.length};
+}
+function sharesOf(freq){
+return freq.total>0?freq.counts.map((c)=>c/freq.total):[];
+}
+function herfindahl(handle,indices){
+const freq=frequencies(handle,indices);
+if(!freq.total)return null;
+let sum=0;
+for(const share of sharesOf(freq))sum+=share*share;
+return sum;
+}
+function entropy(handle,indices){
+const freq=frequencies(handle,indices);
+if(!freq.total)return null;
+let sum=0;
+for(const share of sharesOf(freq))if(share>0)sum-=share*Math.log2(share);
+return sum;
+}
+function evenness(handle,indices){
+const freq=frequencies(handle,indices);
+if(!freq.total||freq.distinct<2)return freq.total?1:null;
+let sum=0;
+for(const share of sharesOf(freq))if(share>0)sum-=share*Math.log2(share);
+return sum/Math.log2(freq.distinct);
+}
+function topShare(handle,indices,n=3){
+const freq=frequencies(handle,indices);
+if(!freq.total)return null;
+const take=Math.max(1,Math.floor(n));
+let held=0;
+for(let i=0;i<Math.min(take,freq.counts.length);i++)held+=freq.counts[i];
+return held/freq.total;
+}
+function gini(handle,indices){
+const values=numbers(handle,indices);
+const n=values.length;
+if(!n)return null;
+const sorted=values.slice().sort();
+if(sorted[0]<0)return null;
+let total=0;
+let weighted=0;
+for(let i=0;i<n;i++){
+total+=sorted[i];
+weighted+=(i+1)*sorted[i];
+}
+if(total===0)return 0;
+return(2*weighted)/(n*total)-(n+1)/n;
+}
 function moments(values){
 let n=0;
 let mean=0;
@@ -7697,6 +7990,16 @@ const sorted=values.slice().sort();
 return quantileSorted(sorted,p);
 }
 const STAT_FNS=Object.freeze({
+hhi:(h,i)=>herfindahl(h,i),
+entropy:(h,i)=>entropy(h,i),
+evenness:(h,i)=>evenness(h,i),
+top3Share:(h,i)=>topShare(h,i,3),
+top10Share:(h,i)=>topShare(h,i,10),
+gini:(h,i)=>gini(h,i),
+trimmedMean:(h,i)=>trimmedMean(numbers(h,i),0.1),
+winsorizedMean:(h,i)=>winsorizedMean(numbers(h,i),0.1),
+robustOutliers:(h,i)=>modifiedZOutliers(numbers(h,i),3.5),
+jarqueBera:(h,i)=>jarqueBera(numbers(h,i)),
 variance:(h,i)=>{
 const{n,m2}=moments(numbers(h,i));
 return n>1?m2/(n-1):null;
@@ -7839,6 +8142,16 @@ return sum;
 },
 });
 const STAT_LABELS=Object.freeze({
+hhi:'Concentration (HHI)',
+entropy:'Entropy',
+evenness:'Evenness',
+top3Share:'Top 3 share',
+top10Share:'Top 10 share',
+gini:'Gini coefficient',
+trimmedMean:'Trimmed mean',
+winsorizedMean:'Winsorized mean',
+robustOutliers:'Outliers (robust)',
+jarqueBera:'Jarque–Bera',
 median:'Median',
 p25:'25th percentile',
 p75:'75th percentile',
@@ -7921,6 +8234,393 @@ if(bottom===0)return null;
 const r=top/bottom;
 return Math.max(-1,Math.min(1,r));
 }
+function trimmedMean(values,share=0.1){
+const n=values.length;
+if(!n)return null;
+const sorted=Array.from(values).sort((a,b)=>a-b);
+const cut=Math.floor(n*Math.min(0.49,Math.max(0,share)));
+const kept=sorted.slice(cut,n-cut);
+if(!kept.length)return quantileSorted(sorted,0.5);
+let sum=0;
+for(const v of kept)sum+=v;
+return sum/kept.length;
+}
+function winsorizedMean(values,share=0.1){
+const n=values.length;
+if(!n)return null;
+const sorted=Array.from(values).sort((a,b)=>a-b);
+const cut=Math.floor(n*Math.min(0.49,Math.max(0,share)));
+const low=sorted[cut];
+const high=sorted[n-1-cut];
+let sum=0;
+for(const v of sorted)sum+=Math.min(high,Math.max(low,v));
+return sum/n;
+}
+function modifiedZOutliers(values,threshold=3.5){
+const n=values.length;
+if(!n)return null;
+const sorted=Array.from(values).sort((a,b)=>a-b);
+const middle=quantileSorted(sorted,0.5);
+const deviations=sorted.map((v)=>Math.abs(v-middle)).sort((a,b)=>a-b);
+const mad=quantileSorted(deviations,0.5);
+if(mad===0)return null;
+let count=0;
+for(const v of sorted)if(Math.abs((0.6745*(v-middle))/mad)>threshold)count++;
+return count;
+}
+function jarqueBera(values){
+const n=values.length;
+if(n<8)return null;
+let mean=0;
+for(const v of values)mean+=v;
+mean/=n;
+let m2=0;
+let m3=0;
+let m4=0;
+for(const v of values){
+const d=v-mean;
+m2+=d*d;
+m3+=d*d*d;
+m4+=d*d*d*d;
+}
+m2/=n;
+m3/=n;
+m4/=n;
+if(m2===0)return null;
+const skew=m3/m2**1.5;
+const excess=m4/(m2*m2)-3;
+return(n/6)*(skew*skew+(excess*excess)/4);
+}
+function weightedQuantile(values,weights,p){
+const paired=[];
+let total=0;
+for(let i=0;i<values.length;i++){
+const v=Number(values[i]);
+const w=Number(weights[i]);
+if(!Number.isFinite(v)||!Number.isFinite(w)||w<=0)continue;
+paired.push([v,w]);
+total+=w;
+}
+if(!paired.length||total<=0)return null;
+paired.sort((a,b)=>a[0]-b[0]);
+if(paired.length===1)return paired[0][0];
+const at=[];
+let seen=0;
+for(const[,w]of paired){
+at.push((seen+w/2)/total);
+seen+=w;
+}
+const target=Math.max(0,Math.min(1,p));
+if(target<=at[0])return paired[0][0];
+if(target>=at[at.length-1])return paired[paired.length-1][0];
+for(let i=1;i<at.length;i++){
+if(target>at[i])continue;
+const span=at[i]-at[i-1];
+const within=span>0?(target-at[i-1])/span:0;
+return paired[i-1][0]+(paired[i][0]-paired[i-1][0])*within;
+}
+return paired[paired.length-1][0];
+}
+function pairs(a,b,indices){
+const readA=valueReader(a);
+const readB=valueReader(b);
+const xs=new Float64Array(indices.length);
+const ys=new Float64Array(indices.length);
+let n=0;
+for(let i=0;i<indices.length;i++){
+const row=indices[i];
+const x=Number(readA(row));
+const y=Number(readB(row));
+if(!Number.isFinite(x)||!Number.isFinite(y))continue;
+xs[n]=x;
+ys[n]=y;
+n++;
+}
+return{xs:xs.subarray(0,n),ys:ys.subarray(0,n),n};
+}
+function covariance(a,b,indices,population=false){
+const{xs,ys,n}=pairs(a,b,indices);
+if(n<2)return null;
+let mx=0;
+let my=0;
+for(let i=0;i<n;i++){mx+=xs[i];my+=ys[i];}
+mx/=n;
+my/=n;
+let sum=0;
+for(let i=0;i<n;i++)sum+=(xs[i]-mx)*(ys[i]-my);
+return sum/(population?n:n-1);
+}
+function regression(a,b,indices){
+const{xs,ys,n}=pairs(a,b,indices);
+if(n<2)return null;
+let mx=0;
+let my=0;
+for(let i=0;i<n;i++){mx+=xs[i];my+=ys[i];}
+mx/=n;
+my/=n;
+let sxx=0;
+let sxy=0;
+let syy=0;
+for(let i=0;i<n;i++){
+const dx=xs[i]-mx;
+const dy=ys[i]-my;
+sxx+=dx*dx;
+sxy+=dx*dy;
+syy+=dy*dy;
+}
+if(sxx===0)return null;
+const slope=sxy/sxx;
+const intercept=my-slope*mx;
+const r2=syy===0?1:Math.max(0,Math.min(1,(sxy*sxy)/(sxx*syy)));
+const residual=Math.max(0,syy-slope*sxy);
+const stdError=n>2?Math.sqrt(residual/(n-2)/sxx):0;
+return{slope,intercept,r2,stdError,n};
+}
+function ranksOf(values){
+const n=values.length;
+const order=Array.from({length:n},(unused,i)=>i)
+.sort((i,j)=>values[i]-values[j]);
+const ranks=new Float64Array(n);
+let i=0;
+while(i<n){
+let j=i;
+while(j+1<n&&values[order[j+1]]===values[order[i]])j++;
+const shared=(i+j)/2+1;
+for(let k=i;k<=j;k++)ranks[order[k]]=shared;
+i=j+1;
+}
+return ranks;
+}
+function spearman(a,b,indices){
+const{xs,ys,n}=pairs(a,b,indices);
+if(n<2)return null;
+const rx=ranksOf(xs);
+const ry=ranksOf(ys);
+let mx=0;
+let my=0;
+for(let i=0;i<n;i++){mx+=rx[i];my+=ry[i];}
+mx/=n;
+my/=n;
+let sxy=0;
+let sxx=0;
+let syy=0;
+for(let i=0;i<n;i++){
+const dx=rx[i]-mx;
+const dy=ry[i]-my;
+sxy+=dx*dy;
+sxx+=dx*dx;
+syy+=dy*dy;
+}
+if(sxx===0||syy===0)return null;
+return Math.max(-1,Math.min(1,sxy/Math.sqrt(sxx*syy)));
+}
+function kendall(a,b,indices){
+const{xs,ys,n}=pairs(a,b,indices);
+if(n<2||n>KENDALL_LIMIT)return null;
+let concordant=0;
+let discordant=0;
+let tiedXOnly=0;
+let tiedYOnly=0;
+for(let i=0;i<n;i++){
+for(let j=i+1;j<n;j++){
+const dx=Math.sign(xs[i]-xs[j]);
+const dy=Math.sign(ys[i]-ys[j]);
+const product=dx*dy;
+if(product>0)concordant++;
+else if(product<0)discordant++;
+else if(dx===0&&dy===0){}
+else if(dx===0)tiedXOnly++;
+else tiedYOnly++;
+}
+}
+const orderedByX=concordant+discordant+tiedYOnly;
+const orderedByY=concordant+discordant+tiedXOnly;
+if(orderedByX===0||orderedByY===0)return null;
+return(concordant-discordant)/Math.sqrt(orderedByX*orderedByY);
+}
+function seriesStats(ordered,opts={}){
+const n=ordered.length;
+if(n<2)return null;
+const first=ordered[0];
+const last=ordered[n-1];
+const returns=[];
+for(let i=1;i<n;i++){
+const previous=ordered[i-1];
+if(previous===0)continue;
+returns.push((ordered[i]-previous)/Math.abs(previous));
+}
+let volatility=null;
+if(returns.length>1){
+let mean=0;
+for(const r of returns)mean+=r;
+mean/=returns.length;
+let m2=0;
+for(const r of returns)m2+=(r-mean)**2;
+volatility=Math.sqrt(m2/(returns.length-1));
+}
+const periods=Number(opts.periodsPerYear)>0?Number(opts.periodsPerYear):null;
+let peak=ordered[0];
+let peakAt=0;
+let worst=0;
+let worstFrom=0;
+let worstTo=0;
+for(let i=1;i<n;i++){
+if(ordered[i]>peak){peak=ordered[i];peakAt=i;continue;}
+if(peak<=0)continue;
+const fall=(peak-ordered[i])/peak;
+if(fall>worst){worst=fall;worstFrom=peakAt;worstTo=i;}
+}
+let autocorrelation=null;
+if(n>2){
+let mean=0;
+for(let i=0;i<n;i++)mean+=ordered[i];
+mean/=n;
+let top=0;
+let bottom=0;
+for(let i=0;i<n;i++){
+const d=ordered[i]-mean;
+bottom+=d*d;
+if(i>0)top+=d*(ordered[i-1]-mean);
+}
+autocorrelation=bottom>0?top/bottom:null;
+}
+let up=0;
+let down=0;
+for(const r of returns){if(r>0)up++;else if(r<0)down++;}
+let growth=null;
+if(first>0&&last>0){
+const perPeriod=(last/first)**(1/(n-1))-1;
+growth=periods?(1+perPeriod)**periods-1:perPeriod;
+}
+return{
+n,
+first,
+last,
+change:last-first,
+changePercent:first===0?null:((last-first)/Math.abs(first))*100,
+volatility,
+annualisedVolatility:volatility!==null&&periods?volatility*Math.sqrt(periods):null,
+growth,
+maxDrawdown:worst,
+maxDrawdownFrom:worstFrom,
+maxDrawdownTo:worstTo,
+autocorrelation,
+upDays:up,
+downDays:down,
+};
+}
+const D2_N2=1.128;
+function withinSigma(ordered){
+const n=ordered.length;
+if(n<2)return null;
+let total=0;
+for(let i=1;i<n;i++)total+=Math.abs(ordered[i]-ordered[i-1]);
+const meanRange=total/(n-1);
+return{sigma:meanRange/D2_N2,meanRange};
+}
+function capability(ordered,spec){
+const n=ordered.length;
+if(n<2||!spec)return null;
+const lower=Number.isFinite(Number(spec.lower))?Number(spec.lower):null;
+const upper=Number.isFinite(Number(spec.upper))?Number(spec.upper):null;
+if(lower===null&&upper===null)return null;
+let mean=0;
+for(let i=0;i<n;i++)mean+=ordered[i];
+mean/=n;
+let m2=0;
+for(let i=0;i<n;i++)m2+=(ordered[i]-mean)**2;
+const overall=Math.sqrt(m2/(n-1));
+const within=withinSigma(ordered);
+const sigmaWithin=within?within.sigma:null;
+const indices=(sigma)=>{
+if(!sigma||sigma<=0)return{index:null,k:null};
+const both=lower!==null&&upper!==null;
+const index=both?(upper-lower)/(6*sigma):null;
+const upperSide=upper!==null?(upper-mean)/(3*sigma):Infinity;
+const lowerSide=lower!==null?(mean-lower)/(3*sigma):Infinity;
+return{index,k:Math.min(upperSide,lowerSide)};
+};
+const short=indices(sigmaWithin);
+const long=indices(overall);
+let outOfSpec=0;
+for(let i=0;i<n;i++){
+if(lower!==null&&ordered[i]<lower){outOfSpec++;continue;}
+if(upper!==null&&ordered[i]>upper)outOfSpec++;
+}
+return{
+n,
+mean,
+lower,
+upper,
+target:Number.isFinite(Number(spec.target))?Number(spec.target):null,
+sigmaWithin,
+sigmaOverall:overall,
+cp:short.index,
+cpk:short.k,
+pp:long.index,
+ppk:long.k,
+outOfSpec,
+defectRate:n?outOfSpec/n:null,
+};
+}
+function controlLimits(ordered){
+const n=ordered.length;
+if(n<2)return null;
+const within=withinSigma(ordered);
+if(!within||!(within.sigma>0))return null;
+let centre=0;
+for(let i=0;i<n;i++)centre+=ordered[i];
+centre/=n;
+return{
+centre,
+sigma:within.sigma,
+upper:centre+3*within.sigma,
+lower:centre-3*within.sigma,
+};
+}
+function controlViolations(ordered,limits){
+if(!limits||!(limits.sigma>0))return[];
+const n=ordered.length;
+const{centre,sigma}=limits;
+const z=(i)=>(ordered[i]-centre)/sigma;
+const out=[];
+for(let i=0;i<n;i++){
+if(Math.abs(z(i))>3){
+out.push({index:i,rule:1,description:'beyond three sigma'});
+}
+if(i>=2){
+for(const side of[1,-1]){
+let hits=0;
+for(let k=i-2;k<=i;k++)if(z(k)*side>2)hits++;
+if(hits>=2){
+out.push({index:i,rule:2,description:'two of three past two sigma'});
+break;
+}
+}
+}
+if(i>=4){
+for(const side of[1,-1]){
+let hits=0;
+for(let k=i-4;k<=i;k++)if(z(k)*side>1)hits++;
+if(hits>=4){
+out.push({index:i,rule:3,description:'four of five past one sigma'});
+break;
+}
+}
+}
+if(i>=7){
+for(const side of[1,-1]){
+let all=true;
+for(let k=i-7;k<=i;k++)if(z(k)*side<=0){all=false;break;}
+if(all){
+out.push({index:i,rule:4,description:'eight in a row on one side'});
+break;
+}
+}
+}
+}
+return out;
+}
 function countOutside(values,low,high){
 let count=0;
 for(let i=0;i<values.length;i++){
@@ -24449,132 +25149,143 @@ const ShadowTracker=__m8["ShadowTracker"];
 const shadowsIn=__m8["shadowsIn"];
 const __m9=__req("packages/core/src/compute/total.js");
 const total=__m9["total"];
-const __m10=__req("packages/core/src/compute/statistics.js");
-const MAINTENANCE=__m10["MAINTENANCE"];
-const statCorrelation=__m10["correlation"];
-const statMoments=__m10["moments"];
-const countOutside=__m10["countOutside"];
-const statHistogram=__m10["histogram"];
-const statNumbers=__m10["numbers"];
-const statQuantileSorted=__m10["quantileSorted"];
-const statWeightedAverage=__m10["weightedAverage"];
-const __m11=__req("packages/core/src/columns/detailcolumn.js");
-const createDetailColumn=__m11["createDetailColumn"];
-const DETAIL_COLUMN_ID=__m11["DETAIL_COLUMN_ID"];
-const __m12=__req("packages/core/src/columns/treecolumn.js");
-const createTreeColumn=__m12["createTreeColumn"];
-const TREE_COLUMN_ID=__m12["TREE_COLUMN_ID"];
-const __m13=__req("packages/core/src/columns/pivotcolumns.js");
-const createPivotColumns=__m13["createPivotColumns"];
-const __m14=__req("packages/core/src/compute/pivot.js");
-const pivotKey=__m14["pivotKey"];
-const DEFAULT_PATH_SEPARATOR=__m14["DEFAULT_PATH_SEPARATOR"];
-const __m15=__req("packages/core/src/columns/value.js");
-const ValuePipeline=__m15["ValuePipeline"];
-const __m16=__req("packages/core/src/store/columnstore.js");
-const ColumnStore=__m16["ColumnStore"];
-const __m17=__req("packages/core/src/store/pool.js");
-const MaskPool=__m17["MaskPool"];
-const __m18=__req("packages/core/src/compute/index.js");
-const compute=__m18;
-const __m19=__req("packages/core/src/source/index.js");
-const createSource=__m19["createSource"];
-const __m20=__req("packages/core/src/source/rows.js");
-const pinnedRow=__m20["pinnedRow"];
-const DEFAULT_ROW_HEIGHT=__m20["DEFAULT_ROW_HEIGHT"];
-const __m21=__req("packages/core/src/model/rowkey.js");
-const createRowKey=__m21["createRowKey"];
-const __m22=__req("packages/core/src/model/rowmodel.js");
-const RowModel=__m22["RowModel"];
-const createRow=__m22["createRow"];
-const __m23=__req("packages/core/src/model/selection.js");
-const SelectionModel=__m23["SelectionModel"];
-const RangeModel=__m23["RangeModel"];
-const summarise=__m23["summarise"];
-const __m24=__req("packages/core/src/model/history.js");
-const HistoryModel=__m24["HistoryModel"];
-const __m25=__req("packages/core/src/model/diff.js");
-const DiffModel=__m25["DiffModel"];
-const readValue=__m25["readValue"];
-const __m26=__req("packages/core/src/model/views.js");
-const ViewStore=__m26["ViewStore"];
-const __m27=__req("packages/core/src/model/highlight.js");
-const HighlightModel=__m27["HighlightModel"];
-const __m28=__req("packages/core/src/model/redaction.js");
-const RedactionModel=__m28["RedactionModel"];
-const __m29=__req("packages/core/src/model/presentation.js");
-const PresentationModel=__m29["PresentationModel"];
-const __m30=__req("packages/core/src/model/timeline.js");
-const Timeline=__m30["Timeline"];
-const __m31=__req("packages/core/src/model/facets.js");
-const FacetModel=__m31["FacetModel"];
-const DEFAULT_DEBOUNCE=__m31["DEFAULT_DEBOUNCE"];
-const DEFAULT_ROW_CEILING=__m31["DEFAULT_ROW_CEILING"];
-const DEFAULT_FACET_HEIGHT=__m31["DEFAULT_FACET_HEIGHT"];
-const __m32=__req("packages/core/src/model/comments.js");
-const CommentModel=__m32["CommentModel"];
-const parseCommentKey=__m32["parseCellKey"];
-const DEFAULT_INDEX_DEBOUNCE=__m32["DEFAULT_INDEX_DEBOUNCE"];
-const DEFAULT_INDEX_LIMIT=__m32["DEFAULT_INDEX_LIMIT"];
-const __m33=__req("packages/core/src/model/diagnostics.js");
-const Diagnostics=__m33["Diagnostics"];
-const WARNING_IDS=__m33["WARNING_IDS"];
-const instrument=__m33["instrument"];
-const instrumentProvider=__m33["instrumentProvider"];
-const __m34=__req("packages/core/src/model/presence.js");
-const PresenceModel=__m34["PresenceModel"];
-const DEFAULT_THROTTLE_MS=__m34["DEFAULT_THROTTLE_MS"];
-const DEFAULT_IDLE_MS=__m34["DEFAULT_IDLE_MS"];
-const DEFAULT_REMOVE_MS=__m34["DEFAULT_REMOVE_MS"];
-const DEFAULT_LOCK_MS=__m34["DEFAULT_LOCK_MS"];
-const __m35=__req("packages/core/src/compute/facet.js");
-const facetKind=__m35["facetKind"];
-const DEFAULT_BUCKETS=__m35["DEFAULT_BUCKETS"];
-const DEFAULT_CARDINALITY_LIMIT=__m35["DEFAULT_CARDINALITY_LIMIT"];
-const __m36=__req("packages/worker/src/host.js");
-const createWorkerHost=__m36["createWorkerHost"];
-const __m37=__req("packages/core/src/i18n/index.js");
-const Messages=__m37["Messages"];
-const MESSAGE_KEYS=__m37["MESSAGE_KEYS"];
-const __m38=__req("packages/core/src/model/pending.js");
-const PendingWrites=__m38["PendingWrites"];
-const __m39=__req("packages/core/src/registry/licence.js");
-const setSharedLicence=__m39["setLicence"];
-const licenceInfo=__m39["licenceInfo"];
-const licenceWatermark=__m39["watermark"];
-const licenceState=__m39["licenceState"];
-const sharedLicence=__m39["sharedLicence"];
-const __m40=__req("packages/core/src/columns/permissions.js");
-const PermissionModel=__m40["PermissionModel"];
-const __m41=__req("packages/core/src/ai/schema.js");
-const describeGrid=__m41["describeGrid"];
-const promptText=__m41["promptText"];
-const toolDefinition=__m41["toolDefinition"];
-const __m42=__req("packages/core/src/ai/intent.js");
-const planIntent=__m42["planIntent"];
-const applyPlan=__m42["applyPlan"];
-const buildPrompt=__m42["buildPrompt"];
-const __m43=__req("packages/core/src/model/edit.js");
-const EditModel=__m43["EditModel"];
-const __m44=__req("packages/core/src/model/changes.js");
-const ChangeModel=__m44["ChangeModel"];
-const __m45=__req("packages/core/src/model/state.js");
-const StateModel=__m45["StateModel"];
-const __m46=__req("packages/core/src/formatting/model.js");
-const FormattingModel=__m46["FormattingModel"];
-const GRID_SCOPE=__m46["GRID_SCOPE"];
-const __m47=__req("packages/core/src/formatting/rules.js");
-const summariseColumn=__m47["summariseColumn"];
-const __m48=__req("packages/core/src/export/index.js");
-const exportCsv=__m48["exportCsv"];
-const exportExcel=__m48["exportExcel"];
-const copyToClipboard=__m48["copyToClipboard"];
-const writeClipboardText=__m48["writeClipboardText"];
-const printGrid=__m48["printGrid"];
-const buildClipboardText=__m48["buildClipboardText"];
-const pasteIntoRange=__m48["pasteIntoRange"];
-const writeHookFor=__m48["writeHookFor"];
-const parseClipboardText=__m48["parseClipboardText"];
+const __m10=__req("packages/core/src/compute/handle.js");
+const statValueReader=__m10["valueReader"];
+const __m11=__req("packages/core/src/compute/statistics.js");
+const MAINTENANCE=__m11["MAINTENANCE"];
+const statCorrelation=__m11["correlation"];
+const statMoments=__m11["moments"];
+const countOutside=__m11["countOutside"];
+const statCapability=__m11["capability"];
+const statControlLimits=__m11["controlLimits"];
+const statControlViolations=__m11["controlViolations"];
+const statCovariance=__m11["covariance"];
+const statHistogram=__m11["histogram"];
+const statKendall=__m11["kendall"];
+const statRegression=__m11["regression"];
+const statSeries=__m11["seriesStats"];
+const statSpearman=__m11["spearman"];
+const statWeightedQuantile=__m11["weightedQuantile"];
+const statNumbers=__m11["numbers"];
+const statQuantileSorted=__m11["quantileSorted"];
+const statWeightedAverage=__m11["weightedAverage"];
+const __m12=__req("packages/core/src/columns/detailcolumn.js");
+const createDetailColumn=__m12["createDetailColumn"];
+const DETAIL_COLUMN_ID=__m12["DETAIL_COLUMN_ID"];
+const __m13=__req("packages/core/src/columns/treecolumn.js");
+const createTreeColumn=__m13["createTreeColumn"];
+const TREE_COLUMN_ID=__m13["TREE_COLUMN_ID"];
+const __m14=__req("packages/core/src/columns/pivotcolumns.js");
+const createPivotColumns=__m14["createPivotColumns"];
+const __m15=__req("packages/core/src/compute/pivot.js");
+const pivotKey=__m15["pivotKey"];
+const DEFAULT_PATH_SEPARATOR=__m15["DEFAULT_PATH_SEPARATOR"];
+const __m16=__req("packages/core/src/columns/value.js");
+const ValuePipeline=__m16["ValuePipeline"];
+const __m17=__req("packages/core/src/store/columnstore.js");
+const ColumnStore=__m17["ColumnStore"];
+const __m18=__req("packages/core/src/store/pool.js");
+const MaskPool=__m18["MaskPool"];
+const __m19=__req("packages/core/src/compute/index.js");
+const compute=__m19;
+const __m20=__req("packages/core/src/source/index.js");
+const createSource=__m20["createSource"];
+const __m21=__req("packages/core/src/source/rows.js");
+const pinnedRow=__m21["pinnedRow"];
+const DEFAULT_ROW_HEIGHT=__m21["DEFAULT_ROW_HEIGHT"];
+const __m22=__req("packages/core/src/model/rowkey.js");
+const createRowKey=__m22["createRowKey"];
+const __m23=__req("packages/core/src/model/rowmodel.js");
+const RowModel=__m23["RowModel"];
+const createRow=__m23["createRow"];
+const __m24=__req("packages/core/src/model/selection.js");
+const SelectionModel=__m24["SelectionModel"];
+const RangeModel=__m24["RangeModel"];
+const summarise=__m24["summarise"];
+const __m25=__req("packages/core/src/model/history.js");
+const HistoryModel=__m25["HistoryModel"];
+const __m26=__req("packages/core/src/model/diff.js");
+const DiffModel=__m26["DiffModel"];
+const readValue=__m26["readValue"];
+const __m27=__req("packages/core/src/model/views.js");
+const ViewStore=__m27["ViewStore"];
+const __m28=__req("packages/core/src/model/highlight.js");
+const HighlightModel=__m28["HighlightModel"];
+const __m29=__req("packages/core/src/model/redaction.js");
+const RedactionModel=__m29["RedactionModel"];
+const __m30=__req("packages/core/src/model/presentation.js");
+const PresentationModel=__m30["PresentationModel"];
+const __m31=__req("packages/core/src/model/timeline.js");
+const Timeline=__m31["Timeline"];
+const __m32=__req("packages/core/src/model/facets.js");
+const FacetModel=__m32["FacetModel"];
+const DEFAULT_DEBOUNCE=__m32["DEFAULT_DEBOUNCE"];
+const DEFAULT_ROW_CEILING=__m32["DEFAULT_ROW_CEILING"];
+const DEFAULT_FACET_HEIGHT=__m32["DEFAULT_FACET_HEIGHT"];
+const __m33=__req("packages/core/src/model/comments.js");
+const CommentModel=__m33["CommentModel"];
+const parseCommentKey=__m33["parseCellKey"];
+const DEFAULT_INDEX_DEBOUNCE=__m33["DEFAULT_INDEX_DEBOUNCE"];
+const DEFAULT_INDEX_LIMIT=__m33["DEFAULT_INDEX_LIMIT"];
+const __m34=__req("packages/core/src/model/diagnostics.js");
+const Diagnostics=__m34["Diagnostics"];
+const WARNING_IDS=__m34["WARNING_IDS"];
+const instrument=__m34["instrument"];
+const instrumentProvider=__m34["instrumentProvider"];
+const __m35=__req("packages/core/src/model/presence.js");
+const PresenceModel=__m35["PresenceModel"];
+const DEFAULT_THROTTLE_MS=__m35["DEFAULT_THROTTLE_MS"];
+const DEFAULT_IDLE_MS=__m35["DEFAULT_IDLE_MS"];
+const DEFAULT_REMOVE_MS=__m35["DEFAULT_REMOVE_MS"];
+const DEFAULT_LOCK_MS=__m35["DEFAULT_LOCK_MS"];
+const __m36=__req("packages/core/src/compute/facet.js");
+const facetKind=__m36["facetKind"];
+const DEFAULT_BUCKETS=__m36["DEFAULT_BUCKETS"];
+const DEFAULT_CARDINALITY_LIMIT=__m36["DEFAULT_CARDINALITY_LIMIT"];
+const __m37=__req("packages/worker/src/host.js");
+const createWorkerHost=__m37["createWorkerHost"];
+const __m38=__req("packages/core/src/i18n/index.js");
+const Messages=__m38["Messages"];
+const MESSAGE_KEYS=__m38["MESSAGE_KEYS"];
+const __m39=__req("packages/core/src/model/pending.js");
+const PendingWrites=__m39["PendingWrites"];
+const __m40=__req("packages/core/src/registry/licence.js");
+const setSharedLicence=__m40["setLicence"];
+const licenceInfo=__m40["licenceInfo"];
+const licenceWatermark=__m40["watermark"];
+const licenceState=__m40["licenceState"];
+const sharedLicence=__m40["sharedLicence"];
+const __m41=__req("packages/core/src/columns/permissions.js");
+const PermissionModel=__m41["PermissionModel"];
+const __m42=__req("packages/core/src/ai/schema.js");
+const describeGrid=__m42["describeGrid"];
+const promptText=__m42["promptText"];
+const toolDefinition=__m42["toolDefinition"];
+const __m43=__req("packages/core/src/ai/intent.js");
+const planIntent=__m43["planIntent"];
+const applyPlan=__m43["applyPlan"];
+const buildPrompt=__m43["buildPrompt"];
+const __m44=__req("packages/core/src/model/edit.js");
+const EditModel=__m44["EditModel"];
+const __m45=__req("packages/core/src/model/changes.js");
+const ChangeModel=__m45["ChangeModel"];
+const __m46=__req("packages/core/src/model/state.js");
+const StateModel=__m46["StateModel"];
+const __m47=__req("packages/core/src/formatting/model.js");
+const FormattingModel=__m47["FormattingModel"];
+const GRID_SCOPE=__m47["GRID_SCOPE"];
+const __m48=__req("packages/core/src/formatting/rules.js");
+const summariseColumn=__m48["summariseColumn"];
+const __m49=__req("packages/core/src/export/index.js");
+const exportCsv=__m49["exportCsv"];
+const exportExcel=__m49["exportExcel"];
+const copyToClipboard=__m49["copyToClipboard"];
+const writeClipboardText=__m49["writeClipboardText"];
+const printGrid=__m49["printGrid"];
+const buildClipboardText=__m49["buildClipboardText"];
+const pasteIntoRange=__m49["pasteIntoRange"];
+const writeHookFor=__m49["writeHookFor"];
+const parseClipboardText=__m49["parseClipboardText"];
 const QUICK_MODES=['contains','words','fuzzy','regex'];
 function canonicalise(column,value){
 const lookup=column&&column.lookup;
@@ -24718,6 +25429,8 @@ pageSize:0,
 #renderer=null;
 #destroyed=false;
 #shadows=new Map();
+#running=new Map();
+#filteredKeyCache=null;
 #ready=false;
 #teardown=new Set();
 constructor(config={}){
@@ -25526,6 +26239,75 @@ return this.#store?this.#store.column(colId):undefined;
 const handle=this.#handleFor(colId);
 return handle?statNumbers(handle,this.#statIndices()):new Float64Array(0);
 }
+#filteredKeys(){
+const indices=this.#statIndices();
+if(this.#filteredKeyCache&&this.#filteredKeyCache.indices===indices){
+return this.#filteredKeyCache.keys;
+}
+const keys=new Set();
+const all=isFunction(this.#source.rows)?this.#source.rows():null;
+for(let i=0;i<indices.length;i++){
+const data=all?all[indices[i]]:null;
+const key=data==null?null:this.#rowKey(data);
+if(key!==null&&key!==undefined)keys.add(String(key));
+}
+this.#filteredKeyCache={indices,keys};
+return keys;
+}
+#runningValues(colId,kind){
+const rows=this.#displayRows();
+const cached=this.#running.get(colId);
+if(cached&&cached.rows===rows&&cached.kind===kind)return cached.values;
+const values=new Map();
+let total=0;
+let grand=0;
+if(kind==='percent'){
+for(const row of rows){
+if(!row||row.kind)continue;
+const v=Number(this.#values.value(this.#columns.get(colId),row.data,row));
+if(Number.isFinite(v))grand+=v;
+}
+}
+for(const row of rows){
+if(!row||row.kind)continue;
+const v=Number(this.#values.value(this.#columns.get(colId),row.data,row));
+if(Number.isFinite(v))total+=v;
+const key=row.key===undefined||row.key===null?null:String(row.key);
+if(!key)continue;
+values.set(key,kind==='percent'?(grand?(total/grand)*100:null):total);
+}
+this.#running.set(colId,{rows,kind,values});
+return values;
+}
+#orderedValues(colId,by){
+const values=this.#handleFor(colId);
+if(!values)return null;
+const indices=this.#statIndices();
+const readValue=statValueReader(values);
+if(!by){
+const out=[];
+for(let i=0;i<indices.length;i++){
+const v=Number(readValue(indices[i]));
+if(Number.isFinite(v))out.push(v);
+}
+return out;
+}
+const order=this.#handleFor(by);
+if(!order)return null;
+const readOrder=statValueReader(order);
+const rows=[];
+for(let i=0;i<indices.length;i++){
+const row=indices[i];
+const v=Number(readValue(row));
+const raw=readOrder(row);
+const at=raw instanceof Date?raw.getTime()
+:(typeof raw==='number'?raw:Date.parse(String(raw)));
+if(!Number.isFinite(v)||!Number.isFinite(at))continue;
+rows.push([at,v]);
+}
+rows.sort((x,y)=>x[0]-y[0]);
+return rows.map((r)=>r[1]);
+}
 #statIndices(){
 const source=this.#source;
 if(isFunction(source.filteredIndices))return source.filteredIndices();
@@ -26527,6 +27309,36 @@ return summarise(grid.#ranges.cells((i)=>grid.rows.get(i)).map(
 ({key,colId})=>grid.rows.value(key,colId),
 ));
 },
+statistics(){
+const cells=grid.#ranges.cells((i)=>grid.rows.get(i));
+if(!cells.length)return null;
+const raw=cells.map(({key,colId})=>grid.rows.value(key,colId));
+const base=summarise(raw);
+const numbers=[];
+const seen=new Set();
+for(const v of raw){
+if(v===null||v===undefined||v==='')continue;
+seen.add(typeof v==='object'?String(v):v);
+const n=typeof v==='number'?v:Number(v);
+if(Number.isFinite(n))numbers.push(n);
+}
+if(!numbers.length)return{...base,cells:cells.length,distinct:seen.size};
+const sorted=numbers.slice().sort((a,b)=>a-b);
+const{n,mean,m2}=statMoments(Float64Array.from(sorted));
+const q1=statQuantileSorted(sorted,0.25);
+const q3=statQuantileSorted(sorted,0.75);
+return{
+...base,
+cells:cells.length,
+distinct:seen.size,
+median:statQuantileSorted(sorted,0.5),
+q1,
+q3,
+iqr:q3-q1,
+stddev:n>1?Math.sqrt(m2/(n-1)):null,
+outliers:countOutside(Float64Array.from(sorted),q1-1.5*(q3-q1),q3+1.5*(q3-q1)),
+};
+},
 };
 }
 get filters(){
@@ -27352,9 +28164,9 @@ get active(){return grid.#redaction.active;},
 get statistics(){
 const grid=this;
 return{
-shadow(colId,kind,rowKey){
+shadow(colId,kind,rowKey,scope){
 const tracker=grid.#shadows.get(colId);
-return tracker?tracker.read(kind,rowKey):null;
+return tracker?tracker.read(kind,rowKey,scope==='filtered'?grid.#filteredKeys():undefined):null;
 },
 rebase(colId){
 if(colId){
@@ -27412,6 +28224,79 @@ const second=grid.#handleFor(b);
 if(!first||!second)return null;
 return statCorrelation(first,second,grid.#statIndices());
 },
+covariance(a,b,opts={}){
+const first=grid.#handleFor(a);
+const second=grid.#handleFor(b);
+if(!first||!second)return null;
+return statCovariance(first,second,grid.#statIndices(),opts.population===true);
+},
+regression(a,b){
+const first=grid.#handleFor(a);
+const second=grid.#handleFor(b);
+if(!first||!second)return null;
+return statRegression(first,second,grid.#statIndices());
+},
+spearman(a,b){
+const first=grid.#handleFor(a);
+const second=grid.#handleFor(b);
+if(!first||!second)return null;
+return statSpearman(first,second,grid.#statIndices());
+},
+kendall(a,b){
+const first=grid.#handleFor(a);
+const second=grid.#handleFor(b);
+if(!first||!second)return null;
+return statKendall(first,second,grid.#statIndices());
+},
+weightedQuantile(colId,weightId,p=0.5){
+const values=grid.#handleFor(colId);
+const weights=grid.#handleFor(weightId);
+if(!values||!weights)return null;
+const indices=grid.#statIndices();
+const readV=statValueReader(values);
+const readW=statValueReader(weights);
+const vs=[];
+const ws=[];
+for(let i=0;i<indices.length;i++){
+vs.push(Number(readV(indices[i])));
+ws.push(Number(readW(indices[i])));
+}
+return statWeightedQuantile(vs,ws,p);
+},
+running(colId,kind,rowKey){
+const values=grid.#runningValues(colId,kind);
+return values&&values.has(rowKey)?values.get(rowKey):null;
+},
+capability(colId,opts={}){
+const handle=grid.#handleFor(colId);
+if(!handle)return null;
+const column=grid.#columns.get(colId);
+const declared=(column&&column.spec)||{};
+const spec={
+lower:opts.lower===undefined?declared.lower:opts.lower,
+upper:opts.upper===undefined?declared.upper:opts.upper,
+target:opts.target===undefined?declared.target:opts.target,
+};
+const ordered=grid.#orderedValues(colId,opts.by);
+if(!ordered)return null;
+const result=statCapability(ordered,spec);
+if(!result)return null;
+const from=Number(opts.baseline)>1
+?ordered.slice(0,Math.min(ordered.length,Math.floor(Number(opts.baseline))))
+:ordered;
+const limits=statControlLimits(from);
+return{
+...result,
+limits,
+baseline:from.length,
+violations:limits?statControlViolations(ordered,limits):[],
+};
+},
+series(colId,opts){
+if(!opts||!opts.by)return null;
+const ordered=grid.#orderedValues(colId,opts.by);
+return ordered?statSeries(ordered,opts):null;
+},
 weightedAverage(colId,weightId){
 const values=grid.#handleFor(colId);
 const weights=grid.#handleFor(weightId);
@@ -27899,6 +28784,62 @@ other:'{count} cellules mises à jour',
 'panel.quickFilter':'Filtre rapide',
 'panel.formatting':'Mise en forme',
 'panel.statistics':'Statistiques',
+'panel.compare':'Comparer',
+'compare.first':'Première colonne',
+'compare.second':'Deuxième colonne',
+'compare.needTwo':'Deux colonnes numériques sont nécessaires',
+'compare.noPairs':'Aucune ligne n’a de valeur dans les deux',
+'compare.pairs':'{count} paires',
+'compare.pearson':'Corrélation (Pearson)',
+'compare.spearman':'Corrélation des rangs (Spearman)',
+'compare.kendall':'Tau de Kendall',
+'compare.covariance':'Covariance',
+'compare.slope':'Pente',
+'compare.intercept':'Ordonnée à l’origine',
+'compare.r2':'R²',
+'compare.stdError':'Erreur type',
+'compare.weighted':'Moyenne pondérée',
+'total.sum':'Somme',
+'total.avg':'Moyenne',
+'total.min':'Min',
+'total.max':'Max',
+'total.count':'Nombre',
+'total.countValues':'Nombre de valeurs',
+'total.first':'Premier',
+'total.last':'Dernier',
+'total.median':'Médiane',
+'total.p25':'25e centile',
+'total.p75':'75e centile',
+'total.p90':'90e centile',
+'total.p95':'95e centile',
+'total.p99':'99e centile',
+'total.iqr':'Écart interquartile',
+'total.mad':'Écart absolu médian',
+'total.variance':'Variance',
+'total.varianceP':'Variance (population)',
+'total.stddev':'Écart type',
+'total.stddevP':'Écart type (population)',
+'total.range':'Étendue',
+'total.distinct':'Valeurs distinctes',
+'total.mode':'Mode',
+'total.skewness':'Asymétrie',
+'total.kurtosis':'Aplatissement',
+'total.geomean':'Moyenne géométrique',
+'total.harmean':'Moyenne harmonique',
+'total.sumSquares':'Somme des carrés',
+'total.weightedAvg':'Moyenne pondérée',
+'total.argmin':'Plus bas selon',
+'total.argmax':'Plus haut selon',
+'total.hhi':'Concentration (IHH)',
+'total.entropy':'Entropie',
+'total.evenness':'Régularité',
+'total.top3Share':'Part des 3 premiers',
+'total.top10Share':'Part des 10 premiers',
+'total.gini':'Coefficient de Gini',
+'total.trimmedMean':'Moyenne tronquée',
+'total.winsorizedMean':'Moyenne winsorisée',
+'total.robustOutliers':'Valeurs aberrantes (robuste)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Colonne',
 'stats.choose':'Choisissez une colonne à analyser',
 'stats.noColumns':'Aucune colonne numérique à analyser',
@@ -27918,6 +28859,15 @@ other:'{count} cellules mises à jour',
 'stats.outliers':'Valeurs aberrantes',
 'stats.distribution':'Distribution',
 'stats.bin':'{count} entre {from} et {to}',
+'stats.section.shape':'Forme',
+'stats.section.robust':'Robuste',
+'stats.section.concentration':'Concentration',
+'stats.section.capability':'Capabilité',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Hors spécification',
 'stats.filtered':'Sur {count} lignes filtrées',
 'panel.zone.group':'les regroupements de lignes',
 'panel.zone.values':'les valeurs',
@@ -28310,6 +29260,62 @@ other:'{count} celle aggiornate',
 'panel.quickFilter':'Filtro rapido',
 'panel.formatting':'Formattazione',
 'panel.statistics':'Statistiche',
+'panel.compare':'Confronta',
+'compare.first':'Prima colonna',
+'compare.second':'Seconda colonna',
+'compare.needTwo':'Servono due colonne numeriche',
+'compare.noPairs':'Nessuna riga ha un valore in entrambe',
+'compare.pairs':'{count} coppie',
+'compare.pearson':'Correlazione (Pearson)',
+'compare.spearman':'Correlazione per ranghi (Spearman)',
+'compare.kendall':'Tau di Kendall',
+'compare.covariance':'Covarianza',
+'compare.slope':'Pendenza',
+'compare.intercept':'Intercetta',
+'compare.r2':'R²',
+'compare.stdError':'Errore standard',
+'compare.weighted':'Media ponderata',
+'total.sum':'Somma',
+'total.avg':'Media',
+'total.min':'Min',
+'total.max':'Max',
+'total.count':'Conteggio',
+'total.countValues':'Conteggio valori',
+'total.first':'Primo',
+'total.last':'Ultimo',
+'total.median':'Mediana',
+'total.p25':'25° percentile',
+'total.p75':'75° percentile',
+'total.p90':'90° percentile',
+'total.p95':'95° percentile',
+'total.p99':'99° percentile',
+'total.iqr':'Scarto interquartile',
+'total.mad':'Deviazione assoluta mediana',
+'total.variance':'Varianza',
+'total.varianceP':'Varianza (popolazione)',
+'total.stddev':'Deviazione standard',
+'total.stddevP':'Deviazione standard (popolazione)',
+'total.range':'Intervallo',
+'total.distinct':'Distinti',
+'total.mode':'Moda',
+'total.skewness':'Asimmetria',
+'total.kurtosis':'Curtosi',
+'total.geomean':'Media geometrica',
+'total.harmean':'Media armonica',
+'total.sumSquares':'Somma dei quadrati',
+'total.weightedAvg':'Media ponderata',
+'total.argmin':'Più basso per',
+'total.argmax':'Più alto per',
+'total.hhi':'Concentrazione (HHI)',
+'total.entropy':'Entropia',
+'total.evenness':'Uniformità',
+'total.top3Share':'Quota primi 3',
+'total.top10Share':'Quota primi 10',
+'total.gini':'Coefficiente di Gini',
+'total.trimmedMean':'Media troncata',
+'total.winsorizedMean':'Media winsorizzata',
+'total.robustOutliers':'Valori anomali (robusto)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Colonna',
 'stats.choose':'Scegli una colonna da analizzare',
 'stats.noColumns':'Nessuna colonna numerica da analizzare',
@@ -28329,6 +29335,15 @@ other:'{count} celle aggiornate',
 'stats.outliers':'Valori anomali',
 'stats.distribution':'Distribuzione',
 'stats.bin':'{count} tra {from} e {to}',
+'stats.section.shape':'Forma',
+'stats.section.robust':'Robusto',
+'stats.section.concentration':'Concentrazione',
+'stats.section.capability':'Capacità',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Fuori specifica',
 'stats.filtered':'Su {count} righe filtrate',
 'panel.zone.group':'i raggruppamenti di righe',
 'panel.zone.values':'i valori',
@@ -28706,6 +29721,62 @@ other:'{count} celdas actualizadas',
 'panel.quickFilter':'Filtro rápido',
 'panel.formatting':'Formato',
 'panel.statistics':'Estadísticas',
+'panel.compare':'Comparar',
+'compare.first':'Primera columna',
+'compare.second':'Segunda columna',
+'compare.needTwo':'Se necesitan dos columnas numéricas',
+'compare.noPairs':'Ninguna fila tiene valor en ambas',
+'compare.pairs':'{count} pares',
+'compare.pearson':'Correlación (Pearson)',
+'compare.spearman':'Correlación de rangos (Spearman)',
+'compare.kendall':'Tau de Kendall',
+'compare.covariance':'Covarianza',
+'compare.slope':'Pendiente',
+'compare.intercept':'Intersección',
+'compare.r2':'R²',
+'compare.stdError':'Error típico',
+'compare.weighted':'Media ponderada',
+'total.sum':'Suma',
+'total.avg':'Promedio',
+'total.min':'Mín',
+'total.max':'Máx',
+'total.count':'Recuento',
+'total.countValues':'Recuento de valores',
+'total.first':'Primero',
+'total.last':'Último',
+'total.median':'Mediana',
+'total.p25':'Percentil 25',
+'total.p75':'Percentil 75',
+'total.p90':'Percentil 90',
+'total.p95':'Percentil 95',
+'total.p99':'Percentil 99',
+'total.iqr':'Rango intercuartílico',
+'total.mad':'Desviación absoluta mediana',
+'total.variance':'Varianza',
+'total.varianceP':'Varianza (población)',
+'total.stddev':'Desviación típica',
+'total.stddevP':'Desviación típica (población)',
+'total.range':'Rango',
+'total.distinct':'Distintos',
+'total.mode':'Moda',
+'total.skewness':'Asimetría',
+'total.kurtosis':'Curtosis',
+'total.geomean':'Media geométrica',
+'total.harmean':'Media armónica',
+'total.sumSquares':'Suma de cuadrados',
+'total.weightedAvg':'Media ponderada',
+'total.argmin':'Menor por',
+'total.argmax':'Mayor por',
+'total.hhi':'Concentración (HHI)',
+'total.entropy':'Entropía',
+'total.evenness':'Uniformidad',
+'total.top3Share':'Cuota de los 3 mayores',
+'total.top10Share':'Cuota de los 10 mayores',
+'total.gini':'Coeficiente de Gini',
+'total.trimmedMean':'Media recortada',
+'total.winsorizedMean':'Media winsorizada',
+'total.robustOutliers':'Valores atípicos (robusto)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Columna',
 'stats.choose':'Elija una columna para analizar',
 'stats.noColumns':'No hay columnas numéricas que analizar',
@@ -28725,6 +29796,15 @@ other:'{count} celdas actualizadas',
 'stats.outliers':'Valores atípicos',
 'stats.distribution':'Distribución',
 'stats.bin':'{count} entre {from} y {to}',
+'stats.section.shape':'Forma',
+'stats.section.robust':'Robusto',
+'stats.section.concentration':'Concentración',
+'stats.section.capability':'Capacidad',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Fuera de especificación',
 'stats.filtered':'De las {count} filas filtradas',
 'panel.zone.group':'las agrupaciones de filas',
 'panel.zone.values':'los valores',
@@ -29129,6 +30209,62 @@ other:'{count} células atualizadas',
 'panel.quickFilter':'Filtro rápido',
 'panel.formatting':'Formatação',
 'panel.statistics':'Estatísticas',
+'panel.compare':'Comparar',
+'compare.first':'Primeira coluna',
+'compare.second':'Segunda coluna',
+'compare.needTwo':'São necessárias duas colunas numéricas',
+'compare.noPairs':'Nenhuma linha tem valor em ambas',
+'compare.pairs':'{count} pares',
+'compare.pearson':'Correlação (Pearson)',
+'compare.spearman':'Correlação de postos (Spearman)',
+'compare.kendall':'Tau de Kendall',
+'compare.covariance':'Covariância',
+'compare.slope':'Inclinação',
+'compare.intercept':'Intercepto',
+'compare.r2':'R²',
+'compare.stdError':'Erro padrão',
+'compare.weighted':'Média ponderada',
+'total.sum':'Soma',
+'total.avg':'Média',
+'total.min':'Mín',
+'total.max':'Máx',
+'total.count':'Contagem',
+'total.countValues':'Contagem de valores',
+'total.first':'Primeiro',
+'total.last':'Último',
+'total.median':'Mediana',
+'total.p25':'Percentil 25',
+'total.p75':'Percentil 75',
+'total.p90':'Percentil 90',
+'total.p95':'Percentil 95',
+'total.p99':'Percentil 99',
+'total.iqr':'Intervalo interquartil',
+'total.mad':'Desvio absoluto mediano',
+'total.variance':'Variância',
+'total.varianceP':'Variância (população)',
+'total.stddev':'Desvio padrão',
+'total.stddevP':'Desvio padrão (população)',
+'total.range':'Amplitude',
+'total.distinct':'Distintos',
+'total.mode':'Moda',
+'total.skewness':'Assimetria',
+'total.kurtosis':'Curtose',
+'total.geomean':'Média geométrica',
+'total.harmean':'Média harmônica',
+'total.sumSquares':'Soma dos quadrados',
+'total.weightedAvg':'Média ponderada',
+'total.argmin':'Menor por',
+'total.argmax':'Maior por',
+'total.hhi':'Concentração (HHI)',
+'total.entropy':'Entropia',
+'total.evenness':'Uniformidade',
+'total.top3Share':'Participação dos 3 maiores',
+'total.top10Share':'Participação dos 10 maiores',
+'total.gini':'Coeficiente de Gini',
+'total.trimmedMean':'Média aparada',
+'total.winsorizedMean':'Média winsorizada',
+'total.robustOutliers':'Valores atípicos (robusto)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Coluna',
 'stats.choose':'Escolha uma coluna para analisar',
 'stats.noColumns':'Nenhuma coluna numérica para analisar',
@@ -29148,6 +30284,15 @@ other:'{count} células atualizadas',
 'stats.outliers':'Valores atípicos',
 'stats.distribution':'Distribuição',
 'stats.bin':'{count} entre {from} e {to}',
+'stats.section.shape':'Forma',
+'stats.section.robust':'Robusto',
+'stats.section.concentration':'Concentração',
+'stats.section.capability':'Capacidade',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Fora da especificação',
 'stats.filtered':'De {count} linhas filtradas',
 'panel.zone.group':'os agrupamentos de linhas',
 'panel.zone.values':'os valores',
@@ -29552,6 +30697,62 @@ other:'{count} Zellen aktualisiert',
 'panel.quickFilter':'Schnellfilter',
 'panel.formatting':'Formatierung',
 'panel.statistics':'Statistik',
+'panel.compare':'Vergleichen',
+'compare.first':'Erste Spalte',
+'compare.second':'Zweite Spalte',
+'compare.needTwo':'Zum Vergleich sind zwei numerische Spalten nötig',
+'compare.noPairs':'Keine Zeile hat in beiden einen Wert',
+'compare.pairs':'{count} Paare',
+'compare.pearson':'Korrelation (Pearson)',
+'compare.spearman':'Rangkorrelation (Spearman)',
+'compare.kendall':'Kendalls Tau',
+'compare.covariance':'Kovarianz',
+'compare.slope':'Steigung',
+'compare.intercept':'Achsenabschnitt',
+'compare.r2':'R²',
+'compare.stdError':'Standardfehler',
+'compare.weighted':'Gewichteter Mittelwert',
+'total.sum':'Summe',
+'total.avg':'Durchschnitt',
+'total.min':'Min',
+'total.max':'Max',
+'total.count':'Anzahl',
+'total.countValues':'Anzahl Werte',
+'total.first':'Erster',
+'total.last':'Letzter',
+'total.median':'Median',
+'total.p25':'25. Perzentil',
+'total.p75':'75. Perzentil',
+'total.p90':'90. Perzentil',
+'total.p95':'95. Perzentil',
+'total.p99':'99. Perzentil',
+'total.iqr':'Interquartilsabstand',
+'total.mad':'Mittlere absolute Abweichung',
+'total.variance':'Varianz',
+'total.varianceP':'Varianz (Grundgesamtheit)',
+'total.stddev':'Standardabweichung',
+'total.stddevP':'Standardabweichung (Grundgesamtheit)',
+'total.range':'Spannweite',
+'total.distinct':'Eindeutige',
+'total.mode':'Modus',
+'total.skewness':'Schiefe',
+'total.kurtosis':'Wölbung',
+'total.geomean':'Geometrisches Mittel',
+'total.harmean':'Harmonisches Mittel',
+'total.sumSquares':'Quadratsumme',
+'total.weightedAvg':'Gewichteter Mittelwert',
+'total.argmin':'Niedrigster nach',
+'total.argmax':'Höchster nach',
+'total.hhi':'Konzentration (HHI)',
+'total.entropy':'Entropie',
+'total.evenness':'Gleichmäßigkeit',
+'total.top3Share':'Anteil Top 3',
+'total.top10Share':'Anteil Top 10',
+'total.gini':'Gini-Koeffizient',
+'total.trimmedMean':'Getrimmtes Mittel',
+'total.winsorizedMean':'Winsorisiertes Mittel',
+'total.robustOutliers':'Ausreißer (robust)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Spalte',
 'stats.choose':'Spalte zum Analysieren wählen',
 'stats.noColumns':'Keine numerischen Spalten zum Analysieren',
@@ -29571,6 +30772,15 @@ other:'{count} Zellen aktualisiert',
 'stats.outliers':'Ausreißer',
 'stats.distribution':'Verteilung',
 'stats.bin':'{count} zwischen {from} und {to}',
+'stats.section.shape':'Form',
+'stats.section.robust':'Robust',
+'stats.section.concentration':'Konzentration',
+'stats.section.capability':'Fähigkeit',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Außerhalb der Spezifikation',
 'stats.filtered':'Von {count} gefilterten Zeilen',
 'panel.zone.group':'Zeilengruppen',
 'panel.zone.values':'Werte',
@@ -29975,6 +31185,62 @@ other:'{count} cellen bijgewerkt',
 'panel.quickFilter':'Snelfilter',
 'panel.formatting':'Opmaak',
 'panel.statistics':'Statistiek',
+'panel.compare':'Vergelijken',
+'compare.first':'Eerste kolom',
+'compare.second':'Tweede kolom',
+'compare.needTwo':'Er zijn twee numerieke kolommen nodig',
+'compare.noPairs':'Geen rij heeft een waarde in beide',
+'compare.pairs':'{count} paren',
+'compare.pearson':'Correlatie (Pearson)',
+'compare.spearman':'Rangcorrelatie (Spearman)',
+'compare.kendall':'Kendalls tau',
+'compare.covariance':'Covariantie',
+'compare.slope':'Helling',
+'compare.intercept':'Snijpunt',
+'compare.r2':'R²',
+'compare.stdError':'Standaardfout',
+'compare.weighted':'Gewogen gemiddelde',
+'total.sum':'Som',
+'total.avg':'Gemiddelde',
+'total.min':'Min',
+'total.max':'Max',
+'total.count':'Aantal',
+'total.countValues':'Aantal waarden',
+'total.first':'Eerste',
+'total.last':'Laatste',
+'total.median':'Mediaan',
+'total.p25':'25e percentiel',
+'total.p75':'75e percentiel',
+'total.p90':'90e percentiel',
+'total.p95':'95e percentiel',
+'total.p99':'99e percentiel',
+'total.iqr':'Interkwartielafstand',
+'total.mad':'Mediane absolute afwijking',
+'total.variance':'Variantie',
+'total.varianceP':'Variantie (populatie)',
+'total.stddev':'Standaardafwijking',
+'total.stddevP':'Standaardafwijking (populatie)',
+'total.range':'Bereik',
+'total.distinct':'Unieke waarden',
+'total.mode':'Modus',
+'total.skewness':'Scheefheid',
+'total.kurtosis':'Kurtosis',
+'total.geomean':'Meetkundig gemiddelde',
+'total.harmean':'Harmonisch gemiddelde',
+'total.sumSquares':'Kwadratensom',
+'total.weightedAvg':'Gewogen gemiddelde',
+'total.argmin':'Laagste op',
+'total.argmax':'Hoogste op',
+'total.hhi':'Concentratie (HHI)',
+'total.entropy':'Entropie',
+'total.evenness':'Gelijkmatigheid',
+'total.top3Share':'Aandeel top 3',
+'total.top10Share':'Aandeel top 10',
+'total.gini':'Gini-coëfficiënt',
+'total.trimmedMean':'Getrimd gemiddelde',
+'total.winsorizedMean':'Gewinsoriseerd gemiddelde',
+'total.robustOutliers':'Uitschieters (robuust)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Kolom',
 'stats.choose':'Kies een kolom om te analyseren',
 'stats.noColumns':'Geen numerieke kolommen om te analyseren',
@@ -29994,6 +31260,15 @@ other:'{count} cellen bijgewerkt',
 'stats.outliers':'Uitschieters',
 'stats.distribution':'Verdeling',
 'stats.bin':'{count} tussen {from} en {to}',
+'stats.section.shape':'Vorm',
+'stats.section.robust':'Robuust',
+'stats.section.concentration':'Concentratie',
+'stats.section.capability':'Capabiliteit',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Buiten specificatie',
 'stats.filtered':'Van {count} gefilterde rijen',
 'panel.zone.group':'de rijgroepen',
 'panel.zone.values':'de waarden',
@@ -30398,6 +31673,62 @@ other:'{count} celler uppdaterade',
 'panel.quickFilter':'Snabbfilter',
 'panel.formatting':'Formatering',
 'panel.statistics':'Statistik',
+'panel.compare':'Jämför',
+'compare.first':'Första kolumnen',
+'compare.second':'Andra kolumnen',
+'compare.needTwo':'Två numeriska kolumner krävs',
+'compare.noPairs':'Ingen rad har värde i båda',
+'compare.pairs':'{count} par',
+'compare.pearson':'Korrelation (Pearson)',
+'compare.spearman':'Rangkorrelation (Spearman)',
+'compare.kendall':'Kendalls tau',
+'compare.covariance':'Kovarians',
+'compare.slope':'Lutning',
+'compare.intercept':'Intercept',
+'compare.r2':'R²',
+'compare.stdError':'Standardfel',
+'compare.weighted':'Viktat medelvärde',
+'total.sum':'Summa',
+'total.avg':'Medelvärde',
+'total.min':'Min',
+'total.max':'Max',
+'total.count':'Antal',
+'total.countValues':'Antal värden',
+'total.first':'Första',
+'total.last':'Sista',
+'total.median':'Median',
+'total.p25':'25:e percentilen',
+'total.p75':'75:e percentilen',
+'total.p90':'90:e percentilen',
+'total.p95':'95:e percentilen',
+'total.p99':'99:e percentilen',
+'total.iqr':'Kvartilavstånd',
+'total.mad':'Median absolutavvikelse',
+'total.variance':'Varians',
+'total.varianceP':'Varians (population)',
+'total.stddev':'Standardavvikelse',
+'total.stddevP':'Standardavvikelse (population)',
+'total.range':'Variationsbredd',
+'total.distinct':'Unika',
+'total.mode':'Typvärde',
+'total.skewness':'Skevhet',
+'total.kurtosis':'Toppighet',
+'total.geomean':'Geometriskt medelvärde',
+'total.harmean':'Harmoniskt medelvärde',
+'total.sumSquares':'Kvadratsumma',
+'total.weightedAvg':'Viktat medelvärde',
+'total.argmin':'Lägst efter',
+'total.argmax':'Högst efter',
+'total.hhi':'Koncentration (HHI)',
+'total.entropy':'Entropi',
+'total.evenness':'Jämnhet',
+'total.top3Share':'Andel topp 3',
+'total.top10Share':'Andel topp 10',
+'total.gini':'Ginikoefficient',
+'total.trimmedMean':'Trimmat medelvärde',
+'total.winsorizedMean':'Winsoriserat medelvärde',
+'total.robustOutliers':'Avvikande värden (robust)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Kolumn',
 'stats.choose':'Välj en kolumn att analysera',
 'stats.noColumns':'Inga numeriska kolumner att analysera',
@@ -30417,6 +31748,15 @@ other:'{count} celler uppdaterade',
 'stats.outliers':'Avvikande värden',
 'stats.distribution':'Fördelning',
 'stats.bin':'{count} mellan {from} och {to}',
+'stats.section.shape':'Form',
+'stats.section.robust':'Robust',
+'stats.section.concentration':'Koncentration',
+'stats.section.capability':'Duglighet',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Utanför specifikation',
 'stats.filtered':'Av {count} filtrerade rader',
 'panel.zone.group':'radgrupperna',
 'panel.zone.values':'värdena',
@@ -30821,6 +32161,62 @@ other:'{count} celler opdateret',
 'panel.quickFilter':'Hurtigfilter',
 'panel.formatting':'Formatering',
 'panel.statistics':'Statistik',
+'panel.compare':'Sammenlign',
+'compare.first':'Første kolonne',
+'compare.second':'Anden kolonne',
+'compare.needTwo':'Der kræves to numeriske kolonner',
+'compare.noPairs':'Ingen rækker har værdi i begge',
+'compare.pairs':'{count} par',
+'compare.pearson':'Korrelation (Pearson)',
+'compare.spearman':'Rangkorrelation (Spearman)',
+'compare.kendall':'Kendalls tau',
+'compare.covariance':'Kovarians',
+'compare.slope':'Hældning',
+'compare.intercept':'Skæring',
+'compare.r2':'R²',
+'compare.stdError':'Standardfejl',
+'compare.weighted':'Vægtet gennemsnit',
+'total.sum':'Sum',
+'total.avg':'Gennemsnit',
+'total.min':'Min',
+'total.max':'Maks',
+'total.count':'Antal',
+'total.countValues':'Antal værdier',
+'total.first':'Første',
+'total.last':'Sidste',
+'total.median':'Median',
+'total.p25':'25. percentil',
+'total.p75':'75. percentil',
+'total.p90':'90. percentil',
+'total.p95':'95. percentil',
+'total.p99':'99. percentil',
+'total.iqr':'Interkvartilbredde',
+'total.mad':'Median absolut afvigelse',
+'total.variance':'Varians',
+'total.varianceP':'Varians (population)',
+'total.stddev':'Standardafvigelse',
+'total.stddevP':'Standardafvigelse (population)',
+'total.range':'Spændvidde',
+'total.distinct':'Unikke',
+'total.mode':'Typetal',
+'total.skewness':'Skævhed',
+'total.kurtosis':'Kurtosis',
+'total.geomean':'Geometrisk gennemsnit',
+'total.harmean':'Harmonisk gennemsnit',
+'total.sumSquares':'Kvadratsum',
+'total.weightedAvg':'Vægtet gennemsnit',
+'total.argmin':'Laveste efter',
+'total.argmax':'Højeste efter',
+'total.hhi':'Koncentration (HHI)',
+'total.entropy':'Entropi',
+'total.evenness':'Jævnhed',
+'total.top3Share':'Top 3-andel',
+'total.top10Share':'Top 10-andel',
+'total.gini':'Gini-koefficient',
+'total.trimmedMean':'Trimmet gennemsnit',
+'total.winsorizedMean':'Winsoriseret gennemsnit',
+'total.robustOutliers':'Outliere (robust)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Kolonne',
 'stats.choose':'Vælg en kolonne at analysere',
 'stats.noColumns':'Ingen numeriske kolonner at analysere',
@@ -30840,6 +32236,15 @@ other:'{count} celler opdateret',
 'stats.outliers':'Outliere',
 'stats.distribution':'Fordeling',
 'stats.bin':'{count} mellem {from} og {to}',
+'stats.section.shape':'Form',
+'stats.section.robust':'Robust',
+'stats.section.concentration':'Koncentration',
+'stats.section.capability':'Kapabilitet',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Uden for specifikation',
 'stats.filtered':'Ud af {count} filtrerede rækker',
 'panel.zone.group':'rækkegrupperne',
 'panel.zone.values':'værdierne',
@@ -31244,6 +32649,62 @@ other:'{count} celler oppdatert',
 'panel.quickFilter':'Hurtigfilter',
 'panel.formatting':'Formatering',
 'panel.statistics':'Statistikk',
+'panel.compare':'Sammenlign',
+'compare.first':'Første kolonne',
+'compare.second':'Andre kolonne',
+'compare.needTwo':'Det trengs to numeriske kolonner',
+'compare.noPairs':'Ingen rader har verdi i begge',
+'compare.pairs':'{count} par',
+'compare.pearson':'Korrelasjon (Pearson)',
+'compare.spearman':'Rangkorrelasjon (Spearman)',
+'compare.kendall':'Kendalls tau',
+'compare.covariance':'Kovarians',
+'compare.slope':'Stigningstall',
+'compare.intercept':'Skjæringspunkt',
+'compare.r2':'R²',
+'compare.stdError':'Standardfeil',
+'compare.weighted':'Vektet gjennomsnitt',
+'total.sum':'Sum',
+'total.avg':'Gjennomsnitt',
+'total.min':'Min',
+'total.max':'Maks',
+'total.count':'Antall',
+'total.countValues':'Antall verdier',
+'total.first':'Første',
+'total.last':'Siste',
+'total.median':'Median',
+'total.p25':'25. persentil',
+'total.p75':'75. persentil',
+'total.p90':'90. persentil',
+'total.p95':'95. persentil',
+'total.p99':'99. persentil',
+'total.iqr':'Kvartilbredde',
+'total.mad':'Median absolutt avvik',
+'total.variance':'Varians',
+'total.varianceP':'Varians (populasjon)',
+'total.stddev':'Standardavvik',
+'total.stddevP':'Standardavvik (populasjon)',
+'total.range':'Variasjonsbredde',
+'total.distinct':'Unike',
+'total.mode':'Typetall',
+'total.skewness':'Skjevhet',
+'total.kurtosis':'Kurtose',
+'total.geomean':'Geometrisk gjennomsnitt',
+'total.harmean':'Harmonisk gjennomsnitt',
+'total.sumSquares':'Kvadratsum',
+'total.weightedAvg':'Vektet gjennomsnitt',
+'total.argmin':'Laveste etter',
+'total.argmax':'Høyeste etter',
+'total.hhi':'Konsentrasjon (HHI)',
+'total.entropy':'Entropi',
+'total.evenness':'Jevnhet',
+'total.top3Share':'Topp 3-andel',
+'total.top10Share':'Topp 10-andel',
+'total.gini':'Gini-koeffisient',
+'total.trimmedMean':'Trimmet gjennomsnitt',
+'total.winsorizedMean':'Winsorisert gjennomsnitt',
+'total.robustOutliers':'Uteliggere (robust)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Kolonne',
 'stats.choose':'Velg en kolonne å analysere',
 'stats.noColumns':'Ingen numeriske kolonner å analysere',
@@ -31263,6 +32724,15 @@ other:'{count} celler oppdatert',
 'stats.outliers':'Uteliggere',
 'stats.distribution':'Fordeling',
 'stats.bin':'{count} mellom {from} og {to}',
+'stats.section.shape':'Form',
+'stats.section.robust':'Robust',
+'stats.section.concentration':'Konsentrasjon',
+'stats.section.capability':'Kapabilitet',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Utenfor spesifikasjon',
 'stats.filtered':'Av {count} filtrerte rader',
 'panel.zone.group':'radgruppene',
 'panel.zone.values':'verdiene',
@@ -31667,6 +33137,62 @@ other:'{count} solua päivitetty',
 'panel.quickFilter':'Pikasuodatin',
 'panel.formatting':'Muotoilu',
 'panel.statistics':'Tilastot',
+'panel.compare':'Vertaa',
+'compare.first':'Ensimmäinen sarake',
+'compare.second':'Toinen sarake',
+'compare.needTwo':'Vertailuun tarvitaan kaksi numeerista saraketta',
+'compare.noPairs':'Yhdelläkään rivillä ei ole arvoa molemmissa',
+'compare.pairs':'{count} paria',
+'compare.pearson':'Korrelaatio (Pearson)',
+'compare.spearman':'Järjestyskorrelaatio (Spearman)',
+'compare.kendall':'Kendallin tau',
+'compare.covariance':'Kovarianssi',
+'compare.slope':'Kulmakerroin',
+'compare.intercept':'Vakiotermi',
+'compare.r2':'R²',
+'compare.stdError':'Keskivirhe',
+'compare.weighted':'Painotettu keskiarvo',
+'total.sum':'Summa',
+'total.avg':'Keskiarvo',
+'total.min':'Pienin',
+'total.max':'Suurin',
+'total.count':'Lukumäärä',
+'total.countValues':'Arvojen määrä',
+'total.first':'Ensimmäinen',
+'total.last':'Viimeinen',
+'total.median':'Mediaani',
+'total.p25':'25. persentiili',
+'total.p75':'75. persentiili',
+'total.p90':'90. persentiili',
+'total.p95':'95. persentiili',
+'total.p99':'99. persentiili',
+'total.iqr':'Kvartiiliväli',
+'total.mad':'Mediaanin absoluuttinen poikkeama',
+'total.variance':'Varianssi',
+'total.varianceP':'Varianssi (populaatio)',
+'total.stddev':'Keskihajonta',
+'total.stddevP':'Keskihajonta (populaatio)',
+'total.range':'Vaihteluväli',
+'total.distinct':'Eri arvoja',
+'total.mode':'Moodi',
+'total.skewness':'Vinous',
+'total.kurtosis':'Huipukkuus',
+'total.geomean':'Geometrinen keskiarvo',
+'total.harmean':'Harmoninen keskiarvo',
+'total.sumSquares':'Neliösumma',
+'total.weightedAvg':'Painotettu keskiarvo',
+'total.argmin':'Pienin sarakkeen mukaan',
+'total.argmax':'Suurin sarakkeen mukaan',
+'total.hhi':'Keskittyminen (HHI)',
+'total.entropy':'Entropia',
+'total.evenness':'Tasaisuus',
+'total.top3Share':'Kolmen suurimman osuus',
+'total.top10Share':'Kymmenen suurimman osuus',
+'total.gini':'Gini-kerroin',
+'total.trimmedMean':'Typistetty keskiarvo',
+'total.winsorizedMean':'Winsoroitu keskiarvo',
+'total.robustOutliers':'Poikkeavat arvot (robusti)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Sarake',
 'stats.choose':'Valitse analysoitava sarake',
 'stats.noColumns':'Ei numeerisia sarakkeita analysoitavaksi',
@@ -31686,6 +33212,15 @@ other:'{count} solua päivitetty',
 'stats.outliers':'Poikkeavat arvot',
 'stats.distribution':'Jakauma',
 'stats.bin':'{count} välillä {from}–{to}',
+'stats.section.shape':'Muoto',
+'stats.section.robust':'Robusti',
+'stats.section.concentration':'Keskittyminen',
+'stats.section.capability':'Suorituskyky',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Spesifikaation ulkopuolella',
 'stats.filtered':'{count} suodatetusta rivistä',
 'panel.zone.group':'riviryhmiin',
 'panel.zone.values':'arvoihin',
@@ -32114,6 +33649,62 @@ other:'zaktualizowano {count} komórek',
 'panel.quickFilter':'Szybki filtr',
 'panel.formatting':'Formatowanie',
 'panel.statistics':'Statystyki',
+'panel.compare':'Porównaj',
+'compare.first':'Pierwsza kolumna',
+'compare.second':'Druga kolumna',
+'compare.needTwo':'Do porównania potrzebne są dwie kolumny liczbowe',
+'compare.noPairs':'Żaden wiersz nie ma wartości w obu',
+'compare.pairs':'Liczba par: {count}',
+'compare.pearson':'Korelacja (Pearson)',
+'compare.spearman':'Korelacja rang (Spearman)',
+'compare.kendall':'Tau Kendalla',
+'compare.covariance':'Kowariancja',
+'compare.slope':'Nachylenie',
+'compare.intercept':'Wyraz wolny',
+'compare.r2':'R²',
+'compare.stdError':'Błąd standardowy',
+'compare.weighted':'Średnia ważona',
+'total.sum':'Suma',
+'total.avg':'Średnia',
+'total.min':'Min',
+'total.max':'Maks',
+'total.count':'Liczba',
+'total.countValues':'Liczba wartości',
+'total.first':'Pierwszy',
+'total.last':'Ostatni',
+'total.median':'Mediana',
+'total.p25':'25. percentyl',
+'total.p75':'75. percentyl',
+'total.p90':'90. percentyl',
+'total.p95':'95. percentyl',
+'total.p99':'99. percentyl',
+'total.iqr':'Rozstęp ćwiartkowy',
+'total.mad':'Mediana odchyleń bezwzględnych',
+'total.variance':'Wariancja',
+'total.varianceP':'Wariancja (populacja)',
+'total.stddev':'Odchylenie standardowe',
+'total.stddevP':'Odchylenie standardowe (populacja)',
+'total.range':'Rozstęp',
+'total.distinct':'Unikatowe',
+'total.mode':'Dominanta',
+'total.skewness':'Skośność',
+'total.kurtosis':'Kurtoza',
+'total.geomean':'Średnia geometryczna',
+'total.harmean':'Średnia harmoniczna',
+'total.sumSquares':'Suma kwadratów',
+'total.weightedAvg':'Średnia ważona',
+'total.argmin':'Najniższy wg',
+'total.argmax':'Najwyższy wg',
+'total.hhi':'Koncentracja (HHI)',
+'total.entropy':'Entropia',
+'total.evenness':'Równomierność',
+'total.top3Share':'Udział 3 największych',
+'total.top10Share':'Udział 10 największych',
+'total.gini':'Współczynnik Giniego',
+'total.trimmedMean':'Średnia ucinana',
+'total.winsorizedMean':'Średnia winsorowska',
+'total.robustOutliers':'Wartości odstające (odporne)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Kolumna',
 'stats.choose':'Wybierz kolumnę do analizy',
 'stats.noColumns':'Brak kolumn liczbowych do analizy',
@@ -32133,6 +33724,15 @@ other:'zaktualizowano {count} komórek',
 'stats.outliers':'Wartości odstające',
 'stats.distribution':'Rozkład',
 'stats.bin':'{count} między {from} a {to}',
+'stats.section.shape':'Kształt',
+'stats.section.robust':'Odporne',
+'stats.section.concentration':'Koncentracja',
+'stats.section.capability':'Zdolność',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Poza specyfikacją',
 'stats.filtered':'Z {count} przefiltrowanych wierszy',
 'panel.zone.group':'grupowania wierszy',
 'panel.zone.values':'wartości',
@@ -32565,6 +34165,62 @@ other:'aktualizováno {count} buněk',
 'panel.quickFilter':'Rychlý filtr',
 'panel.formatting':'Formátování',
 'panel.statistics':'Statistika',
+'panel.compare':'Porovnat',
+'compare.first':'První sloupec',
+'compare.second':'Druhý sloupec',
+'compare.needTwo':'K porovnání jsou potřeba dva číselné sloupce',
+'compare.noPairs':'Žádné řádky nemají hodnotu v obou',
+'compare.pairs':'Počet dvojic: {count}',
+'compare.pearson':'Korelace (Pearson)',
+'compare.spearman':'Pořadová korelace (Spearman)',
+'compare.kendall':'Kendallovo tau',
+'compare.covariance':'Kovariance',
+'compare.slope':'Sklon',
+'compare.intercept':'Průsečík',
+'compare.r2':'R²',
+'compare.stdError':'Standardní chyba',
+'compare.weighted':'Vážený průměr',
+'total.sum':'Součet',
+'total.avg':'Průměr',
+'total.min':'Minimum',
+'total.max':'Maximum',
+'total.count':'Počet',
+'total.countValues':'Počet hodnot',
+'total.first':'První',
+'total.last':'Poslední',
+'total.median':'Medián',
+'total.p25':'25. percentil',
+'total.p75':'75. percentil',
+'total.p90':'90. percentil',
+'total.p95':'95. percentil',
+'total.p99':'99. percentil',
+'total.iqr':'Mezikvartilové rozpětí',
+'total.mad':'Mediánová absolutní odchylka',
+'total.variance':'Rozptyl',
+'total.varianceP':'Rozptyl (populace)',
+'total.stddev':'Směrodatná odchylka',
+'total.stddevP':'Směrodatná odchylka (populace)',
+'total.range':'Rozpětí',
+'total.distinct':'Jedinečných',
+'total.mode':'Modus',
+'total.skewness':'Šikmost',
+'total.kurtosis':'Špičatost',
+'total.geomean':'Geometrický průměr',
+'total.harmean':'Harmonický průměr',
+'total.sumSquares':'Součet čtverců',
+'total.weightedAvg':'Vážený průměr',
+'total.argmin':'Nejnižší podle',
+'total.argmax':'Nejvyšší podle',
+'total.hhi':'Koncentrace (HHI)',
+'total.entropy':'Entropie',
+'total.evenness':'Vyrovnanost',
+'total.top3Share':'Podíl top 3',
+'total.top10Share':'Podíl top 10',
+'total.gini':'Giniho koeficient',
+'total.trimmedMean':'Useknutý průměr',
+'total.winsorizedMean':'Winsorizovaný průměr',
+'total.robustOutliers':'Odlehlé hodnoty (robustní)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Sloupec',
 'stats.choose':'Vyberte sloupec k analýze',
 'stats.noColumns':'Žádné číselné sloupce k analýze',
@@ -32584,6 +34240,15 @@ other:'aktualizováno {count} buněk',
 'stats.outliers':'Odlehlé hodnoty',
 'stats.distribution':'Rozdělení',
 'stats.bin':'{count} mezi {from} a {to}',
+'stats.section.shape':'Tvar',
+'stats.section.robust':'Robustní',
+'stats.section.concentration':'Koncentrace',
+'stats.section.capability':'Způsobilost',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Mimo specifikaci',
 'stats.filtered':'Z {count} filtrovaných řádků',
 'panel.zone.group':'seskupení řádků',
 'panel.zone.values':'hodnot',
@@ -32992,6 +34657,62 @@ other:'{count} cella frissítve',
 'panel.quickFilter':'Gyorsszűrő',
 'panel.formatting':'Formázás',
 'panel.statistics':'Statisztika',
+'panel.compare':'Összehasonlítás',
+'compare.first':'Első oszlop',
+'compare.second':'Második oszlop',
+'compare.needTwo':'Két numerikus oszlop szükséges',
+'compare.noPairs':'Egyetlen sorban sincs érték mindkettőben',
+'compare.pairs':'{count} pár',
+'compare.pearson':'Korreláció (Pearson)',
+'compare.spearman':'Rangkorreláció (Spearman)',
+'compare.kendall':'Kendall-féle tau',
+'compare.covariance':'Kovariancia',
+'compare.slope':'Meredekség',
+'compare.intercept':'Tengelymetszet',
+'compare.r2':'R²',
+'compare.stdError':'Standard hiba',
+'compare.weighted':'Súlyozott átlag',
+'total.sum':'Összeg',
+'total.avg':'Átlag',
+'total.min':'Minimum',
+'total.max':'Maximum',
+'total.count':'Darabszám',
+'total.countValues':'Értékek száma',
+'total.first':'Első',
+'total.last':'Utolsó',
+'total.median':'Medián',
+'total.p25':'25. percentilis',
+'total.p75':'75. percentilis',
+'total.p90':'90. percentilis',
+'total.p95':'95. percentilis',
+'total.p99':'99. percentilis',
+'total.iqr':'Interkvartilis terjedelem',
+'total.mad':'Medián abszolút eltérés',
+'total.variance':'Variancia',
+'total.varianceP':'Variancia (sokaság)',
+'total.stddev':'Szórás',
+'total.stddevP':'Szórás (sokaság)',
+'total.range':'Terjedelem',
+'total.distinct':'Egyedi',
+'total.mode':'Módusz',
+'total.skewness':'Ferdeség',
+'total.kurtosis':'Csúcsosság',
+'total.geomean':'Mértani átlag',
+'total.harmean':'Harmonikus átlag',
+'total.sumSquares':'Négyzetösszeg',
+'total.weightedAvg':'Súlyozott átlag',
+'total.argmin':'Legalacsonyabb eszerint',
+'total.argmax':'Legmagasabb eszerint',
+'total.hhi':'Koncentráció (HHI)',
+'total.entropy':'Entrópia',
+'total.evenness':'Egyenletesség',
+'total.top3Share':'Top 3 részesedés',
+'total.top10Share':'Top 10 részesedés',
+'total.gini':'Gini-együttható',
+'total.trimmedMean':'Nyesett átlag',
+'total.winsorizedMean':'Winsorizált átlag',
+'total.robustOutliers':'Kiugró értékek (robusztus)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Oszlop',
 'stats.choose':'Válasszon oszlopot az elemzéshez',
 'stats.noColumns':'Nincs elemezhető numerikus oszlop',
@@ -33011,6 +34732,15 @@ other:'{count} cella frissítve',
 'stats.outliers':'Kiugró értékek',
 'stats.distribution':'Eloszlás',
 'stats.bin':'{count} a(z) {from} és {to} között',
+'stats.section.shape':'Alak',
+'stats.section.robust':'Robusztus',
+'stats.section.concentration':'Koncentráció',
+'stats.section.capability':'Képesség',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Specifikáción kívül',
 'stats.filtered':'A {count} szűrt sorból',
 'panel.zone.group':'a sorcsoportokból',
 'panel.zone.values':'az értékekből',
@@ -33427,6 +35157,62 @@ other:'{count} de celule actualizate',
 'panel.quickFilter':'Filtru rapid',
 'panel.formatting':'Formatare',
 'panel.statistics':'Statistici',
+'panel.compare':'Compară',
+'compare.first':'Prima coloană',
+'compare.second':'A doua coloană',
+'compare.needTwo':'Sunt necesare două coloane numerice',
+'compare.noPairs':'Niciun rând nu are valoare în ambele',
+'compare.pairs':'{count} perechi',
+'compare.pearson':'Corelație (Pearson)',
+'compare.spearman':'Corelație de rang (Spearman)',
+'compare.kendall':'Tau Kendall',
+'compare.covariance':'Covarianță',
+'compare.slope':'Panta',
+'compare.intercept':'Interceptul',
+'compare.r2':'R²',
+'compare.stdError':'Eroare standard',
+'compare.weighted':'Medie ponderată',
+'total.sum':'Sumă',
+'total.avg':'Medie',
+'total.min':'Min',
+'total.max':'Max',
+'total.count':'Număr',
+'total.countValues':'Număr de valori',
+'total.first':'Primul',
+'total.last':'Ultimul',
+'total.median':'Mediană',
+'total.p25':'Percentila 25',
+'total.p75':'Percentila 75',
+'total.p90':'Percentila 90',
+'total.p95':'Percentila 95',
+'total.p99':'Percentila 99',
+'total.iqr':'Interval intercuartilic',
+'total.mad':'Abatere absolută mediană',
+'total.variance':'Varianță',
+'total.varianceP':'Varianță (populație)',
+'total.stddev':'Abatere standard',
+'total.stddevP':'Abatere standard (populație)',
+'total.range':'Amplitudine',
+'total.distinct':'Distincte',
+'total.mode':'Mod',
+'total.skewness':'Asimetrie',
+'total.kurtosis':'Boltire',
+'total.geomean':'Medie geometrică',
+'total.harmean':'Medie armonică',
+'total.sumSquares':'Suma pătratelor',
+'total.weightedAvg':'Medie ponderată',
+'total.argmin':'Cel mai mic după',
+'total.argmax':'Cel mai mare după',
+'total.hhi':'Concentrare (HHI)',
+'total.entropy':'Entropie',
+'total.evenness':'Uniformitate',
+'total.top3Share':'Cota primelor 3',
+'total.top10Share':'Cota primelor 10',
+'total.gini':'Coeficient Gini',
+'total.trimmedMean':'Medie trunchiată',
+'total.winsorizedMean':'Medie winsorizată',
+'total.robustOutliers':'Valori aberante (robust)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Coloană',
 'stats.choose':'Alegeți o coloană de analizat',
 'stats.noColumns':'Nicio coloană numerică de analizat',
@@ -33446,6 +35232,15 @@ other:'{count} de celule actualizate',
 'stats.outliers':'Valori aberante',
 'stats.distribution':'Distribuție',
 'stats.bin':'{count} între {from} și {to}',
+'stats.section.shape':'Formă',
+'stats.section.robust':'Robust',
+'stats.section.concentration':'Concentrare',
+'stats.section.capability':'Capabilitate',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'În afara specificației',
 'stats.filtered':'Din {count} rânduri filtrate',
 'panel.zone.group':'grupările de rânduri',
 'panel.zone.values':'valorile',
@@ -33876,6 +35671,62 @@ other:'оновлено {count} комірок',
 'panel.quickFilter':'Швидкий фільтр',
 'panel.formatting':'Форматування',
 'panel.statistics':'Статистика',
+'panel.compare':'Порівняти',
+'compare.first':'Перший стовпець',
+'compare.second':'Другий стовпець',
+'compare.needTwo':'Потрібні два числові стовпці',
+'compare.noPairs':'Жоден рядок не має значення в обох',
+'compare.pairs':'{count} пар',
+'compare.pearson':'Кореляція (Пірсон)',
+'compare.spearman':'Рангова кореляція (Спірмен)',
+'compare.kendall':'Тау Кендала',
+'compare.covariance':'Коваріація',
+'compare.slope':'Нахил',
+'compare.intercept':'Перетин',
+'compare.r2':'R²',
+'compare.stdError':'Стандартна похибка',
+'compare.weighted':'Зважене середнє',
+'total.sum':'Сума',
+'total.avg':'Середнє',
+'total.min':'Мінімум',
+'total.max':'Максимум',
+'total.count':'Кількість',
+'total.countValues':'Кількість значень',
+'total.first':'Перше',
+'total.last':'Останнє',
+'total.median':'Медіана',
+'total.p25':'25-й процентиль',
+'total.p75':'75-й процентиль',
+'total.p90':'90-й процентиль',
+'total.p95':'95-й процентиль',
+'total.p99':'99-й процентиль',
+'total.iqr':'Міжквартильний розмах',
+'total.mad':'Медіанне абсолютне відхилення',
+'total.variance':'Дисперсія',
+'total.varianceP':'Дисперсія (генеральна)',
+'total.stddev':'Стандартне відхилення',
+'total.stddevP':'Стандартне відхилення (генеральна)',
+'total.range':'Розмах',
+'total.distinct':'Унікальних',
+'total.mode':'Мода',
+'total.skewness':'Асиметрія',
+'total.kurtosis':'Ексцес',
+'total.geomean':'Середнє геометричне',
+'total.harmean':'Середнє гармонійне',
+'total.sumSquares':'Сума квадратів',
+'total.weightedAvg':'Зважене середнє',
+'total.argmin':'Найменше за',
+'total.argmax':'Найбільше за',
+'total.hhi':'Концентрація (HHI)',
+'total.entropy':'Ентропія',
+'total.evenness':'Рівномірність',
+'total.top3Share':'Частка топ-3',
+'total.top10Share':'Частка топ-10',
+'total.gini':'Коефіцієнт Джині',
+'total.trimmedMean':'Зрізане середнє',
+'total.winsorizedMean':'Вінзоризоване середнє',
+'total.robustOutliers':'Викиди (стійкі)',
+'total.jarqueBera':'Жарк–Бера',
 'stats.column':'Стовпець',
 'stats.choose':'Виберіть стовпець для аналізу',
 'stats.noColumns':'Немає числових стовпців для аналізу',
@@ -33895,6 +35746,15 @@ other:'оновлено {count} комірок',
 'stats.outliers':'Викиди',
 'stats.distribution':'Розподіл',
 'stats.bin':'{count} між {from} і {to}',
+'stats.section.shape':'Форма',
+'stats.section.robust':'Стійкі',
+'stats.section.concentration':'Концентрація',
+'stats.section.capability':'Придатність',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Поза специфікацією',
 'stats.filtered':'З {count} відфільтрованих рядків',
 'panel.zone.group':'групувань рядків',
 'panel.zone.values':'значень',
@@ -34303,6 +36163,62 @@ other:'ενημερώθηκαν {count} κελιά',
 'panel.quickFilter':'Γρήγορο φίλτρο',
 'panel.formatting':'Μορφοποίηση',
 'panel.statistics':'Στατιστικά',
+'panel.compare':'Σύγκριση',
+'compare.first':'Πρώτη στήλη',
+'compare.second':'Δεύτερη στήλη',
+'compare.needTwo':'Χρειάζονται δύο αριθμητικές στήλες',
+'compare.noPairs':'Καμία γραμμή δεν έχει τιμή και στις δύο',
+'compare.pairs':'{count} ζεύγη',
+'compare.pearson':'Συσχέτιση (Pearson)',
+'compare.spearman':'Συσχέτιση τάξης (Spearman)',
+'compare.kendall':'Tau του Kendall',
+'compare.covariance':'Συνδιακύμανση',
+'compare.slope':'Κλίση',
+'compare.intercept':'Τεταγμένη',
+'compare.r2':'R²',
+'compare.stdError':'Τυπικό σφάλμα',
+'compare.weighted':'Σταθμισμένος μέσος',
+'total.sum':'Άθροισμα',
+'total.avg':'Μέσος όρος',
+'total.min':'Ελάχιστο',
+'total.max':'Μέγιστο',
+'total.count':'Πλήθος',
+'total.countValues':'Πλήθος τιμών',
+'total.first':'Πρώτο',
+'total.last':'Τελευταίο',
+'total.median':'Διάμεσος',
+'total.p25':'25ο εκατοστημόριο',
+'total.p75':'75ο εκατοστημόριο',
+'total.p90':'90ό εκατοστημόριο',
+'total.p95':'95ο εκατοστημόριο',
+'total.p99':'99ο εκατοστημόριο',
+'total.iqr':'Ενδοτεταρτημοριακό εύρος',
+'total.mad':'Διάμεση απόλυτη απόκλιση',
+'total.variance':'Διακύμανση',
+'total.varianceP':'Διακύμανση (πληθυσμού)',
+'total.stddev':'Τυπική απόκλιση',
+'total.stddevP':'Τυπική απόκλιση (πληθυσμού)',
+'total.range':'Εύρος',
+'total.distinct':'Διακριτές',
+'total.mode':'Επικρατούσα τιμή',
+'total.skewness':'Ασυμμετρία',
+'total.kurtosis':'Κύρτωση',
+'total.geomean':'Γεωμετρικός μέσος',
+'total.harmean':'Αρμονικός μέσος',
+'total.sumSquares':'Άθροισμα τετραγώνων',
+'total.weightedAvg':'Σταθμισμένος μέσος',
+'total.argmin':'Χαμηλότερο κατά',
+'total.argmax':'Υψηλότερο κατά',
+'total.hhi':'Συγκέντρωση (HHI)',
+'total.entropy':'Εντροπία',
+'total.evenness':'Ομοιομορφία',
+'total.top3Share':'Μερίδιο top 3',
+'total.top10Share':'Μερίδιο top 10',
+'total.gini':'Συντελεστής Gini',
+'total.trimmedMean':'Περικομμένος μέσος',
+'total.winsorizedMean':'Winsorized μέσος',
+'total.robustOutliers':'Ακραίες τιμές (ανθεκτικό)',
+'total.jarqueBera':'Jarque–Bera',
 'stats.column':'Στήλη',
 'stats.choose':'Επιλέξτε στήλη για ανάλυση',
 'stats.noColumns':'Δεν υπάρχουν αριθμητικές στήλες για ανάλυση',
@@ -34322,6 +36238,15 @@ other:'ενημερώθηκαν {count} κελιά',
 'stats.outliers':'Ακραίες τιμές',
 'stats.distribution':'Κατανομή',
 'stats.bin':'{count} μεταξύ {from} και {to}',
+'stats.section.shape':'Σχήμα',
+'stats.section.robust':'Ανθεκτικά',
+'stats.section.concentration':'Συγκέντρωση',
+'stats.section.capability':'Ικανότητα',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'Εκτός προδιαγραφής',
 'stats.filtered':'Από {count} φιλτραρισμένες γραμμές',
 'panel.zone.group':'τις ομαδοποιήσεις γραμμών',
 'panel.zone.values':'τις τιμές',
@@ -34714,6 +36639,62 @@ other:'{count} セルを更新しました',
 'panel.quickFilter':'クイックフィルター',
 'panel.formatting':'書式',
 'panel.statistics':'統計',
+'panel.compare':'比較',
+'compare.first':'1つ目の列',
+'compare.second':'2つ目の列',
+'compare.needTwo':'比較には数値列が2つ必要です',
+'compare.noPairs':'両方に値のある行がありません',
+'compare.pairs':'{count} 組',
+'compare.pearson':'相関（ピアソン）',
+'compare.spearman':'順位相関（スピアマン）',
+'compare.kendall':'ケンドールのタウ',
+'compare.covariance':'共分散',
+'compare.slope':'傾き',
+'compare.intercept':'切片',
+'compare.r2':'R²',
+'compare.stdError':'標準誤差',
+'compare.weighted':'加重平均',
+'total.sum':'合計',
+'total.avg':'平均',
+'total.min':'最小',
+'total.max':'最大',
+'total.count':'件数',
+'total.countValues':'値の件数',
+'total.first':'最初',
+'total.last':'最後',
+'total.median':'中央値',
+'total.p25':'第25パーセンタイル',
+'total.p75':'第75パーセンタイル',
+'total.p90':'第90パーセンタイル',
+'total.p95':'第95パーセンタイル',
+'total.p99':'第99パーセンタイル',
+'total.iqr':'四分位範囲',
+'total.mad':'中央絶対偏差',
+'total.variance':'分散',
+'total.varianceP':'分散（母集団）',
+'total.stddev':'標準偏差',
+'total.stddevP':'標準偏差（母集団）',
+'total.range':'範囲',
+'total.distinct':'一意の値',
+'total.mode':'最頻値',
+'total.skewness':'歪度',
+'total.kurtosis':'尖度',
+'total.geomean':'幾何平均',
+'total.harmean':'調和平均',
+'total.sumSquares':'平方和',
+'total.weightedAvg':'加重平均',
+'total.argmin':'最小（基準列）',
+'total.argmax':'最大（基準列）',
+'total.hhi':'集中度（HHI）',
+'total.entropy':'エントロピー',
+'total.evenness':'均等度',
+'total.top3Share':'上位3件の割合',
+'total.top10Share':'上位10件の割合',
+'total.gini':'ジニ係数',
+'total.trimmedMean':'トリム平均',
+'total.winsorizedMean':'ウィンザー化平均',
+'total.robustOutliers':'外れ値（頑健）',
+'total.jarqueBera':'ジャック–ベラ',
 'stats.column':'列',
 'stats.choose':'分析する列を選択',
 'stats.noColumns':'分析できる数値列がありません',
@@ -34733,6 +36714,15 @@ other:'{count} セルを更新しました',
 'stats.outliers':'外れ値',
 'stats.distribution':'分布',
 'stats.bin':'{from}～{to} に {count} 件',
+'stats.section.shape':'形状',
+'stats.section.robust':'頑健',
+'stats.section.concentration':'集中度',
+'stats.section.capability':'工程能力',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'規格外',
 'stats.filtered':'フィルター後の {count} 行が対象',
 'panel.zone.group':'行グループ',
 'panel.zone.values':'値',
@@ -35166,6 +37156,62 @@ other:'تم تحديث {count} خلية',
 'panel.quickFilter':'تصفية سريعة',
 'panel.formatting':'التنسيق',
 'panel.statistics':'الإحصاءات',
+'panel.compare':'قارن',
+'compare.first':'العمود الأول',
+'compare.second':'العمود الثاني',
+'compare.needTwo':'يلزم عمودان رقميان للمقارنة',
+'compare.noPairs':'لا توجد صفوف بقيمة في كليهما',
+'compare.pairs':'{count} زوجًا',
+'compare.pearson':'الارتباط (بيرسون)',
+'compare.spearman':'ارتباط الرتب (سبيرمان)',
+'compare.kendall':'تاو كندال',
+'compare.covariance':'التغاير',
+'compare.slope':'الميل',
+'compare.intercept':'التقاطع',
+'compare.r2':'R²',
+'compare.stdError':'الخطأ المعياري',
+'compare.weighted':'المتوسط المرجح',
+'total.sum':'المجموع',
+'total.avg':'المتوسط',
+'total.min':'الأدنى',
+'total.max':'الأعلى',
+'total.count':'العدد',
+'total.countValues':'عدد القيم',
+'total.first':'الأول',
+'total.last':'الأخير',
+'total.median':'الوسيط',
+'total.p25':'المئين 25',
+'total.p75':'المئين 75',
+'total.p90':'المئين 90',
+'total.p95':'المئين 95',
+'total.p99':'المئين 99',
+'total.iqr':'المدى الربيعي',
+'total.mad':'الانحراف المطلق الوسيط',
+'total.variance':'التباين',
+'total.varianceP':'التباين (المجتمع)',
+'total.stddev':'الانحراف المعياري',
+'total.stddevP':'الانحراف المعياري (المجتمع)',
+'total.range':'المدى',
+'total.distinct':'القيم المميزة',
+'total.mode':'المنوال',
+'total.skewness':'الالتواء',
+'total.kurtosis':'التفلطح',
+'total.geomean':'المتوسط الهندسي',
+'total.harmean':'المتوسط التوافقي',
+'total.sumSquares':'مجموع المربعات',
+'total.weightedAvg':'المتوسط المرجح',
+'total.argmin':'الأدنى حسب',
+'total.argmax':'الأعلى حسب',
+'total.hhi':'التركز (HHI)',
+'total.entropy':'الإنتروبيا',
+'total.evenness':'التجانس',
+'total.top3Share':'حصة أعلى 3',
+'total.top10Share':'حصة أعلى 10',
+'total.gini':'معامل جيني',
+'total.trimmedMean':'المتوسط المشذب',
+'total.winsorizedMean':'المتوسط الوينزوري',
+'total.robustOutliers':'القيم الشاذة (حصينة)',
+'total.jarqueBera':'جارك–بيرا',
 'stats.column':'العمود',
 'stats.choose':'اختر عمودًا لتحليله',
 'stats.noColumns':'لا توجد أعمدة رقمية للتحليل',
@@ -35185,6 +37231,15 @@ other:'تم تحديث {count} خلية',
 'stats.outliers':'القيم الشاذة',
 'stats.distribution':'التوزيع',
 'stats.bin':'{count} بين {from} و {to}',
+'stats.section.shape':'الشكل',
+'stats.section.robust':'حصين',
+'stats.section.concentration':'التركز',
+'stats.section.capability':'القدرة',
+'stats.cp':'Cp',
+'stats.cpk':'Cpk',
+'stats.pp':'Pp',
+'stats.ppk':'Ppk',
+'stats.outOfSpec':'خارج المواصفة',
 'stats.filtered':'من بين {count} صفًا بعد التصفية',
 'panel.zone.group':'تجميعات الصفوف',
 'panel.zone.values':'القيم',
@@ -53607,6 +55662,20 @@ const FIGURES=Object.freeze([
 {key:'stddev',label:'stats.stddev',kind:'value'},
 {key:'outliers',label:'stats.outliers',kind:'count'},
 ]);
+const SECTIONS=Object.freeze([
+{
+label:'stats.section.shape',
+kernels:['skewness','kurtosis','jarqueBera'],
+},
+{
+label:'stats.section.robust',
+kernels:['trimmedMean','winsorizedMean','mad','robustOutliers'],
+},
+{
+label:'stats.section.concentration',
+kernels:['gini','hhi','entropy','evenness','top3Share'],
+},
+]);
 function readable(value){
 if(value===null||value===undefined||!Number.isFinite(value))return'—';
 if(Number.isInteger(value))return String(value);
@@ -53648,6 +55717,12 @@ class:`${CLS.panel}__count`,
 text:this.t('stats.filtered',{count:profile.rows}),
 }));
 root.appendChild(this.#figures(profile));
+for(const section of SECTIONS){
+const rendered=this.#section(section);
+if(rendered)root.appendChild(rendered);
+}
+const capability=this.#capability();
+if(capability)root.appendChild(capability);
 if(profile.histogram&&profile.histogram.length>1){
 root.appendChild(this.#histogram(profile.histogram));
 }
@@ -53677,6 +55752,60 @@ select,
 ],
 });
 }
+#section(section){
+const reduce=this.host.reduceColumn;
+if(!isFunction(reduce)||!this.column)return null;
+const rows=[];
+for(const kernel of section.kernels){
+const value=reduce(this.column,kernel);
+if(value===null||value===undefined||Number.isNaN(value))continue;
+rows.push([kernel,value]);
+}
+if(!rows.length)return null;
+const wrapper=this.doc.createElement('div');
+wrapper.appendChild(el(this.doc,'h4',{
+class:`${CLS.panel}__subtitle`,text:this.t(section.label),
+}));
+const list=el(this.doc,'dl',{class:`${CLS.panel}__stats`});
+for(const[kernel,value]of rows){
+list.appendChild(el(this.doc,'dt',{
+class:`${CLS.panel}__stat-name`,
+text:this.t(`total.${kernel}`),
+}));
+list.appendChild(el(this.doc,'dd',{
+class:`${CLS.panel}__stat-value`,
+text:typeof value==='number'?readable(value):String(value),
+}));
+}
+wrapper.appendChild(list);
+return wrapper;
+}
+#capability(){
+const read=this.host.columnCapability;
+if(!isFunction(read)||!this.column)return null;
+const c=read(this.column);
+if(!c)return null;
+const wrapper=this.doc.createElement('div');
+wrapper.appendChild(el(this.doc,'h4',{
+class:`${CLS.panel}__subtitle`,text:this.t('stats.section.capability'),
+}));
+const list=el(this.doc,'dl',{class:`${CLS.panel}__stats`});
+const pairs=[
+['stats.cp',c.cp],['stats.cpk',c.cpk],['stats.pp',c.pp],['stats.ppk',c.ppk],
+['stats.outOfSpec',c.outOfSpec],
+];
+for(const[key,value]of pairs){
+if(value===null||value===undefined)continue;
+list.appendChild(el(this.doc,'dt',{
+class:`${CLS.panel}__stat-name`,text:this.t(key),
+}));
+list.appendChild(el(this.doc,'dd',{
+class:`${CLS.panel}__stat-value`,text:readable(value),
+}));
+}
+wrapper.appendChild(list);
+return wrapper;
+}
 #figures(profile){
 const list=el(this.doc,'dl',{class:`${CLS.panel}__stats`});
 for(const figure of FIGURES){
@@ -53716,6 +55845,122 @@ return chart;
 }
 }
 });
+__def("packages/dom/src/comparepanel.js",function(__exports,__req){
+'use strict';
+Object.defineProperty(__exports,"ComparePanel",{enumerable:true,get:function(){return ComparePanel;}});
+const __m0=__req("packages/dom/src/editors/common.js");
+const CLS=__m0["CLS"];
+const el=__m0["el"];
+const on=__m0["on"];
+const clear=__m0["clear"];
+const __m1=__req("packages/core/src/internal/util.js");
+const isFunction=__m1["isFunction"];
+const __m2=__req("packages/dom/src/ui/panelbase.js");
+const ToolPanelBase=__m2["ToolPanelBase"];
+const FIGURES=Object.freeze([
+{key:'pearson',label:'compare.pearson'},
+{key:'spearman',label:'compare.spearman'},
+{key:'kendall',label:'compare.kendall'},
+{key:'slope',label:'compare.slope'},
+{key:'intercept',label:'compare.intercept'},
+{key:'r2',label:'compare.r2'},
+{key:'stdError',label:'compare.stdError'},
+{key:'covariance',label:'compare.covariance'},
+{key:'weighted',label:'compare.weighted'},
+]);
+function readable(value){
+if(value===null||value===undefined||!Number.isFinite(value))return'—';
+if(Number.isInteger(value))return String(value);
+const magnitude=Math.abs(value);
+if(magnitude!==0&&(magnitude<0.001||magnitude>=1e7))return value.toExponential(2);
+return String(Number(value.toPrecision(4)));
+}
+class ComparePanel extends ToolPanelBase{
+first=null;
+second=null;
+#columns(){
+return isFunction(this.host.profilableColumns)?this.host.profilableColumns():[];
+}
+refresh(){
+const root=this.root;
+if(!root)return;
+for(const off of this.off)off();
+this.off.length=0;
+clear(root);
+const columns=this.#columns();
+if(columns.length<2){
+root.appendChild(el(this.doc,'p',{
+class:`${CLS.panel}__empty`,text:this.t('compare.needTwo'),
+}));
+return;
+}
+if(!columns.some((c)=>c.id===this.first))this.first=columns[0].id;
+if(!columns.some((c)=>c.id===this.second)||this.second===this.first){
+this.second=(columns.find((c)=>c.id!==this.first)||columns[0]).id;
+}
+root.appendChild(this.#picker('compare.first',columns,this.first,(id)=>{
+this.first=id;
+if(this.second===id){
+this.second=(columns.find((c)=>c.id!==id)||columns[0]).id;
+}
+this.refresh();
+}));
+root.appendChild(this.#picker('compare.second',columns,this.second,(id)=>{
+this.second=id;
+if(this.first===id){
+this.first=(columns.find((c)=>c.id!==id)||columns[0]).id;
+}
+this.refresh();
+}));
+const figures=isFunction(this.host.compareColumns)
+?this.host.compareColumns(this.first,this.second)
+:null;
+if(!figures||!figures.n){
+root.appendChild(el(this.doc,'p',{
+class:`${CLS.panel}__empty`,text:this.t('compare.noPairs'),
+}));
+return;
+}
+root.appendChild(el(this.doc,'p',{
+class:`${CLS.panel}__count`,
+text:this.t('compare.pairs',{count:figures.n}),
+}));
+const list=el(this.doc,'dl',{class:`${CLS.panel}__stats`});
+for(const figure of FIGURES){
+const value=figures[figure.key];
+if(value===null||value===undefined)continue;
+list.appendChild(el(this.doc,'dt',{
+class:`${CLS.panel}__stat-name`,text:this.t(figure.label),
+}));
+list.appendChild(el(this.doc,'dd',{
+class:`${CLS.panel}__stat-value`,text:readable(value),
+}));
+}
+root.appendChild(list);
+}
+#picker(label,columns,current,choose){
+const select=el(this.doc,'select',{
+class:`${CLS.panel}__select`,
+attrs:{'aria-label':this.t(label)},
+});
+for(const column of columns){
+select.appendChild(el(this.doc,'option',{
+text:column.title,
+attrs:{value:column.id,selected:column.id===current?true:null},
+}));
+}
+(select).value=current;
+this.off.push(on(select,'change',()=>choose((select).value)));
+return el(this.doc,'label',{
+class:`${CLS.panel}__field`,
+children:[
+el(this.doc,'span',{class:`${CLS.panel}__label`,text:this.t(label)}),
+select,
+],
+});
+}
+}
+});
 __def("packages/dom/src/ui/toolpanel.js",function(__exports,__req){
 'use strict';
 Object.defineProperty(__exports,"ColumnsPanel",{enumerable:true,get:function(){return ColumnsPanel;}});
@@ -53748,10 +55993,12 @@ const __m5=__req("packages/dom/src/formattingpanel.js");
 const FormattingPanel=__m5["FormattingPanel"];
 const __m6=__req("packages/dom/src/statisticspanel.js");
 const StatisticsPanel=__m6["StatisticsPanel"];
-const __m7=__req("packages/dom/src/ui/panelbase.js");
-const ToolPanelBase=__m7["ToolPanelBase"];
-const __m8=__req("packages/core/src/compute/total.js");
-const TOTAL_LABELS=__m8["TOTAL_LABELS"];
+const __m7=__req("packages/dom/src/comparepanel.js");
+const ComparePanel=__m7["ComparePanel"];
+const __m8=__req("packages/dom/src/ui/panelbase.js");
+const ToolPanelBase=__m8["ToolPanelBase"];
+const __m9=__req("packages/core/src/compute/total.js");
+const TOTAL_LABELS=__m9["TOTAL_LABELS"];
 class ColumnsPanel extends ToolPanelBase{
 dragging=null;
 refresh(){
@@ -53949,7 +56196,7 @@ attrs:{'aria-label':`Calculation for ${this.titleOf(id)}`},
 });
 for(const fn of ColumnsPanel.aggregations){
 select.appendChild(el(this.doc,'option',{
-text:fn.label,
+text:this.t(`total.${fn.name}`),
 attrs:{value:fn.name,selected:fn.name===current?'':null},
 }));
 }
@@ -53979,7 +56226,7 @@ zone.appendChild(body);
 return zone;
 }
 static aggregations=Object.freeze(
-Object.entries(TOTAL_LABELS).map(([name,label])=>({name,label})),
+Object.keys(TOTAL_LABELS).map((name)=>({name})),
 );
 static zoneAbout=Object.freeze({
 group:'Rows are grouped by these columns, in order.',
@@ -54241,6 +56488,7 @@ views:ViewPicker,
 quick:QuickFilterPanel,
 formatting:FormattingPanel,
 statistics:StatisticsPanel,
+compare:ComparePanel,
 });
 const toolPanelTitles=Object.freeze({
 columns:'panel.columns',
@@ -54249,6 +56497,7 @@ views:'panel.views',
 quick:'panel.quickFilter',
 formatting:'panel.formatting',
 statistics:'panel.statistics',
+compare:'panel.compare',
 });
 const toolPanelIcons=Object.freeze({
 columns:'columns',
@@ -54257,6 +56506,7 @@ views:'views',
 quick:'search',
 formatting:'palette',
 statistics:'chart',
+compare:'link',
 });
 class ToolPanel{
 panels=[];
@@ -56649,6 +58899,7 @@ this.#row=null;
 });
 __def("packages/dom/src/toolpanelmount.js",function(__exports,__req){
 'use strict';
+Object.defineProperty(__exports,"mountPanel",{enumerable:true,get:function(){return mountPanel;}});
 Object.defineProperty(__exports,"panelHost",{enumerable:true,get:function(){return panelHost;}});
 Object.defineProperty(__exports,"ToolPanelDock",{enumerable:true,get:function(){return ToolPanelDock;}});
 const __m0=__req("packages/core/src/internal/util.js");
@@ -56663,10 +58914,48 @@ const __m2=__req("packages/dom/src/filters/index.js");
 const createFilter=__m2["createFilter"];
 const __m3=__req("packages/dom/src/editors/common.js");
 const CLS=__m3["CLS"];
+const documentFor=__m3["documentFor"];
 const scannableRows=__m3["scannableRows"];
 const __m4=__req("packages/dom/src/filtermenu.js");
 const mergeColumnFilter=__m4["mergeColumnFilter"];
 const branchFor=__m4["branchFor"];
+const REPAINT_ON=Object.freeze([
+'column:visible','column:moved','column:pinned',
+'column:grouped','column:pivoted','filter:changed','model:changed',
+'views:changed','sort:changed','history:changed','state:reset',
+'cell:changed','formatting:changed',
+]);
+function mountPanel(opts){
+const{grid,container}=opts||{};
+if(!grid)throw new Error('[lattice] mountPanel needs a grid');
+if(!container||!container.appendChild){
+throw new Error('[lattice] mountPanel needs a container element');
+}
+const Ctor=isFunction(opts.panel)?opts.panel:toolPanels[String(opts.panel)];
+if(!Ctor){
+throw new Error(`[lattice] unknown panel "${opts.panel}"; known panels are ${Object.keys(toolPanels).join(', ')}`);
+}
+const doc=container.ownerDocument||documentFor(container);
+const host=panelHost(grid,doc,opts.announce);
+const panel=new Ctor();
+panel.init({document:doc,host,grid,props:opts.props||{}});
+const element=panel.element();
+container.appendChild(element);
+const off=[];
+for(const event of REPAINT_ON){
+if(isFunction(grid.on))off.push(grid.on(event,()=>panel.refresh()));
+}
+return{
+element,
+refresh(){panel.refresh();},
+destroy(){
+for(const stop of off)stop();
+off.length=0;
+if(isFunction(panel.destroy))panel.destroy();
+if(element&&element.parentNode)element.parentNode.removeChild(element);
+},
+};
+}
 const PANEL_WIDTH=260;
 const RAIL_WIDTH=30;
 const DOCK_CLASS=`${CLS.panel}-dock`;
@@ -56732,6 +59021,24 @@ profilableColumns:()=>grid.columns.visible()
 ||c.type==='percent'||c.type==='integer'))
 .map((c)=>({id:c.id,title:String(c.title??c.id)})),
 columnProfile:(colId)=>grid.statistics.profile(colId),
+reduceColumn:(colId,kernel)=>grid.statistics.reduce(colId,kernel),
+columnCapability:(colId)=>grid.statistics.capability(colId),
+compareColumns:(a,b)=>{
+if(!a||!b||a===b)return null;
+const fit=grid.statistics.regression(a,b);
+return{
+n:fit?fit.n:0,
+pearson:grid.statistics.correlation(a,b),
+spearman:grid.statistics.spearman(a,b),
+kendall:grid.statistics.kendall(a,b),
+covariance:grid.statistics.covariance(a,b),
+slope:fit?fit.slope:null,
+intercept:fit?fit.intercept:null,
+r2:fit?fit.r2:null,
+stdError:fit?fit.stdError:null,
+weighted:grid.statistics.weightedAverage(a,b),
+};
+},
 addRule:(scope,rule)=>grid.formatting.add(scope,rule),
 removeRule:(scope,id)=>grid.formatting.remove(scope,id),
 updateRule:(scope,id,patch)=>grid.formatting.update(scope,id,patch),
@@ -56864,10 +59171,7 @@ const show=this.#panel.show.bind(this.#panel);
 const hide=this.#panel.hide.bind(this.#panel);
 this.#panel.show=(name)=>{const ok=show(name);this.#applyWidth();return ok;};
 this.#panel.hide=()=>{hide();this.#applyWidth();};
-for(const event of['column:visible','column:moved','column:pinned',
-'column:grouped','column:pivoted','filter:changed','model:changed',
-'views:changed','sort:changed','history:changed','state:reset',
-'cell:changed','formatting:changed',
+for(const event of[...REPAINT_ON,
 'rows:paused','rows:resumed','rows:queued']){
 this.#off.push(this.#grid.on(event,()=>this.#panel.refresh()));
 }
@@ -60828,6 +63132,7 @@ Object.defineProperty(__exports,"layoutState",{enumerable:true,get:function(){re
 const __m9=__req("packages/dom/src/toolpanelmount.js");
 Object.defineProperty(__exports,"ToolPanelDock",{enumerable:true,get:function(){return __m9["ToolPanelDock"];}});
 Object.defineProperty(__exports,"panelHost",{enumerable:true,get:function(){return __m9["panelHost"];}});
+Object.defineProperty(__exports,"mountPanel",{enumerable:true,get:function(){return __m9["mountPanel"];}});
 const __m10=__req("packages/dom/src/celledit.js");
 Object.defineProperty(__exports,"CellEditController",{enumerable:true,get:function(){return __m10["CellEditController"];}});
 const __m11=__req("packages/dom/src/editbar.js");
@@ -60889,7 +63194,7 @@ createLocalViewStorage,
 const __default=LatticeGrid;
 });
 try{
-__req("packages/worker/src/inline.js").setWorkerSource("(function(root){\n'use strict';\nvar __mods=Object.create(null);\nvar __cache=Object.create(null);\nfunction __def(id,fn){__mods[id]=fn;}\nfunction __req(id){\nvar hit=__cache[id];\nif(hit)return hit;\nvar exports=Object.create(null);\n__cache[id]=exports;\nvar fn=__mods[id];\nif(!fn)throw new Error('[lattice] missing module: '+id);\nfn(exports,__req);\nreturn exports;\n}\n__def(\"packages/core/src/internal/util.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"VERSION\",{enumerable:true,get:function(){return VERSION;}});\nObject.defineProperty(__exports,\"reportedWarnings\",{enumerable:true,get:function(){return reportedWarnings;}});\nObject.defineProperty(__exports,\"warnOnce\",{enumerable:true,get:function(){return warnOnce;}});\nObject.defineProperty(__exports,\"infoOnce\",{enumerable:true,get:function(){return infoOnce;}});\nObject.defineProperty(__exports,\"resetWarnings\",{enumerable:true,get:function(){return resetWarnings;}});\nObject.defineProperty(__exports,\"fail\",{enumerable:true,get:function(){return fail;}});\nObject.defineProperty(__exports,\"invariant\",{enumerable:true,get:function(){return invariant;}});\nObject.defineProperty(__exports,\"DEV\",{enumerable:true,get:function(){return DEV;}});\nObject.defineProperty(__exports,\"isObject\",{enumerable:true,get:function(){return isObject;}});\nObject.defineProperty(__exports,\"isFunction\",{enumerable:true,get:function(){return isFunction;}});\nObject.defineProperty(__exports,\"isNil\",{enumerable:true,get:function(){return isNil;}});\nObject.defineProperty(__exports,\"isBlank\",{enumerable:true,get:function(){return isBlank;}});\nObject.defineProperty(__exports,\"isCtor\",{enumerable:true,get:function(){return isCtor;}});\nObject.defineProperty(__exports,\"pathGetter\",{enumerable:true,get:function(){return pathGetter;}});\nObject.defineProperty(__exports,\"pathSetter\",{enumerable:true,get:function(){return pathSetter;}});\nObject.defineProperty(__exports,\"getPath\",{enumerable:true,get:function(){return getPath;}});\nObject.defineProperty(__exports,\"setPath\",{enumerable:true,get:function(){return setPath;}});\nObject.defineProperty(__exports,\"humanise\",{enumerable:true,get:function(){return humanise;}});\nObject.defineProperty(__exports,\"escapeHtml\",{enumerable:true,get:function(){return escapeHtml;}});\nObject.defineProperty(__exports,\"titleCase\",{enumerable:true,get:function(){return titleCase;}});\nObject.defineProperty(__exports,\"expand\",{enumerable:true,get:function(){return expand;}});\nObject.defineProperty(__exports,\"toArray\",{enumerable:true,get:function(){return toArray;}});\nObject.defineProperty(__exports,\"merge\",{enumerable:true,get:function(){return merge;}});\nObject.defineProperty(__exports,\"mergeRow\",{enumerable:true,get:function(){return mergeRow;}});\nObject.defineProperty(__exports,\"Lru\",{enumerable:true,get:function(){return Lru;}});\nObject.defineProperty(__exports,\"collator\",{enumerable:true,get:function(){return collator;}});\nObject.defineProperty(__exports,\"defaultCompare\",{enumerable:true,get:function(){return defaultCompare;}});\nObject.defineProperty(__exports,\"now\",{enumerable:true,get:function(){return now;}});\nObject.defineProperty(__exports,\"nextFrame\",{enumerable:true,get:function(){return nextFrame;}});\nObject.defineProperty(__exports,\"cancelFrame\",{enumerable:true,get:function(){return cancelFrame;}});\nObject.defineProperty(__exports,\"frameBatched\",{enumerable:true,get:function(){return frameBatched;}});\nObject.defineProperty(__exports,\"whenIdle\",{enumerable:true,get:function(){return whenIdle;}});\nObject.defineProperty(__exports,\"uid\",{enumerable:true,get:function(){return uid;}});\nconst VERSION='1.8.0';\nconst warned=new Set();\nconst reported=[];\nconst REPORT_LIMIT=500;\nfunction record(key,level,message){\nreported.push({\nkey,\nlevel,\nmessage:message.map((m)=>(typeof m==='string'?m:safeString(m))).join(' '),\nat:Date.now(),\n});\nif(reported.length>REPORT_LIMIT)reported.shift();\n}\nfunction safeString(value){\nif(value instanceof Error)return value.message;\ntry{return JSON.stringify(value);}catch{return String(value);}\n}\nfunction reportedWarnings(){return reported.map((r)=>({...r}));}\nfunction warnOnce(key,...message){\nif(warned.has(key))return;\nwarned.add(key);\nrecord(key,'warn',message);\nconsole.warn('[lattice]',...message);\n}\nfunction infoOnce(key,...message){\nif(warned.has(key))return;\nwarned.add(key);\nrecord(key,'info',message);\nconsole.info('[lattice]',...message);\n}\nfunction resetWarnings(){\nwarned.clear();\nreported.length=0;\n}\nfunction fail(message,extra){\nconst err=new Error(`[lattice] ${message}`);\nif(extra!==undefined)err.cause=extra;\nthrow err;\n}\nfunction invariant(condition,message){\nif(!condition)fail(message);\n}\nconst DEV=(()=>{\ntry{\nreturn!(typeof process!=='undefined'&&process.env\n&&process.env.NODE_ENV==='production');\n}catch{\nreturn true;\n}\n})();\nfunction isObject(v){\nreturn v!==null&&typeof v==='object'&&!Array.isArray(v);\n}\nfunction isFunction(v){\nreturn typeof v==='function';\n}\nfunction isNil(v){\nreturn v===null||v===undefined;\n}\nfunction isBlank(v){\nreturn v===null||v===undefined||v==='';\n}\nfunction isCtor(v){\nif(typeof v!=='function')return false;\nif(/^class[\\s{]/.test(Function.prototype.toString.call(v)))return true;\nreturn!!(v.prototype&&Object.getOwnPropertyNames(v.prototype).length>1);\n}\nconst pathCache=new Map();\nfunction pathGetter(path){\nlet fn=pathCache.get(path);\nif(fn)return fn;\nif(!path.includes('.')){\nfn=(o)=>(o==null?undefined:o[path]);\n}else{\nconst parts=path.split('.');\nconst n=parts.length;\nfn=(o)=>{\nlet cur=o;\nfor(let i=0;i<n;i++){\nif(cur==null)return undefined;\ncur=cur[parts[i]];\n}\nreturn cur;\n};\n}\npathCache.set(path,fn);\nreturn fn;\n}\nconst setterCache=new Map();\nfunction pathSetter(path){\nlet fn=setterCache.get(path);\nif(fn)return fn;\nif(!path.includes('.')){\nfn=(o,v)=>{if(o!=null)o[path]=v;};\n}else{\nconst parts=path.split('.');\nconst last=parts.length-1;\nfn=(o,v)=>{\nlet cur=o;\nfor(let i=0;i<last;i++){\nif(cur==null)return;\nconst k=parts[i];\nif(cur[k]==null)cur[k]={};\ncur=cur[k];\n}\nif(cur!=null)cur[parts[last]]=v;\n};\n}\nsetterCache.set(path,fn);\nreturn fn;\n}\nfunction getPath(obj,path){\nreturn pathGetter(path)(obj);\n}\nfunction setPath(obj,path,value){\npathSetter(path)(obj,value);\n}\nfunction humanise(field){\nif(!field)return'';\nconst leaf=field.includes('.')?field.slice(field.lastIndexOf('.')+1):field;\nreturn leaf\n.replace(/[_-]+/g,' ')\n.replace(/([a-z0-9])([A-Z])/g,'$1 $2')\n.replace(/([A-Z]+)([A-Z][a-z])/g,'$1 $2')\n.replace(/\\s+/g,' ')\n.trim()\n.replace(/^./,(c)=>c.toUpperCase());\n}\nconst ESCAPES={'&':'&amp;','<':'&lt;','>':'&gt;','\"':'&quot;',\"'\":'&#39;'};\nfunction escapeHtml(s){\nconst str=s==null?'':String(s);\nreturn/[&<>\"']/.test(str)?str.replace(/[&<>\"']/g,(c)=>ESCAPES[c]):str;\n}\nfunction titleCase(s){\nreturn String(s).replace(/\\w\\S*/g,(t)=>t[0].toUpperCase()+t.slice(1).toLowerCase());\n}\nfunction expand(value,key,whenTrue){\nif(value===undefined)return undefined;\nif(value===true)return{enabled:true,...whenTrue};\nif(value===false)return{enabled:false};\nif(isObject(value))return value;\nreturn{[key]:value,enabled:true};\n}\nfunction toArray(v){\nif(v===undefined||v===null)return[];\nreturn Array.isArray(v)?v:[v];\n}\nfunction merge(a,b){\nif(!isObject(a))return isObject(b)?{...b}:b;\nif(!isObject(b))return b===undefined?a:b;\nconst out={...a};\nfor(const k of Object.keys(b)){\nconst bv=b[k];\nif(bv===undefined)continue;\nout[k]=isObject(bv)&&isObject(out[k])?merge(out[k],bv):bv;\n}\nreturn out;\n}\nfunction mergeRow(previous,patch){\nif(!isObject(previous)||!isObject(patch)||previous===patch)return patch;\nconst out=Object.create(Object.getPrototypeOf(previous));\nObject.assign(out,previous,patch);\nreturn out;\n}\nclass Lru{\n#max;\n#map=new Map();\n#onEvict;\nconstructor(max=256,onEvict=null){\nthis.#max=max;\nthis.#onEvict=onEvict;\n}\nget size(){\nreturn this.#map.size;\n}\nget max(){\nreturn this.#max;\n}\nset max(v){\nthis.#max=v;\nthis.#trim();\n}\nhas(k){\nreturn this.#map.has(k);\n}\nget(k){\nconst m=this.#map;\nif(!m.has(k))return undefined;\nconst v=m.get(k);\nm.delete(k);\nm.set(k,v);\nreturn v;\n}\npeek(k){\nreturn this.#map.get(k);\n}\nset(k,v){\nconst m=this.#map;\nif(m.has(k))m.delete(k);\nm.set(k,v);\nthis.#trim();\nreturn v;\n}\ndelete(k){\nconst v=this.#map.get(k);\nif(this.#map.delete(k)&&this.#onEvict)this.#onEvict(v,k);\nreturn v;\n}\nclear(){\nif(this.#onEvict)for(const[k,v]of this.#map)this.#onEvict(v,k);\nthis.#map.clear();\n}\nkeys(){\nreturn this.#map.keys();\n}\nvalues(){\nreturn this.#map.values();\n}\n#trim(){\nconst m=this.#map;\nwhile(m.size>this.#max){\nconst oldest=m.keys().next().value;\nconst v=m.get(oldest);\nm.delete(oldest);\nif(this.#onEvict)this.#onEvict(v,oldest);\n}\n}\n}\nconst collators=new Map();\nfunction collator(locale,opts){\nconst key=`${locale||''}|${opts?JSON.stringify(opts):''}`;\nlet c=collators.get(key);\nif(!c){\nc=new Intl.Collator(locale||undefined,{\nnumeric:true,sensitivity:'variant',...opts,\n});\ncollators.set(key,c);\n}\nreturn c;\n}\nfunction defaultCompare(a,b){\nif(a===b)return 0;\nif(a===null||a===undefined)return 1;\nif(b===null||b===undefined)return-1;\nif(typeof a==='number'&&typeof b==='number'){\nif(Number.isNaN(a))return Number.isNaN(b)?0:1;\nif(Number.isNaN(b))return-1;\nreturn a<b?-1:a>b?1:0;\n}\nconst sa=String(a);\nconst sb=String(b);\nreturn sa<sb?-1:sa>sb?1:0;\n}\nfunction now(){\nreturn typeof performance!=='undefined'&&performance.now\n?performance.now()\n:Date.now();\n}\nconst hasRaf=typeof requestAnimationFrame==='function';\nfunction nextFrame(fn){\nif(hasRaf)return requestAnimationFrame(fn);\nreturn setTimeout(()=>fn(now()),16);\n}\nfunction cancelFrame(handle){\nif(handle==null)return;\nif(hasRaf)cancelAnimationFrame(handle);\nelse clearTimeout(handle);\n}\nfunction frameBatched(fn){\nlet handle=null;\nlet lastArgs=null;\nconst run=()=>{\nhandle=null;\nconst a=lastArgs;\nlastArgs=null;\nfn(...(a||[]));\n};\nconst wrapped=(...args)=>{\nlastArgs=args;\nif(handle===null)handle=nextFrame(run);\n};\nwrapped.cancel=()=>{\ncancelFrame(handle);\nhandle=null;\nlastArgs=null;\n};\nwrapped.flush=()=>{\nif(handle!==null){\ncancelFrame(handle);\nrun();\n}\n};\nreturn wrapped;\n}\nfunction whenIdle(fn,timeout=50){\nif(typeof requestIdleCallback==='function'){\nreturn requestIdleCallback(fn,{timeout});\n}\nreturn setTimeout(()=>fn({timeRemaining:()=>0,didTimeout:true}),1);\n}\nlet idSeq=0;\nfunction uid(prefix='l'){\nreturn`${prefix}${(++idSeq).toString(36)}`;\n}\n});\n__def(\"packages/worker/src/transport.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"PROTOCOL\",{enumerable:true,get:function(){return PROTOCOL;}});\nObject.defineProperty(__exports,\"OPS\",{enumerable:true,get:function(){return OPS;}});\nObject.defineProperty(__exports,\"CONTROL\",{enumerable:true,get:function(){return CONTROL;}});\nObject.defineProperty(__exports,\"ERRORS\",{enumerable:true,get:function(){return ERRORS;}});\nObject.defineProperty(__exports,\"packHandle\",{enumerable:true,get:function(){return packHandle;}});\nObject.defineProperty(__exports,\"packHandles\",{enumerable:true,get:function(){return packHandles;}});\nObject.defineProperty(__exports,\"TransportedDictionary\",{enumerable:true,get:function(){return TransportedDictionary;}});\nObject.defineProperty(__exports,\"unpackHandle\",{enumerable:true,get:function(){return unpackHandle;}});\nObject.defineProperty(__exports,\"unpackHandles\",{enumerable:true,get:function(){return unpackHandles;}});\nObject.defineProperty(__exports,\"createMaskPool\",{enumerable:true,get:function(){return createMaskPool;}});\nObject.defineProperty(__exports,\"isTransferable\",{enumerable:true,get:function(){return isTransferable;}});\nObject.defineProperty(__exports,\"collectTransfers\",{enumerable:true,get:function(){return collectTransfers;}});\nObject.defineProperty(__exports,\"isPortable\",{enumerable:true,get:function(){return isPortable;}});\nObject.defineProperty(__exports,\"filterColumnIds\",{enumerable:true,get:function(){return filterColumnIds;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst collator=__m0[\"collator\"];\nconst isFunction=__m0[\"isFunction\"];\nconst PROTOCOL=1;\nconst OPS=Object.freeze({\nSORT_COLUMN:'sortColumn',\nSORT_MULTI:'sortMulti',\nEVALUATE_FILTERS:'evaluateFilters',\nCOMPACT:'compact',\nGROUP_BY_COLUMNS:'groupByColumns',\nTOTAL:'total',\nPIVOT:'pivot',\nFACET:'facet',\n});\nconst CONTROL=Object.freeze({\nREADY:'ready',\nCANCEL:'cancel',\nPING:'ping',\n});\nconst ERRORS=Object.freeze({\nNO_COMPUTE:'E_NO_COMPUTE',\nNO_KERNEL:'E_NO_KERNEL',\nABORTED:'E_ABORTED',\nKERNEL:'E_KERNEL',\nPROTOCOL:'E_PROTOCOL',\n});\nfunction packHandle(handle){\nif(handle==null)return null;\nconst presence=handle.presence;\nreturn{\nid:handle.id,\nkind:handle.kind,\nnullable:!!handle.nullable,\nvalues:handle.values??null,\npresence:presence?(presence.words??presence):null,\npresenceBits:presence?(presence.size??(presence.words??presence).length*8):0,\ndict:handle.dict?sliceDictionary(handle.dict):null,\noffsets:handle.offsets??null,\nversion:handle.version??0,\n};\n}\nfunction sliceDictionary(dict){\nif(Array.isArray(dict))return dict;\nif(isFunction(dict.values))return dict.values();\nreturn[];\n}\nfunction packHandles(handles){\nconst out=new Array(handles.length);\nfor(let i=0;i<handles.length;i++)out[i]=packHandle(handles[i]);\nreturn out;\n}\nclass TransportedBitset{\n#words;\n#bits;\nconstructor(words,bits){\nthis.#words=words;\nthis.#bits=bits;\n}\nget words(){return this.#words;}\nget size(){return this.#bits;}\nget(i){return(this.#words[i>>>3]&(1<<(i&7)))!==0;}\ncount(){\nconst w=this.#words;\nlet n=0;\nfor(let i=0;i<w.length;i++){\nlet v=w[i];\nwhile(v){v&=v-1;n++;}\n}\nreturn n;\n}\n}\nclass TransportedDictionary{\n#values;\n#index=null;\n#version=0;\n#ranks=new Map();\nconstructor(values){\nthis.#values=values||[];\n}\nget size(){return this.#values.length;}\nget version(){return this.#version;}\ncodeOf(value){\nif(this.#index===null){\nthis.#index=new Map();\nfor(let i=0;i<this.#values.length;i++)this.#index.set(this.#values[i],i);\n}\nconst found=this.#index.get(value);\nif(found!==undefined)return found;\nconst code=this.#values.length;\nthis.#values.push(value);\nthis.#index.set(value,code);\nthis.#version++;\nreturn code;\n}\nvalueOf(code){return this.#values[code];}\nvalues(){return this.#values;}\nranks(locale){\nconst key=locale||'';\nconst cached=this.#ranks.get(key);\nif(cached&&cached.version===this.#version)return cached.ranks;\nconst n=this.#values.length;\nconst order=new Uint32Array(n);\nfor(let i=0;i<n;i++)order[i]=i;\nconst cmp=collator(locale).compare;\nconst vals=this.#values;\nconst sorted=Array.from(order).sort((a,b)=>{\nconst av=vals[a];\nconst bv=vals[b];\nif(av===bv)return 0;\nif(av===null||av===undefined)return 1;\nif(bv===null||bv===undefined)return-1;\nreturn cmp(String(av),String(bv));\n});\nconst ranks=new Uint32Array(n);\nfor(let r=0;r<sorted.length;r++)ranks[sorted[r]]=r;\nthis.#ranks.set(key,{version:this.#version,ranks});\nreturn ranks;\n}\n}\nfunction unpackHandle(packed){\nif(packed==null)return null;\nconst presence=packed.presence\n?new TransportedBitset(packed.presence,packed.presenceBits||packed.presence.length*8)\n:null;\nconst dict=packed.dict?new TransportedDictionary(packed.dict):null;\nconst values=packed.values;\nconst offsets=packed.offsets??null;\nconst kind=packed.kind;\nconst get=(physical)=>{\nif(presence&&!presence.get(physical))return null;\nswitch(kind){\ncase'dictionary':\nreturn dict?dict.valueOf(values[physical]):values[physical];\ncase'bitset':\nreturn(values[physical>>>3]&(1<<(physical&7)))!==0;\ncase'multi':{\nif(!offsets)return null;\nconst from=offsets[physical];\nconst to=offsets[physical+1];\nconst out=new Array(to-from);\nfor(let i=from;i<to;i++)out[i-from]=dict?dict.valueOf(values[i]):values[i];\nreturn out;\n}\ndefault:\nreturn values[physical];\n}\n};\nreturn{\nid:packed.id,\nkind,\nnullable:packed.nullable,\nvalues,\npresence,\ndict,\noffsets,\nget,\nversion:packed.version,\n};\n}\nfunction unpackHandles(packed){\nconst out=new Array(packed.length);\nfor(let i=0;i<packed.length;i++)out[i]=unpackHandle(packed[i]);\nreturn out;\n}\nfunction createMaskPool(){\nconst masks=[];\nconst indices=[];\nreturn{\nmask(n){\nfor(let i=0;i<masks.length;i++){\nif(masks[i].length>=n){\nconst buf=masks.splice(i,1)[0].subarray(0,n);\nbuf.fill(0);\nreturn buf;\n}\n}\nreturn new Uint8Array(n);\n},\nindices(n){\nfor(let i=0;i<indices.length;i++){\nif(indices[i].length>=n)return indices.splice(i,1)[0].subarray(0,n);\n}\nreturn new Uint32Array(n);\n},\nrelease(buf){\nif(!buf)return;\nif(buf instanceof Uint8Array)masks.push(buf);\nelse if(buf instanceof Uint32Array)indices.push(buf);\n},\nclear(){masks.length=0;indices.length=0;},\n};\n}\nfunction isTransferable(v){\nif(!ArrayBuffer.isView(v))return false;\nconst buf=(v).buffer;\nif(!buf)return false;\nreturn typeof SharedArrayBuffer==='undefined'||!(buf instanceof SharedArrayBuffer);\n}\nfunction collectTransfers(value,out=[]){\nconst add=(v)=>{\nif(!isTransferable(v))return;\nconst buf=(v).buffer;\nif(!out.includes(buf))out.push(buf);\n};\nif(value==null)return out;\nif(ArrayBuffer.isView(value)){add(value);return out;}\nif(Array.isArray(value)){\nfor(const item of value)add(item);\nreturn out;\n}\nif(typeof value==='object'){\nfor(const key of Object.keys(value)){\nconst item=(value)[key];\nif(Array.isArray(item))for(const sub of item)add(sub);\nelse add(item);\n}\n}\nreturn out;\n}\nfunction isPortable(value,depth=0){\nif(value==null)return true;\nconst t=typeof value;\nif(t==='function'||t==='symbol')return false;\nif(t!=='object')return true;\nif(depth>4)return true;\nif(ArrayBuffer.isView(value)||value instanceof ArrayBuffer||value instanceof Date)return true;\nif(Array.isArray(value)){\nfor(const item of value)if(!isPortable(item,depth+1))return false;\nreturn true;\n}\nfor(const key of Object.keys(value)){\nif(!isPortable((value)[key],depth+1))return false;\n}\nreturn true;\n}\nfunction filterColumnIds(filters,out=new Set()){\nif(!filters||typeof filters!=='object')return out;\nconst node=(filters);\nif(typeof node.col==='string')out.add(node.col);\nconst conditions=node.conditions;\nif(Array.isArray(conditions))for(const child of conditions)filterColumnIds(child,out);\nreturn out;\n}\n});\n__def(\"packages/core/src/compute/handle.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"identity\",{enumerable:true,get:function(){return identity;}});\nObject.defineProperty(__exports,\"rowCount\",{enumerable:true,get:function(){return rowCount;}});\nObject.defineProperty(__exports,\"bitReader\",{enumerable:true,get:function(){return bitReader;}});\nObject.defineProperty(__exports,\"presenceReader\",{enumerable:true,get:function(){return presenceReader;}});\nObject.defineProperty(__exports,\"dictSize\",{enumerable:true,get:function(){return dictSize;}});\nObject.defineProperty(__exports,\"dictValue\",{enumerable:true,get:function(){return dictValue;}});\nObject.defineProperty(__exports,\"multiValue\",{enumerable:true,get:function(){return multiValue;}});\nObject.defineProperty(__exports,\"valueReader\",{enumerable:true,get:function(){return valueReader;}});\nObject.defineProperty(__exports,\"numericTotalOrder\",{enumerable:true,get:function(){return numericTotalOrder;}});\nObject.defineProperty(__exports,\"valueComparator\",{enumerable:true,get:function(){return valueComparator;}});\nObject.defineProperty(__exports,\"dictRanks\",{enumerable:true,get:function(){return dictRanks;}});\nObject.defineProperty(__exports,\"isMissing\",{enumerable:true,get:function(){return isMissing;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst collator=__m0[\"collator\"];\nconst defaultCompare=__m0[\"defaultCompare\"];\nconst warnOnce=__m0[\"warnOnce\"];\nfunction identity(n){\nconst out=new Uint32Array(n);\nfor(let i=0;i<n;i++)out[i]=i;\nreturn out;\n}\nfunction rowCount(handle,opts){\nif(opts&&typeof opts.count==='number')return opts.count;\nif(!handle)return 0;\nif(typeof handle.count==='number')return handle.count;\nif(typeof handle.length==='number')return handle.length;\nconst values=handle.values;\nif(handle.kind==='multi'&&handle.offsets)return Math.max(0,handle.offsets.length-1);\nif(!values)return handle.presence&&typeof handle.presence.size==='number'?handle.presence.size:0;\nif(handle.kind==='bitset'){\nif(typeof values.size==='number')return values.size;\nif(handle.presence&&typeof handle.presence.size==='number')return handle.presence.size;\nwarnOnce(`count:${handle.id}`,`column \"${handle.id}\" is bitset-backed with no declared row count; assuming ${values.length*8}`);\nreturn values.length*8;\n}\nreturn values.length;\n}\nconst bitOrders=new WeakMap();\nfunction bitOrderOf(bitset){\nconst ctor=bitset.constructor;\nif(!ctor)return'unknown';\nconst cached=bitOrders.get(ctor);\nif(cached)return cached;\nlet order='unknown';\ntry{\nlet probe=null;\nif(typeof ctor.from==='function')probe=ctor.from([false,true]);\nelse{\nprobe=new ctor(8);\nprobe.set(1);\n}\nconst words=probe&&probe.words;\nif(words&&words.length){\nif(words[0]===0x02)order='lsb';\nelse if(words[0]===0x40)order='msb';\n}\n}catch{\norder='unknown';\n}\nbitOrders.set(ctor,order);\nreturn order;\n}\nfunction bitReader(bits){\nif(!bits)return()=>0;\nconst raw=bits instanceof Uint8Array?bits:bits.words;\nif(raw instanceof Uint8Array){\nconst order=bits instanceof Uint8Array?'lsb':bitOrderOf(bits);\nif(order==='lsb')return(i)=>(raw[i>>>3]>>>(i&7))&1;\nif(order==='msb')return(i)=>(raw[i>>>3]>>>(7-(i&7)))&1;\n}\nif(typeof bits.get==='function')return(i)=>(bits.get(i)?1:0);\nreturn()=>0;\n}\nfunction presenceReader(handle){\nif(!handle||!handle.presence)return null;\nreturn bitReader(handle.presence);\n}\nfunction dictSize(dict){\nif(!dict)return 0;\nif(typeof dict.size==='number')return dict.size;\nif(typeof dict.values==='function')return dict.values().length;\nreturn 0;\n}\nfunction dictValue(dict,code){\nif(!dict)return null;\nif(typeof dict.valueOf==='function')return dict.valueOf(code);\nif(typeof dict.values==='function')return dict.values()[code];\nreturn null;\n}\nfunction multiValue(handle,i){\nconst offsets=handle.offsets;\nconst values=handle.values;\nif(!offsets||!values)return[];\nconst from=offsets[i];\nconst to=offsets[i+1];\nif(!(to>from))return[];\nconst dict=handle.dict;\nconst out=new Array(to-from);\nfor(let k=from;k<to;k++)out[k-from]=dict?dictValue(dict,values[k]):values[k];\nreturn out;\n}\nfunction valueReader(handle){\nif(!handle)return()=>undefined;\nconst values=handle.values;\nconst present=presenceReader(handle);\nconst kind=handle.kind;\nif(kind==='dictionary'){\nconst dict=handle.dict;\nif(present)return(i)=>(present(i)?dictValue(dict,values[i]):null);\nreturn(i)=>dictValue(dict,values[i]);\n}\nif(kind==='bitset'){\nconst bit=bitReader(values);\nif(present)return(i)=>(present(i)?bit(i)===1:null);\nreturn(i)=>bit(i)===1;\n}\nif(kind==='multi'){\nif(present)return(i)=>(present(i)?multiValue(handle,i):null);\nreturn(i)=>multiValue(handle,i);\n}\nif(!values&&typeof handle.get==='function'){\nconst get=handle.get.bind(handle);\nreturn(i)=>{\nconst v=get(i);\nreturn v===undefined?null:v;\n};\n}\nif(present){\nreturn(i)=>{\nif(!present(i))return null;\nconst v=values[i];\nreturn v===undefined?null:v;\n};\n}\nreturn(i)=>{\nconst v=values[i];\nreturn v===undefined?null:v;\n};\n}\nfunction numericTotalOrder(a,b){\nif(a<b)return-1;\nif(a>b)return 1;\nif(a===b){\nconst na=Object.is(a,-0);\nconst nb=Object.is(b,-0);\nif(na===nb)return 0;\nreturn na?-1:1;\n}\nconst an=Number.isNaN(a);\nconst bn=Number.isNaN(b);\nif(an&&bn)return 0;\nreturn an?1:-1;\n}\nfunction valueComparator(locale){\nconst coll=collator(locale);\nreturn(a,b)=>{\nif(a===b)return 0;\nconst ta=typeof a;\nconst tb=typeof b;\nif(ta==='string'&&tb==='string')return coll.compare(a,b);\nif(ta==='number'&&tb==='number')return numericTotalOrder(a,b);\nif(ta==='boolean'&&tb==='boolean')return a===b?0:a?1:-1;\nif(a instanceof Date||b instanceof Date){\nconst na=a instanceof Date?a.getTime():Number(a);\nconst nb=b instanceof Date?b.getTime():Number(b);\nreturn numericTotalOrder(na,nb);\n}\nreturn defaultCompare(a,b);\n};\n}\nfunction dictRanks(dict,locale){\nif(dict&&typeof dict.ranks==='function')return dict.ranks(locale);\nconst table=dict&&typeof dict.values==='function'?dict.values():[];\nconst n=table.length;\nconst cmp=valueComparator(locale);\nconst order=new Array(n);\nfor(let i=0;i<n;i++)order[i]=i;\norder.sort((a,b)=>cmp(table[a],table[b])||a-b);\nconst ranks=new Uint32Array(n);\nfor(let r=0;r<n;r++)ranks[order[r]]=r;\nreturn ranks;\n}\nfunction isMissing(v){\nreturn v===null||v===undefined||(typeof v==='number'&&Number.isNaN(v));\n}\n});\n__def(\"packages/core/src/compute/sort.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"radixSortFloat64\",{enumerable:true,get:function(){return radixSortFloat64;}});\nObject.defineProperty(__exports,\"radixSortInt32\",{enumerable:true,get:function(){return radixSortInt32;}});\nObject.defineProperty(__exports,\"rankSortDictionary\",{enumerable:true,get:function(){return rankSortDictionary;}});\nObject.defineProperty(__exports,\"mergeSortComparator\",{enumerable:true,get:function(){return mergeSortComparator;}});\nObject.defineProperty(__exports,\"sortColumn\",{enumerable:true,get:function(){return sortColumn;}});\nObject.defineProperty(__exports,\"sortMulti\",{enumerable:true,get:function(){return sortMulti;}});\nconst __m0=__req(\"packages/core/src/compute/handle.js\");\nconst bitReader=__m0[\"bitReader\"];\nconst dictRanks=__m0[\"dictRanks\"];\nconst dictSize=__m0[\"dictSize\"];\nconst identity=__m0[\"identity\"];\nconst isMissing=__m0[\"isMissing\"];\nconst presenceReader=__m0[\"presenceReader\"];\nconst rowCount=__m0[\"rowCount\"];\nconst valueComparator=__m0[\"valueComparator\"];\nconst valueReader=__m0[\"valueReader\"];\nconst EMPTY_INDICES=new Uint32Array(0);\nconst SCRATCH=new ArrayBuffer(8);\nconst SCRATCH_F64=new Float64Array(SCRATCH);\nconst SCRATCH_U32=new Uint32Array(SCRATCH);\nconst HI=(()=>{\nSCRATCH_F64[0]=-1;\nreturn(SCRATCH_U32[1]&0x80000000)!==0?1:0;\n})();\nconst LO=HI===1?0:1;\nfunction transformDouble(value,out){\nSCRATCH_F64[0]=value;\nlet hi=SCRATCH_U32[HI];\nlet lo=SCRATCH_U32[LO];\nif((hi&0x80000000)!==0){\nhi=~hi>>>0;\nlo=~lo>>>0;\n}else{\nhi=(hi^0x80000000)>>>0;\n}\nout[0]=lo;\nout[1]=hi;\n}\nfunction radixLsd64(idx,lo,hi,n){\nif(n<2)return idx;\nconst hist=new Uint32Array(256*8);\nfor(let i=0;i<n;i++){\nconst l=lo[i];\nconst h=hi[i];\nhist[l&0xff]++;\nhist[256+((l>>>8)&0xff)]++;\nhist[512+((l>>>16)&0xff)]++;\nhist[768+((l>>>24)&0xff)]++;\nhist[1024+(h&0xff)]++;\nhist[1280+((h>>>8)&0xff)]++;\nhist[1536+((h>>>16)&0xff)]++;\nhist[1792+((h>>>24)&0xff)]++;\n}\nlet srcIdx=idx;\nlet srcLo=lo;\nlet srcHi=hi;\nlet dstIdx=new Uint32Array(n);\nlet dstLo=new Uint32Array(n);\nlet dstHi=new Uint32Array(n);\nconst offset=new Uint32Array(256);\nfor(let pass=0;pass<8;pass++){\nconst base=pass<<8;\nconst shift=(pass&3)<<3;\nconst useHi=pass>=4;\nlet skip=false;\nfor(let b=0;b<256;b++){\nif(hist[base+b]===n){skip=true;break;}\n}\nif(skip)continue;\nlet sum=0;\nfor(let b=0;b<256;b++){\noffset[b]=sum;\nsum+=hist[base+b];\n}\nfor(let i=0;i<n;i++){\nconst l=srcLo[i];\nconst h=srcHi[i];\nconst digit=((useHi?h:l)>>>shift)&0xff;\nconst p=offset[digit]++;\ndstIdx[p]=srcIdx[i];\ndstLo[p]=l;\ndstHi[p]=h;\n}\nlet t=srcIdx;srcIdx=dstIdx;dstIdx=t;\nt=srcLo;srcLo=dstLo;dstLo=t;\nt=srcHi;srcHi=dstHi;dstHi=t;\n}\nreturn srcIdx;\n}\nfunction radixLsd32(idx,keys,n){\nif(n<2)return idx;\nconst hist=new Uint32Array(256*4);\nfor(let i=0;i<n;i++){\nconst k=keys[i];\nhist[k&0xff]++;\nhist[256+((k>>>8)&0xff)]++;\nhist[512+((k>>>16)&0xff)]++;\nhist[768+((k>>>24)&0xff)]++;\n}\nlet srcIdx=idx;\nlet srcKeys=keys;\nlet dstIdx=new Uint32Array(n);\nlet dstKeys=new Uint32Array(n);\nconst offset=new Uint32Array(256);\nfor(let pass=0;pass<4;pass++){\nconst base=pass<<8;\nconst shift=pass<<3;\nlet skip=false;\nfor(let b=0;b<256;b++){\nif(hist[base+b]===n){skip=true;break;}\n}\nif(skip)continue;\nlet sum=0;\nfor(let b=0;b<256;b++){\noffset[b]=sum;\nsum+=hist[base+b];\n}\nfor(let i=0;i<n;i++){\nconst k=srcKeys[i];\nconst p=offset[(k>>>shift)&0xff]++;\ndstIdx[p]=srcIdx[i];\ndstKeys[p]=k;\n}\nlet t=srcIdx;srcIdx=dstIdx;dstIdx=t;\nt=srcKeys;srcKeys=dstKeys;dstKeys=t;\n}\nreturn srcIdx;\n}\nfunction countingSort(idx,keys,n,radix){\nconst counts=new Uint32Array(radix+1);\nfor(let i=0;i<n;i++)counts[keys[i]]++;\nlet sum=0;\nfor(let k=0;k<=radix;k++){\nconst c=counts[k];\ncounts[k]=sum;\nsum+=c;\n}\nconst out=new Uint32Array(n);\nfor(let i=0;i<n;i++)out[counts[keys[i]]++]=idx[i];\nreturn out;\n}\nfunction sortUint32Keys(idx,keys,n,radix){\nif(n<2)return idx;\nif(radix<=65536||radix<=n*2)return countingSort(idx,keys,n,radix);\nreturn radixLsd32(idx,keys,n);\n}\nfunction exact(buffer,n){\nif(buffer.length===n&&buffer.byteOffset===0)return buffer;\nreturn Uint32Array.prototype.slice.call(buffer,0,n);\n}\nfunction radixSortFloat64(values,order,descending=false){\nconst src=order||identity(values.length);\nconst n=src.length;\nif(n<2)return Uint32Array.from(src);\nconst idx=new Uint32Array(n);\nconst lo=new Uint32Array(n);\nconst hi=new Uint32Array(n);\nconst nans=new Uint32Array(n);\nconst pair=new Uint32Array(2);\nlet m=0;\nlet nanCount=0;\nfor(let i=0;i<n;i++){\nconst row=src[i];\nconst v=values[row];\nif(Number.isNaN(v)){nans[nanCount++]=row;continue;}\ntransformDouble(v,pair);\nif(descending){\nlo[m]=~pair[0]>>>0;\nhi[m]=~pair[1]>>>0;\n}else{\nlo[m]=pair[0];\nhi[m]=pair[1];\n}\nidx[m++]=row;\n}\nconst sorted=radixLsd64(idx.subarray(0,m),lo.subarray(0,m),hi.subarray(0,m),m);\nif(nanCount===0)return exact(sorted,m);\nconst out=new Uint32Array(n);\nout.set(sorted.subarray(0,m),0);\nout.set(nans.subarray(0,nanCount),m);\nreturn out;\n}\nfunction radixSortInt32(values,order,descending=false){\nconst src=order||identity(values.length);\nconst n=src.length;\nif(n<2)return Uint32Array.from(src);\nconst idx=Uint32Array.from(src);\nconst keys=new Uint32Array(n);\nfor(let i=0;i<n;i++){\nconst k=(values[idx[i]]^0x80000000)>>>0;\nkeys[i]=descending?(~k>>>0):k;\n}\nreturn exact(radixLsd32(idx,keys,n),n);\n}\nfunction rankSortDictionary(handle,order,opts={}){\nconst src=order||identity(rowCount(handle,opts));\nconst n=src.length;\nif(n<2)return Uint32Array.from(src);\nconst ranks=dictRanks(handle.dict,opts.locale);\nconst codes=handle.values;\nconst present=presenceReader(handle);\nconst size=Math.max(dictSize(handle.dict),ranks.length);\nconst absentRank=size;\nconst idx=Uint32Array.from(src);\nconst keys=new Uint32Array(n);\nconst descending=!!opts.descending;\nfor(let i=0;i<n;i++){\nconst row=idx[i];\nlet rank=present&&present(row)===0?absentRank:ranks[codes[row]];\nif(rank===undefined)rank=absentRank;\nkeys[i]=descending?absentRank-rank:rank;\n}\nreturn exact(sortUint32Keys(idx,keys,n,size+1),n);\n}\nfunction mergeSortComparator(values,order,compare){\nconst n=order.length;\nlet src=Uint32Array.from(order);\nif(n<2)return src;\nlet dst=new Uint32Array(n);\nfor(let width=1;width<n;width<<=1){\nfor(let start=0;start<n;start+=width<<1){\nconst mid=Math.min(start+width,n);\nconst end=Math.min(start+(width<<1),n);\nlet i=start;\nlet j=mid;\nlet k=start;\nwhile(i<mid&&j<end){\ndst[k++]=compare(values[src[i]],values[src[j]])<=0?src[i++]:src[j++];\n}\nwhile(i<mid)dst[k++]=src[i++];\nwhile(j<end)dst[k++]=src[j++];\n}\nconst t=src;src=dst;dst=t;\n}\nreturn src;\n}\nfunction sortBitsetColumn(handle,idx,descending){\nconst bit=bitReader(handle.values);\nconst n=idx.length;\nconst out=new Uint32Array(n);\nconst first=descending?1:0;\nlet k=0;\nfor(let i=0;i<n;i++)if(bit(idx[i])===first)out[k++]=idx[i];\nfor(let i=0;i<n;i++)if(bit(idx[i])!==first)out[k++]=idx[i];\nreturn out;\n}\nfunction indexableValues(handle,idx){\nconst values=handle.values;\nconst kind=handle.kind;\nconst direct=(kind==='object'||kind===undefined)&&(Array.isArray(values)||ArrayBuffer.isView(values));\nif(direct&&!handle.presence)return values;\nconst reader=valueReader(handle);\nconst materialised=new Array(rowCount(handle)||0);\nfor(let i=0;i<idx.length;i++){\nconst row=idx[i];\nmaterialised[row]=reader(row);\n}\nreturn materialised;\n}\nfunction sortByComparator(handle,idx,opts){\nconst values=indexableValues(handle,idx);\nconst base=valueComparator(opts.locale);\nconst compare=opts.descending?(a,b)=>base(b,a):base;\nreturn mergeSortComparator(values,idx,compare);\n}\nfunction sortByCompare(handle,idx,opts){\nconst values=indexableValues(handle,idx);\nconst user=opts.compare;\nconst descending=!!opts.descending;\nconst compare=descending\n?(a,b)=>-user(a,b,undefined,undefined,true)\n:(a,b)=>user(a,b,undefined,undefined,false);\nreturn mergeSortComparator(values,idx,compare);\n}\nfunction partitionPresent(handle,idx){\nconst n=idx.length;\nconst present=presenceReader(handle);\nconst values=handle.values;\nconst checkNaN=handle.kind==='float64'&&!!values;\nconst looseKind=handle.kind==='object'||handle.kind==='multi'||handle.kind===undefined;\nif(!present&&!checkNaN&&!looseKind)return{present:idx,absent:EMPTY_INDICES};\nconst keep=new Uint32Array(n);\nconst drop=new Uint32Array(n);\nlet p=0;\nlet a=0;\nif(present&&checkNaN){\nfor(let i=0;i<n;i++){\nconst row=idx[i];\nif(present(row)===1&&!Number.isNaN(values[row]))keep[p++]=row;else drop[a++]=row;\n}\n}else if(checkNaN&&!present){\nfor(let i=0;i<n;i++){\nconst row=idx[i];\nif(!Number.isNaN(values[row]))keep[p++]=row;else drop[a++]=row;\n}\n}else if(present&&!looseKind){\nfor(let i=0;i<n;i++){\nconst row=idx[i];\nif(present(row)===1)keep[p++]=row;else drop[a++]=row;\n}\n}else{\nconst reader=valueReader(handle);\nfor(let i=0;i<n;i++){\nconst row=idx[i];\nif(!isMissing(reader(row)))keep[p++]=row;else drop[a++]=row;\n}\n}\nif(a===0)return{present:idx,absent:EMPTY_INDICES};\nreturn{present:keep.subarray(0,p),absent:drop.subarray(0,a)};\n}\nfunction joinRuns(sorted,absent,nullsFirst){\nif(absent.length===0)return sorted;\nconst out=new Uint32Array(sorted.length+absent.length);\nif(nullsFirst){\nout.set(absent,0);\nout.set(sorted,absent.length);\n}else{\nout.set(sorted,0);\nout.set(absent,sorted.length);\n}\nreturn out;\n}\nfunction sortColumn(handle,order,opts={}){\nconst src=order||identity(rowCount(handle,opts));\nif(!handle||src.length<2)return Uint32Array.from(src);\nconst{present,absent}=partitionPresent(handle,src);\nif(present.length===0)return Uint32Array.from(src);\nconst descending=!!opts.descending;\nlet sorted;\nif(typeof opts.compare==='function'){\nsorted=sortByCompare(handle,present,opts);\n}else{\nswitch(handle.kind){\ncase'float64':\nsorted=radixSortFloat64(handle.values,present,descending);\nbreak;\ncase'int32':\nsorted=radixSortInt32(handle.values,present,descending);\nbreak;\ncase'dictionary':\nsorted=rankSortDictionary(handle,present,opts);\nbreak;\ncase'bitset':\nsorted=sortBitsetColumn(handle,present,descending);\nbreak;\ndefault:\nsorted=sortByComparator(handle,present,opts);\nbreak;\n}\n}\nreturn joinRuns(sorted,absent,!!opts.nullsFirst);\n}\nfunction sortMulti(handles,entries,order,opts={}){\nconst list=entries||[];\nconst first=(list.length&&(list[0].handle||byId(handles,list[0].col)))||(handles&&handles[0]);\nlet current=order||identity(rowCount(first,opts));\nfor(let i=list.length-1;i>=0;i--){\nconst entry=list[i];\nconst handle=entry.handle||byId(handles,entry.col)||(handles&&handles[i]);\nif(!handle)continue;\ncurrent=sortColumn(handle,current,{\ndescending:entry.descending!==undefined?!!entry.descending:entry.dir==='desc',\nnullsFirst:!!entry.nullsFirst,\nlocale:entry.locale!==undefined?entry.locale:opts.locale,\ncompare:entry.compare,\n});\n}\nreturn current instanceof Uint32Array?current:Uint32Array.from(current);\n}\nfunction byId(handles,id){\nif(!handles||id===undefined)return undefined;\nfor(let i=0;i<handles.length;i++)if(handles[i]&&handles[i].id===id)return handles[i];\nreturn undefined;\n}\n});\n__def(\"packages/core/src/format/date.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"scanPattern\",{enumerable:true,get:function(){return scanPattern;}});\nObject.defineProperty(__exports,\"toDate\",{enumerable:true,get:function(){return toDate;}});\nObject.defineProperty(__exports,\"compilePattern\",{enumerable:true,get:function(){return compilePattern;}});\nObject.defineProperty(__exports,\"compileDate\",{enumerable:true,get:function(){return compileDate;}});\nObject.defineProperty(__exports,\"toIsoDate\",{enumerable:true,get:function(){return toIsoDate;}});\nObject.defineProperty(__exports,\"toIsoDateTime\",{enumerable:true,get:function(){return toIsoDateTime;}});\nObject.defineProperty(__exports,\"compareIso\",{enumerable:true,get:function(){return compareIso;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst isNil=__m0[\"isNil\"];\nconst warnOnce=__m0[\"warnOnce\"];\nconst TOKENS=[\n'yyyy','yy','MMMM','MMM','MM','M','dd','d',\n'EEEE','EEE','HH','H','hh','h','mm','m','ss','s','SSS','a',\n];\nfunction scanPattern(pattern){\nconst out=[];\nlet i=0;\nlet literal='';\nconst flush=()=>{if(literal){out.push({token:null,text:literal});literal='';}};\nwhile(i<pattern.length){\nconst ch=pattern[i];\nif(ch===\"'\"){\nif(pattern[i+1]===\"'\"){literal+=\"'\";i+=2;continue;}\nconst end=pattern.indexOf(\"'\",i+1);\nif(end===-1){literal+=pattern.slice(i+1);i=pattern.length;continue;}\nliteral+=pattern.slice(i+1,end);\ni=end+1;\ncontinue;\n}\nconst token=TOKENS.find((t)=>pattern.startsWith(t,i));\nif(token){flush();out.push({token,text:token});i+=token.length;continue;}\nif(/[A-Za-z]/.test(ch)){\nwarnOnce(\n`date.pattern.token:${ch}`,\n`the date pattern \"${pattern}\" contains '${ch}', which is not a supported token, `\n+'so it is rendered as text. Quote it as a literal to silence this. '\n+`Supported: ${TOKENS.join(' ')}.`,\n);\n}\nliteral+=ch;\ni+=1;\n}\nflush();\nreturn out;\n}\nconst WALL_CLOCK=/^(\\d{4})-(\\d{2})-(\\d{2})(?:[T ](\\d{2}):(\\d{2})(?::(\\d{2}))?(?:\\.\\d+)?)?$/;\nfunction toDate(value){\nif(isNil(value)||value==='')return null;\nif(value instanceof Date)return Number.isNaN(value.getTime())?null:value;\nif(typeof value==='number')return Number.isNaN(value)?null:new Date(value);\nif(typeof value==='string'){\nconst wall=WALL_CLOCK.exec(value.trim());\nif(wall){\nconst[,y,mo,d,h='0',mi='0',sec='0']=wall;\nreturn new Date(+y,+mo-1,+d,+h,+mi,+sec);\n}\nconst d=new Date(value);\nreturn Number.isNaN(d.getTime())?null:d;\n}\nreturn null;\n}\nfunction pad(n,w){return String(n).padStart(w,'0');}\nfunction fieldReader(timeZone){\nif(!timeZone){\nreturn(d)=>({\nyear:d.getFullYear(),month:d.getMonth()+1,day:d.getDate(),\nhour:d.getHours(),minute:d.getMinutes(),second:d.getSeconds(),\nms:d.getMilliseconds(),weekday:d.getDay(),\n});\n}\nconst zoned=new Intl.DateTimeFormat('en-US',{\ntimeZone,year:'numeric',month:'2-digit',day:'2-digit',\nhour:'2-digit',minute:'2-digit',second:'2-digit',hour12:false,weekday:'short',\n});\nconst days={Sun:0,Mon:1,Tue:2,Wed:3,Thu:4,Fri:5,Sat:6};\nreturn(d)=>{\nconst f={year:0,month:1,day:1,hour:0,minute:0,second:0,ms:d.getMilliseconds(),weekday:0};\nfor(const part of zoned.formatToParts(d)){\nswitch(part.type){\ncase'year':f.year=Number(part.value);break;\ncase'month':f.month=Number(part.value);break;\ncase'day':f.day=Number(part.value);break;\ncase'hour':f.hour=Number(part.value)%24;break;\ncase'minute':f.minute=Number(part.value);break;\ncase'second':f.second=Number(part.value);break;\ncase'weekday':f.weekday=days[part.value]??0;break;\ndefault:break;\n}\n}\nreturn f;\n};\n}\nfunction compilePattern(pattern,locale,timeZone){\nconst segments=scanPattern(pattern);\nconst read=fieldReader(timeZone);\nconst used=new Set(segments.filter((s)=>s.token).map((s)=>s.token));\nconst monthShort=used.has('MMM')?new Intl.DateTimeFormat(locale,{month:'short',timeZone}):null;\nconst monthLong=used.has('MMMM')?new Intl.DateTimeFormat(locale,{month:'long',timeZone}):null;\nconst dayShort=used.has('EEE')?new Intl.DateTimeFormat(locale,{weekday:'short',timeZone}):null;\nconst dayLong=used.has('EEEE')?new Intl.DateTimeFormat(locale,{weekday:'long',timeZone}):null;\nreturn(d)=>{\nconst f=read(d);\nlet out='';\nfor(const seg of segments){\nif(!seg.token){out+=seg.text;continue;}\nswitch(seg.token){\ncase'yyyy':out+=pad(f.year,4);break;\ncase'yy':out+=pad(f.year%100,2);break;\ncase'MMMM':out+=monthLong.format(d);break;\ncase'MMM':out+=monthShort.format(d);break;\ncase'MM':out+=pad(f.month,2);break;\ncase'M':out+=String(f.month);break;\ncase'dd':out+=pad(f.day,2);break;\ncase'd':out+=String(f.day);break;\ncase'EEEE':out+=dayLong.format(d);break;\ncase'EEE':out+=dayShort.format(d);break;\ncase'HH':out+=pad(f.hour,2);break;\ncase'H':out+=String(f.hour);break;\ncase'hh':out+=pad(f.hour%12===0?12:f.hour%12,2);break;\ncase'h':out+=String(f.hour%12===0?12:f.hour%12);break;\ncase'mm':out+=pad(f.minute,2);break;\ncase'm':out+=String(f.minute);break;\ncase'ss':out+=pad(f.second,2);break;\ncase's':out+=String(f.second);break;\ncase'SSS':out+=pad(f.ms,3);break;\ncase'a':out+=f.hour<12?'AM':'PM';break;\ndefault:out+=seg.text;break;\n}\n}\nreturn out;\n};\n}\nconst UNITS=[\n['year',365*24*3600e3],\n['month',30*24*3600e3],\n['week',7*24*3600e3],\n['day',24*3600e3],\n['hour',3600e3],\n['minute',60e3],\n['second',1e3],\n];\nfunction compileDate(spec,locale){\nconst s=spec||{};\nconst loc=s.locale||locale||undefined;\nconst nullDisplay=s.nullDisplay??'';\nconst timeZone=s.timeZone;\nlet absolute;\nif(s.pattern){\nabsolute=compilePattern(s.pattern,loc,timeZone);\n}else if(s.dateStyle||s.timeStyle){\nconst opts={timeZone};\nif(s.dateStyle)opts.dateStyle=s.dateStyle;\nif(s.timeStyle)opts.timeStyle=s.timeStyle;\nconst dtf=new Intl.DateTimeFormat(loc,opts);\nabsolute=(d)=>dtf.format(d);\n}else{\nconst dtf=new Intl.DateTimeFormat(loc,{dateStyle:'medium',timeZone});\nabsolute=(d)=>dtf.format(d);\n}\nconst relative=s.relative?new Intl.RelativeTimeFormat(loc,{numeric:'auto'}):null;\nconst thresholdDays=typeof s.relative==='object'&&s.relative\n?(s.relative.threshold??7)\n:7;\nconst thresholdMs=thresholdDays*24*3600e3;\nconst format=(value,params)=>{\nconst d=toDate(value);\nif(!d)return nullDisplay;\nif(relative){\nconst now=params&&typeof params.now==='number'?params.now:Date.now();\nconst delta=d.getTime()-now;\nif(Math.abs(delta)<thresholdMs){\nfor(const[unit,ms]of UNITS){\nif(Math.abs(delta)>=ms||unit==='second'){\nreturn relative.format(Math.round(delta/ms),unit);\n}\n}\n}\n}\nreturn absolute(d);\n};\nformat.spec=s;\nreturn format;\n}\nfunction toIsoDate(value){\nif(isNil(value)||value==='')return null;\nif(typeof value==='string'){\nconst match=/^(\\d{4}-\\d{2}-\\d{2})/.exec(value.trim());\nif(match)return match[1];\nconst parsed=toDate(value);\nreturn parsed?toIsoDate(parsed):null;\n}\nconst date=toDate(value);\nif(!date)return null;\nconst pad=(n)=>String(n).padStart(2,'0');\nreturn`${date.getFullYear()}-${pad(date.getMonth()+1)}-${pad(date.getDate())}`;\n}\nfunction toIsoDateTime(value,timeZone){\nif(isNil(value)||value==='')return null;\nif(typeof value==='string'){\nconst text=value.trim();\nif(ZONE_SUFFIX.test(text)){\nconst instant=toDate(text);\nreturn instant?wallClockIn(instant,timeZone):null;\n}\nconst match=/^(\\d{4}-\\d{2}-\\d{2})[T ](\\d{2}):(\\d{2})(?::(\\d{2}))?/.exec(text);\nif(match){\nconst[,day,hour,minute,second]=match;\nreturn`${day}T${hour}:${minute}${second&&second!=='00'?`:${second}`:''}`;\n}\nif(/^\\d{4}-\\d{2}-\\d{2}$/.test(text))return`${text}T00:00`;\nconst parsed=toDate(text);\nreturn parsed?toIsoDateTime(parsed):null;\n}\nconst date=toDate(value);\nif(!date)return null;\nreturn wallClockIn(date,timeZone);\n}\nconst ZONE_SUFFIX=/(?:Z|[+-]\\d{2}:?\\d{2})$/i;\nfunction wallClockIn(date,timeZone){\nconst pad=(n)=>String(n).padStart(2,'0');\nif(timeZone){\ntry{\nconst parts=new Intl.DateTimeFormat('en-CA',{\ntimeZone,\nyear:'numeric',month:'2-digit',day:'2-digit',\nhour:'2-digit',minute:'2-digit',second:'2-digit',\nhour12:false,\n}).formatToParts(date).reduce((out,part)=>{\nif(part.type!=='literal')out[part.type]=part.value;\nreturn out;\n},{});\nconst hour=parts.hour==='24'?'00':parts.hour;\nconst seconds=Number(parts.second);\nreturn`${parts.year}-${parts.month}-${parts.day}T${hour}:${parts.minute}`\n+(seconds?`:${parts.second}`:'');\n}catch{\n}\n}\nconst day=`${date.getFullYear()}-${pad(date.getMonth()+1)}-${pad(date.getDate())}`;\nconst seconds=date.getSeconds();\nconst clock=`${pad(date.getHours())}:${pad(date.getMinutes())}${seconds?`:${pad(seconds)}`:''}`;\nreturn`${day}T${clock}`;\n}\nfunction compareIso(a,b){\nconst left=isNil(a)||a===''?null:String(a);\nconst right=isNil(b)||b===''?null:String(b);\nif(left===null)return right===null?0:1;\nif(right===null)return-1;\nreturn left<right?-1:left>right?1:0;\n}\n});\n__def(\"packages/core/src/compute/filter.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"releaseMask\",{enumerable:true,get:function(){return releaseMask;}});\nObject.defineProperty(__exports,\"compilePredicate\",{enumerable:true,get:function(){return compilePredicate;}});\nObject.defineProperty(__exports,\"testValue\",{enumerable:true,get:function(){return testValue;}});\nObject.defineProperty(__exports,\"evaluateCondition\",{enumerable:true,get:function(){return evaluateCondition;}});\nObject.defineProperty(__exports,\"evaluateFilters\",{enumerable:true,get:function(){return evaluateFilters;}});\nObject.defineProperty(__exports,\"pruneColumn\",{enumerable:true,get:function(){return pruneColumn;}});\nObject.defineProperty(__exports,\"mentionsColumn\",{enumerable:true,get:function(){return mentionsColumn;}});\nObject.defineProperty(__exports,\"compact\",{enumerable:true,get:function(){return compact;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst isBlank=__m0[\"isBlank\"];\nconst toArray=__m0[\"toArray\"];\nconst warnOnce=__m0[\"warnOnce\"];\nconst __m1=__req(\"packages/core/src/format/date.js\");\nconst toIsoDate=__m1[\"toIsoDate\"];\nconst __m2=__req(\"packages/core/src/compute/handle.js\");\nconst bitReader=__m2[\"bitReader\"];\nconst dictSize=__m2[\"dictSize\"];\nconst dictValue=__m2[\"dictValue\"];\nconst presenceReader=__m2[\"presenceReader\"];\nconst valueComparator=__m2[\"valueComparator\"];\nconst valueReader=__m2[\"valueReader\"];\nconst ISO_DAY=/^\\d{4}-\\d{2}-\\d{2}$/;\nconst NULL_KEY='\\u0000null\\u0000';\nfunction acquireMask(ctx,n){\nconst pool=ctx&&ctx.pool;\nif(pool){\nconst take=pool.mask||pool.acquireMask||pool.acquire||pool.take;\nif(typeof take==='function'){\nconst mask=take.call(pool,n);\nif(mask&&mask.length>=n)return mask;\n}\n}\nreturn new Uint8Array(n);\n}\nfunction releaseMask(ctx,mask){\nconst pool=ctx&&ctx.pool;\nif(!pool||!mask)return;\nconst give=pool.release||pool.releaseMask||pool.free||pool.recycle;\nif(typeof give==='function')give.call(pool,mask);\n}\nfunction fillMask(mask,n,value){\nmask.fill(value,0,n);\nreturn mask;\n}\nfunction unorderable(v){\nreturn v===null||v===undefined||(typeof v==='number'&&Number.isNaN(v));\n}\nfunction coerceTarget(value,type){\nif(value===null||value===undefined)return value;\nif(type==='number')return typeof value==='number'?value:Number(value);\nif(type==='date'||type==='dateString'){\nconst iso=toIsoDate(value);\nreturn iso===null?toMillis(value):iso;\n}\nif(type==='boolean'){\nif(typeof value==='boolean')return value;\nif(value==='true'||value===1)return true;\nif(value==='false'||value===0)return false;\nreturn!!value;\n}\nreturn value;\n}\nfunction toMillis(value){\nif(value instanceof Date)return value.getTime();\nif(typeof value==='number')return value;\nreturn Date.parse(String(value));\n}\nfunction toNumber(value){\nif(typeof value==='number')return value;\nif(value instanceof Date)return value.getTime();\nif(value===null||value===undefined||value==='')return NaN;\nreturn Number(value);\n}\nfunction textOf(v,caseSensitive){\nconst s=typeof v==='string'?v:String(v);\nreturn caseSensitive?s:s.toLowerCase();\n}\nfunction setKey(v,caseSensitive){\nif(v===null||v===undefined)return NULL_KEY;\nif(typeof v==='string')return caseSensitive?v:v.toLowerCase();\nif(v instanceof Date)return v.getTime();\nreturn v;\n}\nfunction buildSet(value,caseSensitive,type){\nconst set=new Set();\nfor(const raw of toArray(value)){\nconst entry=coerceTarget(raw,type);\nset.add(setKey(entry,caseSensitive));\nif(typeof entry==='string'&&entry!==''&&Number.isFinite(Number(entry)))set.add(Number(entry));\nelse if(typeof entry==='number'&&Number.isFinite(entry))set.add(setKey(String(entry),caseSensitive));\n}\nreturn set;\n}\nfunction valueEquals(a,b,caseSensitive){\nif(a===null||a===undefined||b===null||b===undefined){\nreturn(a===null||a===undefined)&&(b===null||b===undefined);\n}\nconst ta=typeof a;\nconst tb=typeof b;\nif(ta==='string'&&tb==='string')return caseSensitive?a===b:a.toLowerCase()===b.toLowerCase();\nif(a instanceof Date||b instanceof Date)return toMillis(a)===toMillis(b);\nif(ta==='number'&&tb==='number')return a===b||(Number.isNaN(a)&&Number.isNaN(b));\nif(ta==='number'&&tb==='string')return a===Number(b);\nif(ta==='string'&&tb==='number')return Number(a)===b;\nif(ta==='boolean'||tb==='boolean')return a===b;\nif(Array.isArray(a)&&Array.isArray(b)){\nreturn a.length===b.length&&a.every((x,i)=>valueEquals(x,b[i],caseSensitive));\n}\nreturn a===b;\n}\nfunction compileRegExp(value,caseSensitive){\ntry{\nif(value instanceof RegExp){\nconst flags=value.flags.replace(/[gy]/g,'');\nreturn new RegExp(value.source,caseSensitive?flags:flags.includes('i')?flags:`${flags}i`);\n}\nreturn new RegExp(String(value),caseSensitive?'':'i');\n}catch(err){\nwarnOnce(`regex:${String(value)}`,`filter operator \"matches\" received an invalid pattern: ${String(value)}`,err);\nreturn null;\n}\n}\nfunction compilePredicate(condition,locale){\nconst predicate=compileValuePredicate(condition,locale);\nconst type=condition&&condition.type;\nif(type!=='date'&&type!=='dateString')return predicate;\nreturn(v)=>predicate(typeof v==='string'&&ISO_DAY.test(v)?v:(toIsoDate(v)??v));\n}\nfunction compileValuePredicate(condition,locale){\nconst op=condition&&condition.op;\nconst caseSensitive=!!(condition&&condition.caseSensitive);\nconst type=condition&&condition.type;\nconst cmp=valueComparator(locale);\nconst not=(p)=>(v)=>!p(v);\nswitch(op){\ncase'eq':{\nconst target=coerceTarget(condition.value,type);\nreturn(v)=>valueEquals(v,target,caseSensitive);\n}\ncase'ne':{\nconst target=coerceTarget(condition.value,type);\nreturn(v)=>!valueEquals(v,target,caseSensitive);\n}\ncase'lt':case'lte':case'gt':case'gte':{\nconst target=coerceTarget(condition.value,type);\nif(unorderable(target))return()=>false;\nconst want=op==='lt'?-1:op==='lte'?0:op==='gt'?1:2;\nreturn(v)=>{\nif(unorderable(v))return false;\nconst c=cmp(v,target);\nreturn want===-1?c<0:want===0?c<=0:want===1?c>0:c>=0;\n};\n}\ncase'between':case'notBetween':{\nconst pair=toArray(condition.value);\nconst lo=coerceTarget(pair[0],type);\nconst hi=coerceTarget(pair[1],type);\nconst bounds=condition.bounds||'[]';\nconst loInclusive=bounds.charAt(0)!=='(';\nconst hiInclusive=bounds.charAt(1)!==')';\nif(unorderable(lo)||unorderable(hi))return op==='between'?()=>false:()=>true;\nconst inRange=(v)=>{\nif(unorderable(v))return false;\nconst a=cmp(v,lo);\nconst b=cmp(v,hi);\nreturn(loInclusive?a>=0:a>0)&&(hiInclusive?b<=0:b<0);\n};\nreturn op==='between'?inRange:not(inRange);\n}\ncase'in':case'notIn':{\nconst set=buildSet(condition.value,caseSensitive,type);\nconst member=(v)=>set.has(setKey(v,caseSensitive));\nreturn op==='in'?member:not(member);\n}\ncase'contains':case'notContains':{\nconst needle=textOf(coerceTarget(condition.value,type),caseSensitive);\nconst has=(v)=>(v===null||v===undefined?false:textOf(v,caseSensitive).includes(needle));\nreturn op==='contains'?has:not(has);\n}\ncase'startsWith':{\nconst needle=textOf(coerceTarget(condition.value,type),caseSensitive);\nreturn(v)=>(v===null||v===undefined?false:textOf(v,caseSensitive).startsWith(needle));\n}\ncase'endsWith':{\nconst needle=textOf(coerceTarget(condition.value,type),caseSensitive);\nreturn(v)=>(v===null||v===undefined?false:textOf(v,caseSensitive).endsWith(needle));\n}\ncase'matches':{\nconst re=compileRegExp(condition.value,caseSensitive);\nif(!re)return()=>false;\nreturn(v)=>(v===null||v===undefined?false:re.test(String(v)));\n}\ncase'blank':\nreturn(v)=>isBlank(v)||(Array.isArray(v)&&v.length===0);\ncase'notBlank':\nreturn(v)=>!(isBlank(v)||(Array.isArray(v)&&v.length===0));\ncase'containsAny':case'containsNone':{\nconst set=buildSet(condition.value,caseSensitive,type);\nconst any=(v)=>{\nconst list=v===null||v===undefined?[]:toArray(v);\nfor(let i=0;i<list.length;i++)if(set.has(setKey(list[i],caseSensitive)))return true;\nreturn false;\n};\nreturn op==='containsAny'?any:not(any);\n}\ncase'containsAll':{\nconst wanted=toArray(condition.value).map((x)=>setKey(coerceTarget(x,type),caseSensitive));\nreturn(v)=>{\nconst list=v===null||v===undefined?[]:toArray(v);\nif(wanted.length===0)return true;\nconst have=new Set(list.map((x)=>setKey(x,caseSensitive)));\nfor(let i=0;i<wanted.length;i++)if(!have.has(wanted[i]))return false;\nreturn true;\n};\n}\ndefault:\nwarnOnce(`op:${String(op)}`,`unknown filter operator \"${String(op)}\"; the condition passes every row`);\nreturn()=>true;\n}\n}\nfunction testValue(value,condition,locale){\nreturn compilePredicate(condition,locale)(value);\n}\nfunction presenceCondition(handle,wantPresent,mask,count){\nconst present=presenceReader(handle);\nif(present){\nconst target=wantPresent?1:0;\nfor(let i=0;i<count;i++)mask[i]=present(i)===target?1:0;\nreturn mask;\n}\nconst kind=handle.kind;\nif(kind==='float64'||kind==='int32'||kind==='bitset'){\nreturn fillMask(mask,count,wantPresent?1:0);\n}\nconst read=valueReader(handle);\nfor(let i=0;i<count;i++){\nconst v=read(i);\nconst blank=isBlank(v)||(Array.isArray(v)&&v.length===0);\nmask[i]=blank===wantPresent?0:1;\n}\nreturn mask;\n}\nfunction dictionaryCondition(handle,pred,mask,count){\nconst dict=handle.dict;\nconst size=dictSize(dict);\nconst allowed=new Uint8Array(size);\nfor(let code=0;code<size;code++)allowed[code]=pred(dictValue(dict,code))?1:0;\nconst codes=handle.values;\nconst present=presenceReader(handle);\nif(!present){\nfor(let i=0;i<count;i++)mask[i]=allowed[codes[i]];\nreturn mask;\n}\nconst absentAnswer=pred(null)?1:0;\nfor(let i=0;i<count;i++)mask[i]=present(i)===1?allowed[codes[i]]:absentAnswer;\nreturn mask;\n}\nfunction booleanCondition(handle,pred,mask,count){\nconst bit=bitReader(handle.values);\nconst whenTrue=pred(true)?1:0;\nconst whenFalse=pred(false)?1:0;\nconst present=presenceReader(handle);\nif(!present){\nfor(let i=0;i<count;i++)mask[i]=bit(i)===1?whenTrue:whenFalse;\nreturn mask;\n}\nconst absentAnswer=pred(null)?1:0;\nfor(let i=0;i<count;i++){\nmask[i]=present(i)===0?absentAnswer:(bit(i)===1?whenTrue:whenFalse);\n}\nreturn mask;\n}\nfunction numericCondition(handle,condition,pred,mask,count){\nconst values=handle.values;\nconst type=condition.type;\nconst op=condition.op;\nlet handled=true;\nswitch(op){\ncase'eq':case'ne':{\nconst target=toNumber(coerceTarget(condition.value,type));\nconst wantNaN=typeof condition.value==='number'&&Number.isNaN(condition.value);\nconst invert=op==='ne'?1:0;\nif(wantNaN){\nfor(let i=0;i<count;i++)mask[i]=(Number.isNaN(values[i])?1:0)^invert;\n}else{\nfor(let i=0;i<count;i++)mask[i]=((values[i]===target)?1:0)^invert;\n}\nbreak;\n}\ncase'lt':{\nconst t=toNumber(coerceTarget(condition.value,type));\nfor(let i=0;i<count;i++)mask[i]=values[i]<t?1:0;\nbreak;\n}\ncase'lte':{\nconst t=toNumber(coerceTarget(condition.value,type));\nfor(let i=0;i<count;i++)mask[i]=values[i]<=t?1:0;\nbreak;\n}\ncase'gt':{\nconst t=toNumber(coerceTarget(condition.value,type));\nfor(let i=0;i<count;i++)mask[i]=values[i]>t?1:0;\nbreak;\n}\ncase'gte':{\nconst t=toNumber(coerceTarget(condition.value,type));\nfor(let i=0;i<count;i++)mask[i]=values[i]>=t?1:0;\nbreak;\n}\ncase'between':case'notBetween':{\nconst pair=toArray(condition.value);\nconst lo=toNumber(coerceTarget(pair[0],type));\nconst hi=toNumber(coerceTarget(pair[1],type));\nconst bounds=condition.bounds||'[]';\nconst loInclusive=bounds.charAt(0)!=='(';\nconst hiInclusive=bounds.charAt(1)!==')';\nconst invert=op==='notBetween'?1:0;\nif(loInclusive&&hiInclusive){\nfor(let i=0;i<count;i++)mask[i]=(((values[i]>=lo)&(values[i]<=hi))?1:0)^invert;\n}else if(loInclusive){\nfor(let i=0;i<count;i++)mask[i]=(((values[i]>=lo)&(values[i]<hi))?1:0)^invert;\n}else if(hiInclusive){\nfor(let i=0;i<count;i++)mask[i]=(((values[i]>lo)&(values[i]<=hi))?1:0)^invert;\n}else{\nfor(let i=0;i<count;i++)mask[i]=(((values[i]>lo)&(values[i]<hi))?1:0)^invert;\n}\nbreak;\n}\ncase'in':case'notIn':{\nconst set=new Set();\nfor(const raw of toArray(condition.value)){\nconst n=toNumber(coerceTarget(raw,type));\nif(!Number.isNaN(n))set.add(n);\n}\nconst invert=op==='notIn'?1:0;\nfor(let i=0;i<count;i++)mask[i]=(set.has(values[i])?1:0)^invert;\nbreak;\n}\ndefault:\nhandled=false;\nbreak;\n}\nif(!handled)return false;\nconst present=presenceReader(handle);\nif(present){\nconst absentAnswer=pred(null)?1:0;\nfor(let i=0;i<count;i++)if(present(i)===0)mask[i]=absentAnswer;\n}\nreturn true;\n}\nfunction genericCondition(handle,pred,mask,count){\nconst read=valueReader(handle);\nfor(let i=0;i<count;i++)mask[i]=pred(read(i))?1:0;\nreturn mask;\n}\nfunction evaluateCondition(condition,ctx,out){\nconst count=ctx.count|0;\nconst mask=out||acquireMask(ctx,count);\nif(!condition)return fillMask(mask,count,1);\nconst handle=typeof ctx.handle==='function'?ctx.handle(condition.col):undefined;\nconst custom=typeof ctx.custom==='function'?ctx.custom:null;\nif(!handle){\nif(custom){\nfor(let i=0;i<count;i++)mask[i]=custom(condition,i)?1:0;\nreturn mask;\n}\nwarnOnce(`filter:col:${String(condition.col)}`,\n`filter references unknown column \"${String(condition.col)}\"; the condition passes every row`);\nreturn fillMask(mask,count,1);\n}\nconst op=condition.op;\nif(op==='blank'||op==='notBlank')return presenceCondition(handle,op==='notBlank',mask,count);\nconst pred=compilePredicate(condition,ctx.locale);\nswitch(handle.kind){\ncase'dictionary':\nreturn dictionaryCondition(handle,pred,mask,count);\ncase'bitset':\nreturn booleanCondition(handle,pred,mask,count);\ncase'float64':case'int32':\nif(numericCondition(handle,condition,pred,mask,count))return mask;\nreturn genericCondition(handle,pred,mask,count);\ndefault:\nreturn genericCondition(handle,pred,mask,count);\n}\n}\nfunction evaluateNode(node,ctx,count){\nif(!node)return fillMask(acquireMask(ctx,count),count,1);\nif(Array.isArray(node.conditions)){\nconst children=node.conditions.filter((c)=>c!=null);\nconst op=node.op==='or'?'or':node.op==='not'?'not':'and';\nif(children.length===0)return fillMask(acquireMask(ctx,count),count,1);\nconst acc=evaluateNode(children[0],ctx,count);\nfor(let k=1;k<children.length;k++){\nconst rhs=evaluateNode(children[k],ctx,count);\nif(op==='or')for(let i=0;i<count;i++)acc[i]|=rhs[i];\nelse for(let i=0;i<count;i++)acc[i]&=rhs[i];\nreleaseMask(ctx,rhs);\n}\nif(op==='not')for(let i=0;i<count;i++)acc[i]^=1;\nreturn acc;\n}\nreturn evaluateCondition(node,ctx,acquireMask(ctx,count));\n}\nfunction evaluateFilters(filters,ctx){\nreturn evaluateNode(filters,ctx,ctx.count|0);\n}\nfunction pruneColumn(filters,colId){\nif(!filters||!colId)return filters||null;\nconst node=(filters);\nif(Array.isArray(node.conditions)){\nconst op=node.op==='or'?'or':node.op==='not'?'not':'and';\nif(op!=='and'){\nreturn mentionsColumn(node,colId)?null:filters;\n}\nconst kept=[];\nfor(const child of node.conditions){\nconst pruned=pruneColumn(child,colId);\nif(pruned)kept.push(pruned);\n}\nif(!kept.length)return null;\nreturn{...node,op:'and',conditions:kept};\n}\nreturn node.col===colId?null:filters;\n}\nfunction mentionsColumn(filters,colId){\nif(!filters||typeof filters!=='object')return false;\nconst node=(filters);\nif(node.col===colId)return true;\nif(Array.isArray(node.conditions)){\nfor(const child of node.conditions)if(mentionsColumn(child,colId))return true;\n}\nreturn false;\n}\nfunction compact(mask,count,out){\nif(out&&out.length>=count){\nlet k=0;\nfor(let i=0;i<count;i++)if(mask[i])out[k++]=i;\nreturn out.subarray(0,k);\n}\nlet survivors=0;\nfor(let i=0;i<count;i++)survivors+=mask[i]?1:0;\nconst result=new Uint32Array(survivors);\nlet k=0;\nfor(let i=0;i<count;i++)if(mask[i])result[k++]=i;\nreturn result;\n}\n});\n__def(\"packages/core/src/compute/group.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"packKeys\",{enumerable:true,get:function(){return packKeys;}});\nObject.defineProperty(__exports,\"groupByColumns\",{enumerable:true,get:function(){return groupByColumns;}});\nconst __m0=__req(\"packages/core/src/compute/handle.js\");\nconst dictSize=__m0[\"dictSize\"];\nconst identity=__m0[\"identity\"];\nconst presenceReader=__m0[\"presenceReader\"];\nconst rowCount=__m0[\"rowCount\"];\nconst valueReader=__m0[\"valueReader\"];\nconst KEY_SEPARATOR='\\u001F';\nconst NULL_MARKER='\\u0000';\nconst MAX_DIRECT_COUNTS=1<<20;\nfunction packKeys(handles,idx,n){\nconst k=handles.length;\nconst readers=handles.map((h)=>valueReader(h));\nconst allDictionary=k>0&&handles.every((h)=>h&&h.kind==='dictionary'&&h.dict);\nif(allDictionary){\nconst cards=handles.map((h)=>dictSize(h.dict)+1);\nlet product=1;\nfor(let j=0;j<k;j++)product*=cards[j];\nif(product<=Number.MAX_SAFE_INTEGER){\nconst codes=handles.map((h)=>h.values);\nconst presence=handles.map((h)=>presenceReader(h));\nconst keyOf=(row)=>{\nlet key=0;\nfor(let j=0;j<k;j++){\nconst present=presence[j];\nconst code=present&&present(row)===0?cards[j]-1:codes[j][row];\nkey=key*cards[j]+code;\n}\nreturn key;\n};\nconst packed=new Float64Array(n);\nfor(let i=0;i<n;i++)packed[i]=keyOf(idx[i]);\nreturn{packed,strings:null,product,readers,keyOf};\n}\n}\nconst keyOf=(row)=>{\nlet key='';\nfor(let j=0;j<k;j++){\nconst v=readers[j](row);\nkey+=(j===0?'':KEY_SEPARATOR)+(v===null||v===undefined?NULL_MARKER:String(v));\n}\nreturn key;\n};\nconst strings=new Array(n);\nfor(let i=0;i<n;i++)strings[i]=keyOf(idx[i]);\nreturn{packed:null,strings,product:Infinity,readers,keyOf};\n}\nfunction scatterBuckets(idx,ids,n,groups){\nconst offsets=new Uint32Array(groups+1);\nfor(let i=0;i<n;i++)offsets[ids[i]+1]++;\nfor(let g=0;g<groups;g++)offsets[g+1]+=offsets[g];\nconst scattered=new Uint32Array(n);\nconst cursor=offsets.slice(0,groups);\nfor(let i=0;i<n;i++)scattered[cursor[ids[i]]++]=idx[i];\nconst buckets=new Array(groups);\nfor(let g=0;g<groups;g++)buckets[g]=scattered.subarray(offsets[g],offsets[g+1]);\nreturn buckets;\n}\nfunction groupByColumns(handles,order,opts={}){\nconst list=handles||[];\nconst idx=order||identity(rowCount(list[0],opts));\nconst n=idx.length;\nif(list.length===0||n===0)return{keys:[],buckets:[]};\nconst{packed,strings,product,readers}=packKeys(list,idx,n);\nconst ids=new Uint32Array(n);\nlet groups=0;\nlet packedKeys=null;\nif(packed&&product<=Math.max(1024,Math.min(MAX_DIRECT_COUNTS,n*4))){\nconst size=product;\nconst seen=new Int32Array(size).fill(-1);\nfor(let i=0;i<n;i++)seen[packed[i]]=0;\nfor(let key=0;key<size;key++)if(seen[key]===0)seen[key]=groups++;\nfor(let i=0;i<n;i++)ids[i]=seen[packed[i]];\npackedKeys=new Float64Array(groups);\nfor(let key=0;key<size;key++)if(seen[key]>=0)packedKeys[seen[key]]=key;\n}else if(packed){\nconst seen=new Map();\nfor(let i=0;i<n;i++){\nconst key=packed[i];\nlet id=seen.get(key);\nif(id===undefined){id=groups++;seen.set(key,id);}\nids[i]=id;\n}\npackedKeys=new Float64Array(groups);\nfor(const[key,id]of seen)packedKeys[id]=key;\n}else{\nconst seen=new Map();\nfor(let i=0;i<n;i++){\nconst key=strings[i];\nlet id=seen.get(key);\nif(id===undefined){id=groups++;seen.set(key,id);}\nids[i]=id;\n}\n}\nconst buckets=scatterBuckets(idx,ids,n,groups);\nconst keys=new Array(groups);\nfor(let g=0;g<groups;g++){\nconst row=buckets[g][0];\nconst tuple=new Array(readers.length);\nfor(let j=0;j<readers.length;j++)tuple[j]=readers[j](row);\nkeys[g]=tuple;\n}\nconst result={keys,buckets};\nif(packedKeys)result.packed=packedKeys;\nreturn result;\n}\n});\n__def(\"packages/core/src/compute/facet.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"STRATEGIES\",{enumerable:true,get:function(){return STRATEGIES;}});\nObject.defineProperty(__exports,\"GRANULARITIES\",{enumerable:true,get:function(){return GRANULARITIES;}});\nObject.defineProperty(__exports,\"DEFAULT_BUCKETS\",{enumerable:true,get:function(){return DEFAULT_BUCKETS;}});\nObject.defineProperty(__exports,\"DEFAULT_CARDINALITY_LIMIT\",{enumerable:true,get:function(){return DEFAULT_CARDINALITY_LIMIT;}});\nObject.defineProperty(__exports,\"QUANTILE_SAMPLE\",{enumerable:true,get:function(){return QUANTILE_SAMPLE;}});\nObject.defineProperty(__exports,\"facetKind\",{enumerable:true,get:function(){return facetKind;}});\nObject.defineProperty(__exports,\"orderedReader\",{enumerable:true,get:function(){return orderedReader;}});\nObject.defineProperty(__exports,\"toNumeric\",{enumerable:true,get:function(){return toNumeric;}});\nObject.defineProperty(__exports,\"cardinalityOf\",{enumerable:true,get:function(){return cardinalityOf;}});\nObject.defineProperty(__exports,\"pickGranularity\",{enumerable:true,get:function(){return pickGranularity;}});\nObject.defineProperty(__exports,\"floorTo\",{enumerable:true,get:function(){return floorTo;}});\nObject.defineProperty(__exports,\"advance\",{enumerable:true,get:function(){return advance;}});\nObject.defineProperty(__exports,\"computeBounds\",{enumerable:true,get:function(){return computeBounds;}});\nObject.defineProperty(__exports,\"countInto\",{enumerable:true,get:function(){return countInto;}});\nObject.defineProperty(__exports,\"bucketOf\",{enumerable:true,get:function(){return bucketOf;}});\nObject.defineProperty(__exports,\"facet\",{enumerable:true,get:function(){return facet;}});\nObject.defineProperty(__exports,\"default\",{enumerable:true,get:function(){return __default;}});\nconst __m0=__req(\"packages/core/src/compute/handle.js\");\nconst presenceReader=__m0[\"presenceReader\"];\nconst valueReader=__m0[\"valueReader\"];\nconst dictSize=__m0[\"dictSize\"];\nconst dictValue=__m0[\"dictValue\"];\nconst STRATEGIES=Object.freeze(['equal','quantile','log']);\nconst GRANULARITIES=Object.freeze(['hour','day','week','month','quarter','year']);\nconst DEFAULT_BUCKETS=20;\nconst DEFAULT_CARDINALITY_LIMIT=50;\nconst QUANTILE_SAMPLE=10_000;\nfunction facetKind(handle,type){\nif(!handle)return'none';\nconst base=type&&type.base;\nif(base==='date'||base==='datetime'||base==='time'||base==='dateString')return'date';\nswitch(handle.kind){\ncase'bitset':return'boolean';\ncase'float64':case'int32':return'numeric';\ncase'dictionary':return'category';\ncase'multi':return'category';\ndefault:\nif(base==='number')return'numeric';\nif(base==='boolean')return'boolean';\nif(base==='text')return'category';\nreturn'none';\n}\n}\nfunction orderedReader(handle){\nconst values=handle.values;\nconst kind=handle.kind;\nif((kind==='float64'||kind==='int32')&&values)return(i)=>values[i];\nconst read=valueReader(handle);\nreturn(i)=>toNumeric(read(i));\n}\nfunction toNumeric(v){\nif(typeof v==='number')return v;\nif(v instanceof Date)return v.getTime();\nif(v===null||v===undefined||v==='')return NaN;\nif(typeof v==='boolean')return v?1:0;\nif(typeof v==='string'){\nconst n=Number(v);\nif(Number.isFinite(n))return n;\nconst t=Date.parse(v);\nreturn Number.isFinite(t)?t:NaN;\n}\nreturn NaN;\n}\nfunction cardinalityOf(handle,indices,count,limit=DEFAULT_CARDINALITY_LIMIT){\nif(!handle)return{cardinality:0,exact:true};\nif(handle.dict)return{cardinality:dictSize(handle.dict),exact:true};\nif(handle.kind==='bitset')return{cardinality:2,exact:true};\nconst read=valueReader(handle);\nconst n=indices?indices.length:count;\nconst seen=new Set();\nfor(let k=0;k<n;k++){\nconst v=read(indices?indices[k]:k);\nif(v===null||v===undefined)continue;\nseen.add(v);\nif(seen.size>limit)return{cardinality:seen.size,exact:false};\n}\nreturn{cardinality:seen.size,exact:true};\n}\nconst HOUR_MS=3600_000;\nconst DAY_MS=86_400_000;\nfunction pickGranularity(span,target=DEFAULT_BUCKETS){\nconst ms=Number.isFinite(span)&&span>0?span:0;\nconst wide=Math.max(1,target)*2;\nif(ms/HOUR_MS<=wide)return'hour';\nif(ms/DAY_MS<=wide)return'day';\nif(ms/(7*DAY_MS)<=wide)return'week';\nif(ms/(30*DAY_MS)<=wide)return'month';\nif(ms/(91*DAY_MS)<=wide)return'quarter';\nreturn'year';\n}\nfunction floorTo(ms,granularity){\nif(!Number.isFinite(ms))return NaN;\nconst d=new Date(ms);\nswitch(granularity){\ncase'hour':d.setMinutes(0,0,0);return d.getTime();\ncase'day':d.setHours(0,0,0,0);return d.getTime();\ncase'week':{\nd.setHours(0,0,0,0);\nconst back=(d.getDay()+6)%7;\nd.setDate(d.getDate()-back);\nreturn d.getTime();\n}\ncase'month':d.setDate(1);d.setHours(0,0,0,0);return d.getTime();\ncase'quarter':\nd.setMonth(Math.floor(d.getMonth()/3)*3,1);\nd.setHours(0,0,0,0);\nreturn d.getTime();\ndefault:d.setMonth(0,1);d.setHours(0,0,0,0);return d.getTime();\n}\n}\nfunction advance(ms,granularity){\nconst d=new Date(ms);\nswitch(granularity){\ncase'hour':d.setHours(d.getHours()+1);break;\ncase'day':d.setDate(d.getDate()+1);break;\ncase'week':d.setDate(d.getDate()+7);break;\ncase'month':d.setMonth(d.getMonth()+1);break;\ncase'quarter':d.setMonth(d.getMonth()+3);break;\ndefault:d.setFullYear(d.getFullYear()+1);break;\n}\nreturn d.getTime();\n}\nfunction numericExtent(handle,indices,count){\nconst read=orderedReader(handle);\nconst present=presenceReader(handle);\nconst n=indices?indices.length:count;\nlet min=Infinity;\nlet max=-Infinity;\nlet nulls=0;\nlet finite=0;\nfor(let k=0;k<n;k++){\nconst i=indices?indices[k]:k;\nif(present&&!present(i)){nulls++;continue;}\nconst v=read(i);\nif(!Number.isFinite(v)){nulls++;continue;}\nif(v<min)min=v;\nif(v>max)max=v;\nfinite++;\n}\nreturn{min,max,nulls,finite};\n}\nfunction sortedSample(handle,indices,count,cap){\nconst read=orderedReader(handle);\nconst present=presenceReader(handle);\nconst n=indices?indices.length:count;\nconst step=n>cap?n/cap:1;\nconst out=[];\nfor(let s=0;s<n;s+=step){\nconst i=indices?indices[Math.floor(s)]:Math.floor(s);\nif(present&&!present(i))continue;\nconst v=read(i);\nif(Number.isFinite(v))out.push(v);\n}\nconst arr=Float64Array.from(out);\narr.sort();\nreturn arr;\n}\nfunction computeBounds(handle,indices,count,opts={}){\nconst kind=opts.kind||facetKind(handle,opts.type);\nif(kind==='none'||!handle)return{kind:'none',buckets:[],suppressed:'type'};\nif(kind==='boolean')return boundsForBoolean(handle,indices,count);\nif(kind==='category')return boundsForCategory(handle,indices,count,opts);\nreturn boundsForOrdered(handle,indices,count,kind,opts);\n}\nfunction boundsForBoolean(handle,indices,count){\nconst present=presenceReader(handle);\nlet nulls=0;\nif(present){\nconst n=indices?indices.length:count;\nfor(let k=0;k<n;k++)if(!present(indices?indices[k]:k))nulls++;\n}\nconst buckets=[{value:false,label:'false'},{value:true,label:'true'}];\nif(nulls>0)buckets.push({null:true,label:'Empty'});\nreturn{kind:'boolean',buckets};\n}\nfunction boundsForCategory(handle,indices,count,opts){\nconst limit=opts.cardinalityLimit??DEFAULT_CARDINALITY_LIMIT;\nconst{cardinality}=cardinalityOf(handle,indices,count,limit);\nif(cardinality>limit&&(opts.aboveLimit||'suppress')==='suppress'){\nreturn{kind:'category',buckets:[],suppressed:'cardinality',cardinality};\n}\nconst read=valueReader(handle);\nconst n=indices?indices.length:count;\nconst tally=new Map();\nlet nulls=0;\nfor(let k=0;k<n;k++){\nconst v=read(indices?indices[k]:k);\nif(v===null||v===undefined||v===''){nulls++;continue;}\nif(Array.isArray(v)){\nif(!v.length){nulls++;continue;}\nfor(const m of v)tally.set(m,(tally.get(m)||0)+1);\ncontinue;\n}\ntally.set(v,(tally.get(v)||0)+1);\n}\nlet entries=[...tally.entries()];\nif(opts.order==='alpha'){\nentries.sort((a,b)=>String(a[0]).localeCompare(String(b[0])));\n}else{\nentries.sort((a,b)=>b[1]-a[1]);\n}\nlet remainder=0;\nlet dropped=0;\nif(entries.length>limit){\ndropped=entries.length-limit;\nfor(let i=limit;i<entries.length;i++)remainder+=entries[i][1];\nentries=entries.slice(0,limit);\n}\nconst buckets=entries.map(([value])=>({value,label:String(value)}));\nif(remainder>0)buckets.push({remainder:true,label:`Other (${dropped} values)`});\nif(nulls>0)buckets.push({null:true,label:'Empty'});\nreturn{kind:'category',buckets,cardinality};\n}\nfunction boundsForOrdered(handle,indices,count,kind,opts){\nconst{min,max,nulls,finite}=numericExtent(handle,indices,count);\nif(!finite){\nreturn{kind,buckets:nulls?[{null:true,label:'Empty'}]:[],empty:true};\n}\nconst wanted=Math.max(1,Math.floor(opts.buckets||DEFAULT_BUCKETS));\nlet buckets=[];\nif(kind==='date'){\nconst granularity=GRANULARITIES.includes(opts.granularity)\n?opts.granularity:pickGranularity(max-min,wanted);\nlet edge=floorTo(min,granularity);\nwhile(edge<=max&&buckets.length<4096){\nconst next=advance(edge,granularity);\nif(!(next>edge))break;\nbuckets.push({from:edge,to:next});\nedge=next;\n}\nreturn{kind,buckets:withNull(buckets,nulls),granularity};\n}\nconst strategy=STRATEGIES.includes(opts.strategy)?opts.strategy:'equal';\nif(strategy==='quantile'){\nconst sample=sortedSample(handle,indices,count,QUANTILE_SAMPLE);\nif(sample.length){\nconst edges=[sample[0]];\nfor(let b=1;b<wanted;b++){\nconst v=sample[Math.min(sample.length-1,Math.floor((b/wanted)*sample.length))];\nif(v>edges[edges.length-1])edges.push(v);\n}\nedges.push(max);\nfor(let b=0;b<edges.length-1;b++)buckets.push({from:edges[b],to:edges[b+1]});\n}\n}else if(strategy==='log'&&min>0){\nconst lo=Math.log10(min);\nconst hi=Math.log10(max);\nconst step=(hi-lo)/wanted||1;\nfor(let b=0;b<wanted;b++){\nbuckets.push({from:10**(lo+b*step),to:10**(lo+(b+1)*step)});\n}\n}\nif(!buckets.length){\nconst width=(max-min)/wanted||1;\nfor(let b=0;b<wanted;b++)buckets.push({from:min+b*width,to:min+(b+1)*width});\n}\nbuckets[buckets.length-1].to=max;\nreturn{kind,buckets:withNull(buckets,nulls),strategy,min,max};\n}\nfunction withNull(buckets,nulls){\nreturn nulls>0?[...buckets,{null:true,label:'Empty'}]:buckets;\n}\nfunction countInto(handle,indices,count,bounds,out){\nconst buckets=(bounds&&bounds.buckets)||[];\nconst counts=out&&out.length>=buckets.length?out.subarray(0,buckets.length)\n:new Uint32Array(buckets.length);\ncounts.fill(0);\nif(!handle||!buckets.length)return counts;\nconst nullBucket=buckets.length-1;\nconst hasNull=!!buckets[nullBucket]&&buckets[nullBucket].null===true;\nconst n=indices?indices.length:count;\nif(bounds.kind==='boolean'){\nconst read=valueReader(handle);\nfor(let k=0;k<n;k++){\nconst v=read(indices?indices[k]:k);\nif(v===null||v===undefined){if(hasNull)counts[nullBucket]++;continue;}\ncounts[v?1:0]++;\n}\nreturn counts;\n}\nif(bounds.kind==='category'){\nconst slot=new Map();\nfor(let b=0;b<buckets.length;b++){\nif(!buckets[b].null&&!buckets[b].remainder)slot.set(buckets[b].value,b);\n}\nconst remainderAt=buckets.findIndex((b)=>b.remainder);\nconst read=valueReader(handle);\nfor(let k=0;k<n;k++){\nconst v=read(indices?indices[k]:k);\nif(v===null||v===undefined||v===''){if(hasNull)counts[nullBucket]++;continue;}\nif(Array.isArray(v)){\nif(!v.length){if(hasNull)counts[nullBucket]++;continue;}\nfor(const m of v){\nconst at=slot.get(m);\nif(at!==undefined)counts[at]++;\nelse if(remainderAt>=0)counts[remainderAt]++;\n}\ncontinue;\n}\nconst at=slot.get(v);\nif(at!==undefined)counts[at]++;\nelse if(remainderAt>=0)counts[remainderAt]++;\n}\nreturn counts;\n}\nconst ordered=hasNull?buckets.length-1:buckets.length;\nconst edges=new Float64Array(ordered+1);\nfor(let b=0;b<ordered;b++)edges[b]=buckets[b].from;\nedges[ordered]=ordered?buckets[ordered-1].to:0;\nconst read=orderedReader(handle);\nconst present=presenceReader(handle);\nfor(let k=0;k<n;k++){\nconst i=indices?indices[k]:k;\nif(present&&!present(i)){if(hasNull)counts[nullBucket]++;continue;}\nconst v=read(i);\nif(!Number.isFinite(v)){if(hasNull)counts[nullBucket]++;continue;}\nconst at=bucketOf(edges,ordered,v);\nif(at>=0)counts[at]++;\n}\nreturn counts;\n}\nfunction bucketOf(edges,ordered,v){\nif(!ordered)return-1;\nif(v<edges[0])return-1;\nif(v>=edges[ordered])return v===edges[ordered]?ordered-1:-1;\nlet lo=0;\nlet hi=ordered-1;\nwhile(lo<hi){\nconst mid=(lo+hi+1)>>>1;\nif(v>=edges[mid])lo=mid;else hi=mid-1;\n}\nreturn lo;\n}\nfunction facet(handle,indices,count,opts={}){\nconst bounds=opts.bounds||computeBounds(handle,opts.boundsIndices??indices,count,opts);\nreturn{bounds,counts:countInto(handle,indices,count,bounds)};\n}\nconst __default=facet;\n});\n__def(\"packages/core/src/compute/statistics.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"MAINTENANCE\",{enumerable:true,get:function(){return MAINTENANCE;}});\nObject.defineProperty(__exports,\"numbers\",{enumerable:true,get:function(){return numbers;}});\nObject.defineProperty(__exports,\"moments\",{enumerable:true,get:function(){return moments;}});\nObject.defineProperty(__exports,\"quantileSorted\",{enumerable:true,get:function(){return quantileSorted;}});\nObject.defineProperty(__exports,\"quantile\",{enumerable:true,get:function(){return quantile;}});\nObject.defineProperty(__exports,\"STAT_FNS\",{enumerable:true,get:function(){return STAT_FNS;}});\nObject.defineProperty(__exports,\"STAT_LABELS\",{enumerable:true,get:function(){return STAT_LABELS;}});\nObject.defineProperty(__exports,\"weightedAverage\",{enumerable:true,get:function(){return weightedAverage;}});\nObject.defineProperty(__exports,\"extremeRow\",{enumerable:true,get:function(){return extremeRow;}});\nObject.defineProperty(__exports,\"correlation\",{enumerable:true,get:function(){return correlation;}});\nObject.defineProperty(__exports,\"countOutside\",{enumerable:true,get:function(){return countOutside;}});\nObject.defineProperty(__exports,\"histogram\",{enumerable:true,get:function(){return histogram;}});\nconst __m0=__req(\"packages/core/src/compute/handle.js\");\nconst presenceReader=__m0[\"presenceReader\"];\nconst valueReader=__m0[\"valueReader\"];\nconst MAINTENANCE=Object.freeze({\nvariance:'maintained',\nvarianceP:'maintained',\nstddev:'maintained',\nstddevP:'maintained',\nsumSquares:'maintained',\nweightedAvg:'maintained',\nmedian:'rescan',\np25:'rescan',\np75:'rescan',\np90:'rescan',\np95:'rescan',\np99:'rescan',\niqr:'rescan',\nmode:'rescan',\ndistinct:'rescan',\nrange:'rescan',\nskewness:'rescan',\nkurtosis:'rescan',\ngeomean:'rescan',\nharmean:'rescan',\nmad:'rescan',\nargmin:'rescan',\nargmax:'rescan',\n});\nfunction numbers(handle,indices){\nconst n=indices.length;\nconst out=new Float64Array(n);\nlet count=0;\nconst numeric=handle&&(handle.kind==='float64'||handle.kind==='int32');\nif(numeric){\nconst values=handle.values;\nconst present=presenceReader(handle);\nfor(let i=0;i<n;i++){\nconst row=indices[i];\nif(present&&present(row)!==1)continue;\nconst v=values[row];\nif(Number.isNaN(v))continue;\nout[count++]=v;\n}\nreturn out.subarray(0,count);\n}\nconst read=valueReader(handle);\nfor(let i=0;i<n;i++){\nconst raw=read(indices[i]);\nif(raw===null||raw===undefined||raw==='')continue;\nconst v=typeof raw==='number'?raw:Number(raw);\nif(!Number.isFinite(v))continue;\nout[count++]=v;\n}\nreturn out.subarray(0,count);\n}\nfunction moments(values){\nlet n=0;\nlet mean=0;\nlet m2=0;\nfor(let i=0;i<values.length;i++){\nconst x=values[i];\nn++;\nconst delta=x-mean;\nmean+=delta/n;\nm2+=delta*(x-mean);\n}\nreturn{n,mean,m2};\n}\nfunction quantileSorted(sorted,p){\nconst n=sorted.length;\nif(!n)return NaN;\nif(n===1)return sorted[0];\nconst h=(n-1)*Math.min(1,Math.max(0,p));\nconst lo=Math.floor(h);\nconst hi=Math.ceil(h);\nif(lo===hi)return sorted[lo];\nreturn sorted[lo]+(h-lo)*(sorted[hi]-sorted[lo]);\n}\nfunction quantile(values,p){\nif(!values.length)return NaN;\nconst sorted=values.slice().sort();\nreturn quantileSorted(sorted,p);\n}\nconst STAT_FNS=Object.freeze({\nvariance:(h,i)=>{\nconst{n,m2}=moments(numbers(h,i));\nreturn n>1?m2/(n-1):null;\n},\nvarianceP:(h,i)=>{\nconst{n,m2}=moments(numbers(h,i));\nreturn n>0?m2/n:null;\n},\nstddev:(h,i)=>{\nconst{n,m2}=moments(numbers(h,i));\nreturn n>1?Math.sqrt(m2/(n-1)):null;\n},\nstddevP:(h,i)=>{\nconst{n,m2}=moments(numbers(h,i));\nreturn n>0?Math.sqrt(m2/n):null;\n},\nmedian:(h,i)=>{\nconst values=numbers(h,i);\nreturn values.length?quantile(values,0.5):null;\n},\np25:(h,i)=>{\nconst values=numbers(h,i);\nreturn values.length?quantile(values,0.25):null;\n},\np75:(h,i)=>{\nconst values=numbers(h,i);\nreturn values.length?quantile(values,0.75):null;\n},\np90:(h,i)=>{\nconst values=numbers(h,i);\nreturn values.length?quantile(values,0.9):null;\n},\np95:(h,i)=>{\nconst values=numbers(h,i);\nreturn values.length?quantile(values,0.95):null;\n},\np99:(h,i)=>{\nconst values=numbers(h,i);\nreturn values.length?quantile(values,0.99):null;\n},\niqr:(h,i)=>{\nconst values=numbers(h,i);\nif(!values.length)return null;\nconst sorted=values.slice().sort();\nreturn quantileSorted(sorted,0.75)-quantileSorted(sorted,0.25);\n},\nmad:(h,i)=>{\nconst values=numbers(h,i);\nif(!values.length)return null;\nconst middle=quantile(values,0.5);\nconst deviations=new Float64Array(values.length);\nfor(let k=0;k<values.length;k++)deviations[k]=Math.abs(values[k]-middle);\nreturn quantile(deviations,0.5);\n},\nrange:(h,i)=>{\nconst values=numbers(h,i);\nif(!values.length)return null;\nlet lo=Infinity;\nlet hi=-Infinity;\nfor(let k=0;k<values.length;k++){\nif(values[k]<lo)lo=values[k];\nif(values[k]>hi)hi=values[k];\n}\nreturn hi-lo;\n},\ndistinct:(h,i)=>{\nconst read=valueReader(h);\nconst seen=new Set();\nfor(let k=0;k<i.length;k++){\nconst v=read(i[k]);\nif(v===null||v===undefined||v==='')continue;\nseen.add(v instanceof Date?v.getTime():v);\n}\nreturn seen.size;\n},\nmode:(h,i)=>{\nconst read=valueReader(h);\nconst counts=new Map();\nfor(let k=0;k<i.length;k++){\nconst v=read(i[k]);\nif(v===null||v===undefined||v==='')continue;\nconst id=v instanceof Date?v.getTime():v;\ncounts.set(id,(counts.get(id)||0)+1);\n}\nlet best=null;\nlet most=1;\nfor(const[value,times]of counts){\nif(times>most){\nmost=times;\nbest=value;\n}\n}\nreturn best;\n},\nskewness:(h,i)=>{\nconst values=numbers(h,i);\nconst{n,mean,m2}=moments(values);\nif(n<3||m2<=0)return null;\nconst sd=Math.sqrt(m2/(n-1));\nlet sum=0;\nfor(let k=0;k<values.length;k++)sum+=((values[k]-mean)/sd)**3;\nreturn(n/((n-1)*(n-2)))*sum;\n},\nkurtosis:(h,i)=>{\nconst values=numbers(h,i);\nconst{n,mean,m2}=moments(values);\nif(n<4||m2<=0)return null;\nconst sd=Math.sqrt(m2/(n-1));\nlet sum=0;\nfor(let k=0;k<values.length;k++)sum+=((values[k]-mean)/sd)**4;\nconst a=(n*(n+1))/((n-1)*(n-2)*(n-3));\nconst b=(3*(n-1)**2)/((n-2)*(n-3));\nreturn a*sum-b;\n},\ngeomean:(h,i)=>{\nconst values=numbers(h,i);\nif(!values.length)return null;\nlet sum=0;\nfor(let k=0;k<values.length;k++){\nif(values[k]<=0)return null;\nsum+=Math.log(values[k]);\n}\nreturn Math.exp(sum/values.length);\n},\nharmean:(h,i)=>{\nconst values=numbers(h,i);\nif(!values.length)return null;\nlet sum=0;\nfor(let k=0;k<values.length;k++){\nif(values[k]===0)return null;\nsum+=1/values[k];\n}\nreturn values.length/sum;\n},\nsumSquares:(h,i)=>{\nconst values=numbers(h,i);\nlet sum=0;\nfor(let k=0;k<values.length;k++)sum+=values[k]*values[k];\nreturn sum;\n},\n});\nconst STAT_LABELS=Object.freeze({\nmedian:'Median',\np25:'25th percentile',\np75:'75th percentile',\np90:'90th percentile',\np95:'95th percentile',\np99:'99th percentile',\niqr:'Interquartile range',\nmad:'Median absolute deviation',\nvariance:'Variance',\nvarianceP:'Variance (population)',\nstddev:'Standard deviation',\nstddevP:'Standard deviation (population)',\nrange:'Range',\ndistinct:'Distinct',\nmode:'Mode',\nskewness:'Skewness',\nkurtosis:'Kurtosis',\ngeomean:'Geometric mean',\nharmean:'Harmonic mean',\nsumSquares:'Sum of squares',\nweightedAvg:'Weighted average',\nargmin:'Lowest by',\nargmax:'Highest by',\n});\nfunction weightedAverage(handle,weights,indices){\nconst readValue=valueReader(handle);\nconst readWeight=valueReader(weights);\nlet top=0;\nlet bottom=0;\nfor(let i=0;i<indices.length;i++){\nconst row=indices[i];\nconst value=Number(readValue(row));\nconst weight=Number(readWeight(row));\nif(!Number.isFinite(value)||!Number.isFinite(weight))continue;\ntop+=value*weight;\nbottom+=weight;\n}\nreturn bottom===0?null:top/bottom;\n}\nfunction extremeRow(handle,indices,largest){\nconst read=valueReader(handle);\nlet best=null;\nlet bestValue=largest?-Infinity:Infinity;\nfor(let i=0;i<indices.length;i++){\nconst row=indices[i];\nconst value=Number(read(row));\nif(!Number.isFinite(value))continue;\nif(largest?value>bestValue:value<bestValue){\nbestValue=value;\nbest=row;\n}\n}\nreturn best;\n}\nfunction correlation(a,b,indices){\nconst readA=valueReader(a);\nconst readB=valueReader(b);\nlet n=0;\nlet sx=0;\nlet sy=0;\nlet sxx=0;\nlet syy=0;\nlet sxy=0;\nfor(let i=0;i<indices.length;i++){\nconst row=indices[i];\nconst x=Number(readA(row));\nconst y=Number(readB(row));\nif(!Number.isFinite(x)||!Number.isFinite(y))continue;\nn++;\nsx+=x;\nsy+=y;\nsxx+=x*x;\nsyy+=y*y;\nsxy+=x*y;\n}\nif(n<2)return null;\nconst top=n*sxy-sx*sy;\nconst bottom=Math.sqrt((n*sxx-sx*sx)*(n*syy-sy*sy));\nif(bottom===0)return null;\nconst r=top/bottom;\nreturn Math.max(-1,Math.min(1,r));\n}\nfunction countOutside(values,low,high){\nlet count=0;\nfor(let i=0;i<values.length;i++){\nif(values[i]<low||values[i]>high)count++;\n}\nreturn count;\n}\nfunction histogram(sorted,q1,q3,cap=20){\nconst n=sorted.length;\nif(!n)return[];\nconst min=sorted[0];\nconst max=sorted[n-1];\nif(max===min)return[{from:min,to:max,count:n}];\nconst iqr=q3-q1;\nconst fence=1.5*iqr;\nlet lo=iqr>0?Math.max(min,q1-fence):min;\nlet hi=iqr>0?Math.min(max,q3+fence):max;\nif(!(hi>lo)){lo=min;hi=max;}\nconst width=iqr>0?(2*iqr)/Math.cbrt(n):(hi-lo)/(Math.ceil(Math.log2(n))+1);\nconst count=width>0\n?Math.min(cap,Math.max(1,Math.ceil((hi-lo)/width)))\n:1;\nconst step=(hi-lo)/count;\nconst bins=[];\nfor(let i=0;i<count;i++){\nbins.push({from:lo+i*step,to:lo+(i+1)*step,count:0});\n}\nfor(let i=0;i<n;i++){\nconst at=Math.min(count-1,Math.max(0,Math.floor((sorted[i]-lo)/step)));\nbins[at].count++;\n}\nbins[0].from=min;\nbins[count-1].to=max;\nreturn bins;\n}\n});\n__def(\"packages/core/src/compute/total.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"TOTAL_FNS\",{enumerable:true,get:function(){return TOTAL_FNS;}});\nObject.defineProperty(__exports,\"TOTAL_LABELS\",{enumerable:true,get:function(){return TOTAL_LABELS;}});\nObject.defineProperty(__exports,\"totalLabel\",{enumerable:true,get:function(){return totalLabel;}});\nObject.defineProperty(__exports,\"collectValues\",{enumerable:true,get:function(){return collectValues;}});\nObject.defineProperty(__exports,\"total\",{enumerable:true,get:function(){return total;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst isFunction=__m0[\"isFunction\"];\nconst warnOnce=__m0[\"warnOnce\"];\nconst __m1=__req(\"packages/core/src/compute/handle.js\");\nconst presenceReader=__m1[\"presenceReader\"];\nconst valueComparator=__m1[\"valueComparator\"];\nconst valueReader=__m1[\"valueReader\"];\nconst __m2=__req(\"packages/core/src/compute/statistics.js\");\nconst STAT_FNS=__m2[\"STAT_FNS\"];\nconst STAT_LABELS=__m2[\"STAT_LABELS\"];\nfunction isNumericBacking(handle){\nreturn!!handle&&(handle.kind==='float64'||handle.kind==='int32');\n}\nfunction sum(handle,indices){\nconst n=indices.length;\nlet acc=0;\nif(isNumericBacking(handle)){\nconst values=handle.values;\nconst present=presenceReader(handle);\nif(!present){\nfor(let i=0;i<n;i++){\nconst v=values[indices[i]];\nif(!Number.isNaN(v))acc+=v;\n}\nreturn acc;\n}\nfor(let i=0;i<n;i++){\nconst row=indices[i];\nif(present(row)===1){\nconst v=values[row];\nif(!Number.isNaN(v))acc+=v;\n}\n}\nreturn acc;\n}\nconst read=valueReader(handle);\nfor(let i=0;i<n;i++){\nconst v=numberOf(read(indices[i]));\nif(v!==null)acc+=v;\n}\nreturn acc;\n}\nsum.kernel=true;\nfunction countValues(handle,indices){\nconst n=indices.length;\nlet count=0;\nif(isNumericBacking(handle)){\nconst values=handle.values;\nconst present=presenceReader(handle);\nif(!present){\nfor(let i=0;i<n;i++)if(!Number.isNaN(values[indices[i]]))count++;\nreturn count;\n}\nfor(let i=0;i<n;i++){\nconst row=indices[i];\nif(present(row)===1&&!Number.isNaN(values[row]))count++;\n}\nreturn count;\n}\nconst read=valueReader(handle);\nfor(let i=0;i<n;i++){\nconst v=read(indices[i]);\nif(v!==null&&v!==undefined&&!(typeof v==='number'&&Number.isNaN(v)))count++;\n}\nreturn count;\n}\ncountValues.kernel=true;\nfunction count(handle,indices){\nreturn indices.length;\n}\ncount.kernel=true;\nfunction avg(handle,indices){\nconst values=countValues(handle,indices);\nif(values===0)return null;\nreturn sum(handle,indices)/values;\n}\navg.kernel=true;\nfunction extreme(handle,indices,direction,locale){\nconst n=indices.length;\nif(isNumericBacking(handle)){\nconst values=handle.values;\nconst present=presenceReader(handle);\nlet best=null;\nif(!present){\nfor(let i=0;i<n;i++){\nconst v=values[indices[i]];\nif(Number.isNaN(v))continue;\nif(best===null||(direction<0?v<best:v>best))best=v;\n}\nreturn best;\n}\nfor(let i=0;i<n;i++){\nconst row=indices[i];\nif(present(row)===0)continue;\nconst v=values[row];\nif(Number.isNaN(v))continue;\nif(best===null||(direction<0?v<best:v>best))best=v;\n}\nreturn best;\n}\nconst read=valueReader(handle);\nconst cmp=valueComparator(locale);\nlet best=null;\nfor(let i=0;i<n;i++){\nconst v=read(indices[i]);\nif(v===null||v===undefined||(typeof v==='number'&&Number.isNaN(v)))continue;\nif(best===null||(direction<0?cmp(v,best)<0:cmp(v,best)>0))best=v;\n}\nreturn best;\n}\nfunction min(handle,indices,ctx){\nreturn extreme(handle,indices,-1,ctx&&ctx.locale);\n}\nmin.kernel=true;\nfunction max(handle,indices,ctx){\nreturn extreme(handle,indices,1,ctx&&ctx.locale);\n}\nmax.kernel=true;\nfunction first(handle,indices){\nif(indices.length===0)return null;\nreturn valueReader(handle)(indices[0]);\n}\nfirst.kernel=true;\nfunction last(handle,indices){\nif(indices.length===0)return null;\nreturn valueReader(handle)(indices[indices.length-1]);\n}\nlast.kernel=true;\nfunction numberOf(v){\nif(typeof v==='number')return Number.isNaN(v)?null:v;\nif(v===null||v===undefined||v===''||typeof v==='boolean')return null;\nif(v instanceof Date)return v.getTime();\nconst n=Number(v);\nreturn Number.isNaN(n)?null:n;\n}\nconst TOTAL_FNS={\nsum,min,max,avg,count,first,last,countValues,\n...STAT_FNS,\n};\nconst TOTAL_LABELS=Object.freeze({\n...STAT_LABELS,\nsum:'Sum',\navg:'Average',\nmin:'Min',\nmax:'Max',\ncount:'Count',\ncountValues:'Count of values',\nfirst:'First',\nlast:'Last',\n});\nfunction totalLabel(fn){\nif(!fn)return'';\nif(typeof fn==='string')return TOTAL_LABELS[fn]||fn;\nreturn'Total';\n}\nfunction collectValues(handle,indices){\nconst read=valueReader(handle);\nconst out=[];\nfor(let i=0;i<indices.length;i++){\nconst v=read(indices[i]);\nif(v===null||v===undefined)continue;\nout.push(v);\n}\nreturn out;\n}\nfunction total(handle,indices,fn,ctx){\nconst list=indices||[];\nif(typeof fn==='string'){\nconst kernel=TOTAL_FNS[fn];\nif(!kernel){\nwarnOnce(`total:${fn}`,`unknown total function \"${fn}\"; register it in config.totalFns`);\nreturn null;\n}\nreturn kernel(handle,list,ctx);\n}\nif(isFunction(fn)){\nif(fn.kernel===true)return fn(handle,list,ctx);\nreturn fn(collectValues(handle,list),ctx||{});\n}\nreturn null;\n}\n});\n__def(\"packages/core/src/compute/pivot.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"KEY_DELIMITER\",{enumerable:true,get:function(){return KEY_DELIMITER;}});\nObject.defineProperty(__exports,\"DEFAULT_PATH_SEPARATOR\",{enumerable:true,get:function(){return DEFAULT_PATH_SEPARATOR;}});\nObject.defineProperty(__exports,\"DEFAULT_MAX_COLUMNS\",{enumerable:true,get:function(){return DEFAULT_MAX_COLUMNS;}});\nObject.defineProperty(__exports,\"pivotKey\",{enumerable:true,get:function(){return pivotKey;}});\nObject.defineProperty(__exports,\"joinPath\",{enumerable:true,get:function(){return joinPath;}});\nObject.defineProperty(__exports,\"resolvePivotKeys\",{enumerable:true,get:function(){return resolvePivotKeys;}});\nObject.defineProperty(__exports,\"pivot\",{enumerable:true,get:function(){return pivot;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst warnOnce=__m0[\"warnOnce\"];\nconst __m1=__req(\"packages/core/src/compute/handle.js\");\nconst valueComparator=__m1[\"valueComparator\"];\nconst __m2=__req(\"packages/core/src/compute/group.js\");\nconst packKeys=__m2[\"packKeys\"];\nconst __m3=__req(\"packages/core/src/compute/total.js\");\nconst total=__m3[\"total\"];\nconst KEY_DELIMITER='|';\nconst DEFAULT_PATH_SEPARATOR='/';\nconst DEFAULT_MAX_COLUMNS=2000;\nfunction pivotKey(groupPath,pivotPath,colId){\nreturn`${groupPath}${KEY_DELIMITER}${pivotPath}${KEY_DELIMITER}${colId}`;\n}\nfunction joinPath(parts,separator){\nlet out='';\nfor(let i=0;i<parts.length;i++){\nconst v=parts[i];\nout+=(i===0?'':separator)+(v===null||v===undefined?'':String(v));\n}\nreturn out;\n}\nfunction resolvePivotKeys(handles,order,opts={}){\nconst separator=opts.separator||DEFAULT_PATH_SEPARATOR;\nconst n=order.length;\nconst{keyOf,readers}=packKeys(handles,order,0);\nconst seen=new Map();\nconst tuples=[];\nconst rawKeys=[];\nfor(let i=0;i<n;i++){\nconst row=order[i];\nconst key=keyOf(row);\nif(seen.has(key))continue;\nseen.set(key,tuples.length);\nrawKeys.push(key);\nconst tuple=new Array(readers.length);\nfor(let j=0;j<readers.length;j++)tuple[j]=readers[j](row);\ntuples.push(tuple);\n}\nconst cmp=valueComparator(opts.locale);\nconst rank=tuples.map((_,i)=>i);\nrank.sort((a,b)=>{\nconst ta=tuples[a];\nconst tb=tuples[b];\nfor(let j=0;j<ta.length;j++){\nconst c=compareNullable(ta[j],tb[j],cmp);\nif(c!==0)return c;\n}\nreturn a-b;\n});\nconst keys=new Array(rank.length);\nconst paths=new Array(rank.length);\nconst idByKey=new Map();\nfor(let position=0;position<rank.length;position++){\nconst from=rank[position];\nkeys[position]=tuples[from];\npaths[position]=joinPath(tuples[from],separator);\nidByKey.set(rawKeys[from],position);\n}\nconst idOf=(row)=>{\nconst id=idByKey.get(keyOf(row));\nreturn id===undefined?-1:id;\n};\nreturn{keys,paths,idOf};\n}\nfunction compareNullable(a,b,cmp){\nconst na=a===null||a===undefined;\nconst nb=b===null||b===undefined;\nif(na||nb)return na&&nb?0:na?1:-1;\nreturn cmp(a,b);\n}\nfunction resolveValueColumns(opts){\nconst declared=opts.values||opts.totals||[];\nif(declared.length&&typeof declared[0]==='object'&&declared[0]!==null){\nreturn declared.filter((entry)=>entry&&entry.handle);\n}\nconst resolve=typeof opts.handle==='function'?opts.handle:null;\nif(!resolve){\nif(declared.length){\nwarnOnce('pivot:handles',\n'pivot was given total column ids but no handle(colId) resolver, so no cell values were reduced. Pass values: [{ colId, handle, fn }] or opts.handle.');\n}\nreturn[];\n}\nconst totalOf=typeof opts.totalOf==='function'?opts.totalOf:null;\nconst out=[];\nfor(const colId of declared){\nconst handle=resolve(colId);\nif(!handle)continue;\nout.push({colId,handle,fn:totalOf?totalOf(colId):'sum'});\n}\nreturn out;\n}\nfunction normaliseArgs(a,b,c){\nif(Array.isArray(a)){\nconst opts=c||{};\nreturn{...opts,pivotHandles:a,order:b||null,groups:opts.groups||null};\n}\nreturn a||{};\n}\nfunction pivot(input,orderArg,optsArg){\nconst opts=normaliseArgs(input,orderArg,optsArg);\nconst separator=opts.separator||DEFAULT_PATH_SEPARATOR;\nconst valueColumns=resolveValueColumns(opts);\nconst maxColumns=opts.maxColumns===undefined?DEFAULT_MAX_COLUMNS:opts.maxColumns;\nconst groups=opts.groups&&opts.groups.buckets?opts.groups:null;\nconst buckets=groups?groups.buckets:[opts.order||new Uint32Array(0)];\nconst groupPaths=opts.groupPaths\n||(groups?groups.keys.map((tuple)=>joinPath(tuple,separator)):['']);\nconst scope=concatIndices(buckets);\nconst{keys,paths,idOf}=resolvePivotKeys(opts.pivotHandles||[],scope,opts);\nconst columns=paths.length*Math.max(1,valueColumns.length);\nconst fields=derivedFields(paths,valueColumns,separator);\nif(maxColumns&&columns>maxColumns){\nconst empty=new Map();\nreturn{\nkeys,\npaths,\nfields,\ngroupPaths,\ncolumns,\nvalues:empty,\ncells:empty,\nerror:{\ncode:'pivot-max-columns',\nmessage:`[lattice] pivot would generate ${columns} columns, above pivot.maxColumns of ${maxColumns}. Narrow the pivot columns or raise the limit.`,\ncolumns,\nmaxColumns,\n},\n};\n}\nconst cells=new Map();\nconst keyCount=paths.length;\nfor(let g=0;g<buckets.length;g++){\nconst bucket=buckets[g];\nconst groupPath=groupPaths[g]===undefined?'':groupPaths[g];\nconst n=bucket.length;\nif(n===0)continue;\nconst ids=new Int32Array(n);\nconst counts=new Uint32Array(keyCount+1);\nfor(let i=0;i<n;i++){\nconst id=idOf(bucket[i]);\nids[i]=id;\nif(id>=0)counts[id+1]++;\n}\nfor(let k=0;k<keyCount;k++)counts[k+1]+=counts[k];\nconst scattered=new Uint32Array(n);\nconst cursor=counts.slice(0,keyCount);\nfor(let i=0;i<n;i++){\nconst id=ids[i];\nif(id>=0)scattered[cursor[id]++]=bucket[i];\n}\nfor(let k=0;k<keyCount;k++){\nconst from=counts[k];\nconst to=counts[k+1];\nif(to===from)continue;\nconst slice=scattered.subarray(from,to);\nfor(let c=0;c<valueColumns.length;c++){\nconst column=valueColumns[c];\nconst result=total(column.handle,slice,column.fn,opts.totalContext||{locale:opts.locale});\ncells.set(pivotKey(groupPath,paths[k],column.colId),result);\n}\n}\n}\nreturn{keys,paths,fields,groupPaths,columns,values:cells,cells,error:null};\n}\nfunction derivedFields(paths,valueColumns,separator){\nif(valueColumns.length===0)return paths.slice();\nconst out=[];\nfor(const path of paths){\nfor(const column of valueColumns)out.push(`${path}${separator}${column.colId}`);\n}\nreturn out;\n}\nfunction concatIndices(buckets){\nif(buckets.length===1)return buckets[0]||new Uint32Array(0);\nlet n=0;\nfor(const b of buckets)n+=b?b.length:0;\nconst out=new Uint32Array(n);\nlet at=0;\nfor(const b of buckets){\nif(!b||b.length===0)continue;\nout.set(b,at);\nat+=b.length;\n}\nreturn out;\n}\n});\n__def(\"packages/core/src/compute/reference.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"referenceValue\",{enumerable:true,get:function(){return referenceValue;}});\nObject.defineProperty(__exports,\"referenceSort\",{enumerable:true,get:function(){return referenceSort;}});\nObject.defineProperty(__exports,\"referenceFilter\",{enumerable:true,get:function(){return referenceFilter;}});\nObject.defineProperty(__exports,\"referencePasses\",{enumerable:true,get:function(){return referencePasses;}});\nObject.defineProperty(__exports,\"referenceGroup\",{enumerable:true,get:function(){return referenceGroup;}});\nObject.defineProperty(__exports,\"referenceTotal\",{enumerable:true,get:function(){return referenceTotal;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst getPath=__m0[\"getPath\"];\nconst __m1=__req(\"packages/core/src/compute/handle.js\");\nconst isMissing=__m1[\"isMissing\"];\nconst valueComparator=__m1[\"valueComparator\"];\nconst __m2=__req(\"packages/core/src/compute/filter.js\");\nconst testValue=__m2[\"testValue\"];\nconst KEY_SEPARATOR=String.fromCharCode(0x1f);\nconst NULL_MARKER=String.fromCharCode(0x00);\nfunction referenceValue(row,col){\nconst v=col.includes('.')?getPath(row,col):(row==null?undefined:row[col]);\nreturn v===undefined?null:v;\n}\nfunction referenceSort(rows,entries,opts={}){\nconst list=entries||[];\nlet order=rows.map((_,i)=>i);\nif(list.length===0)return order;\nfor(let e=list.length-1;e>=0;e--){\norder=referenceSortOne(rows,order,list[e],opts);\n}\nreturn order;\n}\nfunction referenceSortOne(rows,order,entry,opts){\nconst locale=entry.locale!==undefined?entry.locale:opts.locale;\nconst base=valueComparator(locale);\nconst descending=entry.descending!==undefined?!!entry.descending:entry.dir==='desc';\nconst present=[];\nconst absent=[];\nfor(const i of order){\nconst v=referenceValue(rows[i],entry.col);\nif(isMissing(v))absent.push(i);else present.push(i);\n}\nconst position=new Map();\nfor(let p=0;p<present.length;p++)position.set(present[p],p);\nconst compare=(a,b)=>{\nconst va=referenceValue(rows[a],entry.col);\nconst vb=referenceValue(rows[b],entry.col);\nlet c;\nif(typeof entry.compare==='function'){\nc=entry.compare(va,vb,rows[a],rows[b],descending);\nif(descending)c=-c;\n}else{\nc=descending?base(vb,va):base(va,vb);\n}\nreturn c!==0?c:position.get(a)-position.get(b);\n};\npresent.sort(compare);\nreturn entry.nullsFirst?absent.concat(present):present.concat(absent);\n}\nfunction referenceFilter(rows,filters,opts={}){\nconst out=[];\nfor(let i=0;i<rows.length;i++){\nif(referencePasses(rows[i],filters,opts,i))out.push(i);\n}\nreturn out;\n}\nfunction referencePasses(row,node,opts,index){\nif(!node)return true;\nif(Array.isArray(node.conditions)){\nconst children=node.conditions.filter((c)=>c!=null);\nif(children.length===0)return true;\nif(node.op==='or')return children.some((c)=>referencePasses(row,c,opts,index));\nconst all=children.every((c)=>referencePasses(row,c,opts,index));\nreturn node.op==='not'?!all:all;\n}\nif(node.col===undefined&&typeof opts.custom==='function')return!!opts.custom(node,row,index);\nreturn testValue(referenceValue(row,node.col),node,opts.locale);\n}\nfunction referenceGroup(rows,cols,order){\nconst source=order||rows.map((_,i)=>i);\nconst seen=new Map();\nconst keys=[];\nconst buckets=[];\nfor(const i of source){\nconst tuple=cols.map((col)=>referenceValue(rows[i],col));\nconst key=tuple\n.map((v)=>(v===null||v===undefined?NULL_MARKER:String(v)))\n.join(KEY_SEPARATOR);\nlet at=seen.get(key);\nif(at===undefined){\nat=keys.length;\nseen.set(key,at);\nkeys.push(tuple);\nbuckets.push([]);\n}\nbuckets[at].push(i);\n}\nreturn{keys,buckets};\n}\nfunction referenceTotal(values,fn,opts={}){\nconst cmp=valueComparator(opts.locale);\nconst live=values.filter((v)=>!isMissing(v));\nconst numbers=live.map(toNumberOrNull).filter((v)=>v!==null);\nswitch(fn){\ncase'count':return values.length;\ncase'countValues':return live.length;\ncase'sum':return numbers.reduce((a,b)=>a+b,0);\ncase'avg':return live.length===0?null:numbers.reduce((a,b)=>a+b,0)/live.length;\ncase'min':return live.length===0?null:live.reduce((a,b)=>(cmp(b,a)<0?b:a));\ncase'max':return live.length===0?null:live.reduce((a,b)=>(cmp(b,a)>0?b:a));\ncase'first':return values.length===0?null:normaliseNull(values[0]);\ncase'last':return values.length===0?null:normaliseNull(values[values.length-1]);\ndefault:return null;\n}\n}\nfunction toNumberOrNull(v){\nif(typeof v==='number')return Number.isNaN(v)?null:v;\nif(v===null||v===undefined||v===''||typeof v==='boolean')return null;\nif(v instanceof Date)return v.getTime();\nconst n=Number(v);\nreturn Number.isNaN(n)?null:n;\n}\nfunction normaliseNull(v){\nreturn v===undefined?null:v;\n}\n});\n__def(\"packages/core/src/compute/index.js\",function(__exports,__req){\n'use strict';\nconst __m0=__req(\"packages/core/src/compute/sort.js\");\nObject.defineProperty(__exports,\"sortColumn\",{enumerable:true,get:function(){return __m0[\"sortColumn\"];}});\nObject.defineProperty(__exports,\"sortMulti\",{enumerable:true,get:function(){return __m0[\"sortMulti\"];}});\nObject.defineProperty(__exports,\"radixSortFloat64\",{enumerable:true,get:function(){return __m0[\"radixSortFloat64\"];}});\nObject.defineProperty(__exports,\"radixSortInt32\",{enumerable:true,get:function(){return __m0[\"radixSortInt32\"];}});\nObject.defineProperty(__exports,\"rankSortDictionary\",{enumerable:true,get:function(){return __m0[\"rankSortDictionary\"];}});\nObject.defineProperty(__exports,\"mergeSortComparator\",{enumerable:true,get:function(){return __m0[\"mergeSortComparator\"];}});\nconst __m1=__req(\"packages/core/src/compute/filter.js\");\nObject.defineProperty(__exports,\"evaluateFilters\",{enumerable:true,get:function(){return __m1[\"evaluateFilters\"];}});\nObject.defineProperty(__exports,\"evaluateCondition\",{enumerable:true,get:function(){return __m1[\"evaluateCondition\"];}});\nObject.defineProperty(__exports,\"compact\",{enumerable:true,get:function(){return __m1[\"compact\"];}});\nObject.defineProperty(__exports,\"testValue\",{enumerable:true,get:function(){return __m1[\"testValue\"];}});\nObject.defineProperty(__exports,\"compilePredicate\",{enumerable:true,get:function(){return __m1[\"compilePredicate\"];}});\nObject.defineProperty(__exports,\"releaseMask\",{enumerable:true,get:function(){return __m1[\"releaseMask\"];}});\nObject.defineProperty(__exports,\"pruneColumn\",{enumerable:true,get:function(){return __m1[\"pruneColumn\"];}});\nObject.defineProperty(__exports,\"mentionsColumn\",{enumerable:true,get:function(){return __m1[\"mentionsColumn\"];}});\nconst __m2=__req(\"packages/core/src/compute/group.js\");\nObject.defineProperty(__exports,\"groupByColumns\",{enumerable:true,get:function(){return __m2[\"groupByColumns\"];}});\nObject.defineProperty(__exports,\"packKeys\",{enumerable:true,get:function(){return __m2[\"packKeys\"];}});\nconst __m3=__req(\"packages/core/src/compute/facet.js\");\nObject.defineProperty(__exports,\"facet\",{enumerable:true,get:function(){return __m3[\"facet\"];}});\nObject.defineProperty(__exports,\"computeBounds\",{enumerable:true,get:function(){return __m3[\"computeBounds\"];}});\nObject.defineProperty(__exports,\"countInto\",{enumerable:true,get:function(){return __m3[\"countInto\"];}});\nObject.defineProperty(__exports,\"bucketOf\",{enumerable:true,get:function(){return __m3[\"bucketOf\"];}});\nObject.defineProperty(__exports,\"facetKind\",{enumerable:true,get:function(){return __m3[\"facetKind\"];}});\nObject.defineProperty(__exports,\"cardinalityOf\",{enumerable:true,get:function(){return __m3[\"cardinalityOf\"];}});\nObject.defineProperty(__exports,\"pickGranularity\",{enumerable:true,get:function(){return __m3[\"pickGranularity\"];}});\nObject.defineProperty(__exports,\"floorTo\",{enumerable:true,get:function(){return __m3[\"floorTo\"];}});\nObject.defineProperty(__exports,\"advance\",{enumerable:true,get:function(){return __m3[\"advance\"];}});\nObject.defineProperty(__exports,\"STRATEGIES\",{enumerable:true,get:function(){return __m3[\"STRATEGIES\"];}});\nObject.defineProperty(__exports,\"GRANULARITIES\",{enumerable:true,get:function(){return __m3[\"GRANULARITIES\"];}});\nObject.defineProperty(__exports,\"DEFAULT_BUCKETS\",{enumerable:true,get:function(){return __m3[\"DEFAULT_BUCKETS\"];}});\nObject.defineProperty(__exports,\"DEFAULT_CARDINALITY_LIMIT\",{enumerable:true,get:function(){return __m3[\"DEFAULT_CARDINALITY_LIMIT\"];}});\nObject.defineProperty(__exports,\"QUANTILE_SAMPLE\",{enumerable:true,get:function(){return __m3[\"QUANTILE_SAMPLE\"];}});\nconst __m4=__req(\"packages/core/src/compute/total.js\");\nObject.defineProperty(__exports,\"TOTAL_FNS\",{enumerable:true,get:function(){return __m4[\"TOTAL_FNS\"];}});\nObject.defineProperty(__exports,\"TOTAL_LABELS\",{enumerable:true,get:function(){return __m4[\"TOTAL_LABELS\"];}});\nObject.defineProperty(__exports,\"totalLabel\",{enumerable:true,get:function(){return __m4[\"totalLabel\"];}});\nObject.defineProperty(__exports,\"total\",{enumerable:true,get:function(){return __m4[\"total\"];}});\nObject.defineProperty(__exports,\"collectValues\",{enumerable:true,get:function(){return __m4[\"collectValues\"];}});\nconst __m5=__req(\"packages/core/src/compute/pivot.js\");\nObject.defineProperty(__exports,\"pivot\",{enumerable:true,get:function(){return __m5[\"pivot\"];}});\nObject.defineProperty(__exports,\"resolvePivotKeys\",{enumerable:true,get:function(){return __m5[\"resolvePivotKeys\"];}});\nObject.defineProperty(__exports,\"pivotKey\",{enumerable:true,get:function(){return __m5[\"pivotKey\"];}});\nObject.defineProperty(__exports,\"joinPath\",{enumerable:true,get:function(){return __m5[\"joinPath\"];}});\nObject.defineProperty(__exports,\"KEY_DELIMITER\",{enumerable:true,get:function(){return __m5[\"KEY_DELIMITER\"];}});\nObject.defineProperty(__exports,\"DEFAULT_PATH_SEPARATOR\",{enumerable:true,get:function(){return __m5[\"DEFAULT_PATH_SEPARATOR\"];}});\nObject.defineProperty(__exports,\"DEFAULT_MAX_COLUMNS\",{enumerable:true,get:function(){return __m5[\"DEFAULT_MAX_COLUMNS\"];}});\nconst __m6=__req(\"packages/core/src/compute/reference.js\");\nObject.defineProperty(__exports,\"referenceSort\",{enumerable:true,get:function(){return __m6[\"referenceSort\"];}});\nObject.defineProperty(__exports,\"referenceFilter\",{enumerable:true,get:function(){return __m6[\"referenceFilter\"];}});\nObject.defineProperty(__exports,\"referenceGroup\",{enumerable:true,get:function(){return __m6[\"referenceGroup\"];}});\nObject.defineProperty(__exports,\"referenceTotal\",{enumerable:true,get:function(){return __m6[\"referenceTotal\"];}});\nObject.defineProperty(__exports,\"referencePasses\",{enumerable:true,get:function(){return __m6[\"referencePasses\"];}});\nObject.defineProperty(__exports,\"referenceValue\",{enumerable:true,get:function(){return __m6[\"referenceValue\"];}});\nconst __m7=__req(\"packages/core/src/compute/handle.js\");\nObject.defineProperty(__exports,\"identity\",{enumerable:true,get:function(){return __m7[\"identity\"];}});\nObject.defineProperty(__exports,\"rowCount\",{enumerable:true,get:function(){return __m7[\"rowCount\"];}});\nObject.defineProperty(__exports,\"presenceReader\",{enumerable:true,get:function(){return __m7[\"presenceReader\"];}});\nObject.defineProperty(__exports,\"bitReader\",{enumerable:true,get:function(){return __m7[\"bitReader\"];}});\nObject.defineProperty(__exports,\"valueReader\",{enumerable:true,get:function(){return __m7[\"valueReader\"];}});\nObject.defineProperty(__exports,\"valueComparator\",{enumerable:true,get:function(){return __m7[\"valueComparator\"];}});\nObject.defineProperty(__exports,\"numericTotalOrder\",{enumerable:true,get:function(){return __m7[\"numericTotalOrder\"];}});\nObject.defineProperty(__exports,\"dictRanks\",{enumerable:true,get:function(){return __m7[\"dictRanks\"];}});\nObject.defineProperty(__exports,\"dictSize\",{enumerable:true,get:function(){return __m7[\"dictSize\"];}});\nObject.defineProperty(__exports,\"dictValue\",{enumerable:true,get:function(){return __m7[\"dictValue\"];}});\nObject.defineProperty(__exports,\"multiValue\",{enumerable:true,get:function(){return __m7[\"multiValue\"];}});\nObject.defineProperty(__exports,\"isMissing\",{enumerable:true,get:function(){return __m7[\"isMissing\"];}});\n});\n__def(\"packages/worker/src/kernel.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"loadCompute\",{enumerable:true,get:function(){return loadCompute;}});\nObject.defineProperty(__exports,\"setCompute\",{enumerable:true,get:function(){return setCompute;}});\nObject.defineProperty(__exports,\"dispatch\",{enumerable:true,get:function(){return dispatch;}});\nObject.defineProperty(__exports,\"handleMessage\",{enumerable:true,get:function(){return handleMessage;}});\nObject.defineProperty(__exports,\"installKernel\",{enumerable:true,get:function(){return installKernel;}});\nconst __m0=__req(\"packages/worker/src/transport.js\");\nconst PROTOCOL=__m0[\"PROTOCOL\"];\nconst OPS=__m0[\"OPS\"];\nconst CONTROL=__m0[\"CONTROL\"];\nconst ERRORS=__m0[\"ERRORS\"];\nconst unpackHandle=__m0[\"unpackHandle\"];\nconst unpackHandles=__m0[\"unpackHandles\"];\nconst createMaskPool=__m0[\"createMaskPool\"];\nconst collectTransfers=__m0[\"collectTransfers\"];\nlet computeModule=null;\nlet computePromise=null;\nlet computeError=null;\nasync function loadCompute(loader){\nif(computeModule)return computeModule;\nif(!computePromise){\nconst load=loader||(()=>Promise.resolve(__req(\"packages/core/src/compute/index.js\")));\ncomputePromise=Promise.resolve()\n.then(load)\n.then((mod)=>{computeModule=mod;return mod;})\n.catch((err)=>{\ncomputeError=err;\ncomputeModule=null;\nreturn null;\n});\n}\nreturn computePromise;\n}\nfunction setCompute(mod){\ncomputeModule=mod;\ncomputePromise=mod?Promise.resolve(mod):null;\ncomputeError=mod?null:computeError;\n}\nfunction filterContext(handles,count,locale){\nconst byId=new Map();\nfor(const h of handles)if(h)byId.set(h.id,h);\nreturn{\nhandle(colId){return byId.get(colId);},\ncount,\npool:createMaskPool(),\nlocale,\n};\n}\nfunction dispatch(request,compute){\nconst{op,args}=request;\nconst fn=compute[op];\nif(typeof fn!=='function'){\nconst err=new Error(`[lattice] compute kernel '${op}' is not exported`);\n(err).code=ERRORS.NO_KERNEL;\nthrow err;\n}\nswitch(op){\ncase OPS.SORT_COLUMN:\nreturn fn(unpackHandle(args.handle),args.order??null,args.opts||{});\ncase OPS.SORT_MULTI:{\nconst handles=unpackHandles(args.handles||[]);\nconst entries=(args.entries||[]).map((e)=>({\n...e,\nhandle:handles[e.index],\n}));\nreturn fn(handles,entries,args.order??null);\n}\ncase OPS.EVALUATE_FILTERS:\nreturn fn(args.filters,filterContext(unpackHandles(args.handles||[]),args.count,args.locale));\ncase OPS.COMPACT:\nreturn fn(args.mask,args.count,undefined);\ncase OPS.GROUP_BY_COLUMNS:\nreturn fn(unpackHandles(args.handles||[]),args.order??null,args.opts||{});\ncase OPS.TOTAL:\nreturn fn(unpackHandle(args.handle),args.indices??null,args.fn);\ncase OPS.PIVOT:\nreturn fn(unpackHandles(args.handles||[]),args.order??null,args.opts||{});\ncase OPS.FACET:\nreturn fn(unpackHandle(args.handle),args.indices??null,args.count,args.opts||{});\ndefault:{\nconst err=new Error(`[lattice] unknown worker op '${op}'`);\n(err).code=ERRORS.PROTOCOL;\nthrow err;\n}\n}\n}\nasync function handleMessage(message,opts={}){\nif(!message||message.lattice!==PROTOCOL)return null;\nconst{id,op}=message;\nif(op===CONTROL.CANCEL){\nopts.cancelled?.add(message.target);\nreturn null;\n}\nif(op===CONTROL.PING){\nreturn{reply:{lattice:PROTOCOL,id,ok:true,result:'pong'},transfer:[]};\n}\nconst compute=await loadCompute(opts.loader);\nif(!compute){\nreturn{\nreply:{\nlattice:PROTOCOL,\nid,\nok:false,\nerror:{\ncode:ERRORS.NO_COMPUTE,\nmessage:`[lattice] compute kernels unavailable in worker: ${computeError?computeError.message:'module not found'}`,\n},\n},\ntransfer:[],\n};\n}\nif(opts.cancelled?.has(id)){\nopts.cancelled.delete(id);\nreturn{reply:{lattice:PROTOCOL,id,ok:false,error:{code:ERRORS.ABORTED,message:'[lattice] request superseded'}},transfer:[]};\n}\ntry{\nconst result=dispatch(message,compute);\nif(opts.cancelled?.has(id)){\nopts.cancelled.delete(id);\nreturn{reply:{lattice:PROTOCOL,id,ok:false,error:{code:ERRORS.ABORTED,message:'[lattice] request superseded'}},transfer:[]};\n}\nreturn{reply:{lattice:PROTOCOL,id,ok:true,result},transfer:collectTransfers(result)};\n}catch(err){\nconst e=(err);\nreturn{\nreply:{\nlattice:PROTOCOL,\nid,\nok:false,\nerror:{code:e.code||ERRORS.KERNEL,message:e.message||String(err),stack:e.stack},\n},\ntransfer:[],\n};\n}\n}\nfunction installKernel(scope,opts={}){\nconst cancelled=new Set();\nconst onMessage=async(event)=>{\nconst outcome=await handleMessage(event.data,{loader:opts.loader,cancelled});\nif(!outcome)return;\nscope.postMessage(outcome.reply,outcome.transfer);\n};\nscope.addEventListener('message',onMessage);\nloadCompute(opts.loader).then((mod)=>{\nscope.postMessage({lattice:PROTOCOL,id:0,op:CONTROL.READY,compute:!!mod});\n});\nreturn()=>scope.removeEventListener('message',onMessage);\n}\n});\nvar __entry=__req(\"packages/worker/src/kernel.js\");\nroot[\"__latticeKernel\"]=__entry;\n})(typeof globalThis!=='undefined'?globalThis:this);\n__latticeKernel.installKernel(self);\n",{type:'classic'});
+__req("packages/worker/src/inline.js").setWorkerSource("(function(root){\n'use strict';\nvar __mods=Object.create(null);\nvar __cache=Object.create(null);\nfunction __def(id,fn){__mods[id]=fn;}\nfunction __req(id){\nvar hit=__cache[id];\nif(hit)return hit;\nvar exports=Object.create(null);\n__cache[id]=exports;\nvar fn=__mods[id];\nif(!fn)throw new Error('[lattice] missing module: '+id);\nfn(exports,__req);\nreturn exports;\n}\n__def(\"packages/core/src/internal/util.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"VERSION\",{enumerable:true,get:function(){return VERSION;}});\nObject.defineProperty(__exports,\"reportedWarnings\",{enumerable:true,get:function(){return reportedWarnings;}});\nObject.defineProperty(__exports,\"warnOnce\",{enumerable:true,get:function(){return warnOnce;}});\nObject.defineProperty(__exports,\"infoOnce\",{enumerable:true,get:function(){return infoOnce;}});\nObject.defineProperty(__exports,\"resetWarnings\",{enumerable:true,get:function(){return resetWarnings;}});\nObject.defineProperty(__exports,\"fail\",{enumerable:true,get:function(){return fail;}});\nObject.defineProperty(__exports,\"invariant\",{enumerable:true,get:function(){return invariant;}});\nObject.defineProperty(__exports,\"DEV\",{enumerable:true,get:function(){return DEV;}});\nObject.defineProperty(__exports,\"isObject\",{enumerable:true,get:function(){return isObject;}});\nObject.defineProperty(__exports,\"isFunction\",{enumerable:true,get:function(){return isFunction;}});\nObject.defineProperty(__exports,\"isNil\",{enumerable:true,get:function(){return isNil;}});\nObject.defineProperty(__exports,\"isBlank\",{enumerable:true,get:function(){return isBlank;}});\nObject.defineProperty(__exports,\"isCtor\",{enumerable:true,get:function(){return isCtor;}});\nObject.defineProperty(__exports,\"pathGetter\",{enumerable:true,get:function(){return pathGetter;}});\nObject.defineProperty(__exports,\"pathSetter\",{enumerable:true,get:function(){return pathSetter;}});\nObject.defineProperty(__exports,\"getPath\",{enumerable:true,get:function(){return getPath;}});\nObject.defineProperty(__exports,\"setPath\",{enumerable:true,get:function(){return setPath;}});\nObject.defineProperty(__exports,\"humanise\",{enumerable:true,get:function(){return humanise;}});\nObject.defineProperty(__exports,\"escapeHtml\",{enumerable:true,get:function(){return escapeHtml;}});\nObject.defineProperty(__exports,\"titleCase\",{enumerable:true,get:function(){return titleCase;}});\nObject.defineProperty(__exports,\"expand\",{enumerable:true,get:function(){return expand;}});\nObject.defineProperty(__exports,\"toArray\",{enumerable:true,get:function(){return toArray;}});\nObject.defineProperty(__exports,\"merge\",{enumerable:true,get:function(){return merge;}});\nObject.defineProperty(__exports,\"mergeRow\",{enumerable:true,get:function(){return mergeRow;}});\nObject.defineProperty(__exports,\"Lru\",{enumerable:true,get:function(){return Lru;}});\nObject.defineProperty(__exports,\"collator\",{enumerable:true,get:function(){return collator;}});\nObject.defineProperty(__exports,\"defaultCompare\",{enumerable:true,get:function(){return defaultCompare;}});\nObject.defineProperty(__exports,\"now\",{enumerable:true,get:function(){return now;}});\nObject.defineProperty(__exports,\"nextFrame\",{enumerable:true,get:function(){return nextFrame;}});\nObject.defineProperty(__exports,\"cancelFrame\",{enumerable:true,get:function(){return cancelFrame;}});\nObject.defineProperty(__exports,\"frameBatched\",{enumerable:true,get:function(){return frameBatched;}});\nObject.defineProperty(__exports,\"whenIdle\",{enumerable:true,get:function(){return whenIdle;}});\nObject.defineProperty(__exports,\"uid\",{enumerable:true,get:function(){return uid;}});\nconst VERSION='1.9.0';\nconst warned=new Set();\nconst reported=[];\nconst REPORT_LIMIT=500;\nfunction record(key,level,message){\nreported.push({\nkey,\nlevel,\nmessage:message.map((m)=>(typeof m==='string'?m:safeString(m))).join(' '),\nat:Date.now(),\n});\nif(reported.length>REPORT_LIMIT)reported.shift();\n}\nfunction safeString(value){\nif(value instanceof Error)return value.message;\ntry{return JSON.stringify(value);}catch{return String(value);}\n}\nfunction reportedWarnings(){return reported.map((r)=>({...r}));}\nfunction warnOnce(key,...message){\nif(warned.has(key))return;\nwarned.add(key);\nrecord(key,'warn',message);\nconsole.warn('[lattice]',...message);\n}\nfunction infoOnce(key,...message){\nif(warned.has(key))return;\nwarned.add(key);\nrecord(key,'info',message);\nconsole.info('[lattice]',...message);\n}\nfunction resetWarnings(){\nwarned.clear();\nreported.length=0;\n}\nfunction fail(message,extra){\nconst err=new Error(`[lattice] ${message}`);\nif(extra!==undefined)err.cause=extra;\nthrow err;\n}\nfunction invariant(condition,message){\nif(!condition)fail(message);\n}\nconst DEV=(()=>{\ntry{\nreturn!(typeof process!=='undefined'&&process.env\n&&process.env.NODE_ENV==='production');\n}catch{\nreturn true;\n}\n})();\nfunction isObject(v){\nreturn v!==null&&typeof v==='object'&&!Array.isArray(v);\n}\nfunction isFunction(v){\nreturn typeof v==='function';\n}\nfunction isNil(v){\nreturn v===null||v===undefined;\n}\nfunction isBlank(v){\nreturn v===null||v===undefined||v==='';\n}\nfunction isCtor(v){\nif(typeof v!=='function')return false;\nif(/^class[\\s{]/.test(Function.prototype.toString.call(v)))return true;\nreturn!!(v.prototype&&Object.getOwnPropertyNames(v.prototype).length>1);\n}\nconst pathCache=new Map();\nfunction pathGetter(path){\nlet fn=pathCache.get(path);\nif(fn)return fn;\nif(!path.includes('.')){\nfn=(o)=>(o==null?undefined:o[path]);\n}else{\nconst parts=path.split('.');\nconst n=parts.length;\nfn=(o)=>{\nlet cur=o;\nfor(let i=0;i<n;i++){\nif(cur==null)return undefined;\ncur=cur[parts[i]];\n}\nreturn cur;\n};\n}\npathCache.set(path,fn);\nreturn fn;\n}\nconst setterCache=new Map();\nfunction pathSetter(path){\nlet fn=setterCache.get(path);\nif(fn)return fn;\nif(!path.includes('.')){\nfn=(o,v)=>{if(o!=null)o[path]=v;};\n}else{\nconst parts=path.split('.');\nconst last=parts.length-1;\nfn=(o,v)=>{\nlet cur=o;\nfor(let i=0;i<last;i++){\nif(cur==null)return;\nconst k=parts[i];\nif(cur[k]==null)cur[k]={};\ncur=cur[k];\n}\nif(cur!=null)cur[parts[last]]=v;\n};\n}\nsetterCache.set(path,fn);\nreturn fn;\n}\nfunction getPath(obj,path){\nreturn pathGetter(path)(obj);\n}\nfunction setPath(obj,path,value){\npathSetter(path)(obj,value);\n}\nfunction humanise(field){\nif(!field)return'';\nconst leaf=field.includes('.')?field.slice(field.lastIndexOf('.')+1):field;\nreturn leaf\n.replace(/[_-]+/g,' ')\n.replace(/([a-z0-9])([A-Z])/g,'$1 $2')\n.replace(/([A-Z]+)([A-Z][a-z])/g,'$1 $2')\n.replace(/\\s+/g,' ')\n.trim()\n.replace(/^./,(c)=>c.toUpperCase());\n}\nconst ESCAPES={'&':'&amp;','<':'&lt;','>':'&gt;','\"':'&quot;',\"'\":'&#39;'};\nfunction escapeHtml(s){\nconst str=s==null?'':String(s);\nreturn/[&<>\"']/.test(str)?str.replace(/[&<>\"']/g,(c)=>ESCAPES[c]):str;\n}\nfunction titleCase(s){\nreturn String(s).replace(/\\w\\S*/g,(t)=>t[0].toUpperCase()+t.slice(1).toLowerCase());\n}\nfunction expand(value,key,whenTrue){\nif(value===undefined)return undefined;\nif(value===true)return{enabled:true,...whenTrue};\nif(value===false)return{enabled:false};\nif(isObject(value))return value;\nreturn{[key]:value,enabled:true};\n}\nfunction toArray(v){\nif(v===undefined||v===null)return[];\nreturn Array.isArray(v)?v:[v];\n}\nfunction merge(a,b){\nif(!isObject(a))return isObject(b)?{...b}:b;\nif(!isObject(b))return b===undefined?a:b;\nconst out={...a};\nfor(const k of Object.keys(b)){\nconst bv=b[k];\nif(bv===undefined)continue;\nout[k]=isObject(bv)&&isObject(out[k])?merge(out[k],bv):bv;\n}\nreturn out;\n}\nfunction mergeRow(previous,patch){\nif(!isObject(previous)||!isObject(patch)||previous===patch)return patch;\nconst out=Object.create(Object.getPrototypeOf(previous));\nObject.assign(out,previous,patch);\nreturn out;\n}\nclass Lru{\n#max;\n#map=new Map();\n#onEvict;\nconstructor(max=256,onEvict=null){\nthis.#max=max;\nthis.#onEvict=onEvict;\n}\nget size(){\nreturn this.#map.size;\n}\nget max(){\nreturn this.#max;\n}\nset max(v){\nthis.#max=v;\nthis.#trim();\n}\nhas(k){\nreturn this.#map.has(k);\n}\nget(k){\nconst m=this.#map;\nif(!m.has(k))return undefined;\nconst v=m.get(k);\nm.delete(k);\nm.set(k,v);\nreturn v;\n}\npeek(k){\nreturn this.#map.get(k);\n}\nset(k,v){\nconst m=this.#map;\nif(m.has(k))m.delete(k);\nm.set(k,v);\nthis.#trim();\nreturn v;\n}\ndelete(k){\nconst v=this.#map.get(k);\nif(this.#map.delete(k)&&this.#onEvict)this.#onEvict(v,k);\nreturn v;\n}\nclear(){\nif(this.#onEvict)for(const[k,v]of this.#map)this.#onEvict(v,k);\nthis.#map.clear();\n}\nkeys(){\nreturn this.#map.keys();\n}\nvalues(){\nreturn this.#map.values();\n}\n#trim(){\nconst m=this.#map;\nwhile(m.size>this.#max){\nconst oldest=m.keys().next().value;\nconst v=m.get(oldest);\nm.delete(oldest);\nif(this.#onEvict)this.#onEvict(v,oldest);\n}\n}\n}\nconst collators=new Map();\nfunction collator(locale,opts){\nconst key=`${locale||''}|${opts?JSON.stringify(opts):''}`;\nlet c=collators.get(key);\nif(!c){\nc=new Intl.Collator(locale||undefined,{\nnumeric:true,sensitivity:'variant',...opts,\n});\ncollators.set(key,c);\n}\nreturn c;\n}\nfunction defaultCompare(a,b){\nif(a===b)return 0;\nif(a===null||a===undefined)return 1;\nif(b===null||b===undefined)return-1;\nif(typeof a==='number'&&typeof b==='number'){\nif(Number.isNaN(a))return Number.isNaN(b)?0:1;\nif(Number.isNaN(b))return-1;\nreturn a<b?-1:a>b?1:0;\n}\nconst sa=String(a);\nconst sb=String(b);\nreturn sa<sb?-1:sa>sb?1:0;\n}\nfunction now(){\nreturn typeof performance!=='undefined'&&performance.now\n?performance.now()\n:Date.now();\n}\nconst hasRaf=typeof requestAnimationFrame==='function';\nfunction nextFrame(fn){\nif(hasRaf)return requestAnimationFrame(fn);\nreturn setTimeout(()=>fn(now()),16);\n}\nfunction cancelFrame(handle){\nif(handle==null)return;\nif(hasRaf)cancelAnimationFrame(handle);\nelse clearTimeout(handle);\n}\nfunction frameBatched(fn){\nlet handle=null;\nlet lastArgs=null;\nconst run=()=>{\nhandle=null;\nconst a=lastArgs;\nlastArgs=null;\nfn(...(a||[]));\n};\nconst wrapped=(...args)=>{\nlastArgs=args;\nif(handle===null)handle=nextFrame(run);\n};\nwrapped.cancel=()=>{\ncancelFrame(handle);\nhandle=null;\nlastArgs=null;\n};\nwrapped.flush=()=>{\nif(handle!==null){\ncancelFrame(handle);\nrun();\n}\n};\nreturn wrapped;\n}\nfunction whenIdle(fn,timeout=50){\nif(typeof requestIdleCallback==='function'){\nreturn requestIdleCallback(fn,{timeout});\n}\nreturn setTimeout(()=>fn({timeRemaining:()=>0,didTimeout:true}),1);\n}\nlet idSeq=0;\nfunction uid(prefix='l'){\nreturn`${prefix}${(++idSeq).toString(36)}`;\n}\n});\n__def(\"packages/worker/src/transport.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"PROTOCOL\",{enumerable:true,get:function(){return PROTOCOL;}});\nObject.defineProperty(__exports,\"OPS\",{enumerable:true,get:function(){return OPS;}});\nObject.defineProperty(__exports,\"CONTROL\",{enumerable:true,get:function(){return CONTROL;}});\nObject.defineProperty(__exports,\"ERRORS\",{enumerable:true,get:function(){return ERRORS;}});\nObject.defineProperty(__exports,\"packHandle\",{enumerable:true,get:function(){return packHandle;}});\nObject.defineProperty(__exports,\"packHandles\",{enumerable:true,get:function(){return packHandles;}});\nObject.defineProperty(__exports,\"TransportedDictionary\",{enumerable:true,get:function(){return TransportedDictionary;}});\nObject.defineProperty(__exports,\"unpackHandle\",{enumerable:true,get:function(){return unpackHandle;}});\nObject.defineProperty(__exports,\"unpackHandles\",{enumerable:true,get:function(){return unpackHandles;}});\nObject.defineProperty(__exports,\"createMaskPool\",{enumerable:true,get:function(){return createMaskPool;}});\nObject.defineProperty(__exports,\"isTransferable\",{enumerable:true,get:function(){return isTransferable;}});\nObject.defineProperty(__exports,\"collectTransfers\",{enumerable:true,get:function(){return collectTransfers;}});\nObject.defineProperty(__exports,\"isPortable\",{enumerable:true,get:function(){return isPortable;}});\nObject.defineProperty(__exports,\"filterColumnIds\",{enumerable:true,get:function(){return filterColumnIds;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst collator=__m0[\"collator\"];\nconst isFunction=__m0[\"isFunction\"];\nconst PROTOCOL=1;\nconst OPS=Object.freeze({\nSORT_COLUMN:'sortColumn',\nSORT_MULTI:'sortMulti',\nEVALUATE_FILTERS:'evaluateFilters',\nCOMPACT:'compact',\nGROUP_BY_COLUMNS:'groupByColumns',\nTOTAL:'total',\nPIVOT:'pivot',\nFACET:'facet',\n});\nconst CONTROL=Object.freeze({\nREADY:'ready',\nCANCEL:'cancel',\nPING:'ping',\n});\nconst ERRORS=Object.freeze({\nNO_COMPUTE:'E_NO_COMPUTE',\nNO_KERNEL:'E_NO_KERNEL',\nABORTED:'E_ABORTED',\nKERNEL:'E_KERNEL',\nPROTOCOL:'E_PROTOCOL',\n});\nfunction packHandle(handle){\nif(handle==null)return null;\nconst presence=handle.presence;\nreturn{\nid:handle.id,\nkind:handle.kind,\nnullable:!!handle.nullable,\nvalues:handle.values??null,\npresence:presence?(presence.words??presence):null,\npresenceBits:presence?(presence.size??(presence.words??presence).length*8):0,\ndict:handle.dict?sliceDictionary(handle.dict):null,\noffsets:handle.offsets??null,\nversion:handle.version??0,\n};\n}\nfunction sliceDictionary(dict){\nif(Array.isArray(dict))return dict;\nif(isFunction(dict.values))return dict.values();\nreturn[];\n}\nfunction packHandles(handles){\nconst out=new Array(handles.length);\nfor(let i=0;i<handles.length;i++)out[i]=packHandle(handles[i]);\nreturn out;\n}\nclass TransportedBitset{\n#words;\n#bits;\nconstructor(words,bits){\nthis.#words=words;\nthis.#bits=bits;\n}\nget words(){return this.#words;}\nget size(){return this.#bits;}\nget(i){return(this.#words[i>>>3]&(1<<(i&7)))!==0;}\ncount(){\nconst w=this.#words;\nlet n=0;\nfor(let i=0;i<w.length;i++){\nlet v=w[i];\nwhile(v){v&=v-1;n++;}\n}\nreturn n;\n}\n}\nclass TransportedDictionary{\n#values;\n#index=null;\n#version=0;\n#ranks=new Map();\nconstructor(values){\nthis.#values=values||[];\n}\nget size(){return this.#values.length;}\nget version(){return this.#version;}\ncodeOf(value){\nif(this.#index===null){\nthis.#index=new Map();\nfor(let i=0;i<this.#values.length;i++)this.#index.set(this.#values[i],i);\n}\nconst found=this.#index.get(value);\nif(found!==undefined)return found;\nconst code=this.#values.length;\nthis.#values.push(value);\nthis.#index.set(value,code);\nthis.#version++;\nreturn code;\n}\nvalueOf(code){return this.#values[code];}\nvalues(){return this.#values;}\nranks(locale){\nconst key=locale||'';\nconst cached=this.#ranks.get(key);\nif(cached&&cached.version===this.#version)return cached.ranks;\nconst n=this.#values.length;\nconst order=new Uint32Array(n);\nfor(let i=0;i<n;i++)order[i]=i;\nconst cmp=collator(locale).compare;\nconst vals=this.#values;\nconst sorted=Array.from(order).sort((a,b)=>{\nconst av=vals[a];\nconst bv=vals[b];\nif(av===bv)return 0;\nif(av===null||av===undefined)return 1;\nif(bv===null||bv===undefined)return-1;\nreturn cmp(String(av),String(bv));\n});\nconst ranks=new Uint32Array(n);\nfor(let r=0;r<sorted.length;r++)ranks[sorted[r]]=r;\nthis.#ranks.set(key,{version:this.#version,ranks});\nreturn ranks;\n}\n}\nfunction unpackHandle(packed){\nif(packed==null)return null;\nconst presence=packed.presence\n?new TransportedBitset(packed.presence,packed.presenceBits||packed.presence.length*8)\n:null;\nconst dict=packed.dict?new TransportedDictionary(packed.dict):null;\nconst values=packed.values;\nconst offsets=packed.offsets??null;\nconst kind=packed.kind;\nconst get=(physical)=>{\nif(presence&&!presence.get(physical))return null;\nswitch(kind){\ncase'dictionary':\nreturn dict?dict.valueOf(values[physical]):values[physical];\ncase'bitset':\nreturn(values[physical>>>3]&(1<<(physical&7)))!==0;\ncase'multi':{\nif(!offsets)return null;\nconst from=offsets[physical];\nconst to=offsets[physical+1];\nconst out=new Array(to-from);\nfor(let i=from;i<to;i++)out[i-from]=dict?dict.valueOf(values[i]):values[i];\nreturn out;\n}\ndefault:\nreturn values[physical];\n}\n};\nreturn{\nid:packed.id,\nkind,\nnullable:packed.nullable,\nvalues,\npresence,\ndict,\noffsets,\nget,\nversion:packed.version,\n};\n}\nfunction unpackHandles(packed){\nconst out=new Array(packed.length);\nfor(let i=0;i<packed.length;i++)out[i]=unpackHandle(packed[i]);\nreturn out;\n}\nfunction createMaskPool(){\nconst masks=[];\nconst indices=[];\nreturn{\nmask(n){\nfor(let i=0;i<masks.length;i++){\nif(masks[i].length>=n){\nconst buf=masks.splice(i,1)[0].subarray(0,n);\nbuf.fill(0);\nreturn buf;\n}\n}\nreturn new Uint8Array(n);\n},\nindices(n){\nfor(let i=0;i<indices.length;i++){\nif(indices[i].length>=n)return indices.splice(i,1)[0].subarray(0,n);\n}\nreturn new Uint32Array(n);\n},\nrelease(buf){\nif(!buf)return;\nif(buf instanceof Uint8Array)masks.push(buf);\nelse if(buf instanceof Uint32Array)indices.push(buf);\n},\nclear(){masks.length=0;indices.length=0;},\n};\n}\nfunction isTransferable(v){\nif(!ArrayBuffer.isView(v))return false;\nconst buf=(v).buffer;\nif(!buf)return false;\nreturn typeof SharedArrayBuffer==='undefined'||!(buf instanceof SharedArrayBuffer);\n}\nfunction collectTransfers(value,out=[]){\nconst add=(v)=>{\nif(!isTransferable(v))return;\nconst buf=(v).buffer;\nif(!out.includes(buf))out.push(buf);\n};\nif(value==null)return out;\nif(ArrayBuffer.isView(value)){add(value);return out;}\nif(Array.isArray(value)){\nfor(const item of value)add(item);\nreturn out;\n}\nif(typeof value==='object'){\nfor(const key of Object.keys(value)){\nconst item=(value)[key];\nif(Array.isArray(item))for(const sub of item)add(sub);\nelse add(item);\n}\n}\nreturn out;\n}\nfunction isPortable(value,depth=0){\nif(value==null)return true;\nconst t=typeof value;\nif(t==='function'||t==='symbol')return false;\nif(t!=='object')return true;\nif(depth>4)return true;\nif(ArrayBuffer.isView(value)||value instanceof ArrayBuffer||value instanceof Date)return true;\nif(Array.isArray(value)){\nfor(const item of value)if(!isPortable(item,depth+1))return false;\nreturn true;\n}\nfor(const key of Object.keys(value)){\nif(!isPortable((value)[key],depth+1))return false;\n}\nreturn true;\n}\nfunction filterColumnIds(filters,out=new Set()){\nif(!filters||typeof filters!=='object')return out;\nconst node=(filters);\nif(typeof node.col==='string')out.add(node.col);\nconst conditions=node.conditions;\nif(Array.isArray(conditions))for(const child of conditions)filterColumnIds(child,out);\nreturn out;\n}\n});\n__def(\"packages/core/src/compute/handle.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"identity\",{enumerable:true,get:function(){return identity;}});\nObject.defineProperty(__exports,\"rowCount\",{enumerable:true,get:function(){return rowCount;}});\nObject.defineProperty(__exports,\"bitReader\",{enumerable:true,get:function(){return bitReader;}});\nObject.defineProperty(__exports,\"presenceReader\",{enumerable:true,get:function(){return presenceReader;}});\nObject.defineProperty(__exports,\"dictSize\",{enumerable:true,get:function(){return dictSize;}});\nObject.defineProperty(__exports,\"dictValue\",{enumerable:true,get:function(){return dictValue;}});\nObject.defineProperty(__exports,\"multiValue\",{enumerable:true,get:function(){return multiValue;}});\nObject.defineProperty(__exports,\"valueReader\",{enumerable:true,get:function(){return valueReader;}});\nObject.defineProperty(__exports,\"numericTotalOrder\",{enumerable:true,get:function(){return numericTotalOrder;}});\nObject.defineProperty(__exports,\"valueComparator\",{enumerable:true,get:function(){return valueComparator;}});\nObject.defineProperty(__exports,\"dictRanks\",{enumerable:true,get:function(){return dictRanks;}});\nObject.defineProperty(__exports,\"isMissing\",{enumerable:true,get:function(){return isMissing;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst collator=__m0[\"collator\"];\nconst defaultCompare=__m0[\"defaultCompare\"];\nconst warnOnce=__m0[\"warnOnce\"];\nfunction identity(n){\nconst out=new Uint32Array(n);\nfor(let i=0;i<n;i++)out[i]=i;\nreturn out;\n}\nfunction rowCount(handle,opts){\nif(opts&&typeof opts.count==='number')return opts.count;\nif(!handle)return 0;\nif(typeof handle.count==='number')return handle.count;\nif(typeof handle.length==='number')return handle.length;\nconst values=handle.values;\nif(handle.kind==='multi'&&handle.offsets)return Math.max(0,handle.offsets.length-1);\nif(!values)return handle.presence&&typeof handle.presence.size==='number'?handle.presence.size:0;\nif(handle.kind==='bitset'){\nif(typeof values.size==='number')return values.size;\nif(handle.presence&&typeof handle.presence.size==='number')return handle.presence.size;\nwarnOnce(`count:${handle.id}`,`column \"${handle.id}\" is bitset-backed with no declared row count; assuming ${values.length*8}`);\nreturn values.length*8;\n}\nreturn values.length;\n}\nconst bitOrders=new WeakMap();\nfunction bitOrderOf(bitset){\nconst ctor=bitset.constructor;\nif(!ctor)return'unknown';\nconst cached=bitOrders.get(ctor);\nif(cached)return cached;\nlet order='unknown';\ntry{\nlet probe=null;\nif(typeof ctor.from==='function')probe=ctor.from([false,true]);\nelse{\nprobe=new ctor(8);\nprobe.set(1);\n}\nconst words=probe&&probe.words;\nif(words&&words.length){\nif(words[0]===0x02)order='lsb';\nelse if(words[0]===0x40)order='msb';\n}\n}catch{\norder='unknown';\n}\nbitOrders.set(ctor,order);\nreturn order;\n}\nfunction bitReader(bits){\nif(!bits)return()=>0;\nconst raw=bits instanceof Uint8Array?bits:bits.words;\nif(raw instanceof Uint8Array){\nconst order=bits instanceof Uint8Array?'lsb':bitOrderOf(bits);\nif(order==='lsb')return(i)=>(raw[i>>>3]>>>(i&7))&1;\nif(order==='msb')return(i)=>(raw[i>>>3]>>>(7-(i&7)))&1;\n}\nif(typeof bits.get==='function')return(i)=>(bits.get(i)?1:0);\nreturn()=>0;\n}\nfunction presenceReader(handle){\nif(!handle||!handle.presence)return null;\nreturn bitReader(handle.presence);\n}\nfunction dictSize(dict){\nif(!dict)return 0;\nif(typeof dict.size==='number')return dict.size;\nif(typeof dict.values==='function')return dict.values().length;\nreturn 0;\n}\nfunction dictValue(dict,code){\nif(!dict)return null;\nif(typeof dict.valueOf==='function')return dict.valueOf(code);\nif(typeof dict.values==='function')return dict.values()[code];\nreturn null;\n}\nfunction multiValue(handle,i){\nconst offsets=handle.offsets;\nconst values=handle.values;\nif(!offsets||!values)return[];\nconst from=offsets[i];\nconst to=offsets[i+1];\nif(!(to>from))return[];\nconst dict=handle.dict;\nconst out=new Array(to-from);\nfor(let k=from;k<to;k++)out[k-from]=dict?dictValue(dict,values[k]):values[k];\nreturn out;\n}\nfunction valueReader(handle){\nif(!handle)return()=>undefined;\nconst values=handle.values;\nconst present=presenceReader(handle);\nconst kind=handle.kind;\nif(kind==='dictionary'){\nconst dict=handle.dict;\nif(present)return(i)=>(present(i)?dictValue(dict,values[i]):null);\nreturn(i)=>dictValue(dict,values[i]);\n}\nif(kind==='bitset'){\nconst bit=bitReader(values);\nif(present)return(i)=>(present(i)?bit(i)===1:null);\nreturn(i)=>bit(i)===1;\n}\nif(kind==='multi'){\nif(present)return(i)=>(present(i)?multiValue(handle,i):null);\nreturn(i)=>multiValue(handle,i);\n}\nif(!values&&typeof handle.get==='function'){\nconst get=handle.get.bind(handle);\nreturn(i)=>{\nconst v=get(i);\nreturn v===undefined?null:v;\n};\n}\nif(present){\nreturn(i)=>{\nif(!present(i))return null;\nconst v=values[i];\nreturn v===undefined?null:v;\n};\n}\nreturn(i)=>{\nconst v=values[i];\nreturn v===undefined?null:v;\n};\n}\nfunction numericTotalOrder(a,b){\nif(a<b)return-1;\nif(a>b)return 1;\nif(a===b){\nconst na=Object.is(a,-0);\nconst nb=Object.is(b,-0);\nif(na===nb)return 0;\nreturn na?-1:1;\n}\nconst an=Number.isNaN(a);\nconst bn=Number.isNaN(b);\nif(an&&bn)return 0;\nreturn an?1:-1;\n}\nfunction valueComparator(locale){\nconst coll=collator(locale);\nreturn(a,b)=>{\nif(a===b)return 0;\nconst ta=typeof a;\nconst tb=typeof b;\nif(ta==='string'&&tb==='string')return coll.compare(a,b);\nif(ta==='number'&&tb==='number')return numericTotalOrder(a,b);\nif(ta==='boolean'&&tb==='boolean')return a===b?0:a?1:-1;\nif(a instanceof Date||b instanceof Date){\nconst na=a instanceof Date?a.getTime():Number(a);\nconst nb=b instanceof Date?b.getTime():Number(b);\nreturn numericTotalOrder(na,nb);\n}\nreturn defaultCompare(a,b);\n};\n}\nfunction dictRanks(dict,locale){\nif(dict&&typeof dict.ranks==='function')return dict.ranks(locale);\nconst table=dict&&typeof dict.values==='function'?dict.values():[];\nconst n=table.length;\nconst cmp=valueComparator(locale);\nconst order=new Array(n);\nfor(let i=0;i<n;i++)order[i]=i;\norder.sort((a,b)=>cmp(table[a],table[b])||a-b);\nconst ranks=new Uint32Array(n);\nfor(let r=0;r<n;r++)ranks[order[r]]=r;\nreturn ranks;\n}\nfunction isMissing(v){\nreturn v===null||v===undefined||(typeof v==='number'&&Number.isNaN(v));\n}\n});\n__def(\"packages/core/src/compute/sort.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"radixSortFloat64\",{enumerable:true,get:function(){return radixSortFloat64;}});\nObject.defineProperty(__exports,\"radixSortInt32\",{enumerable:true,get:function(){return radixSortInt32;}});\nObject.defineProperty(__exports,\"rankSortDictionary\",{enumerable:true,get:function(){return rankSortDictionary;}});\nObject.defineProperty(__exports,\"mergeSortComparator\",{enumerable:true,get:function(){return mergeSortComparator;}});\nObject.defineProperty(__exports,\"sortColumn\",{enumerable:true,get:function(){return sortColumn;}});\nObject.defineProperty(__exports,\"sortMulti\",{enumerable:true,get:function(){return sortMulti;}});\nconst __m0=__req(\"packages/core/src/compute/handle.js\");\nconst bitReader=__m0[\"bitReader\"];\nconst dictRanks=__m0[\"dictRanks\"];\nconst dictSize=__m0[\"dictSize\"];\nconst identity=__m0[\"identity\"];\nconst isMissing=__m0[\"isMissing\"];\nconst presenceReader=__m0[\"presenceReader\"];\nconst rowCount=__m0[\"rowCount\"];\nconst valueComparator=__m0[\"valueComparator\"];\nconst valueReader=__m0[\"valueReader\"];\nconst EMPTY_INDICES=new Uint32Array(0);\nconst SCRATCH=new ArrayBuffer(8);\nconst SCRATCH_F64=new Float64Array(SCRATCH);\nconst SCRATCH_U32=new Uint32Array(SCRATCH);\nconst HI=(()=>{\nSCRATCH_F64[0]=-1;\nreturn(SCRATCH_U32[1]&0x80000000)!==0?1:0;\n})();\nconst LO=HI===1?0:1;\nfunction transformDouble(value,out){\nSCRATCH_F64[0]=value;\nlet hi=SCRATCH_U32[HI];\nlet lo=SCRATCH_U32[LO];\nif((hi&0x80000000)!==0){\nhi=~hi>>>0;\nlo=~lo>>>0;\n}else{\nhi=(hi^0x80000000)>>>0;\n}\nout[0]=lo;\nout[1]=hi;\n}\nfunction radixLsd64(idx,lo,hi,n){\nif(n<2)return idx;\nconst hist=new Uint32Array(256*8);\nfor(let i=0;i<n;i++){\nconst l=lo[i];\nconst h=hi[i];\nhist[l&0xff]++;\nhist[256+((l>>>8)&0xff)]++;\nhist[512+((l>>>16)&0xff)]++;\nhist[768+((l>>>24)&0xff)]++;\nhist[1024+(h&0xff)]++;\nhist[1280+((h>>>8)&0xff)]++;\nhist[1536+((h>>>16)&0xff)]++;\nhist[1792+((h>>>24)&0xff)]++;\n}\nlet srcIdx=idx;\nlet srcLo=lo;\nlet srcHi=hi;\nlet dstIdx=new Uint32Array(n);\nlet dstLo=new Uint32Array(n);\nlet dstHi=new Uint32Array(n);\nconst offset=new Uint32Array(256);\nfor(let pass=0;pass<8;pass++){\nconst base=pass<<8;\nconst shift=(pass&3)<<3;\nconst useHi=pass>=4;\nlet skip=false;\nfor(let b=0;b<256;b++){\nif(hist[base+b]===n){skip=true;break;}\n}\nif(skip)continue;\nlet sum=0;\nfor(let b=0;b<256;b++){\noffset[b]=sum;\nsum+=hist[base+b];\n}\nfor(let i=0;i<n;i++){\nconst l=srcLo[i];\nconst h=srcHi[i];\nconst digit=((useHi?h:l)>>>shift)&0xff;\nconst p=offset[digit]++;\ndstIdx[p]=srcIdx[i];\ndstLo[p]=l;\ndstHi[p]=h;\n}\nlet t=srcIdx;srcIdx=dstIdx;dstIdx=t;\nt=srcLo;srcLo=dstLo;dstLo=t;\nt=srcHi;srcHi=dstHi;dstHi=t;\n}\nreturn srcIdx;\n}\nfunction radixLsd32(idx,keys,n){\nif(n<2)return idx;\nconst hist=new Uint32Array(256*4);\nfor(let i=0;i<n;i++){\nconst k=keys[i];\nhist[k&0xff]++;\nhist[256+((k>>>8)&0xff)]++;\nhist[512+((k>>>16)&0xff)]++;\nhist[768+((k>>>24)&0xff)]++;\n}\nlet srcIdx=idx;\nlet srcKeys=keys;\nlet dstIdx=new Uint32Array(n);\nlet dstKeys=new Uint32Array(n);\nconst offset=new Uint32Array(256);\nfor(let pass=0;pass<4;pass++){\nconst base=pass<<8;\nconst shift=pass<<3;\nlet skip=false;\nfor(let b=0;b<256;b++){\nif(hist[base+b]===n){skip=true;break;}\n}\nif(skip)continue;\nlet sum=0;\nfor(let b=0;b<256;b++){\noffset[b]=sum;\nsum+=hist[base+b];\n}\nfor(let i=0;i<n;i++){\nconst k=srcKeys[i];\nconst p=offset[(k>>>shift)&0xff]++;\ndstIdx[p]=srcIdx[i];\ndstKeys[p]=k;\n}\nlet t=srcIdx;srcIdx=dstIdx;dstIdx=t;\nt=srcKeys;srcKeys=dstKeys;dstKeys=t;\n}\nreturn srcIdx;\n}\nfunction countingSort(idx,keys,n,radix){\nconst counts=new Uint32Array(radix+1);\nfor(let i=0;i<n;i++)counts[keys[i]]++;\nlet sum=0;\nfor(let k=0;k<=radix;k++){\nconst c=counts[k];\ncounts[k]=sum;\nsum+=c;\n}\nconst out=new Uint32Array(n);\nfor(let i=0;i<n;i++)out[counts[keys[i]]++]=idx[i];\nreturn out;\n}\nfunction sortUint32Keys(idx,keys,n,radix){\nif(n<2)return idx;\nif(radix<=65536||radix<=n*2)return countingSort(idx,keys,n,radix);\nreturn radixLsd32(idx,keys,n);\n}\nfunction exact(buffer,n){\nif(buffer.length===n&&buffer.byteOffset===0)return buffer;\nreturn Uint32Array.prototype.slice.call(buffer,0,n);\n}\nfunction radixSortFloat64(values,order,descending=false){\nconst src=order||identity(values.length);\nconst n=src.length;\nif(n<2)return Uint32Array.from(src);\nconst idx=new Uint32Array(n);\nconst lo=new Uint32Array(n);\nconst hi=new Uint32Array(n);\nconst nans=new Uint32Array(n);\nconst pair=new Uint32Array(2);\nlet m=0;\nlet nanCount=0;\nfor(let i=0;i<n;i++){\nconst row=src[i];\nconst v=values[row];\nif(Number.isNaN(v)){nans[nanCount++]=row;continue;}\ntransformDouble(v,pair);\nif(descending){\nlo[m]=~pair[0]>>>0;\nhi[m]=~pair[1]>>>0;\n}else{\nlo[m]=pair[0];\nhi[m]=pair[1];\n}\nidx[m++]=row;\n}\nconst sorted=radixLsd64(idx.subarray(0,m),lo.subarray(0,m),hi.subarray(0,m),m);\nif(nanCount===0)return exact(sorted,m);\nconst out=new Uint32Array(n);\nout.set(sorted.subarray(0,m),0);\nout.set(nans.subarray(0,nanCount),m);\nreturn out;\n}\nfunction radixSortInt32(values,order,descending=false){\nconst src=order||identity(values.length);\nconst n=src.length;\nif(n<2)return Uint32Array.from(src);\nconst idx=Uint32Array.from(src);\nconst keys=new Uint32Array(n);\nfor(let i=0;i<n;i++){\nconst k=(values[idx[i]]^0x80000000)>>>0;\nkeys[i]=descending?(~k>>>0):k;\n}\nreturn exact(radixLsd32(idx,keys,n),n);\n}\nfunction rankSortDictionary(handle,order,opts={}){\nconst src=order||identity(rowCount(handle,opts));\nconst n=src.length;\nif(n<2)return Uint32Array.from(src);\nconst ranks=dictRanks(handle.dict,opts.locale);\nconst codes=handle.values;\nconst present=presenceReader(handle);\nconst size=Math.max(dictSize(handle.dict),ranks.length);\nconst absentRank=size;\nconst idx=Uint32Array.from(src);\nconst keys=new Uint32Array(n);\nconst descending=!!opts.descending;\nfor(let i=0;i<n;i++){\nconst row=idx[i];\nlet rank=present&&present(row)===0?absentRank:ranks[codes[row]];\nif(rank===undefined)rank=absentRank;\nkeys[i]=descending?absentRank-rank:rank;\n}\nreturn exact(sortUint32Keys(idx,keys,n,size+1),n);\n}\nfunction mergeSortComparator(values,order,compare){\nconst n=order.length;\nlet src=Uint32Array.from(order);\nif(n<2)return src;\nlet dst=new Uint32Array(n);\nfor(let width=1;width<n;width<<=1){\nfor(let start=0;start<n;start+=width<<1){\nconst mid=Math.min(start+width,n);\nconst end=Math.min(start+(width<<1),n);\nlet i=start;\nlet j=mid;\nlet k=start;\nwhile(i<mid&&j<end){\ndst[k++]=compare(values[src[i]],values[src[j]])<=0?src[i++]:src[j++];\n}\nwhile(i<mid)dst[k++]=src[i++];\nwhile(j<end)dst[k++]=src[j++];\n}\nconst t=src;src=dst;dst=t;\n}\nreturn src;\n}\nfunction sortBitsetColumn(handle,idx,descending){\nconst bit=bitReader(handle.values);\nconst n=idx.length;\nconst out=new Uint32Array(n);\nconst first=descending?1:0;\nlet k=0;\nfor(let i=0;i<n;i++)if(bit(idx[i])===first)out[k++]=idx[i];\nfor(let i=0;i<n;i++)if(bit(idx[i])!==first)out[k++]=idx[i];\nreturn out;\n}\nfunction indexableValues(handle,idx){\nconst values=handle.values;\nconst kind=handle.kind;\nconst direct=(kind==='object'||kind===undefined)&&(Array.isArray(values)||ArrayBuffer.isView(values));\nif(direct&&!handle.presence)return values;\nconst reader=valueReader(handle);\nconst materialised=new Array(rowCount(handle)||0);\nfor(let i=0;i<idx.length;i++){\nconst row=idx[i];\nmaterialised[row]=reader(row);\n}\nreturn materialised;\n}\nfunction sortByComparator(handle,idx,opts){\nconst values=indexableValues(handle,idx);\nconst base=valueComparator(opts.locale);\nconst compare=opts.descending?(a,b)=>base(b,a):base;\nreturn mergeSortComparator(values,idx,compare);\n}\nfunction sortByCompare(handle,idx,opts){\nconst values=indexableValues(handle,idx);\nconst user=opts.compare;\nconst descending=!!opts.descending;\nconst compare=descending\n?(a,b)=>-user(a,b,undefined,undefined,true)\n:(a,b)=>user(a,b,undefined,undefined,false);\nreturn mergeSortComparator(values,idx,compare);\n}\nfunction partitionPresent(handle,idx){\nconst n=idx.length;\nconst present=presenceReader(handle);\nconst values=handle.values;\nconst checkNaN=handle.kind==='float64'&&!!values;\nconst looseKind=handle.kind==='object'||handle.kind==='multi'||handle.kind===undefined;\nif(!present&&!checkNaN&&!looseKind)return{present:idx,absent:EMPTY_INDICES};\nconst keep=new Uint32Array(n);\nconst drop=new Uint32Array(n);\nlet p=0;\nlet a=0;\nif(present&&checkNaN){\nfor(let i=0;i<n;i++){\nconst row=idx[i];\nif(present(row)===1&&!Number.isNaN(values[row]))keep[p++]=row;else drop[a++]=row;\n}\n}else if(checkNaN&&!present){\nfor(let i=0;i<n;i++){\nconst row=idx[i];\nif(!Number.isNaN(values[row]))keep[p++]=row;else drop[a++]=row;\n}\n}else if(present&&!looseKind){\nfor(let i=0;i<n;i++){\nconst row=idx[i];\nif(present(row)===1)keep[p++]=row;else drop[a++]=row;\n}\n}else{\nconst reader=valueReader(handle);\nfor(let i=0;i<n;i++){\nconst row=idx[i];\nif(!isMissing(reader(row)))keep[p++]=row;else drop[a++]=row;\n}\n}\nif(a===0)return{present:idx,absent:EMPTY_INDICES};\nreturn{present:keep.subarray(0,p),absent:drop.subarray(0,a)};\n}\nfunction joinRuns(sorted,absent,nullsFirst){\nif(absent.length===0)return sorted;\nconst out=new Uint32Array(sorted.length+absent.length);\nif(nullsFirst){\nout.set(absent,0);\nout.set(sorted,absent.length);\n}else{\nout.set(sorted,0);\nout.set(absent,sorted.length);\n}\nreturn out;\n}\nfunction sortColumn(handle,order,opts={}){\nconst src=order||identity(rowCount(handle,opts));\nif(!handle||src.length<2)return Uint32Array.from(src);\nconst{present,absent}=partitionPresent(handle,src);\nif(present.length===0)return Uint32Array.from(src);\nconst descending=!!opts.descending;\nlet sorted;\nif(typeof opts.compare==='function'){\nsorted=sortByCompare(handle,present,opts);\n}else{\nswitch(handle.kind){\ncase'float64':\nsorted=radixSortFloat64(handle.values,present,descending);\nbreak;\ncase'int32':\nsorted=radixSortInt32(handle.values,present,descending);\nbreak;\ncase'dictionary':\nsorted=rankSortDictionary(handle,present,opts);\nbreak;\ncase'bitset':\nsorted=sortBitsetColumn(handle,present,descending);\nbreak;\ndefault:\nsorted=sortByComparator(handle,present,opts);\nbreak;\n}\n}\nreturn joinRuns(sorted,absent,!!opts.nullsFirst);\n}\nfunction sortMulti(handles,entries,order,opts={}){\nconst list=entries||[];\nconst first=(list.length&&(list[0].handle||byId(handles,list[0].col)))||(handles&&handles[0]);\nlet current=order||identity(rowCount(first,opts));\nfor(let i=list.length-1;i>=0;i--){\nconst entry=list[i];\nconst handle=entry.handle||byId(handles,entry.col)||(handles&&handles[i]);\nif(!handle)continue;\ncurrent=sortColumn(handle,current,{\ndescending:entry.descending!==undefined?!!entry.descending:entry.dir==='desc',\nnullsFirst:!!entry.nullsFirst,\nlocale:entry.locale!==undefined?entry.locale:opts.locale,\ncompare:entry.compare,\n});\n}\nreturn current instanceof Uint32Array?current:Uint32Array.from(current);\n}\nfunction byId(handles,id){\nif(!handles||id===undefined)return undefined;\nfor(let i=0;i<handles.length;i++)if(handles[i]&&handles[i].id===id)return handles[i];\nreturn undefined;\n}\n});\n__def(\"packages/core/src/format/date.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"scanPattern\",{enumerable:true,get:function(){return scanPattern;}});\nObject.defineProperty(__exports,\"toDate\",{enumerable:true,get:function(){return toDate;}});\nObject.defineProperty(__exports,\"compilePattern\",{enumerable:true,get:function(){return compilePattern;}});\nObject.defineProperty(__exports,\"compileDate\",{enumerable:true,get:function(){return compileDate;}});\nObject.defineProperty(__exports,\"toIsoDate\",{enumerable:true,get:function(){return toIsoDate;}});\nObject.defineProperty(__exports,\"toIsoDateTime\",{enumerable:true,get:function(){return toIsoDateTime;}});\nObject.defineProperty(__exports,\"compareIso\",{enumerable:true,get:function(){return compareIso;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst isNil=__m0[\"isNil\"];\nconst warnOnce=__m0[\"warnOnce\"];\nconst TOKENS=[\n'yyyy','yy','MMMM','MMM','MM','M','dd','d',\n'EEEE','EEE','HH','H','hh','h','mm','m','ss','s','SSS','a',\n];\nfunction scanPattern(pattern){\nconst out=[];\nlet i=0;\nlet literal='';\nconst flush=()=>{if(literal){out.push({token:null,text:literal});literal='';}};\nwhile(i<pattern.length){\nconst ch=pattern[i];\nif(ch===\"'\"){\nif(pattern[i+1]===\"'\"){literal+=\"'\";i+=2;continue;}\nconst end=pattern.indexOf(\"'\",i+1);\nif(end===-1){literal+=pattern.slice(i+1);i=pattern.length;continue;}\nliteral+=pattern.slice(i+1,end);\ni=end+1;\ncontinue;\n}\nconst token=TOKENS.find((t)=>pattern.startsWith(t,i));\nif(token){flush();out.push({token,text:token});i+=token.length;continue;}\nif(/[A-Za-z]/.test(ch)){\nwarnOnce(\n`date.pattern.token:${ch}`,\n`the date pattern \"${pattern}\" contains '${ch}', which is not a supported token, `\n+'so it is rendered as text. Quote it as a literal to silence this. '\n+`Supported: ${TOKENS.join(' ')}.`,\n);\n}\nliteral+=ch;\ni+=1;\n}\nflush();\nreturn out;\n}\nconst WALL_CLOCK=/^(\\d{4})-(\\d{2})-(\\d{2})(?:[T ](\\d{2}):(\\d{2})(?::(\\d{2}))?(?:\\.\\d+)?)?$/;\nfunction toDate(value){\nif(isNil(value)||value==='')return null;\nif(value instanceof Date)return Number.isNaN(value.getTime())?null:value;\nif(typeof value==='number')return Number.isNaN(value)?null:new Date(value);\nif(typeof value==='string'){\nconst wall=WALL_CLOCK.exec(value.trim());\nif(wall){\nconst[,y,mo,d,h='0',mi='0',sec='0']=wall;\nreturn new Date(+y,+mo-1,+d,+h,+mi,+sec);\n}\nconst d=new Date(value);\nreturn Number.isNaN(d.getTime())?null:d;\n}\nreturn null;\n}\nfunction pad(n,w){return String(n).padStart(w,'0');}\nfunction fieldReader(timeZone){\nif(!timeZone){\nreturn(d)=>({\nyear:d.getFullYear(),month:d.getMonth()+1,day:d.getDate(),\nhour:d.getHours(),minute:d.getMinutes(),second:d.getSeconds(),\nms:d.getMilliseconds(),weekday:d.getDay(),\n});\n}\nconst zoned=new Intl.DateTimeFormat('en-US',{\ntimeZone,year:'numeric',month:'2-digit',day:'2-digit',\nhour:'2-digit',minute:'2-digit',second:'2-digit',hour12:false,weekday:'short',\n});\nconst days={Sun:0,Mon:1,Tue:2,Wed:3,Thu:4,Fri:5,Sat:6};\nreturn(d)=>{\nconst f={year:0,month:1,day:1,hour:0,minute:0,second:0,ms:d.getMilliseconds(),weekday:0};\nfor(const part of zoned.formatToParts(d)){\nswitch(part.type){\ncase'year':f.year=Number(part.value);break;\ncase'month':f.month=Number(part.value);break;\ncase'day':f.day=Number(part.value);break;\ncase'hour':f.hour=Number(part.value)%24;break;\ncase'minute':f.minute=Number(part.value);break;\ncase'second':f.second=Number(part.value);break;\ncase'weekday':f.weekday=days[part.value]??0;break;\ndefault:break;\n}\n}\nreturn f;\n};\n}\nfunction compilePattern(pattern,locale,timeZone){\nconst segments=scanPattern(pattern);\nconst read=fieldReader(timeZone);\nconst used=new Set(segments.filter((s)=>s.token).map((s)=>s.token));\nconst monthShort=used.has('MMM')?new Intl.DateTimeFormat(locale,{month:'short',timeZone}):null;\nconst monthLong=used.has('MMMM')?new Intl.DateTimeFormat(locale,{month:'long',timeZone}):null;\nconst dayShort=used.has('EEE')?new Intl.DateTimeFormat(locale,{weekday:'short',timeZone}):null;\nconst dayLong=used.has('EEEE')?new Intl.DateTimeFormat(locale,{weekday:'long',timeZone}):null;\nreturn(d)=>{\nconst f=read(d);\nlet out='';\nfor(const seg of segments){\nif(!seg.token){out+=seg.text;continue;}\nswitch(seg.token){\ncase'yyyy':out+=pad(f.year,4);break;\ncase'yy':out+=pad(f.year%100,2);break;\ncase'MMMM':out+=monthLong.format(d);break;\ncase'MMM':out+=monthShort.format(d);break;\ncase'MM':out+=pad(f.month,2);break;\ncase'M':out+=String(f.month);break;\ncase'dd':out+=pad(f.day,2);break;\ncase'd':out+=String(f.day);break;\ncase'EEEE':out+=dayLong.format(d);break;\ncase'EEE':out+=dayShort.format(d);break;\ncase'HH':out+=pad(f.hour,2);break;\ncase'H':out+=String(f.hour);break;\ncase'hh':out+=pad(f.hour%12===0?12:f.hour%12,2);break;\ncase'h':out+=String(f.hour%12===0?12:f.hour%12);break;\ncase'mm':out+=pad(f.minute,2);break;\ncase'm':out+=String(f.minute);break;\ncase'ss':out+=pad(f.second,2);break;\ncase's':out+=String(f.second);break;\ncase'SSS':out+=pad(f.ms,3);break;\ncase'a':out+=f.hour<12?'AM':'PM';break;\ndefault:out+=seg.text;break;\n}\n}\nreturn out;\n};\n}\nconst UNITS=[\n['year',365*24*3600e3],\n['month',30*24*3600e3],\n['week',7*24*3600e3],\n['day',24*3600e3],\n['hour',3600e3],\n['minute',60e3],\n['second',1e3],\n];\nfunction compileDate(spec,locale){\nconst s=spec||{};\nconst loc=s.locale||locale||undefined;\nconst nullDisplay=s.nullDisplay??'';\nconst timeZone=s.timeZone;\nlet absolute;\nif(s.pattern){\nabsolute=compilePattern(s.pattern,loc,timeZone);\n}else if(s.dateStyle||s.timeStyle){\nconst opts={timeZone};\nif(s.dateStyle)opts.dateStyle=s.dateStyle;\nif(s.timeStyle)opts.timeStyle=s.timeStyle;\nconst dtf=new Intl.DateTimeFormat(loc,opts);\nabsolute=(d)=>dtf.format(d);\n}else{\nconst dtf=new Intl.DateTimeFormat(loc,{dateStyle:'medium',timeZone});\nabsolute=(d)=>dtf.format(d);\n}\nconst relative=s.relative?new Intl.RelativeTimeFormat(loc,{numeric:'auto'}):null;\nconst thresholdDays=typeof s.relative==='object'&&s.relative\n?(s.relative.threshold??7)\n:7;\nconst thresholdMs=thresholdDays*24*3600e3;\nconst format=(value,params)=>{\nconst d=toDate(value);\nif(!d)return nullDisplay;\nif(relative){\nconst now=params&&typeof params.now==='number'?params.now:Date.now();\nconst delta=d.getTime()-now;\nif(Math.abs(delta)<thresholdMs){\nfor(const[unit,ms]of UNITS){\nif(Math.abs(delta)>=ms||unit==='second'){\nreturn relative.format(Math.round(delta/ms),unit);\n}\n}\n}\n}\nreturn absolute(d);\n};\nformat.spec=s;\nreturn format;\n}\nfunction toIsoDate(value){\nif(isNil(value)||value==='')return null;\nif(typeof value==='string'){\nconst match=/^(\\d{4}-\\d{2}-\\d{2})/.exec(value.trim());\nif(match)return match[1];\nconst parsed=toDate(value);\nreturn parsed?toIsoDate(parsed):null;\n}\nconst date=toDate(value);\nif(!date)return null;\nconst pad=(n)=>String(n).padStart(2,'0');\nreturn`${date.getFullYear()}-${pad(date.getMonth()+1)}-${pad(date.getDate())}`;\n}\nfunction toIsoDateTime(value,timeZone){\nif(isNil(value)||value==='')return null;\nif(typeof value==='string'){\nconst text=value.trim();\nif(ZONE_SUFFIX.test(text)){\nconst instant=toDate(text);\nreturn instant?wallClockIn(instant,timeZone):null;\n}\nconst match=/^(\\d{4}-\\d{2}-\\d{2})[T ](\\d{2}):(\\d{2})(?::(\\d{2}))?/.exec(text);\nif(match){\nconst[,day,hour,minute,second]=match;\nreturn`${day}T${hour}:${minute}${second&&second!=='00'?`:${second}`:''}`;\n}\nif(/^\\d{4}-\\d{2}-\\d{2}$/.test(text))return`${text}T00:00`;\nconst parsed=toDate(text);\nreturn parsed?toIsoDateTime(parsed):null;\n}\nconst date=toDate(value);\nif(!date)return null;\nreturn wallClockIn(date,timeZone);\n}\nconst ZONE_SUFFIX=/(?:Z|[+-]\\d{2}:?\\d{2})$/i;\nfunction wallClockIn(date,timeZone){\nconst pad=(n)=>String(n).padStart(2,'0');\nif(timeZone){\ntry{\nconst parts=new Intl.DateTimeFormat('en-CA',{\ntimeZone,\nyear:'numeric',month:'2-digit',day:'2-digit',\nhour:'2-digit',minute:'2-digit',second:'2-digit',\nhour12:false,\n}).formatToParts(date).reduce((out,part)=>{\nif(part.type!=='literal')out[part.type]=part.value;\nreturn out;\n},{});\nconst hour=parts.hour==='24'?'00':parts.hour;\nconst seconds=Number(parts.second);\nreturn`${parts.year}-${parts.month}-${parts.day}T${hour}:${parts.minute}`\n+(seconds?`:${parts.second}`:'');\n}catch{\n}\n}\nconst day=`${date.getFullYear()}-${pad(date.getMonth()+1)}-${pad(date.getDate())}`;\nconst seconds=date.getSeconds();\nconst clock=`${pad(date.getHours())}:${pad(date.getMinutes())}${seconds?`:${pad(seconds)}`:''}`;\nreturn`${day}T${clock}`;\n}\nfunction compareIso(a,b){\nconst left=isNil(a)||a===''?null:String(a);\nconst right=isNil(b)||b===''?null:String(b);\nif(left===null)return right===null?0:1;\nif(right===null)return-1;\nreturn left<right?-1:left>right?1:0;\n}\n});\n__def(\"packages/core/src/compute/filter.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"releaseMask\",{enumerable:true,get:function(){return releaseMask;}});\nObject.defineProperty(__exports,\"compilePredicate\",{enumerable:true,get:function(){return compilePredicate;}});\nObject.defineProperty(__exports,\"testValue\",{enumerable:true,get:function(){return testValue;}});\nObject.defineProperty(__exports,\"evaluateCondition\",{enumerable:true,get:function(){return evaluateCondition;}});\nObject.defineProperty(__exports,\"evaluateFilters\",{enumerable:true,get:function(){return evaluateFilters;}});\nObject.defineProperty(__exports,\"pruneColumn\",{enumerable:true,get:function(){return pruneColumn;}});\nObject.defineProperty(__exports,\"mentionsColumn\",{enumerable:true,get:function(){return mentionsColumn;}});\nObject.defineProperty(__exports,\"compact\",{enumerable:true,get:function(){return compact;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst isBlank=__m0[\"isBlank\"];\nconst toArray=__m0[\"toArray\"];\nconst warnOnce=__m0[\"warnOnce\"];\nconst __m1=__req(\"packages/core/src/format/date.js\");\nconst toIsoDate=__m1[\"toIsoDate\"];\nconst __m2=__req(\"packages/core/src/compute/handle.js\");\nconst bitReader=__m2[\"bitReader\"];\nconst dictSize=__m2[\"dictSize\"];\nconst dictValue=__m2[\"dictValue\"];\nconst presenceReader=__m2[\"presenceReader\"];\nconst valueComparator=__m2[\"valueComparator\"];\nconst valueReader=__m2[\"valueReader\"];\nconst ISO_DAY=/^\\d{4}-\\d{2}-\\d{2}$/;\nconst NULL_KEY='\\u0000null\\u0000';\nfunction acquireMask(ctx,n){\nconst pool=ctx&&ctx.pool;\nif(pool){\nconst take=pool.mask||pool.acquireMask||pool.acquire||pool.take;\nif(typeof take==='function'){\nconst mask=take.call(pool,n);\nif(mask&&mask.length>=n)return mask;\n}\n}\nreturn new Uint8Array(n);\n}\nfunction releaseMask(ctx,mask){\nconst pool=ctx&&ctx.pool;\nif(!pool||!mask)return;\nconst give=pool.release||pool.releaseMask||pool.free||pool.recycle;\nif(typeof give==='function')give.call(pool,mask);\n}\nfunction fillMask(mask,n,value){\nmask.fill(value,0,n);\nreturn mask;\n}\nfunction unorderable(v){\nreturn v===null||v===undefined||(typeof v==='number'&&Number.isNaN(v));\n}\nfunction coerceTarget(value,type){\nif(value===null||value===undefined)return value;\nif(type==='number')return typeof value==='number'?value:Number(value);\nif(type==='date'||type==='dateString'){\nconst iso=toIsoDate(value);\nreturn iso===null?toMillis(value):iso;\n}\nif(type==='boolean'){\nif(typeof value==='boolean')return value;\nif(value==='true'||value===1)return true;\nif(value==='false'||value===0)return false;\nreturn!!value;\n}\nreturn value;\n}\nfunction toMillis(value){\nif(value instanceof Date)return value.getTime();\nif(typeof value==='number')return value;\nreturn Date.parse(String(value));\n}\nfunction toNumber(value){\nif(typeof value==='number')return value;\nif(value instanceof Date)return value.getTime();\nif(value===null||value===undefined||value==='')return NaN;\nreturn Number(value);\n}\nfunction textOf(v,caseSensitive){\nconst s=typeof v==='string'?v:String(v);\nreturn caseSensitive?s:s.toLowerCase();\n}\nfunction setKey(v,caseSensitive){\nif(v===null||v===undefined)return NULL_KEY;\nif(typeof v==='string')return caseSensitive?v:v.toLowerCase();\nif(v instanceof Date)return v.getTime();\nreturn v;\n}\nfunction buildSet(value,caseSensitive,type){\nconst set=new Set();\nfor(const raw of toArray(value)){\nconst entry=coerceTarget(raw,type);\nset.add(setKey(entry,caseSensitive));\nif(typeof entry==='string'&&entry!==''&&Number.isFinite(Number(entry)))set.add(Number(entry));\nelse if(typeof entry==='number'&&Number.isFinite(entry))set.add(setKey(String(entry),caseSensitive));\n}\nreturn set;\n}\nfunction valueEquals(a,b,caseSensitive){\nif(a===null||a===undefined||b===null||b===undefined){\nreturn(a===null||a===undefined)&&(b===null||b===undefined);\n}\nconst ta=typeof a;\nconst tb=typeof b;\nif(ta==='string'&&tb==='string')return caseSensitive?a===b:a.toLowerCase()===b.toLowerCase();\nif(a instanceof Date||b instanceof Date)return toMillis(a)===toMillis(b);\nif(ta==='number'&&tb==='number')return a===b||(Number.isNaN(a)&&Number.isNaN(b));\nif(ta==='number'&&tb==='string')return a===Number(b);\nif(ta==='string'&&tb==='number')return Number(a)===b;\nif(ta==='boolean'||tb==='boolean')return a===b;\nif(Array.isArray(a)&&Array.isArray(b)){\nreturn a.length===b.length&&a.every((x,i)=>valueEquals(x,b[i],caseSensitive));\n}\nreturn a===b;\n}\nfunction compileRegExp(value,caseSensitive){\ntry{\nif(value instanceof RegExp){\nconst flags=value.flags.replace(/[gy]/g,'');\nreturn new RegExp(value.source,caseSensitive?flags:flags.includes('i')?flags:`${flags}i`);\n}\nreturn new RegExp(String(value),caseSensitive?'':'i');\n}catch(err){\nwarnOnce(`regex:${String(value)}`,`filter operator \"matches\" received an invalid pattern: ${String(value)}`,err);\nreturn null;\n}\n}\nfunction compilePredicate(condition,locale){\nconst predicate=compileValuePredicate(condition,locale);\nconst type=condition&&condition.type;\nif(type!=='date'&&type!=='dateString')return predicate;\nreturn(v)=>predicate(typeof v==='string'&&ISO_DAY.test(v)?v:(toIsoDate(v)??v));\n}\nfunction compileValuePredicate(condition,locale){\nconst op=condition&&condition.op;\nconst caseSensitive=!!(condition&&condition.caseSensitive);\nconst type=condition&&condition.type;\nconst cmp=valueComparator(locale);\nconst not=(p)=>(v)=>!p(v);\nswitch(op){\ncase'eq':{\nconst target=coerceTarget(condition.value,type);\nreturn(v)=>valueEquals(v,target,caseSensitive);\n}\ncase'ne':{\nconst target=coerceTarget(condition.value,type);\nreturn(v)=>!valueEquals(v,target,caseSensitive);\n}\ncase'lt':case'lte':case'gt':case'gte':{\nconst target=coerceTarget(condition.value,type);\nif(unorderable(target))return()=>false;\nconst want=op==='lt'?-1:op==='lte'?0:op==='gt'?1:2;\nreturn(v)=>{\nif(unorderable(v))return false;\nconst c=cmp(v,target);\nreturn want===-1?c<0:want===0?c<=0:want===1?c>0:c>=0;\n};\n}\ncase'between':case'notBetween':{\nconst pair=toArray(condition.value);\nconst lo=coerceTarget(pair[0],type);\nconst hi=coerceTarget(pair[1],type);\nconst bounds=condition.bounds||'[]';\nconst loInclusive=bounds.charAt(0)!=='(';\nconst hiInclusive=bounds.charAt(1)!==')';\nif(unorderable(lo)||unorderable(hi))return op==='between'?()=>false:()=>true;\nconst inRange=(v)=>{\nif(unorderable(v))return false;\nconst a=cmp(v,lo);\nconst b=cmp(v,hi);\nreturn(loInclusive?a>=0:a>0)&&(hiInclusive?b<=0:b<0);\n};\nreturn op==='between'?inRange:not(inRange);\n}\ncase'in':case'notIn':{\nconst set=buildSet(condition.value,caseSensitive,type);\nconst member=(v)=>set.has(setKey(v,caseSensitive));\nreturn op==='in'?member:not(member);\n}\ncase'contains':case'notContains':{\nconst needle=textOf(coerceTarget(condition.value,type),caseSensitive);\nconst has=(v)=>(v===null||v===undefined?false:textOf(v,caseSensitive).includes(needle));\nreturn op==='contains'?has:not(has);\n}\ncase'startsWith':{\nconst needle=textOf(coerceTarget(condition.value,type),caseSensitive);\nreturn(v)=>(v===null||v===undefined?false:textOf(v,caseSensitive).startsWith(needle));\n}\ncase'endsWith':{\nconst needle=textOf(coerceTarget(condition.value,type),caseSensitive);\nreturn(v)=>(v===null||v===undefined?false:textOf(v,caseSensitive).endsWith(needle));\n}\ncase'matches':{\nconst re=compileRegExp(condition.value,caseSensitive);\nif(!re)return()=>false;\nreturn(v)=>(v===null||v===undefined?false:re.test(String(v)));\n}\ncase'blank':\nreturn(v)=>isBlank(v)||(Array.isArray(v)&&v.length===0);\ncase'notBlank':\nreturn(v)=>!(isBlank(v)||(Array.isArray(v)&&v.length===0));\ncase'containsAny':case'containsNone':{\nconst set=buildSet(condition.value,caseSensitive,type);\nconst any=(v)=>{\nconst list=v===null||v===undefined?[]:toArray(v);\nfor(let i=0;i<list.length;i++)if(set.has(setKey(list[i],caseSensitive)))return true;\nreturn false;\n};\nreturn op==='containsAny'?any:not(any);\n}\ncase'containsAll':{\nconst wanted=toArray(condition.value).map((x)=>setKey(coerceTarget(x,type),caseSensitive));\nreturn(v)=>{\nconst list=v===null||v===undefined?[]:toArray(v);\nif(wanted.length===0)return true;\nconst have=new Set(list.map((x)=>setKey(x,caseSensitive)));\nfor(let i=0;i<wanted.length;i++)if(!have.has(wanted[i]))return false;\nreturn true;\n};\n}\ndefault:\nwarnOnce(`op:${String(op)}`,`unknown filter operator \"${String(op)}\"; the condition passes every row`);\nreturn()=>true;\n}\n}\nfunction testValue(value,condition,locale){\nreturn compilePredicate(condition,locale)(value);\n}\nfunction presenceCondition(handle,wantPresent,mask,count){\nconst present=presenceReader(handle);\nif(present){\nconst target=wantPresent?1:0;\nfor(let i=0;i<count;i++)mask[i]=present(i)===target?1:0;\nreturn mask;\n}\nconst kind=handle.kind;\nif(kind==='float64'||kind==='int32'||kind==='bitset'){\nreturn fillMask(mask,count,wantPresent?1:0);\n}\nconst read=valueReader(handle);\nfor(let i=0;i<count;i++){\nconst v=read(i);\nconst blank=isBlank(v)||(Array.isArray(v)&&v.length===0);\nmask[i]=blank===wantPresent?0:1;\n}\nreturn mask;\n}\nfunction dictionaryCondition(handle,pred,mask,count){\nconst dict=handle.dict;\nconst size=dictSize(dict);\nconst allowed=new Uint8Array(size);\nfor(let code=0;code<size;code++)allowed[code]=pred(dictValue(dict,code))?1:0;\nconst codes=handle.values;\nconst present=presenceReader(handle);\nif(!present){\nfor(let i=0;i<count;i++)mask[i]=allowed[codes[i]];\nreturn mask;\n}\nconst absentAnswer=pred(null)?1:0;\nfor(let i=0;i<count;i++)mask[i]=present(i)===1?allowed[codes[i]]:absentAnswer;\nreturn mask;\n}\nfunction booleanCondition(handle,pred,mask,count){\nconst bit=bitReader(handle.values);\nconst whenTrue=pred(true)?1:0;\nconst whenFalse=pred(false)?1:0;\nconst present=presenceReader(handle);\nif(!present){\nfor(let i=0;i<count;i++)mask[i]=bit(i)===1?whenTrue:whenFalse;\nreturn mask;\n}\nconst absentAnswer=pred(null)?1:0;\nfor(let i=0;i<count;i++){\nmask[i]=present(i)===0?absentAnswer:(bit(i)===1?whenTrue:whenFalse);\n}\nreturn mask;\n}\nfunction numericCondition(handle,condition,pred,mask,count){\nconst values=handle.values;\nconst type=condition.type;\nconst op=condition.op;\nlet handled=true;\nswitch(op){\ncase'eq':case'ne':{\nconst target=toNumber(coerceTarget(condition.value,type));\nconst wantNaN=typeof condition.value==='number'&&Number.isNaN(condition.value);\nconst invert=op==='ne'?1:0;\nif(wantNaN){\nfor(let i=0;i<count;i++)mask[i]=(Number.isNaN(values[i])?1:0)^invert;\n}else{\nfor(let i=0;i<count;i++)mask[i]=((values[i]===target)?1:0)^invert;\n}\nbreak;\n}\ncase'lt':{\nconst t=toNumber(coerceTarget(condition.value,type));\nfor(let i=0;i<count;i++)mask[i]=values[i]<t?1:0;\nbreak;\n}\ncase'lte':{\nconst t=toNumber(coerceTarget(condition.value,type));\nfor(let i=0;i<count;i++)mask[i]=values[i]<=t?1:0;\nbreak;\n}\ncase'gt':{\nconst t=toNumber(coerceTarget(condition.value,type));\nfor(let i=0;i<count;i++)mask[i]=values[i]>t?1:0;\nbreak;\n}\ncase'gte':{\nconst t=toNumber(coerceTarget(condition.value,type));\nfor(let i=0;i<count;i++)mask[i]=values[i]>=t?1:0;\nbreak;\n}\ncase'between':case'notBetween':{\nconst pair=toArray(condition.value);\nconst lo=toNumber(coerceTarget(pair[0],type));\nconst hi=toNumber(coerceTarget(pair[1],type));\nconst bounds=condition.bounds||'[]';\nconst loInclusive=bounds.charAt(0)!=='(';\nconst hiInclusive=bounds.charAt(1)!==')';\nconst invert=op==='notBetween'?1:0;\nif(loInclusive&&hiInclusive){\nfor(let i=0;i<count;i++)mask[i]=(((values[i]>=lo)&(values[i]<=hi))?1:0)^invert;\n}else if(loInclusive){\nfor(let i=0;i<count;i++)mask[i]=(((values[i]>=lo)&(values[i]<hi))?1:0)^invert;\n}else if(hiInclusive){\nfor(let i=0;i<count;i++)mask[i]=(((values[i]>lo)&(values[i]<=hi))?1:0)^invert;\n}else{\nfor(let i=0;i<count;i++)mask[i]=(((values[i]>lo)&(values[i]<hi))?1:0)^invert;\n}\nbreak;\n}\ncase'in':case'notIn':{\nconst set=new Set();\nfor(const raw of toArray(condition.value)){\nconst n=toNumber(coerceTarget(raw,type));\nif(!Number.isNaN(n))set.add(n);\n}\nconst invert=op==='notIn'?1:0;\nfor(let i=0;i<count;i++)mask[i]=(set.has(values[i])?1:0)^invert;\nbreak;\n}\ndefault:\nhandled=false;\nbreak;\n}\nif(!handled)return false;\nconst present=presenceReader(handle);\nif(present){\nconst absentAnswer=pred(null)?1:0;\nfor(let i=0;i<count;i++)if(present(i)===0)mask[i]=absentAnswer;\n}\nreturn true;\n}\nfunction genericCondition(handle,pred,mask,count){\nconst read=valueReader(handle);\nfor(let i=0;i<count;i++)mask[i]=pred(read(i))?1:0;\nreturn mask;\n}\nfunction evaluateCondition(condition,ctx,out){\nconst count=ctx.count|0;\nconst mask=out||acquireMask(ctx,count);\nif(!condition)return fillMask(mask,count,1);\nconst handle=typeof ctx.handle==='function'?ctx.handle(condition.col):undefined;\nconst custom=typeof ctx.custom==='function'?ctx.custom:null;\nif(!handle){\nif(custom){\nfor(let i=0;i<count;i++)mask[i]=custom(condition,i)?1:0;\nreturn mask;\n}\nwarnOnce(`filter:col:${String(condition.col)}`,\n`filter references unknown column \"${String(condition.col)}\"; the condition passes every row`);\nreturn fillMask(mask,count,1);\n}\nconst op=condition.op;\nif(op==='blank'||op==='notBlank')return presenceCondition(handle,op==='notBlank',mask,count);\nconst pred=compilePredicate(condition,ctx.locale);\nswitch(handle.kind){\ncase'dictionary':\nreturn dictionaryCondition(handle,pred,mask,count);\ncase'bitset':\nreturn booleanCondition(handle,pred,mask,count);\ncase'float64':case'int32':\nif(numericCondition(handle,condition,pred,mask,count))return mask;\nreturn genericCondition(handle,pred,mask,count);\ndefault:\nreturn genericCondition(handle,pred,mask,count);\n}\n}\nfunction evaluateNode(node,ctx,count){\nif(!node)return fillMask(acquireMask(ctx,count),count,1);\nif(Array.isArray(node.conditions)){\nconst children=node.conditions.filter((c)=>c!=null);\nconst op=node.op==='or'?'or':node.op==='not'?'not':'and';\nif(children.length===0)return fillMask(acquireMask(ctx,count),count,1);\nconst acc=evaluateNode(children[0],ctx,count);\nfor(let k=1;k<children.length;k++){\nconst rhs=evaluateNode(children[k],ctx,count);\nif(op==='or')for(let i=0;i<count;i++)acc[i]|=rhs[i];\nelse for(let i=0;i<count;i++)acc[i]&=rhs[i];\nreleaseMask(ctx,rhs);\n}\nif(op==='not')for(let i=0;i<count;i++)acc[i]^=1;\nreturn acc;\n}\nreturn evaluateCondition(node,ctx,acquireMask(ctx,count));\n}\nfunction evaluateFilters(filters,ctx){\nreturn evaluateNode(filters,ctx,ctx.count|0);\n}\nfunction pruneColumn(filters,colId){\nif(!filters||!colId)return filters||null;\nconst node=(filters);\nif(Array.isArray(node.conditions)){\nconst op=node.op==='or'?'or':node.op==='not'?'not':'and';\nif(op!=='and'){\nreturn mentionsColumn(node,colId)?null:filters;\n}\nconst kept=[];\nfor(const child of node.conditions){\nconst pruned=pruneColumn(child,colId);\nif(pruned)kept.push(pruned);\n}\nif(!kept.length)return null;\nreturn{...node,op:'and',conditions:kept};\n}\nreturn node.col===colId?null:filters;\n}\nfunction mentionsColumn(filters,colId){\nif(!filters||typeof filters!=='object')return false;\nconst node=(filters);\nif(node.col===colId)return true;\nif(Array.isArray(node.conditions)){\nfor(const child of node.conditions)if(mentionsColumn(child,colId))return true;\n}\nreturn false;\n}\nfunction compact(mask,count,out){\nif(out&&out.length>=count){\nlet k=0;\nfor(let i=0;i<count;i++)if(mask[i])out[k++]=i;\nreturn out.subarray(0,k);\n}\nlet survivors=0;\nfor(let i=0;i<count;i++)survivors+=mask[i]?1:0;\nconst result=new Uint32Array(survivors);\nlet k=0;\nfor(let i=0;i<count;i++)if(mask[i])result[k++]=i;\nreturn result;\n}\n});\n__def(\"packages/core/src/compute/group.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"packKeys\",{enumerable:true,get:function(){return packKeys;}});\nObject.defineProperty(__exports,\"groupByColumns\",{enumerable:true,get:function(){return groupByColumns;}});\nconst __m0=__req(\"packages/core/src/compute/handle.js\");\nconst dictSize=__m0[\"dictSize\"];\nconst identity=__m0[\"identity\"];\nconst presenceReader=__m0[\"presenceReader\"];\nconst rowCount=__m0[\"rowCount\"];\nconst valueReader=__m0[\"valueReader\"];\nconst KEY_SEPARATOR='\\u001F';\nconst NULL_MARKER='\\u0000';\nconst MAX_DIRECT_COUNTS=1<<20;\nfunction packKeys(handles,idx,n){\nconst k=handles.length;\nconst readers=handles.map((h)=>valueReader(h));\nconst allDictionary=k>0&&handles.every((h)=>h&&h.kind==='dictionary'&&h.dict);\nif(allDictionary){\nconst cards=handles.map((h)=>dictSize(h.dict)+1);\nlet product=1;\nfor(let j=0;j<k;j++)product*=cards[j];\nif(product<=Number.MAX_SAFE_INTEGER){\nconst codes=handles.map((h)=>h.values);\nconst presence=handles.map((h)=>presenceReader(h));\nconst keyOf=(row)=>{\nlet key=0;\nfor(let j=0;j<k;j++){\nconst present=presence[j];\nconst code=present&&present(row)===0?cards[j]-1:codes[j][row];\nkey=key*cards[j]+code;\n}\nreturn key;\n};\nconst packed=new Float64Array(n);\nfor(let i=0;i<n;i++)packed[i]=keyOf(idx[i]);\nreturn{packed,strings:null,product,readers,keyOf};\n}\n}\nconst keyOf=(row)=>{\nlet key='';\nfor(let j=0;j<k;j++){\nconst v=readers[j](row);\nkey+=(j===0?'':KEY_SEPARATOR)+(v===null||v===undefined?NULL_MARKER:String(v));\n}\nreturn key;\n};\nconst strings=new Array(n);\nfor(let i=0;i<n;i++)strings[i]=keyOf(idx[i]);\nreturn{packed:null,strings,product:Infinity,readers,keyOf};\n}\nfunction scatterBuckets(idx,ids,n,groups){\nconst offsets=new Uint32Array(groups+1);\nfor(let i=0;i<n;i++)offsets[ids[i]+1]++;\nfor(let g=0;g<groups;g++)offsets[g+1]+=offsets[g];\nconst scattered=new Uint32Array(n);\nconst cursor=offsets.slice(0,groups);\nfor(let i=0;i<n;i++)scattered[cursor[ids[i]]++]=idx[i];\nconst buckets=new Array(groups);\nfor(let g=0;g<groups;g++)buckets[g]=scattered.subarray(offsets[g],offsets[g+1]);\nreturn buckets;\n}\nfunction groupByColumns(handles,order,opts={}){\nconst list=handles||[];\nconst idx=order||identity(rowCount(list[0],opts));\nconst n=idx.length;\nif(list.length===0||n===0)return{keys:[],buckets:[]};\nconst{packed,strings,product,readers}=packKeys(list,idx,n);\nconst ids=new Uint32Array(n);\nlet groups=0;\nlet packedKeys=null;\nif(packed&&product<=Math.max(1024,Math.min(MAX_DIRECT_COUNTS,n*4))){\nconst size=product;\nconst seen=new Int32Array(size).fill(-1);\nfor(let i=0;i<n;i++)seen[packed[i]]=0;\nfor(let key=0;key<size;key++)if(seen[key]===0)seen[key]=groups++;\nfor(let i=0;i<n;i++)ids[i]=seen[packed[i]];\npackedKeys=new Float64Array(groups);\nfor(let key=0;key<size;key++)if(seen[key]>=0)packedKeys[seen[key]]=key;\n}else if(packed){\nconst seen=new Map();\nfor(let i=0;i<n;i++){\nconst key=packed[i];\nlet id=seen.get(key);\nif(id===undefined){id=groups++;seen.set(key,id);}\nids[i]=id;\n}\npackedKeys=new Float64Array(groups);\nfor(const[key,id]of seen)packedKeys[id]=key;\n}else{\nconst seen=new Map();\nfor(let i=0;i<n;i++){\nconst key=strings[i];\nlet id=seen.get(key);\nif(id===undefined){id=groups++;seen.set(key,id);}\nids[i]=id;\n}\n}\nconst buckets=scatterBuckets(idx,ids,n,groups);\nconst keys=new Array(groups);\nfor(let g=0;g<groups;g++){\nconst row=buckets[g][0];\nconst tuple=new Array(readers.length);\nfor(let j=0;j<readers.length;j++)tuple[j]=readers[j](row);\nkeys[g]=tuple;\n}\nconst result={keys,buckets};\nif(packedKeys)result.packed=packedKeys;\nreturn result;\n}\n});\n__def(\"packages/core/src/compute/facet.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"STRATEGIES\",{enumerable:true,get:function(){return STRATEGIES;}});\nObject.defineProperty(__exports,\"GRANULARITIES\",{enumerable:true,get:function(){return GRANULARITIES;}});\nObject.defineProperty(__exports,\"DEFAULT_BUCKETS\",{enumerable:true,get:function(){return DEFAULT_BUCKETS;}});\nObject.defineProperty(__exports,\"DEFAULT_CARDINALITY_LIMIT\",{enumerable:true,get:function(){return DEFAULT_CARDINALITY_LIMIT;}});\nObject.defineProperty(__exports,\"QUANTILE_SAMPLE\",{enumerable:true,get:function(){return QUANTILE_SAMPLE;}});\nObject.defineProperty(__exports,\"facetKind\",{enumerable:true,get:function(){return facetKind;}});\nObject.defineProperty(__exports,\"orderedReader\",{enumerable:true,get:function(){return orderedReader;}});\nObject.defineProperty(__exports,\"toNumeric\",{enumerable:true,get:function(){return toNumeric;}});\nObject.defineProperty(__exports,\"cardinalityOf\",{enumerable:true,get:function(){return cardinalityOf;}});\nObject.defineProperty(__exports,\"pickGranularity\",{enumerable:true,get:function(){return pickGranularity;}});\nObject.defineProperty(__exports,\"floorTo\",{enumerable:true,get:function(){return floorTo;}});\nObject.defineProperty(__exports,\"advance\",{enumerable:true,get:function(){return advance;}});\nObject.defineProperty(__exports,\"computeBounds\",{enumerable:true,get:function(){return computeBounds;}});\nObject.defineProperty(__exports,\"countInto\",{enumerable:true,get:function(){return countInto;}});\nObject.defineProperty(__exports,\"bucketOf\",{enumerable:true,get:function(){return bucketOf;}});\nObject.defineProperty(__exports,\"facet\",{enumerable:true,get:function(){return facet;}});\nObject.defineProperty(__exports,\"default\",{enumerable:true,get:function(){return __default;}});\nconst __m0=__req(\"packages/core/src/compute/handle.js\");\nconst presenceReader=__m0[\"presenceReader\"];\nconst valueReader=__m0[\"valueReader\"];\nconst dictSize=__m0[\"dictSize\"];\nconst dictValue=__m0[\"dictValue\"];\nconst STRATEGIES=Object.freeze(['equal','quantile','log']);\nconst GRANULARITIES=Object.freeze(['hour','day','week','month','quarter','year']);\nconst DEFAULT_BUCKETS=20;\nconst DEFAULT_CARDINALITY_LIMIT=50;\nconst QUANTILE_SAMPLE=10_000;\nfunction facetKind(handle,type){\nif(!handle)return'none';\nconst base=type&&type.base;\nif(base==='date'||base==='datetime'||base==='time'||base==='dateString')return'date';\nswitch(handle.kind){\ncase'bitset':return'boolean';\ncase'float64':case'int32':return'numeric';\ncase'dictionary':return'category';\ncase'multi':return'category';\ndefault:\nif(base==='number')return'numeric';\nif(base==='boolean')return'boolean';\nif(base==='text')return'category';\nreturn'none';\n}\n}\nfunction orderedReader(handle){\nconst values=handle.values;\nconst kind=handle.kind;\nif((kind==='float64'||kind==='int32')&&values)return(i)=>values[i];\nconst read=valueReader(handle);\nreturn(i)=>toNumeric(read(i));\n}\nfunction toNumeric(v){\nif(typeof v==='number')return v;\nif(v instanceof Date)return v.getTime();\nif(v===null||v===undefined||v==='')return NaN;\nif(typeof v==='boolean')return v?1:0;\nif(typeof v==='string'){\nconst n=Number(v);\nif(Number.isFinite(n))return n;\nconst t=Date.parse(v);\nreturn Number.isFinite(t)?t:NaN;\n}\nreturn NaN;\n}\nfunction cardinalityOf(handle,indices,count,limit=DEFAULT_CARDINALITY_LIMIT){\nif(!handle)return{cardinality:0,exact:true};\nif(handle.dict)return{cardinality:dictSize(handle.dict),exact:true};\nif(handle.kind==='bitset')return{cardinality:2,exact:true};\nconst read=valueReader(handle);\nconst n=indices?indices.length:count;\nconst seen=new Set();\nfor(let k=0;k<n;k++){\nconst v=read(indices?indices[k]:k);\nif(v===null||v===undefined)continue;\nseen.add(v);\nif(seen.size>limit)return{cardinality:seen.size,exact:false};\n}\nreturn{cardinality:seen.size,exact:true};\n}\nconst HOUR_MS=3600_000;\nconst DAY_MS=86_400_000;\nfunction pickGranularity(span,target=DEFAULT_BUCKETS){\nconst ms=Number.isFinite(span)&&span>0?span:0;\nconst wide=Math.max(1,target)*2;\nif(ms/HOUR_MS<=wide)return'hour';\nif(ms/DAY_MS<=wide)return'day';\nif(ms/(7*DAY_MS)<=wide)return'week';\nif(ms/(30*DAY_MS)<=wide)return'month';\nif(ms/(91*DAY_MS)<=wide)return'quarter';\nreturn'year';\n}\nfunction floorTo(ms,granularity){\nif(!Number.isFinite(ms))return NaN;\nconst d=new Date(ms);\nswitch(granularity){\ncase'hour':d.setMinutes(0,0,0);return d.getTime();\ncase'day':d.setHours(0,0,0,0);return d.getTime();\ncase'week':{\nd.setHours(0,0,0,0);\nconst back=(d.getDay()+6)%7;\nd.setDate(d.getDate()-back);\nreturn d.getTime();\n}\ncase'month':d.setDate(1);d.setHours(0,0,0,0);return d.getTime();\ncase'quarter':\nd.setMonth(Math.floor(d.getMonth()/3)*3,1);\nd.setHours(0,0,0,0);\nreturn d.getTime();\ndefault:d.setMonth(0,1);d.setHours(0,0,0,0);return d.getTime();\n}\n}\nfunction advance(ms,granularity){\nconst d=new Date(ms);\nswitch(granularity){\ncase'hour':d.setHours(d.getHours()+1);break;\ncase'day':d.setDate(d.getDate()+1);break;\ncase'week':d.setDate(d.getDate()+7);break;\ncase'month':d.setMonth(d.getMonth()+1);break;\ncase'quarter':d.setMonth(d.getMonth()+3);break;\ndefault:d.setFullYear(d.getFullYear()+1);break;\n}\nreturn d.getTime();\n}\nfunction numericExtent(handle,indices,count){\nconst read=orderedReader(handle);\nconst present=presenceReader(handle);\nconst n=indices?indices.length:count;\nlet min=Infinity;\nlet max=-Infinity;\nlet nulls=0;\nlet finite=0;\nfor(let k=0;k<n;k++){\nconst i=indices?indices[k]:k;\nif(present&&!present(i)){nulls++;continue;}\nconst v=read(i);\nif(!Number.isFinite(v)){nulls++;continue;}\nif(v<min)min=v;\nif(v>max)max=v;\nfinite++;\n}\nreturn{min,max,nulls,finite};\n}\nfunction sortedSample(handle,indices,count,cap){\nconst read=orderedReader(handle);\nconst present=presenceReader(handle);\nconst n=indices?indices.length:count;\nconst step=n>cap?n/cap:1;\nconst out=[];\nfor(let s=0;s<n;s+=step){\nconst i=indices?indices[Math.floor(s)]:Math.floor(s);\nif(present&&!present(i))continue;\nconst v=read(i);\nif(Number.isFinite(v))out.push(v);\n}\nconst arr=Float64Array.from(out);\narr.sort();\nreturn arr;\n}\nfunction computeBounds(handle,indices,count,opts={}){\nconst kind=opts.kind||facetKind(handle,opts.type);\nif(kind==='none'||!handle)return{kind:'none',buckets:[],suppressed:'type'};\nif(kind==='boolean')return boundsForBoolean(handle,indices,count);\nif(kind==='category')return boundsForCategory(handle,indices,count,opts);\nreturn boundsForOrdered(handle,indices,count,kind,opts);\n}\nfunction boundsForBoolean(handle,indices,count){\nconst present=presenceReader(handle);\nlet nulls=0;\nif(present){\nconst n=indices?indices.length:count;\nfor(let k=0;k<n;k++)if(!present(indices?indices[k]:k))nulls++;\n}\nconst buckets=[{value:false,label:'false'},{value:true,label:'true'}];\nif(nulls>0)buckets.push({null:true,label:'Empty'});\nreturn{kind:'boolean',buckets};\n}\nfunction boundsForCategory(handle,indices,count,opts){\nconst limit=opts.cardinalityLimit??DEFAULT_CARDINALITY_LIMIT;\nconst{cardinality}=cardinalityOf(handle,indices,count,limit);\nif(cardinality>limit&&(opts.aboveLimit||'suppress')==='suppress'){\nreturn{kind:'category',buckets:[],suppressed:'cardinality',cardinality};\n}\nconst read=valueReader(handle);\nconst n=indices?indices.length:count;\nconst tally=new Map();\nlet nulls=0;\nfor(let k=0;k<n;k++){\nconst v=read(indices?indices[k]:k);\nif(v===null||v===undefined||v===''){nulls++;continue;}\nif(Array.isArray(v)){\nif(!v.length){nulls++;continue;}\nfor(const m of v)tally.set(m,(tally.get(m)||0)+1);\ncontinue;\n}\ntally.set(v,(tally.get(v)||0)+1);\n}\nlet entries=[...tally.entries()];\nif(opts.order==='alpha'){\nentries.sort((a,b)=>String(a[0]).localeCompare(String(b[0])));\n}else{\nentries.sort((a,b)=>b[1]-a[1]);\n}\nlet remainder=0;\nlet dropped=0;\nif(entries.length>limit){\ndropped=entries.length-limit;\nfor(let i=limit;i<entries.length;i++)remainder+=entries[i][1];\nentries=entries.slice(0,limit);\n}\nconst buckets=entries.map(([value])=>({value,label:String(value)}));\nif(remainder>0)buckets.push({remainder:true,label:`Other (${dropped} values)`});\nif(nulls>0)buckets.push({null:true,label:'Empty'});\nreturn{kind:'category',buckets,cardinality};\n}\nfunction boundsForOrdered(handle,indices,count,kind,opts){\nconst{min,max,nulls,finite}=numericExtent(handle,indices,count);\nif(!finite){\nreturn{kind,buckets:nulls?[{null:true,label:'Empty'}]:[],empty:true};\n}\nconst wanted=Math.max(1,Math.floor(opts.buckets||DEFAULT_BUCKETS));\nlet buckets=[];\nif(kind==='date'){\nconst granularity=GRANULARITIES.includes(opts.granularity)\n?opts.granularity:pickGranularity(max-min,wanted);\nlet edge=floorTo(min,granularity);\nwhile(edge<=max&&buckets.length<4096){\nconst next=advance(edge,granularity);\nif(!(next>edge))break;\nbuckets.push({from:edge,to:next});\nedge=next;\n}\nreturn{kind,buckets:withNull(buckets,nulls),granularity};\n}\nconst strategy=STRATEGIES.includes(opts.strategy)?opts.strategy:'equal';\nif(strategy==='quantile'){\nconst sample=sortedSample(handle,indices,count,QUANTILE_SAMPLE);\nif(sample.length){\nconst edges=[sample[0]];\nfor(let b=1;b<wanted;b++){\nconst v=sample[Math.min(sample.length-1,Math.floor((b/wanted)*sample.length))];\nif(v>edges[edges.length-1])edges.push(v);\n}\nedges.push(max);\nfor(let b=0;b<edges.length-1;b++)buckets.push({from:edges[b],to:edges[b+1]});\n}\n}else if(strategy==='log'&&min>0){\nconst lo=Math.log10(min);\nconst hi=Math.log10(max);\nconst step=(hi-lo)/wanted||1;\nfor(let b=0;b<wanted;b++){\nbuckets.push({from:10**(lo+b*step),to:10**(lo+(b+1)*step)});\n}\n}\nif(!buckets.length){\nconst width=(max-min)/wanted||1;\nfor(let b=0;b<wanted;b++)buckets.push({from:min+b*width,to:min+(b+1)*width});\n}\nbuckets[buckets.length-1].to=max;\nreturn{kind,buckets:withNull(buckets,nulls),strategy,min,max};\n}\nfunction withNull(buckets,nulls){\nreturn nulls>0?[...buckets,{null:true,label:'Empty'}]:buckets;\n}\nfunction countInto(handle,indices,count,bounds,out){\nconst buckets=(bounds&&bounds.buckets)||[];\nconst counts=out&&out.length>=buckets.length?out.subarray(0,buckets.length)\n:new Uint32Array(buckets.length);\ncounts.fill(0);\nif(!handle||!buckets.length)return counts;\nconst nullBucket=buckets.length-1;\nconst hasNull=!!buckets[nullBucket]&&buckets[nullBucket].null===true;\nconst n=indices?indices.length:count;\nif(bounds.kind==='boolean'){\nconst read=valueReader(handle);\nfor(let k=0;k<n;k++){\nconst v=read(indices?indices[k]:k);\nif(v===null||v===undefined){if(hasNull)counts[nullBucket]++;continue;}\ncounts[v?1:0]++;\n}\nreturn counts;\n}\nif(bounds.kind==='category'){\nconst slot=new Map();\nfor(let b=0;b<buckets.length;b++){\nif(!buckets[b].null&&!buckets[b].remainder)slot.set(buckets[b].value,b);\n}\nconst remainderAt=buckets.findIndex((b)=>b.remainder);\nconst read=valueReader(handle);\nfor(let k=0;k<n;k++){\nconst v=read(indices?indices[k]:k);\nif(v===null||v===undefined||v===''){if(hasNull)counts[nullBucket]++;continue;}\nif(Array.isArray(v)){\nif(!v.length){if(hasNull)counts[nullBucket]++;continue;}\nfor(const m of v){\nconst at=slot.get(m);\nif(at!==undefined)counts[at]++;\nelse if(remainderAt>=0)counts[remainderAt]++;\n}\ncontinue;\n}\nconst at=slot.get(v);\nif(at!==undefined)counts[at]++;\nelse if(remainderAt>=0)counts[remainderAt]++;\n}\nreturn counts;\n}\nconst ordered=hasNull?buckets.length-1:buckets.length;\nconst edges=new Float64Array(ordered+1);\nfor(let b=0;b<ordered;b++)edges[b]=buckets[b].from;\nedges[ordered]=ordered?buckets[ordered-1].to:0;\nconst read=orderedReader(handle);\nconst present=presenceReader(handle);\nfor(let k=0;k<n;k++){\nconst i=indices?indices[k]:k;\nif(present&&!present(i)){if(hasNull)counts[nullBucket]++;continue;}\nconst v=read(i);\nif(!Number.isFinite(v)){if(hasNull)counts[nullBucket]++;continue;}\nconst at=bucketOf(edges,ordered,v);\nif(at>=0)counts[at]++;\n}\nreturn counts;\n}\nfunction bucketOf(edges,ordered,v){\nif(!ordered)return-1;\nif(v<edges[0])return-1;\nif(v>=edges[ordered])return v===edges[ordered]?ordered-1:-1;\nlet lo=0;\nlet hi=ordered-1;\nwhile(lo<hi){\nconst mid=(lo+hi+1)>>>1;\nif(v>=edges[mid])lo=mid;else hi=mid-1;\n}\nreturn lo;\n}\nfunction facet(handle,indices,count,opts={}){\nconst bounds=opts.bounds||computeBounds(handle,opts.boundsIndices??indices,count,opts);\nreturn{bounds,counts:countInto(handle,indices,count,bounds)};\n}\nconst __default=facet;\n});\n__def(\"packages/core/src/compute/statistics.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"KENDALL_LIMIT\",{enumerable:true,get:function(){return KENDALL_LIMIT;}});\nObject.defineProperty(__exports,\"MAINTENANCE\",{enumerable:true,get:function(){return MAINTENANCE;}});\nObject.defineProperty(__exports,\"numbers\",{enumerable:true,get:function(){return numbers;}});\nObject.defineProperty(__exports,\"frequencies\",{enumerable:true,get:function(){return frequencies;}});\nObject.defineProperty(__exports,\"herfindahl\",{enumerable:true,get:function(){return herfindahl;}});\nObject.defineProperty(__exports,\"entropy\",{enumerable:true,get:function(){return entropy;}});\nObject.defineProperty(__exports,\"evenness\",{enumerable:true,get:function(){return evenness;}});\nObject.defineProperty(__exports,\"topShare\",{enumerable:true,get:function(){return topShare;}});\nObject.defineProperty(__exports,\"gini\",{enumerable:true,get:function(){return gini;}});\nObject.defineProperty(__exports,\"moments\",{enumerable:true,get:function(){return moments;}});\nObject.defineProperty(__exports,\"quantileSorted\",{enumerable:true,get:function(){return quantileSorted;}});\nObject.defineProperty(__exports,\"quantile\",{enumerable:true,get:function(){return quantile;}});\nObject.defineProperty(__exports,\"STAT_FNS\",{enumerable:true,get:function(){return STAT_FNS;}});\nObject.defineProperty(__exports,\"STAT_LABELS\",{enumerable:true,get:function(){return STAT_LABELS;}});\nObject.defineProperty(__exports,\"weightedAverage\",{enumerable:true,get:function(){return weightedAverage;}});\nObject.defineProperty(__exports,\"extremeRow\",{enumerable:true,get:function(){return extremeRow;}});\nObject.defineProperty(__exports,\"correlation\",{enumerable:true,get:function(){return correlation;}});\nObject.defineProperty(__exports,\"trimmedMean\",{enumerable:true,get:function(){return trimmedMean;}});\nObject.defineProperty(__exports,\"winsorizedMean\",{enumerable:true,get:function(){return winsorizedMean;}});\nObject.defineProperty(__exports,\"modifiedZOutliers\",{enumerable:true,get:function(){return modifiedZOutliers;}});\nObject.defineProperty(__exports,\"jarqueBera\",{enumerable:true,get:function(){return jarqueBera;}});\nObject.defineProperty(__exports,\"weightedQuantile\",{enumerable:true,get:function(){return weightedQuantile;}});\nObject.defineProperty(__exports,\"pairs\",{enumerable:true,get:function(){return pairs;}});\nObject.defineProperty(__exports,\"covariance\",{enumerable:true,get:function(){return covariance;}});\nObject.defineProperty(__exports,\"regression\",{enumerable:true,get:function(){return regression;}});\nObject.defineProperty(__exports,\"spearman\",{enumerable:true,get:function(){return spearman;}});\nObject.defineProperty(__exports,\"kendall\",{enumerable:true,get:function(){return kendall;}});\nObject.defineProperty(__exports,\"seriesStats\",{enumerable:true,get:function(){return seriesStats;}});\nObject.defineProperty(__exports,\"D2_N2\",{enumerable:true,get:function(){return D2_N2;}});\nObject.defineProperty(__exports,\"withinSigma\",{enumerable:true,get:function(){return withinSigma;}});\nObject.defineProperty(__exports,\"capability\",{enumerable:true,get:function(){return capability;}});\nObject.defineProperty(__exports,\"controlLimits\",{enumerable:true,get:function(){return controlLimits;}});\nObject.defineProperty(__exports,\"controlViolations\",{enumerable:true,get:function(){return controlViolations;}});\nObject.defineProperty(__exports,\"countOutside\",{enumerable:true,get:function(){return countOutside;}});\nObject.defineProperty(__exports,\"histogram\",{enumerable:true,get:function(){return histogram;}});\nconst __m0=__req(\"packages/core/src/compute/handle.js\");\nconst presenceReader=__m0[\"presenceReader\"];\nconst valueReader=__m0[\"valueReader\"];\nconst KENDALL_LIMIT=5000;\nconst MAINTENANCE=Object.freeze({\nvariance:'maintained',\nvarianceP:'maintained',\nstddev:'maintained',\nstddevP:'maintained',\nsumSquares:'maintained',\nweightedAvg:'maintained',\nmedian:'rescan',\np25:'rescan',\np75:'rescan',\np90:'rescan',\np95:'rescan',\np99:'rescan',\niqr:'rescan',\nmode:'rescan',\ndistinct:'rescan',\nrange:'rescan',\nskewness:'rescan',\nkurtosis:'rescan',\ngeomean:'rescan',\nharmean:'rescan',\nmad:'rescan',\nargmin:'rescan',\nargmax:'rescan',\nhhi:'rescan',\nentropy:'rescan',\nevenness:'rescan',\ntop3Share:'rescan',\ntop10Share:'rescan',\ngini:'rescan',\ntrimmedMean:'rescan',\nwinsorizedMean:'rescan',\nrobustOutliers:'rescan',\njarqueBera:'rescan',\n});\nfunction numbers(handle,indices){\nconst n=indices.length;\nconst out=new Float64Array(n);\nlet count=0;\nconst numeric=handle&&(handle.kind==='float64'||handle.kind==='int32');\nif(numeric){\nconst values=handle.values;\nconst present=presenceReader(handle);\nfor(let i=0;i<n;i++){\nconst row=indices[i];\nif(present&&present(row)!==1)continue;\nconst v=values[row];\nif(Number.isNaN(v))continue;\nout[count++]=v;\n}\nreturn out.subarray(0,count);\n}\nconst read=valueReader(handle);\nfor(let i=0;i<n;i++){\nconst raw=read(indices[i]);\nif(raw===null||raw===undefined||raw==='')continue;\nconst v=typeof raw==='number'?raw:Number(raw);\nif(!Number.isFinite(v))continue;\nout[count++]=v;\n}\nreturn out.subarray(0,count);\n}\nfunction frequencies(handle,indices){\nconst seen=new Map();\nconst read=valueReader(handle);\nlet total=0;\nfor(let i=0;i<indices.length;i++){\nconst raw=read(indices[i]);\nif(raw===null||raw===undefined||raw==='')continue;\nif(typeof raw==='number'&&Number.isNaN(raw))continue;\nconst key=typeof raw==='object'?String(raw):raw;\nseen.set(key,(seen.get(key)||0)+1);\ntotal++;\n}\nconst counts=[...seen.values()].sort((a,b)=>b-a);\nreturn{counts,total,distinct:counts.length};\n}\nfunction sharesOf(freq){\nreturn freq.total>0?freq.counts.map((c)=>c/freq.total):[];\n}\nfunction herfindahl(handle,indices){\nconst freq=frequencies(handle,indices);\nif(!freq.total)return null;\nlet sum=0;\nfor(const share of sharesOf(freq))sum+=share*share;\nreturn sum;\n}\nfunction entropy(handle,indices){\nconst freq=frequencies(handle,indices);\nif(!freq.total)return null;\nlet sum=0;\nfor(const share of sharesOf(freq))if(share>0)sum-=share*Math.log2(share);\nreturn sum;\n}\nfunction evenness(handle,indices){\nconst freq=frequencies(handle,indices);\nif(!freq.total||freq.distinct<2)return freq.total?1:null;\nlet sum=0;\nfor(const share of sharesOf(freq))if(share>0)sum-=share*Math.log2(share);\nreturn sum/Math.log2(freq.distinct);\n}\nfunction topShare(handle,indices,n=3){\nconst freq=frequencies(handle,indices);\nif(!freq.total)return null;\nconst take=Math.max(1,Math.floor(n));\nlet held=0;\nfor(let i=0;i<Math.min(take,freq.counts.length);i++)held+=freq.counts[i];\nreturn held/freq.total;\n}\nfunction gini(handle,indices){\nconst values=numbers(handle,indices);\nconst n=values.length;\nif(!n)return null;\nconst sorted=values.slice().sort();\nif(sorted[0]<0)return null;\nlet total=0;\nlet weighted=0;\nfor(let i=0;i<n;i++){\ntotal+=sorted[i];\nweighted+=(i+1)*sorted[i];\n}\nif(total===0)return 0;\nreturn(2*weighted)/(n*total)-(n+1)/n;\n}\nfunction moments(values){\nlet n=0;\nlet mean=0;\nlet m2=0;\nfor(let i=0;i<values.length;i++){\nconst x=values[i];\nn++;\nconst delta=x-mean;\nmean+=delta/n;\nm2+=delta*(x-mean);\n}\nreturn{n,mean,m2};\n}\nfunction quantileSorted(sorted,p){\nconst n=sorted.length;\nif(!n)return NaN;\nif(n===1)return sorted[0];\nconst h=(n-1)*Math.min(1,Math.max(0,p));\nconst lo=Math.floor(h);\nconst hi=Math.ceil(h);\nif(lo===hi)return sorted[lo];\nreturn sorted[lo]+(h-lo)*(sorted[hi]-sorted[lo]);\n}\nfunction quantile(values,p){\nif(!values.length)return NaN;\nconst sorted=values.slice().sort();\nreturn quantileSorted(sorted,p);\n}\nconst STAT_FNS=Object.freeze({\nhhi:(h,i)=>herfindahl(h,i),\nentropy:(h,i)=>entropy(h,i),\nevenness:(h,i)=>evenness(h,i),\ntop3Share:(h,i)=>topShare(h,i,3),\ntop10Share:(h,i)=>topShare(h,i,10),\ngini:(h,i)=>gini(h,i),\ntrimmedMean:(h,i)=>trimmedMean(numbers(h,i),0.1),\nwinsorizedMean:(h,i)=>winsorizedMean(numbers(h,i),0.1),\nrobustOutliers:(h,i)=>modifiedZOutliers(numbers(h,i),3.5),\njarqueBera:(h,i)=>jarqueBera(numbers(h,i)),\nvariance:(h,i)=>{\nconst{n,m2}=moments(numbers(h,i));\nreturn n>1?m2/(n-1):null;\n},\nvarianceP:(h,i)=>{\nconst{n,m2}=moments(numbers(h,i));\nreturn n>0?m2/n:null;\n},\nstddev:(h,i)=>{\nconst{n,m2}=moments(numbers(h,i));\nreturn n>1?Math.sqrt(m2/(n-1)):null;\n},\nstddevP:(h,i)=>{\nconst{n,m2}=moments(numbers(h,i));\nreturn n>0?Math.sqrt(m2/n):null;\n},\nmedian:(h,i)=>{\nconst values=numbers(h,i);\nreturn values.length?quantile(values,0.5):null;\n},\np25:(h,i)=>{\nconst values=numbers(h,i);\nreturn values.length?quantile(values,0.25):null;\n},\np75:(h,i)=>{\nconst values=numbers(h,i);\nreturn values.length?quantile(values,0.75):null;\n},\np90:(h,i)=>{\nconst values=numbers(h,i);\nreturn values.length?quantile(values,0.9):null;\n},\np95:(h,i)=>{\nconst values=numbers(h,i);\nreturn values.length?quantile(values,0.95):null;\n},\np99:(h,i)=>{\nconst values=numbers(h,i);\nreturn values.length?quantile(values,0.99):null;\n},\niqr:(h,i)=>{\nconst values=numbers(h,i);\nif(!values.length)return null;\nconst sorted=values.slice().sort();\nreturn quantileSorted(sorted,0.75)-quantileSorted(sorted,0.25);\n},\nmad:(h,i)=>{\nconst values=numbers(h,i);\nif(!values.length)return null;\nconst middle=quantile(values,0.5);\nconst deviations=new Float64Array(values.length);\nfor(let k=0;k<values.length;k++)deviations[k]=Math.abs(values[k]-middle);\nreturn quantile(deviations,0.5);\n},\nrange:(h,i)=>{\nconst values=numbers(h,i);\nif(!values.length)return null;\nlet lo=Infinity;\nlet hi=-Infinity;\nfor(let k=0;k<values.length;k++){\nif(values[k]<lo)lo=values[k];\nif(values[k]>hi)hi=values[k];\n}\nreturn hi-lo;\n},\ndistinct:(h,i)=>{\nconst read=valueReader(h);\nconst seen=new Set();\nfor(let k=0;k<i.length;k++){\nconst v=read(i[k]);\nif(v===null||v===undefined||v==='')continue;\nseen.add(v instanceof Date?v.getTime():v);\n}\nreturn seen.size;\n},\nmode:(h,i)=>{\nconst read=valueReader(h);\nconst counts=new Map();\nfor(let k=0;k<i.length;k++){\nconst v=read(i[k]);\nif(v===null||v===undefined||v==='')continue;\nconst id=v instanceof Date?v.getTime():v;\ncounts.set(id,(counts.get(id)||0)+1);\n}\nlet best=null;\nlet most=1;\nfor(const[value,times]of counts){\nif(times>most){\nmost=times;\nbest=value;\n}\n}\nreturn best;\n},\nskewness:(h,i)=>{\nconst values=numbers(h,i);\nconst{n,mean,m2}=moments(values);\nif(n<3||m2<=0)return null;\nconst sd=Math.sqrt(m2/(n-1));\nlet sum=0;\nfor(let k=0;k<values.length;k++)sum+=((values[k]-mean)/sd)**3;\nreturn(n/((n-1)*(n-2)))*sum;\n},\nkurtosis:(h,i)=>{\nconst values=numbers(h,i);\nconst{n,mean,m2}=moments(values);\nif(n<4||m2<=0)return null;\nconst sd=Math.sqrt(m2/(n-1));\nlet sum=0;\nfor(let k=0;k<values.length;k++)sum+=((values[k]-mean)/sd)**4;\nconst a=(n*(n+1))/((n-1)*(n-2)*(n-3));\nconst b=(3*(n-1)**2)/((n-2)*(n-3));\nreturn a*sum-b;\n},\ngeomean:(h,i)=>{\nconst values=numbers(h,i);\nif(!values.length)return null;\nlet sum=0;\nfor(let k=0;k<values.length;k++){\nif(values[k]<=0)return null;\nsum+=Math.log(values[k]);\n}\nreturn Math.exp(sum/values.length);\n},\nharmean:(h,i)=>{\nconst values=numbers(h,i);\nif(!values.length)return null;\nlet sum=0;\nfor(let k=0;k<values.length;k++){\nif(values[k]===0)return null;\nsum+=1/values[k];\n}\nreturn values.length/sum;\n},\nsumSquares:(h,i)=>{\nconst values=numbers(h,i);\nlet sum=0;\nfor(let k=0;k<values.length;k++)sum+=values[k]*values[k];\nreturn sum;\n},\n});\nconst STAT_LABELS=Object.freeze({\nhhi:'Concentration (HHI)',\nentropy:'Entropy',\nevenness:'Evenness',\ntop3Share:'Top 3 share',\ntop10Share:'Top 10 share',\ngini:'Gini coefficient',\ntrimmedMean:'Trimmed mean',\nwinsorizedMean:'Winsorized mean',\nrobustOutliers:'Outliers (robust)',\njarqueBera:'Jarque–Bera',\nmedian:'Median',\np25:'25th percentile',\np75:'75th percentile',\np90:'90th percentile',\np95:'95th percentile',\np99:'99th percentile',\niqr:'Interquartile range',\nmad:'Median absolute deviation',\nvariance:'Variance',\nvarianceP:'Variance (population)',\nstddev:'Standard deviation',\nstddevP:'Standard deviation (population)',\nrange:'Range',\ndistinct:'Distinct',\nmode:'Mode',\nskewness:'Skewness',\nkurtosis:'Kurtosis',\ngeomean:'Geometric mean',\nharmean:'Harmonic mean',\nsumSquares:'Sum of squares',\nweightedAvg:'Weighted average',\nargmin:'Lowest by',\nargmax:'Highest by',\n});\nfunction weightedAverage(handle,weights,indices){\nconst readValue=valueReader(handle);\nconst readWeight=valueReader(weights);\nlet top=0;\nlet bottom=0;\nfor(let i=0;i<indices.length;i++){\nconst row=indices[i];\nconst value=Number(readValue(row));\nconst weight=Number(readWeight(row));\nif(!Number.isFinite(value)||!Number.isFinite(weight))continue;\ntop+=value*weight;\nbottom+=weight;\n}\nreturn bottom===0?null:top/bottom;\n}\nfunction extremeRow(handle,indices,largest){\nconst read=valueReader(handle);\nlet best=null;\nlet bestValue=largest?-Infinity:Infinity;\nfor(let i=0;i<indices.length;i++){\nconst row=indices[i];\nconst value=Number(read(row));\nif(!Number.isFinite(value))continue;\nif(largest?value>bestValue:value<bestValue){\nbestValue=value;\nbest=row;\n}\n}\nreturn best;\n}\nfunction correlation(a,b,indices){\nconst readA=valueReader(a);\nconst readB=valueReader(b);\nlet n=0;\nlet sx=0;\nlet sy=0;\nlet sxx=0;\nlet syy=0;\nlet sxy=0;\nfor(let i=0;i<indices.length;i++){\nconst row=indices[i];\nconst x=Number(readA(row));\nconst y=Number(readB(row));\nif(!Number.isFinite(x)||!Number.isFinite(y))continue;\nn++;\nsx+=x;\nsy+=y;\nsxx+=x*x;\nsyy+=y*y;\nsxy+=x*y;\n}\nif(n<2)return null;\nconst top=n*sxy-sx*sy;\nconst bottom=Math.sqrt((n*sxx-sx*sx)*(n*syy-sy*sy));\nif(bottom===0)return null;\nconst r=top/bottom;\nreturn Math.max(-1,Math.min(1,r));\n}\nfunction trimmedMean(values,share=0.1){\nconst n=values.length;\nif(!n)return null;\nconst sorted=Array.from(values).sort((a,b)=>a-b);\nconst cut=Math.floor(n*Math.min(0.49,Math.max(0,share)));\nconst kept=sorted.slice(cut,n-cut);\nif(!kept.length)return quantileSorted(sorted,0.5);\nlet sum=0;\nfor(const v of kept)sum+=v;\nreturn sum/kept.length;\n}\nfunction winsorizedMean(values,share=0.1){\nconst n=values.length;\nif(!n)return null;\nconst sorted=Array.from(values).sort((a,b)=>a-b);\nconst cut=Math.floor(n*Math.min(0.49,Math.max(0,share)));\nconst low=sorted[cut];\nconst high=sorted[n-1-cut];\nlet sum=0;\nfor(const v of sorted)sum+=Math.min(high,Math.max(low,v));\nreturn sum/n;\n}\nfunction modifiedZOutliers(values,threshold=3.5){\nconst n=values.length;\nif(!n)return null;\nconst sorted=Array.from(values).sort((a,b)=>a-b);\nconst middle=quantileSorted(sorted,0.5);\nconst deviations=sorted.map((v)=>Math.abs(v-middle)).sort((a,b)=>a-b);\nconst mad=quantileSorted(deviations,0.5);\nif(mad===0)return null;\nlet count=0;\nfor(const v of sorted)if(Math.abs((0.6745*(v-middle))/mad)>threshold)count++;\nreturn count;\n}\nfunction jarqueBera(values){\nconst n=values.length;\nif(n<8)return null;\nlet mean=0;\nfor(const v of values)mean+=v;\nmean/=n;\nlet m2=0;\nlet m3=0;\nlet m4=0;\nfor(const v of values){\nconst d=v-mean;\nm2+=d*d;\nm3+=d*d*d;\nm4+=d*d*d*d;\n}\nm2/=n;\nm3/=n;\nm4/=n;\nif(m2===0)return null;\nconst skew=m3/m2**1.5;\nconst excess=m4/(m2*m2)-3;\nreturn(n/6)*(skew*skew+(excess*excess)/4);\n}\nfunction weightedQuantile(values,weights,p){\nconst paired=[];\nlet total=0;\nfor(let i=0;i<values.length;i++){\nconst v=Number(values[i]);\nconst w=Number(weights[i]);\nif(!Number.isFinite(v)||!Number.isFinite(w)||w<=0)continue;\npaired.push([v,w]);\ntotal+=w;\n}\nif(!paired.length||total<=0)return null;\npaired.sort((a,b)=>a[0]-b[0]);\nif(paired.length===1)return paired[0][0];\nconst at=[];\nlet seen=0;\nfor(const[,w]of paired){\nat.push((seen+w/2)/total);\nseen+=w;\n}\nconst target=Math.max(0,Math.min(1,p));\nif(target<=at[0])return paired[0][0];\nif(target>=at[at.length-1])return paired[paired.length-1][0];\nfor(let i=1;i<at.length;i++){\nif(target>at[i])continue;\nconst span=at[i]-at[i-1];\nconst within=span>0?(target-at[i-1])/span:0;\nreturn paired[i-1][0]+(paired[i][0]-paired[i-1][0])*within;\n}\nreturn paired[paired.length-1][0];\n}\nfunction pairs(a,b,indices){\nconst readA=valueReader(a);\nconst readB=valueReader(b);\nconst xs=new Float64Array(indices.length);\nconst ys=new Float64Array(indices.length);\nlet n=0;\nfor(let i=0;i<indices.length;i++){\nconst row=indices[i];\nconst x=Number(readA(row));\nconst y=Number(readB(row));\nif(!Number.isFinite(x)||!Number.isFinite(y))continue;\nxs[n]=x;\nys[n]=y;\nn++;\n}\nreturn{xs:xs.subarray(0,n),ys:ys.subarray(0,n),n};\n}\nfunction covariance(a,b,indices,population=false){\nconst{xs,ys,n}=pairs(a,b,indices);\nif(n<2)return null;\nlet mx=0;\nlet my=0;\nfor(let i=0;i<n;i++){mx+=xs[i];my+=ys[i];}\nmx/=n;\nmy/=n;\nlet sum=0;\nfor(let i=0;i<n;i++)sum+=(xs[i]-mx)*(ys[i]-my);\nreturn sum/(population?n:n-1);\n}\nfunction regression(a,b,indices){\nconst{xs,ys,n}=pairs(a,b,indices);\nif(n<2)return null;\nlet mx=0;\nlet my=0;\nfor(let i=0;i<n;i++){mx+=xs[i];my+=ys[i];}\nmx/=n;\nmy/=n;\nlet sxx=0;\nlet sxy=0;\nlet syy=0;\nfor(let i=0;i<n;i++){\nconst dx=xs[i]-mx;\nconst dy=ys[i]-my;\nsxx+=dx*dx;\nsxy+=dx*dy;\nsyy+=dy*dy;\n}\nif(sxx===0)return null;\nconst slope=sxy/sxx;\nconst intercept=my-slope*mx;\nconst r2=syy===0?1:Math.max(0,Math.min(1,(sxy*sxy)/(sxx*syy)));\nconst residual=Math.max(0,syy-slope*sxy);\nconst stdError=n>2?Math.sqrt(residual/(n-2)/sxx):0;\nreturn{slope,intercept,r2,stdError,n};\n}\nfunction ranksOf(values){\nconst n=values.length;\nconst order=Array.from({length:n},(unused,i)=>i)\n.sort((i,j)=>values[i]-values[j]);\nconst ranks=new Float64Array(n);\nlet i=0;\nwhile(i<n){\nlet j=i;\nwhile(j+1<n&&values[order[j+1]]===values[order[i]])j++;\nconst shared=(i+j)/2+1;\nfor(let k=i;k<=j;k++)ranks[order[k]]=shared;\ni=j+1;\n}\nreturn ranks;\n}\nfunction spearman(a,b,indices){\nconst{xs,ys,n}=pairs(a,b,indices);\nif(n<2)return null;\nconst rx=ranksOf(xs);\nconst ry=ranksOf(ys);\nlet mx=0;\nlet my=0;\nfor(let i=0;i<n;i++){mx+=rx[i];my+=ry[i];}\nmx/=n;\nmy/=n;\nlet sxy=0;\nlet sxx=0;\nlet syy=0;\nfor(let i=0;i<n;i++){\nconst dx=rx[i]-mx;\nconst dy=ry[i]-my;\nsxy+=dx*dy;\nsxx+=dx*dx;\nsyy+=dy*dy;\n}\nif(sxx===0||syy===0)return null;\nreturn Math.max(-1,Math.min(1,sxy/Math.sqrt(sxx*syy)));\n}\nfunction kendall(a,b,indices){\nconst{xs,ys,n}=pairs(a,b,indices);\nif(n<2||n>KENDALL_LIMIT)return null;\nlet concordant=0;\nlet discordant=0;\nlet tiedXOnly=0;\nlet tiedYOnly=0;\nfor(let i=0;i<n;i++){\nfor(let j=i+1;j<n;j++){\nconst dx=Math.sign(xs[i]-xs[j]);\nconst dy=Math.sign(ys[i]-ys[j]);\nconst product=dx*dy;\nif(product>0)concordant++;\nelse if(product<0)discordant++;\nelse if(dx===0&&dy===0){}\nelse if(dx===0)tiedXOnly++;\nelse tiedYOnly++;\n}\n}\nconst orderedByX=concordant+discordant+tiedYOnly;\nconst orderedByY=concordant+discordant+tiedXOnly;\nif(orderedByX===0||orderedByY===0)return null;\nreturn(concordant-discordant)/Math.sqrt(orderedByX*orderedByY);\n}\nfunction seriesStats(ordered,opts={}){\nconst n=ordered.length;\nif(n<2)return null;\nconst first=ordered[0];\nconst last=ordered[n-1];\nconst returns=[];\nfor(let i=1;i<n;i++){\nconst previous=ordered[i-1];\nif(previous===0)continue;\nreturns.push((ordered[i]-previous)/Math.abs(previous));\n}\nlet volatility=null;\nif(returns.length>1){\nlet mean=0;\nfor(const r of returns)mean+=r;\nmean/=returns.length;\nlet m2=0;\nfor(const r of returns)m2+=(r-mean)**2;\nvolatility=Math.sqrt(m2/(returns.length-1));\n}\nconst periods=Number(opts.periodsPerYear)>0?Number(opts.periodsPerYear):null;\nlet peak=ordered[0];\nlet peakAt=0;\nlet worst=0;\nlet worstFrom=0;\nlet worstTo=0;\nfor(let i=1;i<n;i++){\nif(ordered[i]>peak){peak=ordered[i];peakAt=i;continue;}\nif(peak<=0)continue;\nconst fall=(peak-ordered[i])/peak;\nif(fall>worst){worst=fall;worstFrom=peakAt;worstTo=i;}\n}\nlet autocorrelation=null;\nif(n>2){\nlet mean=0;\nfor(let i=0;i<n;i++)mean+=ordered[i];\nmean/=n;\nlet top=0;\nlet bottom=0;\nfor(let i=0;i<n;i++){\nconst d=ordered[i]-mean;\nbottom+=d*d;\nif(i>0)top+=d*(ordered[i-1]-mean);\n}\nautocorrelation=bottom>0?top/bottom:null;\n}\nlet up=0;\nlet down=0;\nfor(const r of returns){if(r>0)up++;else if(r<0)down++;}\nlet growth=null;\nif(first>0&&last>0){\nconst perPeriod=(last/first)**(1/(n-1))-1;\ngrowth=periods?(1+perPeriod)**periods-1:perPeriod;\n}\nreturn{\nn,\nfirst,\nlast,\nchange:last-first,\nchangePercent:first===0?null:((last-first)/Math.abs(first))*100,\nvolatility,\nannualisedVolatility:volatility!==null&&periods?volatility*Math.sqrt(periods):null,\ngrowth,\nmaxDrawdown:worst,\nmaxDrawdownFrom:worstFrom,\nmaxDrawdownTo:worstTo,\nautocorrelation,\nupDays:up,\ndownDays:down,\n};\n}\nconst D2_N2=1.128;\nfunction withinSigma(ordered){\nconst n=ordered.length;\nif(n<2)return null;\nlet total=0;\nfor(let i=1;i<n;i++)total+=Math.abs(ordered[i]-ordered[i-1]);\nconst meanRange=total/(n-1);\nreturn{sigma:meanRange/D2_N2,meanRange};\n}\nfunction capability(ordered,spec){\nconst n=ordered.length;\nif(n<2||!spec)return null;\nconst lower=Number.isFinite(Number(spec.lower))?Number(spec.lower):null;\nconst upper=Number.isFinite(Number(spec.upper))?Number(spec.upper):null;\nif(lower===null&&upper===null)return null;\nlet mean=0;\nfor(let i=0;i<n;i++)mean+=ordered[i];\nmean/=n;\nlet m2=0;\nfor(let i=0;i<n;i++)m2+=(ordered[i]-mean)**2;\nconst overall=Math.sqrt(m2/(n-1));\nconst within=withinSigma(ordered);\nconst sigmaWithin=within?within.sigma:null;\nconst indices=(sigma)=>{\nif(!sigma||sigma<=0)return{index:null,k:null};\nconst both=lower!==null&&upper!==null;\nconst index=both?(upper-lower)/(6*sigma):null;\nconst upperSide=upper!==null?(upper-mean)/(3*sigma):Infinity;\nconst lowerSide=lower!==null?(mean-lower)/(3*sigma):Infinity;\nreturn{index,k:Math.min(upperSide,lowerSide)};\n};\nconst short=indices(sigmaWithin);\nconst long=indices(overall);\nlet outOfSpec=0;\nfor(let i=0;i<n;i++){\nif(lower!==null&&ordered[i]<lower){outOfSpec++;continue;}\nif(upper!==null&&ordered[i]>upper)outOfSpec++;\n}\nreturn{\nn,\nmean,\nlower,\nupper,\ntarget:Number.isFinite(Number(spec.target))?Number(spec.target):null,\nsigmaWithin,\nsigmaOverall:overall,\ncp:short.index,\ncpk:short.k,\npp:long.index,\nppk:long.k,\noutOfSpec,\ndefectRate:n?outOfSpec/n:null,\n};\n}\nfunction controlLimits(ordered){\nconst n=ordered.length;\nif(n<2)return null;\nconst within=withinSigma(ordered);\nif(!within||!(within.sigma>0))return null;\nlet centre=0;\nfor(let i=0;i<n;i++)centre+=ordered[i];\ncentre/=n;\nreturn{\ncentre,\nsigma:within.sigma,\nupper:centre+3*within.sigma,\nlower:centre-3*within.sigma,\n};\n}\nfunction controlViolations(ordered,limits){\nif(!limits||!(limits.sigma>0))return[];\nconst n=ordered.length;\nconst{centre,sigma}=limits;\nconst z=(i)=>(ordered[i]-centre)/sigma;\nconst out=[];\nfor(let i=0;i<n;i++){\nif(Math.abs(z(i))>3){\nout.push({index:i,rule:1,description:'beyond three sigma'});\n}\nif(i>=2){\nfor(const side of[1,-1]){\nlet hits=0;\nfor(let k=i-2;k<=i;k++)if(z(k)*side>2)hits++;\nif(hits>=2){\nout.push({index:i,rule:2,description:'two of three past two sigma'});\nbreak;\n}\n}\n}\nif(i>=4){\nfor(const side of[1,-1]){\nlet hits=0;\nfor(let k=i-4;k<=i;k++)if(z(k)*side>1)hits++;\nif(hits>=4){\nout.push({index:i,rule:3,description:'four of five past one sigma'});\nbreak;\n}\n}\n}\nif(i>=7){\nfor(const side of[1,-1]){\nlet all=true;\nfor(let k=i-7;k<=i;k++)if(z(k)*side<=0){all=false;break;}\nif(all){\nout.push({index:i,rule:4,description:'eight in a row on one side'});\nbreak;\n}\n}\n}\n}\nreturn out;\n}\nfunction countOutside(values,low,high){\nlet count=0;\nfor(let i=0;i<values.length;i++){\nif(values[i]<low||values[i]>high)count++;\n}\nreturn count;\n}\nfunction histogram(sorted,q1,q3,cap=20){\nconst n=sorted.length;\nif(!n)return[];\nconst min=sorted[0];\nconst max=sorted[n-1];\nif(max===min)return[{from:min,to:max,count:n}];\nconst iqr=q3-q1;\nconst fence=1.5*iqr;\nlet lo=iqr>0?Math.max(min,q1-fence):min;\nlet hi=iqr>0?Math.min(max,q3+fence):max;\nif(!(hi>lo)){lo=min;hi=max;}\nconst width=iqr>0?(2*iqr)/Math.cbrt(n):(hi-lo)/(Math.ceil(Math.log2(n))+1);\nconst count=width>0\n?Math.min(cap,Math.max(1,Math.ceil((hi-lo)/width)))\n:1;\nconst step=(hi-lo)/count;\nconst bins=[];\nfor(let i=0;i<count;i++){\nbins.push({from:lo+i*step,to:lo+(i+1)*step,count:0});\n}\nfor(let i=0;i<n;i++){\nconst at=Math.min(count-1,Math.max(0,Math.floor((sorted[i]-lo)/step)));\nbins[at].count++;\n}\nbins[0].from=min;\nbins[count-1].to=max;\nreturn bins;\n}\n});\n__def(\"packages/core/src/compute/total.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"TOTAL_FNS\",{enumerable:true,get:function(){return TOTAL_FNS;}});\nObject.defineProperty(__exports,\"TOTAL_LABELS\",{enumerable:true,get:function(){return TOTAL_LABELS;}});\nObject.defineProperty(__exports,\"totalLabel\",{enumerable:true,get:function(){return totalLabel;}});\nObject.defineProperty(__exports,\"collectValues\",{enumerable:true,get:function(){return collectValues;}});\nObject.defineProperty(__exports,\"total\",{enumerable:true,get:function(){return total;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst isFunction=__m0[\"isFunction\"];\nconst warnOnce=__m0[\"warnOnce\"];\nconst __m1=__req(\"packages/core/src/compute/handle.js\");\nconst presenceReader=__m1[\"presenceReader\"];\nconst valueComparator=__m1[\"valueComparator\"];\nconst valueReader=__m1[\"valueReader\"];\nconst __m2=__req(\"packages/core/src/compute/statistics.js\");\nconst STAT_FNS=__m2[\"STAT_FNS\"];\nconst STAT_LABELS=__m2[\"STAT_LABELS\"];\nfunction isNumericBacking(handle){\nreturn!!handle&&(handle.kind==='float64'||handle.kind==='int32');\n}\nfunction sum(handle,indices){\nconst n=indices.length;\nlet acc=0;\nif(isNumericBacking(handle)){\nconst values=handle.values;\nconst present=presenceReader(handle);\nif(!present){\nfor(let i=0;i<n;i++){\nconst v=values[indices[i]];\nif(!Number.isNaN(v))acc+=v;\n}\nreturn acc;\n}\nfor(let i=0;i<n;i++){\nconst row=indices[i];\nif(present(row)===1){\nconst v=values[row];\nif(!Number.isNaN(v))acc+=v;\n}\n}\nreturn acc;\n}\nconst read=valueReader(handle);\nfor(let i=0;i<n;i++){\nconst v=numberOf(read(indices[i]));\nif(v!==null)acc+=v;\n}\nreturn acc;\n}\nsum.kernel=true;\nfunction countValues(handle,indices){\nconst n=indices.length;\nlet count=0;\nif(isNumericBacking(handle)){\nconst values=handle.values;\nconst present=presenceReader(handle);\nif(!present){\nfor(let i=0;i<n;i++)if(!Number.isNaN(values[indices[i]]))count++;\nreturn count;\n}\nfor(let i=0;i<n;i++){\nconst row=indices[i];\nif(present(row)===1&&!Number.isNaN(values[row]))count++;\n}\nreturn count;\n}\nconst read=valueReader(handle);\nfor(let i=0;i<n;i++){\nconst v=read(indices[i]);\nif(v!==null&&v!==undefined&&!(typeof v==='number'&&Number.isNaN(v)))count++;\n}\nreturn count;\n}\ncountValues.kernel=true;\nfunction count(handle,indices){\nreturn indices.length;\n}\ncount.kernel=true;\nfunction avg(handle,indices){\nconst values=countValues(handle,indices);\nif(values===0)return null;\nreturn sum(handle,indices)/values;\n}\navg.kernel=true;\nfunction extreme(handle,indices,direction,locale){\nconst n=indices.length;\nif(isNumericBacking(handle)){\nconst values=handle.values;\nconst present=presenceReader(handle);\nlet best=null;\nif(!present){\nfor(let i=0;i<n;i++){\nconst v=values[indices[i]];\nif(Number.isNaN(v))continue;\nif(best===null||(direction<0?v<best:v>best))best=v;\n}\nreturn best;\n}\nfor(let i=0;i<n;i++){\nconst row=indices[i];\nif(present(row)===0)continue;\nconst v=values[row];\nif(Number.isNaN(v))continue;\nif(best===null||(direction<0?v<best:v>best))best=v;\n}\nreturn best;\n}\nconst read=valueReader(handle);\nconst cmp=valueComparator(locale);\nlet best=null;\nfor(let i=0;i<n;i++){\nconst v=read(indices[i]);\nif(v===null||v===undefined||(typeof v==='number'&&Number.isNaN(v)))continue;\nif(best===null||(direction<0?cmp(v,best)<0:cmp(v,best)>0))best=v;\n}\nreturn best;\n}\nfunction min(handle,indices,ctx){\nreturn extreme(handle,indices,-1,ctx&&ctx.locale);\n}\nmin.kernel=true;\nfunction max(handle,indices,ctx){\nreturn extreme(handle,indices,1,ctx&&ctx.locale);\n}\nmax.kernel=true;\nfunction first(handle,indices){\nif(indices.length===0)return null;\nreturn valueReader(handle)(indices[0]);\n}\nfirst.kernel=true;\nfunction last(handle,indices){\nif(indices.length===0)return null;\nreturn valueReader(handle)(indices[indices.length-1]);\n}\nlast.kernel=true;\nfunction numberOf(v){\nif(typeof v==='number')return Number.isNaN(v)?null:v;\nif(v===null||v===undefined||v===''||typeof v==='boolean')return null;\nif(v instanceof Date)return v.getTime();\nconst n=Number(v);\nreturn Number.isNaN(n)?null:n;\n}\nconst TOTAL_FNS={\nsum,min,max,avg,count,first,last,countValues,\n...STAT_FNS,\n};\nconst TOTAL_LABELS=Object.freeze({\n...STAT_LABELS,\nsum:'Sum',\navg:'Average',\nmin:'Min',\nmax:'Max',\ncount:'Count',\ncountValues:'Count of values',\nfirst:'First',\nlast:'Last',\n});\nfunction totalLabel(fn){\nif(!fn)return'';\nif(typeof fn==='string')return TOTAL_LABELS[fn]||fn;\nreturn'Total';\n}\nfunction collectValues(handle,indices){\nconst read=valueReader(handle);\nconst out=[];\nfor(let i=0;i<indices.length;i++){\nconst v=read(indices[i]);\nif(v===null||v===undefined)continue;\nout.push(v);\n}\nreturn out;\n}\nfunction total(handle,indices,fn,ctx){\nconst list=indices||[];\nif(typeof fn==='string'){\nconst kernel=TOTAL_FNS[fn];\nif(!kernel){\nwarnOnce(`total:${fn}`,`unknown total function \"${fn}\"; register it in config.totalFns`);\nreturn null;\n}\nreturn kernel(handle,list,ctx);\n}\nif(isFunction(fn)){\nif(fn.kernel===true)return fn(handle,list,ctx);\nreturn fn(collectValues(handle,list),ctx||{});\n}\nreturn null;\n}\n});\n__def(\"packages/core/src/compute/pivot.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"KEY_DELIMITER\",{enumerable:true,get:function(){return KEY_DELIMITER;}});\nObject.defineProperty(__exports,\"DEFAULT_PATH_SEPARATOR\",{enumerable:true,get:function(){return DEFAULT_PATH_SEPARATOR;}});\nObject.defineProperty(__exports,\"DEFAULT_MAX_COLUMNS\",{enumerable:true,get:function(){return DEFAULT_MAX_COLUMNS;}});\nObject.defineProperty(__exports,\"pivotKey\",{enumerable:true,get:function(){return pivotKey;}});\nObject.defineProperty(__exports,\"joinPath\",{enumerable:true,get:function(){return joinPath;}});\nObject.defineProperty(__exports,\"resolvePivotKeys\",{enumerable:true,get:function(){return resolvePivotKeys;}});\nObject.defineProperty(__exports,\"pivot\",{enumerable:true,get:function(){return pivot;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst warnOnce=__m0[\"warnOnce\"];\nconst __m1=__req(\"packages/core/src/compute/handle.js\");\nconst valueComparator=__m1[\"valueComparator\"];\nconst __m2=__req(\"packages/core/src/compute/group.js\");\nconst packKeys=__m2[\"packKeys\"];\nconst __m3=__req(\"packages/core/src/compute/total.js\");\nconst total=__m3[\"total\"];\nconst KEY_DELIMITER='|';\nconst DEFAULT_PATH_SEPARATOR='/';\nconst DEFAULT_MAX_COLUMNS=2000;\nfunction pivotKey(groupPath,pivotPath,colId){\nreturn`${groupPath}${KEY_DELIMITER}${pivotPath}${KEY_DELIMITER}${colId}`;\n}\nfunction joinPath(parts,separator){\nlet out='';\nfor(let i=0;i<parts.length;i++){\nconst v=parts[i];\nout+=(i===0?'':separator)+(v===null||v===undefined?'':String(v));\n}\nreturn out;\n}\nfunction resolvePivotKeys(handles,order,opts={}){\nconst separator=opts.separator||DEFAULT_PATH_SEPARATOR;\nconst n=order.length;\nconst{keyOf,readers}=packKeys(handles,order,0);\nconst seen=new Map();\nconst tuples=[];\nconst rawKeys=[];\nfor(let i=0;i<n;i++){\nconst row=order[i];\nconst key=keyOf(row);\nif(seen.has(key))continue;\nseen.set(key,tuples.length);\nrawKeys.push(key);\nconst tuple=new Array(readers.length);\nfor(let j=0;j<readers.length;j++)tuple[j]=readers[j](row);\ntuples.push(tuple);\n}\nconst cmp=valueComparator(opts.locale);\nconst rank=tuples.map((_,i)=>i);\nrank.sort((a,b)=>{\nconst ta=tuples[a];\nconst tb=tuples[b];\nfor(let j=0;j<ta.length;j++){\nconst c=compareNullable(ta[j],tb[j],cmp);\nif(c!==0)return c;\n}\nreturn a-b;\n});\nconst keys=new Array(rank.length);\nconst paths=new Array(rank.length);\nconst idByKey=new Map();\nfor(let position=0;position<rank.length;position++){\nconst from=rank[position];\nkeys[position]=tuples[from];\npaths[position]=joinPath(tuples[from],separator);\nidByKey.set(rawKeys[from],position);\n}\nconst idOf=(row)=>{\nconst id=idByKey.get(keyOf(row));\nreturn id===undefined?-1:id;\n};\nreturn{keys,paths,idOf};\n}\nfunction compareNullable(a,b,cmp){\nconst na=a===null||a===undefined;\nconst nb=b===null||b===undefined;\nif(na||nb)return na&&nb?0:na?1:-1;\nreturn cmp(a,b);\n}\nfunction resolveValueColumns(opts){\nconst declared=opts.values||opts.totals||[];\nif(declared.length&&typeof declared[0]==='object'&&declared[0]!==null){\nreturn declared.filter((entry)=>entry&&entry.handle);\n}\nconst resolve=typeof opts.handle==='function'?opts.handle:null;\nif(!resolve){\nif(declared.length){\nwarnOnce('pivot:handles',\n'pivot was given total column ids but no handle(colId) resolver, so no cell values were reduced. Pass values: [{ colId, handle, fn }] or opts.handle.');\n}\nreturn[];\n}\nconst totalOf=typeof opts.totalOf==='function'?opts.totalOf:null;\nconst out=[];\nfor(const colId of declared){\nconst handle=resolve(colId);\nif(!handle)continue;\nout.push({colId,handle,fn:totalOf?totalOf(colId):'sum'});\n}\nreturn out;\n}\nfunction normaliseArgs(a,b,c){\nif(Array.isArray(a)){\nconst opts=c||{};\nreturn{...opts,pivotHandles:a,order:b||null,groups:opts.groups||null};\n}\nreturn a||{};\n}\nfunction pivot(input,orderArg,optsArg){\nconst opts=normaliseArgs(input,orderArg,optsArg);\nconst separator=opts.separator||DEFAULT_PATH_SEPARATOR;\nconst valueColumns=resolveValueColumns(opts);\nconst maxColumns=opts.maxColumns===undefined?DEFAULT_MAX_COLUMNS:opts.maxColumns;\nconst groups=opts.groups&&opts.groups.buckets?opts.groups:null;\nconst buckets=groups?groups.buckets:[opts.order||new Uint32Array(0)];\nconst groupPaths=opts.groupPaths\n||(groups?groups.keys.map((tuple)=>joinPath(tuple,separator)):['']);\nconst scope=concatIndices(buckets);\nconst{keys,paths,idOf}=resolvePivotKeys(opts.pivotHandles||[],scope,opts);\nconst columns=paths.length*Math.max(1,valueColumns.length);\nconst fields=derivedFields(paths,valueColumns,separator);\nif(maxColumns&&columns>maxColumns){\nconst empty=new Map();\nreturn{\nkeys,\npaths,\nfields,\ngroupPaths,\ncolumns,\nvalues:empty,\ncells:empty,\nerror:{\ncode:'pivot-max-columns',\nmessage:`[lattice] pivot would generate ${columns} columns, above pivot.maxColumns of ${maxColumns}. Narrow the pivot columns or raise the limit.`,\ncolumns,\nmaxColumns,\n},\n};\n}\nconst cells=new Map();\nconst keyCount=paths.length;\nfor(let g=0;g<buckets.length;g++){\nconst bucket=buckets[g];\nconst groupPath=groupPaths[g]===undefined?'':groupPaths[g];\nconst n=bucket.length;\nif(n===0)continue;\nconst ids=new Int32Array(n);\nconst counts=new Uint32Array(keyCount+1);\nfor(let i=0;i<n;i++){\nconst id=idOf(bucket[i]);\nids[i]=id;\nif(id>=0)counts[id+1]++;\n}\nfor(let k=0;k<keyCount;k++)counts[k+1]+=counts[k];\nconst scattered=new Uint32Array(n);\nconst cursor=counts.slice(0,keyCount);\nfor(let i=0;i<n;i++){\nconst id=ids[i];\nif(id>=0)scattered[cursor[id]++]=bucket[i];\n}\nfor(let k=0;k<keyCount;k++){\nconst from=counts[k];\nconst to=counts[k+1];\nif(to===from)continue;\nconst slice=scattered.subarray(from,to);\nfor(let c=0;c<valueColumns.length;c++){\nconst column=valueColumns[c];\nconst result=total(column.handle,slice,column.fn,opts.totalContext||{locale:opts.locale});\ncells.set(pivotKey(groupPath,paths[k],column.colId),result);\n}\n}\n}\nreturn{keys,paths,fields,groupPaths,columns,values:cells,cells,error:null};\n}\nfunction derivedFields(paths,valueColumns,separator){\nif(valueColumns.length===0)return paths.slice();\nconst out=[];\nfor(const path of paths){\nfor(const column of valueColumns)out.push(`${path}${separator}${column.colId}`);\n}\nreturn out;\n}\nfunction concatIndices(buckets){\nif(buckets.length===1)return buckets[0]||new Uint32Array(0);\nlet n=0;\nfor(const b of buckets)n+=b?b.length:0;\nconst out=new Uint32Array(n);\nlet at=0;\nfor(const b of buckets){\nif(!b||b.length===0)continue;\nout.set(b,at);\nat+=b.length;\n}\nreturn out;\n}\n});\n__def(\"packages/core/src/compute/reference.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"referenceValue\",{enumerable:true,get:function(){return referenceValue;}});\nObject.defineProperty(__exports,\"referenceSort\",{enumerable:true,get:function(){return referenceSort;}});\nObject.defineProperty(__exports,\"referenceFilter\",{enumerable:true,get:function(){return referenceFilter;}});\nObject.defineProperty(__exports,\"referencePasses\",{enumerable:true,get:function(){return referencePasses;}});\nObject.defineProperty(__exports,\"referenceGroup\",{enumerable:true,get:function(){return referenceGroup;}});\nObject.defineProperty(__exports,\"referenceTotal\",{enumerable:true,get:function(){return referenceTotal;}});\nconst __m0=__req(\"packages/core/src/internal/util.js\");\nconst getPath=__m0[\"getPath\"];\nconst __m1=__req(\"packages/core/src/compute/handle.js\");\nconst isMissing=__m1[\"isMissing\"];\nconst valueComparator=__m1[\"valueComparator\"];\nconst __m2=__req(\"packages/core/src/compute/filter.js\");\nconst testValue=__m2[\"testValue\"];\nconst KEY_SEPARATOR=String.fromCharCode(0x1f);\nconst NULL_MARKER=String.fromCharCode(0x00);\nfunction referenceValue(row,col){\nconst v=col.includes('.')?getPath(row,col):(row==null?undefined:row[col]);\nreturn v===undefined?null:v;\n}\nfunction referenceSort(rows,entries,opts={}){\nconst list=entries||[];\nlet order=rows.map((_,i)=>i);\nif(list.length===0)return order;\nfor(let e=list.length-1;e>=0;e--){\norder=referenceSortOne(rows,order,list[e],opts);\n}\nreturn order;\n}\nfunction referenceSortOne(rows,order,entry,opts){\nconst locale=entry.locale!==undefined?entry.locale:opts.locale;\nconst base=valueComparator(locale);\nconst descending=entry.descending!==undefined?!!entry.descending:entry.dir==='desc';\nconst present=[];\nconst absent=[];\nfor(const i of order){\nconst v=referenceValue(rows[i],entry.col);\nif(isMissing(v))absent.push(i);else present.push(i);\n}\nconst position=new Map();\nfor(let p=0;p<present.length;p++)position.set(present[p],p);\nconst compare=(a,b)=>{\nconst va=referenceValue(rows[a],entry.col);\nconst vb=referenceValue(rows[b],entry.col);\nlet c;\nif(typeof entry.compare==='function'){\nc=entry.compare(va,vb,rows[a],rows[b],descending);\nif(descending)c=-c;\n}else{\nc=descending?base(vb,va):base(va,vb);\n}\nreturn c!==0?c:position.get(a)-position.get(b);\n};\npresent.sort(compare);\nreturn entry.nullsFirst?absent.concat(present):present.concat(absent);\n}\nfunction referenceFilter(rows,filters,opts={}){\nconst out=[];\nfor(let i=0;i<rows.length;i++){\nif(referencePasses(rows[i],filters,opts,i))out.push(i);\n}\nreturn out;\n}\nfunction referencePasses(row,node,opts,index){\nif(!node)return true;\nif(Array.isArray(node.conditions)){\nconst children=node.conditions.filter((c)=>c!=null);\nif(children.length===0)return true;\nif(node.op==='or')return children.some((c)=>referencePasses(row,c,opts,index));\nconst all=children.every((c)=>referencePasses(row,c,opts,index));\nreturn node.op==='not'?!all:all;\n}\nif(node.col===undefined&&typeof opts.custom==='function')return!!opts.custom(node,row,index);\nreturn testValue(referenceValue(row,node.col),node,opts.locale);\n}\nfunction referenceGroup(rows,cols,order){\nconst source=order||rows.map((_,i)=>i);\nconst seen=new Map();\nconst keys=[];\nconst buckets=[];\nfor(const i of source){\nconst tuple=cols.map((col)=>referenceValue(rows[i],col));\nconst key=tuple\n.map((v)=>(v===null||v===undefined?NULL_MARKER:String(v)))\n.join(KEY_SEPARATOR);\nlet at=seen.get(key);\nif(at===undefined){\nat=keys.length;\nseen.set(key,at);\nkeys.push(tuple);\nbuckets.push([]);\n}\nbuckets[at].push(i);\n}\nreturn{keys,buckets};\n}\nfunction referenceTotal(values,fn,opts={}){\nconst cmp=valueComparator(opts.locale);\nconst live=values.filter((v)=>!isMissing(v));\nconst numbers=live.map(toNumberOrNull).filter((v)=>v!==null);\nswitch(fn){\ncase'count':return values.length;\ncase'countValues':return live.length;\ncase'sum':return numbers.reduce((a,b)=>a+b,0);\ncase'avg':return live.length===0?null:numbers.reduce((a,b)=>a+b,0)/live.length;\ncase'min':return live.length===0?null:live.reduce((a,b)=>(cmp(b,a)<0?b:a));\ncase'max':return live.length===0?null:live.reduce((a,b)=>(cmp(b,a)>0?b:a));\ncase'first':return values.length===0?null:normaliseNull(values[0]);\ncase'last':return values.length===0?null:normaliseNull(values[values.length-1]);\ndefault:return null;\n}\n}\nfunction toNumberOrNull(v){\nif(typeof v==='number')return Number.isNaN(v)?null:v;\nif(v===null||v===undefined||v===''||typeof v==='boolean')return null;\nif(v instanceof Date)return v.getTime();\nconst n=Number(v);\nreturn Number.isNaN(n)?null:n;\n}\nfunction normaliseNull(v){\nreturn v===undefined?null:v;\n}\n});\n__def(\"packages/core/src/compute/index.js\",function(__exports,__req){\n'use strict';\nconst __m0=__req(\"packages/core/src/compute/sort.js\");\nObject.defineProperty(__exports,\"sortColumn\",{enumerable:true,get:function(){return __m0[\"sortColumn\"];}});\nObject.defineProperty(__exports,\"sortMulti\",{enumerable:true,get:function(){return __m0[\"sortMulti\"];}});\nObject.defineProperty(__exports,\"radixSortFloat64\",{enumerable:true,get:function(){return __m0[\"radixSortFloat64\"];}});\nObject.defineProperty(__exports,\"radixSortInt32\",{enumerable:true,get:function(){return __m0[\"radixSortInt32\"];}});\nObject.defineProperty(__exports,\"rankSortDictionary\",{enumerable:true,get:function(){return __m0[\"rankSortDictionary\"];}});\nObject.defineProperty(__exports,\"mergeSortComparator\",{enumerable:true,get:function(){return __m0[\"mergeSortComparator\"];}});\nconst __m1=__req(\"packages/core/src/compute/filter.js\");\nObject.defineProperty(__exports,\"evaluateFilters\",{enumerable:true,get:function(){return __m1[\"evaluateFilters\"];}});\nObject.defineProperty(__exports,\"evaluateCondition\",{enumerable:true,get:function(){return __m1[\"evaluateCondition\"];}});\nObject.defineProperty(__exports,\"compact\",{enumerable:true,get:function(){return __m1[\"compact\"];}});\nObject.defineProperty(__exports,\"testValue\",{enumerable:true,get:function(){return __m1[\"testValue\"];}});\nObject.defineProperty(__exports,\"compilePredicate\",{enumerable:true,get:function(){return __m1[\"compilePredicate\"];}});\nObject.defineProperty(__exports,\"releaseMask\",{enumerable:true,get:function(){return __m1[\"releaseMask\"];}});\nObject.defineProperty(__exports,\"pruneColumn\",{enumerable:true,get:function(){return __m1[\"pruneColumn\"];}});\nObject.defineProperty(__exports,\"mentionsColumn\",{enumerable:true,get:function(){return __m1[\"mentionsColumn\"];}});\nconst __m2=__req(\"packages/core/src/compute/group.js\");\nObject.defineProperty(__exports,\"groupByColumns\",{enumerable:true,get:function(){return __m2[\"groupByColumns\"];}});\nObject.defineProperty(__exports,\"packKeys\",{enumerable:true,get:function(){return __m2[\"packKeys\"];}});\nconst __m3=__req(\"packages/core/src/compute/facet.js\");\nObject.defineProperty(__exports,\"facet\",{enumerable:true,get:function(){return __m3[\"facet\"];}});\nObject.defineProperty(__exports,\"computeBounds\",{enumerable:true,get:function(){return __m3[\"computeBounds\"];}});\nObject.defineProperty(__exports,\"countInto\",{enumerable:true,get:function(){return __m3[\"countInto\"];}});\nObject.defineProperty(__exports,\"bucketOf\",{enumerable:true,get:function(){return __m3[\"bucketOf\"];}});\nObject.defineProperty(__exports,\"facetKind\",{enumerable:true,get:function(){return __m3[\"facetKind\"];}});\nObject.defineProperty(__exports,\"cardinalityOf\",{enumerable:true,get:function(){return __m3[\"cardinalityOf\"];}});\nObject.defineProperty(__exports,\"pickGranularity\",{enumerable:true,get:function(){return __m3[\"pickGranularity\"];}});\nObject.defineProperty(__exports,\"floorTo\",{enumerable:true,get:function(){return __m3[\"floorTo\"];}});\nObject.defineProperty(__exports,\"advance\",{enumerable:true,get:function(){return __m3[\"advance\"];}});\nObject.defineProperty(__exports,\"STRATEGIES\",{enumerable:true,get:function(){return __m3[\"STRATEGIES\"];}});\nObject.defineProperty(__exports,\"GRANULARITIES\",{enumerable:true,get:function(){return __m3[\"GRANULARITIES\"];}});\nObject.defineProperty(__exports,\"DEFAULT_BUCKETS\",{enumerable:true,get:function(){return __m3[\"DEFAULT_BUCKETS\"];}});\nObject.defineProperty(__exports,\"DEFAULT_CARDINALITY_LIMIT\",{enumerable:true,get:function(){return __m3[\"DEFAULT_CARDINALITY_LIMIT\"];}});\nObject.defineProperty(__exports,\"QUANTILE_SAMPLE\",{enumerable:true,get:function(){return __m3[\"QUANTILE_SAMPLE\"];}});\nconst __m4=__req(\"packages/core/src/compute/total.js\");\nObject.defineProperty(__exports,\"TOTAL_FNS\",{enumerable:true,get:function(){return __m4[\"TOTAL_FNS\"];}});\nObject.defineProperty(__exports,\"TOTAL_LABELS\",{enumerable:true,get:function(){return __m4[\"TOTAL_LABELS\"];}});\nObject.defineProperty(__exports,\"totalLabel\",{enumerable:true,get:function(){return __m4[\"totalLabel\"];}});\nObject.defineProperty(__exports,\"total\",{enumerable:true,get:function(){return __m4[\"total\"];}});\nObject.defineProperty(__exports,\"collectValues\",{enumerable:true,get:function(){return __m4[\"collectValues\"];}});\nconst __m5=__req(\"packages/core/src/compute/pivot.js\");\nObject.defineProperty(__exports,\"pivot\",{enumerable:true,get:function(){return __m5[\"pivot\"];}});\nObject.defineProperty(__exports,\"resolvePivotKeys\",{enumerable:true,get:function(){return __m5[\"resolvePivotKeys\"];}});\nObject.defineProperty(__exports,\"pivotKey\",{enumerable:true,get:function(){return __m5[\"pivotKey\"];}});\nObject.defineProperty(__exports,\"joinPath\",{enumerable:true,get:function(){return __m5[\"joinPath\"];}});\nObject.defineProperty(__exports,\"KEY_DELIMITER\",{enumerable:true,get:function(){return __m5[\"KEY_DELIMITER\"];}});\nObject.defineProperty(__exports,\"DEFAULT_PATH_SEPARATOR\",{enumerable:true,get:function(){return __m5[\"DEFAULT_PATH_SEPARATOR\"];}});\nObject.defineProperty(__exports,\"DEFAULT_MAX_COLUMNS\",{enumerable:true,get:function(){return __m5[\"DEFAULT_MAX_COLUMNS\"];}});\nconst __m6=__req(\"packages/core/src/compute/reference.js\");\nObject.defineProperty(__exports,\"referenceSort\",{enumerable:true,get:function(){return __m6[\"referenceSort\"];}});\nObject.defineProperty(__exports,\"referenceFilter\",{enumerable:true,get:function(){return __m6[\"referenceFilter\"];}});\nObject.defineProperty(__exports,\"referenceGroup\",{enumerable:true,get:function(){return __m6[\"referenceGroup\"];}});\nObject.defineProperty(__exports,\"referenceTotal\",{enumerable:true,get:function(){return __m6[\"referenceTotal\"];}});\nObject.defineProperty(__exports,\"referencePasses\",{enumerable:true,get:function(){return __m6[\"referencePasses\"];}});\nObject.defineProperty(__exports,\"referenceValue\",{enumerable:true,get:function(){return __m6[\"referenceValue\"];}});\nconst __m7=__req(\"packages/core/src/compute/handle.js\");\nObject.defineProperty(__exports,\"identity\",{enumerable:true,get:function(){return __m7[\"identity\"];}});\nObject.defineProperty(__exports,\"rowCount\",{enumerable:true,get:function(){return __m7[\"rowCount\"];}});\nObject.defineProperty(__exports,\"presenceReader\",{enumerable:true,get:function(){return __m7[\"presenceReader\"];}});\nObject.defineProperty(__exports,\"bitReader\",{enumerable:true,get:function(){return __m7[\"bitReader\"];}});\nObject.defineProperty(__exports,\"valueReader\",{enumerable:true,get:function(){return __m7[\"valueReader\"];}});\nObject.defineProperty(__exports,\"valueComparator\",{enumerable:true,get:function(){return __m7[\"valueComparator\"];}});\nObject.defineProperty(__exports,\"numericTotalOrder\",{enumerable:true,get:function(){return __m7[\"numericTotalOrder\"];}});\nObject.defineProperty(__exports,\"dictRanks\",{enumerable:true,get:function(){return __m7[\"dictRanks\"];}});\nObject.defineProperty(__exports,\"dictSize\",{enumerable:true,get:function(){return __m7[\"dictSize\"];}});\nObject.defineProperty(__exports,\"dictValue\",{enumerable:true,get:function(){return __m7[\"dictValue\"];}});\nObject.defineProperty(__exports,\"multiValue\",{enumerable:true,get:function(){return __m7[\"multiValue\"];}});\nObject.defineProperty(__exports,\"isMissing\",{enumerable:true,get:function(){return __m7[\"isMissing\"];}});\n});\n__def(\"packages/worker/src/kernel.js\",function(__exports,__req){\n'use strict';\nObject.defineProperty(__exports,\"loadCompute\",{enumerable:true,get:function(){return loadCompute;}});\nObject.defineProperty(__exports,\"setCompute\",{enumerable:true,get:function(){return setCompute;}});\nObject.defineProperty(__exports,\"dispatch\",{enumerable:true,get:function(){return dispatch;}});\nObject.defineProperty(__exports,\"handleMessage\",{enumerable:true,get:function(){return handleMessage;}});\nObject.defineProperty(__exports,\"installKernel\",{enumerable:true,get:function(){return installKernel;}});\nconst __m0=__req(\"packages/worker/src/transport.js\");\nconst PROTOCOL=__m0[\"PROTOCOL\"];\nconst OPS=__m0[\"OPS\"];\nconst CONTROL=__m0[\"CONTROL\"];\nconst ERRORS=__m0[\"ERRORS\"];\nconst unpackHandle=__m0[\"unpackHandle\"];\nconst unpackHandles=__m0[\"unpackHandles\"];\nconst createMaskPool=__m0[\"createMaskPool\"];\nconst collectTransfers=__m0[\"collectTransfers\"];\nlet computeModule=null;\nlet computePromise=null;\nlet computeError=null;\nasync function loadCompute(loader){\nif(computeModule)return computeModule;\nif(!computePromise){\nconst load=loader||(()=>Promise.resolve(__req(\"packages/core/src/compute/index.js\")));\ncomputePromise=Promise.resolve()\n.then(load)\n.then((mod)=>{computeModule=mod;return mod;})\n.catch((err)=>{\ncomputeError=err;\ncomputeModule=null;\nreturn null;\n});\n}\nreturn computePromise;\n}\nfunction setCompute(mod){\ncomputeModule=mod;\ncomputePromise=mod?Promise.resolve(mod):null;\ncomputeError=mod?null:computeError;\n}\nfunction filterContext(handles,count,locale){\nconst byId=new Map();\nfor(const h of handles)if(h)byId.set(h.id,h);\nreturn{\nhandle(colId){return byId.get(colId);},\ncount,\npool:createMaskPool(),\nlocale,\n};\n}\nfunction dispatch(request,compute){\nconst{op,args}=request;\nconst fn=compute[op];\nif(typeof fn!=='function'){\nconst err=new Error(`[lattice] compute kernel '${op}' is not exported`);\n(err).code=ERRORS.NO_KERNEL;\nthrow err;\n}\nswitch(op){\ncase OPS.SORT_COLUMN:\nreturn fn(unpackHandle(args.handle),args.order??null,args.opts||{});\ncase OPS.SORT_MULTI:{\nconst handles=unpackHandles(args.handles||[]);\nconst entries=(args.entries||[]).map((e)=>({\n...e,\nhandle:handles[e.index],\n}));\nreturn fn(handles,entries,args.order??null);\n}\ncase OPS.EVALUATE_FILTERS:\nreturn fn(args.filters,filterContext(unpackHandles(args.handles||[]),args.count,args.locale));\ncase OPS.COMPACT:\nreturn fn(args.mask,args.count,undefined);\ncase OPS.GROUP_BY_COLUMNS:\nreturn fn(unpackHandles(args.handles||[]),args.order??null,args.opts||{});\ncase OPS.TOTAL:\nreturn fn(unpackHandle(args.handle),args.indices??null,args.fn);\ncase OPS.PIVOT:\nreturn fn(unpackHandles(args.handles||[]),args.order??null,args.opts||{});\ncase OPS.FACET:\nreturn fn(unpackHandle(args.handle),args.indices??null,args.count,args.opts||{});\ndefault:{\nconst err=new Error(`[lattice] unknown worker op '${op}'`);\n(err).code=ERRORS.PROTOCOL;\nthrow err;\n}\n}\n}\nasync function handleMessage(message,opts={}){\nif(!message||message.lattice!==PROTOCOL)return null;\nconst{id,op}=message;\nif(op===CONTROL.CANCEL){\nopts.cancelled?.add(message.target);\nreturn null;\n}\nif(op===CONTROL.PING){\nreturn{reply:{lattice:PROTOCOL,id,ok:true,result:'pong'},transfer:[]};\n}\nconst compute=await loadCompute(opts.loader);\nif(!compute){\nreturn{\nreply:{\nlattice:PROTOCOL,\nid,\nok:false,\nerror:{\ncode:ERRORS.NO_COMPUTE,\nmessage:`[lattice] compute kernels unavailable in worker: ${computeError?computeError.message:'module not found'}`,\n},\n},\ntransfer:[],\n};\n}\nif(opts.cancelled?.has(id)){\nopts.cancelled.delete(id);\nreturn{reply:{lattice:PROTOCOL,id,ok:false,error:{code:ERRORS.ABORTED,message:'[lattice] request superseded'}},transfer:[]};\n}\ntry{\nconst result=dispatch(message,compute);\nif(opts.cancelled?.has(id)){\nopts.cancelled.delete(id);\nreturn{reply:{lattice:PROTOCOL,id,ok:false,error:{code:ERRORS.ABORTED,message:'[lattice] request superseded'}},transfer:[]};\n}\nreturn{reply:{lattice:PROTOCOL,id,ok:true,result},transfer:collectTransfers(result)};\n}catch(err){\nconst e=(err);\nreturn{\nreply:{\nlattice:PROTOCOL,\nid,\nok:false,\nerror:{code:e.code||ERRORS.KERNEL,message:e.message||String(err),stack:e.stack},\n},\ntransfer:[],\n};\n}\n}\nfunction installKernel(scope,opts={}){\nconst cancelled=new Set();\nconst onMessage=async(event)=>{\nconst outcome=await handleMessage(event.data,{loader:opts.loader,cancelled});\nif(!outcome)return;\nscope.postMessage(outcome.reply,outcome.transfer);\n};\nscope.addEventListener('message',onMessage);\nloadCompute(opts.loader).then((mod)=>{\nscope.postMessage({lattice:PROTOCOL,id:0,op:CONTROL.READY,compute:!!mod});\n});\nreturn()=>scope.removeEventListener('message',onMessage);\n}\n});\nvar __entry=__req(\"packages/worker/src/kernel.js\");\nroot[\"__latticeKernel\"]=__entry;\n})(typeof globalThis!=='undefined'?globalThis:this);\n__latticeKernel.installKernel(self);\n",{type:'classic'});
 }catch(err){}
 const __entry=__req("packages/dom/src/index.js");
 export const
@@ -61014,6 +63319,7 @@ alignGrids=__entry.alignGrids,
 layoutState=__entry.layoutState,
 ToolPanelDock=__entry.ToolPanelDock,
 panelHost=__entry.panelHost,
+mountPanel=__entry.mountPanel,
 CellEditController=__entry.CellEditController,
 EditBar=__entry.EditBar,
 HistoryBar=__entry.HistoryBar,