effect 2.0.0-next.8 → 2.0.0

package/dist/cjs/internal/stm/tPriorityQueue.js

@@ -0,0 +1,180 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.toChunk = exports.toArray = exports.takeUpTo = exports.takeOption = exports.takeAll = exports.take = exports.size = exports.retainIf = exports.removeIf = exports.peekOption = exports.peek = exports.offerAll = exports.offer = exports.make = exports.isNonEmpty = exports.isEmpty = exports.fromIterable = exports.empty = exports.TPriorityQueueTypeId = exports.TPriorityQueueImpl = void 0;
+var Chunk = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("../../Chunk.js"));
+var _Function = /*#__PURE__*/require("../../Function.js");
+var Option = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("../../Option.js"));
+var ReadonlyArray = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("../../ReadonlyArray.js"));
+var SortedMap = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("../../SortedMap.js"));
+var core = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./core.js"));
+var tRef = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./tRef.js"));
+function _getRequireWildcardCache(e) {
+  if ("function" != typeof WeakMap) return null;
+  var r = new WeakMap(),
+    t = new WeakMap();
+  return (_getRequireWildcardCache = function (e) {
+    return e ? t : r;
+  })(e);
+}
+function _interopRequireWildcard(e, r) {
+  if (!r && e && e.__esModule) return e;
+  if (null === e || "object" != typeof e && "function" != typeof e) return {
+    default: e
+  };
+  var t = _getRequireWildcardCache(r);
+  if (t && t.has(e)) return t.get(e);
+  var n = {
+      __proto__: null
+    },
+    a = Object.defineProperty && Object.getOwnPropertyDescriptor;
+  for (var u in e) if ("default" !== u && Object.prototype.hasOwnProperty.call(e, u)) {
+    var i = a ? Object.getOwnPropertyDescriptor(e, u) : null;
+    i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u];
+  }
+  return n.default = e, t && t.set(e, n), n;
+}
+/** @internal */
+const TPriorityQueueSymbolKey = "effect/TPriorityQueue";
+/** @internal */
+const TPriorityQueueTypeId = exports.TPriorityQueueTypeId = /*#__PURE__*/Symbol.for(TPriorityQueueSymbolKey);
+const tPriorityQueueVariance = {
+  /* c8 ignore next */
+  _A: _ => _
+};
+/** @internal */
+class TPriorityQueueImpl {
+  ref;
+  [TPriorityQueueTypeId] = tPriorityQueueVariance;
+  constructor(ref) {
+    this.ref = ref;
+  }
+}
+/** @internal */
+exports.TPriorityQueueImpl = TPriorityQueueImpl;
+const empty = order => (0, _Function.pipe)(tRef.make(SortedMap.empty(order)), core.map(ref => new TPriorityQueueImpl(ref)));
+/** @internal */
+exports.empty = empty;
+const fromIterable = order => iterable => (0, _Function.pipe)(tRef.make(Array.from(iterable).reduce((map, value) => (0, _Function.pipe)(map, SortedMap.set(value, (0, _Function.pipe)(map, SortedMap.get(value), Option.match({
+  onNone: () => ReadonlyArray.of(value),
+  onSome: ReadonlyArray.prepend(value)
+})))), SortedMap.empty(order))), core.map(ref => new TPriorityQueueImpl(ref)));
+/** @internal */
+exports.fromIterable = fromIterable;
+const isEmpty = self => core.map(tRef.get(self.ref), SortedMap.isEmpty);
+/** @internal */
+exports.isEmpty = isEmpty;
+const isNonEmpty = self => core.map(tRef.get(self.ref), SortedMap.isNonEmpty);
+/** @internal */
+exports.isNonEmpty = isNonEmpty;
+const make = order => (...elements) => fromIterable(order)(elements);
+/** @internal */
+exports.make = make;
+const offer = exports.offer = /*#__PURE__*/(0, _Function.dual)(2, (self, value) => tRef.update(self.ref, map => SortedMap.set(map, value, Option.match(SortedMap.get(map, value), {
+  onNone: () => ReadonlyArray.of(value),
+  onSome: ReadonlyArray.prepend(value)
+}))));
+/** @internal */
+const offerAll = exports.offerAll = /*#__PURE__*/(0, _Function.dual)(2, (self, values) => tRef.update(self.ref, map => Array.from(values).reduce((map, value) => SortedMap.set(map, value, Option.match(SortedMap.get(map, value), {
+  onNone: () => ReadonlyArray.of(value),
+  onSome: ReadonlyArray.prepend(value)
+})), map)));
+/** @internal */
+const peek = self => core.withSTMRuntime(runtime => {
+  const map = tRef.unsafeGet(self.ref, runtime.journal);
+  return Option.match(SortedMap.headOption(map), {
+    onNone: () => core.retry,
+    onSome: elements => core.succeed(elements[0])
+  });
+});
+/** @internal */
+exports.peek = peek;
+const peekOption = self => tRef.modify(self.ref, map => [Option.map(SortedMap.headOption(map), elements => elements[0]), map]);
+/** @internal */
+exports.peekOption = peekOption;
+const removeIf = exports.removeIf = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => retainIf(self, a => !predicate(a)));
+/** @internal */
+const retainIf = exports.retainIf = /*#__PURE__*/(0, _Function.dual)(2, (self, predicate) => tRef.update(self.ref, map => SortedMap.reduce(map, SortedMap.empty(SortedMap.getOrder(map)), (map, value, key) => {
+  const filtered = ReadonlyArray.filter(value, predicate);
+  return filtered.length > 0 ? SortedMap.set(map, key, filtered) : SortedMap.remove(map, key);
+})));
+/** @internal */
+const size = self => tRef.modify(self.ref, map => [SortedMap.reduce(map, 0, (n, as) => n + as.length), map]);
+/** @internal */
+exports.size = size;
+const take = self => core.withSTMRuntime(runtime => {
+  const map = tRef.unsafeGet(self.ref, runtime.journal);
+  return Option.match(SortedMap.headOption(map), {
+    onNone: () => core.retry,
+    onSome: values => {
+      const head = values[1][0];
+      const tail = values[1].slice(1);
+      tRef.unsafeSet(self.ref, tail.length > 0 ? SortedMap.set(map, head, tail) : SortedMap.remove(map, head), runtime.journal);
+      return core.succeed(head);
+    }
+  });
+});
+/** @internal */
+exports.take = take;
+const takeAll = self => tRef.modify(self.ref, map => {
+  const builder = [];
+  for (const entry of map) {
+    builder.push(...entry[1]);
+  }
+  return [builder, SortedMap.empty(SortedMap.getOrder(map))];
+});
+/** @internal */
+exports.takeAll = takeAll;
+const takeOption = self => core.effect(journal => {
+  const map = (0, _Function.pipe)(self.ref, tRef.unsafeGet(journal));
+  return Option.match(SortedMap.headOption(map), {
+    onNone: () => Option.none(),
+    onSome: ([key, value]) => {
+      const tail = value.slice(1);
+      tRef.unsafeSet(self.ref, tail.length > 0 ? SortedMap.set(map, key, tail) : SortedMap.remove(map, key), journal);
+      return Option.some(value[0]);
+    }
+  });
+});
+/** @internal */
+exports.takeOption = takeOption;
+const takeUpTo = exports.takeUpTo = /*#__PURE__*/(0, _Function.dual)(2, (self, n) => tRef.modify(self.ref, map => {
+  const builder = [];
+  const iterator = map[Symbol.iterator]();
+  let updated = map;
+  let index = 0;
+  let next;
+  while ((next = iterator.next()) && !next.done && index < n) {
+    const [key, value] = next.value;
+    const [left, right] = (0, _Function.pipe)(value, ReadonlyArray.splitAt(n - index));
+    builder.push(...left);
+    if (right.length > 0) {
+      updated = SortedMap.set(updated, key, right);
+    } else {
+      updated = SortedMap.remove(updated, key);
+    }
+    index = index + left.length;
+  }
+  return [builder, updated];
+}));
+/** @internal */
+const toChunk = self => tRef.modify(self.ref, map => {
+  const builder = [];
+  for (const entry of map) {
+    builder.push(...entry[1]);
+  }
+  return [Chunk.unsafeFromArray(builder), map];
+});
+/** @internal */
+exports.toChunk = toChunk;
+const toArray = self => tRef.modify(self.ref, map => {
+  const builder = [];
+  for (const entry of map) {
+    builder.push(...entry[1]);
+  }
+  return [builder, map];
+});
+exports.toArray = toArray;
+//# sourceMappingURL=tPriorityQueue.js.map

package/dist/cjs/internal/stm/tPriorityQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tPriorityQueue.js","names":["Chunk","_interopRequireWildcard","require","_Function","Option","ReadonlyArray","SortedMap","core","tRef","_getRequireWildcardCache","e","WeakMap","r","t","__esModule","default","has","get","n","__proto__","a","Object","defineProperty","getOwnPropertyDescriptor","u","prototype","hasOwnProperty","call","i","set","TPriorityQueueSymbolKey","TPriorityQueueTypeId","exports","Symbol","for","tPriorityQueueVariance","_A","_","TPriorityQueueImpl","ref","constructor","empty","order","pipe","make","map","fromIterable","iterable","Array","from","reduce","value","match","onNone","of","onSome","prepend","isEmpty","self","isNonEmpty","elements","offer","dual","update","offerAll","values","peek","withSTMRuntime","runtime","unsafeGet","journal","headOption","retry","succeed","peekOption","modify","removeIf","predicate","retainIf","getOrder","key","filtered","filter","length","remove","size","as","take","head","tail","slice","unsafeSet","takeAll","builder","entry","push","takeOption","effect","none","some","takeUpTo","iterator","updated","index","next","done","left","right","splitAt","toChunk","unsafeFromArray","toArray"],"sources":["../../../../src/internal/stm/tPriorityQueue.ts"],"sourcesContent":[null],"mappings":";;;;;;AAAA,IAAAA,KAAA,gBAAAC,uBAAA,eAAAC,OAAA;AACA,IAAAC,SAAA,gBAAAD,OAAA;AACA,IAAAE,MAAA,gBAAAH,uBAAA,eAAAC,OAAA;AAGA,IAAAG,aAAA,gBAAAJ,uBAAA,eAAAC,OAAA;AACA,IAAAI,SAAA,gBAAAL,uBAAA,eAAAC,OAAA;AAIA,IAAAK,IAAA,gBAAAN,uBAAA,eAAAC,OAAA;AACA,IAAAM,IAAA,gBAAAP,uBAAA,eAAAC,OAAA;AAAiC,SAAAO,yBAAAC,CAAA;EAAA,yBAAAC,OAAA;EAAA,IAAAC,CAAA,OAAAD,OAAA;IAAAE,CAAA,OAAAF,OAAA;EAAA,QAAAF,wBAAA,YAAAA,CAAAC,CAAA;IAAA,OAAAA,CAAA,GAAAG,CAAA,GAAAD,CAAA;EAAA,GAAAF,CAAA;AAAA;AAAA,SAAAT,wBAAAS,CAAA,EAAAE,CAAA;EAAA,KAAAA,CAAA,IAAAF,CAAA,IAAAA,CAAA,CAAAI,UAAA,SAAAJ,CAAA;EAAA,aAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA;IAAAK,OAAA,EAAAL;EAAA;EAAA,IAAAG,CAAA,GAAAJ,wBAAA,CAAAG,CAAA;EAAA,IAAAC,CAAA,IAAAA,CAAA,CAAAG,GAAA,CAAAN,CAAA,UAAAG,CAAA,CAAAI,GAAA,CAAAP,CAAA;EAAA,IAAAQ,CAAA;MAAAC,SAAA;IAAA;IAAAC,CAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA;EAAA,SAAAC,CAAA,IAAAd,CAAA,oBAAAc,CAAA,IAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAjB,CAAA,EAAAc,CAAA;IAAA,IAAAI,CAAA,GAAAR,CAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAb,CAAA,EAAAc,CAAA;IAAAI,CAAA,KAAAA,CAAA,CAAAX,GAAA,IAAAW,CAAA,CAAAC,GAAA,IAAAR,MAAA,CAAAC,cAAA,CAAAJ,CAAA,EAAAM,CAAA,EAAAI,CAAA,IAAAV,CAAA,CAAAM,CAAA,IAAAd,CAAA,CAAAc,CAAA;EAAA;EAAA,OAAAN,CAAA,CAAAH,OAAA,GAAAL,CAAA,EAAAG,CAAA,IAAAA,CAAA,CAAAgB,GAAA,CAAAnB,CAAA,EAAAQ,CAAA,GAAAA,CAAA;AAAA;AAEjC;AACA,MAAMY,uBAAuB,GAAG,uBAAuB;AAEvD;AACO,MAAMC,oBAAoB,GAAAC,OAAA,CAAAD,oBAAA,gBAAwCE,MAAM,CAACC,GAAG,CACjFJ,uBAAuB,CACe;AAExC,MAAMK,sBAAsB,GAAG;EAC7B;EACAC,EAAE,EAAGC,CAAM,IAAKA;CACjB;AAED;AACM,MAAOC,kBAAkB;EAERC,GAAA;EADZ,CAACR,oBAAoB,IAAII,sBAAsB;EACxDK,YAAqBD,GAAwD;IAAxD,KAAAA,GAAG,GAAHA,GAAG;EAAwD;;AAGlF;AAAAP,OAAA,CAAAM,kBAAA,GAAAA,kBAAA;AACO,MAAMG,KAAK,GAAOC,KAAqB,IAC5C,IAAAvC,SAAA,CAAAwC,IAAI,EACFnC,IAAI,CAACoC,IAAI,CAACtC,SAAS,CAACmC,KAAK,CAAsBC,KAAK,CAAC,CAAC,EACtDnC,IAAI,CAACsC,GAAG,CAAEN,GAAG,IAAK,IAAID,kBAAkB,CAACC,GAAG,CAAC,CAAC,CAC/C;AAEH;AAAAP,OAAA,CAAAS,KAAA,GAAAA,KAAA;AACO,MAAMK,YAAY,GACnBJ,KAAqB,IAAMK,QAAqB,IAClD,IAAA5C,SAAA,CAAAwC,IAAI,EACFnC,IAAI,CAACoC,IAAI,CACPI,KAAK,CAACC,IAAI,CAACF,QAAQ,CAAC,CAACG,MAAM,CACzB,CAACL,GAAG,EAAEM,KAAK,KACT,IAAAhD,SAAA,CAAAwC,IAAI,EACFE,GAAG,EACHvC,SAAS,CAACuB,GAAG,CACXsB,KAAK,EACL,IAAAhD,SAAA,CAAAwC,IAAI,EACFE,GAAG,EACHvC,SAAS,CAACW,GAAG,CAACkC,KAAK,CAAC,EACpB/C,MAAM,CAACgD,KAAK,CAAC;EACXC,MAAM,EAAEA,CAAA,KAAMhD,aAAa,CAACiD,EAAE,CAACH,KAAK,CAAC;EACrCI,MAAM,EAAElD,aAAa,CAACmD,OAAO,CAACL,KAAK;CACpC,CAAC,CACH,CACF,CACF,EACH7C,SAAS,CAACmC,KAAK,CAAsBC,KAAK,CAAC,CAC5C,CACF,EACDnC,IAAI,CAACsC,GAAG,CAAEN,GAAG,IAAK,IAAID,kBAAkB,CAACC,GAAG,CAAC,CAAC,CAC/C;AAEL;AAAAP,OAAA,CAAAc,YAAA,GAAAA,YAAA;AACO,MAAMW,OAAO,GAAOC,IAAsC,IAC/DnD,IAAI,CAACsC,GAAG,CAACrC,IAAI,CAACS,GAAG,CAACyC,IAAI,CAACnB,GAAG,CAAC,EAAEjC,SAAS,CAACmD,OAAO,CAAC;AAEjD;AAAAzB,OAAA,CAAAyB,OAAA,GAAAA,OAAA;AACO,MAAME,UAAU,GAAOD,IAAsC,IAClEnD,IAAI,CAACsC,GAAG,CAACrC,IAAI,CAACS,GAAG,CAACyC,IAAI,CAACnB,GAAG,CAAC,EAAEjC,SAAS,CAACqD,UAAU,CAAC;AAEpD;AAAA3B,OAAA,CAAA2B,UAAA,GAAAA,UAAA;AACO,MAAMf,IAAI,GACXF,KAAqB,IAAK,CAAC,GAAGkB,QAAkB,KAClDd,YAAY,CAACJ,KAAK,CAAC,CAACkB,QAAQ,CAAC;AAEjC;AAAA5B,OAAA,CAAAY,IAAA,GAAAA,IAAA;AACO,MAAMiB,KAAK,GAAA7B,OAAA,CAAA6B,KAAA,gBAAG,IAAA1D,SAAA,CAAA2D,IAAI,EAGvB,CAAC,EAAE,CAACJ,IAAI,EAAEP,KAAK,KACf3C,IAAI,CAACuD,MAAM,CAACL,IAAI,CAACnB,GAAG,EAAGM,GAAG,IACxBvC,SAAS,CAACuB,GAAG,CACXgB,GAAG,EACHM,KAAK,EACL/C,MAAM,CAACgD,KAAK,CAAC9C,SAAS,CAACW,GAAG,CAAC4B,GAAG,EAAEM,KAAK,CAAC,EAAE;EACtCE,MAAM,EAAEA,CAAA,KAAMhD,aAAa,CAACiD,EAAE,CAACH,KAAK,CAAC;EACrCI,MAAM,EAAElD,aAAa,CAACmD,OAAO,CAACL,KAAK;CACpC,CAAC,CACH,CAAC,CAAC;AAEP;AACO,MAAMa,QAAQ,GAAAhC,OAAA,CAAAgC,QAAA,gBAAG,IAAA7D,SAAA,CAAA2D,IAAI,EAG1B,CAAC,EAAE,CAACJ,IAAI,EAAEO,MAAM,KAChBzD,IAAI,CAACuD,MAAM,CAACL,IAAI,CAACnB,GAAG,EAAGM,GAAG,IACxBG,KAAK,CAACC,IAAI,CAACgB,MAAM,CAAC,CAACf,MAAM,CACvB,CAACL,GAAG,EAAEM,KAAK,KACT7C,SAAS,CAACuB,GAAG,CACXgB,GAAG,EACHM,KAAK,EACL/C,MAAM,CAACgD,KAAK,CAAC9C,SAAS,CAACW,GAAG,CAAC4B,GAAG,EAAEM,KAAK,CAAC,EAAE;EACtCE,MAAM,EAAEA,CAAA,KAAMhD,aAAa,CAACiD,EAAE,CAACH,KAAK,CAAC;EACrCI,MAAM,EAAElD,aAAa,CAACmD,OAAO,CAACL,KAAK;CACpC,CAAC,CACH,EACHN,GAAG,CACJ,CAAC,CAAC;AAEP;AACO,MAAMqB,IAAI,GAAOR,IAAsC,IAC5DnD,IAAI,CAAC4D,cAAc,CAAEC,OAAO,IAAI;EAC9B,MAAMvB,GAAG,GAAGrC,IAAI,CAAC6D,SAAS,CAACX,IAAI,CAACnB,GAAG,EAAE6B,OAAO,CAACE,OAAO,CAAC;EACrD,OAAOlE,MAAM,CAACgD,KAAK,CACjB9C,SAAS,CAACiE,UAAU,CAAC1B,GAAG,CAAC,EACzB;IACEQ,MAAM,EAAEA,CAAA,KAAM9C,IAAI,CAACiE,KAAK;IACxBjB,MAAM,EAAGK,QAAQ,IAAKrD,IAAI,CAACkE,OAAO,CAACb,QAAQ,CAAC,CAAC,CAAC;GAC/C,CACF;AACH,CAAC,CAAC;AAEJ;AAAA5B,OAAA,CAAAkC,IAAA,GAAAA,IAAA;AACO,MAAMQ,UAAU,GAAOhB,IAAsC,IAClElD,IAAI,CAACmE,MAAM,CAACjB,IAAI,CAACnB,GAAG,EAAGM,GAAG,IAAK,CAC7BzC,MAAM,CAACyC,GAAG,CAACvC,SAAS,CAACiE,UAAU,CAAC1B,GAAG,CAAC,EAAGe,QAAQ,IAAKA,QAAQ,CAAC,CAAC,CAAC,CAAC,EAChEf,GAAG,CACJ,CAAC;AAEJ;AAAAb,OAAA,CAAA0C,UAAA,GAAAA,UAAA;AACO,MAAME,QAAQ,GAAA5C,OAAA,CAAA4C,QAAA,gBAAG,IAAAzE,SAAA,CAAA2D,IAAI,EAG1B,CAAC,EAAE,CAACJ,IAAI,EAAEmB,SAAS,KAAKC,QAAQ,CAACpB,IAAI,EAAGtC,CAAC,IAAK,CAACyD,SAAS,CAACzD,CAAC,CAAC,CAAC,CAAC;AAE/D;AACO,MAAM0D,QAAQ,GAAA9C,OAAA,CAAA8C,QAAA,gBAAG,IAAA3E,SAAA,CAAA2D,IAAI,EAI1B,CAAC,EACD,CAAIJ,IAAsC,EAAEmB,SAAuB,KACjErE,IAAI,CAACuD,MAAM,CACTL,IAAI,CAACnB,GAAG,EACPM,GAAG,IACFvC,SAAS,CAAC4C,MAAM,CAACL,GAAG,EAAEvC,SAAS,CAACmC,KAAK,CAACnC,SAAS,CAACyE,QAAQ,CAAClC,GAAG,CAAC,CAAC,EAAE,CAACA,GAAG,EAAEM,KAAK,EAAE6B,GAAG,KAAI;EAClF,MAAMC,QAAQ,GAAqB5E,aAAa,CAAC6E,MAAM,CAAC/B,KAAK,EAAE0B,SAAS,CAAC;EACzE,OAAOI,QAAQ,CAACE,MAAM,GAAG,CAAC,GACxB7E,SAAS,CAACuB,GAAG,CAACgB,GAAG,EAAEmC,GAAG,EAAEC,QAA4B,CAAC,GACrD3E,SAAS,CAAC8E,MAAM,CAACvC,GAAG,EAAEmC,GAAG,CAAC;AAC9B,CAAC,CAAC,CACL,CACJ;AAED;AACO,MAAMK,IAAI,GAAO3B,IAAsC,IAC5DlD,IAAI,CAACmE,MAAM,CACTjB,IAAI,CAACnB,GAAG,EACPM,GAAG,IAAK,CAACvC,SAAS,CAAC4C,MAAM,CAACL,GAAG,EAAE,CAAC,EAAE,CAAC3B,CAAC,EAAEoE,EAAE,KAAKpE,CAAC,GAAGoE,EAAE,CAACH,MAAM,CAAC,EAAEtC,GAAG,CAAC,CACnE;AAEH;AAAAb,OAAA,CAAAqD,IAAA,GAAAA,IAAA;AACO,MAAME,IAAI,GAAO7B,IAAsC,IAC5DnD,IAAI,CAAC4D,cAAc,CAAEC,OAAO,IAAI;EAC9B,MAAMvB,GAAG,GAAGrC,IAAI,CAAC6D,SAAS,CAACX,IAAI,CAACnB,GAAG,EAAE6B,OAAO,CAACE,OAAO,CAAC;EACrD,OAAOlE,MAAM,CAACgD,KAAK,CAAC9C,SAAS,CAACiE,UAAU,CAAC1B,GAAG,CAAC,EAAE;IAC7CQ,MAAM,EAAEA,CAAA,KAAM9C,IAAI,CAACiE,KAAK;IACxBjB,MAAM,EAAGU,MAAM,IAAI;MACjB,MAAMuB,IAAI,GAAGvB,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;MACzB,MAAMwB,IAAI,GAAGxB,MAAM,CAAC,CAAC,CAAC,CAACyB,KAAK,CAAC,CAAC,CAAC;MAC/BlF,IAAI,CAACmF,SAAS,CACZjC,IAAI,CAACnB,GAAG,EACRkD,IAAI,CAACN,MAAM,GAAG,CAAC,GACb7E,SAAS,CAACuB,GAAG,CAACgB,GAAG,EAAE2C,IAAI,EAAEC,IAAwB,CAAC,GAClDnF,SAAS,CAAC8E,MAAM,CAACvC,GAAG,EAAE2C,IAAI,CAAC,EAC7BpB,OAAO,CAACE,OAAO,CAChB;MACD,OAAO/D,IAAI,CAACkE,OAAO,CAACe,IAAI,CAAC;IAC3B;GACD,CAAC;AACJ,CAAC,CAAC;AAEJ;AAAAxD,OAAA,CAAAuD,IAAA,GAAAA,IAAA;AACO,MAAMK,OAAO,GAAOlC,IAAsC,IAC/DlD,IAAI,CAACmE,MAAM,CAACjB,IAAI,CAACnB,GAAG,EAAGM,GAAG,IAAI;EAC5B,MAAMgD,OAAO,GAAa,EAAE;EAC5B,KAAK,MAAMC,KAAK,IAAIjD,GAAG,EAAE;IACvBgD,OAAO,CAACE,IAAI,CAAC,GAAGD,KAAK,CAAC,CAAC,CAAC,CAAC;EAC3B;EACA,OAAO,CAACD,OAAO,EAAEvF,SAAS,CAACmC,KAAK,CAACnC,SAAS,CAACyE,QAAQ,CAAClC,GAAG,CAAC,CAAC,CAAC;AAC5D,CAAC,CAAC;AAEJ;AAAAb,OAAA,CAAA4D,OAAA,GAAAA,OAAA;AACO,MAAMI,UAAU,GAAOtC,IAAsC,IAClEnD,IAAI,CAAC0F,MAAM,CAA2B3B,OAAO,IAAI;EAC/C,MAAMzB,GAAG,GAAG,IAAA1C,SAAA,CAAAwC,IAAI,EAACe,IAAI,CAACnB,GAAG,EAAE/B,IAAI,CAAC6D,SAAS,CAACC,OAAO,CAAC,CAAC;EACnD,OAAOlE,MAAM,CAACgD,KAAK,CAAC9C,SAAS,CAACiE,UAAU,CAAC1B,GAAG,CAAC,EAAE;IAC7CQ,MAAM,EAAEA,CAAA,KAAwBjD,MAAM,CAAC8F,IAAI,EAAE;IAC7C3C,MAAM,EAAEA,CAAC,CAACyB,GAAG,EAAE7B,KAAK,CAAC,KAAI;MACvB,MAAMsC,IAAI,GAAGtC,KAAK,CAACuC,KAAK,CAAC,CAAC,CAAC;MAC3BlF,IAAI,CAACmF,SAAS,CACZjC,IAAI,CAACnB,GAAG,EACRkD,IAAI,CAACN,MAAM,GAAG,CAAC,GACb7E,SAAS,CAACuB,GAAG,CAACgB,GAAG,EAAEmC,GAAG,EAAES,IAAwB,CAAC,GACjDnF,SAAS,CAAC8E,MAAM,CAACvC,GAAG,EAAEmC,GAAG,CAAC,EAC5BV,OAAO,CACR;MACD,OAAOlE,MAAM,CAAC+F,IAAI,CAAChD,KAAK,CAAC,CAAC,CAAC,CAAC;IAC9B;GACD,CAAC;AACJ,CAAC,CAAC;AAEJ;AAAAnB,OAAA,CAAAgE,UAAA,GAAAA,UAAA;AACO,MAAMI,QAAQ,GAAApE,OAAA,CAAAoE,QAAA,gBAAG,IAAAjG,SAAA,CAAA2D,IAAI,EAG1B,CAAC,EAAE,CAAIJ,IAAsC,EAAExC,CAAS,KACxDV,IAAI,CAACmE,MAAM,CAACjB,IAAI,CAACnB,GAAG,EAAGM,GAAG,IAAI;EAC5B,MAAMgD,OAAO,GAAa,EAAE;EAC5B,MAAMQ,QAAQ,GAAGxD,GAAG,CAACZ,MAAM,CAACoE,QAAQ,CAAC,EAAE;EACvC,IAAIC,OAAO,GAAGzD,GAAG;EACjB,IAAI0D,KAAK,GAAG,CAAC;EACb,IAAIC,IAAyD;EAC7D,OAAO,CAACA,IAAI,GAAGH,QAAQ,CAACG,IAAI,EAAE,KAAK,CAACA,IAAI,CAACC,IAAI,IAAIF,KAAK,GAAGrF,CAAC,EAAE;IAC1D,MAAM,CAAC8D,GAAG,EAAE7B,KAAK,CAAC,GAAGqD,IAAI,CAACrD,KAAK;IAC/B,MAAM,CAACuD,IAAI,EAAEC,KAAK,CAAC,GAAG,IAAAxG,SAAA,CAAAwC,IAAI,EAACQ,KAAK,EAAE9C,aAAa,CAACuG,OAAO,CAAC1F,CAAC,GAAGqF,KAAK,CAAC,CAAC;IACnEV,OAAO,CAACE,IAAI,CAAC,GAAGW,IAAI,CAAC;IACrB,IAAIC,KAAK,CAACxB,MAAM,GAAG,CAAC,EAAE;MACpBmB,OAAO,GAAGhG,SAAS,CAACuB,GAAG,CAACyE,OAAO,EAAEtB,GAAG,EAAE2B,KAAyB,CAAC;IAClE,CAAC,MAAM;MACLL,OAAO,GAAGhG,SAAS,CAAC8E,MAAM,CAACkB,OAAO,EAAEtB,GAAG,CAAC;IAC1C;IACAuB,KAAK,GAAGA,KAAK,GAAGG,IAAI,CAACvB,MAAM;EAC7B;EACA,OAAO,CAACU,OAAO,EAAES,OAAO,CAAC;AAC3B,CAAC,CAAC,CAAC;AAEL;AACO,MAAMO,OAAO,GAAOnD,IAAsC,IAC/DlD,IAAI,CAACmE,MAAM,CAACjB,IAAI,CAACnB,GAAG,EAAGM,GAAG,IAAI;EAC5B,MAAMgD,OAAO,GAAa,EAAE;EAC5B,KAAK,MAAMC,KAAK,IAAIjD,GAAG,EAAE;IACvBgD,OAAO,CAACE,IAAI,CAAC,GAAGD,KAAK,CAAC,CAAC,CAAC,CAAC;EAC3B;EACA,OAAO,CAAC9F,KAAK,CAAC8G,eAAe,CAACjB,OAAO,CAAC,EAAEhD,GAAG,CAAC;AAC9C,CAAC,CAAC;AAEJ;AAAAb,OAAA,CAAA6E,OAAA,GAAAA,OAAA;AACO,MAAME,OAAO,GAAOrD,IAAsC,IAC/DlD,IAAI,CAACmE,MAAM,CAACjB,IAAI,CAACnB,GAAG,EAAGM,GAAG,IAAI;EAC5B,MAAMgD,OAAO,GAAa,EAAE;EAC5B,KAAK,MAAMC,KAAK,IAAIjD,GAAG,EAAE;IACvBgD,OAAO,CAACE,IAAI,CAAC,GAAGD,KAAK,CAAC,CAAC,CAAC,CAAC;EAC3B;EACA,OAAO,CAACD,OAAO,EAAEhD,GAAG,CAAC;AACvB,CAAC,CAAC;AAAAb,OAAA,CAAA+E,OAAA,GAAAA,OAAA"}

package/dist/cjs/internal/stm/tPubSub.js

@@ -0,0 +1,421 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.unbounded = exports.subscribeScoped = exports.subscribe = exports.sliding = exports.size = exports.shutdown = exports.publishAll = exports.publish = exports.makeNode = exports.isShutdown = exports.isFull = exports.isEmpty = exports.dropping = exports.capacity = exports.bounded = exports.awaitShutdown = exports.TPubSubTypeId = void 0;
+var Effect = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("../../Effect.js"));
+var _Function = /*#__PURE__*/require("../../Function.js");
+var HashSet = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("../../HashSet.js"));
+var Option = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("../../Option.js"));
+var RA = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("../../ReadonlyArray.js"));
+var core = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./core.js"));
+var OpCodes = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./opCodes/strategy.js"));
+var stm = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./stm.js"));
+var tQueue = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./tQueue.js"));
+var tRef = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./tRef.js"));
+function _getRequireWildcardCache(e) {
+  if ("function" != typeof WeakMap) return null;
+  var r = new WeakMap(),
+    t = new WeakMap();
+  return (_getRequireWildcardCache = function (e) {
+    return e ? t : r;
+  })(e);
+}
+function _interopRequireWildcard(e, r) {
+  if (!r && e && e.__esModule) return e;
+  if (null === e || "object" != typeof e && "function" != typeof e) return {
+    default: e
+  };
+  var t = _getRequireWildcardCache(r);
+  if (t && t.has(e)) return t.get(e);
+  var n = {
+      __proto__: null
+    },
+    a = Object.defineProperty && Object.getOwnPropertyDescriptor;
+  for (var u in e) if ("default" !== u && Object.prototype.hasOwnProperty.call(e, u)) {
+    var i = a ? Object.getOwnPropertyDescriptor(e, u) : null;
+    i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u];
+  }
+  return n.default = e, t && t.set(e, n), n;
+}
+/** @internal */
+const TPubSubSymbolKey = "effect/TPubSub";
+/** @internal */
+const TPubSubTypeId = exports.TPubSubTypeId = /*#__PURE__*/Symbol.for(TPubSubSymbolKey);
+const AbsentValue = /*#__PURE__*/Symbol.for("effect/TPubSub/AbsentValue");
+/** @internal */
+const makeNode = (head, subscribers, tail) => ({
+  head,
+  subscribers,
+  tail
+});
+/** @internal */
+exports.makeNode = makeNode;
+class TPubSubImpl {
+  pubsubSize;
+  publisherHead;
+  publisherTail;
+  requestedCapacity;
+  strategy;
+  subscriberCount;
+  subscribers;
+  [TPubSubTypeId] = {
+    _A: _ => _
+  };
+  [tQueue.TEnqueueTypeId] = tQueue.tEnqueueVariance;
+  constructor(pubsubSize, publisherHead, publisherTail, requestedCapacity, strategy, subscriberCount, subscribers) {
+    this.pubsubSize = pubsubSize;
+    this.publisherHead = publisherHead;
+    this.publisherTail = publisherTail;
+    this.requestedCapacity = requestedCapacity;
+    this.strategy = strategy;
+    this.subscriberCount = subscriberCount;
+    this.subscribers = subscribers;
+  }
+  isShutdown = core.effect(journal => {
+    const currentPublisherTail = tRef.unsafeGet(this.publisherTail, journal);
+    return currentPublisherTail === undefined;
+  });
+  awaitShutdown = core.flatMap(this.isShutdown, isShutdown => isShutdown ? stm.unit : core.retry);
+  capacity() {
+    return this.requestedCapacity;
+  }
+  size = core.withSTMRuntime(runtime => {
+    const currentPublisherTail = tRef.unsafeGet(this.publisherTail, runtime.journal);
+    if (currentPublisherTail === undefined) {
+      return core.interruptAs(runtime.fiberId);
+    }
+    return core.succeed(tRef.unsafeGet(this.pubsubSize, runtime.journal));
+  });
+  isEmpty = core.map(this.size, size => size === 0);
+  isFull = core.map(this.size, size => size === this.capacity());
+  offer(value) {
+    return core.withSTMRuntime(runtime => {
+      const currentPublisherTail = tRef.unsafeGet(this.publisherTail, runtime.journal);
+      if (currentPublisherTail === undefined) {
+        return core.interruptAs(runtime.fiberId);
+      }
+      const currentSubscriberCount = tRef.unsafeGet(this.subscriberCount, runtime.journal);
+      if (currentSubscriberCount === 0) {
+        return core.succeed(true);
+      }
+      const currentPubSubSize = tRef.unsafeGet(this.pubsubSize, runtime.journal);
+      if (currentPubSubSize < this.requestedCapacity) {
+        const updatedPublisherTail = new tRef.TRefImpl(void 0);
+        const updatedNode = makeNode(value, currentSubscriberCount, updatedPublisherTail);
+        tRef.unsafeSet(currentPublisherTail, updatedNode, runtime.journal);
+        tRef.unsafeSet(this.publisherTail, updatedPublisherTail, runtime.journal);
+        tRef.unsafeSet(this.pubsubSize, currentPubSubSize + 1, runtime.journal);
+        return core.succeed(true);
+      }
+      switch (this.strategy._tag) {
+        case OpCodes.OP_BACKPRESSURE_STRATEGY:
+          {
+            return core.retry;
+          }
+        case OpCodes.OP_DROPPING_STRATEGY:
+          {
+            return core.succeed(false);
+          }
+        case OpCodes.OP_SLIDING_STRATEGY:
+          {
+            if (this.requestedCapacity > 0) {
+              let currentPublisherHead = tRef.unsafeGet(this.publisherHead, runtime.journal);
+              let loop = true;
+              while (loop) {
+                const node = tRef.unsafeGet(currentPublisherHead, runtime.journal);
+                if (node === undefined) {
+                  return core.retry;
+                }
+                const head = node.head;
+                const tail = node.tail;
+                if (head !== AbsentValue) {
+                  const updatedNode = makeNode(AbsentValue, node.subscribers, node.tail);
+                  tRef.unsafeSet(currentPublisherHead, updatedNode, runtime.journal);
+                  tRef.unsafeSet(this.publisherHead, tail, runtime.journal);
+                  loop = false;
+                } else {
+                  currentPublisherHead = tail;
+                }
+              }
+            }
+            const updatedPublisherTail = new tRef.TRefImpl(void 0);
+            const updatedNode = makeNode(value, currentSubscriberCount, updatedPublisherTail);
+            tRef.unsafeSet(currentPublisherTail, updatedNode, runtime.journal);
+            tRef.unsafeSet(this.publisherTail, updatedPublisherTail, runtime.journal);
+            return core.succeed(true);
+          }
+      }
+    });
+  }
+  offerAll(iterable) {
+    return core.map(stm.forEach(iterable, a => this.offer(a)), RA.every(_Function.identity));
+  }
+  shutdown = core.effect(journal => {
+    const currentPublisherTail = tRef.unsafeGet(this.publisherTail, journal);
+    if (currentPublisherTail !== undefined) {
+      tRef.unsafeSet(this.publisherTail, void 0, journal);
+      const currentSubscribers = tRef.unsafeGet(this.subscribers, journal);
+      HashSet.forEach(currentSubscribers, subscriber => {
+        tRef.unsafeSet(subscriber, void 0, journal);
+      });
+      tRef.unsafeSet(this.subscribers, HashSet.empty(), journal);
+    }
+  });
+}
+/** @internal */
+class TPubSubSubscriptionImpl {
+  pubsubSize;
+  publisherHead;
+  requestedCapacity;
+  subscriberHead;
+  subscriberCount;
+  subscribers;
+  [TPubSubTypeId] = TPubSubTypeId;
+  [tQueue.TDequeueTypeId] = tQueue.tDequeueVariance;
+  constructor(pubsubSize, publisherHead, requestedCapacity, subscriberHead, subscriberCount, subscribers) {
+    this.pubsubSize = pubsubSize;
+    this.publisherHead = publisherHead;
+    this.requestedCapacity = requestedCapacity;
+    this.subscriberHead = subscriberHead;
+    this.subscriberCount = subscriberCount;
+    this.subscribers = subscribers;
+  }
+  isShutdown = core.effect(journal => {
+    const currentSubscriberHead = tRef.unsafeGet(this.subscriberHead, journal);
+    return currentSubscriberHead === undefined;
+  });
+  awaitShutdown = core.flatMap(this.isShutdown, isShutdown => isShutdown ? stm.unit : core.retry);
+  capacity() {
+    return this.requestedCapacity;
+  }
+  size = core.withSTMRuntime(runtime => {
+    let currentSubscriberHead = tRef.unsafeGet(this.subscriberHead, runtime.journal);
+    if (currentSubscriberHead === undefined) {
+      return core.interruptAs(runtime.fiberId);
+    }
+    let loop = true;
+    let size = 0;
+    while (loop) {
+      const node = tRef.unsafeGet(currentSubscriberHead, runtime.journal);
+      if (node === undefined) {
+        loop = false;
+      } else {
+        const head = node.head;
+        const tail = node.tail;
+        if (head !== AbsentValue) {
+          size = size + 1;
+          if (size >= Number.MAX_SAFE_INTEGER) {
+            loop = false;
+          }
+        }
+        currentSubscriberHead = tail;
+      }
+    }
+    return core.succeed(size);
+  });
+  isEmpty = core.map(this.size, size => size === 0);
+  isFull = core.map(this.size, size => size === this.capacity());
+  peek = core.withSTMRuntime(runtime => {
+    let currentSubscriberHead = tRef.unsafeGet(this.subscriberHead, runtime.journal);
+    if (currentSubscriberHead === undefined) {
+      return core.interruptAs(runtime.fiberId);
+    }
+    let value = AbsentValue;
+    let loop = true;
+    while (loop) {
+      const node = tRef.unsafeGet(currentSubscriberHead, runtime.journal);
+      if (node === undefined) {
+        return core.retry;
+      }
+      const head = node.head;
+      const tail = node.tail;
+      if (head !== AbsentValue) {
+        value = head;
+        loop = false;
+      } else {
+        currentSubscriberHead = tail;
+      }
+    }
+    return core.succeed(value);
+  });
+  peekOption = core.withSTMRuntime(runtime => {
+    let currentSubscriberHead = tRef.unsafeGet(this.subscriberHead, runtime.journal);
+    if (currentSubscriberHead === undefined) {
+      return core.interruptAs(runtime.fiberId);
+    }
+    let value = Option.none();
+    let loop = true;
+    while (loop) {
+      const node = tRef.unsafeGet(currentSubscriberHead, runtime.journal);
+      if (node === undefined) {
+        value = Option.none();
+        loop = false;
+      } else {
+        const head = node.head;
+        const tail = node.tail;
+        if (head !== AbsentValue) {
+          value = Option.some(head);
+          loop = false;
+        } else {
+          currentSubscriberHead = tail;
+        }
+      }
+    }
+    return core.succeed(value);
+  });
+  shutdown = core.effect(journal => {
+    let currentSubscriberHead = tRef.unsafeGet(this.subscriberHead, journal);
+    if (currentSubscriberHead !== undefined) {
+      tRef.unsafeSet(this.subscriberHead, void 0, journal);
+      let loop = true;
+      while (loop) {
+        const node = tRef.unsafeGet(currentSubscriberHead, journal);
+        if (node === undefined) {
+          loop = false;
+        } else {
+          const head = node.head;
+          const tail = node.tail;
+          if (head !== AbsentValue) {
+            const subscribers = node.subscribers;
+            if (subscribers === 1) {
+              const size = tRef.unsafeGet(this.pubsubSize, journal);
+              const updatedNode = makeNode(AbsentValue, 0, tail);
+              tRef.unsafeSet(currentSubscriberHead, updatedNode, journal);
+              tRef.unsafeSet(this.publisherHead, tail, journal);
+              tRef.unsafeSet(this.pubsubSize, size - 1, journal);
+            } else {
+              const updatedNode = makeNode(head, subscribers - 1, tail);
+              tRef.unsafeSet(currentSubscriberHead, updatedNode, journal);
+            }
+          }
+          currentSubscriberHead = tail;
+        }
+      }
+      const currentSubscriberCount = tRef.unsafeGet(this.subscriberCount, journal);
+      tRef.unsafeSet(this.subscriberCount, currentSubscriberCount - 1, journal);
+      tRef.unsafeSet(this.subscribers, HashSet.remove(tRef.unsafeGet(this.subscribers, journal), this.subscriberHead), journal);
+    }
+  });
+  take = core.withSTMRuntime(runtime => {
+    let currentSubscriberHead = tRef.unsafeGet(this.subscriberHead, runtime.journal);
+    if (currentSubscriberHead === undefined) {
+      return core.interruptAs(runtime.fiberId);
+    }
+    let value = AbsentValue;
+    let loop = true;
+    while (loop) {
+      const node = tRef.unsafeGet(currentSubscriberHead, runtime.journal);
+      if (node === undefined) {
+        return core.retry;
+      }
+      const head = node.head;
+      const tail = node.tail;
+      if (head !== AbsentValue) {
+        const subscribers = node.subscribers;
+        if (subscribers === 1) {
+          const size = tRef.unsafeGet(this.pubsubSize, runtime.journal);
+          const updatedNode = makeNode(AbsentValue, 0, tail);
+          tRef.unsafeSet(currentSubscriberHead, updatedNode, runtime.journal);
+          tRef.unsafeSet(this.publisherHead, tail, runtime.journal);
+          tRef.unsafeSet(this.pubsubSize, size - 1, runtime.journal);
+        } else {
+          const updatedNode = makeNode(head, subscribers - 1, tail);
+          tRef.unsafeSet(currentSubscriberHead, updatedNode, runtime.journal);
+        }
+        tRef.unsafeSet(this.subscriberHead, tail, runtime.journal);
+        value = head;
+        loop = false;
+      } else {
+        currentSubscriberHead = tail;
+      }
+    }
+    return core.succeed(value);
+  });
+  takeAll = this.takeUpTo(Number.POSITIVE_INFINITY);
+  takeUpTo(max) {
+    return core.withSTMRuntime(runtime => {
+      let currentSubscriberHead = tRef.unsafeGet(this.subscriberHead, runtime.journal);
+      if (currentSubscriberHead === undefined) {
+        return core.interruptAs(runtime.fiberId);
+      }
+      const builder = [];
+      let n = 0;
+      while (n !== max) {
+        const node = tRef.unsafeGet(currentSubscriberHead, runtime.journal);
+        if (node === undefined) {
+          n = max;
+        } else {
+          const head = node.head;
+          const tail = node.tail;
+          if (head !== AbsentValue) {
+            const subscribers = node.subscribers;
+            if (subscribers === 1) {
+              const size = tRef.unsafeGet(this.pubsubSize, runtime.journal);
+              const updatedNode = makeNode(AbsentValue, 0, tail);
+              tRef.unsafeSet(currentSubscriberHead, updatedNode, runtime.journal);
+              tRef.unsafeSet(this.publisherHead, tail, runtime.journal);
+              tRef.unsafeSet(this.pubsubSize, size - 1, runtime.journal);
+            } else {
+              const updatedNode = makeNode(head, subscribers - 1, tail);
+              tRef.unsafeSet(currentSubscriberHead, updatedNode, runtime.journal);
+            }
+            builder.push(head);
+            n = n + 1;
+          }
+          currentSubscriberHead = tail;
+        }
+      }
+      tRef.unsafeSet(this.subscriberHead, currentSubscriberHead, runtime.journal);
+      return core.succeed(builder);
+    });
+  }
+}
+/** @internal */
+const makeTPubSub = (requestedCapacity, strategy) => (0, _Function.pipe)(stm.all([tRef.make(void 0), tRef.make(0)]), core.flatMap(([empty, pubsubSize]) => (0, _Function.pipe)(stm.all([tRef.make(empty), tRef.make(empty), tRef.make(0), tRef.make(HashSet.empty())]), core.map(([publisherHead, publisherTail, subscriberCount, subscribers]) => new TPubSubImpl(pubsubSize, publisherHead, publisherTail, requestedCapacity, strategy, subscriberCount, subscribers)))));
+const makeSubscription = (pubsubSize, publisherHead, publisherTail, requestedCapacity, subscriberCount, subscribers) => (0, _Function.pipe)(tRef.get(publisherTail), core.flatMap(currentPublisherTail => (0, _Function.pipe)(stm.all([tRef.make(currentPublisherTail), tRef.get(subscriberCount), tRef.get(subscribers)]), stm.tap(([_, currentSubscriberCount]) => (0, _Function.pipe)(subscriberCount, tRef.set(currentSubscriberCount + 1))), stm.tap(([subscriberHead, _, currentSubscribers]) => (0, _Function.pipe)(subscribers, tRef.set((0, _Function.pipe)(currentSubscribers, HashSet.add(subscriberHead))))), core.map(([subscriberHead]) => new TPubSubSubscriptionImpl(pubsubSize, publisherHead, requestedCapacity, subscriberHead, subscriberCount, subscribers)))));
+/** @internal */
+const awaitShutdown = self => self.awaitShutdown;
+/** @internal */
+exports.awaitShutdown = awaitShutdown;
+const bounded = requestedCapacity => makeTPubSub(requestedCapacity, tQueue.BackPressure);
+/** @internal */
+exports.bounded = bounded;
+const capacity = self => self.capacity();
+/** @internal */
+exports.capacity = capacity;
+const dropping = requestedCapacity => makeTPubSub(requestedCapacity, tQueue.Dropping);
+/** @internal */
+exports.dropping = dropping;
+const isEmpty = self => self.isEmpty;
+/** @internal */
+exports.isEmpty = isEmpty;
+const isFull = self => self.isFull;
+/** @internal */
+exports.isFull = isFull;
+const isShutdown = self => self.isShutdown;
+/** @internal */
+exports.isShutdown = isShutdown;
+const publish = exports.publish = /*#__PURE__*/(0, _Function.dual)(2, (self, value) => self.offer(value));
+/** @internal */
+const publishAll = exports.publishAll = /*#__PURE__*/(0, _Function.dual)(2, (self, iterable) => self.offerAll(iterable));
+/** @internal */
+const size = self => self.size;
+/** @internal */
+exports.size = size;
+const shutdown = self => self.shutdown;
+/** @internal */
+exports.shutdown = shutdown;
+const sliding = requestedCapacity => makeTPubSub(requestedCapacity, tQueue.Sliding);
+/** @internal */
+exports.sliding = sliding;
+const subscribe = self => makeSubscription(self.pubsubSize, self.publisherHead, self.publisherTail, self.requestedCapacity, self.subscriberCount, self.subscribers);
+/** @internal */
+exports.subscribe = subscribe;
+const subscribeScoped = self => Effect.acquireRelease(subscribe(self), dequeue => tQueue.shutdown(dequeue));
+/** @internal */
+exports.subscribeScoped = subscribeScoped;
+const unbounded = () => makeTPubSub(Number.MAX_SAFE_INTEGER, tQueue.Dropping);
+exports.unbounded = unbounded;
+//# sourceMappingURL=tPubSub.js.map