@ts-fns/stdlib 0.1.0 → 0.2.0

package/dist/order/index.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_purry = require("../purry-B2_0DGLV.cjs");
+const require_purry = require("../purry-Dqp_F64t.cjs");
 const require_errors = require("../errors-O-d_Vemi.cjs");
 //#region src/order/breakTie.ts
 function breakTieImplementation(order, other) {
@@ -19,11 +19,24 @@ function compare(...args) {
 }
 //#endregion
 //#region src/order/order.constants.ts
+/** Order value indicating the left operand is less than the right. */
 const lt = -1;
+/** Order value indicating the operands are equal. */
 const eq = 0;
+/** Order value indicating the left operand is greater than the right. */
 const gt = 1;
 //#endregion
 //#region src/order/negate.ts
+/**
+* Flips an order value: less-than becomes greater-than and vice versa; equal stays equal.
+*
+* @example
+* ```ts
+* negate(-1); // 1
+* negate(0); // 0
+* negate(1); // -1
+* ```
+*/
 function negate(order) {
 	switch (order) {
 		case -1: return 1;
@@ -34,6 +47,14 @@ function negate(order) {
 }
 //#endregion
 //#region src/order/reverse.ts
+/**
+* Reverses an orderer by negating its result.
+*
+* @example
+* ```ts
+* reverse((a, b) => (a < b ? -1 : a > b ? 1 : 0))(2, 1); // 1
+* ```
+*/
 function reverse(orderer) {
 	return (left, right) => negate(orderer(left, right));
 }

package/dist/order/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","names":["purry","NotYetImplementedError","purry","Panic"],"sources":["../../src/order/breakTie.ts","../../src/order/compare.ts","../../src/order/order.constants.ts","../../src/order/negate.ts","../../src/order/reverse.ts"],"sourcesContent":["import { purry } from '../function/purry';\n\nimport type { Order } from './order.constants';\n\nexport function breakTieImplementation(order: Order, other: Order): Order {\n  if (order === 0) return other;\n  return order;\n}\n\nexport function breakTie(other: Order): (order: Order) => Order;\nexport function breakTie(order: Order, other: Order): Order;\nexport function breakTie(...args: readonly unknown[]): unknown {\n  return purry(breakTieImplementation, args);\n}\n","import { NotYetImplementedError } from '../errors';\nimport { purry } from '../function/purry';\n\nimport type { Order } from './order.constants';\n\n// eslint-disable-next-line @typescript-eslint/no-unused-vars\nfunction compareImplementation(left: Order, right: Order): Order {\n  throw new NotYetImplementedError('Order.compare not yet implemented');\n}\n\nexport function compare(left: Order, right: Order): Order;\nexport function compare(...args: readonly unknown[]): unknown {\n  return purry(compareImplementation, args);\n}\n","export type Eq = 0;\nexport type Lt = -1;\nexport type Gt = 1;\n\nexport type Order = Eq | Gt | Lt;\n\nexport const lt: Lt = -1;\nexport const eq: Eq = 0;\nexport const gt: Gt = 1;\n","import { Panic } from '../errors';\n\nimport type { Order } from './order.constants';\nimport { eq, gt, lt } from './order.constants';\n\nexport function negate(order: Order): Order {\n  switch (order) {\n    case lt:\n      return gt;\n    case eq:\n      return eq;\n    case gt:\n      return lt;\n    default:\n      throw new Panic('Ord.negate() received a number that was not -1, 0, or 1');\n  }\n}\n","import { negate } from './negate';\nimport type { Order } from './order.constants';\n\nexport function reverse<T>(orderer: (left: T, right: T) => Order): (left: T, right: T) => Order {\n  return (left: T, right: T) => negate(orderer(left, right));\n}\n"],"mappings":";;;;AAIA,SAAgB,uBAAuB,OAAc,OAAqB;CACxE,IAAI,UAAU,GAAG,OAAO;CACxB,OAAO;AACT;AAIA,SAAgB,SAAS,GAAG,MAAmC;CAC7D,OAAOA,cAAAA,MAAM,wBAAwB,IAAI;AAC3C;;;ACPA,SAAS,sBAAsB,MAAa,OAAqB;CAC/D,MAAM,IAAIC,eAAAA,uBAAuB,mCAAmC;AACtE;AAGA,SAAgB,QAAQ,GAAG,MAAmC;CAC5D,OAAOC,cAAAA,MAAM,uBAAuB,IAAI;AAC1C;;;ACPA,MAAa,KAAS;AACtB,MAAa,KAAS;AACtB,MAAa,KAAS;;;ACHtB,SAAgB,OAAO,OAAqB;CAC1C,QAAQ,OAAR;EACE,KAAA,IACE,OAAA;EACF,KAAA,GACE,OAAA;EACF,KAAA,GACE,OAAA;EACF,SACE,MAAM,IAAIC,eAAAA,MAAM,yDAAyD;CAC7E;AACF;;;ACbA,SAAgB,QAAW,SAAqE;CAC9F,QAAQ,MAAS,UAAa,OAAO,QAAQ,MAAM,KAAK,CAAC;AAC3D"}
+{"version":3,"file":"index.cjs","names":["purry","NotYetImplementedError","purry","Panic"],"sources":["../../src/order/breakTie.ts","../../src/order/compare.ts","../../src/order/order.constants.ts","../../src/order/negate.ts","../../src/order/reverse.ts"],"sourcesContent":["import { purry } from '../function/purry';\n\nimport type { Order } from './order.constants';\n\nexport function breakTieImplementation(order: Order, other: Order): Order {\n  if (order === 0) return other;\n  return order;\n}\n\n/**\n * Resolves a tie by returning `other` when `order` is equal; otherwise returns `order`.\n *\n * @example\n * ```ts\n * breakTie(0, 1); // 1\n * breakTie(-1, 1); // -1\n * breakTie(1)(0); // 1\n * ```\n */\nexport function breakTie(other: Order): (order: Order) => Order;\nexport function breakTie(order: Order, other: Order): Order;\nexport function breakTie(...args: readonly unknown[]): unknown {\n  return purry(breakTieImplementation, args);\n}\n","import { NotYetImplementedError } from '../errors';\nimport { purry } from '../function/purry';\n\nimport type { Order } from './order.constants';\n\n// eslint-disable-next-line @typescript-eslint/no-unused-vars\nfunction compareImplementation(left: Order, right: Order): Order {\n  throw new NotYetImplementedError('Order.compare not yet implemented');\n}\n\n/**\n * Compares two order values and returns their relative ordering.\n *\n * @example\n * ```ts\n * compare(-1, 1); // throws NotYetImplementedError\n * ```\n */\nexport function compare(left: Order, right: Order): Order;\nexport function compare(...args: readonly unknown[]): unknown {\n  return purry(compareImplementation, args);\n}\n","export type Eq = 0;\nexport type Lt = -1;\nexport type Gt = 1;\n\nexport type Order = Eq | Gt | Lt;\n\n/** Order value indicating the left operand is less than the right. */\nexport const lt: Lt = -1;\n\n/** Order value indicating the operands are equal. */\nexport const eq: Eq = 0;\n\n/** Order value indicating the left operand is greater than the right. */\nexport const gt: Gt = 1;\n","import { Panic } from '../errors';\n\nimport type { Order } from './order.constants';\nimport { eq, gt, lt } from './order.constants';\n\n/**\n * Flips an order value: less-than becomes greater-than and vice versa; equal stays equal.\n *\n * @example\n * ```ts\n * negate(-1); // 1\n * negate(0); // 0\n * negate(1); // -1\n * ```\n */\nexport function negate(order: Order): Order {\n  switch (order) {\n    case lt:\n      return gt;\n    case eq:\n      return eq;\n    case gt:\n      return lt;\n    default:\n      throw new Panic('Ord.negate() received a number that was not -1, 0, or 1');\n  }\n}\n","import { negate } from './negate';\nimport type { Order } from './order.constants';\n\n/**\n * Reverses an orderer by negating its result.\n *\n * @example\n * ```ts\n * reverse((a, b) => (a < b ? -1 : a > b ? 1 : 0))(2, 1); // 1\n * ```\n */\nexport function reverse<T>(orderer: (left: T, right: T) => Order): (left: T, right: T) => Order {\n  return (left: T, right: T) => negate(orderer(left, right));\n}\n"],"mappings":";;;;AAIA,SAAgB,uBAAuB,OAAc,OAAqB;CACxE,IAAI,UAAU,GAAG,OAAO;CACxB,OAAO;AACT;AAcA,SAAgB,SAAS,GAAG,MAAmC;CAC7D,OAAOA,cAAAA,MAAM,wBAAwB,IAAI;AAC3C;;;ACjBA,SAAS,sBAAsB,MAAa,OAAqB;CAC/D,MAAM,IAAIC,eAAAA,uBAAuB,mCAAmC;AACtE;AAWA,SAAgB,QAAQ,GAAG,MAAmC;CAC5D,OAAOC,cAAAA,MAAM,uBAAuB,IAAI;AAC1C;;;;ACdA,MAAa,KAAS;;AAGtB,MAAa,KAAS;;AAGtB,MAAa,KAAS;;;;;;;;;;;;;ACEtB,SAAgB,OAAO,OAAqB;CAC1C,QAAQ,OAAR;EACE,KAAA,IACE,OAAA;EACF,KAAA,GACE,OAAA;EACF,KAAA,GACE,OAAA;EACF,SACE,MAAM,IAAIC,eAAAA,MAAM,yDAAyD;CAC7E;AACF;;;;;;;;;;;ACfA,SAAgB,QAAW,SAAqE;CAC9F,QAAQ,MAAS,UAAa,OAAO,QAAQ,MAAM,KAAK,CAAC;AAC3D"}

package/dist/order/index.d.cts

@@ -1,3 +1,3 @@
-import { a as eq, i as Order, n as Gt, o as gt, r as Lt, s as lt, t as Eq } from "../order.constants-BWSCg3C7.cjs";
-import { a as breakTieImplementation, i as breakTie, n as negate, r as compare, t as reverse } from "../index-BJlKyBJH.cjs";
+import { a as eq, i as Order, n as Gt, o as gt, r as Lt, s as lt, t as Eq } from "../order.constants-DpGY-EDp.cjs";
+import { a as breakTieImplementation, i as breakTie, n as negate, r as compare, t as reverse } from "../index-MbdqaUt1.cjs";
 export { Eq, Gt, Lt, Order, breakTie, breakTieImplementation, compare, eq, gt, lt, negate, reverse };

package/dist/order/index.d.mts

@@ -1,3 +1,3 @@
-import { a as eq, i as Order, n as Gt, o as gt, r as Lt, s as lt, t as Eq } from "../order.constants-BWSCg3C7.mjs";
-import { a as breakTieImplementation, i as breakTie, n as negate, r as compare, t as reverse } from "../index-DGrnGMDt.mjs";
+import { a as eq, i as Order, n as Gt, o as gt, r as Lt, s as lt, t as Eq } from "../order.constants-DpGY-EDp.mjs";
+import { a as breakTieImplementation, i as breakTie, n as negate, r as compare, t as reverse } from "../index-k-paNOu4.mjs";
 export { Eq, Gt, Lt, Order, breakTie, breakTieImplementation, compare, eq, gt, lt, negate, reverse };

package/dist/order/index.mjs

@@ -1,4 +1,4 @@
-import { t as purry } from "../purry-BOWmqwDB.mjs";
+import { t as purry } from "../purry-DXnhXie9.mjs";
 import { a as NotYetImplementedError, o as Panic } from "../errors-Dw1kitu_.mjs";
 //#region src/order/breakTie.ts
 function breakTieImplementation(order, other) {
@@ -18,11 +18,24 @@ function compare(...args) {
 }
 //#endregion
 //#region src/order/order.constants.ts
+/** Order value indicating the left operand is less than the right. */
 const lt = -1;
+/** Order value indicating the operands are equal. */
 const eq = 0;
+/** Order value indicating the left operand is greater than the right. */
 const gt = 1;
 //#endregion
 //#region src/order/negate.ts
+/**
+* Flips an order value: less-than becomes greater-than and vice versa; equal stays equal.
+*
+* @example
+* ```ts
+* negate(-1); // 1
+* negate(0); // 0
+* negate(1); // -1
+* ```
+*/
 function negate(order) {
 	switch (order) {
 		case -1: return 1;
@@ -33,6 +46,14 @@ function negate(order) {
 }
 //#endregion
 //#region src/order/reverse.ts
+/**
+* Reverses an orderer by negating its result.
+*
+* @example
+* ```ts
+* reverse((a, b) => (a < b ? -1 : a > b ? 1 : 0))(2, 1); // 1
+* ```
+*/
 function reverse(orderer) {
 	return (left, right) => negate(orderer(left, right));
 }

package/dist/order/index.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.mjs","names":[],"sources":["../../src/order/breakTie.ts","../../src/order/compare.ts","../../src/order/order.constants.ts","../../src/order/negate.ts","../../src/order/reverse.ts"],"sourcesContent":["import { purry } from '../function/purry';\n\nimport type { Order } from './order.constants';\n\nexport function breakTieImplementation(order: Order, other: Order): Order {\n  if (order === 0) return other;\n  return order;\n}\n\nexport function breakTie(other: Order): (order: Order) => Order;\nexport function breakTie(order: Order, other: Order): Order;\nexport function breakTie(...args: readonly unknown[]): unknown {\n  return purry(breakTieImplementation, args);\n}\n","import { NotYetImplementedError } from '../errors';\nimport { purry } from '../function/purry';\n\nimport type { Order } from './order.constants';\n\n// eslint-disable-next-line @typescript-eslint/no-unused-vars\nfunction compareImplementation(left: Order, right: Order): Order {\n  throw new NotYetImplementedError('Order.compare not yet implemented');\n}\n\nexport function compare(left: Order, right: Order): Order;\nexport function compare(...args: readonly unknown[]): unknown {\n  return purry(compareImplementation, args);\n}\n","export type Eq = 0;\nexport type Lt = -1;\nexport type Gt = 1;\n\nexport type Order = Eq | Gt | Lt;\n\nexport const lt: Lt = -1;\nexport const eq: Eq = 0;\nexport const gt: Gt = 1;\n","import { Panic } from '../errors';\n\nimport type { Order } from './order.constants';\nimport { eq, gt, lt } from './order.constants';\n\nexport function negate(order: Order): Order {\n  switch (order) {\n    case lt:\n      return gt;\n    case eq:\n      return eq;\n    case gt:\n      return lt;\n    default:\n      throw new Panic('Ord.negate() received a number that was not -1, 0, or 1');\n  }\n}\n","import { negate } from './negate';\nimport type { Order } from './order.constants';\n\nexport function reverse<T>(orderer: (left: T, right: T) => Order): (left: T, right: T) => Order {\n  return (left: T, right: T) => negate(orderer(left, right));\n}\n"],"mappings":";;;AAIA,SAAgB,uBAAuB,OAAc,OAAqB;CACxE,IAAI,UAAU,GAAG,OAAO;CACxB,OAAO;AACT;AAIA,SAAgB,SAAS,GAAG,MAAmC;CAC7D,OAAO,MAAM,wBAAwB,IAAI;AAC3C;;;ACPA,SAAS,sBAAsB,MAAa,OAAqB;CAC/D,MAAM,IAAI,uBAAuB,mCAAmC;AACtE;AAGA,SAAgB,QAAQ,GAAG,MAAmC;CAC5D,OAAO,MAAM,uBAAuB,IAAI;AAC1C;;;ACPA,MAAa,KAAS;AACtB,MAAa,KAAS;AACtB,MAAa,KAAS;;;ACHtB,SAAgB,OAAO,OAAqB;CAC1C,QAAQ,OAAR;EACE,KAAA,IACE,OAAA;EACF,KAAA,GACE,OAAA;EACF,KAAA,GACE,OAAA;EACF,SACE,MAAM,IAAI,MAAM,yDAAyD;CAC7E;AACF;;;ACbA,SAAgB,QAAW,SAAqE;CAC9F,QAAQ,MAAS,UAAa,OAAO,QAAQ,MAAM,KAAK,CAAC;AAC3D"}
+{"version":3,"file":"index.mjs","names":[],"sources":["../../src/order/breakTie.ts","../../src/order/compare.ts","../../src/order/order.constants.ts","../../src/order/negate.ts","../../src/order/reverse.ts"],"sourcesContent":["import { purry } from '../function/purry';\n\nimport type { Order } from './order.constants';\n\nexport function breakTieImplementation(order: Order, other: Order): Order {\n  if (order === 0) return other;\n  return order;\n}\n\n/**\n * Resolves a tie by returning `other` when `order` is equal; otherwise returns `order`.\n *\n * @example\n * ```ts\n * breakTie(0, 1); // 1\n * breakTie(-1, 1); // -1\n * breakTie(1)(0); // 1\n * ```\n */\nexport function breakTie(other: Order): (order: Order) => Order;\nexport function breakTie(order: Order, other: Order): Order;\nexport function breakTie(...args: readonly unknown[]): unknown {\n  return purry(breakTieImplementation, args);\n}\n","import { NotYetImplementedError } from '../errors';\nimport { purry } from '../function/purry';\n\nimport type { Order } from './order.constants';\n\n// eslint-disable-next-line @typescript-eslint/no-unused-vars\nfunction compareImplementation(left: Order, right: Order): Order {\n  throw new NotYetImplementedError('Order.compare not yet implemented');\n}\n\n/**\n * Compares two order values and returns their relative ordering.\n *\n * @example\n * ```ts\n * compare(-1, 1); // throws NotYetImplementedError\n * ```\n */\nexport function compare(left: Order, right: Order): Order;\nexport function compare(...args: readonly unknown[]): unknown {\n  return purry(compareImplementation, args);\n}\n","export type Eq = 0;\nexport type Lt = -1;\nexport type Gt = 1;\n\nexport type Order = Eq | Gt | Lt;\n\n/** Order value indicating the left operand is less than the right. */\nexport const lt: Lt = -1;\n\n/** Order value indicating the operands are equal. */\nexport const eq: Eq = 0;\n\n/** Order value indicating the left operand is greater than the right. */\nexport const gt: Gt = 1;\n","import { Panic } from '../errors';\n\nimport type { Order } from './order.constants';\nimport { eq, gt, lt } from './order.constants';\n\n/**\n * Flips an order value: less-than becomes greater-than and vice versa; equal stays equal.\n *\n * @example\n * ```ts\n * negate(-1); // 1\n * negate(0); // 0\n * negate(1); // -1\n * ```\n */\nexport function negate(order: Order): Order {\n  switch (order) {\n    case lt:\n      return gt;\n    case eq:\n      return eq;\n    case gt:\n      return lt;\n    default:\n      throw new Panic('Ord.negate() received a number that was not -1, 0, or 1');\n  }\n}\n","import { negate } from './negate';\nimport type { Order } from './order.constants';\n\n/**\n * Reverses an orderer by negating its result.\n *\n * @example\n * ```ts\n * reverse((a, b) => (a < b ? -1 : a > b ? 1 : 0))(2, 1); // 1\n * ```\n */\nexport function reverse<T>(orderer: (left: T, right: T) => Order): (left: T, right: T) => Order {\n  return (left: T, right: T) => negate(orderer(left, right));\n}\n"],"mappings":";;;AAIA,SAAgB,uBAAuB,OAAc,OAAqB;CACxE,IAAI,UAAU,GAAG,OAAO;CACxB,OAAO;AACT;AAcA,SAAgB,SAAS,GAAG,MAAmC;CAC7D,OAAO,MAAM,wBAAwB,IAAI;AAC3C;;;ACjBA,SAAS,sBAAsB,MAAa,OAAqB;CAC/D,MAAM,IAAI,uBAAuB,mCAAmC;AACtE;AAWA,SAAgB,QAAQ,GAAG,MAAmC;CAC5D,OAAO,MAAM,uBAAuB,IAAI;AAC1C;;;;ACdA,MAAa,KAAS;;AAGtB,MAAa,KAAS;;AAGtB,MAAa,KAAS;;;;;;;;;;;;;ACEtB,SAAgB,OAAO,OAAqB;CAC1C,QAAQ,OAAR;EACE,KAAA,IACE,OAAA;EACF,KAAA,GACE,OAAA;EACF,KAAA,GACE,OAAA;EACF,SACE,MAAM,IAAI,MAAM,yDAAyD;CAC7E;AACF;;;;;;;;;;;ACfA,SAAgB,QAAW,SAAqE;CAC9F,QAAQ,MAAS,UAAa,OAAO,QAAQ,MAAM,KAAK,CAAC;AAC3D"}

package/dist/{order.constants-BWSCg3C7.d.cts → order.constants-DpGY-EDp.d.cts}

@@ -3,9 +3,12 @@ type Eq = 0;
 type Lt = -1;
 type Gt = 1;
 type Order = Eq | Gt | Lt;
+/** Order value indicating the left operand is less than the right. */
 declare const lt: Lt;
+/** Order value indicating the operands are equal. */
 declare const eq: Eq;
+/** Order value indicating the left operand is greater than the right. */
 declare const gt: Gt;
 //#endregion
 export { eq as a, Order as i, Gt as n, gt as o, Lt as r, lt as s, Eq as t };
-//# sourceMappingURL=order.constants-BWSCg3C7.d.cts.map
+//# sourceMappingURL=order.constants-DpGY-EDp.d.cts.map

package/dist/order.constants-DpGY-EDp.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"order.constants-DpGY-EDp.d.cts","names":[],"sources":["../src/order/order.constants.ts"],"mappings":";KAAY,EAAA;AAAA,KACA,EAAA;AAAA,KACA,EAAA;AAAA,KAEA,KAAA,GAAQ,EAAA,GAAK,EAAA,GAAK,EAAA;;cAGjB,EAAA,EAAI,EAAO;AANxB;AAAA,cASa,EAAA,EAAI,EAAM;;cAGV,EAAA,EAAI,EAAM"}

package/dist/{order.constants-BWSCg3C7.d.mts → order.constants-DpGY-EDp.d.mts}

@@ -3,9 +3,12 @@ type Eq = 0;
 type Lt = -1;
 type Gt = 1;
 type Order = Eq | Gt | Lt;
+/** Order value indicating the left operand is less than the right. */
 declare const lt: Lt;
+/** Order value indicating the operands are equal. */
 declare const eq: Eq;
+/** Order value indicating the left operand is greater than the right. */
 declare const gt: Gt;
 //#endregion
 export { eq as a, Order as i, Gt as n, gt as o, Lt as r, lt as s, Eq as t };
-//# sourceMappingURL=order.constants-BWSCg3C7.d.mts.map
+//# sourceMappingURL=order.constants-DpGY-EDp.d.mts.map

package/dist/order.constants-DpGY-EDp.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"order.constants-DpGY-EDp.d.mts","names":[],"sources":["../src/order/order.constants.ts"],"mappings":";KAAY,EAAA;AAAA,KACA,EAAA;AAAA,KACA,EAAA;AAAA,KAEA,KAAA,GAAQ,EAAA,GAAK,EAAA,GAAK,EAAA;;cAGjB,EAAA,EAAI,EAAO;AANxB;AAAA,cASa,EAAA,EAAI,EAAM;;cAGV,EAAA,EAAI,EAAM"}

package/dist/purry-DXnhXie9.mjs

@@ -0,0 +1,22 @@
+//#region src/function/purry.ts
+/**
+* Enables pipe-style partial application for multi-argument functions.
+* With all arguments, calls the function immediately; with one fewer, returns a function that accepts the remaining argument.
+* Throws when called with any other number of arguments.
+*
+* @example
+* ```ts
+* purry((data, n) => data.slice(0, n), [2])([1, 2, 3]); // [1, 2]
+* purry((data, n) => data.slice(0, n), [[1, 2, 3], 2]); // [1, 2]
+* ```
+*/
+function purry(fn, args) {
+	const diff = fn.length - args.length;
+	if (diff === 0) return fn(...args);
+	if (diff === 1) return (data) => fn(data, ...args);
+	throw new Error(`Attempt to call Purried function "${fn.name}" failed with wrong number of arguments. Received "${args.length}". It can accept either "${fn.length}" or "${fn.length - 1}" arguments.`);
+}
+//#endregion
+export { purry as t };
+
+//# sourceMappingURL=purry-DXnhXie9.mjs.map

package/dist/purry-DXnhXie9.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"purry-DXnhXie9.mjs","names":[],"sources":["../src/function/purry.ts"],"sourcesContent":["/**\n * Enables pipe-style partial application for multi-argument functions.\n * With all arguments, calls the function immediately; with one fewer, returns a function that accepts the remaining argument.\n * Throws when called with any other number of arguments.\n *\n * @example\n * ```ts\n * purry((data, n) => data.slice(0, n), [2])([1, 2, 3]); // [1, 2]\n * purry((data, n) => data.slice(0, n), [[1, 2, 3], 2]); // [1, 2]\n * ```\n */\nexport function purry(fn: (...args: any) => unknown, args: readonly unknown[]): unknown {\n  const diff = fn.length - args.length;\n  if (diff === 0) {\n    return fn(...args);\n  }\n\n  if (diff === 1) {\n    return (data: unknown): unknown => fn(data, ...args);\n  }\n\n  throw new Error(\n    `Attempt to call Purried function \"${fn.name}\" failed with wrong number of arguments. Received \"${args.length}\". It can accept either \"${fn.length}\" or \"${fn.length - 1}\" arguments.`,\n  );\n}\n"],"mappings":";;;;;;;;;;;;AAWA,SAAgB,MAAM,IAA+B,MAAmC;CACtF,MAAM,OAAO,GAAG,SAAS,KAAK;CAC9B,IAAI,SAAS,GACX,OAAO,GAAG,GAAG,IAAI;CAGnB,IAAI,SAAS,GACX,QAAQ,SAA2B,GAAG,MAAM,GAAG,IAAI;CAGrD,MAAM,IAAI,MACR,qCAAqC,GAAG,KAAK,qDAAqD,KAAK,OAAO,2BAA2B,GAAG,OAAO,QAAQ,GAAG,SAAS,EAAE,aAC3K;AACF"}

package/dist/purry-Dqp_F64t.cjs

@@ -0,0 +1,27 @@
+//#region src/function/purry.ts
+/**
+* Enables pipe-style partial application for multi-argument functions.
+* With all arguments, calls the function immediately; with one fewer, returns a function that accepts the remaining argument.
+* Throws when called with any other number of arguments.
+*
+* @example
+* ```ts
+* purry((data, n) => data.slice(0, n), [2])([1, 2, 3]); // [1, 2]
+* purry((data, n) => data.slice(0, n), [[1, 2, 3], 2]); // [1, 2]
+* ```
+*/
+function purry(fn, args) {
+	const diff = fn.length - args.length;
+	if (diff === 0) return fn(...args);
+	if (diff === 1) return (data) => fn(data, ...args);
+	throw new Error(`Attempt to call Purried function "${fn.name}" failed with wrong number of arguments. Received "${args.length}". It can accept either "${fn.length}" or "${fn.length - 1}" arguments.`);
+}
+//#endregion
+Object.defineProperty(exports, "purry", {
+	enumerable: true,
+	get: function() {
+		return purry;
+	}
+});
+
+//# sourceMappingURL=purry-Dqp_F64t.cjs.map

package/dist/purry-Dqp_F64t.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"purry-Dqp_F64t.cjs","names":[],"sources":["../src/function/purry.ts"],"sourcesContent":["/**\n * Enables pipe-style partial application for multi-argument functions.\n * With all arguments, calls the function immediately; with one fewer, returns a function that accepts the remaining argument.\n * Throws when called with any other number of arguments.\n *\n * @example\n * ```ts\n * purry((data, n) => data.slice(0, n), [2])([1, 2, 3]); // [1, 2]\n * purry((data, n) => data.slice(0, n), [[1, 2, 3], 2]); // [1, 2]\n * ```\n */\nexport function purry(fn: (...args: any) => unknown, args: readonly unknown[]): unknown {\n  const diff = fn.length - args.length;\n  if (diff === 0) {\n    return fn(...args);\n  }\n\n  if (diff === 1) {\n    return (data: unknown): unknown => fn(data, ...args);\n  }\n\n  throw new Error(\n    `Attempt to call Purried function \"${fn.name}\" failed with wrong number of arguments. Received \"${args.length}\". It can accept either \"${fn.length}\" or \"${fn.length - 1}\" arguments.`,\n  );\n}\n"],"mappings":";;;;;;;;;;;;AAWA,SAAgB,MAAM,IAA+B,MAAmC;CACtF,MAAM,OAAO,GAAG,SAAS,KAAK;CAC9B,IAAI,SAAS,GACX,OAAO,GAAG,GAAG,IAAI;CAGnB,IAAI,SAAS,GACX,QAAQ,SAA2B,GAAG,MAAM,GAAG,IAAI;CAGrD,MAAM,IAAI,MACR,qCAAqC,GAAG,KAAK,qDAAqD,KAAK,OAAO,2BAA2B,GAAG,OAAO,QAAQ,GAAG,SAAS,EAAE,aAC3K;AACF"}

package/dist/set/index.cjs

@@ -1,5 +1,12 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_purry = require("../purry-B2_0DGLV.cjs");
+const require_purry = require("../purry-Dqp_F64t.cjs");
+//#region src/set/_globalAliases.ts
+/**
+* Alias of the built-in set constructor. `new Set() === new Set.Ctor()`
+* @function
+*/
+const Ctor = Set;
+//#endregion
 //#region src/set/add.ts
 function addImplementation(data, value) {
 	return data.add(value);
@@ -9,6 +16,14 @@ function add(...args) {
 }
 //#endregion
 //#region src/set/clear.ts
+/**
+* Removes all values from a set and returns the same set.
+*
+* @example
+* ```ts
+* clear(new Set([1, 2, 3])); // Set(0) {}
+* ```
+*/
 function clear(data) {
 	data.clear();
 	return data;
@@ -23,6 +38,15 @@ function difference(...args) {
 }
 //#endregion
 //#region src/set/entries.ts
+/**
+* Returns an iterator of a set's value-key pairs.
+* For sets, each entry repeats the same value as both key and value.
+*
+* @example
+* ```ts
+* [...entries(new Set([1, 2]))]; // [[1, 1], [2, 2]]
+* ```
+*/
 function entries(data) {
 	return data.entries();
 }
@@ -37,9 +61,25 @@ function forEach(...args) {
 }
 //#endregion
 //#region src/set/from.ts
+/**
+* Creates a set from an iterable of values.
+*
+* @example
+* ```ts
+* from([1, 2, 2, 3]); // Set(3) { 1, 2, 3 }
+* ```
+*/
 function from(iterable) {
 	return new Set(iterable);
 }
+/**
+* Creates an empty set.
+*
+* @example
+* ```ts
+* empty(); // Set(0) {}
+* ```
+*/
 function empty() {
 	return /* @__PURE__ */ new Set();
 }
@@ -77,6 +117,15 @@ function isSubsetOf(...args) {
 }
 //#endregion
 //#region src/set/keys.ts
+/**
+* Returns an iterator of a set's values.
+* For sets, keys and values are the same.
+*
+* @example
+* ```ts
+* [...keys(new Set([1, 2, 3]))]; // [1, 2, 3]
+* ```
+*/
 function keys(data) {
 	return data.keys();
 }
@@ -107,10 +156,19 @@ function union(...args) {
 }
 //#endregion
 //#region src/set/values.ts
+/**
+* Returns an iterator of a set's values.
+*
+* @example
+* ```ts
+* [...values(new Set([1, 2, 3]))]; // [1, 2, 3]
+* ```
+*/
 function values(data) {
 	return data.values();
 }
 //#endregion
+exports.Ctor = Ctor;
 exports.add = add;
 exports.clear = clear;
 exports.difference = difference;

package/dist/set/index.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs","names":["purry","purry","purry","purry","purry","purry","purry","purry","purry","purry"],"sources":["../../src/set/add.ts","../../src/set/clear.ts","../../src/set/difference.ts","../../src/set/entries.ts","../../src/set/forEach.ts","../../src/set/from.ts","../../src/set/has.ts","../../src/set/intersection.ts","../../src/set/isDisjointFrom.ts","../../src/set/isSubsetOf.ts","../../src/set/keys.ts","../../src/set/remove.ts","../../src/set/symmetricDifference.ts","../../src/set/union.ts","../../src/set/values.ts"],"sourcesContent":["import { purry } from '../function/purry';\n\nfunction addImplementation<T>(data: Set<T>, value: T): Set<T> {\n  return data.add(value);\n}\n\nexport function add<T>(value: T): (data: Set<T>) => Set<T>;\nexport function add<T>(data: Set<T>, value: T): Set<T>;\nexport function add(...args: readonly unknown[]): unknown {\n  return purry(addImplementation, args);\n}\n","export function clear<T>(data: Set<T>): Set<T> {\n  data.clear();\n  return data;\n}\n","import { purry } from '../function/purry';\n\nfunction differenceImplementation<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T> {\n  return data.difference(other);\n}\n\nexport function difference<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => Set<T>;\nexport function difference<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T>;\nexport function difference(...args: readonly unknown[]): unknown {\n  return purry(differenceImplementation, args);\n}\n","export function entries<T>(data: Set<T>): SetIterator<[T, T]> {\n  return data.entries();\n}\n","import { purry } from '../function/purry';\n\nfunction forEachImplementation<T>(data: Set<T>, callbackfn: (value: T, key: T, set: Set<T>) => void): Set<T> {\n  data.forEach(callbackfn);\n  return data;\n}\n\nexport function forEach<T>(callbackfn: (value: T, key: T, set: Set<T>) => void): (data: Set<T>) => Set<T>;\nexport function forEach<T>(data: Set<T>, callbackfn: (value: T, key: T, set: Set<T>) => void): Set<T>;\nexport function forEach(...args: readonly unknown[]): unknown {\n  return purry(forEachImplementation, args);\n}\n","export function from<T>(iterable: Iterable<T> | readonly T[]): Set<T> {\n  return new Set(iterable);\n}\n\nexport function empty<T>(): Set<T> {\n  return new Set();\n}\n","import { purry } from '../function/purry';\n\nfunction hasImplementation<T>(data: Set<T>, value: T): boolean {\n  return data.has(value);\n}\n\nexport function has<T>(value: T): (data: Set<T>) => Set<T>;\nexport function has<T>(data: Set<T>, value: T): Set<T>;\nexport function has(...args: readonly unknown[]): unknown {\n  return purry(hasImplementation, args);\n}\n","import { purry } from '../function/purry';\n\nfunction intersectionImplementation<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T & U> {\n  return data.intersection(other);\n}\n\nexport function intersection<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => Set<T & U>;\nexport function intersection<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T & U>;\nexport function intersection(...args: readonly unknown[]): unknown {\n  return purry(intersectionImplementation, args);\n}\n","import { purry } from '../function/purry';\n\nfunction isDisjointFromImplementation<T, U>(data: Set<T>, other: ReadonlySetLike<U>): boolean {\n  return data.isDisjointFrom(other);\n}\n\nexport function isDisjointFrom<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => boolean;\nexport function isDisjointFrom<T, U>(data: Set<T>, other: ReadonlySetLike<U>): boolean;\nexport function isDisjointFrom(...args: readonly unknown[]): unknown {\n  return purry(isDisjointFromImplementation, args);\n}\n","import { purry } from '../function/purry';\n\nfunction isSubsetOfImplementation<T, U>(data: Set<T>, other: ReadonlySetLike<U>): boolean {\n  return data.isSubsetOf(other);\n}\n\nexport function isSubsetOf<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => boolean;\nexport function isSubsetOf<T, U>(data: Set<T>, other: ReadonlySetLike<U>): boolean;\nexport function isSubsetOf(...args: readonly unknown[]): unknown {\n  return purry(isSubsetOfImplementation, args);\n}\n","export function keys<T>(data: Set<T>): SetIterator<T> {\n  return data.keys();\n}\n","import { purry } from '../function/purry';\n\nfunction removeImplementation<T>(data: Set<T>, value: T): Set<T> {\n  data.delete(value);\n  return data;\n}\n\n/**\n * TODO: should this return a tuple?\n */\nexport function remove<T>(value: T): (data: Set<T>) => Set<T>;\nexport function remove<T>(data: Set<T>, value: T): Set<T>;\nexport function remove(...args: readonly unknown[]): unknown {\n  return purry(removeImplementation, args);\n}\n","import { purry } from '../function/purry';\n\nfunction symmetricDifferenceImplementation<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T | U> {\n  return data.symmetricDifference(other);\n}\n\nexport function symmetricDifference<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => Set<T | U>;\nexport function symmetricDifference<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T | U>;\nexport function symmetricDifference(...args: readonly unknown[]): unknown {\n  return purry(symmetricDifferenceImplementation, args);\n}\n","import { purry } from '../function/purry';\n\nfunction unionImplementation<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T | U> {\n  return data.union(other);\n}\n\nexport function union<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => Set<T | U>;\nexport function union<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T | U>;\nexport function union(...args: readonly unknown[]): unknown {\n  return purry(unionImplementation, args);\n}\n","export function values<T>(data: Set<T>): SetIterator<T> {\n  return data.values();\n}\n"],"mappings":";;;AAEA,SAAS,kBAAqB,MAAc,OAAkB;CAC5D,OAAO,KAAK,IAAI,KAAK;AACvB;AAIA,SAAgB,IAAI,GAAG,MAAmC;CACxD,OAAOA,cAAAA,MAAM,mBAAmB,IAAI;AACtC;;;ACVA,SAAgB,MAAS,MAAsB;CAC7C,KAAK,MAAM;CACX,OAAO;AACT;;;ACDA,SAAS,yBAA+B,MAAc,OAAmC;CACvF,OAAO,KAAK,WAAW,KAAK;AAC9B;AAIA,SAAgB,WAAW,GAAG,MAAmC;CAC/D,OAAOC,cAAAA,MAAM,0BAA0B,IAAI;AAC7C;;;ACVA,SAAgB,QAAW,MAAmC;CAC5D,OAAO,KAAK,QAAQ;AACtB;;;ACAA,SAAS,sBAAyB,MAAc,YAA6D;CAC3G,KAAK,QAAQ,UAAU;CACvB,OAAO;AACT;AAIA,SAAgB,QAAQ,GAAG,MAAmC;CAC5D,OAAOC,cAAAA,MAAM,uBAAuB,IAAI;AAC1C;;;ACXA,SAAgB,KAAQ,UAA8C;CACpE,OAAO,IAAI,IAAI,QAAQ;AACzB;AAEA,SAAgB,QAAmB;CACjC,uBAAO,IAAI,IAAI;AACjB;;;ACJA,SAAS,kBAAqB,MAAc,OAAmB;CAC7D,OAAO,KAAK,IAAI,KAAK;AACvB;AAIA,SAAgB,IAAI,GAAG,MAAmC;CACxD,OAAOC,cAAAA,MAAM,mBAAmB,IAAI;AACtC;;;ACRA,SAAS,2BAAiC,MAAc,OAAuC;CAC7F,OAAO,KAAK,aAAa,KAAK;AAChC;AAIA,SAAgB,aAAa,GAAG,MAAmC;CACjE,OAAOC,cAAAA,MAAM,4BAA4B,IAAI;AAC/C;;;ACRA,SAAS,6BAAmC,MAAc,OAAoC;CAC5F,OAAO,KAAK,eAAe,KAAK;AAClC;AAIA,SAAgB,eAAe,GAAG,MAAmC;CACnE,OAAOC,cAAAA,MAAM,8BAA8B,IAAI;AACjD;;;ACRA,SAAS,yBAA+B,MAAc,OAAoC;CACxF,OAAO,KAAK,WAAW,KAAK;AAC9B;AAIA,SAAgB,WAAW,GAAG,MAAmC;CAC/D,OAAOC,cAAAA,MAAM,0BAA0B,IAAI;AAC7C;;;ACVA,SAAgB,KAAQ,MAA8B;CACpD,OAAO,KAAK,KAAK;AACnB;;;ACAA,SAAS,qBAAwB,MAAc,OAAkB;CAC/D,KAAK,OAAO,KAAK;CACjB,OAAO;AACT;AAOA,SAAgB,OAAO,GAAG,MAAmC;CAC3D,OAAOC,cAAAA,MAAM,sBAAsB,IAAI;AACzC;;;ACZA,SAAS,kCAAwC,MAAc,OAAuC;CACpG,OAAO,KAAK,oBAAoB,KAAK;AACvC;AAIA,SAAgB,oBAAoB,GAAG,MAAmC;CACxE,OAAOC,cAAAA,MAAM,mCAAmC,IAAI;AACtD;;;ACRA,SAAS,oBAA0B,MAAc,OAAuC;CACtF,OAAO,KAAK,MAAM,KAAK;AACzB;AAIA,SAAgB,MAAM,GAAG,MAAmC;CAC1D,OAAOC,cAAAA,MAAM,qBAAqB,IAAI;AACxC;;;ACVA,SAAgB,OAAU,MAA8B;CACtD,OAAO,KAAK,OAAO;AACrB"}
+{"version":3,"file":"index.cjs","names":["purry","purry","purry","purry","purry","purry","purry","purry","purry","purry"],"sources":["../../src/set/_globalAliases.ts","../../src/set/add.ts","../../src/set/clear.ts","../../src/set/difference.ts","../../src/set/entries.ts","../../src/set/forEach.ts","../../src/set/from.ts","../../src/set/has.ts","../../src/set/intersection.ts","../../src/set/isDisjointFrom.ts","../../src/set/isSubsetOf.ts","../../src/set/keys.ts","../../src/set/remove.ts","../../src/set/symmetricDifference.ts","../../src/set/union.ts","../../src/set/values.ts"],"sourcesContent":["/**\n * Alias of the built-in set constructor. `new Set() === new Set.Ctor()`\n * @function\n */\nexport const Ctor = Set;\n","import { purry } from '../function/purry';\n\nfunction addImplementation<T>(data: Set<T>, value: T): Set<T> {\n  return data.add(value);\n}\n\n/**\n * Adds a value to a set and returns the same set.\n *\n * @example\n * ```ts\n * add(new Set([1]), 2); // Set(2) { 1, 2 }\n * add(3)(new Set([1, 2])); // Set(3) { 1, 2, 3 }\n * ```\n */\nexport function add<T>(value: T): (data: Set<T>) => Set<T>;\nexport function add<T>(data: Set<T>, value: T): Set<T>;\nexport function add(...args: readonly unknown[]): unknown {\n  return purry(addImplementation, args);\n}\n","/**\n * Removes all values from a set and returns the same set.\n *\n * @example\n * ```ts\n * clear(new Set([1, 2, 3])); // Set(0) {}\n * ```\n */\nexport function clear<T>(data: Set<T>): Set<T> {\n  data.clear();\n  return data;\n}\n","import { purry } from '../function/purry';\n\nfunction differenceImplementation<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T> {\n  return data.difference(other);\n}\n\n/**\n * Returns a new set containing values in the first set but not the second.\n *\n * @example\n * ```ts\n * difference(new Set([1, 2, 3]), new Set([2, 3, 4])); // Set(1) { 1 }\n * difference(new Set([2, 3, 4]))(new Set([1, 2, 3])); // Set(1) { 1 }\n * ```\n */\nexport function difference<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => Set<T>;\nexport function difference<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T>;\nexport function difference(...args: readonly unknown[]): unknown {\n  return purry(differenceImplementation, args);\n}\n","/**\n * Returns an iterator of a set's value-key pairs.\n * For sets, each entry repeats the same value as both key and value.\n *\n * @example\n * ```ts\n * [...entries(new Set([1, 2]))]; // [[1, 1], [2, 2]]\n * ```\n */\nexport function entries<T>(data: Set<T>): SetIterator<[T, T]> {\n  return data.entries();\n}\n","import { purry } from '../function/purry';\n\nfunction forEachImplementation<T>(data: Set<T>, callbackfn: (value: T, key: T, set: Set<T>) => void): Set<T> {\n  data.forEach(callbackfn);\n  return data;\n}\n\n/**\n * Runs a callback for each set value and returns the same set.\n *\n * @example\n * ```ts\n * const set = new Set([1, 2, 3]);\n * forEach(set, value => console.log(value)); // set\n * forEach(value => console.log(value))(set); // set\n * ```\n */\nexport function forEach<T>(callbackfn: (value: T, key: T, set: Set<T>) => void): (data: Set<T>) => Set<T>;\nexport function forEach<T>(data: Set<T>, callbackfn: (value: T, key: T, set: Set<T>) => void): Set<T>;\nexport function forEach(...args: readonly unknown[]): unknown {\n  return purry(forEachImplementation, args);\n}\n","/**\n * Creates a set from an iterable of values.\n *\n * @example\n * ```ts\n * from([1, 2, 2, 3]); // Set(3) { 1, 2, 3 }\n * ```\n */\nexport function from<T>(iterable: Iterable<T> | readonly T[]): Set<T> {\n  return new Set(iterable);\n}\n\n/**\n * Creates an empty set.\n *\n * @example\n * ```ts\n * empty(); // Set(0) {}\n * ```\n */\nexport function empty<T>(): Set<T> {\n  return new Set();\n}\n","import { purry } from '../function/purry';\n\nfunction hasImplementation<T>(data: Set<T>, value: T): boolean {\n  return data.has(value);\n}\n\n/**\n * Returns whether a set contains a value.\n *\n * @example\n * ```ts\n * has(new Set([1, 2]), 1); // true\n * has(new Set([1, 2]), 3); // false\n * has(2)(new Set([1, 2])); // true\n * ```\n */\nexport function has<T>(value: T): (data: Set<T>) => Set<T>;\nexport function has<T>(data: Set<T>, value: T): Set<T>;\nexport function has(...args: readonly unknown[]): unknown {\n  return purry(hasImplementation, args);\n}\n","import { purry } from '../function/purry';\n\nfunction intersectionImplementation<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T & U> {\n  return data.intersection(other);\n}\n\n/**\n * Returns a new set containing values present in both sets.\n *\n * @example\n * ```ts\n * intersection(new Set([1, 2, 3]), new Set([2, 3, 4])); // Set(2) { 2, 3 }\n * intersection(new Set([2, 3, 4]))(new Set([1, 2, 3])); // Set(2) { 2, 3 }\n * ```\n */\nexport function intersection<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => Set<T & U>;\nexport function intersection<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T & U>;\nexport function intersection(...args: readonly unknown[]): unknown {\n  return purry(intersectionImplementation, args);\n}\n","import { purry } from '../function/purry';\n\nfunction isDisjointFromImplementation<T, U>(data: Set<T>, other: ReadonlySetLike<U>): boolean {\n  return data.isDisjointFrom(other);\n}\n\n/**\n * Returns whether two sets share no values.\n *\n * @example\n * ```ts\n * isDisjointFrom(new Set([1, 2]), new Set([3, 4])); // true\n * isDisjointFrom(new Set([1, 2]), new Set([2, 3])); // false\n * isDisjointFrom(new Set([2, 3]))(new Set([1, 2])); // false\n * ```\n */\nexport function isDisjointFrom<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => boolean;\nexport function isDisjointFrom<T, U>(data: Set<T>, other: ReadonlySetLike<U>): boolean;\nexport function isDisjointFrom(...args: readonly unknown[]): unknown {\n  return purry(isDisjointFromImplementation, args);\n}\n","import { purry } from '../function/purry';\n\nfunction isSubsetOfImplementation<T, U>(data: Set<T>, other: ReadonlySetLike<U>): boolean {\n  return data.isSubsetOf(other);\n}\n\n/**\n * Returns whether every value in the first set is contained in the second.\n *\n * @example\n * ```ts\n * isSubsetOf(new Set([1, 2]), new Set([1, 2, 3])); // true\n * isSubsetOf(new Set([1, 4]), new Set([1, 2, 3])); // false\n * isSubsetOf(new Set([1, 2, 3]))(new Set([1, 2])); // true\n * ```\n */\nexport function isSubsetOf<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => boolean;\nexport function isSubsetOf<T, U>(data: Set<T>, other: ReadonlySetLike<U>): boolean;\nexport function isSubsetOf(...args: readonly unknown[]): unknown {\n  return purry(isSubsetOfImplementation, args);\n}\n","/**\n * Returns an iterator of a set's values.\n * For sets, keys and values are the same.\n *\n * @example\n * ```ts\n * [...keys(new Set([1, 2, 3]))]; // [1, 2, 3]\n * ```\n */\nexport function keys<T>(data: Set<T>): SetIterator<T> {\n  return data.keys();\n}\n","import { purry } from '../function/purry';\n\nfunction removeImplementation<T>(data: Set<T>, value: T): Set<T> {\n  data.delete(value);\n  return data;\n}\n\n/**\n * Removes a value from a set and returns the same set.\n *\n * @example\n * ```ts\n * const set = new Set([1, 2, 3]);\n * remove(set, 2); // Set(2) { 1, 3 }\n * remove(3)(set); // Set(1) { 1 }\n * ```\n */\nexport function remove<T>(value: T): (data: Set<T>) => Set<T>;\nexport function remove<T>(data: Set<T>, value: T): Set<T>;\nexport function remove(...args: readonly unknown[]): unknown {\n  return purry(removeImplementation, args);\n}\n","import { purry } from '../function/purry';\n\nfunction symmetricDifferenceImplementation<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T | U> {\n  return data.symmetricDifference(other);\n}\n\n/**\n * Returns a new set containing values in either set but not both.\n *\n * @example\n * ```ts\n * symmetricDifference(new Set([1, 2, 3]), new Set([2, 3, 4])); // Set(2) { 1, 4 }\n * symmetricDifference(new Set([2, 3, 4]))(new Set([1, 2, 3])); // Set(2) { 1, 4 }\n * ```\n */\nexport function symmetricDifference<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => Set<T | U>;\nexport function symmetricDifference<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T | U>;\nexport function symmetricDifference(...args: readonly unknown[]): unknown {\n  return purry(symmetricDifferenceImplementation, args);\n}\n","import { purry } from '../function/purry';\n\nfunction unionImplementation<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T | U> {\n  return data.union(other);\n}\n\n/**\n * Returns a new set containing all values from both sets.\n *\n * @example\n * ```ts\n * union(new Set([1, 2]), new Set([2, 3])); // Set(3) { 1, 2, 3 }\n * union(new Set([2, 3]))(new Set([1, 2])); // Set(3) { 1, 2, 3 }\n * ```\n */\nexport function union<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => Set<T | U>;\nexport function union<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T | U>;\nexport function union(...args: readonly unknown[]): unknown {\n  return purry(unionImplementation, args);\n}\n","/**\n * Returns an iterator of a set's values.\n *\n * @example\n * ```ts\n * [...values(new Set([1, 2, 3]))]; // [1, 2, 3]\n * ```\n */\nexport function values<T>(data: Set<T>): SetIterator<T> {\n  return data.values();\n}\n"],"mappings":";;;;;;;AAIA,MAAa,OAAO;;;ACFpB,SAAS,kBAAqB,MAAc,OAAkB;CAC5D,OAAO,KAAK,IAAI,KAAK;AACvB;AAaA,SAAgB,IAAI,GAAG,MAAmC;CACxD,OAAOA,cAAAA,MAAM,mBAAmB,IAAI;AACtC;;;;;;;;;;;ACXA,SAAgB,MAAS,MAAsB;CAC7C,KAAK,MAAM;CACX,OAAO;AACT;;;ACTA,SAAS,yBAA+B,MAAc,OAAmC;CACvF,OAAO,KAAK,WAAW,KAAK;AAC9B;AAaA,SAAgB,WAAW,GAAG,MAAmC;CAC/D,OAAOC,cAAAA,MAAM,0BAA0B,IAAI;AAC7C;;;;;;;;;;;;ACVA,SAAgB,QAAW,MAAmC;CAC5D,OAAO,KAAK,QAAQ;AACtB;;;ACTA,SAAS,sBAAyB,MAAc,YAA6D;CAC3G,KAAK,QAAQ,UAAU;CACvB,OAAO;AACT;AAcA,SAAgB,QAAQ,GAAG,MAAmC;CAC5D,OAAOC,cAAAA,MAAM,uBAAuB,IAAI;AAC1C;;;;;;;;;;;ACbA,SAAgB,KAAQ,UAA8C;CACpE,OAAO,IAAI,IAAI,QAAQ;AACzB;;;;;;;;;AAUA,SAAgB,QAAmB;CACjC,uBAAO,IAAI,IAAI;AACjB;;;ACpBA,SAAS,kBAAqB,MAAc,OAAmB;CAC7D,OAAO,KAAK,IAAI,KAAK;AACvB;AAcA,SAAgB,IAAI,GAAG,MAAmC;CACxD,OAAOC,cAAAA,MAAM,mBAAmB,IAAI;AACtC;;;AClBA,SAAS,2BAAiC,MAAc,OAAuC;CAC7F,OAAO,KAAK,aAAa,KAAK;AAChC;AAaA,SAAgB,aAAa,GAAG,MAAmC;CACjE,OAAOC,cAAAA,MAAM,4BAA4B,IAAI;AAC/C;;;ACjBA,SAAS,6BAAmC,MAAc,OAAoC;CAC5F,OAAO,KAAK,eAAe,KAAK;AAClC;AAcA,SAAgB,eAAe,GAAG,MAAmC;CACnE,OAAOC,cAAAA,MAAM,8BAA8B,IAAI;AACjD;;;AClBA,SAAS,yBAA+B,MAAc,OAAoC;CACxF,OAAO,KAAK,WAAW,KAAK;AAC9B;AAcA,SAAgB,WAAW,GAAG,MAAmC;CAC/D,OAAOC,cAAAA,MAAM,0BAA0B,IAAI;AAC7C;;;;;;;;;;;;ACXA,SAAgB,KAAQ,MAA8B;CACpD,OAAO,KAAK,KAAK;AACnB;;;ACTA,SAAS,qBAAwB,MAAc,OAAkB;CAC/D,KAAK,OAAO,KAAK;CACjB,OAAO;AACT;AAcA,SAAgB,OAAO,GAAG,MAAmC;CAC3D,OAAOC,cAAAA,MAAM,sBAAsB,IAAI;AACzC;;;ACnBA,SAAS,kCAAwC,MAAc,OAAuC;CACpG,OAAO,KAAK,oBAAoB,KAAK;AACvC;AAaA,SAAgB,oBAAoB,GAAG,MAAmC;CACxE,OAAOC,cAAAA,MAAM,mCAAmC,IAAI;AACtD;;;ACjBA,SAAS,oBAA0B,MAAc,OAAuC;CACtF,OAAO,KAAK,MAAM,KAAK;AACzB;AAaA,SAAgB,MAAM,GAAG,MAAmC;CAC1D,OAAOC,cAAAA,MAAM,qBAAqB,IAAI;AACxC;;;;;;;;;;;ACXA,SAAgB,OAAU,MAA8B;CACtD,OAAO,KAAK,OAAO;AACrB"}

package/dist/set/index.d.cts

@@ -1,61 +1,210 @@
+//#region src/set/_globalAliases.d.ts
+/**
+ * Alias of the built-in set constructor. `new Set() === new Set.Ctor()`
+ * @function
+ */
+declare const Ctor: SetConstructor;
+//#endregion
 //#region src/set/add.d.ts
+/**
+ * Adds a value to a set and returns the same set.
+ *
+ * @example
+ * ```ts
+ * add(new Set([1]), 2); // Set(2) { 1, 2 }
+ * add(3)(new Set([1, 2])); // Set(3) { 1, 2, 3 }
+ * ```
+ */
 declare function add<T>(value: T): (data: Set<T>) => Set<T>;
 declare function add<T>(data: Set<T>, value: T): Set<T>;
 //#endregion
 //#region src/set/clear.d.ts
+/**
+ * Removes all values from a set and returns the same set.
+ *
+ * @example
+ * ```ts
+ * clear(new Set([1, 2, 3])); // Set(0) {}
+ * ```
+ */
 declare function clear<T>(data: Set<T>): Set<T>;
 //#endregion
 //#region src/set/difference.d.ts
+/**
+ * Returns a new set containing values in the first set but not the second.
+ *
+ * @example
+ * ```ts
+ * difference(new Set([1, 2, 3]), new Set([2, 3, 4])); // Set(1) { 1 }
+ * difference(new Set([2, 3, 4]))(new Set([1, 2, 3])); // Set(1) { 1 }
+ * ```
+ */
 declare function difference<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => Set<T>;
 declare function difference<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T>;
 //#endregion
 //#region src/set/entries.d.ts
+/**
+ * Returns an iterator of a set's value-key pairs.
+ * For sets, each entry repeats the same value as both key and value.
+ *
+ * @example
+ * ```ts
+ * [...entries(new Set([1, 2]))]; // [[1, 1], [2, 2]]
+ * ```
+ */
 declare function entries<T>(data: Set<T>): SetIterator<[T, T]>;
 //#endregion
 //#region src/set/forEach.d.ts
+/**
+ * Runs a callback for each set value and returns the same set.
+ *
+ * @example
+ * ```ts
+ * const set = new Set([1, 2, 3]);
+ * forEach(set, value => console.log(value)); // set
+ * forEach(value => console.log(value))(set); // set
+ * ```
+ */
 declare function forEach<T>(callbackfn: (value: T, key: T, set: Set<T>) => void): (data: Set<T>) => Set<T>;
 declare function forEach<T>(data: Set<T>, callbackfn: (value: T, key: T, set: Set<T>) => void): Set<T>;
 //#endregion
 //#region src/set/from.d.ts
+/**
+ * Creates a set from an iterable of values.
+ *
+ * @example
+ * ```ts
+ * from([1, 2, 2, 3]); // Set(3) { 1, 2, 3 }
+ * ```
+ */
 declare function from<T>(iterable: Iterable<T> | readonly T[]): Set<T>;
+/**
+ * Creates an empty set.
+ *
+ * @example
+ * ```ts
+ * empty(); // Set(0) {}
+ * ```
+ */
 declare function empty<T>(): Set<T>;
 //#endregion
 //#region src/set/has.d.ts
+/**
+ * Returns whether a set contains a value.
+ *
+ * @example
+ * ```ts
+ * has(new Set([1, 2]), 1); // true
+ * has(new Set([1, 2]), 3); // false
+ * has(2)(new Set([1, 2])); // true
+ * ```
+ */
 declare function has<T>(value: T): (data: Set<T>) => Set<T>;
 declare function has<T>(data: Set<T>, value: T): Set<T>;
 //#endregion
 //#region src/set/intersection.d.ts
+/**
+ * Returns a new set containing values present in both sets.
+ *
+ * @example
+ * ```ts
+ * intersection(new Set([1, 2, 3]), new Set([2, 3, 4])); // Set(2) { 2, 3 }
+ * intersection(new Set([2, 3, 4]))(new Set([1, 2, 3])); // Set(2) { 2, 3 }
+ * ```
+ */
 declare function intersection<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => Set<T & U>;
 declare function intersection<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T & U>;
 //#endregion
 //#region src/set/isDisjointFrom.d.ts
+/**
+ * Returns whether two sets share no values.
+ *
+ * @example
+ * ```ts
+ * isDisjointFrom(new Set([1, 2]), new Set([3, 4])); // true
+ * isDisjointFrom(new Set([1, 2]), new Set([2, 3])); // false
+ * isDisjointFrom(new Set([2, 3]))(new Set([1, 2])); // false
+ * ```
+ */
 declare function isDisjointFrom<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => boolean;
 declare function isDisjointFrom<T, U>(data: Set<T>, other: ReadonlySetLike<U>): boolean;
 //#endregion
 //#region src/set/isSubsetOf.d.ts
+/**
+ * Returns whether every value in the first set is contained in the second.
+ *
+ * @example
+ * ```ts
+ * isSubsetOf(new Set([1, 2]), new Set([1, 2, 3])); // true
+ * isSubsetOf(new Set([1, 4]), new Set([1, 2, 3])); // false
+ * isSubsetOf(new Set([1, 2, 3]))(new Set([1, 2])); // true
+ * ```
+ */
 declare function isSubsetOf<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => boolean;
 declare function isSubsetOf<T, U>(data: Set<T>, other: ReadonlySetLike<U>): boolean;
 //#endregion
 //#region src/set/keys.d.ts
+/**
+ * Returns an iterator of a set's values.
+ * For sets, keys and values are the same.
+ *
+ * @example
+ * ```ts
+ * [...keys(new Set([1, 2, 3]))]; // [1, 2, 3]
+ * ```
+ */
 declare function keys<T>(data: Set<T>): SetIterator<T>;
 //#endregion
 //#region src/set/remove.d.ts
 /**
- * TODO: should this return a tuple?
+ * Removes a value from a set and returns the same set.
+ *
+ * @example
+ * ```ts
+ * const set = new Set([1, 2, 3]);
+ * remove(set, 2); // Set(2) { 1, 3 }
+ * remove(3)(set); // Set(1) { 1 }
+ * ```
  */
 declare function remove<T>(value: T): (data: Set<T>) => Set<T>;
 declare function remove<T>(data: Set<T>, value: T): Set<T>;
 //#endregion
 //#region src/set/symmetricDifference.d.ts
+/**
+ * Returns a new set containing values in either set but not both.
+ *
+ * @example
+ * ```ts
+ * symmetricDifference(new Set([1, 2, 3]), new Set([2, 3, 4])); // Set(2) { 1, 4 }
+ * symmetricDifference(new Set([2, 3, 4]))(new Set([1, 2, 3])); // Set(2) { 1, 4 }
+ * ```
+ */
 declare function symmetricDifference<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => Set<T | U>;
 declare function symmetricDifference<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T | U>;
 //#endregion
 //#region src/set/union.d.ts
+/**
+ * Returns a new set containing all values from both sets.
+ *
+ * @example
+ * ```ts
+ * union(new Set([1, 2]), new Set([2, 3])); // Set(3) { 1, 2, 3 }
+ * union(new Set([2, 3]))(new Set([1, 2])); // Set(3) { 1, 2, 3 }
+ * ```
+ */
 declare function union<U>(other: ReadonlySetLike<U>): <T>(data: Set<T>) => Set<T | U>;
 declare function union<T, U>(data: Set<T>, other: ReadonlySetLike<U>): Set<T | U>;
 //#endregion
 //#region src/set/values.d.ts
+/**
+ * Returns an iterator of a set's values.
+ *
+ * @example
+ * ```ts
+ * [...values(new Set([1, 2, 3]))]; // [1, 2, 3]
+ * ```
+ */
 declare function values<T>(data: Set<T>): SetIterator<T>;
 //#endregion
-export { add, clear, difference, empty, entries, forEach, from, has, intersection, isDisjointFrom, isSubsetOf, keys, remove, symmetricDifference, union, values };
+export { Ctor, add, clear, difference, empty, entries, forEach, from, has, intersection, isDisjointFrom, isSubsetOf, keys, remove, symmetricDifference, union, values };
 //# sourceMappingURL=index.d.cts.map

package/dist/set/index.d.cts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.cts","names":[],"sources":["../../src/set/add.ts","../../src/set/clear.ts","../../src/set/difference.ts","../../src/set/entries.ts","../../src/set/forEach.ts","../../src/set/from.ts","../../src/set/has.ts","../../src/set/intersection.ts","../../src/set/isDisjointFrom.ts","../../src/set/isSubsetOf.ts","../../src/set/keys.ts","../../src/set/remove.ts","../../src/set/symmetricDifference.ts","../../src/set/union.ts","../../src/set/values.ts"],"mappings":";iBAMgB,GAAA,IAAO,KAAA,EAAO,CAAA,IAAK,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA;AAAA,iBACxC,GAAA,IAAO,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,CAAA,GAAI,GAAA,CAAI,CAAA;;;iBCPpC,KAAA,IAAS,IAAA,EAAM,GAAA,CAAI,CAAA,IAAK,GAAA,CAAI,CAAA;;;iBCM5B,UAAA,IAAc,KAAA,EAAO,eAAA,CAAgB,CAAA,QAAS,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA;AAAA,iBACnE,UAAA,OAAiB,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,eAAA,CAAgB,CAAA,IAAK,GAAA,CAAI,CAAA;;;iBCP/D,OAAA,IAAW,IAAA,EAAM,GAAA,CAAI,CAAA,IAAK,WAAA,EAAa,CAAA,EAAG,CAAA;;;iBCO1C,OAAA,IAAW,UAAA,GAAa,KAAA,EAAO,CAAA,EAAG,GAAA,EAAK,CAAA,EAAG,GAAA,EAAK,GAAA,CAAI,CAAA,cAAe,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA;AAAA,iBACvF,OAAA,IAAW,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,UAAA,GAAa,KAAA,EAAO,CAAA,EAAG,GAAA,EAAK,CAAA,EAAG,GAAA,EAAK,GAAA,CAAI,CAAA,aAAc,GAAA,CAAI,CAAA;;;iBCRnF,IAAA,IAAQ,QAAA,EAAU,QAAA,CAAS,CAAA,aAAc,CAAA,KAAM,GAAA,CAAI,CAAA;AAAA,iBAInD,KAAA,OAAY,GAAG,CAAC,CAAA;;;iBCEhB,GAAA,IAAO,KAAA,EAAO,CAAA,IAAK,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA;AAAA,iBACxC,GAAA,IAAO,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,CAAA,GAAI,GAAA,CAAI,CAAA;;;iBCDpC,YAAA,IAAgB,KAAA,EAAO,eAAA,CAAgB,CAAA,QAAS,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA,GAAI,CAAA;AAAA,iBACzE,YAAA,OAAmB,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,eAAA,CAAgB,CAAA,IAAK,GAAA,CAAI,CAAA,GAAI,CAAA;;;iBCDrE,cAAA,IAAkB,KAAA,EAAO,eAAA,CAAgB,CAAA,QAAS,IAAA,EAAM,GAAA,CAAI,CAAA;AAAA,iBAC5D,cAAA,OAAqB,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,eAAA,CAAgB,CAAA;;;iBCD1D,UAAA,IAAc,KAAA,EAAO,eAAA,CAAgB,CAAA,QAAS,IAAA,EAAM,GAAA,CAAI,CAAA;AAAA,iBACxD,UAAA,OAAiB,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,eAAA,CAAgB,CAAA;;;iBCPtD,IAAA,IAAQ,IAAA,EAAM,GAAA,CAAI,CAAA,IAAK,WAAA,CAAY,CAAA;;;;AVMnD;;iBWIgB,MAAA,IAAU,KAAA,EAAO,CAAA,IAAK,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA;AAAA,iBAC3C,MAAA,IAAU,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,CAAA,GAAI,GAAA,CAAI,CAAA;;;iBCLvC,mBAAA,IAAuB,KAAA,EAAO,eAAA,CAAgB,CAAA,QAAS,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA,GAAI,CAAA;AAAA,iBAChF,mBAAA,OAA0B,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,eAAA,CAAgB,CAAA,IAAK,GAAA,CAAI,CAAA,GAAI,CAAA;;;iBCD5E,KAAA,IAAS,KAAA,EAAO,eAAA,CAAgB,CAAA,QAAS,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA,GAAI,CAAA;AAAA,iBAClE,KAAA,OAAY,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,eAAA,CAAgB,CAAA,IAAK,GAAA,CAAI,CAAA,GAAI,CAAA;;;iBCP9D,MAAA,IAAU,IAAA,EAAM,GAAA,CAAI,CAAA,IAAK,WAAA,CAAY,CAAA"}
+{"version":3,"file":"index.d.cts","names":[],"sources":["../../src/set/_globalAliases.ts","../../src/set/add.ts","../../src/set/clear.ts","../../src/set/difference.ts","../../src/set/entries.ts","../../src/set/forEach.ts","../../src/set/from.ts","../../src/set/has.ts","../../src/set/intersection.ts","../../src/set/isDisjointFrom.ts","../../src/set/isSubsetOf.ts","../../src/set/keys.ts","../../src/set/remove.ts","../../src/set/symmetricDifference.ts","../../src/set/union.ts","../../src/set/values.ts"],"mappings":";;AAIA;;;cAAa,IAAA,EAAI,cAAM;;;;AAAvB;;;;AAAuB;;;;iBCWP,GAAA,IAAO,KAAA,EAAO,CAAA,IAAK,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA;AAAA,iBACxC,GAAA,IAAO,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,CAAA,GAAI,GAAA,CAAI,CAAA;;;;ADZpD;;;;AAAuB;;;iBEIP,KAAA,IAAS,IAAA,EAAM,GAAA,CAAI,CAAA,IAAK,GAAA,CAAI,CAAA;;;;AFJ5C;;;;AAAuB;;;;iBGWP,UAAA,IAAc,KAAA,EAAO,eAAA,CAAgB,CAAA,QAAS,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA;AAAA,iBACnE,UAAA,OAAiB,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,eAAA,CAAgB,CAAA,IAAK,GAAA,CAAI,CAAA;;;;AHZ/E;;;;AAAuB;;;;iBIKP,OAAA,IAAW,IAAA,EAAM,GAAA,CAAI,CAAA,IAAK,WAAA,EAAa,CAAA,EAAG,CAAA;;;;AJL1D;;;;AAAuB;;;;ACWvB;iBIEgB,OAAA,IAAW,UAAA,GAAa,KAAA,EAAO,CAAA,EAAG,GAAA,EAAK,CAAA,EAAG,GAAA,EAAK,GAAA,CAAI,CAAA,cAAe,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA;AAAA,iBACvF,OAAA,IAAW,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,UAAA,GAAa,KAAA,EAAO,CAAA,EAAG,GAAA,EAAK,CAAA,EAAG,GAAA,EAAK,GAAA,CAAI,CAAA,aAAc,GAAA,CAAI,CAAA;;;;ALdnG;;;;AAAuB;;;iBMIP,IAAA,IAAQ,QAAA,EAAU,QAAA,CAAS,CAAA,aAAc,CAAA,KAAM,GAAA,CAAI,CAAA;ALOnE;;;;;;;;AAAA,iBKKgB,KAAA,OAAY,GAAG,CAAC,CAAA;;;;ANhBhC;;;;AAAuB;;;;ACWvB;iBMCgB,GAAA,IAAO,KAAA,EAAO,CAAA,IAAK,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA;AAAA,iBACxC,GAAA,IAAO,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,CAAA,GAAI,GAAA,CAAI,CAAA;;;;APbpD;;;;AAAuB;;;;iBQWP,YAAA,IAAgB,KAAA,EAAO,eAAA,CAAgB,CAAA,QAAS,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA,GAAI,CAAA;AAAA,iBACzE,YAAA,OAAmB,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,eAAA,CAAgB,CAAA,IAAK,GAAA,CAAI,CAAA,GAAI,CAAA;;;;ARZrF;;;;AAAuB;;;;ACWvB;iBQCgB,cAAA,IAAkB,KAAA,EAAO,eAAA,CAAgB,CAAA,QAAS,IAAA,EAAM,GAAA,CAAI,CAAA;AAAA,iBAC5D,cAAA,OAAqB,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,eAAA,CAAgB,CAAA;;;;ATb1E;;;;AAAuB;;;;ACWvB;iBSCgB,UAAA,IAAc,KAAA,EAAO,eAAA,CAAgB,CAAA,QAAS,IAAA,EAAM,GAAA,CAAI,CAAA;AAAA,iBACxD,UAAA,OAAiB,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,eAAA,CAAgB,CAAA;;;;AVbtE;;;;AAAuB;;;;iBWKP,IAAA,IAAQ,IAAA,EAAM,GAAA,CAAI,CAAA,IAAK,WAAA,CAAY,CAAA;;;;AXLnD;;;;AAAuB;;;;ACWvB;iBWEgB,MAAA,IAAU,KAAA,EAAO,CAAA,IAAK,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA;AAAA,iBAC3C,MAAA,IAAU,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,CAAA,GAAI,GAAA,CAAI,CAAA;;;;AZdvD;;;;AAAuB;;;;iBaWP,mBAAA,IAAuB,KAAA,EAAO,eAAA,CAAgB,CAAA,QAAS,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA,GAAI,CAAA;AAAA,iBAChF,mBAAA,OAA0B,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,eAAA,CAAgB,CAAA,IAAK,GAAA,CAAI,CAAA,GAAI,CAAA;;;;AbZ5F;;;;AAAuB;;;;iBcWP,KAAA,IAAS,KAAA,EAAO,eAAA,CAAgB,CAAA,QAAS,IAAA,EAAM,GAAA,CAAI,CAAA,MAAO,GAAA,CAAI,CAAA,GAAI,CAAA;AAAA,iBAClE,KAAA,OAAY,IAAA,EAAM,GAAA,CAAI,CAAA,GAAI,KAAA,EAAO,eAAA,CAAgB,CAAA,IAAK,GAAA,CAAI,CAAA,GAAI,CAAA;;;;AdZ9E;;;;AAAuB;;;iBeIP,MAAA,IAAU,IAAA,EAAM,GAAA,CAAI,CAAA,IAAK,WAAA,CAAY,CAAA"}