webgl2-sdf 0.0.3 → 0.0.4

package/src/utils/clip-line-segment-to-strips.ts

@@ -1,4 +1,3 @@
-import type { Strip } from "../types/strip.js";
 import { segStripX } from "./seg-strip-x.js";
 
 
@@ -11,12 +10,12 @@ const { floor, ceil } = Math;
  * * modifies strips by adding line segments to each strip
  * * size/count *must* be a power of 2
  * 
- * @param count the number of strips
+ * @param strips array of strips - each contains an array line segments
  * @param height the height of a strip
  * @param seg the line segment (array of 2 points)
  */
 function clipLineSegmentToStrips(
-        strips: Strip[],
+        strips: number[][][][],
         height: number,
         seg: number[][]): void {
     
@@ -93,7 +92,7 @@ function clipLineSegmentToStrips(
         // if we're past the line endpoint
         if ((tX > 1 || dX === 0) && tY > 1) {
             const v = floor(p1[1]/cellSize);
-            strips[v]?.lineSegs.push([[x,y],p1]);
+            strips[v]?.push([[x,y],p1]);
             break;
         }
 
@@ -109,7 +108,7 @@ function clipLineSegmentToStrips(
             } else {
                 const v = fY(y/cellSize) - (btt ? 0 : 1);  // previous v
                 const seg_ = [[x,y],ps[i]];
-                strips[v]?.lineSegs.push(seg_);
+                strips[v]?.push(seg_);
                 break;
             }
         }
@@ -117,7 +116,7 @@ function clipLineSegmentToStrips(
         // previous v
         const v = fY(y/cellSize) - (btt ? 0 : 1);
 
-        strips[v]?.lineSegs.push([[x,y], [xX,xY]]);
+        strips[v]?.push([[x,y], [xX,xY]]);
 
         // update current position
         x = xX;
@@ -127,70 +126,4 @@ function clipLineSegmentToStrips(
 
 
 export { clipLineSegmentToStrips }
-
-
-// Quokka tests - https://www.desmos.com/calculator/uyqsdkviih
-// import { createEmptyStrips } from "./create-empty-strips";
-
-// {
-//     const strips = createEmptyStrips(8);
-//     const seg = [[0, 100], [0, 400]];
-
-//     toDesmosStr(seg);
-//     clipLineSegmentToStrips(strips, 512, seg);
-//     testAllEmptyExcept(strips,[1,2,3,4,5,6]);
-// }
-
-
-// {
-//     const strips = createEmptyStrips(8);
-//     const seg = [[83, 166], [-90, 440]];
-
-//     toDesmosStr(seg);
-//     clipLineSegmentToStrips(strips, 512, seg);
-//     testAllEmptyExcept(strips,[4,5,6]);
-// }
-
-// {
-//     const strips = createEmptyStrips(8);
-//     const seg = [[-570, 236], [-392, 546]];
-
-//     toDesmosStr(seg);
-//     clipLineSegmentToStrips(strips, 512, seg);
-//     testAllEmptyExcept(strips,[3,4,5,6,7]);
-// }
-
-// {
-//     const strips = createEmptyStrips(8);
-//     const seg = [[-462, 632], [-152, 611]];
-
-//     toDesmosStr(seg);
-//     clipLineSegmentToStrips(strips, 512, seg);
-//     testAllEmptyExcept(strips,[]);
-// }
-
-
-// function toDesmosStr(seg: number[][]) {
-//     const [[x0,y0],[x1,y1]] = seg;
-//     return `\\left(\\left(1-t\\right)\\cdot${x0.toFixed(2)}+t\\cdot\\left(${x1.toFixed(2)}\\right),\\left(1-t\\right)\\cdot${y0.toFixed(2)}+t\\cdot${y1.toFixed(2)}\\right)`;
-// }
-// function testAllEmptyExcept(
-//         strips: Strip[],
-//         exceptions: number[]) {
-
-//     for (let i=0; i<strips.length; i++) {
-//         const strip = strips[i];
-//         const idx = exceptions.findIndex(v => v === i);
-//         const exception = exceptions[idx];
-//         const len = strip.lineSegs.length;
-//         if (exception === undefined) {
-//             if (len !== 0) {
-//                 throw new Error(`Strip ${i} must be empty`);
-//             }
-//         } else {
-//             if (len !== 1) {
-//                 throw new Error(`Strip ${i} must contain 1 segments, found ${len}`);
-//             }
-//         }
-//     }
-// }
+var a = [[1,1], [1,1]]

package/src/utils/find-close-cells.ts

@@ -1,11 +1,10 @@
 import type { Cell } from "../types/cell.js";
 import { ROW_COUNT } from "../row-count.js";
 import { circsCache } from "./calc-circs.js";
-import { distanceSegToP } from "./distance-seg-to-p.js";
 import { jumpIdx } from "./jump-idx.js";
 
 
-const { min, SQRT2 } = Math;
+const { min, max, SQRT2 } = Math;
 
 
 function findCloseCells(
@@ -44,57 +43,47 @@ function findCloseCellsFor(
         // reduce current circle search range since we moved one square
         let k = jumpIdx((_minD - SQRT2*cellSize) / cellSize);
         let minD = Number.POSITIVE_INFINITY;
-        while (k < circsCache.length) {
-            const from = circsCache[k].from;
+        while (true) {
+            if (k >= circsCache.length) {
+                minD = cellSize*(circsCache[circsCache.length - 1].from - SQRT2);
+                break;
+            }
+
+            const { u, v, from } = circsCache[k];
 
             // `SQRT2` to account for diagonal
             if (cellSize*from > maxDistance + SQRT2*cellSize) {
+                minD = cellSize*(from - 2*SQRT2);
                 break;
             }
 
-            // uncomment loop below to search all equidistant squares
-            // while (circsCache?.[k].from === from) {
-                const { u, v } = circsCache[k];
-                const u_ = u + i;
-                const v_ = v + j;
-                if (u_ < 0 || u_ >= colCount + 2*padCount ||
-                    v_ < 0 || v_ >= ROW_COUNT + 2*padCount) {
-
-                    k++; continue;
-                }
-
-                const { lineSegs } = grid[u_][v_];
-                for (let l=0; l<lineSegs.length; l++) {
-                    // center of square
-                    const c = [(i - padCount + 0.5)*cellSize, (j - padCount + 0.5)*cellSize];
-                    const d = distanceSegToP(lineSegs[l], c);
-                    if (d < minD) {
-                        minD = d;
-                    }
-                }
-
-                k++;
-            // }
-
-            if (minD !== Number.POSITIVE_INFINITY) {
+            const u_ = u + i;
+            const v_ = v + j;
+            if (u_ < 0 || u_ >= colCount + 2*padCount ||
+                v_ < 0 || v_ >= ROW_COUNT + 2*padCount) {
+
+                k++; continue;
+            }
+
+            const { lineSegs } = grid[u_][v_];
+
+            if (lineSegs.length > 0) {
+                minD = cellSize*(from - SQRT2);
                 break;
             }
-        }
 
-        if (minD === Number.POSITIVE_INFINITY) {
-            return min(
-                maxDistance + SQRT2*cellSize,
-                cellSize * circsCache[circsCache.length - 1].from
-            );
+            k++;
         }
 
+
         const { closeCells } = grid[i][j];
-        let l = jumpIdx((_minD - 2*SQRT2*cellSize) / cellSize);
+
+        let l = max(0, k - 1);
         while (l < circsCache.length) {
             const { from, u, v } = circsCache[l];
 
-            // `SQRT2` to account for diagonal
-            if (cellSize*from > min(minD, maxDistance) + SQRT2*cellSize) {
+            // `SQRT2` to account for diagonal (times 2 since we minused it off earlier)
+            if (cellSize*from > min(minD, maxDistance) + 2*SQRT2*cellSize) {
                 break;
             }
 
@@ -120,52 +109,3 @@ function findCloseCellsFor(
 
 
 export { findCloseCells }
-
-
-// Quokka tests
-// const grid: Cell[][] = [
-//     [
-//         { u: 0, v: 0, lineSegs: [], closeCells: [], crossingCells: [] },
-//         { u: 0, v: 1, lineSegs: [], closeCells: [], crossingCells: [] },
-//         { u: 0, v: 2, lineSegs: [], closeCells: [], crossingCells: [] },
-//         { u: 0, v: 3, lineSegs: [], closeCells: [], crossingCells: [] }
-//     ],
-//     [
-//         { u: 1, v: 0, lineSegs: [], closeCells: [], crossingCells: [] },
-//         {
-//             u: 1, v: 1,
-//             lineSegs: [[[175, 163], [175, 355]]],
-//             closeCells: [], crossingCells: []
-//         },
-//         {
-//             u: 1, v: 2,
-//             lineSegs: [[[175, 355], [335, 355]]],
-//             closeCells: [], crossingCells: []
-//         },
-//         { u: 1, v: 3, lineSegs: [], closeCells: [], crossingCells: [] }
-//     ],
-//     [
-//         { u: 2, v: 0, lineSegs: [], closeCells: [], crossingCells: [] },
-//         {
-//             u: 2, v: 1,
-//             lineSegs: [[[335, 163], [175, 163]]],
-//             closeCells: [], crossingCells: []
-//         },
-//         {
-//             u: 2, v: 2,
-//             lineSegs: [[[335, 355], [335, 163]]],
-//             closeCells: [], crossingCells: []
-//         },
-//         { u: 2, v: 3, lineSegs: [], closeCells: [], crossingCells: [] }
-//     ],
-//     [
-//         { u: 3, v: 0, lineSegs: [], closeCells: [], crossingCells: [] },
-//         { u: 3, v: 1, lineSegs: [], closeCells: [], crossingCells: [] },
-//         { u: 3, v: 2, lineSegs: [], closeCells: [], crossingCells: [] },
-//         { u: 3, v: 3, lineSegs: [], closeCells: [], crossingCells: [] }
-//     ]
-// ];
-
-// findCloseCells(grid);
-// const v = grid.map(cells => cells.map(c => ({ u: c.u, v: c.v, closeCells: c.closeCells })));
-// v;//?

package/src/utils/find-crossing-cells.ts

@@ -1,10 +1,7 @@
-import { ROW_COUNT } from "../row-count.js";
 import type { Cell } from "../types/cell.js";
+import { ROW_COUNT } from "../row-count.js";
 
 
-// TODO - simplify?
-// TODO - could be made much faster by also checking intersections here
-// and passing the result to the next cell
 function findCrossingCells(
         grid: Cell[][],
         colCount: number,
@@ -24,17 +21,3 @@ function findCrossingCells(
 
 
 export { findCrossingCells }
-
-
-// Quokka tests
-// import { createEmptyGrid } from "./create-empty-grid";
-// // const g = createEmptyGrid(0);
-// const g = createEmptyGrid(0);
-// // g[0][0].lineSegs.push([[]]);
-// g[2][0].lineSegs.push([[]]);
-// g[2][2].lineSegs.push([[]]);
-// findCrossingCells(g);
-// let r = 2;
-// // g.map(r => r.map(c => c.crossingCells))[r].map(v => v);//?
-// g.map(r => r.map(c => c.crossingCells))[r].map(v => v.map(r => r[1]));//?
-// g;//?

package/src/utils/jump-idx.ts

@@ -1,6 +1,6 @@
 import { circsCache } from "./calc-circs.js";
 
-const { trunc, max, E } = Math;
+const { max, E } = Math;
 
 
 /**
@@ -14,10 +14,9 @@ function binarySearchRange<T>(
 
     let mid = 0;
     while (min <= max) {
-        mid = (min + max) >>> 1;//?
+        mid = (min + max) >>> 1;
         const midVal = circsCache[mid].from;
         if (midVal === v) {
-            // return [min,mid,max];
             return mid;
         } else if (v > midVal) {
             min = mid + 1;
@@ -26,11 +25,26 @@ function binarySearchRange<T>(
         }
     }
 
-    // return [min,mid,max];
     return mid;
 }
 
 
+function jumpIdx(
+        c: number) {
+
+    let idx = binarySearchRange(c);
+
+    c = max(0, c);
+    if (idx === 0) { return 0; }
+
+    while (circsCache[idx].from === circsCache[idx - 1].from) {
+        idx--;
+    }
+
+    return idx;
+}
+
+
 // const [Q,R] = [10.606601717798213, 35.531676008879735];
 // const [A1,B1,F1] = [102.42126, 0.153169, -117.56077];
 // const [A2,B2,C2,D2,F2] = [-0.000660087, 0.388148, 841.25744, -0.0529616, -1089.49916];
@@ -55,30 +69,21 @@ function binarySearchRange<T>(
 // }
 
 
-function jumpIdx(
-        c: number) {
-
-    let idx = binarySearchRange(c);
-
-    c = max(0, c);
-    while (idx !== 0 && circsCache[idx].from >= c) { idx--; }
-    while (idx < circsCache.length - 2 && circsCache[idx + 1].from < c) { idx++; }
-
-    return idx;
-}
-
-
 export { jumpIdx }
 
 
 // Quokka tests
-// // circsCache.slice(0,30).map(c => c.from);//?
+// circsCache.slice(0,10);//?
+// circsCache.slice(0,30).map(c => c.from);//?
+// circsCache[5].from;//?
 // circsCache[12].from;//?
 // circsCache[15].from;//?
 // // circsCache.length;//?
 
-// // jumpIdxOld(1.5811388300841898);//?
-// jumpIdx(0.5);//?
+// jumpIdxOld(1.5811388300841898);//?
+// const v = (53.08771209782213 - Math.SQRT2*24.09375)/24.09375;//?
+// jumpIdx(v);//?
+// circsCache[8].from;//?
 // binarySearchRange(1.5811388300841898);//?
 
 

package/src/webgl-utils/free-gl-context.ts

@@ -0,0 +1,35 @@
+import { GlContext } from '../types/gl-context.js';
+
+
+function freeGlContext(
+        glContext: GlContext | undefined) {
+
+    if (glContext === undefined) { return; }
+
+    const { gl, programs, textures } = glContext;
+
+    for (let key in programs) {
+        const { attributes, fragmentShader, vertexShader, uniformBlocks, program } = programs[key];
+
+        for (let key in uniformBlocks) {
+            const { buf } = uniformBlocks[key];
+            gl.deleteBuffer(buf);
+        }
+        for (let key in attributes) {
+            const { buf } = attributes[key];
+            gl.deleteBuffer(buf);
+        }
+        gl.deleteShader(fragmentShader);
+        gl.deleteShader(vertexShader);
+        gl.deleteProgram(program);
+    }
+
+    for (let key in textures) {
+        const { tex } = textures[key];
+        gl.deleteTexture(tex);
+
+    }
+}
+
+
+export { freeGlContext }

package/src/webgl-utils/get-gl-context.ts

@@ -13,7 +13,7 @@ const cache = new WeakMap<WebGL2RenderingContext, GlContext>();
  * @param gl the `WebGL2RenderingContext` context to wrap
  * @param callback
  */
-function getWebGLContext<T>(
+function getWebGlContext(
         gl: WebGL2RenderingContext): GlContext {
 
     {
@@ -23,19 +23,17 @@ function getWebGLContext<T>(
 
     const programs: { [index:string]: Program } = {};
     const textures: { [index:string]: Texture } = {};
-    const framebufferStack: WebGLFramebuffer[] = [];
 
     gl.canvas.addEventListener('webglcontextlost', e => {
-        handleContextLoss();
+        onContextLoss();
         e.preventDefault();
     }, false);
 
     const glContext: GlContext = {
         gl,
-        onContextLoss: handleContextLoss,
+        onContextLoss,
         textures,
-        programs,
-        framebufferStack
+        programs
     };
 
     cache.set(gl, glContext);
@@ -45,10 +43,9 @@ function getWebGLContext<T>(
 
     ////////////////////////
 
-    function handleContextLoss() {
+    function onContextLoss() {
         deleteAllProps(programs);
         deleteAllProps(textures);
-        framebufferStack.length = 0;
     }
 }
 
@@ -58,4 +55,4 @@ function deleteAllProps(o: { [key:string] : unknown }) {
 }
 
 
-export { getWebGLContext }
+export { getWebGlContext }

package/src/webgl-utils/set-attribute.ts

@@ -45,7 +45,7 @@ function setAttribute(
         const { gl, attributes } = program;
 
         const attr = attributes[name] = attributes[name] ?? {
-            buf: gl.createBuffer(), // TODO should we destroy our buffers?
+            buf: gl.createBuffer(),
             loc: gl.getAttribLocation(program.program, name),
             data: null
         }

package/src/webgl-utils/set-uniform-block.ts

@@ -34,10 +34,8 @@ function setUniformBlock(
 
         const { buf } = uniformBlock;
         
-        gl.bufferData(gl.UNIFORM_BUFFER, buffer, gl.DYNAMIC_DRAW);
-        // gl.bindBuffer(gl.UNIFORM_BUFFER, null);
+        gl.bufferData(gl.UNIFORM_BUFFER, buffer, gl.STATIC_DRAW);
         gl.bindBufferBase(gl.UNIFORM_BUFFER, bindingPoint, buf);
-        // gl.bindBufferRange(gl.UNIFORM_BUFFER, bindingPoint, ubo, 0, sizeInBytes);
     }
 }
 

package/src/webgl-utils/use-program.ts

@@ -35,11 +35,22 @@ function initProgram(
     const uniformBlocks: { [index:string]: UniformBlock } = {};
 
     const program = gl.createProgram();
-    gl.attachShader(program, compileShader(gl, vert, gl.VERTEX_SHADER));
-    gl.attachShader(program, compileShader(gl, frag, gl.FRAGMENT_SHADER));
+    const vertexShader = compileShader(gl, vert, gl.VERTEX_SHADER);
+    const fragmentShader = compileShader(gl, frag, gl.FRAGMENT_SHADER);
+
+    gl.attachShader(program, vertexShader);
+    gl.attachShader(program, fragmentShader);
     gl.linkProgram(program);
 
-    programs[name] = { gl, program, attributes, uniforms, uniformBlocks };
+    programs[name] = {
+        gl,
+        program,
+        attributes,
+        uniforms,
+        uniformBlocks,
+        vertexShader,
+        fragmentShader
+    };
 
     return programs[name];
 }

package/node/debug-shaders.d.ts

@@ -1,9 +0,0 @@
-/**
- *
- * @param gl
- * @param type `gl.VERTEX_SHADER | gl.FRAGMENT_SHADER`
- * @param shaderStr
- */
-declare function debugGlsl(gl: WebGL2RenderingContext, type: typeof gl.VERTEX_SHADER | typeof gl.FRAGMENT_SHADER, shaderStr: string): void;
-declare function debugShaders(gl: WebGL2RenderingContext): void;
-export { debugShaders, debugGlsl };

package/node/types/strip.d.ts

@@ -1,8 +0,0 @@
-/**
- * A single strip within strips
- */
-interface Strip {
-    /** line segments contained within the strip */
-    readonly lineSegs: number[][][];
-}
-export type { Strip };

package/node/types/strip.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=strip.js.map

package/node/types/strip.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"strip.js","sourceRoot":"","sources":["../../src/types/strip.ts"],"names":[],"mappings":""}

package/node/utils/create-empty-strips.d.ts

@@ -1,7 +0,0 @@
-import { Strip } from "../types/strip.js";
-/**
- *
- * @param count the number of strips
- */
-declare function createEmptyStrips(): Strip[];
-export { createEmptyStrips };

package/node/utils/create-empty-strips.js

@@ -1,16 +0,0 @@
-import { ROW_COUNT } from "../row-count.js";
-/**
- *
- * @param count the number of strips
- */
-// TODO - remove
-function createEmptyStrips() {
-    const strips = [];
-    for (let v = 0; v < ROW_COUNT; v++) {
-        // TODO - simplify
-        strips.push({ lineSegs: [] });
-    }
-    return strips;
-}
-export { createEmptyStrips };
-//# sourceMappingURL=create-empty-strips.js.map

package/node/utils/create-empty-strips.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"create-empty-strips.js","sourceRoot":"","sources":["../../src/utils/create-empty-strips.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAI5C;;;GAGG;AACH,gBAAgB;AAChB,SAAS,iBAAiB;IACtB,MAAM,MAAM,GAAY,EAAE,CAAC;IAC3B,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;QAC7B,kBAAkB;QAClB,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC;IAClC,CAAC;IAED,OAAO,MAAM,CAAC;AAClB,CAAC;AAGD,OAAO,EAAE,iBAAiB,EAAE,CAAA"}

package/node/utils/distance-seg-to-p.d.ts

@@ -1,5 +0,0 @@
-/**
- * Returns the minimum distance from the given line segment to the origin.
- */
-declare function distanceSegToP(seg: number[][], p: number[]): number;
-export { distanceSegToP };

package/node/utils/distance-seg-to-p.js

@@ -1,35 +0,0 @@
-const { min, max, sqrt } = Math;
-/**
- * Returns the minimum distance from the given line segment to the origin.
- */
-function distanceSegToP(seg, p) {
-    const seg0 = seg[0];
-    const seg1 = seg[1];
-    const _x1 = seg0[0];
-    const _y1 = seg0[1];
-    const _x2 = seg1[0];
-    const _y2 = seg1[1];
-    const x = p[0];
-    const y = p[1];
-    const x1 = _x1 - x;
-    const y1 = _y1 - y;
-    const x2 = _x2 - x;
-    const y2 = _y2 - y;
-    // Vector from point 1 to point 2
-    const dx = x2 - x1;
-    const dy = y2 - y1;
-    const lengthSq = dx * dx + dy * dy;
-    // Calculate projection parameter t
-    // t represents where the closest point lies on the line segment
-    // t = 0 means closest point is at seg[0], t = 1 means closest point is at seg[1]
-    const t = max(0, min(1, -(x1 * dx + y1 * dy) / lengthSq));
-    // Find the closest point on the segment
-    const closestX = x1 + t * dx;
-    const closestY = y1 + t * dy;
-    // Return distance from origin to closest point
-    return sqrt(closestX * closestX + closestY * closestY);
-}
-export { distanceSegToP };
-// Quokka tests
-// distanceSegToOrigin([[0,1],[-1,-2]]);//?
-//# sourceMappingURL=distance-seg-to-p.js.map

package/node/utils/distance-seg-to-p.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"distance-seg-to-p.js","sourceRoot":"","sources":["../../src/utils/distance-seg-to-p.ts"],"names":[],"mappings":"AACA,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;AAGhC;;GAEG;AACH,SAAS,cAAc,CACf,GAAe,EACf,CAAW;IAEf,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACpB,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAEpB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACf,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEf,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;IACnB,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;IACnB,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;IACnB,MAAM,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;IAEnB,iCAAiC;IACjC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACnB,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IAEnB,MAAM,QAAQ,GAAG,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC;IAE/B,mCAAmC;IACnC,gEAAgE;IAChE,iFAAiF;IACjF,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAC,EAAE,GAAG,EAAE,GAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;IAEtD,wCAAwC;IACxC,MAAM,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAC,EAAE,CAAC;IAC3B,MAAM,QAAQ,GAAG,EAAE,GAAG,CAAC,GAAC,EAAE,CAAC;IAE3B,+CAA+C;IAC/C,OAAO,IAAI,CAAC,QAAQ,GAAC,QAAQ,GAAG,QAAQ,GAAC,QAAQ,CAAC,CAAC;AACvD,CAAC;AAGD,OAAO,EAAE,cAAc,EAAE,CAAA;AAEzB,eAAe;AACf,2CAA2C"}

package/node/webgl2.d.ts

@@ -1,2 +0,0 @@
-declare function generateIntoFramebuffer(gl: WebGL2RenderingContext, psss: (number[][])[][] | string, width: number, height: number, viewbox: [number, number, number, number], maxDistance: number, sdfExponent?: number, inclInside?: boolean, inclOutside?: boolean, x?: number, y?: number, channel?: number, resolution?: 0.5 | 1): void;
-export { generateIntoFramebuffer };

package/src/types/strip.ts

@@ -1,11 +0,0 @@
-
-/**
- * A single strip within strips
- */
-interface Strip {
-    /** line segments contained within the strip */
-    readonly lineSegs: number[][][];
-}
-
-
-export type { Strip }

package/src/utils/create-empty-strips.ts

@@ -1,21 +0,0 @@
-import { ROW_COUNT } from "../row-count.js";
-import { Strip } from "../types/strip.js";
-
-
-/**
- * 
- * @param count the number of strips
- */
-// TODO - remove
-function createEmptyStrips() {
-    const strips: Strip[] = [];
-    for (let v=0; v<ROW_COUNT; v++) {
-        // TODO - simplify
-        strips.push({ lineSegs: [] });
-    }
-
-    return strips;
-}
-
-
-export { createEmptyStrips }