@monstermann/set 0.1.0 → 0.2.0

package/dist/Set/{compact.d.ts → compact.d.mts}

@@ -1,4 +1,4 @@
-import { NonNil } from "./internals/types.js";
+import { NonNil } from "./internals/types.mjs";
 
 //#region src/Set/compact.d.ts
 

package/dist/Set/{difference.js → difference.mjs}

@@ -24,15 +24,11 @@ import { dfdlT } from "@monstermann/dfdl";
 */
 const difference = dfdlT((target, source) => {
 	if (source.size === 0) return target;
-	for (const value of target) if (source.has(value)) {
-		const result = /* @__PURE__ */ new Set();
-		for (const value$1 of target) {
-			if (source.has(value$1)) continue;
-			result.add(value$1);
-		}
-		return result;
-	}
-	return target;
+	let hasOverlap = false;
+	const result = /* @__PURE__ */ new Set();
+	for (const value of target) if (source.has(value)) hasOverlap = true;
+	else result.add(value);
+	return hasOverlap ? result : target;
 }, 2);
 
 //#endregion

package/dist/Set/index.d.mts

@@ -0,0 +1,39 @@
+import { add } from "./add.mjs";
+import { addAll } from "./addAll.mjs";
+import { addOr } from "./addOr.mjs";
+import { addOrElse } from "./addOrElse.mjs";
+import { addOrThrow } from "./addOrThrow.mjs";
+import { clone } from "./clone.mjs";
+import { compact } from "./compact.mjs";
+import { create } from "./create.mjs";
+import { difference } from "./difference.mjs";
+import { forEach } from "./forEach.mjs";
+import { has } from "./has.mjs";
+import { hasAll } from "./hasAll.mjs";
+import { hasAny } from "./hasAny.mjs";
+import { hasNone } from "./hasNone.mjs";
+import { intersection } from "./intersection.mjs";
+import { is } from "./is.mjs";
+import { isDisjointFrom } from "./isDisjointFrom.mjs";
+import { isEmpty } from "./isEmpty.mjs";
+import { isShallowEqual } from "./isShallowEqual.mjs";
+import { isSubsetOf } from "./isSubsetOf.mjs";
+import { isSupersetOf } from "./isSupersetOf.mjs";
+import { mapEach } from "./mapEach.mjs";
+import { remove } from "./remove.mjs";
+import { removeAll } from "./removeAll.mjs";
+import { removeOr } from "./removeOr.mjs";
+import { removeOrElse } from "./removeOrElse.mjs";
+import { removeOrThrow } from "./removeOrThrow.mjs";
+import { size } from "./size.mjs";
+import { symmetricDifference } from "./symmetricDifference.mjs";
+import { toArray } from "./toArray.mjs";
+import { union } from "./union.mjs";
+
+//#region src/Set/index.d.ts
+
+declare namespace Set {
+  export { add, addAll, addOr, addOrElse, addOrThrow, clone, compact, create, difference, forEach, has, hasAll, hasAny, hasNone, intersection, is, isDisjointFrom, isEmpty, isShallowEqual, isSubsetOf, isSupersetOf, mapEach, remove, removeAll, removeOr, removeOrElse, removeOrThrow, size, symmetricDifference, toArray, union };
+}
+//#endregion
+export { Set };

package/dist/Set/index.mjs

@@ -0,0 +1,69 @@
+import { add } from "./add.mjs";
+import { addAll } from "./addAll.mjs";
+import { addOr } from "./addOr.mjs";
+import { addOrElse } from "./addOrElse.mjs";
+import { addOrThrow } from "./addOrThrow.mjs";
+import { clone } from "./clone.mjs";
+import { compact } from "./compact.mjs";
+import { create } from "./create.mjs";
+import { difference } from "./difference.mjs";
+import { forEach } from "./forEach.mjs";
+import { has } from "./has.mjs";
+import { hasAll } from "./hasAll.mjs";
+import { hasAny } from "./hasAny.mjs";
+import { hasNone } from "./hasNone.mjs";
+import { intersection } from "./intersection.mjs";
+import { is } from "./is.mjs";
+import { isDisjointFrom } from "./isDisjointFrom.mjs";
+import { isEmpty } from "./isEmpty.mjs";
+import { isShallowEqual } from "./isShallowEqual.mjs";
+import { isSubsetOf } from "./isSubsetOf.mjs";
+import { isSupersetOf } from "./isSupersetOf.mjs";
+import { mapEach } from "./mapEach.mjs";
+import { remove } from "./remove.mjs";
+import { removeAll } from "./removeAll.mjs";
+import { removeOr } from "./removeOr.mjs";
+import { removeOrElse } from "./removeOrElse.mjs";
+import { removeOrThrow } from "./removeOrThrow.mjs";
+import { size } from "./size.mjs";
+import { symmetricDifference } from "./symmetricDifference.mjs";
+import { toArray } from "./toArray.mjs";
+import { union } from "./union.mjs";
+
+//#region src/Set/index.js
+const Set = {
+	add,
+	addAll,
+	addOr,
+	addOrElse,
+	addOrThrow,
+	clone,
+	compact,
+	create,
+	difference,
+	forEach,
+	has,
+	hasAll,
+	hasAny,
+	hasNone,
+	intersection,
+	is,
+	isDisjointFrom,
+	isEmpty,
+	isShallowEqual,
+	isSubsetOf,
+	isSupersetOf,
+	mapEach,
+	remove,
+	removeAll,
+	removeOr,
+	removeOrElse,
+	removeOrThrow,
+	size,
+	symmetricDifference,
+	toArray,
+	union
+};
+
+//#endregion
+export { Set };

package/dist/Set/{intersection.js → intersection.mjs}

@@ -25,15 +25,11 @@ import { dfdlT } from "@monstermann/dfdl";
 const intersection = dfdlT((target, source) => {
 	if (target.size === 0) return target;
 	if (source.size === 0) return source;
-	for (const value of target) if (!source.has(value)) {
-		const result = /* @__PURE__ */ new Set();
-		for (const value$1 of target) {
-			if (!source.has(value$1)) continue;
-			result.add(value$1);
-		}
-		return result;
-	}
-	return target;
+	let hasNonMatch = false;
+	const result = /* @__PURE__ */ new Set();
+	for (const value of target) if (!source.has(value)) hasNonMatch = true;
+	else result.add(value);
+	return hasNonMatch ? result : target;
 }, 2);
 
 //#endregion

package/dist/Set/{symmetricDifference.js → symmetricDifference.mjs}

@@ -25,21 +25,19 @@ import { dfdlT } from "@monstermann/dfdl";
 const symmetricDifference = dfdlT((target, source) => {
 	if (source.size === 0) return target;
 	if (target.size === 0) return source;
-	let hasChanges = false;
+	let result;
+	let allMatch = true;
 	for (const a of target) if (!source.has(a)) {
-		hasChanges = true;
-		break;
+		allMatch = false;
+		result ??= /* @__PURE__ */ new Set();
+		result.add(a);
 	}
-	if (!hasChanges) {
-		for (const b of source) if (!target.has(b)) {
-			hasChanges = true;
-			break;
-		}
+	for (const b of source) if (!target.has(b)) {
+		allMatch = false;
+		result ??= /* @__PURE__ */ new Set();
+		result.add(b);
 	}
-	if (!hasChanges) return /* @__PURE__ */ new Set();
-	const result = /* @__PURE__ */ new Set();
-	for (const a of target) if (!source.has(a)) result.add(a);
-	for (const b of source) if (!target.has(b)) result.add(b);
+	if (allMatch) return /* @__PURE__ */ new Set();
 	return result;
 }, 2);
 

package/dist/Set/{union.js → union.mjs}

@@ -25,13 +25,15 @@ import { dfdlT } from "@monstermann/dfdl";
 const union = dfdlT((target, source) => {
 	if (source.size === 0) return target;
 	if (target.size === 0) return source;
+	let result;
 	for (const element of source) if (!target.has(element)) {
-		const result = /* @__PURE__ */ new Set();
-		for (const a of target) result.add(a);
-		for (const b of source) result.add(b);
-		return result;
+		if (result === void 0) {
+			result = /* @__PURE__ */ new Set();
+			for (const a of target) result.add(a);
+		}
+		result.add(element);
 	}
-	return target;
+	return result ?? target;
 }, 2);
 
 //#endregion

package/dist/index.d.mts

@@ -0,0 +1,2 @@
+import { Set } from "./Set/index.mjs";
+export { Set };

package/dist/index.mjs

@@ -0,0 +1,3 @@
+import { Set } from "./Set/index.mjs";
+
+export { Set };

package/package.json

@@ -1,7 +1,7 @@
 {
     "name": "@monstermann/set",
     "type": "module",
-    "version": "0.1.0",
+    "version": "0.2.0",
     "description": "Functional utilities for sets.",
     "author": "Michael Ostermann <michaelostermann@me.com>",
     "license": "MIT",
@@ -17,14 +17,14 @@
     "sideEffects": false,
     "exports": {
         ".": {
-            "types": "./dist/index.d.ts",
-            "import": "./dist/index.js"
+            "types": "./dist/index.d.mts",
+            "import": "./dist/index.mjs"
         },
         "./*": "./dist/*"
     },
-    "main": "./dist/index.js",
-    "module": "./dist/index.js",
-    "types": "./dist/index.d.ts",
+    "main": "./dist/index.mjs",
+    "module": "./dist/index.mjs",
+    "types": "./dist/index.d.mts",
     "files": [
         "dist"
     ],

package/dist/Set/index.d.ts

@@ -1,39 +0,0 @@
-import { add } from "./add.js";
-import { addAll } from "./addAll.js";
-import { addOr } from "./addOr.js";
-import { addOrElse } from "./addOrElse.js";
-import { addOrThrow } from "./addOrThrow.js";
-import { clone } from "./clone.js";
-import { compact } from "./compact.js";
-import { create } from "./create.js";
-import { difference } from "./difference.js";
-import { forEach } from "./forEach.js";
-import { has } from "./has.js";
-import { hasAll } from "./hasAll.js";
-import { hasAny } from "./hasAny.js";
-import { hasNone } from "./hasNone.js";
-import { intersection } from "./intersection.js";
-import { is } from "./is.js";
-import { isDisjointFrom } from "./isDisjointFrom.js";
-import { isEmpty } from "./isEmpty.js";
-import { isShallowEqual } from "./isShallowEqual.js";
-import { isSubsetOf } from "./isSubsetOf.js";
-import { isSupersetOf } from "./isSupersetOf.js";
-import { mapEach } from "./mapEach.js";
-import { remove } from "./remove.js";
-import { removeAll } from "./removeAll.js";
-import { removeOr } from "./removeOr.js";
-import { removeOrElse } from "./removeOrElse.js";
-import { removeOrThrow } from "./removeOrThrow.js";
-import { size } from "./size.js";
-import { symmetricDifference } from "./symmetricDifference.js";
-import { toArray } from "./toArray.js";
-import { union } from "./union.js";
-
-//#region src/Set/index.d.ts
-
-declare namespace Set {
-  export { add, addAll, addOr, addOrElse, addOrThrow, clone, compact, create, difference, forEach, has, hasAll, hasAny, hasNone, intersection, is, isDisjointFrom, isEmpty, isShallowEqual, isSubsetOf, isSupersetOf, mapEach, remove, removeAll, removeOr, removeOrElse, removeOrThrow, size, symmetricDifference, toArray, union };
-}
-//#endregion
-export { Set };

package/dist/Set/index.js

@@ -1,69 +0,0 @@
-import { add } from "./add.js";
-import { addAll } from "./addAll.js";
-import { addOr } from "./addOr.js";
-import { addOrElse } from "./addOrElse.js";
-import { addOrThrow } from "./addOrThrow.js";
-import { clone } from "./clone.js";
-import { compact } from "./compact.js";
-import { create } from "./create.js";
-import { difference } from "./difference.js";
-import { forEach } from "./forEach.js";
-import { has } from "./has.js";
-import { hasAll } from "./hasAll.js";
-import { hasAny } from "./hasAny.js";
-import { hasNone } from "./hasNone.js";
-import { intersection } from "./intersection.js";
-import { is } from "./is.js";
-import { isDisjointFrom } from "./isDisjointFrom.js";
-import { isEmpty } from "./isEmpty.js";
-import { isShallowEqual } from "./isShallowEqual.js";
-import { isSubsetOf } from "./isSubsetOf.js";
-import { isSupersetOf } from "./isSupersetOf.js";
-import { mapEach } from "./mapEach.js";
-import { remove } from "./remove.js";
-import { removeAll } from "./removeAll.js";
-import { removeOr } from "./removeOr.js";
-import { removeOrElse } from "./removeOrElse.js";
-import { removeOrThrow } from "./removeOrThrow.js";
-import { size } from "./size.js";
-import { symmetricDifference } from "./symmetricDifference.js";
-import { toArray } from "./toArray.js";
-import { union } from "./union.js";
-
-//#region src/Set/index.js
-const Set = {
-	add,
-	addAll,
-	addOr,
-	addOrElse,
-	addOrThrow,
-	clone,
-	compact,
-	create,
-	difference,
-	forEach,
-	has,
-	hasAll,
-	hasAny,
-	hasNone,
-	intersection,
-	is,
-	isDisjointFrom,
-	isEmpty,
-	isShallowEqual,
-	isSubsetOf,
-	isSupersetOf,
-	mapEach,
-	remove,
-	removeAll,
-	removeOr,
-	removeOrElse,
-	removeOrThrow,
-	size,
-	symmetricDifference,
-	toArray,
-	union
-};
-
-//#endregion
-export { Set };

package/dist/index.d.ts

@@ -1,2 +0,0 @@
-import { Set } from "./Set/index.js";
-export { Set };

package/dist/index.js

@@ -1,3 +0,0 @@
-import { Set } from "./Set/index.js";
-
-export { Set };