@slimlib/refine-partition 2.0.0 → 2.0.2

package/README.md

@@ -1,6 +1,6 @@
 # Refine Partition
 
-Simple refine partition implementation
+A simple partition refinement implementation.
 
 https://en.wikipedia.org/wiki/Partition_refinement
 
@@ -14,18 +14,18 @@ https://en.wikipedia.org/wiki/Partition_refinement
 
 Creates a refiner function.
 
-Pass to it new candidates for refinement.
+Pass new candidates for refinement to it.
 
-Returns refined partition.
+Returns the refined partition.
 
 ### Example
 
 ```typescript
-import refiner from '../src';
+import refiner from "../src";
 
 const refineNext = refiner();
-refineNext(['a', 'b', 'c']);
-refineNext(['b', 'c', 'e']);
+refineNext(["a", "b", "c"]);
+refineNext(["b", "c", "e"]);
 console.log(refineNext()); // Iterable of Iterables: ((a), (b, c), (e))
 ```
 

package/index.d.ts.map

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

package/{src/index.js → index.js}

@@ -1,9 +1,5 @@
-/**
- * @template T
- * @returns {(newPartitionCandidate?: Iterable<T>) => Iterable<Iterable<T>>}
- */
 export default function () {
-    /** @type {Set<Set<T>>} */
+
     const processed = new Set();
 
     return newPartitionCandidate => {
@@ -13,26 +9,24 @@ export default function () {
             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);
+        return  (processed);
     };
 }

package/package.json

@@ -1,22 +1,18 @@
 {
   "type": "module",
-  "version": "2.0.0",
+  "version": "2.0.2",
   "name": "@slimlib/refine-partition",
   "description": "Simple refine partition implementation",
   "license": "MIT",
   "author": "Konstantin Shutkin",
   "exports": {
     ".": {
-      "types": "./types/index.d.ts",
-      "default": "./src/index.js"
+      "types": "./index.d.ts",
+      "default": "./index.js"
     },
     "./package.json": "./package.json"
   },
-  "types": "./types/index.d.ts",
-  "files": [
-    "src",
-    "types"
-  ],
+  "types": "./index.d.ts",
   "engines": {
     "node": ">=22"
   },

package/types/index.d.ts.map

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