effect 4.0.0-beta.71 → 4.0.0-beta.73

package/dist/Formatter.js

@@ -67,7 +67,6 @@ import { getRedacted, redact, symbolRedactable } from "./Redactable.js";
  *
  * **Details**
  *
- * - Does not mutate input.
  * - Output is **not** valid JSON; use {@link formatJson} when you need
  *   parseable JSON.
  * - Primitives: stringified naturally (`null`, `undefined`, `123`, `true`).
@@ -217,7 +216,7 @@ function safeToString(input) {
   }
 }
 /**
- * Safely stringifies a value to JSON, silently dropping circular references.
+ * Stringifies a value to JSON safely, silently dropping circular references.
  *
  * **When to use**
  *
@@ -227,7 +226,6 @@ function safeToString(input) {
  *
  * **Details**
  *
- * - Does not mutate input.
  * - Uses `JSON.stringify` internally with a replacer that tracks the
  *   current object ancestry.
  * - Circular references are replaced with `undefined` (omitted from

package/dist/Formatter.js.map

@@ -1 +1 @@
-{"version":3,"file":"Formatter.js","names":["Predicate","getRedacted","redact","symbolRedactable","format","input","options","space","seen","WeakSet","gap","repeat","ind","d","wrap","v","body","ctor","constructor","Object","prototype","name","ownKeys","o","Reflect","recur","Array","isArray","has","CIRCULAR","add","length","map","x","join","inner","Date","formatDate","ignoreToString","hasProperty","toString","s","safeToString","Error","cause","JSON","stringify","String","Symbol","iterator","from","keys","k","formatPropertyKey","formatPath","path","key","date","toISOString","formatJson","ancestors","_key","value","redacted","pop","includes","undefined","push"],"sources":["../src/Formatter.ts"],"sourcesContent":[null],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsDA,OAAO,KAAKA,SAAS,MAAM,gBAAgB;AAC3C,SAASC,WAAW,EAAEC,MAAM,EAAEC,gBAAgB,QAAQ,iBAAiB;AAiCvE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwEA,OAAM,SAAUC,MAAMA,CAACC,KAAc,EAAEC,OAGtC;EACC,MAAMC,KAAK,GAAGD,OAAO,EAAEC,KAAK,IAAI,CAAC;EACjC,MAAMC,IAAI,GAAG,IAAIC,OAAO,EAAU;EAClC,MAAMC,GAAG,GAAG,CAACH,KAAK,GAAG,EAAE,GAAI,OAAOA,KAAK,KAAK,QAAQ,GAAG,GAAG,CAACI,MAAM,CAACJ,KAAK,CAAC,GAAGA,KAAM;EACjF,MAAMK,GAAG,GAAIC,CAAS,IAAKH,GAAG,CAACC,MAAM,CAACE,CAAC,CAAC;EAExC,MAAMC,IAAI,GAAGA,CAACC,CAAU,EAAEC,IAAY,KAAY;IAChD,MAAMC,IAAI,GAAIF,CAAS,EAAEG,WAAW;IACpC,OAAOD,IAAI,IAAIA,IAAI,KAAKE,MAAM,CAACC,SAAS,CAACF,WAAW,IAAID,IAAI,CAACI,IAAI,GAAG,GAAGJ,IAAI,CAACI,IAAI,IAAIL,IAAI,GAAG,GAAGA,IAAI;EACpG,CAAC;EAED,MAAMM,OAAO,GAAIC,CAAS,IAAwB;IAChD,IAAI;MACF,OAAOC,OAAO,CAACF,OAAO,CAACC,CAAC,CAAC;IAC3B,CAAC,CAAC,MAAM;MACN,OAAO,CAAC,iBAAiB,CAAC;IAC5B;EACF,CAAC;EAED,SAASE,KAAKA,CAACV,CAAU,EAAEF,CAAC,GAAG,CAAC;IAC9B,IAAIa,KAAK,CAACC,OAAO,CAACZ,CAAC,CAAC,EAAE;MACpB,IAAIP,IAAI,CAACoB,GAAG,CAACb,CAAC,CAAC,EAAE,OAAOc,QAAQ;MAChCrB,IAAI,CAACsB,GAAG,CAACf,CAAC,CAAC;MACX,IAAI,CAACL,GAAG,IAAIK,CAAC,CAACgB,MAAM,IAAI,CAAC,EAAE,OAAO,IAAIhB,CAAC,CAACiB,GAAG,CAAEC,CAAC,IAAKR,KAAK,CAACQ,CAAC,EAAEpB,CAAC,CAAC,CAAC,CAACqB,IAAI,CAAC,GAAG,CAAC,GAAG;MAC5E,MAAMC,KAAK,GAAGpB,CAAC,CAACiB,GAAG,CAAEC,CAAC,IAAKR,KAAK,CAACQ,CAAC,EAAEpB,CAAC,GAAG,CAAC,CAAC,CAAC,CAACqB,IAAI,CAAC,KAAK,GAAGtB,GAAG,CAACC,CAAC,GAAG,CAAC,CAAC,CAAC;MACpE,OAAO,MAAMD,GAAG,CAACC,CAAC,GAAG,CAAC,CAAC,GAAGsB,KAAK,KAAKvB,GAAG,CAACC,CAAC,CAAC,GAAG;IAC/C;IAEA,IAAIE,CAAC,YAAYqB,IAAI,EAAE,OAAOC,UAAU,CAACtB,CAAC,CAAC;IAE3C,IACE,CAACT,OAAO,EAAEgC,cAAc,IACxBtC,SAAS,CAACuC,WAAW,CAACxB,CAAC,EAAE,UAAU,CAAC,IACpC,OAAOA,CAAC,CAAC,UAAU,CAAC,KAAK,UAAU,IACnCA,CAAC,CAAC,UAAU,CAAC,KAAKI,MAAM,CAACC,SAAS,CAACoB,QAAQ,IAC3CzB,CAAC,CAAC,UAAU,CAAC,KAAKW,KAAK,CAACN,SAAS,CAACoB,QAAQ,EAC1C;MACA,MAAMC,CAAC,GAAGC,YAAY,CAAC3B,CAAC,CAAC;MACzB,IAAIA,CAAC,YAAY4B,KAAK,IAAI5B,CAAC,CAAC6B,KAAK,EAAE;QACjC,OAAO,GAAGH,CAAC,YAAYhB,KAAK,CAACV,CAAC,CAAC6B,KAAK,EAAE/B,CAAC,CAAC,GAAG;MAC7C;MACA,OAAO4B,CAAC;IACV;IAEA,IAAI,OAAO1B,CAAC,KAAK,QAAQ,EAAE,OAAO8B,IAAI,CAACC,SAAS,CAAC/B,CAAC,CAAC;IAEnD,IACE,OAAOA,CAAC,KAAK,QAAQ,IACrBA,CAAC,IAAI,IAAI,IACT,OAAOA,CAAC,KAAK,SAAS,IACtB,OAAOA,CAAC,KAAK,QAAQ,EACrB,OAAOgC,MAAM,CAAChC,CAAC,CAAC;IAElB,IAAI,OAAOA,CAAC,KAAK,QAAQ,EAAE,OAAOgC,MAAM,CAAChC,CAAC,CAAC,GAAG,GAAG;IAEjD,IAAI,OAAOA,CAAC,KAAK,QAAQ,IAAI,OAAOA,CAAC,KAAK,UAAU,EAAE;MACpD,IAAIP,IAAI,CAACoB,GAAG,CAACb,CAAC,CAAC,EAAE,OAAOc,QAAQ;MAChCrB,IAAI,CAACsB,GAAG,CAACf,CAAC,CAAC;MAEX,IAAIZ,gBAAgB,IAAIY,CAAC,EAAE,OAAOX,MAAM,CAACH,WAAW,CAACc,CAAQ,CAAC,CAAC;MAE/D,IAAIiC,MAAM,CAACC,QAAQ,IAAIlC,CAAC,EAAE;QACxB,OAAO,GAAGA,CAAC,CAACG,WAAW,CAACG,IAAI,IAAII,KAAK,CAACC,KAAK,CAACwB,IAAI,CAACnC,CAAQ,CAAC,EAAEF,CAAC,CAAC,GAAG;MACnE;MAEA,MAAMsC,IAAI,GAAG7B,OAAO,CAACP,CAAC,CAAC;MACvB,IAAI,CAACL,GAAG,IAAIyC,IAAI,CAACpB,MAAM,IAAI,CAAC,EAAE;QAC5B,MAAMf,IAAI,GAAG,IAAImC,IAAI,CAACnB,GAAG,CAAEoB,CAAC,IAAK,GAAGC,iBAAiB,CAACD,CAAC,CAAC,IAAI3B,KAAK,CAAEV,CAAS,CAACqC,CAAC,CAAC,EAAEvC,CAAC,CAAC,EAAE,CAAC,CAACqB,IAAI,CAAC,GAAG,CAAC,GAAG;QACnG,OAAOpB,IAAI,CAACC,CAAC,EAAEC,IAAI,CAAC;MACtB;MACA,MAAMA,IAAI,GAAG,MACXmC,IAAI,CAACnB,GAAG,CAAEoB,CAAC,IAAK,GAAGxC,GAAG,CAACC,CAAC,GAAG,CAAC,CAAC,GAAGwC,iBAAiB,CAACD,CAAC,CAAC,KAAK3B,KAAK,CAAEV,CAAS,CAACqC,CAAC,CAAC,EAAEvC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAACqB,IAAI,CAAC,KAAK,CACpG,KAAKtB,GAAG,CAACC,CAAC,CAAC,GAAG;MACd,OAAOC,IAAI,CAACC,CAAC,EAAEC,IAAI,CAAC;IACtB;IAEA,OAAO+B,MAAM,CAAChC,CAAC,CAAC;EAClB;EAEA,OAAOU,KAAK,CAACpB,KAAK,EAAE,CAAC,CAAC;AACxB;AAEA,MAAMwB,QAAQ,GAAG,YAAY;AAE7B;;;AAGA,OAAM,SAAUwB,iBAAiBA,CAAChC,IAAiB;EACjD,OAAO,OAAOA,IAAI,KAAK,QAAQ,GAAGwB,IAAI,CAACC,SAAS,CAACzB,IAAI,CAAC,GAAG0B,MAAM,CAAC1B,IAAI,CAAC;AACvE;AAEA;;;;;AAKA,OAAM,SAAUiC,UAAUA,CAACC,IAAgC;EACzD,OAAOA,IAAI,CAACvB,GAAG,CAAEwB,GAAG,IAAK,IAAIH,iBAAiB,CAACG,GAAG,CAAC,GAAG,CAAC,CAACtB,IAAI,CAAC,EAAE,CAAC;AAClE;AAEA;;;;;;AAMA,OAAM,SAAUG,UAAUA,CAACoB,IAAU;EACnC,IAAI;IACF,OAAOA,IAAI,CAACC,WAAW,EAAE;EAC3B,CAAC,CAAC,MAAM;IACN,OAAO,cAAc;EACvB;AACF;AAEA,SAAShB,YAAYA,CAACrC,KAAU;EAC9B,IAAI;IACF,MAAMoC,CAAC,GAAGpC,KAAK,CAACmC,QAAQ,EAAE;IAC1B,OAAO,OAAOC,CAAC,KAAK,QAAQ,GAAGA,CAAC,GAAGM,MAAM,CAACN,CAAC,CAAC;EAC9C,CAAC,CAAC,MAAM;IACN,OAAO,kBAAkB;EAC3B;AACF;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4DA,OAAM,SAAUkB,UAAUA,CAACtD,KAAc,EAAEC,OAE1C;EACC,MAAMsD,SAAS,GAAkB,EAAE;EACnC,OAAOf,IAAI,CAACC,SAAS,CACnBzC,KAAK,EACL,UAAwBwD,IAAY,EAAEC,KAAc;IAClD,MAAMC,QAAQ,GAAG7D,MAAM,CAAC4D,KAAK,CAAC;IAC9B,IAAI,OAAOC,QAAQ,KAAK,QAAQ,IAAIA,QAAQ,KAAK,IAAI,EAAE;MACrD,OAAOA,QAAQ;IACjB;IACA,OAAOH,SAAS,CAAC7B,MAAM,GAAG,CAAC,IAAI6B,SAAS,CAACA,SAAS,CAAC7B,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;MACvE6B,SAAS,CAACI,GAAG,EAAE;IACjB;IACA,IAAIJ,SAAS,CAACK,QAAQ,CAACF,QAAQ,CAAC,EAAE;MAChC,OAAOG,SAAS,EAAC;IACnB;IACAN,SAAS,CAACO,IAAI,CAACJ,QAAQ,CAAC;IACxB,OAAOA,QAAQ;EACjB,CAAC,EACDzD,OAAO,EAAEC,KAAK,CACf;AACH","ignoreList":[]}
+{"version":3,"file":"Formatter.js","names":["Predicate","getRedacted","redact","symbolRedactable","format","input","options","space","seen","WeakSet","gap","repeat","ind","d","wrap","v","body","ctor","constructor","Object","prototype","name","ownKeys","o","Reflect","recur","Array","isArray","has","CIRCULAR","add","length","map","x","join","inner","Date","formatDate","ignoreToString","hasProperty","toString","s","safeToString","Error","cause","JSON","stringify","String","Symbol","iterator","from","keys","k","formatPropertyKey","formatPath","path","key","date","toISOString","formatJson","ancestors","_key","value","redacted","pop","includes","undefined","push"],"sources":["../src/Formatter.ts"],"sourcesContent":[null],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsDA,OAAO,KAAKA,SAAS,MAAM,gBAAgB;AAC3C,SAASC,WAAW,EAAEC,MAAM,EAAEC,gBAAgB,QAAQ,iBAAiB;AAiCvE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuEA,OAAM,SAAUC,MAAMA,CAACC,KAAc,EAAEC,OAGtC;EACC,MAAMC,KAAK,GAAGD,OAAO,EAAEC,KAAK,IAAI,CAAC;EACjC,MAAMC,IAAI,GAAG,IAAIC,OAAO,EAAU;EAClC,MAAMC,GAAG,GAAG,CAACH,KAAK,GAAG,EAAE,GAAI,OAAOA,KAAK,KAAK,QAAQ,GAAG,GAAG,CAACI,MAAM,CAACJ,KAAK,CAAC,GAAGA,KAAM;EACjF,MAAMK,GAAG,GAAIC,CAAS,IAAKH,GAAG,CAACC,MAAM,CAACE,CAAC,CAAC;EAExC,MAAMC,IAAI,GAAGA,CAACC,CAAU,EAAEC,IAAY,KAAY;IAChD,MAAMC,IAAI,GAAIF,CAAS,EAAEG,WAAW;IACpC,OAAOD,IAAI,IAAIA,IAAI,KAAKE,MAAM,CAACC,SAAS,CAACF,WAAW,IAAID,IAAI,CAACI,IAAI,GAAG,GAAGJ,IAAI,CAACI,IAAI,IAAIL,IAAI,GAAG,GAAGA,IAAI;EACpG,CAAC;EAED,MAAMM,OAAO,GAAIC,CAAS,IAAwB;IAChD,IAAI;MACF,OAAOC,OAAO,CAACF,OAAO,CAACC,CAAC,CAAC;IAC3B,CAAC,CAAC,MAAM;MACN,OAAO,CAAC,iBAAiB,CAAC;IAC5B;EACF,CAAC;EAED,SAASE,KAAKA,CAACV,CAAU,EAAEF,CAAC,GAAG,CAAC;IAC9B,IAAIa,KAAK,CAACC,OAAO,CAACZ,CAAC,CAAC,EAAE;MACpB,IAAIP,IAAI,CAACoB,GAAG,CAACb,CAAC,CAAC,EAAE,OAAOc,QAAQ;MAChCrB,IAAI,CAACsB,GAAG,CAACf,CAAC,CAAC;MACX,IAAI,CAACL,GAAG,IAAIK,CAAC,CAACgB,MAAM,IAAI,CAAC,EAAE,OAAO,IAAIhB,CAAC,CAACiB,GAAG,CAAEC,CAAC,IAAKR,KAAK,CAACQ,CAAC,EAAEpB,CAAC,CAAC,CAAC,CAACqB,IAAI,CAAC,GAAG,CAAC,GAAG;MAC5E,MAAMC,KAAK,GAAGpB,CAAC,CAACiB,GAAG,CAAEC,CAAC,IAAKR,KAAK,CAACQ,CAAC,EAAEpB,CAAC,GAAG,CAAC,CAAC,CAAC,CAACqB,IAAI,CAAC,KAAK,GAAGtB,GAAG,CAACC,CAAC,GAAG,CAAC,CAAC,CAAC;MACpE,OAAO,MAAMD,GAAG,CAACC,CAAC,GAAG,CAAC,CAAC,GAAGsB,KAAK,KAAKvB,GAAG,CAACC,CAAC,CAAC,GAAG;IAC/C;IAEA,IAAIE,CAAC,YAAYqB,IAAI,EAAE,OAAOC,UAAU,CAACtB,CAAC,CAAC;IAE3C,IACE,CAACT,OAAO,EAAEgC,cAAc,IACxBtC,SAAS,CAACuC,WAAW,CAACxB,CAAC,EAAE,UAAU,CAAC,IACpC,OAAOA,CAAC,CAAC,UAAU,CAAC,KAAK,UAAU,IACnCA,CAAC,CAAC,UAAU,CAAC,KAAKI,MAAM,CAACC,SAAS,CAACoB,QAAQ,IAC3CzB,CAAC,CAAC,UAAU,CAAC,KAAKW,KAAK,CAACN,SAAS,CAACoB,QAAQ,EAC1C;MACA,MAAMC,CAAC,GAAGC,YAAY,CAAC3B,CAAC,CAAC;MACzB,IAAIA,CAAC,YAAY4B,KAAK,IAAI5B,CAAC,CAAC6B,KAAK,EAAE;QACjC,OAAO,GAAGH,CAAC,YAAYhB,KAAK,CAACV,CAAC,CAAC6B,KAAK,EAAE/B,CAAC,CAAC,GAAG;MAC7C;MACA,OAAO4B,CAAC;IACV;IAEA,IAAI,OAAO1B,CAAC,KAAK,QAAQ,EAAE,OAAO8B,IAAI,CAACC,SAAS,CAAC/B,CAAC,CAAC;IAEnD,IACE,OAAOA,CAAC,KAAK,QAAQ,IACrBA,CAAC,IAAI,IAAI,IACT,OAAOA,CAAC,KAAK,SAAS,IACtB,OAAOA,CAAC,KAAK,QAAQ,EACrB,OAAOgC,MAAM,CAAChC,CAAC,CAAC;IAElB,IAAI,OAAOA,CAAC,KAAK,QAAQ,EAAE,OAAOgC,MAAM,CAAChC,CAAC,CAAC,GAAG,GAAG;IAEjD,IAAI,OAAOA,CAAC,KAAK,QAAQ,IAAI,OAAOA,CAAC,KAAK,UAAU,EAAE;MACpD,IAAIP,IAAI,CAACoB,GAAG,CAACb,CAAC,CAAC,EAAE,OAAOc,QAAQ;MAChCrB,IAAI,CAACsB,GAAG,CAACf,CAAC,CAAC;MAEX,IAAIZ,gBAAgB,IAAIY,CAAC,EAAE,OAAOX,MAAM,CAACH,WAAW,CAACc,CAAQ,CAAC,CAAC;MAE/D,IAAIiC,MAAM,CAACC,QAAQ,IAAIlC,CAAC,EAAE;QACxB,OAAO,GAAGA,CAAC,CAACG,WAAW,CAACG,IAAI,IAAII,KAAK,CAACC,KAAK,CAACwB,IAAI,CAACnC,CAAQ,CAAC,EAAEF,CAAC,CAAC,GAAG;MACnE;MAEA,MAAMsC,IAAI,GAAG7B,OAAO,CAACP,CAAC,CAAC;MACvB,IAAI,CAACL,GAAG,IAAIyC,IAAI,CAACpB,MAAM,IAAI,CAAC,EAAE;QAC5B,MAAMf,IAAI,GAAG,IAAImC,IAAI,CAACnB,GAAG,CAAEoB,CAAC,IAAK,GAAGC,iBAAiB,CAACD,CAAC,CAAC,IAAI3B,KAAK,CAAEV,CAAS,CAACqC,CAAC,CAAC,EAAEvC,CAAC,CAAC,EAAE,CAAC,CAACqB,IAAI,CAAC,GAAG,CAAC,GAAG;QACnG,OAAOpB,IAAI,CAACC,CAAC,EAAEC,IAAI,CAAC;MACtB;MACA,MAAMA,IAAI,GAAG,MACXmC,IAAI,CAACnB,GAAG,CAAEoB,CAAC,IAAK,GAAGxC,GAAG,CAACC,CAAC,GAAG,CAAC,CAAC,GAAGwC,iBAAiB,CAACD,CAAC,CAAC,KAAK3B,KAAK,CAAEV,CAAS,CAACqC,CAAC,CAAC,EAAEvC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAACqB,IAAI,CAAC,KAAK,CACpG,KAAKtB,GAAG,CAACC,CAAC,CAAC,GAAG;MACd,OAAOC,IAAI,CAACC,CAAC,EAAEC,IAAI,CAAC;IACtB;IAEA,OAAO+B,MAAM,CAAChC,CAAC,CAAC;EAClB;EAEA,OAAOU,KAAK,CAACpB,KAAK,EAAE,CAAC,CAAC;AACxB;AAEA,MAAMwB,QAAQ,GAAG,YAAY;AAE7B;;;AAGA,OAAM,SAAUwB,iBAAiBA,CAAChC,IAAiB;EACjD,OAAO,OAAOA,IAAI,KAAK,QAAQ,GAAGwB,IAAI,CAACC,SAAS,CAACzB,IAAI,CAAC,GAAG0B,MAAM,CAAC1B,IAAI,CAAC;AACvE;AAEA;;;;;AAKA,OAAM,SAAUiC,UAAUA,CAACC,IAAgC;EACzD,OAAOA,IAAI,CAACvB,GAAG,CAAEwB,GAAG,IAAK,IAAIH,iBAAiB,CAACG,GAAG,CAAC,GAAG,CAAC,CAACtB,IAAI,CAAC,EAAE,CAAC;AAClE;AAEA;;;;;;AAMA,OAAM,SAAUG,UAAUA,CAACoB,IAAU;EACnC,IAAI;IACF,OAAOA,IAAI,CAACC,WAAW,EAAE;EAC3B,CAAC,CAAC,MAAM;IACN,OAAO,cAAc;EACvB;AACF;AAEA,SAAShB,YAAYA,CAACrC,KAAU;EAC9B,IAAI;IACF,MAAMoC,CAAC,GAAGpC,KAAK,CAACmC,QAAQ,EAAE;IAC1B,OAAO,OAAOC,CAAC,KAAK,QAAQ,GAAGA,CAAC,GAAGM,MAAM,CAACN,CAAC,CAAC;EAC9C,CAAC,CAAC,MAAM;IACN,OAAO,kBAAkB;EAC3B;AACF;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2DA,OAAM,SAAUkB,UAAUA,CAACtD,KAAc,EAAEC,OAE1C;EACC,MAAMsD,SAAS,GAAkB,EAAE;EACnC,OAAOf,IAAI,CAACC,SAAS,CACnBzC,KAAK,EACL,UAAwBwD,IAAY,EAAEC,KAAc;IAClD,MAAMC,QAAQ,GAAG7D,MAAM,CAAC4D,KAAK,CAAC;IAC9B,IAAI,OAAOC,QAAQ,KAAK,QAAQ,IAAIA,QAAQ,KAAK,IAAI,EAAE;MACrD,OAAOA,QAAQ;IACjB;IACA,OAAOH,SAAS,CAAC7B,MAAM,GAAG,CAAC,IAAI6B,SAAS,CAACA,SAAS,CAAC7B,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,EAAE;MACvE6B,SAAS,CAACI,GAAG,EAAE;IACjB;IACA,IAAIJ,SAAS,CAACK,QAAQ,CAACF,QAAQ,CAAC,EAAE;MAChC,OAAOG,SAAS,EAAC;IACnB;IACAN,SAAS,CAACO,IAAI,CAACJ,QAAQ,CAAC;IACxB,OAAOA,QAAQ;EACjB,CAAC,EACDzD,OAAO,EAAEC,KAAK,CACf;AACH","ignoreList":[]}

package/dist/Function.d.ts

@@ -264,7 +264,7 @@ export declare const dual: {
     <DataLast extends (...args: Array<any>) => any, DataFirst extends (...args: Array<any>) => any>(isDataFirst: (args: IArguments) => boolean, body: DataFirst): DataLast & DataFirst;
 };
 /**
- * Apply a function to a given value.
+ * Applies a function to a given value.
  *
  * **When to use**
  *
@@ -332,7 +332,7 @@ export type LazyArg<A> = () => A;
  */
 export type FunctionN<A extends ReadonlyArray<unknown>, B> = (...args: A) => B;
 /**
- * The identity function, i.e. A function that returns its input argument.
+ * Returns its input argument unchanged.
  *
  * **When to use**
  *
@@ -352,7 +352,7 @@ export type FunctionN<A extends ReadonlyArray<unknown>, B> = (...args: A) => B;
  */
 export declare const identity: <A>(a: A) => A;
 /**
- * A function that ensures that the type of an expression matches some type,
+ * Ensures that the type of an expression matches some type,
  * without changing the resulting type of that expression.
  *
  * **When to use**
@@ -425,7 +425,7 @@ export declare const cast: <A, B>(a: A) => B;
  */
 export declare const constant: <A>(value: A) => LazyArg<A>;
 /**
- * A thunk that returns always `true`.
+ * Returns `true` when called.
  *
  * **When to use**
  *
@@ -445,7 +445,7 @@ export declare const constant: <A>(value: A) => LazyArg<A>;
  */
 export declare const constTrue: LazyArg<boolean>;
 /**
- * A thunk that returns always `false`.
+ * Returns `false` when called.
  *
  * **When to use**
  *
@@ -465,7 +465,7 @@ export declare const constTrue: LazyArg<boolean>;
  */
 export declare const constFalse: LazyArg<boolean>;
 /**
- * A thunk that returns always `null`.
+ * Returns `null` when called.
  *
  * **When to use**
  *
@@ -485,7 +485,7 @@ export declare const constFalse: LazyArg<boolean>;
  */
 export declare const constNull: LazyArg<null>;
 /**
- * A thunk that returns always `undefined`.
+ * Returns `undefined` when called.
  *
  * **When to use**
  *
@@ -506,7 +506,7 @@ export declare const constNull: LazyArg<null>;
  */
 export declare const constUndefined: LazyArg<undefined>;
 /**
- * A thunk that returns always `void`.
+ * Returns no meaningful value when called.
  *
  * **When to use**
  *
@@ -684,7 +684,7 @@ export declare const absurd: <A>(_: never) => A;
  */
 export declare const tupled: <A extends ReadonlyArray<unknown>, B>(f: (...a: A) => B) => (a: A) => B;
 /**
- * Inverse function of `tupled`
+ * Converts a tupled function back to an uncurried function.
  *
  * **When to use**
  *
@@ -906,7 +906,7 @@ export declare function flow<A extends ReadonlyArray<unknown>, B = never, C = ne
  */
 export declare const hole: <T>() => T;
 /**
- * The SK combinator, also known as the "S-K combinator" or "S-combinator", is
+ * Returns the second argument and discards the first. The SK combinator is
  * a fundamental combinator in the lambda calculus and the SKI combinator
  * calculus.
  *
@@ -928,8 +928,8 @@ export declare const hole: <T>() => T;
  */
 export declare const SK: <A, B>(_: A, b: B) => B;
 /**
- * Memoizes a function whose input is an object, caching results by object
- * identity.
+ * Creates a memoized function whose input is an object, caching results by
+ * object identity.
  *
  * **When to use**
  *

package/dist/Function.js

@@ -104,7 +104,7 @@ export const dual = function (arity, body) {
   }
 };
 /**
- * Apply a function to a given value.
+ * Applies a function to a given value.
  *
  * **When to use**
  *
@@ -131,7 +131,7 @@ export const dual = function (arity, body) {
  */
 export const apply = a => self => self(a);
 /**
- * The identity function, i.e. A function that returns its input argument.
+ * Returns its input argument unchanged.
  *
  * **When to use**
  *
@@ -151,7 +151,7 @@ export const apply = a => self => self(a);
  */
 export const identity = a => a;
 /**
- * A function that ensures that the type of an expression matches some type,
+ * Ensures that the type of an expression matches some type,
  * without changing the resulting type of that expression.
  *
  * **When to use**
@@ -224,7 +224,7 @@ export const cast = identity;
  */
 export const constant = value => () => value;
 /**
- * A thunk that returns always `true`.
+ * Returns `true` when called.
  *
  * **When to use**
  *
@@ -244,7 +244,7 @@ export const constant = value => () => value;
  */
 export const constTrue = /*#__PURE__*/constant(true);
 /**
- * A thunk that returns always `false`.
+ * Returns `false` when called.
  *
  * **When to use**
  *
@@ -264,7 +264,7 @@ export const constTrue = /*#__PURE__*/constant(true);
  */
 export const constFalse = /*#__PURE__*/constant(false);
 /**
- * A thunk that returns always `null`.
+ * Returns `null` when called.
  *
  * **When to use**
  *
@@ -284,7 +284,7 @@ export const constFalse = /*#__PURE__*/constant(false);
  */
 export const constNull = /*#__PURE__*/constant(null);
 /**
- * A thunk that returns always `undefined`.
+ * Returns `undefined` when called.
  *
  * **When to use**
  *
@@ -305,7 +305,7 @@ export const constNull = /*#__PURE__*/constant(null);
  */
 export const constUndefined = /*#__PURE__*/constant(undefined);
 /**
- * A thunk that returns always `void`.
+ * Returns no meaningful value when called.
  *
  * **When to use**
  *
@@ -430,7 +430,7 @@ export const absurd = _ => {
  */
 export const tupled = f => a => f(...a);
 /**
- * Inverse function of `tupled`
+ * Converts a tupled function back to an uncurried function.
  *
  * **When to use**
  *
@@ -526,7 +526,7 @@ export function flow(ab, bc, cd, de, ef, fg, gh, hi, ij) {
  */
 export const hole = /*#__PURE__*/cast(absurd);
 /**
- * The SK combinator, also known as the "S-K combinator" or "S-combinator", is
+ * Returns the second argument and discards the first. The SK combinator is
  * a fundamental combinator in the lambda calculus and the SKI combinator
  * calculus.
  *
@@ -548,8 +548,8 @@ export const hole = /*#__PURE__*/cast(absurd);
  */
 export const SK = (_, b) => b;
 /**
- * Memoizes a function whose input is an object, caching results by object
- * identity.
+ * Creates a memoized function whose input is an object, caching results by
+ * object identity.
  *
  * **When to use**
  *

package/dist/Graph.d.ts

@@ -104,7 +104,7 @@ export type NodeIndex = number;
  */
 export type EdgeIndex = number;
 /**
- * Edge data containing source, target, and user data.
+ * Represents edge data containing source, target, and user data.
  *
  * **When to use**
  *
@@ -499,7 +499,7 @@ export declare const mutate: {
  */
 export declare const addNode: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, data: N) => NodeIndex;
 /**
- * Gets the data associated with a node index, if it exists.
+ * Gets the data associated with a node index safely, if it exists.
  *
  * **Example** (Getting node data)
  *
@@ -523,7 +523,7 @@ export declare const addNode: <N, E, T extends Kind = "directed">(mutable: Mutab
  */
 export declare const getNode: {
     /**
-     * Gets the data associated with a node index, if it exists.
+     * Gets the data associated with a node index safely, if it exists.
      *
      * **Example** (Getting node data)
      *
@@ -547,7 +547,7 @@ export declare const getNode: {
      */
     <N, E, T extends Kind = "directed">(nodeIndex: NodeIndex): (graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Option.Option<N>;
     /**
-     * Gets the data associated with a node index, if it exists.
+     * Gets the data associated with a node index safely, if it exists.
      *
      * **Example** (Getting node data)
      *
@@ -572,7 +572,7 @@ export declare const getNode: {
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, nodeIndex: NodeIndex): Option.Option<N>;
 };
 /**
- * Checks if a node with the given index exists in the graph.
+ * Checks whether a node with the given index exists in the graph.
  *
  * **Example** (Checking node existence)
  *
@@ -597,7 +597,7 @@ export declare const getNode: {
  */
 export declare const hasNode: {
     /**
-     * Checks if a node with the given index exists in the graph.
+     * Checks whether a node with the given index exists in the graph.
      *
      * **Example** (Checking node existence)
      *
@@ -622,7 +622,7 @@ export declare const hasNode: {
      */
     (nodeIndex: NodeIndex): <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => boolean;
     /**
-     * Checks if a node with the given index exists in the graph.
+     * Checks whether a node with the given index exists in the graph.
      *
      * **Example** (Checking node existence)
      *
@@ -1089,7 +1089,7 @@ export declare const mapNodes: <N, E, T extends Kind = "directed">(mutable: Muta
  */
 export declare const mapEdges: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, f: (data: E) => E) => void;
 /**
- * Reverses all edge directions in a mutable graph by swapping source and target nodes.
+ * Swaps source and target nodes for every edge in a mutable graph.
  *
  * **Example** (Reversing edge directions)
  *
@@ -1316,7 +1316,7 @@ export declare const removeNode: <N, E, T extends Kind = "directed">(mutable: Mu
  */
 export declare const removeEdge: <N, E, T extends Kind = "directed">(mutable: MutableGraph<N, E, T>, edgeIndex: EdgeIndex) => void;
 /**
- * Gets the edge data associated with an edge index, if it exists.
+ * Gets the edge data associated with an edge index safely, if it exists.
  *
  * **Example** (Getting edge data)
  *
@@ -1344,7 +1344,7 @@ export declare const removeEdge: <N, E, T extends Kind = "directed">(mutable: Mu
  */
 export declare const getEdge: {
     /**
-     * Gets the edge data associated with an edge index, if it exists.
+     * Gets the edge data associated with an edge index safely, if it exists.
      *
      * **Example** (Getting edge data)
      *
@@ -1372,7 +1372,7 @@ export declare const getEdge: {
      */
     <E>(edgeIndex: EdgeIndex): <N, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Option.Option<Edge<E>>;
     /**
-     * Gets the edge data associated with an edge index, if it exists.
+     * Gets the edge data associated with an edge index safely, if it exists.
      *
      * **Example** (Getting edge data)
      *
@@ -1401,7 +1401,7 @@ export declare const getEdge: {
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, edgeIndex: EdgeIndex): Option.Option<Edge<E>>;
 };
 /**
- * Checks if an edge exists between two nodes in the graph.
+ * Checks whether an edge exists between two nodes in the graph.
  *
  * **Example** (Checking edge existence)
  *
@@ -1431,7 +1431,7 @@ export declare const getEdge: {
  */
 export declare const hasEdge: {
     /**
-     * Checks if an edge exists between two nodes in the graph.
+     * Checks whether an edge exists between two nodes in the graph.
      *
      * **Example** (Checking edge existence)
      *
@@ -1461,7 +1461,7 @@ export declare const hasEdge: {
      */
     (source: NodeIndex, target: NodeIndex): <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => boolean;
     /**
-     * Checks if an edge exists between two nodes in the graph.
+     * Checks whether an edge exists between two nodes in the graph.
      *
      * **Example** (Checking edge existence)
      *
@@ -1628,7 +1628,7 @@ export declare const neighbors: {
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, nodeIndex: NodeIndex): Array<NodeIndex>;
 };
 /**
- * Get neighbors of a node in a specific direction for bidirectional traversal.
+ * Gets neighbors of a node in a specific direction for bidirectional traversal.
  *
  * **Example** (Traversing directed neighbors)
  *
@@ -1656,7 +1656,7 @@ export declare const neighbors: {
  */
 export declare const neighborsDirected: {
     /**
-     * Get neighbors of a node in a specific direction for bidirectional traversal.
+     * Gets neighbors of a node in a specific direction for bidirectional traversal.
      *
      * **Example** (Traversing directed neighbors)
      *
@@ -1684,7 +1684,7 @@ export declare const neighborsDirected: {
      */
     (nodeIndex: NodeIndex, direction: Direction): <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => Array<NodeIndex>;
     /**
-     * Get neighbors of a node in a specific direction for bidirectional traversal.
+     * Gets neighbors of a node in a specific direction for bidirectional traversal.
      *
      * **Example** (Traversing directed neighbors)
      *
@@ -2605,7 +2605,7 @@ export declare const toMermaid: {
  */
 export type Direction = "outgoing" | "incoming";
 /**
- * Checks if the graph is acyclic (contains no cycles).
+ * Checks whether the graph is acyclic (contains no cycles).
  *
  * **Details**
  *
@@ -2643,7 +2643,7 @@ export type Direction = "outgoing" | "incoming";
  */
 export declare const isAcyclic: <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>) => boolean;
 /**
- * Checks if an undirected graph is bipartite.
+ * Checks whether an undirected graph is bipartite.
  *
  * **Details**
  *
@@ -2685,7 +2685,7 @@ export declare const isAcyclic: <N, E, T extends Kind = "directed">(graph: Graph
  */
 export declare const isBipartite: <N, E>(graph: Graph<N, E, "undirected"> | MutableGraph<N, E, "undirected">) => boolean;
 /**
- * Find connected components in an undirected graph.
+ * Finds connected components in an undirected graph.
  * Each component is represented as an array of node indices.
  *
  * **Example** (Finding connected components)
@@ -2711,7 +2711,7 @@ export declare const isBipartite: <N, E>(graph: Graph<N, E, "undirected"> | Muta
  */
 export declare const connectedComponents: <N, E>(graph: Graph<N, E, "undirected"> | MutableGraph<N, E, "undirected">) => Array<Array<NodeIndex>>;
 /**
- * Find strongly connected components in a directed graph using Kosaraju's algorithm.
+ * Finds strongly connected components in a directed graph using Kosaraju's algorithm.
  * Each SCC is represented as an array of node indices.
  *
  * **Example** (Finding strongly connected components)
@@ -3359,7 +3359,7 @@ export declare const bellmanFord: {
     <N, E, T extends Kind = "directed">(graph: Graph<N, E, T> | MutableGraph<N, E, T>, config: BellmanFordConfig<E>): Option.Option<PathResult<E>>;
 };
 /**
- * Iterable wrapper used by graph traversal and listing APIs.
+ * Represents an iterable wrapper used by graph traversal and listing APIs.
  *
  * **Details**
  *

package/dist/Graph.js

@@ -61,7 +61,7 @@ import { pipeArguments } from "./Pipeable.js";
 import { hasProperty } from "./Predicate.js";
 const TypeId = "~effect/collections/Graph";
 /**
- * Edge data containing source, target, and user data.
+ * Represents edge data containing source, target, and user data.
  *
  * **When to use**
  *
@@ -416,7 +416,7 @@ export const addNode = (mutable, data) => {
   return nodeIndex;
 };
 /**
- * Gets the data associated with a node index, if it exists.
+ * Gets the data associated with a node index safely, if it exists.
  *
  * **Example** (Getting node data)
  *
@@ -440,7 +440,7 @@ export const addNode = (mutable, data) => {
  */
 export const getNode = /*#__PURE__*/dual(2, (graph, nodeIndex) => graph.nodes.has(nodeIndex) ? Option.some(graph.nodes.get(nodeIndex)) : Option.none());
 /**
- * Checks if a node with the given index exists in the graph.
+ * Checks whether a node with the given index exists in the graph.
  *
  * **Example** (Checking node existence)
  *
@@ -754,7 +754,7 @@ export const mapEdges = (mutable, f) => {
   }
 };
 /**
- * Reverses all edge directions in a mutable graph by swapping source and target nodes.
+ * Swaps source and target nodes for every edge in a mutable graph.
  *
  * **Example** (Reversing edge directions)
  *
@@ -1218,7 +1218,7 @@ const removeEdgeInternal = (mutable, edgeIndex) => {
 // Edge Query Operations
 // =============================================================================
 /**
- * Gets the edge data associated with an edge index, if it exists.
+ * Gets the edge data associated with an edge index safely, if it exists.
  *
  * **Example** (Getting edge data)
  *
@@ -1246,7 +1246,7 @@ const removeEdgeInternal = (mutable, edgeIndex) => {
  */
 export const getEdge = /*#__PURE__*/dual(2, (graph, edgeIndex) => Option.fromUndefinedOr(graph.edges.get(edgeIndex)));
 /**
- * Checks if an edge exists between two nodes in the graph.
+ * Checks whether an edge exists between two nodes in the graph.
  *
  * **Example** (Checking edge existence)
  *
@@ -1369,7 +1369,7 @@ export const neighbors = /*#__PURE__*/dual(2, (graph, nodeIndex) => {
   return result;
 });
 /**
- * Get neighbors of a node in a specific direction for bidirectional traversal.
+ * Gets neighbors of a node in a specific direction for bidirectional traversal.
  *
  * **Example** (Traversing directed neighbors)
  *
@@ -1721,7 +1721,7 @@ export const toMermaid = /*#__PURE__*/dual(args => isGraph(args[0]), (graph, opt
 // Graph Structure Analysis Algorithms
 // =============================================================================
 /**
- * Checks if the graph is acyclic (contains no cycles).
+ * Checks whether the graph is acyclic (contains no cycles).
  *
  * **Details**
  *
@@ -1816,7 +1816,7 @@ export const isAcyclic = graph => {
   return true;
 };
 /**
- * Checks if an undirected graph is bipartite.
+ * Checks whether an undirected graph is bipartite.
  *
  * **Details**
  *
@@ -1917,7 +1917,7 @@ const getUndirectedNeighbors = (graph, nodeIndex) => {
   return Array.from(neighbors);
 };
 /**
- * Find connected components in an undirected graph.
+ * Finds connected components in an undirected graph.
  * Each component is represented as an array of node indices.
  *
  * **Example** (Finding connected components)
@@ -1969,7 +1969,7 @@ export const connectedComponents = graph => {
   return components;
 };
 /**
- * Find strongly connected components in a directed graph using Kosaraju's algorithm.
+ * Finds strongly connected components in a directed graph using Kosaraju's algorithm.
  * Each SCC is represented as an array of node indices.
  *
  * **Example** (Finding strongly connected components)
@@ -2670,7 +2670,7 @@ export const bellmanFord = /*#__PURE__*/dual(2, (graph, config) => {
   });
 });
 /**
- * Iterable wrapper used by graph traversal and listing APIs.
+ * Represents an iterable wrapper used by graph traversal and listing APIs.
  *
  * **Details**
  *

package/dist/HKT.d.ts

@@ -53,16 +53,17 @@
  */
 import type * as Types from "./Types.ts";
 /**
- * A unique symbol used to associate `TypeClass` implementations with their `TypeLambda`.
+ * Defines the unique symbol used to associate `TypeClass` implementations with their `TypeLambda`.
  *
  * **When to use**
  *
- * Use to link type class implementations to the `TypeLambda` they operate on.
+ * Use when defining a custom type class that needs to expose the `TypeLambda` it
+ * operates on.
  *
  * **Details**
  *
- * This symbol is used internally by the HKT system to link runtime type class
- * instances with their compile-time type information.
+ * This symbol links a type class shape with its compile-time type lambda. It is
+ * intended for type-class definitions and has no runtime behavior.
  *
  * **Example** (Linking a type class to a type lambda)
  *

package/dist/HKT.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"HKT.d.ts","sourceRoot":"","sources":["../src/HKT.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoDG;AACH,OAAO,KAAK,KAAK,KAAK,MAAM,YAAY,CAAA;AAExC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,EAAE,OAAO,MAAM,CAAA;AAEvC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC,SAAS,UAAU;IAC7C,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAA;CACnB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAA;IACpB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAA;CACzB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsDG;AACH,MAAM,MAAM,IAAI,CAAC,CAAC,SAAS,UAAU,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,IAAI,CAAC,SAAS;IACzE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;CACvB,GAAG,CAAC,CAAC,GAAG;IACL,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAA;IACf,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CACxB,CAAC,CAAC,MAAM,CAAC,GACR;IACA,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAA;IACb,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAA;IACpC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;IACpC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;IACpC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;CACzC,CAAA"}
+{"version":3,"file":"HKT.d.ts","sourceRoot":"","sources":["../src/HKT.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAoDG;AACH,OAAO,KAAK,KAAK,KAAK,MAAM,YAAY,CAAA;AAExC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AACH,MAAM,CAAC,OAAO,CAAC,MAAM,GAAG,EAAE,OAAO,MAAM,CAAA;AAEvC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC,SAAS,UAAU;IAC7C,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAA;CACnB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,EAAE,EAAE,OAAO,CAAA;IACpB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAA;CACzB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsDG;AACH,MAAM,MAAM,IAAI,CAAC,CAAC,SAAS,UAAU,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,IAAI,CAAC,SAAS;IACzE,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;CACvB,GAAG,CAAC,CAAC,GAAG;IACL,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAA;IACf,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CACxB,CAAC,CAAC,MAAM,CAAC,GACR;IACA,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAA;IACb,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAA;IACpC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;IACpC,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAA;IACpC,QAAQ,CAAC,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;CACzC,CAAA"}

package/dist/Hash.d.ts

@@ -1,5 +1,5 @@
 /**
- * The unique identifier used to identify objects that implement the Hash interface.
+ * Defines the unique identifier used to identify objects that implement the Hash interface.
  *
  * **When to use**
  *
@@ -233,7 +233,7 @@ export declare const combine: {
     (self: number, b: number): number;
 };
 /**
- * Optimizes a hash value by applying bit manipulation techniques.
+ * Applies bit manipulation techniques to optimize a hash value.
  *
  * **When to use**
  *
@@ -262,7 +262,7 @@ export declare const combine: {
  */
 export declare const optimize: (n: number) => number;
 /**
- * Checks if a value implements the Hash interface.
+ * Checks whether a value implements the Hash interface.
  *
  * **When to use**
  *

package/dist/Hash.js

@@ -55,7 +55,7 @@ import { dual } from "./Function.js";
 import { byReferenceInstances, getAllObjectKeys } from "./internal/equal.js";
 import { hasProperty } from "./Predicate.js";
 /**
- * The unique identifier used to identify objects that implement the Hash interface.
+ * Defines the unique identifier used to identify objects that implement the Hash interface.
  *
  * **When to use**
  *
@@ -237,7 +237,7 @@ export const random = self => {
  */
 export const combine = /*#__PURE__*/dual(2, (self, b) => self * 53 ^ b);
 /**
- * Optimizes a hash value by applying bit manipulation techniques.
+ * Applies bit manipulation techniques to optimize a hash value.
  *
  * **When to use**
  *
@@ -266,7 +266,7 @@ export const combine = /*#__PURE__*/dual(2, (self, b) => self * 53 ^ b);
  */
 export const optimize = n => n & 0xbfffffff | n >>> 1 & 0x40000000;
 /**
- * Checks if a value implements the Hash interface.
+ * Checks whether a value implements the Hash interface.
  *
  * **When to use**
  *