@danielsimonjr/mathts-functions 0.41.0 → 0.42.0

package/dist/index.d.ts

@@ -51,6 +51,10 @@ export { quad } from './numeric/adaptive-quad.js';
 export type { QuadOptions, QuadResult } from './numeric/adaptive-quad.js';
 export { interpn } from './numeric/interpn.js';
 export type { NDArrayInput } from './numeric/interpn.js';
+export { bsplineFit, bsplineEval } from './numeric/bspline.js';
+export type { BSplineFitOptions, BSplineTuple } from './numeric/bspline.js';
+export { monteCarloIntegrate } from './numeric/monte-carlo.js';
+export type { Bound, MonteCarloOptions, MonteCarloResult } from './numeric/monte-carlo.js';
 export { movingAverage, ewma, detrend, acf } from './timeseries-extra.js';
 export { pacf, ljungBox, durbinWatson, adfuller } from './stats/timeseries.js';
 export type { LjungBoxResult, AdfullerResult } from './stats/timeseries.js';
@@ -98,6 +102,7 @@ export { polygamma, trigamma, jacobiP, gegenbauerC } from './special/polygamma-o
 export { jacobiSN, jacobiCN, jacobiDN } from './special/jacobi-elliptic.js';
 export { rootsLegendre } from './numeric/gauss-nodes.js';
 export type { RootsLegendreResult } from './numeric/gauss-nodes.js';
+export { polylog, struveH, struveL, kelvinBer, kelvinBei, barnesG } from './special/niche.js';
 export { bfs, dfs, floydWarshall, bellmanFord, closenessCentrality, harmonicCentrality, } from './graph/traversal-centrality.js';
 export type { BellmanFordResult } from './graph/traversal-centrality.js';
 export { maxFlow, minCut, astar, hungarian } from './graph/optimization.js';

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,cAAc,kBAAkB,CAAC;AAKjC,cAAc,gBAAgB,CAAC;AAG/B,cAAc,sBAAsB,CAAC;AACrC,OAAO,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAOzC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAG7C,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGlG,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAMjC,OAAO,EACL,iBAAiB,EACjB,YAAY,EACZ,UAAU,EACV,WAAW,EACX,aAAa,EACb,mBAAmB,EACnB,eAAe,EACf,eAAe,EACf,eAAe,GAChB,MAAM,yBAAyB,CAAC;AAGjC,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACnF,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAGhD,OAAO,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,GAAG,EACH,GAAG,EACH,MAAM,EACN,GAAG,EACH,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,UAAU,EACV,UAAU,EACV,QAAQ,EACR,SAAS,EACT,UAAU,EACV,cAAc,EACd,GAAG,EACH,SAAS,EACT,WAAW,EACX,QAAQ,EACR,SAAS,GACV,MAAM,wBAAwB,CAAC;AAChC,YAAY,EACV,gBAAgB,EAChB,qBAAqB,EACrB,oBAAoB,EACpB,cAAc,EACd,eAAe,GAChB,MAAM,wBAAwB,CAAC;AAGhC,OAAO,EACL,KAAK,EACL,OAAO,EACP,SAAS,EACT,OAAO,EACP,OAAO,EACP,MAAM,EACN,MAAM,EACN,QAAQ,GACT,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EACL,cAAc,EACd,WAAW,EACX,gBAAgB,EAChB,aAAa,EACb,kBAAkB,EAClB,IAAI,EACJ,SAAS,EACT,QAAQ,EACR,aAAa,EACb,OAAO,EACP,YAAY,EACZ,SAAS,EACT,SAAS,EACT,cAAc,EACd,UAAU,EACV,UAAU,EACV,eAAe,EACf,WAAW,EACX,WAAW,EACX,gBAAgB,GACjB,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EACL,KAAK,EACL,UAAU,EACV,aAAa,EACb,QAAQ,EACR,WAAW,EACX,mBAAmB,EACnB,wBAAwB,EACxB,QAAQ,GACT,MAAM,uBAAuB,CAAC;AAC/B,YAAY,EACV,WAAW,EACX,gBAAgB,EAChB,aAAa,EACb,cAAc,EACd,iBAAiB,EACjB,eAAe,GAChB,MAAM,uBAAuB,CAAC;AAI/B,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,MAAM,EACN,QAAQ,EACR,SAAS,EACT,SAAS,EACT,MAAM,EACN,eAAe,EACf,cAAc,EACd,EAAE,GACH,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAKxD,OAAO,EAAE,GAAG,EAAE,MAAM,8BAA8B,CAAC;AACnD,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC1E,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAC7C,YAAY,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAIzD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,YAAY,EAAE,WAAW,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AAIzF,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,gCAAgC,CAAC;AACxE,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAIlG,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AACnD,YAAY,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAMzD,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAClE,YAAY,EACV,mBAAmB,EACnB,cAAc,EACd,aAAa,EACb,YAAY,EACZ,YAAY,GACb,MAAM,qBAAqB,CAAC;AAM7B,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAC3C,YAAY,EAAE,kBAAkB,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAOxF,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,iCAAiC,CAAC;AAC/F,YAAY,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AAQjE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AACzF,YAAY,EACV,YAAY,EACZ,aAAa,EACb,qBAAqB,GACtB,MAAM,+BAA+B,CAAC;AAQvC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,gCAAgC,CAAC;AAKnE,OAAO,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAC9D,YAAY,EAAE,qBAAqB,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AAKhG,OAAO,EAAE,IAAI,EAAE,MAAM,4BAA4B,CAAC;AAClD,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAM1E,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAC/C,YAAY,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAGzD,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAI1E,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAC/E,YAAY,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAG5E,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,YAAY,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAG9D,OAAO,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAClC,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAGzD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAC1E,YAAY,EACV,YAAY,EACZ,wBAAwB,EACxB,2BAA2B,GAC5B,MAAM,gCAAgC,CAAC;AAGxC,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACjE,YAAY,EACV,yBAAyB,EACzB,wBAAwB,GACzB,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC1F,YAAY,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGxE,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAInE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAIrE,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,YAAY,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAIzE,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC3E,YAAY,EACV,sBAAsB,EACtB,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,4BAA4B,CAAC;AAIpC,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,YAAY,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC;AAM3F,OAAO,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AACzC,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACjE,YAAY,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAK1D,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACrD,YAAY,EACV,WAAW,EACX,UAAU,EACV,iBAAiB,EACjB,gBAAgB,GACjB,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAGxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAGxF,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,yBAAyB,CAAC;AAIpG,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAIpG,OAAO,EACL,cAAc,EACd,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,UAAU,GACX,MAAM,2BAA2B,CAAC;AACnC,YAAY,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAIlE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAKnE,OAAO,EACL,SAAS,EACT,UAAU,EACV,GAAG,EACH,SAAS,EACT,IAAI,EACJ,KAAK,EACL,QAAQ,GACT,MAAM,4BAA4B,CAAC;AACpC,YAAY,EACV,gBAAgB,EAChB,UAAU,EACV,WAAW,EACX,UAAU,GACX,MAAM,4BAA4B,CAAC;AAGpC,OAAO,EACL,SAAS,EACT,eAAe,EACf,KAAK,EACL,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,uBAAuB,EACvB,gBAAgB,EAChB,0BAA0B,GAC3B,MAAM,qBAAqB,CAAC;AAI7B,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,iBAAiB,EACjB,aAAa,EACb,aAAa,EACb,aAAa,EACb,WAAW,EACX,UAAU,EACV,SAAS,EACT,YAAY,EACZ,aAAa,EACb,QAAQ,EACR,WAAW,GACZ,MAAM,8BAA8B,CAAC;AACtC,YAAY,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAGrE,OAAO,EACL,oBAAoB,EACpB,iBAAiB,EACjB,qBAAqB,GACtB,MAAM,2BAA2B,CAAC;AACnC,YAAY,EAAE,MAAM,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAU9E,OAAO,EACL,iBAAiB,EACjB,cAAc,EACd,cAAc,EACd,QAAQ,EACR,OAAO,EACP,OAAO,EACP,WAAW,EACX,OAAO,EACP,QAAQ,GACT,MAAM,6BAA6B,CAAC;AACrC,YAAY,EACV,eAAe,EACf,cAAc,EACd,aAAa,EACb,cAAc,GACf,MAAM,6BAA6B,CAAC;AAIrC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,6BAA6B,CAAC;AAK1E,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAM7F,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,8BAA8B,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACzD,YAAY,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAMpE,OAAO,EACL,GAAG,EACH,GAAG,EACH,aAAa,EACb,WAAW,EACX,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,iCAAiC,CAAC;AACzC,YAAY,EAAE,iBAAiB,EAAE,MAAM,iCAAiC,CAAC;AAKzE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAC5E,YAAY,EACV,aAAa,EACb,YAAY,EACZ,WAAW,EACX,eAAe,GAChB,MAAM,yBAAyB,CAAC;AAMjC,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAO3D,OAAO,EACL,aAAa,EACb,SAAS,EACT,kBAAkB,EAClB,cAAc,EACd,YAAY,GACb,MAAM,+BAA+B,CAAC;AAKvC,OAAO,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAClC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAK7E,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AACnD,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAI1E,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AACvD,YAAY,EAAE,qBAAqB,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,cAAc,kBAAkB,CAAC;AAKjC,cAAc,gBAAgB,CAAC;AAG/B,cAAc,sBAAsB,CAAC;AACrC,OAAO,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAOzC,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,iBAAiB,CAAC;AAG7C,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGlG,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAMjC,OAAO,EACL,iBAAiB,EACjB,YAAY,EACZ,UAAU,EACV,WAAW,EACX,aAAa,EACb,mBAAmB,EACnB,eAAe,EACf,eAAe,EACf,eAAe,GAChB,MAAM,yBAAyB,CAAC;AAGjC,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACnF,YAAY,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAGhD,OAAO,EACL,KAAK,EACL,KAAK,EACL,MAAM,EACN,QAAQ,EACR,QAAQ,EACR,GAAG,EACH,GAAG,EACH,MAAM,EACN,GAAG,EACH,QAAQ,EACR,QAAQ,EACR,QAAQ,EACR,UAAU,EACV,UAAU,EACV,QAAQ,EACR,SAAS,EACT,UAAU,EACV,cAAc,EACd,GAAG,EACH,SAAS,EACT,WAAW,EACX,QAAQ,EACR,SAAS,GACV,MAAM,wBAAwB,CAAC;AAChC,YAAY,EACV,gBAAgB,EAChB,qBAAqB,EACrB,oBAAoB,EACpB,cAAc,EACd,eAAe,GAChB,MAAM,wBAAwB,CAAC;AAGhC,OAAO,EACL,KAAK,EACL,OAAO,EACP,SAAS,EACT,OAAO,EACP,OAAO,EACP,MAAM,EACN,MAAM,EACN,QAAQ,GACT,MAAM,oBAAoB,CAAC;AAG5B,OAAO,EACL,cAAc,EACd,WAAW,EACX,gBAAgB,EAChB,aAAa,EACb,kBAAkB,EAClB,IAAI,EACJ,SAAS,EACT,QAAQ,EACR,aAAa,EACb,OAAO,EACP,YAAY,EACZ,SAAS,EACT,SAAS,EACT,cAAc,EACd,UAAU,EACV,UAAU,EACV,eAAe,EACf,WAAW,EACX,WAAW,EACX,gBAAgB,GACjB,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EACL,KAAK,EACL,UAAU,EACV,aAAa,EACb,QAAQ,EACR,WAAW,EACX,mBAAmB,EACnB,wBAAwB,EACxB,QAAQ,GACT,MAAM,uBAAuB,CAAC;AAC/B,YAAY,EACV,WAAW,EACX,gBAAgB,EAChB,aAAa,EACb,cAAc,EACd,iBAAiB,EACjB,eAAe,GAChB,MAAM,uBAAuB,CAAC;AAI/B,OAAO,EACL,IAAI,EACJ,IAAI,EACJ,MAAM,EACN,QAAQ,EACR,SAAS,EACT,SAAS,EACT,MAAM,EACN,eAAe,EACf,cAAc,EACd,EAAE,GACH,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAKxD,OAAO,EAAE,GAAG,EAAE,MAAM,8BAA8B,CAAC;AACnD,YAAY,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,8BAA8B,CAAC;AAC1E,OAAO,EAAE,IAAI,EAAE,MAAM,uBAAuB,CAAC;AAC7C,YAAY,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAIzD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,YAAY,EAAE,WAAW,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAC;AAIzF,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,gCAAgC,CAAC;AACxE,YAAY,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAIlG,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AACnD,YAAY,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAMzD,OAAO,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAClE,YAAY,EACV,mBAAmB,EACnB,cAAc,EACd,aAAa,EACb,YAAY,EACZ,YAAY,GACb,MAAM,qBAAqB,CAAC;AAM7B,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAC3C,YAAY,EAAE,kBAAkB,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAOxF,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,aAAa,EAAE,GAAG,EAAE,MAAM,iCAAiC,CAAC;AAC/F,YAAY,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AAQjE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,+BAA+B,CAAC;AACzF,YAAY,EACV,YAAY,EACZ,aAAa,EACb,qBAAqB,GACtB,MAAM,+BAA+B,CAAC;AAQvC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,gCAAgC,CAAC;AAKnE,OAAO,EAAE,cAAc,EAAE,MAAM,8BAA8B,CAAC;AAC9D,YAAY,EAAE,qBAAqB,EAAE,oBAAoB,EAAE,MAAM,8BAA8B,CAAC;AAKhG,OAAO,EAAE,IAAI,EAAE,MAAM,4BAA4B,CAAC;AAClD,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAM1E,OAAO,EAAE,OAAO,EAAE,MAAM,sBAAsB,CAAC;AAC/C,YAAY,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAOzD,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAC/D,YAAY,EAAE,iBAAiB,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAM5E,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,YAAY,EAAE,KAAK,EAAE,iBAAiB,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAG3F,OAAO,EAAE,aAAa,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAI1E,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAC/E,YAAY,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAG5E,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AACzD,YAAY,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAG9D,OAAO,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAClC,YAAY,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAGzD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,gCAAgC,CAAC;AAC1E,YAAY,EACV,YAAY,EACZ,wBAAwB,EACxB,2BAA2B,GAC5B,MAAM,gCAAgC,CAAC;AAGxC,OAAO,EAAE,kBAAkB,EAAE,MAAM,6BAA6B,CAAC;AACjE,YAAY,EACV,yBAAyB,EACzB,wBAAwB,GACzB,MAAM,6BAA6B,CAAC;AAGrC,OAAO,EAAE,UAAU,EAAE,eAAe,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAC1F,YAAY,EAAE,cAAc,EAAE,QAAQ,EAAE,MAAM,yBAAyB,CAAC;AAGxE,OAAO,EAAE,MAAM,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAInE,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAC;AAIrE,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,YAAY,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAIzE,OAAO,EAAE,eAAe,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC3E,YAAY,EACV,sBAAsB,EACtB,qBAAqB,EACrB,kBAAkB,GACnB,MAAM,4BAA4B,CAAC;AAIpC,OAAO,EAAE,eAAe,EAAE,MAAM,6BAA6B,CAAC;AAC9D,YAAY,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,6BAA6B,CAAC;AAM3F,OAAO,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AACzC,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACjE,YAAY,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AAK1D,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AACrD,YAAY,EACV,WAAW,EACX,UAAU,EACV,iBAAiB,EACjB,gBAAgB,GACjB,MAAM,mBAAmB,CAAC;AAG3B,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAGxD,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAGxF,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,yBAAyB,CAAC;AAIpG,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAIpG,OAAO,EACL,cAAc,EACd,KAAK,EACL,KAAK,EACL,MAAM,EACN,MAAM,EACN,UAAU,GACX,MAAM,2BAA2B,CAAC;AACnC,YAAY,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAIlE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,sBAAsB,CAAC;AAKnE,OAAO,EACL,SAAS,EACT,UAAU,EACV,GAAG,EACH,SAAS,EACT,IAAI,EACJ,KAAK,EACL,QAAQ,GACT,MAAM,4BAA4B,CAAC;AACpC,YAAY,EACV,gBAAgB,EAChB,UAAU,EACV,WAAW,EACX,UAAU,GACX,MAAM,4BAA4B,CAAC;AAGpC,OAAO,EACL,SAAS,EACT,eAAe,EACf,KAAK,EACL,kBAAkB,EAClB,mBAAmB,EACnB,mBAAmB,EACnB,uBAAuB,EACvB,gBAAgB,EAChB,0BAA0B,GAC3B,MAAM,qBAAqB,CAAC;AAI7B,OAAO,EACL,iBAAiB,EACjB,eAAe,EACf,iBAAiB,EACjB,aAAa,EACb,aAAa,EACb,aAAa,EACb,WAAW,EACX,UAAU,EACV,SAAS,EACT,YAAY,EACZ,aAAa,EACb,QAAQ,EACR,WAAW,GACZ,MAAM,8BAA8B,CAAC;AACtC,YAAY,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAGrE,OAAO,EACL,oBAAoB,EACpB,iBAAiB,EACjB,qBAAqB,GACtB,MAAM,2BAA2B,CAAC;AACnC,YAAY,EAAE,MAAM,EAAE,oBAAoB,EAAE,MAAM,2BAA2B,CAAC;AAU9E,OAAO,EACL,iBAAiB,EACjB,cAAc,EACd,cAAc,EACd,QAAQ,EACR,OAAO,EACP,OAAO,EACP,WAAW,EACX,OAAO,EACP,QAAQ,GACT,MAAM,6BAA6B,CAAC;AACrC,YAAY,EACV,eAAe,EACf,cAAc,EACd,aAAa,EACb,cAAc,GACf,MAAM,6BAA6B,CAAC;AAIrC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,6BAA6B,CAAC;AAK1E,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,OAAO,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAM7F,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,8BAA8B,CAAC;AAC5E,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AACzD,YAAY,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAIpE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAM9F,OAAO,EACL,GAAG,EACH,GAAG,EACH,aAAa,EACb,WAAW,EACX,mBAAmB,EACnB,kBAAkB,GACnB,MAAM,iCAAiC,CAAC;AACzC,YAAY,EAAE,iBAAiB,EAAE,MAAM,iCAAiC,CAAC;AAKzE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAC5E,YAAY,EACV,aAAa,EACb,YAAY,EACZ,WAAW,EACX,eAAe,GAChB,MAAM,yBAAyB,CAAC;AAMjC,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,uBAAuB,CAAC;AAO3D,OAAO,EACL,aAAa,EACb,SAAS,EACT,kBAAkB,EAClB,cAAc,EACd,YAAY,GACb,MAAM,+BAA+B,CAAC;AAKvC,OAAO,EAAE,GAAG,EAAE,MAAM,aAAa,CAAC;AAClC,YAAY,EAAE,SAAS,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,aAAa,CAAC;AAK7E,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AACnD,YAAY,EAAE,SAAS,EAAE,MAAM,EAAE,gBAAgB,EAAE,MAAM,gBAAgB,CAAC;AAI1E,OAAO,EAAE,UAAU,EAAE,MAAM,2BAA2B,CAAC;AACvD,YAAY,EAAE,qBAAqB,EAAE,iBAAiB,EAAE,MAAM,2BAA2B,CAAC"}

package/dist/index.js

@@ -47631,6 +47631,228 @@ function interpn(grids, values, query) {
   });
 }
 
+// src/numeric/bspline.ts
+function findSpan(n, p, u, U) {
+  if (u >= U[n + 1]) return n;
+  if (u <= U[p]) return p;
+  let low = p;
+  let high = n + 1;
+  let mid = Math.floor((low + high) / 2);
+  while (u < U[mid] || u >= U[mid + 1]) {
+    if (u < U[mid]) high = mid;
+    else low = mid;
+    mid = Math.floor((low + high) / 2);
+  }
+  return mid;
+}
+function basisFuns(span, u, p, U) {
+  const N = new Array(p + 1);
+  N[0] = 1;
+  const left = new Array(p + 1);
+  const right = new Array(p + 1);
+  for (let j = 1; j <= p; j++) {
+    left[j] = u - U[span + 1 - j];
+    right[j] = U[span + j] - u;
+    let saved = 0;
+    for (let r = 0; r < j; r++) {
+      const temp = N[r] / (right[r + 1] + left[j - r]);
+      N[r] = saved + right[r + 1] * temp;
+      saved = left[j - r] * temp;
+    }
+    N[j] = saved;
+  }
+  return N;
+}
+function validateXY(x, y) {
+  if (x.length !== y.length) throw new Error("bsplineFit: x and y must have the same length");
+  for (let i = 1; i < x.length; i++) {
+    if (!(x[i] > x[i - 1])) throw new Error("bsplineFit: x must be strictly increasing");
+  }
+}
+function buildDesignMatrix(x, t, k, numCoef) {
+  const n = x.length;
+  const A = Array.from({ length: n }, () => new Array(numCoef).fill(0));
+  for (let i = 0; i < n; i++) {
+    const span = findSpan(numCoef - 1, k, x[i], t);
+    const N = basisFuns(span, x[i], k, t);
+    for (let j = 0; j <= k; j++) A[i][span - k + j] = N[j];
+  }
+  return A;
+}
+function bsplineFit(x, y, opts = {}) {
+  validateXY(x, y);
+  const k = opts.k ?? 3;
+  const n = x.length;
+  if (n <= k) {
+    throw new Error(`bsplineFit: need more than ${k} data points for a degree-${k} fit`);
+  }
+  const s = opts.s ?? 0;
+  const x0 = x[0];
+  const xN = x[n - 1];
+  if (s <= 0 && opts.nknots === void 0) {
+    const m2 = n + k + 1;
+    const t2 = new Array(m2);
+    for (let i = 0; i <= k; i++) t2[i] = x0;
+    for (let i = 0; i <= k; i++) t2[m2 - 1 - i] = xN;
+    for (let j = 1; j <= n - k - 1; j++) {
+      let sum3 = 0;
+      for (let i = j; i <= j + k - 1; i++) sum3 += x[i];
+      t2[k + j] = sum3 / k;
+    }
+    const A2 = buildDesignMatrix(x, t2, k, n);
+    const c2 = linsolve(A2, [...y]);
+    return { t: t2, c: c2, k };
+  }
+  const maxInterior = Math.max(0, n - k - 2);
+  const heuristicInterior = Math.round((n - k - 1) / (1 + Math.max(0, s)));
+  let numInterior = opts.nknots ?? heuristicInterior;
+  numInterior = Math.min(Math.max(0, numInterior), maxInterior);
+  const numCoef = numInterior + k + 1;
+  const m = numCoef + k + 1;
+  const t = new Array(m);
+  for (let i = 0; i <= k; i++) t[i] = x0;
+  for (let i = 0; i <= k; i++) t[m - 1 - i] = xN;
+  for (let j = 1; j <= numInterior; j++) {
+    t[k + j] = x0 + j * (xN - x0) / (numInterior + 1);
+  }
+  const A = buildDesignMatrix(x, t, k, numCoef);
+  const c = leastSquares(A, [...y]);
+  return { t, c, k };
+}
+function bsplineEval(spline, xnew) {
+  const { t, c, k } = spline;
+  const nLast = c.length - 1;
+  const evalOne = (x) => {
+    const span = findSpan(nLast, k, x, t);
+    const N = basisFuns(span, x, k, t);
+    let val = 0;
+    for (let j = 0; j <= k; j++) val += N[j] * c[span - k + j];
+    return val;
+  };
+  return Array.isArray(xnew) ? xnew.map(evalOne) : evalOne(xnew);
+}
+
+// src/numeric/monte-carlo.ts
+function isPrime2(x) {
+  if (x < 2) return false;
+  for (let i = 2; i * i <= x; i++) {
+    if (x % i === 0) return false;
+  }
+  return true;
+}
+function nthPrime(k) {
+  let count2 = 0;
+  let candidate = 1;
+  while (count2 < k) {
+    candidate++;
+    if (isPrime2(candidate)) count2++;
+  }
+  return candidate;
+}
+function vanDerCorput(idx, base) {
+  let f = 1;
+  let r = 0;
+  let i = idx;
+  while (i > 0) {
+    f /= base;
+    r += f * (i % base);
+    i = Math.floor(i / base);
+  }
+  return r;
+}
+function haltonSequence(n, dims) {
+  const bases = Array.from({ length: dims }, (_, d) => nthPrime(d + 1));
+  const points = [];
+  for (let idx = 1; idx <= n; idx++) {
+    points.push(bases.map((b) => vanDerCorput(idx, b)));
+  }
+  return points;
+}
+var SOBOL_BITS = 30;
+function sobolDirectionNumbers(dim, bits) {
+  const M = new Array(bits + 1).fill(0);
+  if (dim === 0) {
+    for (let i = 1; i <= bits; i++) M[i] = 1;
+    return M;
+  }
+  M[1] = 1;
+  for (let i = 2; i <= bits; i++) {
+    M[i] = 2 * M[i - 1] ^ M[i - 1];
+  }
+  return M;
+}
+function sobolSequence(n, dims) {
+  if (dims < 1 || dims > 2) {
+    throw new Error(
+      "monteCarloIntegrate: method 'sobol' supports only 1-2 dimensions here (only the first two Sobol direction-number sets are forced by the recurrence with no external lookup table); use method: 'halton' for higher-dimensional integrals"
+    );
+  }
+  const bits = SOBOL_BITS;
+  const scale4 = Math.pow(2, bits);
+  const scaledDir = Array.from({ length: dims }, (_, d) => {
+    const M = sobolDirectionNumbers(d, bits);
+    return M.map((m, i) => i === 0 ? 0 : m * Math.pow(2, bits - i));
+  });
+  const points = [];
+  for (let idx = 1; idx <= n; idx++) {
+    const gray = idx ^ idx >>> 1;
+    const pt = new Array(dims).fill(0);
+    for (let d = 0; d < dims; d++) {
+      let acc = 0;
+      let k = gray;
+      let bitPos = 1;
+      while (k > 0) {
+        if (k & 1) acc ^= scaledDir[d][bitPos];
+        k >>>= 1;
+        bitPos++;
+      }
+      pt[d] = acc / scale4;
+    }
+    points.push(pt);
+  }
+  return points;
+}
+function monteCarloIntegrate(f, bounds, opts = {}) {
+  const dims = bounds.length;
+  if (dims === 0) {
+    throw new Error("monteCarloIntegrate: bounds must have at least one dimension");
+  }
+  for (const [lo, hi] of bounds) {
+    if (!(hi > lo)) throw new Error("monteCarloIntegrate: each bound must have hi > lo");
+  }
+  const n = Math.floor(opts.n ?? 1e5);
+  if (n < 1) throw new Error("monteCarloIntegrate: n must be >= 1");
+  const method = opts.method ?? "uniform";
+  const volume = bounds.reduce((v, [lo, hi]) => v * (hi - lo), 1);
+  let unitPoints;
+  if (method === "uniform") {
+    const rng = createRng(opts.seed ?? null);
+    unitPoints = Array.from({ length: n }, () => Array.from({ length: dims }, () => rng()));
+  } else if (method === "halton") {
+    unitPoints = haltonSequence(n, dims);
+  } else if (method === "sobol") {
+    unitPoints = sobolSequence(n, dims);
+  } else {
+    throw new Error(`monteCarloIntegrate: unknown method '${String(method)}'`);
+  }
+  let sum3 = 0;
+  let sumSq = 0;
+  for (const u of unitPoints) {
+    const x = u.map((ui, d) => bounds[d][0] + ui * (bounds[d][1] - bounds[d][0]));
+    const fx = f(x);
+    sum3 += fx;
+    sumSq += fx * fx;
+  }
+  const mean7 = sum3 / n;
+  const estimate = volume * mean7;
+  if (method !== "uniform") {
+    return { estimate, stderr: 0 };
+  }
+  const variance2 = n > 1 ? Math.max(0, sumSq - n * mean7 * mean7) / (n - 1) : 0;
+  const stderr = volume * Math.sqrt(variance2 / n);
+  return { estimate, stderr };
+}
+
 // src/timeseries-extra.ts
 var arr4 = (x) => Array.isArray(x) ? x : Array.from(x);
 var mean4 = (x) => mean(x);
@@ -50857,6 +51079,111 @@ function rootsLegendre(n) {
   return { nodes, weights };
 }
 
+// src/special/niche.ts
+var MAX_TERMS2 = 1e4;
+var RELTOL2 = 1e-16;
+function polylog(s, z) {
+  if (Math.abs(z) >= 1) {
+    throw new Error("polylog: only |z| < 1 is supported (analytic continuation not implemented)");
+  }
+  if (z === 0) return 0;
+  let sum3 = 0;
+  let zk = 1;
+  for (let k = 1; k <= MAX_TERMS2; k++) {
+    zk *= z;
+    const term = zk / Math.pow(k, s);
+    sum3 += term;
+    if (k > 1 && Math.abs(term) < Math.abs(sum3) * RELTOL2) break;
+  }
+  return sum3;
+}
+function struveH(v, z) {
+  if (z < 0) {
+    throw new Error("struveH: z must be >= 0");
+  }
+  if (z === 0) return 0;
+  const halfZ = z / 2;
+  const logHalfZ = Math.log(halfZ);
+  let term = Math.exp((v + 1) * logHalfZ - _lgamma(1.5) - _lgamma(v + 1.5));
+  let sum3 = term;
+  for (let k = 0; k < MAX_TERMS2; k++) {
+    const ratio = -(halfZ * halfZ) / ((k + 1.5) * (k + v + 1.5));
+    term *= ratio;
+    sum3 += term;
+    if (Math.abs(term) < Math.abs(sum3) * RELTOL2) break;
+  }
+  return sum3;
+}
+function struveL(v, z) {
+  if (z < 0) {
+    throw new Error("struveL: z must be >= 0");
+  }
+  if (z === 0) return 0;
+  const halfZ = z / 2;
+  const logHalfZ = Math.log(halfZ);
+  let term = Math.exp((v + 1) * logHalfZ - _lgamma(1.5) - _lgamma(v + 1.5));
+  let sum3 = term;
+  for (let k = 0; k < MAX_TERMS2; k++) {
+    const ratio = halfZ * halfZ / ((k + 1.5) * (k + v + 1.5));
+    term *= ratio;
+    sum3 += term;
+    if (Math.abs(term) < Math.abs(sum3) * RELTOL2) break;
+  }
+  return sum3;
+}
+function kelvinBer(x) {
+  const halfX = x / 2;
+  const halfX4 = halfX * halfX * halfX * halfX;
+  let term = 1;
+  let sum3 = term;
+  for (let k = 0; k < MAX_TERMS2; k++) {
+    const denom = (2 * k + 1) * (2 * k + 2);
+    term *= -halfX4 / (denom * denom);
+    sum3 += term;
+    if (k > 0 && Math.abs(term) < Math.abs(sum3) * RELTOL2) break;
+  }
+  return sum3;
+}
+function kelvinBei(x) {
+  const halfX = x / 2;
+  const halfX4 = halfX * halfX * halfX * halfX;
+  let term = halfX * halfX;
+  let sum3 = term;
+  for (let k = 0; k < MAX_TERMS2; k++) {
+    const denom = (2 * k + 2) * (2 * k + 3);
+    term *= -halfX4 / (denom * denom);
+    sum3 += term;
+    if (k > 0 && Math.abs(term) < Math.abs(sum3) * RELTOL2) break;
+  }
+  return sum3;
+}
+var LN_GLAISHER_A = 0.2487544770337842;
+var BERNOULLI_TAIL = [-1 / 30, 1 / 42, -1 / 30, 5 / 66];
+var BARNES_SHIFT_THRESHOLD = 16;
+function lnBarnesGAsymptotic(y) {
+  let sum3 = y * y * Math.log(y) / 2 - 3 * y * y / 4 + y / 2 * Math.log(2 * Math.PI) - Math.log(y) / 12 + (1 / 12 - LN_GLAISHER_A);
+  let y2k = y * y;
+  for (let k = 1; k <= BERNOULLI_TAIL.length; k++) {
+    sum3 += BERNOULLI_TAIL[k - 1] / (4 * k * (k + 1) * y2k);
+    y2k *= y * y;
+  }
+  return sum3;
+}
+function barnesG(z) {
+  if (z <= 0) {
+    throw new Error("barnesG: only z > 0 is supported");
+  }
+  let shifted = z;
+  let sumLgamma = 0;
+  while (shifted < BARNES_SHIFT_THRESHOLD) {
+    sumLgamma += _lgamma(shifted);
+    shifted += 1;
+  }
+  const y = shifted - 1;
+  const lnG = lnBarnesGAsymptotic(y) - sumLgamma;
+  return Math.exp(lnG);
+}
+
 // src/graph/traversal-centrality.ts
 function bfs(adj, start) {
   const n = adj.length;
@@ -51856,6 +52183,7 @@ export {
   autoCorrelation,
   avogadro,
   bandpassFilter,
+  barnesG,
   bartlettPSD,
   bartlettTest,
   bellNumbers,
@@ -51899,6 +52227,8 @@ export {
   bootstrapCI,
   boundingBox,
   bspline,
+  bsplineEval,
+  bsplineFit,
   butter,
   buttord,
   cancel,
@@ -52335,6 +52665,8 @@ export {
   kdTreeKNN,
   kdTreeNearest,
   kdTreeRadius,
+  kelvinBei,
+  kelvinBer,
   kendallTau,
   kendallTauTest,
   kendalltau,
@@ -52454,6 +52786,7 @@ export {
   molarPlanckConstant,
   molarVolume,
   moment,
+  monteCarloIntegrate,
   movingAverage,
   multiTaperPSD,
   multinomial,
@@ -52568,6 +52901,7 @@ export {
   polygamma,
   polygonArea,
   polygonPerimeter,
+  polylog,
   polymul,
   polynomialGCD,
   polynomialLCM,
@@ -52728,6 +53062,8 @@ export {
   stirlingS2,
   string,
   stronglyConnectedComponents,
+  struveH,
+  struveL,
   studentTCDF,
   studentTPDF,
   studentTQuantile,

package/dist/numeric/bspline.d.ts

@@ -0,0 +1,47 @@
+type f64 = number;
+type i32 = number;
+/** Options for {@link bsplineFit}. */
+export interface BSplineFitOptions {
+    /** Spline degree (default 3, cubic). */
+    k?: i32;
+    /** Smoothing factor. `0` (default) fits an interpolating spline that
+     * passes through every data point exactly. `s > 0` requests a
+     * least-squares smoothing spline with fewer basis functions than data
+     * points — the number of interior knots shrinks roughly in proportion to
+     * `s`. Use `nknots` to control the knot count directly instead. */
+    s?: f64;
+    /** Explicit number of interior knots for a smoothing fit (used whenever
+     * `s > 0`, or set this directly with `s` left at 0). Overrides the
+     * `s`-derived heuristic. */
+    nknots?: i32;
+}
+/** A fitted B-spline in scipy's `tck` tuple shape: knot vector `t`,
+ * coefficients `c`, and degree `k`. */
+export interface BSplineTuple {
+    t: f64[];
+    c: f64[];
+    k: i32;
+}
+/**
+ * Fit a B-spline of degree `k` (default cubic) to data `(x, y)`, returned
+ * in scipy's `tck` tuple shape `{ t, c, k }`.
+ *
+ * @example
+ * const xs = Array.from({ length: 15 }, (_, i) => (i * 2 * Math.PI) / 14);
+ * const ys = xs.map(Math.sin);
+ * const tck = bsplineFit(xs, ys); // cubic interpolating spline (s=0)
+ * bsplineEval(tck, xs[3]); // === ys[3] exactly (interpolation)
+ */
+export declare function bsplineFit(x: readonly f64[], y: readonly f64[], opts?: BSplineFitOptions): BSplineTuple;
+/**
+ * Evaluate a fitted B-spline (de Boor's algorithm) at one point or an array
+ * of points.
+ *
+ * @example
+ * bsplineEval(bsplineFit(xs, ys), 1.0); // spline value at x=1
+ * bsplineEval(bsplineFit(xs, ys), [1, 2, 3]); // vectorized
+ */
+export declare function bsplineEval(spline: BSplineTuple, xnew: f64): f64;
+export declare function bsplineEval(spline: BSplineTuple, xnew: readonly f64[]): f64[];
+export {};
+//# sourceMappingURL=bspline.d.ts.map

package/dist/numeric/bspline.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bspline.d.ts","sourceRoot":"","sources":["../../src/numeric/bspline.ts"],"names":[],"mappings":"AAgCA,KAAK,GAAG,GAAG,MAAM,CAAC;AAClB,KAAK,GAAG,GAAG,MAAM,CAAC;AAElB,sCAAsC;AACtC,MAAM,WAAW,iBAAiB;IAChC,wCAAwC;IACxC,CAAC,CAAC,EAAE,GAAG,CAAC;IACR;;;;uEAImE;IACnE,CAAC,CAAC,EAAE,GAAG,CAAC;IACR;;gCAE4B;IAC5B,MAAM,CAAC,EAAE,GAAG,CAAC;CACd;AAED;uCACuC;AACvC,MAAM,WAAW,YAAY;IAC3B,CAAC,EAAE,GAAG,EAAE,CAAC;IACT,CAAC,EAAE,GAAG,EAAE,CAAC;IACT,CAAC,EAAE,GAAG,CAAC;CACR;AAmED;;;;;;;;;GASG;AACH,wBAAgB,UAAU,CACxB,CAAC,EAAE,SAAS,GAAG,EAAE,EACjB,CAAC,EAAE,SAAS,GAAG,EAAE,EACjB,IAAI,GAAE,iBAAsB,GAC3B,YAAY,CAgDd;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC;AAClE,wBAAgB,WAAW,CAAC,MAAM,EAAE,YAAY,EAAE,IAAI,EAAE,SAAS,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC"}

package/dist/numeric/monte-carlo.d.ts

@@ -0,0 +1,40 @@
+type f64 = number;
+type i32 = number;
+/** An axis-aligned integration bound `[lo, hi]`. */
+export type Bound = readonly [f64, f64];
+/** Options for {@link monteCarloIntegrate}. */
+export interface MonteCarloOptions {
+    /** Number of sample points (default 1e5). */
+    n?: i32;
+    /** Sampling method (default `'uniform'`). */
+    method?: 'uniform' | 'halton' | 'sobol';
+    /** Seed for the deterministic RNG, `method: 'uniform'` only (reproducible
+     * draws). Omit for a time-seeded, non-reproducible generator. */
+    seed?: string | number;
+}
+/** Result of {@link monteCarloIntegrate}. */
+export interface MonteCarloResult {
+    /** The estimated integral. */
+    estimate: f64;
+    /** Standard error of `estimate` (uniform MC only; 0 for QMC methods —
+     * see the module doc). */
+    stderr: f64;
+}
+/**
+ * Estimate `∫ f` over the axis-aligned box `bounds` (one `[lo, hi]` pair
+ * per dimension) by Monte-Carlo or quasi-Monte-Carlo sampling.
+ *
+ * @example
+ * monteCarloIntegrate((x) => x[0] ** 2, [[0, 1]], { n: 1e5, seed: 42 });
+ * // estimate ~ 1/3, stderr ~ 6e-4
+ *
+ * @example
+ * // unit-disk area via the indicator function, ~ pi
+ * monteCarloIntegrate((x) => (x[0] ** 2 + x[1] ** 2 <= 1 ? 1 : 0), [
+ *   [-1, 1],
+ *   [-1, 1],
+ * ]);
+ */
+export declare function monteCarloIntegrate(f: (x: f64[]) => f64, bounds: readonly Bound[], opts?: MonteCarloOptions): MonteCarloResult;
+export {};
+//# sourceMappingURL=monte-carlo.d.ts.map

package/dist/numeric/monte-carlo.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"monte-carlo.d.ts","sourceRoot":"","sources":["../../src/numeric/monte-carlo.ts"],"names":[],"mappings":"AAqCA,KAAK,GAAG,GAAG,MAAM,CAAC;AAClB,KAAK,GAAG,GAAG,MAAM,CAAC;AAElB,oDAAoD;AACpD,MAAM,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAExC,+CAA+C;AAC/C,MAAM,WAAW,iBAAiB;IAChC,6CAA6C;IAC7C,CAAC,CAAC,EAAE,GAAG,CAAC;IACR,6CAA6C;IAC7C,MAAM,CAAC,EAAE,SAAS,GAAG,QAAQ,GAAG,OAAO,CAAC;IACxC;qEACiE;IACjE,IAAI,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;CACxB;AAED,6CAA6C;AAC7C,MAAM,WAAW,gBAAgB;IAC/B,8BAA8B;IAC9B,QAAQ,EAAE,GAAG,CAAC;IACd;8BAC0B;IAC1B,MAAM,EAAE,GAAG,CAAC;CACb;AA2GD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,mBAAmB,CACjC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,GAAG,EACpB,MAAM,EAAE,SAAS,KAAK,EAAE,EACxB,IAAI,GAAE,iBAAsB,GAC3B,gBAAgB,CA0ClB"}

package/dist/special/niche.d.ts

@@ -0,0 +1,139 @@
+/**
+ * Niche special functions: polylogarithm, Struve H/L, Kelvin ber/bei (order
+ * 0), and the Barnes G-function.
+ *
+ * These are lower-traffic special functions with narrower validity domains
+ * than the Bessel/Airy/elliptic families in `typed/special.ts`. They follow
+ * the same plain-exported-function pattern as `hypergeometric.ts` and
+ * `polygamma-orthopoly.ts` — pure `number -> number` (or `number, number ->
+ * number`) math, no typed-function array/WASM dispatch overloads.
+ *
+ * @packageDocumentation
+ */
+/** 64-bit float (default for decimals) */
+type f64 = number;
+/**
+ * Polylogarithm Li_s(z), computed via its defining series (DLMF 25.12.10):
+ *
+ *   Li_s(z) = sum_{k=1}^inf z^k / k^s
+ *
+ * which converges for `|z| < 1` (any real `s`). Analytic continuation to
+ * `|z| >= 1` (needed for e.g. the dilogarithm's reflection formulas) is
+ * **out of scope** — this throws rather than silently returning a wrong or
+ * divergent value.
+ *
+ * Special value: `Li_1(z) = -ln(1 - z)`.
+ *
+ * @param s - Order (any real number)
+ * @param z - Argument, must satisfy `|z| < 1`
+ * @returns Li_s(z)
+ * @throws {Error} If `|z| >= 1`
+ *
+ * @example
+ * polylog(2, 0.5) // ~0.5822405265 (dilogarithm)
+ * polylog(1, 0.5) // ~0.6931471806 (= -ln(0.5) = ln 2)
+ */
+export declare function polylog(s: f64, z: f64): f64;
+/**
+ * Struve function H_v(z), via its power series (DLMF 11.2.1):
+ *
+ *   H_v(z) = sum_{k=0}^inf (-1)^k / (Gamma(k+3/2) Gamma(k+v+3/2)) * (z/2)^(2k+v+1)
+ *
+ * Evaluated by the standard term-recurrence ratio
+ * `term_{k+1}/term_k = -(z/2)^2 / ((k+3/2)(k+v+3/2))`, seeded by a single
+ * pair of `lgamma` evaluations (avoids recomputing Gamma at every order and
+ * avoids overflow from large individual Gamma values).
+ *
+ * Valid for `z >= 0` and `v > -3/2` (so that `Gamma(v+3/2)` has no pole).
+ *
+ * @param v - Order (real, `v > -3/2`)
+ * @param z - Argument (real, `z >= 0`)
+ * @returns H_v(z)
+ *
+ * @example
+ * struveH(0, 1) // ~0.5686566270
+ * struveH(1, 2) // ~0.6467637283
+ */
+export declare function struveH(v: f64, z: f64): f64;
+/**
+ * Modified Struve function L_v(z), via its power series (DLMF 11.2.1):
+ *
+ *   L_v(z) = sum_{k=0}^inf 1 / (Gamma(k+3/2) Gamma(k+v+3/2)) * (z/2)^(2k+v+1)
+ *
+ * Same as `struveH` but without the alternating `(-1)^k` sign, so every term
+ * is positive and the series grows monotonically for `z > 0` (like a
+ * modified Bessel function).
+ *
+ * Valid for `z >= 0` and `v > -3/2`.
+ *
+ * @param v - Order (real, `v > -3/2`)
+ * @param z - Argument (real, `z >= 0`)
+ * @returns L_v(z)
+ *
+ * @example
+ * struveL(0, 1) // ~0.7102431859
+ */
+export declare function struveL(v: f64, z: f64): f64;
+/**
+ * Kelvin function ber(x) (order 0), via its power series (DLMF 10.65.1):
+ *
+ *   ber(x) = sum_{k=0}^inf (-1)^k (x/2)^(4k) / ((2k)!)^2
+ *
+ * Evaluated by the term-recurrence ratio
+ * `term_{k+1}/term_k = -(x/2)^4 / ((2k+1)(2k+2))^2`.
+ *
+ * @param x - Argument (real)
+ * @returns ber(x)
+ *
+ * @example
+ * kelvinBer(0) // 1
+ * kelvinBer(2) // ~0.7517341827
+ */
+export declare function kelvinBer(x: f64): f64;
+/**
+ * Kelvin function bei(x) (order 0), via its power series (DLMF 10.65.1):
+ *
+ *   bei(x) = sum_{k=0}^inf (-1)^k (x/2)^(4k+2) / ((2k+1)!)^2
+ *
+ * Evaluated by the term-recurrence ratio
+ * `term_{k+1}/term_k = -(x/2)^4 / ((2k+2)(2k+3))^2`.
+ *
+ * @param x - Argument (real)
+ * @returns bei(x)
+ *
+ * @example
+ * kelvinBei(0) // 0
+ * kelvinBei(2) // ~0.9722916273
+ */
+export declare function kelvinBei(x: f64): f64;
+/**
+ * Barnes G-function G(z), for real `z > 0`.
+ *
+ * Uses the functional equation `G(z+1) = Gamma(z) * G(z)` to shift `z` up
+ * until it is large enough for the asymptotic expansion of `ln G` (DLMF
+ * 5.17.5) to converge to machine precision, then unwinds the shift:
+ *
+ *   ln G(z) = ln G(z + n) - sum_{k=0}^{n-1} lgamma(z + k)
+ *
+ * Verified against `mpmath.barnesg` (dps=25) to relative error ~1e-14 across
+ * the anchored integer/half-integer test values. Not extended to `z <= 0`
+ * (Barnes G has zeros/sign changes on the non-positive real axis that this
+ * shift-and-asymptotic approach does not handle) — that domain is out of
+ * scope.
+ *
+ * Known integer values: `G(1) = G(2) = 1`, and in general
+ * `G(n+3) = prod_{k=1}^{n} k!` for nonnegative integers `n`
+ * (e.g. `G(4) = 2`, `G(5) = 12`, `G(6) = 288`).
+ *
+ * @param z - Argument (real, `z > 0`)
+ * @returns G(z)
+ * @throws {Error} If `z <= 0`
+ *
+ * @example
+ * barnesG(4) // 2 (= 1!)
+ * barnesG(5) // 12 (= 1! * 2!)
+ * barnesG(4.5) // ~4.1862532590
+ */
+export declare function barnesG(z: f64): f64;
+export {};
+//# sourceMappingURL=niche.d.ts.map

package/dist/special/niche.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"niche.d.ts","sourceRoot":"","sources":["../../src/special/niche.ts"],"names":[],"mappings":"AAGA;;;;;;;;;;;GAWG;AAIH,0CAA0C;AAC1C,KAAK,GAAG,GAAG,MAAM,CAAC;AAYlB;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAe3C;AAMD;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAiB3C;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,GAAG,GAAG,CAiB3C;AAMD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CAYrC;AAED;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CAYrC;AAsCD;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,GAAG,GAAG,GAAG,CAcnC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@danielsimonjr/mathts-functions",
-  "version": "0.41.0",
+  "version": "0.42.0",
   "description": "Mathematical functions for MathTS - arithmetic, algebra, trigonometry, statistics, and more",
   "author": "Daniel Simon Jr.",
   "license": "MIT",