@slimlib/refine-partition 1.0.3 → 2.0.0

package/package.json

@@ -1,27 +1,24 @@
 {
   "type": "module",
-  "version": "1.0.3",
+  "version": "2.0.0",
   "name": "@slimlib/refine-partition",
   "description": "Simple refine partition implementation",
   "license": "MIT",
   "author": "Konstantin Shutkin",
-  "main": "./dist/index.cjs",
-  "module": "./dist/index.mjs",
   "exports": {
     ".": {
-      "types": "./dist/index.d.ts",
-      "import": "./dist/index.mjs",
-      "require": "./dist/index.cjs",
-      "default": "./dist/index.mjs"
+      "types": "./types/index.d.ts",
+      "default": "./src/index.js"
     },
     "./package.json": "./package.json"
   },
-  "types": "./dist/index.d.ts",
+  "types": "./types/index.d.ts",
   "files": [
-    "dist"
+    "src",
+    "types"
   ],
   "engines": {
-    "node": ">=15"
+    "node": ">=22"
   },
   "repository": {
     "type": "git",

package/src/index.js

@@ -0,0 +1,38 @@
+/**
+ * @template T
+ * @returns {(newPartitionCandidate?: Iterable<T>) => Iterable<Iterable<T>>}
+ */
+export default function () {
+    /** @type {Set<Set<T>>} */
+    const processed = new Set();
+
+    return newPartitionCandidate => {
+        if (newPartitionCandidate) {
+            let remainingElements = new Set(newPartitionCandidate);
+
+            for (const partitionItem of [...processed]) {
+                const intersection = partitionItem.intersection(remainingElements);
+                if (intersection.size > 0) {
+                    // Remove intersection elements from remaining candidate elements
+                    remainingElements = remainingElements.difference(intersection);
+                    // Only modify processed if partition is partially consumed
+                    if (intersection.size < partitionItem.size) {
+                        // Partial overlap - split partition into remainder and intersection
+                        processed.delete(partitionItem);
+                        const remainder = partitionItem.difference(intersection);
+                        processed.add(remainder);
+                        processed.add(intersection);
+                    }
+                    // If intersection.size === partitionItem.size, partition is fully consumed
+                    // No need to delete/add since partitionItem already contains all intersection elements
+                }
+            }
+
+            // Add elements that didn't intersect with any existing partition
+            if (remainingElements.size > 0) {
+                processed.add(remainingElements);
+            }
+        }
+        return /** @type {Iterable<Iterable<T>>} */ (processed);
+    };
+}

package/types/index.d.ts

@@ -0,0 +1,7 @@
+declare module '@slimlib/refine-partition' {
+	export default function _default<T>(): (newPartitionCandidate?: Iterable<T>) => Iterable<Iterable<T>>;
+
+	export {};
+}
+
+//# sourceMappingURL=index.d.ts.map

package/types/index.d.ts.map

@@ -0,0 +1,8 @@
+{
+	"version": 3,
+	"file": "index.d.ts",
+	"names": [],
+	"sources": [],
+	"sourcesContent": [],
+	"mappings": ""
+}

package/dist/index.cjs

@@ -1,40 +0,0 @@
-'use strict';
-
-function index () {
-    const processed = new Set();
-    return (newPartitionCandidate) => {
-        if (newPartitionCandidate) {
-            const intersections = new Map();
-            for (const element of newPartitionCandidate) {
-                for (const partitionItem of processed) {
-                    if (partitionItem.has(element)) {
-                        let intersection = intersections.get(partitionItem);
-                        if (intersection === undefined) {
-                            intersection = new Set();
-                            intersections.set(partitionItem, intersection);
-                        }
-                        intersection.add(element);
-                        partitionItem.delete(element);
-                        if (partitionItem.size === 0) {
-                            processed.delete(partitionItem);
-                        }
-                    }
-                }
-            }
-            const newPartitionItem = new Set(newPartitionCandidate);
-            for (const intersection of intersections.values()) {
-                processed.add(intersection);
-                for (const element of intersection) {
-                    newPartitionItem.delete(element);
-                }
-            }
-            intersections.clear();
-            if (newPartitionItem.size > 0) {
-                processed.add(newPartitionItem);
-            }
-        }
-        return processed;
-    };
-}
-
-module.exports = index;

package/dist/index.d.ts

@@ -1 +0,0 @@
-export default function <T>(): (newPartitionCandidate?: Iterable<T>) => Iterable<Iterable<T>>;

package/dist/index.mjs

@@ -1,38 +0,0 @@
-function index () {
-    const processed = new Set();
-    return (newPartitionCandidate) => {
-        if (newPartitionCandidate) {
-            const intersections = new Map();
-            for (const element of newPartitionCandidate) {
-                for (const partitionItem of processed) {
-                    if (partitionItem.has(element)) {
-                        let intersection = intersections.get(partitionItem);
-                        if (intersection === undefined) {
-                            intersection = new Set();
-                            intersections.set(partitionItem, intersection);
-                        }
-                        intersection.add(element);
-                        partitionItem.delete(element);
-                        if (partitionItem.size === 0) {
-                            processed.delete(partitionItem);
-                        }
-                    }
-                }
-            }
-            const newPartitionItem = new Set(newPartitionCandidate);
-            for (const intersection of intersections.values()) {
-                processed.add(intersection);
-                for (const element of intersection) {
-                    newPartitionItem.delete(element);
-                }
-            }
-            intersections.clear();
-            if (newPartitionItem.size > 0) {
-                processed.add(newPartitionItem);
-            }
-        }
-        return processed;
-    };
-}
-
-export { index as default };