@monstermann/set 0.1.1 → 0.2.0

package/dist/Set/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/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.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.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/package.json

@@ -1,7 +1,7 @@
 {
     "name": "@monstermann/set",
     "type": "module",
-    "version": "0.1.1",
+    "version": "0.2.0",
     "description": "Functional utilities for sets.",
     "author": "Michael Ostermann <michaelostermann@me.com>",
     "license": "MIT",