@nxtedition/ranges 1.0.1

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) nxtedition
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,61 @@
+# @nxtedition/ranges
+
+Merge and subtract numeric ranges. Useful for byte ranges, time ranges, and similar interval arithmetic.
+
+## Install
+
+```sh
+npm install @nxtedition/ranges
+```
+
+## Usage
+
+### Merge overlapping ranges
+
+```js
+import { merge } from '@nxtedition/ranges'
+
+merge([
+  [10, 20],
+  [15, 30],
+  [50, 60],
+])
+// [[10, 30], [50, 60]]
+```
+
+### Subtract ranges
+
+```js
+import { subtract } from '@nxtedition/ranges'
+
+subtract(
+  [[0, 100]],
+  [
+    [10, 20],
+    [30, 40],
+  ],
+)
+// [[0, 10], [20, 30], [40, 100]]
+```
+
+## API
+
+### `merge(ranges: Range[]): readonly Range[]`
+
+Sorts and merges overlapping or adjacent ranges. Returns a new array of non-overlapping ranges. Invalid ranges (empty, reversed, non-finite) are filtered out.
+
+### `subtract(a: readonly Range[], b: readonly Range[]): readonly Range[]`
+
+Subtracts ranges `b` from ranges `a`. Returns the remaining intervals. Does not modify the input arrays.
+
+### `Range`
+
+```ts
+type Range = readonly [start: number, end: number]
+```
+
+Ranges are half-open intervals: `start` is inclusive, `end` is exclusive.
+
+## License
+
+MIT

package/lib/index.d.ts

@@ -0,0 +1,3 @@
+export type Range = readonly [start: number, end: number];
+export declare function merge(ranges: Range[]): readonly Range[];
+export declare function subtract(a: readonly Range[], b: readonly Range[]): readonly Range[];

package/lib/index.js

@@ -0,0 +1,75 @@
+                                                         
+
+const EMPTY_ARR                   = Object.freeze([])
+
+export function merge(ranges         )                   {
+  if (!Array.isArray(ranges) || ranges.length === 0) {
+    return EMPTY_ARR
+  }
+
+  if (ranges.length === 1) {
+    const range = ranges[0]
+    return Array.isArray(range) && range.length === 2 && range[1] > range[0] ? ranges : EMPTY_ARR
+  }
+
+  ranges = ranges.filter(
+    (range) => Array.isArray(range) && range.length === 2 && range[1] > range[0],
+  )
+
+  if (ranges.length <= 1) {
+    return ranges
+  }
+
+  ranges.sort((a, b) => a[0] - b[0])
+
+  const stack                     = []
+
+  stack.push([ranges[0][0], ranges[0][1]])
+
+  for (let n = 1, len = ranges.length; n < len; ++n) {
+    const range = ranges[n]
+    const top = stack[stack.length - 1]
+
+    if (
+      !Array.isArray(range) ||
+      range.length !== 2 ||
+      !Number.isFinite(range[0]) ||
+      !Number.isFinite(range[1]) ||
+      range[0] > range[1]
+    ) {
+      continue
+    }
+
+    if (top[1] < range[0]) {
+      stack.push([range[0], range[1]])
+    } else if (top[1] < range[1]) {
+      top[1] = range[1]
+    }
+  }
+
+  return stack
+}
+
+export function subtract(a                  , b                  )                   {
+  const pending                     = a.map((r) => [r[0], r[1]])
+
+  const c          = []
+
+  while (pending.length > 0) {
+    const ar = pending.shift() 
+
+    if (ar[1] <= ar[0]) {
+      continue
+    }
+
+    const br = b.find((br) => ar[0] < br[1] && br[0] < ar[1])
+    if (!br) {
+      c.push(ar)
+    } else {
+      pending.unshift([br[1], ar[1]])
+      pending.unshift([ar[0], br[0]])
+    }
+  }
+
+  return c
+}

package/package.json

@@ -0,0 +1,32 @@
+{
+  "name": "@nxtedition/ranges",
+  "version": "1.0.1",
+  "type": "module",
+  "main": "lib/index.js",
+  "types": "lib/index.d.ts",
+  "files": [
+    "lib",
+    "README.md",
+    "LICENSE"
+  ],
+  "license": "MIT",
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "build": "rimraf lib && tsc && amaroc ./src/index.ts && mv src/index.js lib/",
+    "prepublishOnly": "yarn build",
+    "typecheck": "tsc --noEmit",
+    "test": "node --test",
+    "test:ci": "node --test",
+    "test:coverage": "node --test --experimental-test-coverage --test-coverage-include=src/index.ts --test-coverage-lines=90 --test-coverage-branches=90 --test-coverage-functions=100"
+  },
+  "devDependencies": {
+    "@types/node": "^25.2.3",
+    "amaroc": "^1.0.1",
+    "oxlint-tsgolint": "^0.13.0",
+    "rimraf": "^6.1.3",
+    "typescript": "^5.9.3"
+  },
+  "gitHead": "a54f10182ade3ca92e198dce10ff06d059d296b8"
+}