@lmvz-ds/components 0.12.5 → 0.13.1

package/dist/components/p-UwhTS2ue.js

@@ -1 +0,0 @@
-import{p as t,h as s,d as e,t as i}from"./p-BaPwpeMs.js";import{g as r,b as n,l as o,i as a,c,d as h,m as l,e as m,f as d,h as u,j as v,k as p,n as g,s as f,o as w,p as z,q as y,t as b,u as k,v as x,w as S,x as C,y as E,z as _,A as M,B as P,C as L,D as R,E as T,F as V,G as D,H as O,I as j,J as I,K as A,L as B,M as N,N as $,O as K,P as F,Q as H,R as G,S as Q,T as U,U as W,V as Z,W as q,X as J,Y as X,Z as Y,_ as tt,$ as st,r as et,a0 as it,a1 as rt,a2 as nt,a3 as ot}from"./p-CdofjRtQ.js";import{u as at,o as ct,p as ht,E as lt,a as mt,_ as dt,s as ut,i as vt,d as pt,R as gt,A as ft}from"./p-3I3wZmp8.js";import{T as wt,s as zt}from"./p-CAi33KTt.js";const yt=Symbol.for("effect/Brand/Refined"),bt=(t,s,e,i)=>M({_tag:"Complete",key:t,exit:s,entryStats:e,timeToLiveMillis:i}),kt=(t,s)=>M({_tag:"Pending",key:t,deferred:s}),xt=Symbol.for("effect/Cache/MapKey");class St{current;[xt]=xt;previous=void 0;next=void 0;constructor(t){this.current=t}[j](){return I(N(this.current),B(N(this.previous)),B(N(this.next)),A(this))}[$](t){return this===t||Et(t)&&F(this.current,t.current)&&F(this.previous,t.previous)&&F(this.next,t.next)}}const Ct=t=>new St(t),Et=t=>K(t,xt);class _t{head=void 0;tail=void 0;add(t){if(t!==this.tail)if(void 0===this.tail)this.head=t,this.tail=t;else{const s=t.previous,e=t.next;void 0!==e&&(t.next=void 0,void 0!==s?(s.next=e,e.previous=s):(this.head=e,this.head.previous=void 0)),this.tail.next=t,t.previous=this.tail,this.tail=t}}remove(){const t=this.head;if(void 0!==t){const s=t.next;void 0!==s?(t.next=void 0,this.head=s,this.head.previous=void 0):(this.head=void 0,this.tail=void 0)}return t}}const Mt=Symbol.for("effect/Cache"),Pt={_Key:t=>t,_Error:t=>t,_Value:t=>t},Lt=Symbol.for("effect/ConsumerCache"),Rt={_Key:t=>t,_Error:t=>t,_Value:t=>t},Tt=t=>({loadedMillis:t});class Vt{capacity;context;fiberId;lookup;timeToLive;[Mt]=Pt;[Lt]=Rt;cacheState;constructor(t,s,e,i,r){this.capacity=t,this.context=s,this.fiberId=e,this.lookup=i,this.timeToLive=r,this.cacheState={map:R(),keys:new _t,accesses:mt(),updating:O(!1),hits:0,misses:0}}get(t){return d(this.getEither(t),g)}get cacheStats(){return f((()=>({hits:this.cacheState.hits,misses:this.cacheState.misses,size:w(this.cacheState.map)})))}getOption(t){return z((()=>l(y(this.cacheState.map,t),{onNone:()=>{const s=Ct(t);return this.trackAccess(s),this.trackMiss(),b(k())},onSome:t=>this.resolveMapValue(t)})))}getOptionComplete(t){return z((()=>l(y(this.cacheState.map,t),{onNone:()=>{const s=Ct(t);return this.trackAccess(s),this.trackMiss(),b(k())},onSome:t=>this.resolveMapValue(t,!0)})))}contains(t){return f((()=>x(this.cacheState.map,t)))}entryStats(t){return f((()=>{const s=y(this.cacheState.map,t);if(S(s))switch(s.value._tag){case"Complete":return C(Tt(s.value.entryStats.loadedMillis));case"Pending":return k();case"Refreshing":return C(Tt(s.value.complete.entryStats.loadedMillis))}return k()}))}getEither(t){return z((()=>{const s=t;let e,i,r=E(y(this.cacheState.map,s));return void 0===r&&(i=at(this.fiberId),e=Ct(s),x(this.cacheState.map,s)?r=E(y(this.cacheState.map,s)):_(this.cacheState.map,s,kt(e,i))),void 0===r?(this.trackAccess(e),this.trackMiss(),d(this.lookupValueOf(t,i),n)):P(this.resolveMapValue(r),l({onNone:()=>this.getEither(t),onSome:t=>b(o(t))}))}))}invalidate(t){return f((()=>{L(this.cacheState.map,t)}))}invalidateWhen(t,s){return f((()=>{const e=y(this.cacheState.map,t);S(e)&&"Complete"===e.value._tag&&"Success"===e.value.exit._tag&&s(e.value.exit.value)&&L(this.cacheState.map,t)}))}get invalidateAll(){return f((()=>{this.cacheState.map=R()}))}refresh(t){return T((s=>z((()=>{const e=t,i=at(this.fiberId);let r=E(y(this.cacheState.map,e));if(void 0===r&&(x(this.cacheState.map,e)?r=E(y(this.cacheState.map,e)):_(this.cacheState.map,e,kt(Ct(e),i))),void 0===r)return H(this.lookupValueOf(t,i));switch(r._tag){case"Complete":if(this.hasExpired(s,r.timeToLiveMillis)){const s=E(y(this.cacheState.map,e));return F(s,r)&&L(this.cacheState.map,e),H(this.get(t))}return I(this.lookupValueOf(t,i),G((()=>{const t=E(y(this.cacheState.map,e));if(F(t,r)){const t=((t,s)=>M({_tag:"Refreshing",deferred:t,complete:s}))(i,r);return _(this.cacheState.map,e,t),!0}return!1})),H);case"Pending":case"Refreshing":return dt(r.deferred)}}))))}set(t,s){return T((e=>f((()=>{const i=e.unsafeCurrentTimeMillis(),r=t,n=ut(s),o=bt(Ct(r),n,Tt(i),i+Q(m(this.timeToLive(n))));_(this.cacheState.map,r,o)}))))}get size(){return f((()=>w(this.cacheState.map)))}get values(){return f((()=>{const t=[];for(const s of this.cacheState.map)"Complete"===s[1]._tag&&"Success"===s[1].exit._tag&&t.push(s[1].exit.value);return t}))}get entries(){return f((()=>{const t=[];for(const s of this.cacheState.map)"Complete"===s[1]._tag&&"Success"===s[1].exit._tag&&t.push([s[0],s[1].exit.value]);return t}))}get keys(){return f((()=>{const t=[];for(const s of this.cacheState.map)"Complete"===s[1]._tag&&"Success"===s[1].exit._tag&&t.push(s[0]);return t}))}resolveMapValue(t,s=!1){return T((e=>{switch(t._tag){case"Complete":return this.trackAccess(t.key),this.hasExpired(e,t.timeToLiveMillis)?(L(this.cacheState.map,t.key.current),b(k())):(this.trackHit(),d(t.exit,C));case"Pending":return this.trackAccess(t.key),this.trackHit(),s?b(k()):d(dt(t.deferred),C);case"Refreshing":return this.trackAccess(t.complete.key),this.trackHit(),this.hasExpired(e,t.complete.timeToLiveMillis)?s?b(k()):d(dt(t.deferred),C):d(t.complete.exit,C)}}))}trackHit(){this.cacheState.hits=this.cacheState.hits+1}trackMiss(){this.cacheState.misses=this.cacheState.misses+1}trackAccess(t){if(ct(this.cacheState.accesses,t),V(this.cacheState.updating,!1,!0)){let t=!0;for(;t;){const s=ht(this.cacheState.accesses,lt);s===lt?t=!1:this.cacheState.keys.add(s)}let s=w(this.cacheState.map);for(t=s>this.capacity;t;){const e=this.cacheState.keys.remove();void 0!==e?x(this.cacheState.map,e.current)&&(L(this.cacheState.map,e.current),s-=1,t=s>this.capacity):t=!1}D(this.cacheState.updating,!1)}}hasExpired(t,s){return t.unsafeCurrentTimeMillis()>s}lookupValueOf(t,s){return T((e=>z((()=>{const i=t;return I(this.lookup(t),q(this.context),Z,P((t=>{const r=e.unsafeCurrentTimeMillis(),n=Tt(r),o=bt(Ct(i),t,n,r+Q(m(this.timeToLive(t))));return _(this.cacheState.map,i,o),W(pt(s,t),t)})),U((()=>W(vt(s),f((()=>{L(this.cacheState.map,i)}))))))}))))}}const Dt=t=>{const s=m(t.timeToLive);return(t=>d(u([v(),p]),(([s,e])=>new Vt(t.capacity,s,e,t.lookup,(s=>m(t.timeToLive(s)))))))({capacity:t.capacity,lookup:t.lookup,timeToLive:()=>s})};class Ot extends(wt("FetchError")){}class jt extends(wt("NotFoundError")){}class It extends(wt("ResponseTextError")){constructor(t){super(new Error("Failed to read response text",{cause:t}))}}const At=function(...t){const s=2===t.length?s=>t[0](s)?n(s):o(t[1](s)):s=>l(t[0](s),{onNone:()=>n(s),onSome:o});return Object.assign((t=>r(s(t),a)),{[yt]:yt,option:t=>h(s(t)),either:s,is:t=>c(s(t))})}((function(t){if("string"!=typeof t)return!1;try{return"svg"===(new DOMParser).parseFromString(t,"image/svg+xml").documentElement.nodeName}catch{return!1}}),(()=>[{message:"SVG data is malformed",meta:undefined}]));class Bt extends(wt("BrandValidationError")){constructor(t,s){super(new Error(`Brand validation failed for type ${s}.`,{cause:t}))}}let Nt=null;function $t(){return J((function*(){Nt?yield*Nt.invalidateAll:tt("Attempted to clear icon cache before it was initialized")}))}const Kt=t(class extends gt{intersectionObserver;get el(){return this}icon;weight="medium";size="md";iconData;visible=!1;ariaLabel;get ariaHidden(){return!this.ariaLabel}constructor(t){super(!1),!1!==t&&this.__registerHost(),this.addController(new ft(this))}connectedCallback(){this.waitUntilVisible((()=>{this.visible=!0,this.loadIconPathData()}))}disconnectedCallback(){this.intersectionObserver&&(this.intersectionObserver.disconnect(),this.intersectionObserver=null)}async loadIconPathData(){const{icon:t,visible:s}=this;t&&s&&(this.iconData=await et(function(t){const s=t;return J((function*(){return Nt||(Nt=yield*Dt({capacity:200,timeToLive:st,lookup:t=>J((function*(){const s=t,e=yield*zt(`${s}.svg`,"icons"),i=yield*(r=e,J((function*(){const t=yield*X({try:()=>fetch(r,void 0),catch:t=>new Ot({cause:t})});return 404===t.status?yield*new jt({url:t.url}):t})));var r;const n=yield*(t=>X({try:()=>t.text(),catch:t=>new It(t)}))(i);return yield*(o=n,Y({try:()=>At(o),catch:t=>new Bt(t,"SVGString")}));var o}))})),yield*Nt.get(s)}))}(this.icon).pipe(it((s=>rt(`Error loading icon "${t}":`,s.message,s.cause,s.stack))),nt((()=>ot(At('<svg width="24" height="24" viewBox="0 0 24 24" fill="none" xmlns="http://www.w3.org/2000/svg"></svg>')))))))}render(){return s(e,{key:"50d0f96ec5085a47ca7783e5232dfb503fa32d29",role:"img","aria-hidden":`${this.ariaHidden}`,innerHTML:this.iconData})}waitUntilVisible(t,s=50){"undefined"!=typeof window&&window.IntersectionObserver?(this.intersectionObserver=new IntersectionObserver((s=>{s.some((s=>!!s.isIntersecting&&(this.intersectionObserver.disconnect(),this.intersectionObserver=null,t(),!0)))}),{rootMargin:`${s}px`}),this.intersectionObserver.observe(this.el)):t()}static get assetsDirs(){return["../../assets/icons"]}static get watchers(){return{icon:[{loadIconPathData:0}]}}static get style(){return".sc-lmvz-icon-h{--lmvz-icon-color:var(--lmvz-component-color, var(--lmvz-semantic-color-on-surface-input-primary, #000000));display:inline-block;line-height:0;svg{display:block}svg>path{stroke:var(--lmvz-icon-color);fill:none}}[size='xs'].sc-lmvz-icon-h{svg{width:var(--lmvz-component-icon-size-xs, clamp(0.75rem, 0.69rem + 0.26vw, 1rem));height:var(--lmvz-component-icon-size-xs, clamp(0.75rem, 0.69rem + 0.26vw, 1rem))}}[size='sm'].sc-lmvz-icon-h{svg{width:var(--lmvz-component-icon-size-sm, clamp(0.88rem, 0.81rem + 0.26vw, 1.13rem));height:var(--lmvz-component-icon-size-sm, clamp(0.88rem, 0.81rem + 0.26vw, 1.13rem))}}[size='md'].sc-lmvz-icon-h{svg{width:var(--lmvz-component-icon-size-md, clamp(1rem, 0.88rem + 0.52vw, 1.5rem));height:var(--lmvz-component-icon-size-md, clamp(1rem, 0.88rem + 0.52vw, 1.5rem))}}[size='lg'].sc-lmvz-icon-h{svg{width:var(--lmvz-component-icon-size-lg, clamp(1.5rem, 1.38rem + 0.52vw, 2rem));height:var(--lmvz-component-icon-size-lg, clamp(1.5rem, 1.38rem + 0.52vw, 2rem))}}[size='inherit'].sc-lmvz-icon-h{svg{width:inherit;height:inherit}}[weight='light'].sc-lmvz-icon-h{svg>path{stroke-width:1}}[weight='medium'].sc-lmvz-icon-h{svg>path{stroke-width:1.5}}[weight='bold'].sc-lmvz-icon-h{svg>path{stroke-width:2}}[weight='filled'].sc-lmvz-icon-h{svg>path{stroke-width:2;fill:var(--lmvz-icon-color)}}"}},[514,"lmvz-icon",{icon:[513],weight:[513],size:[513],ariaLabel:[513,"aria-label"],iconData:[32],visible:[32]},void 0,{icon:[{loadIconPathData:0}]}]);function Ft(){"undefined"!=typeof customElements&&["lmvz-icon"].forEach((t=>{"lmvz-icon"===t&&(customElements.get(i(t))||customElements.define(i(t),Kt))}))}export{Kt as L,$t as c,Ft as d}

package/dist/esm/MutableQueue-CNlEFklh.js

@@ -1,431 +0,0 @@
-import { aq as deferredMake, aB as deferredAwait, az as deferredSucceed, bZ as deferredFailCause, aG as deferredUnsafeMake, b_ as deferredInterrupt, b$ as deferredDone, c0 as deferredIsDone, c1 as exitIsFailure, c2 as exitIsSuccess, c3 as exitMatch, c4 as exitFailCause, c5 as exitSucceed, c6 as exitFail, c7 as exitZipRight, c8 as exitCollectAll, c9 as exitVoid, ca as exitDie, cb as exitMap, cc as exitZip, ap as dual, as as pipeArguments, cd as NodeInspectSymbol, ce as toJSON, cf as format, aJ as prepend, aO as empty$1, cg as reverse } from './Effect-BhQLGXPs.js';
-
-/**
- * Creates a new `Deferred`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const make$1 = deferredMake;
-const _await = deferredAwait;
-/**
- * Exits the `Deferred` with the specified `Exit` value, which will be
- * propagated to all fibers waiting on the value of the `Deferred`.
- *
- * @since 2.0.0
- * @category utils
- */
-const done = deferredDone;
-/**
- * Fails the `Deferred` with the specified `Cause`, which will be propagated to
- * all fibers waiting on the value of the `Deferred`.
- *
- * @since 2.0.0
- * @category utils
- */
-const failCause$1 = deferredFailCause;
-/**
- * Completes the `Deferred` with interruption. This will interrupt all fibers
- * waiting on the value of the `Deferred` with the `FiberId` of the fiber
- * calling this method.
- *
- * @since 2.0.0
- * @category utils
- */
-const interrupt = deferredInterrupt;
-/**
- * Returns `true` if this `Deferred` has already been completed with a value or
- * an error, `false` otherwise.
- *
- * @since 2.0.0
- * @category getters
- */
-const isDone = deferredIsDone;
-/**
- * Completes the `Deferred` with the specified value.
- *
- * @since 2.0.0
- * @category utils
- */
-const succeed$1 = deferredSucceed;
-/**
- * Unsafely creates a new `Deferred` from the specified `FiberId`.
- *
- * @since 2.0.0
- * @category unsafe
- */
-const unsafeMake = deferredUnsafeMake;
-
-/**
- * Returns `true` if the specified `Exit` is a `Failure`, `false` otherwise.
- *
- * @since 2.0.0
- * @category refinements
- */
-const isFailure = exitIsFailure;
-/**
- * Returns `true` if the specified `Exit` is a `Success`, `false` otherwise.
- *
- * @since 2.0.0
- * @category refinements
- */
-const isSuccess = exitIsSuccess;
-/**
- * Collects all of the specified exit values into a `Some<Exit<List<A>, E>>`. If
- * the provided iterable contains no elements, `None` will be returned.
- *
- * @since 2.0.0
- * @category constructors
- */
-const all = exitCollectAll;
-/**
- * Constructs a new `Exit.Failure` from the specified unrecoverable defect.
- *
- * @since 2.0.0
- * @category constructors
- */
-const die = exitDie;
-/**
- * Constructs a new `Exit.Failure` from the specified recoverable error of type
- * `E`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const fail = exitFail;
-/**
- * Constructs a new `Exit.Failure` from the specified `Cause` of type `E`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const failCause = exitFailCause;
-/**
- * Maps over the `Success` value of the specified exit using the provided
- * function.
- *
- * @since 2.0.0
- * @category mapping
- */
-const map = exitMap;
-/**
- * @since 2.0.0
- * @category folding
- */
-const match = exitMatch;
-/**
- * Constructs a new `Exit.Success` containing the specified value of type `A`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const succeed = exitSucceed;
-const void_ = exitVoid;
-/**
- * Sequentially zips the this result with the specified result or else returns
- * the failed `Cause<E | E2>`.
- *
- * @since 2.0.0
- * @category zipping
- */
-const zip = exitZip;
-/**
- * Sequentially zips the this result with the specified result discarding the
- * first element of the tuple or else returns the failed `Cause<E | E2>`.
- *
- * @since 2.0.0
- * @category zipping
- */
-const zipRight = exitZipRight;
-
-/**
- * @since 2.0.0
- */
-const TypeId$1 = /*#__PURE__*/Symbol.for("effect/MutableList");
-const MutableListProto = {
-  [TypeId$1]: TypeId$1,
-  [Symbol.iterator]() {
-    let done = false;
-    let head = this.head;
-    return {
-      next() {
-        if (done) {
-          return this.return();
-        }
-        if (head == null) {
-          done = true;
-          return this.return();
-        }
-        const value = head.value;
-        head = head.next;
-        return {
-          done,
-          value
-        };
-      },
-      return(value) {
-        if (!done) {
-          done = true;
-        }
-        return {
-          done: true,
-          value
-        };
-      }
-    };
-  },
-  toString() {
-    return format(this.toJSON());
-  },
-  toJSON() {
-    return {
-      _id: "MutableList",
-      values: Array.from(this).map(toJSON)
-    };
-  },
-  [NodeInspectSymbol]() {
-    return this.toJSON();
-  },
-  pipe() {
-    return pipeArguments(this, arguments);
-  }
-};
-/** @internal */
-const makeNode = value => ({
-  value,
-  removed: false,
-  prev: undefined,
-  next: undefined
-});
-/**
- * Creates an empty `MutableList`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const empty = () => {
-  const list = Object.create(MutableListProto);
-  list.head = undefined;
-  list.tail = undefined;
-  list._length = 0;
-  return list;
-};
-/**
- * Returns `true` if the list contains zero elements, `false`, otherwise.
- *
- * @since 2.0.0
- * @category getters
- */
-const isEmpty$1 = self => length$1(self) === 0;
-/**
- * Returns the length of the list.
- *
- * @since 2.0.0
- * @category getters
- */
-const length$1 = self => self._length;
-/**
- * Appends the specified element to the end of the `MutableList`.
- *
- * @category concatenating
- * @since 2.0.0
- */
-const append = /*#__PURE__*/dual(2, (self, value) => {
-  const node = makeNode(value);
-  if (self.head === undefined) {
-    self.head = node;
-  }
-  if (self.tail === undefined) {
-    self.tail = node;
-  } else {
-    self.tail.next = node;
-    node.prev = self.tail;
-    self.tail = node;
-  }
-  self._length += 1;
-  return self;
-});
-/**
- * Removes the first value from the list and returns it, if it exists.
- *
- * @since 0.0.1
- */
-const shift = self => {
-  const head = self.head;
-  if (head !== undefined) {
-    remove(self, head);
-    return head.value;
-  }
-  return undefined;
-};
-const remove = (self, node) => {
-  if (node.removed) {
-    return;
-  }
-  node.removed = true;
-  if (node.prev !== undefined && node.next !== undefined) {
-    node.prev.next = node.next;
-    node.next.prev = node.prev;
-  } else if (node.prev !== undefined) {
-    self.tail = node.prev;
-    node.prev.next = undefined;
-  } else if (node.next !== undefined) {
-    self.head = node.next;
-    node.next.prev = undefined;
-  } else {
-    self.tail = undefined;
-    self.head = undefined;
-  }
-  if (self._length > 0) {
-    self._length -= 1;
-  }
-};
-
-/**
- * @since 2.0.0
- */
-const TypeId = /*#__PURE__*/Symbol.for("effect/MutableQueue");
-/**
- * @since 2.0.0
- * @category symbol
- */
-const EmptyMutableQueue = /*#__PURE__*/Symbol.for("effect/mutable/MutableQueue/Empty");
-const MutableQueueProto = {
-  [TypeId]: TypeId,
-  [Symbol.iterator]() {
-    return Array.from(this.queue)[Symbol.iterator]();
-  },
-  toString() {
-    return format(this.toJSON());
-  },
-  toJSON() {
-    return {
-      _id: "MutableQueue",
-      values: Array.from(this).map(toJSON)
-    };
-  },
-  [NodeInspectSymbol]() {
-    return this.toJSON();
-  },
-  pipe() {
-    return pipeArguments(this, arguments);
-  }
-};
-const make = capacity => {
-  const queue = Object.create(MutableQueueProto);
-  queue.queue = empty();
-  queue.capacity = capacity;
-  return queue;
-};
-/**
- * Creates a new bounded `MutableQueue`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const bounded = capacity => make(capacity);
-/**
- * Creates a new unbounded `MutableQueue`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const unbounded = () => make(undefined);
-/**
- * Returns the current number of elements in the queue.
- *
- * @since 2.0.0
- * @category getters
- */
-const length = self => length$1(self.queue);
-/**
- * Returns `true` if the queue is empty, `false` otherwise.
- *
- * @since 2.0.0
- * @category getters
- */
-const isEmpty = self => isEmpty$1(self.queue);
-/**
- * The **maximum** number of elements that a queue can hold.
- *
- * **Note**: unbounded queues can still implement this interface with
- * `capacity = Infinity`.
- *
- * @since 2.0.0
- * @category getters
- */
-const capacity = self => self.capacity === undefined ? Infinity : self.capacity;
-/**
- * Offers an element to the queue.
- *
- * Returns whether the enqueue was successful or not.
- *
- * @since 2.0.0
- */
-const offer = /*#__PURE__*/dual(2, (self, value) => {
-  const queueLength = length$1(self.queue);
-  if (self.capacity !== undefined && queueLength === self.capacity) {
-    return false;
-  }
-  append(value)(self.queue);
-  return true;
-});
-/**
- * Enqueues a collection of values into the queue.
- *
- * Returns a `Chunk` of the values that were **not** able to be enqueued.
- *
- * @since 2.0.0
- */
-const offerAll = /*#__PURE__*/dual(2, (self, values) => {
-  const iterator = values[Symbol.iterator]();
-  let next;
-  let remainder = empty$1();
-  let offering = true;
-  while (offering && (next = iterator.next()) && !next.done) {
-    offering = offer(next.value)(self);
-  }
-  while (next != null && !next.done) {
-    remainder = prepend(next.value)(remainder);
-    next = iterator.next();
-  }
-  return reverse(remainder);
-});
-/**
- * Dequeues an element from the queue.
- *
- * Returns either an element from the queue, or the `def` param.
- *
- * **Note**: if there is no meaningful default for your type, you can always
- * use `poll(MutableQueue.EmptyMutableQueue)`.
- *
- * @since 2.0.0
- */
-const poll = /*#__PURE__*/dual(2, (self, def) => {
-  if (isEmpty$1(self.queue)) {
-    return def;
-  }
-  return shift(self.queue);
-});
-/**
- * Dequeues up to `n` elements from the queue.
- *
- * Returns a `List` of up to `n` elements.
- *
- * @since 2.0.0
- */
-const pollUpTo = /*#__PURE__*/dual(2, (self, n) => {
-  let result = empty$1();
-  let count = 0;
-  while (count < n) {
-    const element = poll(EmptyMutableQueue)(self);
-    if (element === EmptyMutableQueue) {
-      break;
-    }
-    result = prepend(element)(result);
-    count += 1;
-  }
-  return reverse(result);
-});
-
-export { zip as A, isSuccess as B, EmptyMutableQueue as E, _await as _, unbounded as a, pollUpTo as b, isEmpty as c, done as d, offerAll as e, bounded as f, capacity as g, isFailure as h, interrupt as i, failCause as j, all as k, length as l, match as m, die as n, offer as o, poll as p, map as q, make$1 as r, succeed as s, isDone as t, unsafeMake as u, void_ as v, succeed$1 as w, failCause$1 as x, fail as y, zipRight as z };

package/dist/esm/_commonjsHelpers-B85MJLTf.js

@@ -1,5 +0,0 @@
-function getDefaultExportFromCjs (x) {
-	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
-}
-
-export { getDefaultExportFromCjs as g };