@slicemachine/manager 0.22.2-alpha.dani-repeatable-links-codegen.2 → 0.22.2-alpha.dani-repeatable-links-warning.1

package/dist/_node_modules/fp-ts/es6/ReadonlyMap.js

@@ -1,902 +0,0 @@
-import { fromEquals } from "./Eq.js";
-import { pipe, SK } from "./function.js";
-import { flap as flap$1 } from "./Functor.js";
-import { isSome, some, none, isNone, isLeft } from "./internal.js";
-import { map as map$1 } from "./Option.js";
-import { separated } from "./Separated.js";
-import { wiltDefault, witherDefault } from "./Witherable.js";
-var fromMap = function(m) {
-  return new Map(m);
-};
-function toMap(m) {
-  return new Map(m);
-}
-function getShow(SK2, SA) {
-  return {
-    show: function(m) {
-      var entries = [];
-      m.forEach(function(a, k) {
-        entries.push("[".concat(SK2.show(k), ", ").concat(SA.show(a), "]"));
-      });
-      return "new Map([".concat(entries.sort().join(", "), "])");
-    }
-  };
-}
-var size = function(m) {
-  return m.size;
-};
-var isEmpty = function(m) {
-  return m.size === 0;
-};
-function member(E) {
-  var lookupE = lookup(E);
-  return function(k, m) {
-    if (m === void 0) {
-      var memberE_1 = member(E);
-      return function(m2) {
-        return memberE_1(k, m2);
-      };
-    }
-    return isSome(lookupE(k, m));
-  };
-}
-function elem(E) {
-  return function(a, m) {
-    if (m === void 0) {
-      var elemE_1 = elem(E);
-      return function(m2) {
-        return elemE_1(a, m2);
-      };
-    }
-    var values2 = m.values();
-    var e;
-    while (!(e = values2.next()).done) {
-      var v = e.value;
-      if (E.equals(a, v)) {
-        return true;
-      }
-    }
-    return false;
-  };
-}
-var keys = function(O) {
-  return function(m) {
-    return Array.from(m.keys()).sort(O.compare);
-  };
-};
-var values = function(O) {
-  return function(m) {
-    return Array.from(m.values()).sort(O.compare);
-  };
-};
-function collect(O) {
-  var keysO = keys(O);
-  return function(f) {
-    return function(m) {
-      var out = [];
-      var ks = keysO(m);
-      for (var _i = 0, ks_1 = ks; _i < ks_1.length; _i++) {
-        var key = ks_1[_i];
-        out.push(f(key, m.get(key)));
-      }
-      return out;
-    };
-  };
-}
-var toReadonlyArray = function(O) {
-  return collect(O)(function(k, a) {
-    return [k, a];
-  });
-};
-function toUnfoldable(ord, U) {
-  var toReadonlyArrayO = toReadonlyArray(ord);
-  return function(d) {
-    var kas = toReadonlyArrayO(d);
-    var len = kas.length;
-    return U.unfold(0, function(b) {
-      return b < len ? some([kas[b], b + 1]) : none;
-    });
-  };
-}
-var upsertAt = function(E) {
-  var lookupWithKeyE = lookupWithKey(E);
-  return function(k, a) {
-    var lookupWithKeyEk = lookupWithKeyE(k);
-    return function(m) {
-      var found = lookupWithKeyEk(m);
-      if (isNone(found)) {
-        var out = new Map(m);
-        out.set(k, a);
-        return out;
-      } else if (found.value[1] !== a) {
-        var out = new Map(m);
-        out.set(found.value[0], a);
-        return out;
-      }
-      return m;
-    };
-  };
-};
-var deleteAt = function(E) {
-  var lookupWithKeyE = lookupWithKey(E);
-  return function(k) {
-    return function(m) {
-      var found = lookupWithKeyE(k, m);
-      if (isSome(found)) {
-        var r = new Map(m);
-        r.delete(found.value[0]);
-        return r;
-      }
-      return m;
-    };
-  };
-};
-var updateAt = function(E) {
-  var modifyAtE = modifyAt(E);
-  return function(k, a) {
-    return modifyAtE(k, function() {
-      return a;
-    });
-  };
-};
-var modifyAt = function(E) {
-  var lookupWithKeyE = lookupWithKey(E);
-  return function(k, f) {
-    return function(m) {
-      var found = lookupWithKeyE(k, m);
-      if (isNone(found)) {
-        return none;
-      }
-      var _a = found.value, fk = _a[0], fv = _a[1];
-      var next = f(fv);
-      if (next === fv) {
-        return some(m);
-      }
-      var r = new Map(m);
-      r.set(fk, next);
-      return some(r);
-    };
-  };
-};
-function pop(E) {
-  var lookupE = lookup(E);
-  var deleteAtE = deleteAt(E);
-  return function(k) {
-    var deleteAtEk = deleteAtE(k);
-    return function(m) {
-      return pipe(lookupE(k, m), map$1(function(a) {
-        return [a, deleteAtEk(m)];
-      }));
-    };
-  };
-}
-function lookupWithKey(E) {
-  return function(k, m) {
-    if (m === void 0) {
-      var lookupWithKeyE_1 = lookupWithKey(E);
-      return function(m2) {
-        return lookupWithKeyE_1(k, m2);
-      };
-    }
-    var entries = m.entries();
-    var e;
-    while (!(e = entries.next()).done) {
-      var _a = e.value, ka = _a[0], a = _a[1];
-      if (E.equals(ka, k)) {
-        return some([ka, a]);
-      }
-    }
-    return none;
-  };
-}
-function lookup(E) {
-  var lookupWithKeyE = lookupWithKey(E);
-  return function(k, m) {
-    if (m === void 0) {
-      var lookupE_1 = lookup(E);
-      return function(m2) {
-        return lookupE_1(k, m2);
-      };
-    }
-    return pipe(lookupWithKeyE(k, m), map$1(function(_a) {
-      _a[0];
-      var a = _a[1];
-      return a;
-    }));
-  };
-}
-function isSubmap(SK2, SA) {
-  var lookupWithKeyS = lookupWithKey(SK2);
-  return function(me, that) {
-    if (that === void 0) {
-      var isSubmapSKSA_1 = isSubmap(SK2, SA);
-      return function(that2) {
-        return isSubmapSKSA_1(that2, me);
-      };
-    }
-    var entries = me.entries();
-    var e;
-    while (!(e = entries.next()).done) {
-      var _a = e.value, k = _a[0], a = _a[1];
-      var d2OptA = lookupWithKeyS(k, that);
-      if (isNone(d2OptA) || !SK2.equals(k, d2OptA.value[0]) || !SA.equals(a, d2OptA.value[1])) {
-        return false;
-      }
-    }
-    return true;
-  };
-}
-var empty = (
-  // the type annotation here is intended (otherwise it doesn't type-check)
-  /* @__PURE__ */ new Map()
-);
-function getEq(SK2, SA) {
-  var isSubmapSKSA = isSubmap(SK2, SA);
-  return fromEquals(function(x, y) {
-    return isSubmapSKSA(x, y) && isSubmapSKSA(y, x);
-  });
-}
-function getMonoid(SK2, SA) {
-  var lookupWithKeyS = lookupWithKey(SK2);
-  return {
-    concat: function(mx, my) {
-      if (isEmpty(mx)) {
-        return my;
-      }
-      if (isEmpty(my)) {
-        return mx;
-      }
-      var r = new Map(mx);
-      var entries = my.entries();
-      var e;
-      while (!(e = entries.next()).done) {
-        var _a = e.value, k = _a[0], a = _a[1];
-        var mxOptA = lookupWithKeyS(k, mx);
-        if (isSome(mxOptA)) {
-          r.set(mxOptA.value[0], SA.concat(mxOptA.value[1], a));
-        } else {
-          r.set(k, a);
-        }
-      }
-      return r;
-    },
-    empty
-  };
-}
-var singleton = function(k, a) {
-  return /* @__PURE__ */ new Map([[k, a]]);
-};
-function fromFoldable(E, M, F) {
-  return function(fka) {
-    var lookupWithKeyE = lookupWithKey(E);
-    return F.reduce(fka, /* @__PURE__ */ new Map(), function(b, _a) {
-      var k = _a[0], a = _a[1];
-      var bOpt = lookupWithKeyE(k, b);
-      if (isSome(bOpt)) {
-        b.set(bOpt.value[0], M.concat(bOpt.value[1], a));
-      } else {
-        b.set(k, a);
-      }
-      return b;
-    });
-  };
-}
-var _mapWithIndex = function(fa, f) {
-  var m = /* @__PURE__ */ new Map();
-  var entries = fa.entries();
-  var e;
-  while (!(e = entries.next()).done) {
-    var _a = e.value, key = _a[0], a = _a[1];
-    m.set(key, f(key, a));
-  }
-  return m;
-};
-var partitionMapWithIndex = function(f) {
-  return function(fa) {
-    var left = /* @__PURE__ */ new Map();
-    var right = /* @__PURE__ */ new Map();
-    var entries = fa.entries();
-    var e;
-    while (!(e = entries.next()).done) {
-      var _a = e.value, k = _a[0], a = _a[1];
-      var ei = f(k, a);
-      if (isLeft(ei)) {
-        left.set(k, ei.left);
-      } else {
-        right.set(k, ei.right);
-      }
-    }
-    return separated(left, right);
-  };
-};
-function partitionWithIndex(predicateWithIndex) {
-  return function(m) {
-    var left = /* @__PURE__ */ new Map();
-    var right = /* @__PURE__ */ new Map();
-    var entries = m.entries();
-    var e;
-    while (!(e = entries.next()).done) {
-      var _a = e.value, k = _a[0], a = _a[1];
-      if (predicateWithIndex(k, a)) {
-        right.set(k, a);
-      } else {
-        left.set(k, a);
-      }
-    }
-    return separated(left, right);
-  };
-}
-var filterMapWithIndex = function(f) {
-  return function(fa) {
-    var m = /* @__PURE__ */ new Map();
-    var entries = fa.entries();
-    var e;
-    while (!(e = entries.next()).done) {
-      var _a = e.value, k = _a[0], a = _a[1];
-      var o = f(k, a);
-      if (isSome(o)) {
-        m.set(k, o.value);
-      }
-    }
-    return m;
-  };
-};
-function filterWithIndex(predicateWithIndex) {
-  return function(m) {
-    var out = /* @__PURE__ */ new Map();
-    var entries = m.entries();
-    var e;
-    while (!(e = entries.next()).done) {
-      var _a = e.value, k = _a[0], a = _a[1];
-      if (predicateWithIndex(k, a)) {
-        out.set(k, a);
-      }
-    }
-    return out;
-  };
-}
-var _map = function(fa, f) {
-  return _mapWithIndex(fa, function(_, a) {
-    return f(a);
-  });
-};
-var _filter = function(fa, p) {
-  return _filterWithIndex(fa, function(_, a) {
-    return p(a);
-  });
-};
-var _filterMap = function(fa, f) {
-  return _filterMapWithIndex(fa, function(_, a) {
-    return f(a);
-  });
-};
-var _partition = function(fa, predicate) {
-  return _partitionWithIndex(fa, function(_, a) {
-    return predicate(a);
-  });
-};
-var _partitionMap = function(fa, f) {
-  return _partitionMapWithIndex(fa, function(_, a) {
-    return f(a);
-  });
-};
-var _filterWithIndex = function(fa, p) {
-  return pipe(fa, filterWithIndex(p));
-};
-var _filterMapWithIndex = function(fa, f) {
-  return pipe(fa, filterMapWithIndex(f));
-};
-var _partitionWithIndex = function(fa, p) {
-  return pipe(fa, partitionWithIndex(p));
-};
-var _partitionMapWithIndex = function(fa, f) {
-  return pipe(fa, partitionMapWithIndex(f));
-};
-var compact = function(fa) {
-  var m = /* @__PURE__ */ new Map();
-  var entries = fa.entries();
-  var e;
-  while (!(e = entries.next()).done) {
-    var _a = e.value, k = _a[0], oa = _a[1];
-    if (isSome(oa)) {
-      m.set(k, oa.value);
-    }
-  }
-  return m;
-};
-var filter = function(predicate) {
-  return function(fa) {
-    return _filter(fa, predicate);
-  };
-};
-var filterMap = function(f) {
-  return function(fa) {
-    return _filterMap(fa, f);
-  };
-};
-var map = function(f) {
-  return function(fa) {
-    return _map(fa, f);
-  };
-};
-var mapWithIndex = function(f) {
-  return function(fa) {
-    return _mapWithIndex(fa, f);
-  };
-};
-var partition = function(predicate) {
-  return function(fa) {
-    return _partition(fa, predicate);
-  };
-};
-var partitionMap = function(f) {
-  return function(fa) {
-    return _partitionMap(fa, f);
-  };
-};
-var separate = function(fa) {
-  var left = /* @__PURE__ */ new Map();
-  var right = /* @__PURE__ */ new Map();
-  var entries = fa.entries();
-  var e;
-  while (!(e = entries.next()).done) {
-    var _a = e.value, k = _a[0], ei = _a[1];
-    if (isLeft(ei)) {
-      left.set(k, ei.left);
-    } else {
-      right.set(k, ei.right);
-    }
-  }
-  return separated(left, right);
-};
-var URI = "ReadonlyMap";
-var getUnionSemigroup = function(E, S) {
-  var unionES = union(E, S);
-  return {
-    concat: function(first, second) {
-      return unionES(second)(first);
-    }
-  };
-};
-var getUnionMonoid = function(E, S) {
-  return {
-    concat: getUnionSemigroup(E, S).concat,
-    empty
-  };
-};
-var getIntersectionSemigroup = function(E, S) {
-  var intersectionES = intersection(E, S);
-  return {
-    concat: function(first, second) {
-      return intersectionES(second)(first);
-    }
-  };
-};
-var getDifferenceMagma = function(E) {
-  return function() {
-    var differenceE = difference(E);
-    return {
-      concat: function(first, second) {
-        return differenceE(second)(first);
-      }
-    };
-  };
-};
-function getFilterableWithIndex() {
-  return {
-    URI,
-    _E: void 0,
-    map: _map,
-    mapWithIndex: _mapWithIndex,
-    compact,
-    separate,
-    filter: _filter,
-    filterMap: _filterMap,
-    partition: _partition,
-    partitionMap: _partitionMap,
-    partitionMapWithIndex: _partitionMapWithIndex,
-    partitionWithIndex: _partitionWithIndex,
-    filterMapWithIndex: _filterMapWithIndex,
-    filterWithIndex: _filterWithIndex
-  };
-}
-var Functor = {
-  URI,
-  map: _map
-};
-var flap = /* @__PURE__ */ flap$1(Functor);
-var getFunctorWithIndex = function() {
-  return {
-    URI,
-    _E: void 0,
-    map: _map,
-    mapWithIndex: _mapWithIndex
-  };
-};
-var Compactable = {
-  URI,
-  compact,
-  separate
-};
-var Filterable = {
-  URI,
-  map: _map,
-  compact,
-  separate,
-  filter: _filter,
-  filterMap: _filterMap,
-  partition: _partition,
-  partitionMap: _partitionMap
-};
-var reduce = function(O) {
-  var reduceWithIndexO = reduceWithIndex(O);
-  return function(b, f) {
-    return reduceWithIndexO(b, function(_, b2, a) {
-      return f(b2, a);
-    });
-  };
-};
-var foldMap = function(O) {
-  var foldMapWithIndexO = foldMapWithIndex(O);
-  return function(M) {
-    var foldMapWithIndexOM = foldMapWithIndexO(M);
-    return function(f) {
-      return foldMapWithIndexOM(function(_, a) {
-        return f(a);
-      });
-    };
-  };
-};
-var reduceRight = function(O) {
-  var reduceRightWithIndexO = reduceRightWithIndex(O);
-  return function(b, f) {
-    return reduceRightWithIndexO(b, function(_, b2, a) {
-      return f(b2, a);
-    });
-  };
-};
-var getFoldable = function(O) {
-  var reduceO = reduce(O);
-  var foldMapO = foldMap(O);
-  var reduceRightO = reduceRight(O);
-  return {
-    URI,
-    _E: void 0,
-    reduce: function(fa, b, f) {
-      return pipe(fa, reduceO(b, f));
-    },
-    foldMap: function(M) {
-      var foldMapOM = foldMapO(M);
-      return function(fa, f) {
-        return pipe(fa, foldMapOM(f));
-      };
-    },
-    reduceRight: function(fa, b, f) {
-      return pipe(fa, reduceRightO(b, f));
-    }
-  };
-};
-var reduceWithIndex = function(O) {
-  var keysO = keys(O);
-  return function(b, f) {
-    return function(m) {
-      var out = b;
-      for (var _i = 0, _a = keysO(m); _i < _a.length; _i++) {
-        var k = _a[_i];
-        out = f(k, out, m.get(k));
-      }
-      return out;
-    };
-  };
-};
-var foldMapWithIndex = function(O) {
-  var keysO = keys(O);
-  return function(M) {
-    return function(f) {
-      return function(m) {
-        var out = M.empty;
-        for (var _i = 0, _a = keysO(m); _i < _a.length; _i++) {
-          var k = _a[_i];
-          out = M.concat(out, f(k, m.get(k)));
-        }
-        return out;
-      };
-    };
-  };
-};
-var reduceRightWithIndex = function(O) {
-  var keysO = keys(O);
-  return function(b, f) {
-    return function(m) {
-      var out = b;
-      var ks = keysO(m);
-      var len = ks.length;
-      for (var i = len - 1; i >= 0; i--) {
-        var k = ks[i];
-        out = f(k, m.get(k), out);
-      }
-      return out;
-    };
-  };
-};
-var getFoldableWithIndex = function(O) {
-  var F = getFoldable(O);
-  var reduceWithIndexO = reduceWithIndex(O);
-  var foldMapWithIndexO = foldMapWithIndex(O);
-  var reduceRightWithIndexO = reduceRightWithIndex(O);
-  return {
-    URI,
-    _E: void 0,
-    reduce: F.reduce,
-    foldMap: F.foldMap,
-    reduceRight: F.reduceRight,
-    reduceWithIndex: function(fa, b, f) {
-      return pipe(fa, reduceWithIndexO(b, f));
-    },
-    foldMapWithIndex: function(M) {
-      var foldMapWithIndexOM = foldMapWithIndexO(M);
-      return function(fa, f) {
-        return pipe(fa, foldMapWithIndexOM(f));
-      };
-    },
-    reduceRightWithIndex: function(fa, b, f) {
-      return pipe(fa, reduceRightWithIndexO(b, f));
-    }
-  };
-};
-var getTraversable = function(O) {
-  var TWI = getTraversableWithIndex(O);
-  var F = getFoldable(O);
-  return {
-    URI,
-    _E: void 0,
-    map: _map,
-    reduce: F.reduce,
-    foldMap: F.foldMap,
-    reduceRight: F.reduceRight,
-    traverse: TWI.traverse,
-    sequence: TWI.sequence
-  };
-};
-var getTraversableWithIndex = function(O) {
-  var FWI = getFoldableWithIndex(O);
-  var keysO = keys(O);
-  var traverseWithIndex = function(F) {
-    return function(ta, f) {
-      var fm = F.of(/* @__PURE__ */ new Map());
-      var ks = keysO(ta);
-      var len = ks.length;
-      var _loop_1 = function(i2) {
-        var key = ks[i2];
-        var a = ta.get(key);
-        fm = F.ap(F.map(fm, function(m) {
-          return function(b) {
-            return m.set(key, b);
-          };
-        }), f(key, a));
-      };
-      for (var i = 0; i < len; i++) {
-        _loop_1(i);
-      }
-      return fm;
-    };
-  };
-  var traverse = function(F) {
-    var traverseWithIndexF = traverseWithIndex(F);
-    return function(ta, f) {
-      return traverseWithIndexF(ta, function(_, a) {
-        return f(a);
-      });
-    };
-  };
-  var sequence = function(F) {
-    var traverseWithIndexF = traverseWithIndex(F);
-    return function(ta) {
-      return traverseWithIndexF(ta, SK);
-    };
-  };
-  return {
-    URI,
-    _E: void 0,
-    map: _map,
-    mapWithIndex: _mapWithIndex,
-    reduce: FWI.reduce,
-    foldMap: FWI.foldMap,
-    reduceRight: FWI.reduceRight,
-    reduceWithIndex: FWI.reduceWithIndex,
-    foldMapWithIndex: FWI.foldMapWithIndex,
-    reduceRightWithIndex: FWI.reduceRightWithIndex,
-    traverse,
-    sequence,
-    traverseWithIndex
-  };
-};
-function getWitherable(O) {
-  var TWI = getTraversableWithIndex(O);
-  return {
-    URI,
-    _E: void 0,
-    map: _map,
-    compact,
-    separate,
-    filter: _filter,
-    filterMap: _filterMap,
-    partition: _partition,
-    partitionMap: _partitionMap,
-    reduce: TWI.reduce,
-    foldMap: TWI.foldMap,
-    reduceRight: TWI.reduceRight,
-    traverse: TWI.traverse,
-    sequence: TWI.sequence,
-    mapWithIndex: _mapWithIndex,
-    reduceWithIndex: TWI.reduceWithIndex,
-    foldMapWithIndex: TWI.foldMapWithIndex,
-    reduceRightWithIndex: TWI.reduceRightWithIndex,
-    traverseWithIndex: TWI.traverseWithIndex,
-    wilt: wiltDefault(TWI, Compactable),
-    wither: witherDefault(TWI, Compactable)
-  };
-}
-var union = function(E, M) {
-  var lookupE = lookup(E);
-  return function(second) {
-    return function(first) {
-      if (isEmpty(first)) {
-        return second;
-      }
-      if (isEmpty(second)) {
-        return first;
-      }
-      var out = /* @__PURE__ */ new Map();
-      var firstEntries = first.entries();
-      var e;
-      while (!(e = firstEntries.next()).done) {
-        var _a = e.value, k = _a[0], a = _a[1];
-        var oka = lookupE(k)(second);
-        if (isSome(oka)) {
-          out.set(k, M.concat(a, oka.value));
-        } else {
-          out.set(k, a);
-        }
-      }
-      var secondEntries = second.entries();
-      while (!(e = secondEntries.next()).done) {
-        var _b = e.value, k = _b[0], a = _b[1];
-        var oka = lookupE(k)(out);
-        if (isNone(oka)) {
-          out.set(k, a);
-        }
-      }
-      return out;
-    };
-  };
-};
-var intersection = function(E, M) {
-  var lookupE = lookup(E);
-  return function(second) {
-    return function(first) {
-      if (isEmpty(first) || isEmpty(second)) {
-        return empty;
-      }
-      var out = /* @__PURE__ */ new Map();
-      var entries = first.entries();
-      var e;
-      while (!(e = entries.next()).done) {
-        var _a = e.value, k = _a[0], a = _a[1];
-        var oka = lookupE(k)(second);
-        if (isSome(oka)) {
-          out.set(k, M.concat(a, oka.value));
-        }
-      }
-      return out;
-    };
-  };
-};
-var difference = function(E) {
-  var memberE = member(E);
-  return function(second) {
-    return function(first) {
-      if (isEmpty(first)) {
-        return second;
-      }
-      if (isEmpty(second)) {
-        return first;
-      }
-      var out = /* @__PURE__ */ new Map();
-      var firstEntries = first.entries();
-      var e;
-      while (!(e = firstEntries.next()).done) {
-        var _a = e.value, k = _a[0], a = _a[1];
-        if (!memberE(k)(second)) {
-          out.set(k, a);
-        }
-      }
-      var secondEntries = second.entries();
-      while (!(e = secondEntries.next()).done) {
-        var _b = e.value, k = _b[0], a = _b[1];
-        if (!memberE(k)(first)) {
-          out.set(k, a);
-        }
-      }
-      return out;
-    };
-  };
-};
-var insertAt = upsertAt;
-var readonlyMap = {
-  URI,
-  map: _map,
-  compact,
-  separate,
-  filter: _filter,
-  filterMap: _filterMap,
-  partition: _partition,
-  partitionMap: _partitionMap
-};
-export {
-  Compactable,
-  Filterable,
-  Functor,
-  URI,
-  collect,
-  compact,
-  deleteAt,
-  difference,
-  elem,
-  empty,
-  filter,
-  filterMap,
-  filterMapWithIndex,
-  filterWithIndex,
-  flap,
-  foldMap,
-  foldMapWithIndex,
-  fromFoldable,
-  fromMap,
-  getDifferenceMagma,
-  getEq,
-  getFilterableWithIndex,
-  getFoldable,
-  getFoldableWithIndex,
-  getFunctorWithIndex,
-  getIntersectionSemigroup,
-  getMonoid,
-  getShow,
-  getTraversable,
-  getTraversableWithIndex,
-  getUnionMonoid,
-  getUnionSemigroup,
-  getWitherable,
-  insertAt,
-  intersection,
-  isEmpty,
-  isSubmap,
-  keys,
-  lookup,
-  lookupWithKey,
-  map,
-  mapWithIndex,
-  member,
-  modifyAt,
-  partition,
-  partitionMap,
-  partitionMapWithIndex,
-  partitionWithIndex,
-  pop,
-  readonlyMap,
-  reduce,
-  reduceRight,
-  reduceRightWithIndex,
-  reduceWithIndex,
-  separate,
-  singleton,
-  size,
-  toMap,
-  toReadonlyArray,
-  toUnfoldable,
-  union,
-  updateAt,
-  upsertAt,
-  values
-};
-//# sourceMappingURL=ReadonlyMap.js.map