From: 
Subject: Debian changes

The Debian packaging of node-earcut is maintained in git, using a workflow
similar to the one described in dgit-maint-merge(7).
The Debian delta is represented by this one combined patch; there isn't a
patch queue that can be represented as a quilt series.

A detailed breakdown of the changes is available from their canonical
representation -- git commits in the packaging repository.
For example, to see the changes made by the Debian maintainer in the first
upload of upstream version 1.2.3, you could use:

    % git clone https://git.dgit.debian.org/node-earcut
    % cd node-earcut
    % git log --oneline 1.2.3..debian/1.2.3-1 -- . ':!debian'

(If you have dgit, use `dgit clone node-earcut`, rather than plain `git clone`.)

We don't use debian/source/options single-debian-patch because it has bugs.
Therefore, NMUs etc. may nevertheless have made additional patches.

---

diff --git a/test/test.js b/test/test.js
index c1acd3e..599423c 100644
--- a/test/test.js
+++ b/test/test.js
@@ -4,7 +4,6 @@ import assert from 'node:assert/strict';
 import earcut, {flatten, deviation, refine} from '../src/earcut.js';
 import fs from 'fs';
 import expected from './expected.json' with {type: 'json'};
-import {readTilesFixture} from '../bench/tiles-fixture.js';
 
 test('indices-2d', () => {
     const indices = earcut([10, 0, 0, 50, 60, 60, 70, 10]);
@@ -222,75 +221,6 @@ test('refine legalizes all convex interior edges in earcut fixture', () => {
     assert.equal(deviation(data.vertices, data.holes, data.dimensions, triangles), 0);
 });
 
-test('mvt fixture has zero deviation and refined quality', () => {
-    const polys = readTilesFixture();
-    let nonzero = 0;
-    let firstIndex = -1;
-    let firstDev = 0;
-    let worstIndex = -1;
-    let worstDev = 0;
-    let sumDev = 0;
-    let refinedNonzero = 0;
-    let refinedFirstIndex = -1;
-    let refinedFirstDev = 0;
-    let refinedWorstIndex = -1;
-    let refinedWorstDev = 0;
-    let refinedSumDev = 0;
-    let lengthChanged = 0;
-    let basePerimeter = 0;
-    let refinedPerimeter = 0;
-
-    for (let i = 0; i < polys.length; i++) {
-        const data = polys[i];
-        const triangles = earcut(data.vertices, data.holes, data.dimensions);
-        const length = triangles.length;
-        basePerimeter += trianglePerimeter(triangles, data.vertices, data.dimensions);
-        const dev = deviation(data.vertices, data.holes, data.dimensions, triangles);
-        if (dev !== 0) {
-            if (firstIndex < 0) {
-                firstIndex = i;
-                firstDev = dev;
-            }
-            nonzero++;
-            sumDev += dev;
-            if (dev > worstDev) {
-                worstIndex = i;
-                worstDev = dev;
-            }
-        }
-
-        refine(triangles, data.vertices, data.dimensions);
-        refinedPerimeter += trianglePerimeter(triangles, data.vertices, data.dimensions);
-        if (triangles.length !== length) lengthChanged++;
-
-        const refinedDev = deviation(data.vertices, data.holes, data.dimensions, triangles);
-        if (refinedDev !== 0) {
-            if (refinedFirstIndex < 0) {
-                refinedFirstIndex = i;
-                refinedFirstDev = refinedDev;
-            }
-            refinedNonzero++;
-            refinedSumDev += refinedDev;
-            if (refinedDev > refinedWorstDev) {
-                refinedWorstIndex = i;
-                refinedWorstDev = refinedDev;
-            }
-        }
-    }
-
-    assert.equal(polys.length, 119680);
-    assert.equal(nonzero, 0,
-        `${nonzero} polygons with nonzero deviation; first ${firstIndex}: ${firstDev}, ` +
-        `worst ${worstIndex}: ${worstDev}, sum ${sumDev}`);
-
-    assert.equal(lengthChanged, 0, `${lengthChanged} refined triangulations changed triangle count`);
-    assert.equal(refinedNonzero, 0,
-        `${refinedNonzero} refined polygons with nonzero deviation; first ${refinedFirstIndex}: ${refinedFirstDev}, ` +
-        `worst ${refinedWorstIndex}: ${refinedWorstDev}, sum ${refinedSumDev}`);
-
-    assert.ok(refinedPerimeter < basePerimeter * 0.72, `refined perimeter ratio ${refinedPerimeter / basePerimeter} < 0.72`);
-});
-
 // Regression for the hole-bridge block index (issue #183): a collinear-rich outer ring
 // (integer grid, like MVT data) plus multiple holes used to drop a hole when filterPoints
 // healed a collinear run across a block boundary, leaving the surviving edge outside its
