@monstermann/set 0.0.0 → 0.1.1

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

@@ -4,6 +4,8 @@
  * function Set.add(target, value)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -7,6 +7,8 @@ import { cloneSet } from "@monstermann/remmi";
 * function Set.add(target, value)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.addAll(target, values)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -7,6 +7,8 @@ import { cloneSet } from "@monstermann/remmi";
 * function Set.addAll(target, values)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.addOr(target, value, or)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -7,6 +7,8 @@ import { cloneSet } from "@monstermann/remmi";
 * function Set.addOr(target, value, or)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.addOrElse(target, value, orElse)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -7,6 +7,8 @@ import { cloneSet } from "@monstermann/remmi";
 * function Set.addOrElse(target, value, orElse)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.addOrThrow(target, value)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -7,6 +7,8 @@ import { cloneSet } from "@monstermann/remmi";
 * function Set.addOrThrow(target, value)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.clone(target)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -7,6 +7,8 @@ import { cloneSet } from "@monstermann/remmi";
 * function Set.clone(target)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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
 
@@ -7,6 +7,8 @@ import { NonNil } from "./internals/types.js";
  * function Set.compact(target)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -7,6 +7,8 @@ import { cloneSet } from "@monstermann/remmi";
 * function Set.compact(target)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

package/dist/Set/create.d.mts

@@ -0,0 +1,17 @@
+//#region src/Set/create.d.ts
+/**
+ * ```ts
+ * function Set.create(iterable?)
+ * ```
+ *
+ * Example
+ *
+ * ```ts
+ * import { Set } from "@monstermann/set";
+ *
+ * Set.create([1, 2, 3]); // Set([1, 2, 3])
+ * ```
+ */
+declare function create<T>(iterable?: Iterable<T> | null | undefined): Set<T>;
+//#endregion
+export { create };

package/dist/Set/create.mjs

@@ -0,0 +1,20 @@
+//#region src/Set/create.ts
+/**
+* ```ts
+* function Set.create(iterable?)
+* ```
+*
+* Example
+*
+* ```ts
+* import { Set } from "@monstermann/set";
+*
+* Set.create([1, 2, 3]); // Set([1, 2, 3])
+* ```
+*/
+function create(iterable) {
+	return new globalThis.Set(iterable);
+}
+
+//#endregion
+export { create };

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

@@ -4,6 +4,8 @@
  * function Set.difference(target, source)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.difference(target, source)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.forEach(target, fn)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.forEach(target, fn)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.has(target, value)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.has(target, value)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.hasAll(target, values)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.hasAll(target, values)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.hasAny(target, values)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.hasAny(target, values)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.hasNone(target, values)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.hasNone(target, values)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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.d.ts → intersection.d.mts}

@@ -4,6 +4,8 @@
  * function Set.intersection(target, source)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.intersection(target, source)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

package/dist/Set/is.d.mts

@@ -0,0 +1,30 @@
+//#region src/Set/is.d.ts
+/**
+ * ```ts
+ * function Set.is(target)
+ * ```
+ *
+ * Example
+ *
+ * ```ts
+ * import { Set } from "@monstermann/set";
+ *
+ * Set.is(Set.create([1, 2, 3])); // true
+ * Set.is([1, 2, 3]); // false
+ * Set.is({}); // false
+ * ```
+ *
+ * ```ts
+ * import { Set } from "@monstermann/set";
+ *
+ * pipe(Set.create([1, 2, 3]), Set.is()); // true
+ * pipe([1, 2, 3], Set.is()); // false
+ * pipe({}, Set.is()); // false
+ * ```
+ */
+declare const is: {
+  (): (target: unknown) => target is Set<unknown>;
+  (target: unknown): target is Set<unknown>;
+};
+//#endregion
+export { is };

package/dist/Set/is.mjs

@@ -0,0 +1,32 @@
+import { dfdlT } from "@monstermann/dfdl";
+
+//#region src/Set/is.ts
+/**
+* ```ts
+* function Set.is(target)
+* ```
+*
+* Example
+*
+* ```ts
+* import { Set } from "@monstermann/set";
+*
+* Set.is(Set.create([1, 2, 3])); // true
+* Set.is([1, 2, 3]); // false
+* Set.is({}); // false
+* ```
+*
+* ```ts
+* import { Set } from "@monstermann/set";
+*
+* pipe(Set.create([1, 2, 3]), Set.is()); // true
+* pipe([1, 2, 3], Set.is()); // false
+* pipe({}, Set.is()); // false
+* ```
+*/
+const is = dfdlT((target) => {
+	return target instanceof Set;
+}, 1);
+
+//#endregion
+export { is };

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

@@ -4,6 +4,8 @@
  * function Set.isDisjointFrom(target, source)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.isDisjointFrom(target, source)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.isEmpty(target)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.isEmpty(target)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.isShallowEqual(target, source)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.isShallowEqual(target, source)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.isSubsetOf(target, source)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.isSubsetOf(target, source)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.isSupersetOf(target, source)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.isSupersetOf(target, source)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.mapEach(target, fn)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.mapEach(target, fn)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.remove(target, value)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -7,6 +7,8 @@ import { cloneSet } from "@monstermann/remmi";
 * function Set.remove(target, value)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.removeAll(target, values)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -7,6 +7,8 @@ import { cloneSet } from "@monstermann/remmi";
 * function Set.removeAll(target, values)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.removeOr(target, value, or)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -7,6 +7,8 @@ import { cloneSet } from "@monstermann/remmi";
 * function Set.removeOr(target, value, or)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.removeOrElse(target, value, orElse)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -7,6 +7,8 @@ import { cloneSet } from "@monstermann/remmi";
 * function Set.removeOrElse(target, value, orElse)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.removeOrThrow(target, value)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -7,6 +7,8 @@ import { cloneSet } from "@monstermann/remmi";
 * function Set.removeOrThrow(target, value)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.size(target)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.size(target)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.symmetricDifference(target, source)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.symmetricDifference(target, source)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.toArray(target)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.toArray(target)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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

@@ -4,6 +4,8 @@
  * function Set.union(target, source)
  * ```
  *
+ * Example
+ *
  * ```ts
  * import { Set } from "@monstermann/set";
  *

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

@@ -6,6 +6,8 @@ import { dfdlT } from "@monstermann/dfdl";
 * function Set.union(target, source)
 * ```
 *
+* Example
+*
 * ```ts
 * import { Set } from "@monstermann/set";
 *

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.0.0",
+    "version": "0.1.1",
     "description": "Functional utilities for sets.",
     "author": "Michael Ostermann <michaelostermann@me.com>",
     "license": "MIT",
@@ -17,13 +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,38 +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 { 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 { isDisjointFrom } from "./isDisjointFrom.js";
-import { isEmpty } from "./isEmpty.js";
-import { isSet } from "./isSet.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, difference, forEach, has, hasAll, hasAny, hasNone, intersection, isDisjointFrom, isEmpty, isSet, isShallowEqual, isSubsetOf, isSupersetOf, mapEach, remove, removeAll, removeOr, removeOrElse, removeOrThrow, size, symmetricDifference, toArray, union };
-}
-//#endregion
-export { Set };

package/dist/Set/index.js

@@ -1,67 +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 { 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 { isDisjointFrom } from "./isDisjointFrom.js";
-import { isEmpty } from "./isEmpty.js";
-import { isSet } from "./isSet.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,
-	difference,
-	forEach,
-	has,
-	hasAll,
-	hasAny,
-	hasNone,
-	intersection,
-	isDisjointFrom,
-	isEmpty,
-	isSet,
-	isShallowEqual,
-	isSubsetOf,
-	isSupersetOf,
-	mapEach,
-	remove,
-	removeAll,
-	removeOr,
-	removeOrElse,
-	removeOrThrow,
-	size,
-	symmetricDifference,
-	toArray,
-	union
-};
-
-//#endregion
-export { Set };

package/dist/Set/isSet.d.ts

@@ -1,28 +0,0 @@
-//#region src/Set/isSet.d.ts
-/**
- * ```ts
- * function Set.isSet(target)
- * ```
- *
- * ```ts
- * import { Set } from "@monstermann/set";
- *
- * Set.isSet(Set.create([1, 2, 3])); // true
- * Set.isSet([1, 2, 3]); // false
- * Set.isSet({}); // false
- * ```
- *
- * ```ts
- * import { Set } from "@monstermann/set";
- *
- * pipe(Set.create([1, 2, 3]), Set.isSet()); // true
- * pipe([1, 2, 3], Set.isSet()); // false
- * pipe({}, Set.isSet()); // false
- * ```
- */
-declare const isSet: {
-  (): (target: unknown) => target is Set<unknown>;
-  (target: unknown): target is Set<unknown>;
-};
-//#endregion
-export { isSet };

package/dist/Set/isSet.js

@@ -1,30 +0,0 @@
-import { dfdlT } from "@monstermann/dfdl";
-
-//#region src/Set/isSet.ts
-/**
-* ```ts
-* function Set.isSet(target)
-* ```
-*
-* ```ts
-* import { Set } from "@monstermann/set";
-*
-* Set.isSet(Set.create([1, 2, 3])); // true
-* Set.isSet([1, 2, 3]); // false
-* Set.isSet({}); // false
-* ```
-*
-* ```ts
-* import { Set } from "@monstermann/set";
-*
-* pipe(Set.create([1, 2, 3]), Set.isSet()); // true
-* pipe([1, 2, 3], Set.isSet()); // false
-* pipe({}, Set.isSet()); // false
-* ```
-*/
-const isSet = dfdlT((target) => {
-	return target instanceof Set;
-}, 1);
-
-//#endregion
-export { isSet };

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 };