@funnest/charts-viz 0.0.0-stage → 0.1.1

package/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/NOTICE

@@ -0,0 +1,9 @@
+Funnest Charts
+Copyright 2026 Funnest
+
+This product includes software developed by the Funnest Charts project.
+
+Trademarks: "Funnest", "Funnest Charts" and the Funnest logos (the brand/ directory and
+the logo marks in the code) are trademarks of Funnest. The Apache License 2.0 covers the
+code only and grants no rights to these names or logos (Section 6). Forks and
+redistributions must not use them to identify their own products.

package/README.md

@@ -1,3 +1,24 @@
-# Temporary Holding Version
+# @funnest/charts-viz
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+웹과 React Native가 함께 쓰는 차트 계산
+
+Platform-neutral chart math (scales, ticks, SVG paths, stacking) for web and React Native.
+
+```bash
+npm i @funnest/charts-viz
+```
+
+DOM을 쓰지 않는 순수 TypeScript예요. `@funnest/charts-react`의 SVG 컴포넌트가 이 계산을 쓰고, React Native(react-native-svg)에서도 같은 결과를 그릴 수 있어요.
+
+```ts
+import { linearScale, linePath, ticks } from '@funnest/charts-viz';
+
+const y = linearScale([0, 100], [200, 0]);
+const d = linePath(values.map((v, i) => ({ x: i * 10, y: y(v) })), 'monotone');
+```
+
+## 링크
+
+- 문서: https://charts.funnest.xyz/docs/
+- GitHub: https://github.com/funnest-xyz/funnest-charts
+- 라이선스: Apache-2.0

package/dist/data.d.ts

@@ -0,0 +1,48 @@
+/** One numeric series. `data[i]` lines up with x position i (null = gap). */
+export interface SeriesData {
+    id: string;
+    data: readonly (number | null)[];
+}
+/** Min/max over the non-null values of every series (null when there is none). */
+export declare function extent(series: readonly SeriesData[]): [number, number] | null;
+/** Longest series length. */
+export declare const maxLength: (series: readonly SeriesData[]) => number;
+export interface StackedSeries {
+    id: string;
+    /** Lower edge per index (the sum of the series below). */
+    y0: number[];
+    /** Upper edge per index. */
+    y1: number[];
+}
+/**
+ * Stack series on top of each other. Positive values stack upward from 0, negative values
+ * downward, so mixed-sign data (P&L by strategy, inflow/outflow) stays readable.
+ */
+export declare function stack(series: readonly SeriesData[]): StackedSeries[];
+/** [min, max] of stacked series (always includes 0). */
+export declare function stackedExtent(stacked: readonly StackedSeries[]): [number, number];
+export interface PercentageSegment {
+    id: string;
+    value: number;
+    /** Share of the total, 0–1. */
+    fraction: number;
+    /** Cumulative start, 0–1. */
+    start: number;
+}
+/** Split a whole into shares (negative values count as 0). */
+export declare function percentages(items: readonly {
+    id: string;
+    value: number;
+}[]): PercentageSegment[];
+/** Index of the x position nearest to `pixel`, given each index's pixel x (sorted ascending). */
+export declare function nearestIndex(xs: readonly number[], pixel: number): number;
+/**
+ * Change from the first non-null value to the last non-null value at or before `end`
+ * (for "+12.3% this month" headers; pass the scrubbed index as `end`).
+ */
+export declare function seriesChange(data: readonly (number | null)[], end?: number): {
+    first: number;
+    last: number;
+    change: number;
+    percent: number;
+} | null;

package/dist/index.d.ts

@@ -0,0 +1,11 @@
+/**
+ * @funnest/charts-viz — platform-neutral chart math.
+ *
+ * Pure TypeScript with no DOM access, so the same scales, ticks and SVG path strings
+ * drive the web components (@funnest/charts-react) and React Native (react-native-svg).
+ */
+export { linearScale, bandScale, clamp, type LinearScale, type BandScale } from './scale';
+export { niceStep, niceDomain, ticks, sampleIndices } from './ticks';
+export { linePath, areaPath, barPath, segments, type XY, type Curve } from './path';
+export { extent, maxLength, stack, stackedExtent, percentages, nearestIndex, seriesChange, type SeriesData, type StackedSeries, type PercentageSegment, } from './data';
+export { DEFAULT_PALETTE, seriesColor } from './palette';

package/dist/index.js

@@ -0,0 +1,275 @@
+// src/scale.ts
+function linearScale(domain, range) {
+  const [d0, d1] = domain;
+  const [r0, r1] = range;
+  const span = d1 - d0;
+  const scale = ((v) => span === 0 ? (r0 + r1) / 2 : r0 + (v - d0) / span * (r1 - r0));
+  scale.invert = (p) => r1 === r0 ? d0 : d0 + (p - r0) / (r1 - r0) * span;
+  Object.assign(scale, { kind: "linear", domain: [d0, d1], range: [r0, r1] });
+  return scale;
+}
+function bandScale(count, range, padding = 0.2) {
+  const [r0, r1] = range;
+  const n = Math.max(1, count);
+  const step = (r1 - r0) / n;
+  const pad = clamp(padding, 0, 0.95);
+  const bandwidth = step * (1 - pad);
+  const scale = ((i) => r0 + i * step + (step - bandwidth) / 2);
+  scale.center = (i) => r0 + i * step + step / 2;
+  scale.invert = (p) => clamp(Math.floor((p - r0) / step), 0, n - 1);
+  Object.assign(scale, { kind: "band", count: n, range: [r0, r1], bandwidth, step });
+  return scale;
+}
+var clamp = (v, lo, hi) => v < lo ? lo : v > hi ? hi : v;
+
+// src/ticks.ts
+var STEPS = [1, 2, 2.5, 5, 10];
+var round = (v) => Number.parseFloat(v.toPrecision(12));
+function niceStep(min, max, count = 5) {
+  const span = Math.abs(max - min);
+  if (!Number.isFinite(span) || span === 0) return 1;
+  const raw = span / Math.max(1, count);
+  const mag = 10 ** Math.floor(Math.log10(raw));
+  const norm = raw / mag;
+  const step = STEPS.find((s) => s >= norm - 1e-9) ?? 10;
+  return round(step * mag);
+}
+function niceDomain(min, max, count = 5) {
+  if (min === max) {
+    const pad = min === 0 ? 1 : Math.abs(min) * 0.1;
+    return [round(min - pad), round(max + pad)];
+  }
+  const step = niceStep(min, max, count);
+  return [round(Math.floor(min / step + 1e-9) * step), round(Math.ceil(max / step - 1e-9) * step)];
+}
+function ticks(min, max, count = 5) {
+  if (!Number.isFinite(min) || !Number.isFinite(max)) return [];
+  if (min === max) return [min];
+  const lo = Math.min(min, max);
+  const hi = Math.max(min, max);
+  const step = niceStep(lo, hi, count);
+  const out = [];
+  const first = Math.ceil(lo / step - 1e-9);
+  for (let k = first; k * step <= hi + step * 1e-9; k++) out.push(round(k * step));
+  return out;
+}
+function sampleIndices(count, max) {
+  if (count <= 0) return [];
+  if (count <= max) return Array.from({ length: count }, (_, i) => i);
+  const every = Math.ceil(count / Math.max(1, max));
+  const out = [];
+  for (let i = 0; i < count; i += every) out.push(i);
+  return out;
+}
+
+// src/path.ts
+var f = (n) => (Math.round(n * 100) / 100).toString();
+function linePath(points, curve = "linear") {
+  const n = points.length;
+  if (n === 0) return "";
+  const p0 = points[0];
+  let d = `M${f(p0.x)},${f(p0.y)}`;
+  if (n === 1) return d;
+  switch (curve) {
+    case "monotone":
+      return d + monotoneSegments(points);
+    case "step":
+      for (let i = 1; i < n; i++) {
+        const a = points[i - 1];
+        const b = points[i];
+        d += `H${f((a.x + b.x) / 2)}V${f(b.y)}H${f(b.x)}`;
+      }
+      return d;
+    case "stepAfter":
+      for (let i = 1; i < n; i++) d += `H${f(points[i].x)}V${f(points[i].y)}`;
+      return d;
+    case "stepBefore":
+      for (let i = 1; i < n; i++) d += `V${f(points[i].y)}H${f(points[i].x)}`;
+      return d;
+    default:
+      for (let i = 1; i < n; i++) d += `L${f(points[i].x)},${f(points[i].y)}`;
+      return d;
+  }
+}
+function areaPath(top, baseline, curve = "linear") {
+  if (top.length === 0) return "";
+  const upper = linePath(top, curve);
+  if (typeof baseline === "number") {
+    const last = top[top.length - 1];
+    const first = top[0];
+    return `${upper}L${f(last.x)},${f(baseline)}L${f(first.x)},${f(baseline)}Z`;
+  }
+  const lower = linePath([...baseline].reverse(), curve).replace(/^M/, "L");
+  return `${upper}${lower}Z`;
+}
+function segments(values) {
+  const out = [];
+  let cur = null;
+  values.forEach((v, i) => {
+    if (v === null || v === void 0 || typeof v === "number" && !Number.isFinite(v)) {
+      cur = null;
+      return;
+    }
+    if (!cur) {
+      cur = { start: i, values: [] };
+      out.push(cur);
+    }
+    cur.values.push(v);
+  });
+  return out;
+}
+function barPath(x, width, baseY, valueY, radius = 0) {
+  const top = Math.min(baseY, valueY);
+  const h = Math.abs(valueY - baseY);
+  const r = Math.max(0, Math.min(radius, width / 2, h));
+  const x1 = x + width;
+  if (r === 0) return `M${f(x)},${f(top)}H${f(x1)}V${f(top + h)}H${f(x)}Z`;
+  if (valueY <= baseY) {
+    return `M${f(x)},${f(baseY)}V${f(top + r)}Q${f(x)},${f(top)} ${f(x + r)},${f(top)}H${f(x1 - r)}Q${f(x1)},${f(top)} ${f(x1)},${f(top + r)}V${f(baseY)}Z`;
+  }
+  const bottom = top + h;
+  return `M${f(x)},${f(baseY)}V${f(bottom - r)}Q${f(x)},${f(bottom)} ${f(x + r)},${f(bottom)}H${f(x1 - r)}Q${f(x1)},${f(bottom)} ${f(x1)},${f(bottom - r)}V${f(baseY)}Z`;
+}
+function monotoneSegments(p) {
+  const n = p.length;
+  const dx = [];
+  const slope = [];
+  for (let i = 0; i < n - 1; i++) {
+    const h = p[i + 1].x - p[i].x;
+    dx.push(h);
+    slope.push(h === 0 ? 0 : (p[i + 1].y - p[i].y) / h);
+  }
+  const t = new Array(n).fill(0);
+  t[0] = slope[0];
+  t[n - 1] = slope[n - 2];
+  for (let i = 1; i < n - 1; i++) {
+    const s0 = slope[i - 1];
+    const s1 = slope[i];
+    if (s0 * s1 <= 0) continue;
+    const h0 = dx[i - 1];
+    const h1 = dx[i];
+    const w1 = 2 * h1 + h0;
+    const w2 = h1 + 2 * h0;
+    t[i] = (w1 + w2) / (w1 / s0 + w2 / s1);
+  }
+  let d = "";
+  for (let i = 0; i < n - 1; i++) {
+    const a = p[i];
+    const b = p[i + 1];
+    const h = dx[i] / 3;
+    d += `C${f(a.x + h)},${f(a.y + t[i] * h)} ${f(b.x - h)},${f(b.y - t[i + 1] * h)} ${f(b.x)},${f(b.y)}`;
+  }
+  return d;
+}
+
+// src/data.ts
+var isNum = (v) => v !== null && v !== void 0 && Number.isFinite(v);
+function extent(series) {
+  let min = Infinity;
+  let max = -Infinity;
+  for (const s of series) {
+    for (const v of s.data) {
+      if (!isNum(v)) continue;
+      if (v < min) min = v;
+      if (v > max) max = v;
+    }
+  }
+  return min === Infinity ? null : [min, max];
+}
+var maxLength = (series) => series.reduce((m, s) => Math.max(m, s.data.length), 0);
+function stack(series) {
+  const n = maxLength(series);
+  const pos = new Array(n).fill(0);
+  const neg = new Array(n).fill(0);
+  return series.map((s) => {
+    const y0 = [];
+    const y1 = [];
+    for (let i = 0; i < n; i++) {
+      const raw = s.data[i];
+      const v = isNum(raw) ? raw : 0;
+      const base = v >= 0 ? pos : neg;
+      y0.push(base[i]);
+      base[i] = base[i] + v;
+      y1.push(base[i]);
+    }
+    return { id: s.id, y0, y1 };
+  });
+}
+function stackedExtent(stacked) {
+  let min = 0;
+  let max = 0;
+  for (const s of stacked) {
+    for (let i = 0; i < s.y1.length; i++) {
+      min = Math.min(min, s.y0[i], s.y1[i]);
+      max = Math.max(max, s.y0[i], s.y1[i]);
+    }
+  }
+  return [min, max];
+}
+function percentages(items) {
+  const total = items.reduce((t, i) => t + Math.max(0, i.value), 0);
+  let start = 0;
+  return items.map((i) => {
+    const fraction = total > 0 ? Math.max(0, i.value) / total : 0;
+    const seg = { id: i.id, value: i.value, fraction, start };
+    start += fraction;
+    return seg;
+  });
+}
+function nearestIndex(xs, pixel) {
+  if (xs.length === 0) return -1;
+  let lo = 0;
+  let hi = xs.length - 1;
+  while (hi - lo > 1) {
+    const mid = lo + hi >> 1;
+    if (xs[mid] <= pixel) lo = mid;
+    else hi = mid;
+  }
+  return Math.abs(xs[hi] - pixel) < Math.abs(xs[lo] - pixel) ? hi : lo;
+}
+function seriesChange(data, end = data.length - 1) {
+  let first = null;
+  for (const v of data) {
+    if (isNum(v)) {
+      first = v;
+      break;
+    }
+  }
+  let last = null;
+  for (let i = Math.min(end, data.length - 1); i >= 0; i--) {
+    const v = data[i];
+    if (isNum(v)) {
+      last = v;
+      break;
+    }
+  }
+  if (first === null || last === null) return null;
+  const change = last - first;
+  return { first, last, change, percent: first === 0 ? 0 : change / Math.abs(first) * 100 };
+}
+
+// src/palette.ts
+var DEFAULT_PALETTE = ["#6C4DFF", "#F59E0B", "#14B8A6", "#EC4899", "#0EA5E9", "#84CC16", "#A16207", "#64748B"];
+var seriesColor = (index, palette = DEFAULT_PALETTE) => palette[(index % palette.length + palette.length) % palette.length];
+export {
+  DEFAULT_PALETTE,
+  areaPath,
+  bandScale,
+  barPath,
+  clamp,
+  extent,
+  linePath,
+  linearScale,
+  maxLength,
+  nearestIndex,
+  niceDomain,
+  niceStep,
+  percentages,
+  sampleIndices,
+  segments,
+  seriesChange,
+  seriesColor,
+  stack,
+  stackedExtent,
+  ticks
+};

package/dist/palette.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Default categorical colors: Funnest violet first, then hues chosen to stay apart from
+ * each other and from the up/down colors (red/blue in Korea, green/red elsewhere).
+ */
+export declare const DEFAULT_PALETTE: readonly ['#6C4DFF', '#F59E0B', '#14B8A6', '#EC4899', '#0EA5E9', '#84CC16', '#A16207', '#64748B'];
+export declare const seriesColor: (index: number, palette?: readonly string[]) => string;

package/dist/path.d.ts

@@ -0,0 +1,26 @@
+export interface XY {
+    x: number;
+    y: number;
+}
+export type Curve = 'linear' | 'monotone' | 'step' | 'stepBefore' | 'stepAfter';
+/**
+ * SVG path data through the points. Works for web <path d> and react-native-svg alike.
+ * 'monotone' is the Fritsch–Carlson cubic: smooth, but never overshoots the data
+ * (no fake highs/lows between samples — important for price charts).
+ */
+export declare function linePath(points: readonly XY[], curve?: Curve): string;
+/**
+ * Closed area between the `top` line and either a flat `baseline` y or a `bottom` line
+ * (same length as `top`, used for stacked areas / bands).
+ */
+export declare function areaPath(top: readonly XY[], baseline: number | readonly XY[], curve?: Curve): string;
+/** Split a series with gaps (null / NaN) into continuous runs. */
+export declare function segments<T>(values: readonly (T | null | undefined)[]): {
+    start: number;
+    values: T[];
+}[];
+/**
+ * Bar from `baseY` to `valueY` (pixels), `radius` rounding only the end away from the
+ * baseline — so negative bars round at the bottom.
+ */
+export declare function barPath(x: number, width: number, baseY: number, valueY: number, radius?: number): string;

package/dist/scale.d.ts

@@ -0,0 +1,27 @@
+/** A continuous scale mapping a numeric domain onto a pixel range. */
+export interface LinearScale {
+    readonly kind: 'linear';
+    readonly domain: readonly [number, number];
+    readonly range: readonly [number, number];
+    (value: number): number;
+    invert(pixel: number): number;
+}
+export declare function linearScale(domain: readonly [number, number], range: readonly [number, number]): LinearScale;
+/** A categorical scale: `count` equal bands across the range, each with inner padding. */
+export interface BandScale {
+    readonly kind: 'band';
+    readonly count: number;
+    readonly range: readonly [number, number];
+    /** Width of one bar (band minus padding). */
+    readonly bandwidth: number;
+    /** Distance between band starts. */
+    readonly step: number;
+    /** Left edge of the bar for band `i`. */
+    (index: number): number;
+    /** Center of band `i`. */
+    center(index: number): number;
+    /** Band index under a pixel, clamped to [0, count-1]. */
+    invert(pixel: number): number;
+}
+export declare function bandScale(count: number, range: readonly [number, number], padding?: number): BandScale;
+export declare const clamp: (v: number, lo: number, hi: number) => number;

package/dist/ticks.d.ts

@@ -0,0 +1,11 @@
+/** The "nice" step (1, 2, 2.5 or 5 × 10ⁿ) giving about `count` intervals over [min, max]. */
+export declare function niceStep(min: number, max: number, count?: number): number;
+/** Expand [min, max] outward to multiples of a nice step. */
+export declare function niceDomain(min: number, max: number, count?: number): [number, number];
+/** Nice tick values inside [min, max] (inclusive). */
+export declare function ticks(min: number, max: number, count?: number): number[];
+/**
+ * Pick at most `max` evenly spread indices out of `count` (for category / time labels),
+ * always keeping the first one.
+ */
+export declare function sampleIndices(count: number, max: number): number[];

package/package.json

@@ -1,6 +1,46 @@
 {
   "name": "@funnest/charts-viz",
-  "version": "0.0.0-stage",
-  "stub": true,
-  "description": "Temporary package placeholder for staged publishing"
+  "version": "0.1.1",
+  "description": "Platform-neutral chart math (scales, ticks, paths, scrubbing) shared by Funnest Charts web and React Native components",
+  "keywords": [
+    "chart",
+    "svg",
+    "react-native",
+    "sparkline"
+  ],
+  "license": "Apache-2.0",
+  "author": "Funnest",
+  "homepage": "https://charts.funnest.xyz",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/funnest-xyz/funnest-charts.git",
+    "directory": "packages/viz"
+  },
+  "bugs": {
+    "url": "https://github.com/funnest-xyz/funnest-charts/issues"
+  },
+  "type": "module",
+  "sideEffects": false,
+  "main": "./dist/index.js",
+  "types": "./dist/index.d.ts",
+  "exports": {
+    ".": {
+      "funnest-source": "./src/index.ts",
+      "types": "./dist/index.d.ts",
+      "import": "./dist/index.js"
+    }
+  },
+  "files": [
+    "dist",
+    "README.md",
+    "LICENSE",
+    "NOTICE"
+  ],
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "build": "tsup src/index.ts --format esm --clean && tsc -p tsconfig.build.json",
+    "typecheck": "tsc -p tsconfig.json"
+  }
 }