effect 2.0.0-next.42 → 2.0.0-next.44

package/SortedSet/dist/effect-SortedSet.cjs.dev.js

@@ -2,50 +2,301 @@
 
 Object.defineProperty(exports, '__esModule', { value: true });
 
-require('../../dist/Equal-281b6ca8.cjs.dev.js');
-require('../../dist/Function-41ce433d.cjs.dev.js');
-require('../../dist/Hash-bd154268.cjs.dev.js');
-require('../../dist/Inspectable-ac929af4.cjs.dev.js');
-require('../../dist/Pipeable-4698db72.cjs.dev.js');
-require('../../dist/Predicate-9e859c9c.cjs.dev.js');
-require('../../dist/RedBlackTree-e6bd147c.cjs.dev.js');
-var SortedSet_dist_effectSortedSet = require('../../dist/SortedSet-f90b14a2.cjs.dev.js');
-require('../../dist/GlobalValue-81ab6908.cjs.dev.js');
-require('../../dist/Utils-b0c14d1b.cjs.dev.js');
-require('../../dist/Chunk-bd290b8e.cjs.dev.js');
-require('../../dist/Equivalence-de7a0d51.cjs.dev.js');
-require('../../dist/Option-03997d77.cjs.dev.js');
-require('../../dist/Either-9c349424.cjs.dev.js');
-require('../../dist/Effectable-a6403e5f.cjs.dev.js');
-require('../../dist/Data-85559fb3.cjs.dev.js');
-require('../../dist/Number-588f6483.cjs.dev.js');
-require('../../dist/Order-28bdebd2.cjs.dev.js');
-require('../../dist/ReadonlyArray-48949ee7.cjs.dev.js');
-require('../../dist/Either-a806809d.cjs.dev.js');
+var Equal_dist_effectEqual = require('../../Equal/dist/effect-Equal.cjs.dev.js');
+var Function_dist_effectFunction = require('../../Function/dist/effect-Function.cjs.dev.js');
+var Hash_dist_effectHash = require('../../Hash/dist/effect-Hash.cjs.dev.js');
+var Inspectable_dist_effectInspectable = require('../../Inspectable/dist/effect-Inspectable.cjs.dev.js');
+var Pipeable_dist_effectPipeable = require('../../Pipeable/dist/effect-Pipeable.cjs.dev.js');
+var Predicate_dist_effectPredicate = require('../../Predicate/dist/effect-Predicate.cjs.dev.js');
+var RedBlackTree_dist_effectRedBlackTree = require('../../RedBlackTree/dist/effect-RedBlackTree.cjs.dev.js');
+require('../../GlobalValue/dist/effect-GlobalValue.cjs.dev.js');
+require('../../Utils/dist/effect-Utils.cjs.dev.js');
+require('../../Chunk/dist/effect-Chunk.cjs.dev.js');
+require('../../Equivalence/dist/effect-Equivalence.cjs.dev.js');
+require('../../Option/dist/effect-Option.cjs.dev.js');
+require('../../dist/Either-12bbe00c.cjs.dev.js');
+require('../../dist/Effectable-2f022879.cjs.dev.js');
+require('../../Data/dist/effect-Data.cjs.dev.js');
+require('../../Number/dist/effect-Number.cjs.dev.js');
+require('../../Order/dist/effect-Order.cjs.dev.js');
+require('../../ReadonlyArray/dist/effect-ReadonlyArray.cjs.dev.js');
+require('../../Either/dist/effect-Either.cjs.dev.js');
 require('../../dist/ReadonlyArray-9a1474f6.cjs.dev.js');
-require('../../dist/ReadonlyRecord-605a625b.cjs.dev.js');
+require('../../ReadonlyRecord/dist/effect-ReadonlyRecord.cjs.dev.js');
 require('../../dist/Stack-ada2d201.cjs.dev.js');
 
+/**
+ * @since 2.0.0
+ */
+const TypeId = /*#__PURE__*/Symbol.for("effect/SortedSet");
 
+/**
+ * @since 2.0.0
+ * @category symbol
+ */
 
-exports.add = SortedSet_dist_effectSortedSet.add;
-exports.difference = SortedSet_dist_effectSortedSet.difference;
-exports.empty = SortedSet_dist_effectSortedSet.empty;
-exports.every = SortedSet_dist_effectSortedSet.every;
-exports.filter = SortedSet_dist_effectSortedSet.filter;
-exports.flatMap = SortedSet_dist_effectSortedSet.flatMap;
-exports.forEach = SortedSet_dist_effectSortedSet.forEach;
-exports.fromIterable = SortedSet_dist_effectSortedSet.fromIterable;
-exports.has = SortedSet_dist_effectSortedSet.has;
-exports.intersection = SortedSet_dist_effectSortedSet.intersection;
-exports.isSortedSet = SortedSet_dist_effectSortedSet.isSortedSet;
-exports.isSubset = SortedSet_dist_effectSortedSet.isSubset;
-exports.make = SortedSet_dist_effectSortedSet.make;
-exports.map = SortedSet_dist_effectSortedSet.map;
-exports.partition = SortedSet_dist_effectSortedSet.partition;
-exports.remove = SortedSet_dist_effectSortedSet.remove;
-exports.size = SortedSet_dist_effectSortedSet.size;
-exports.some = SortedSet_dist_effectSortedSet.some;
-exports.toggle = SortedSet_dist_effectSortedSet.toggle;
-exports.union = SortedSet_dist_effectSortedSet.union;
-exports.values = SortedSet_dist_effectSortedSet.values;
+/**
+ * @since 2.0.0
+ * @category models
+ */
+
+const SortedSetProto = {
+  [TypeId]: {
+    _A: _ => _
+  },
+  [Hash_dist_effectHash.symbol]() {
+    return Function_dist_effectFunction.pipe(Hash_dist_effectHash.hash(this.keyTree), Hash_dist_effectHash.combine(Hash_dist_effectHash.hash(TypeId)));
+  },
+  [Equal_dist_effectEqual.symbol](that) {
+    return isSortedSet(that) && Equal_dist_effectEqual.equals(this.keyTree, that.keyTree);
+  },
+  [Symbol.iterator]() {
+    return RedBlackTree_dist_effectRedBlackTree.keys(this.keyTree);
+  },
+  toString() {
+    return Inspectable_dist_effectInspectable.toString(this.toJSON());
+  },
+  toJSON() {
+    return {
+      _id: "SortedSet",
+      values: Array.from(this).map(Inspectable_dist_effectInspectable.toJSON)
+    };
+  },
+  [Inspectable_dist_effectInspectable.NodeInspectSymbol]() {
+    return this.toJSON();
+  },
+  pipe() {
+    return Pipeable_dist_effectPipeable.pipeArguments(this, arguments);
+  }
+};
+const fromTree = keyTree => {
+  const a = Object.create(SortedSetProto);
+  a.keyTree = keyTree;
+  return a;
+};
+
+/**
+ * @since 2.0.0
+ * @category refinements
+ */
+const isSortedSet = u => Predicate_dist_effectPredicate.isObject(u) && TypeId in u;
+
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const empty = O => fromTree(RedBlackTree_dist_effectRedBlackTree.empty(O));
+
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromIterable = ord => iterable => fromTree(RedBlackTree_dist_effectRedBlackTree.fromIterable(ord)(Array.from(iterable).map(k => [k, true])));
+
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const make = ord => (...entries) => fromIterable(ord)(entries);
+
+/**
+ * @since 2.0.0
+ * @category elements
+ */
+const add = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, value) => RedBlackTree_dist_effectRedBlackTree.has(self.keyTree, value) ? self : fromTree(RedBlackTree_dist_effectRedBlackTree.insert(self.keyTree, value, true)));
+
+/**
+ * @since 2.0.0
+ */
+const difference = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, that) => {
+  let out = self;
+  for (const value of that) {
+    out = remove(out, value);
+  }
+  return out;
+});
+
+/**
+ * Check if a predicate holds true for every `SortedSet` element.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const every = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, refinement) => {
+  for (const value of self) {
+    if (!refinement(value)) {
+      return false;
+    }
+  }
+  return true;
+});
+
+/**
+ * @since 2.0.0
+ * @category filtering
+ */
+const filter = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, predicate) => {
+  const ord = RedBlackTree_dist_effectRedBlackTree.getOrder(self.keyTree);
+  let out = empty(ord);
+  for (const value of self) {
+    if (predicate(value)) {
+      out = add(out, value);
+    }
+  }
+  return out;
+});
+
+/**
+ * @since 2.0.0
+ * @category sequencing
+ */
+const flatMap = /*#__PURE__*/Function_dist_effectFunction.dual(3, (self, O, f) => {
+  let out = empty(O);
+  forEach(self, a => {
+    for (const b of f(a)) {
+      out = add(out, b);
+    }
+  });
+  return out;
+});
+
+/**
+ * @since 2.0.0
+ * @category traversing
+ */
+const forEach = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, f) => RedBlackTree_dist_effectRedBlackTree.forEach(self.keyTree, f));
+
+/**
+ * @since 2.0.0
+ * @category elements
+ */
+const has = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, value) => RedBlackTree_dist_effectRedBlackTree.has(self.keyTree, value));
+
+/**
+ * @since 2.0.0
+ */
+const intersection = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, that) => {
+  const ord = RedBlackTree_dist_effectRedBlackTree.getOrder(self.keyTree);
+  let out = empty(ord);
+  for (const value of that) {
+    if (has(self, value)) {
+      out = add(out, value);
+    }
+  }
+  return out;
+});
+
+/**
+ * @since 2.0.0
+ * @category elements
+ */
+const isSubset = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, that) => every(self, a => has(that, a)));
+
+/**
+ * @since 2.0.0
+ * @category mapping
+ */
+const map = /*#__PURE__*/Function_dist_effectFunction.dual(3, (self, O, f) => {
+  let out = empty(O);
+  forEach(self, a => {
+    const b = f(a);
+    if (!has(out, b)) {
+      out = add(out, b);
+    }
+  });
+  return out;
+});
+
+/**
+ * @since 2.0.0
+ * @category filtering
+ */
+const partition = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, predicate) => {
+  const ord = RedBlackTree_dist_effectRedBlackTree.getOrder(self.keyTree);
+  let right = empty(ord);
+  let left = empty(ord);
+  for (const value of self) {
+    if (predicate(value)) {
+      right = add(right, value);
+    } else {
+      left = add(left, value);
+    }
+  }
+  return [left, right];
+});
+
+/**
+ * @since 2.0.0
+ * @category elements
+ */
+const remove = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, value) => fromTree(RedBlackTree_dist_effectRedBlackTree.removeFirst(self.keyTree, value)));
+
+/**
+ * @since 2.0.0
+ * @category getters
+ */
+const size = self => RedBlackTree_dist_effectRedBlackTree.size(self.keyTree);
+
+/**
+ * Check if a predicate holds true for some `SortedSet` element.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const some = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, predicate) => {
+  for (const value of self) {
+    if (predicate(value)) {
+      return true;
+    }
+  }
+  return false;
+});
+
+/**
+ * @since 2.0.0
+ * @category elements
+ */
+const toggle = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, value) => has(self, value) ? remove(self, value) : add(self, value));
+
+/**
+ * @since 2.0.0
+ */
+const union = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, that) => {
+  const ord = RedBlackTree_dist_effectRedBlackTree.getOrder(self.keyTree);
+  let out = empty(ord);
+  for (const value of self) {
+    out = add(value)(out);
+  }
+  for (const value of that) {
+    out = add(value)(out);
+  }
+  return out;
+});
+
+/**
+ * @since 2.0.0
+ * @category getters
+ */
+const values = self => RedBlackTree_dist_effectRedBlackTree.keys(self.keyTree);
+
+exports.add = add;
+exports.difference = difference;
+exports.empty = empty;
+exports.every = every;
+exports.filter = filter;
+exports.flatMap = flatMap;
+exports.forEach = forEach;
+exports.fromIterable = fromIterable;
+exports.has = has;
+exports.intersection = intersection;
+exports.isSortedSet = isSortedSet;
+exports.isSubset = isSubset;
+exports.make = make;
+exports.map = map;
+exports.partition = partition;
+exports.remove = remove;
+exports.size = size;
+exports.some = some;
+exports.toggle = toggle;
+exports.union = union;
+exports.values = values;

package/SortedSet/dist/effect-SortedSet.cjs.prod.js

@@ -2,50 +2,301 @@
 
 Object.defineProperty(exports, '__esModule', { value: true });
 
-require('../../dist/Equal-ce9977a8.cjs.prod.js');
-require('../../dist/Function-2e6b0cda.cjs.prod.js');
-require('../../dist/Hash-1bd73210.cjs.prod.js');
-require('../../dist/Inspectable-3c4a0f5d.cjs.prod.js');
-require('../../dist/Pipeable-d3ec6711.cjs.prod.js');
-require('../../dist/Predicate-daa86e61.cjs.prod.js');
-require('../../dist/RedBlackTree-eb41ea8a.cjs.prod.js');
-var SortedSet_dist_effectSortedSet = require('../../dist/SortedSet-424670fe.cjs.prod.js');
-require('../../dist/GlobalValue-cb645c99.cjs.prod.js');
-require('../../dist/Utils-864e1d48.cjs.prod.js');
-require('../../dist/Chunk-6cf5a8e6.cjs.prod.js');
-require('../../dist/Equivalence-0bc84518.cjs.prod.js');
-require('../../dist/Option-02025c86.cjs.prod.js');
-require('../../dist/Either-d03d5f05.cjs.prod.js');
-require('../../dist/Effectable-f867d1cb.cjs.prod.js');
-require('../../dist/Data-07dc27f1.cjs.prod.js');
-require('../../dist/Number-cb2ba2e8.cjs.prod.js');
-require('../../dist/Order-8a112bfb.cjs.prod.js');
-require('../../dist/ReadonlyArray-8157f697.cjs.prod.js');
-require('../../dist/Either-3fab3796.cjs.prod.js');
+var Equal_dist_effectEqual = require('../../Equal/dist/effect-Equal.cjs.prod.js');
+var Function_dist_effectFunction = require('../../Function/dist/effect-Function.cjs.prod.js');
+var Hash_dist_effectHash = require('../../Hash/dist/effect-Hash.cjs.prod.js');
+var Inspectable_dist_effectInspectable = require('../../Inspectable/dist/effect-Inspectable.cjs.prod.js');
+var Pipeable_dist_effectPipeable = require('../../Pipeable/dist/effect-Pipeable.cjs.prod.js');
+var Predicate_dist_effectPredicate = require('../../Predicate/dist/effect-Predicate.cjs.prod.js');
+var RedBlackTree_dist_effectRedBlackTree = require('../../RedBlackTree/dist/effect-RedBlackTree.cjs.prod.js');
+require('../../GlobalValue/dist/effect-GlobalValue.cjs.prod.js');
+require('../../Utils/dist/effect-Utils.cjs.prod.js');
+require('../../Chunk/dist/effect-Chunk.cjs.prod.js');
+require('../../Equivalence/dist/effect-Equivalence.cjs.prod.js');
+require('../../Option/dist/effect-Option.cjs.prod.js');
+require('../../dist/Either-7a881c7a.cjs.prod.js');
+require('../../dist/Effectable-cd8f3a96.cjs.prod.js');
+require('../../Data/dist/effect-Data.cjs.prod.js');
+require('../../Number/dist/effect-Number.cjs.prod.js');
+require('../../Order/dist/effect-Order.cjs.prod.js');
+require('../../ReadonlyArray/dist/effect-ReadonlyArray.cjs.prod.js');
+require('../../Either/dist/effect-Either.cjs.prod.js');
 require('../../dist/ReadonlyArray-f9ed7a05.cjs.prod.js');
-require('../../dist/ReadonlyRecord-8db8bada.cjs.prod.js');
+require('../../ReadonlyRecord/dist/effect-ReadonlyRecord.cjs.prod.js');
 require('../../dist/Stack-fc8f9fe5.cjs.prod.js');
 
+/**
+ * @since 2.0.0
+ */
+const TypeId = /*#__PURE__*/Symbol.for("effect/SortedSet");
 
+/**
+ * @since 2.0.0
+ * @category symbol
+ */
 
-exports.add = SortedSet_dist_effectSortedSet.add;
-exports.difference = SortedSet_dist_effectSortedSet.difference;
-exports.empty = SortedSet_dist_effectSortedSet.empty;
-exports.every = SortedSet_dist_effectSortedSet.every;
-exports.filter = SortedSet_dist_effectSortedSet.filter;
-exports.flatMap = SortedSet_dist_effectSortedSet.flatMap;
-exports.forEach = SortedSet_dist_effectSortedSet.forEach;
-exports.fromIterable = SortedSet_dist_effectSortedSet.fromIterable;
-exports.has = SortedSet_dist_effectSortedSet.has;
-exports.intersection = SortedSet_dist_effectSortedSet.intersection;
-exports.isSortedSet = SortedSet_dist_effectSortedSet.isSortedSet;
-exports.isSubset = SortedSet_dist_effectSortedSet.isSubset;
-exports.make = SortedSet_dist_effectSortedSet.make;
-exports.map = SortedSet_dist_effectSortedSet.map;
-exports.partition = SortedSet_dist_effectSortedSet.partition;
-exports.remove = SortedSet_dist_effectSortedSet.remove;
-exports.size = SortedSet_dist_effectSortedSet.size;
-exports.some = SortedSet_dist_effectSortedSet.some;
-exports.toggle = SortedSet_dist_effectSortedSet.toggle;
-exports.union = SortedSet_dist_effectSortedSet.union;
-exports.values = SortedSet_dist_effectSortedSet.values;
+/**
+ * @since 2.0.0
+ * @category models
+ */
+
+const SortedSetProto = {
+  [TypeId]: {
+    _A: _ => _
+  },
+  [Hash_dist_effectHash.symbol]() {
+    return Function_dist_effectFunction.pipe(Hash_dist_effectHash.hash(this.keyTree), Hash_dist_effectHash.combine(Hash_dist_effectHash.hash(TypeId)));
+  },
+  [Equal_dist_effectEqual.symbol](that) {
+    return isSortedSet(that) && Equal_dist_effectEqual.equals(this.keyTree, that.keyTree);
+  },
+  [Symbol.iterator]() {
+    return RedBlackTree_dist_effectRedBlackTree.keys(this.keyTree);
+  },
+  toString() {
+    return Inspectable_dist_effectInspectable.toString(this.toJSON());
+  },
+  toJSON() {
+    return {
+      _id: "SortedSet",
+      values: Array.from(this).map(Inspectable_dist_effectInspectable.toJSON)
+    };
+  },
+  [Inspectable_dist_effectInspectable.NodeInspectSymbol]() {
+    return this.toJSON();
+  },
+  pipe() {
+    return Pipeable_dist_effectPipeable.pipeArguments(this, arguments);
+  }
+};
+const fromTree = keyTree => {
+  const a = Object.create(SortedSetProto);
+  a.keyTree = keyTree;
+  return a;
+};
+
+/**
+ * @since 2.0.0
+ * @category refinements
+ */
+const isSortedSet = u => Predicate_dist_effectPredicate.isObject(u) && TypeId in u;
+
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const empty = O => fromTree(RedBlackTree_dist_effectRedBlackTree.empty(O));
+
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromIterable = ord => iterable => fromTree(RedBlackTree_dist_effectRedBlackTree.fromIterable(ord)(Array.from(iterable).map(k => [k, true])));
+
+/**
+ * @since 2.0.0
+ * @category constructors
+ */
+const make = ord => (...entries) => fromIterable(ord)(entries);
+
+/**
+ * @since 2.0.0
+ * @category elements
+ */
+const add = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, value) => RedBlackTree_dist_effectRedBlackTree.has(self.keyTree, value) ? self : fromTree(RedBlackTree_dist_effectRedBlackTree.insert(self.keyTree, value, true)));
+
+/**
+ * @since 2.0.0
+ */
+const difference = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, that) => {
+  let out = self;
+  for (const value of that) {
+    out = remove(out, value);
+  }
+  return out;
+});
+
+/**
+ * Check if a predicate holds true for every `SortedSet` element.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const every = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, refinement) => {
+  for (const value of self) {
+    if (!refinement(value)) {
+      return false;
+    }
+  }
+  return true;
+});
+
+/**
+ * @since 2.0.0
+ * @category filtering
+ */
+const filter = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, predicate) => {
+  const ord = RedBlackTree_dist_effectRedBlackTree.getOrder(self.keyTree);
+  let out = empty(ord);
+  for (const value of self) {
+    if (predicate(value)) {
+      out = add(out, value);
+    }
+  }
+  return out;
+});
+
+/**
+ * @since 2.0.0
+ * @category sequencing
+ */
+const flatMap = /*#__PURE__*/Function_dist_effectFunction.dual(3, (self, O, f) => {
+  let out = empty(O);
+  forEach(self, a => {
+    for (const b of f(a)) {
+      out = add(out, b);
+    }
+  });
+  return out;
+});
+
+/**
+ * @since 2.0.0
+ * @category traversing
+ */
+const forEach = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, f) => RedBlackTree_dist_effectRedBlackTree.forEach(self.keyTree, f));
+
+/**
+ * @since 2.0.0
+ * @category elements
+ */
+const has = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, value) => RedBlackTree_dist_effectRedBlackTree.has(self.keyTree, value));
+
+/**
+ * @since 2.0.0
+ */
+const intersection = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, that) => {
+  const ord = RedBlackTree_dist_effectRedBlackTree.getOrder(self.keyTree);
+  let out = empty(ord);
+  for (const value of that) {
+    if (has(self, value)) {
+      out = add(out, value);
+    }
+  }
+  return out;
+});
+
+/**
+ * @since 2.0.0
+ * @category elements
+ */
+const isSubset = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, that) => every(self, a => has(that, a)));
+
+/**
+ * @since 2.0.0
+ * @category mapping
+ */
+const map = /*#__PURE__*/Function_dist_effectFunction.dual(3, (self, O, f) => {
+  let out = empty(O);
+  forEach(self, a => {
+    const b = f(a);
+    if (!has(out, b)) {
+      out = add(out, b);
+    }
+  });
+  return out;
+});
+
+/**
+ * @since 2.0.0
+ * @category filtering
+ */
+const partition = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, predicate) => {
+  const ord = RedBlackTree_dist_effectRedBlackTree.getOrder(self.keyTree);
+  let right = empty(ord);
+  let left = empty(ord);
+  for (const value of self) {
+    if (predicate(value)) {
+      right = add(right, value);
+    } else {
+      left = add(left, value);
+    }
+  }
+  return [left, right];
+});
+
+/**
+ * @since 2.0.0
+ * @category elements
+ */
+const remove = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, value) => fromTree(RedBlackTree_dist_effectRedBlackTree.removeFirst(self.keyTree, value)));
+
+/**
+ * @since 2.0.0
+ * @category getters
+ */
+const size = self => RedBlackTree_dist_effectRedBlackTree.size(self.keyTree);
+
+/**
+ * Check if a predicate holds true for some `SortedSet` element.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const some = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, predicate) => {
+  for (const value of self) {
+    if (predicate(value)) {
+      return true;
+    }
+  }
+  return false;
+});
+
+/**
+ * @since 2.0.0
+ * @category elements
+ */
+const toggle = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, value) => has(self, value) ? remove(self, value) : add(self, value));
+
+/**
+ * @since 2.0.0
+ */
+const union = /*#__PURE__*/Function_dist_effectFunction.dual(2, (self, that) => {
+  const ord = RedBlackTree_dist_effectRedBlackTree.getOrder(self.keyTree);
+  let out = empty(ord);
+  for (const value of self) {
+    out = add(value)(out);
+  }
+  for (const value of that) {
+    out = add(value)(out);
+  }
+  return out;
+});
+
+/**
+ * @since 2.0.0
+ * @category getters
+ */
+const values = self => RedBlackTree_dist_effectRedBlackTree.keys(self.keyTree);
+
+exports.add = add;
+exports.difference = difference;
+exports.empty = empty;
+exports.every = every;
+exports.filter = filter;
+exports.flatMap = flatMap;
+exports.forEach = forEach;
+exports.fromIterable = fromIterable;
+exports.has = has;
+exports.intersection = intersection;
+exports.isSortedSet = isSortedSet;
+exports.isSubset = isSubset;
+exports.make = make;
+exports.map = map;
+exports.partition = partition;
+exports.remove = remove;
+exports.size = size;
+exports.some = some;
+exports.toggle = toggle;
+exports.union = union;
+exports.values = values;