@effect/data - npm Package Compare versions

Comparing version 0.3.1 to 0.3.2

Brand.js

@@ -92,5 +92,5 @@ "use strict";
   // @ts-expect-error
-  return Object.assign(args => (0, _Function.pipe)(either(args), Either.match(e => {
+  return Object.assign(args => Either.match(e => {
     throw e;
-  }, _Function.identity)), {
+  }, _Function.identity)(either(args)), {
     [RefinedConstructorsTypeId]: RefinedConstructorsTypeId,
@@ -171,5 +171,5 @@ option: args => Option.fromEither(either(args)),
   // @ts-expect-error
-  return Object.assign(args => (0, _Function.pipe)(either(args), Either.match(e => {
+  return Object.assign(args => Either.match(e => {
     throw e;
-  }, _Function.identity)), {
+  }, _Function.identity)(either(args)), {
     [RefinedConstructorsTypeId]: RefinedConstructorsTypeId,
@@ -176,0 +176,0 @@ option: args => Option.fromEither(either(args)),

Chunk.js

@@ -424,3 +424,3 @@ "use strict";
   }
-  return (0, Dual.pipe)(self, drop(i));
+  return drop(i)(self);
 });
@@ -506,3 +506,3 @@ /**
 exports.filterMapWhile = filterMapWhile;
-const elem = /*#__PURE__*/Dual.dual(2, (self, b) => (0, Dual.pipe)(toReadonlyArray(self), RA.contains(Equal.equivalence())(b)));
+const elem = /*#__PURE__*/Dual.dual(2, (self, b) => RA.contains(Equal.equivalence())(b)(toReadonlyArray(self)));
 /**
@@ -654,3 +654,3 @@ * Filter out optional values
 exports.head = head;
-const intersection = /*#__PURE__*/Dual.dual(2, (self, that) => (0, Dual.pipe)(toReadonlyArray(self), RA.intersection(Equal.equivalence())(toReadonlyArray(that)), unsafeFromArray));
+const intersection = /*#__PURE__*/Dual.dual(2, (self, that) => unsafeFromArray(RA.intersection(Equal.equivalence())(toReadonlyArray(that))(toReadonlyArray(self))));
 /**
@@ -679,3 +679,3 @@ * Determines if the chunk is empty.
 exports.isNonEmpty = isNonEmpty;
-const reduce = /*#__PURE__*/Dual.dual(3, (self, b, f) => (0, Dual.pipe)(toReadonlyArray(self), RA.reduce(b, f)));
+const reduce = /*#__PURE__*/Dual.dual(3, (self, b, f) => RA.reduce(b, f)(toReadonlyArray(self)));
 /**
@@ -688,3 +688,3 @@ * Folds over the elements in this chunk from the left.
 exports.reduce = reduce;
-const reduceWithIndex = /*#__PURE__*/Dual.dual(3, (self, b, f) => (0, Dual.pipe)(toReadonlyArray(self), RA.reduce(b, f)));
+const reduceWithIndex = /*#__PURE__*/Dual.dual(3, (self, b, f) => RA.reduce(b, f)(toReadonlyArray(self)));
 /**
@@ -697,3 +697,3 @@ * Folds over the elements in this chunk from the right.
 exports.reduceWithIndex = reduceWithIndex;
-const reduceRight = /*#__PURE__*/Dual.dual(3, (self, b, f) => (0, Dual.pipe)(toReadonlyArray(self), RA.reduceRight(b, (b, a) => f(b, a))));
+const reduceRight = /*#__PURE__*/Dual.dual(3, (self, b, f) => RA.reduceRight(b, (b, a) => f(b, a))(toReadonlyArray(self)));
 /**
@@ -706,3 +706,3 @@ * Folds over the elements in this chunk from the right.
 exports.reduceRight = reduceRight;
-const reduceRightWithIndex = /*#__PURE__*/Dual.dual(3, (self, b, f) => (0, Dual.pipe)(toReadonlyArray(self), RA.reduceRight(b, f)));
+const reduceRightWithIndex = /*#__PURE__*/Dual.dual(3, (self, b, f) => RA.reduceRight(b, f)(toReadonlyArray(self)));
 /**
@@ -768,3 +768,3 @@ * Joins the elements together with "sep" in the middle.
 exports.map = map;
-const mapWithIndex = /*#__PURE__*/Dual.dual(2, (self, f) => self.backing._tag === "ISingleton" ? of(f(self.backing.a, 0)) : unsafeFromArray((0, Dual.pipe)(toReadonlyArray(self), RA.map(f))));
+const mapWithIndex = /*#__PURE__*/Dual.dual(2, (self, f) => self.backing._tag === "ISingleton" ? of(f(self.backing.a, 0)) : unsafeFromArray(RA.map(f)(toReadonlyArray(self))));
 /**
@@ -794,3 +794,3 @@ * Statefully maps over the chunk, producing new elements of type `B`.
 exports.mapAccum = mapAccum;
-const partitionWithIndex = /*#__PURE__*/Dual.dual(2, (self, f) => (0, Dual.pipe)(toReadonlyArray(self), RA.partition(f), ([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)]));
+const partitionWithIndex = /*#__PURE__*/Dual.dual(2, (self, f) => (([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)])(RA.partition(f)(toReadonlyArray(self))));
 /**
@@ -803,3 +803,3 @@ * Separate elements based on a predicate.
 exports.partitionWithIndex = partitionWithIndex;
-const partition = /*#__PURE__*/Dual.dual(2, (self, predicate) => (0, Dual.pipe)(toReadonlyArray(self), RA.partition(predicate), ([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)]));
+const partition = /*#__PURE__*/Dual.dual(2, (self, predicate) => (([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)])(RA.partition(predicate)(toReadonlyArray(self))));
 /**
@@ -812,3 +812,3 @@ * Partitions the elements of this chunk into two chunks using f.
 exports.partition = partition;
-const partitionMap = /*#__PURE__*/Dual.dual(2, (self, f) => (0, Dual.pipe)(self, toReadonlyArray, RA.partitionMap(f), ([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)]));
+const partitionMap = /*#__PURE__*/Dual.dual(2, (self, f) => (([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)])(RA.partitionMap(f)(toReadonlyArray(self))));
 /**
@@ -821,3 +821,3 @@ * Partitions the elements of this chunk into two chunks.
 exports.partitionMap = partitionMap;
-const separate = self => (0, Dual.pipe)(self, toReadonlyArray, RA.separate, ([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)]);
+const separate = self => (([l, r]) => [unsafeFromArray(l), unsafeFromArray(r)])(RA.separate(toReadonlyArray(self)));
 /**
@@ -854,3 +854,3 @@ * Create a non empty `Chunk` containing a range of integers, including both endpoints.
 exports.size = size;
-const sort = /*#__PURE__*/Dual.dual(2, (self, O) => (0, Dual.pipe)(toReadonlyArray(self), RA.sort(O), unsafeFromArray));
+const sort = /*#__PURE__*/Dual.dual(2, (self, O) => unsafeFromArray(RA.sort(O)(toReadonlyArray(self))));
 /**
@@ -1034,3 +1034,3 @@ *  Returns two splits of this chunk at the specified index.
   const thatA = toReadonlyArray(that);
-  return (0, Dual.pipe)(selfA, RA.zipWith(thatA, f), unsafeFromArray);
+  return unsafeFromArray(RA.zipWith(thatA, f)(selfA));
 });
@@ -1097,3 +1097,3 @@ /**
 exports.zipAllWith = zipAllWith;
-const crossWith = /*#__PURE__*/Dual.dual(3, (self, that, f) => flatMap(self, a => (0, Dual.pipe)(that, map(b => f(a, b)))));
+const crossWith = /*#__PURE__*/Dual.dual(3, (self, that, f) => flatMap(self, a => map(b => f(a, b))(that)));
 /**
@@ -1143,3 +1143,3 @@ * Zips this chunk crosswise with the specified chunk.
 exports.zipWithIndexOffset = zipWithIndexOffset;
-const remove = /*#__PURE__*/Dual.dual(2, (self, i) => (0, Dual.pipe)(self, toReadonlyArray, RA.remove(i), unsafeFromArray));
+const remove = /*#__PURE__*/Dual.dual(2, (self, i) => unsafeFromArray(RA.remove(i)(toReadonlyArray(self))));
 /**
@@ -1168,3 +1168,3 @@ * Change the element at the specified index, creating a new `Chunk`,
 exports.replaceOption = replaceOption;
-const modify = /*#__PURE__*/Dual.dual(3, (self, i, f) => (0, Dual.pipe)(modifyOption(self, i, f), O.getOrElse(() => self)));
+const modify = /*#__PURE__*/Dual.dual(3, (self, i, f) => O.getOrElse(() => self)(modifyOption(self, i, f)));
 /**
@@ -1175,3 +1175,3 @@ * @category mutations
 exports.modify = modify;
-const modifyOption = /*#__PURE__*/Dual.dual(3, (self, i, f) => (0, Dual.pipe)(self, toReadonlyArray, RA.modifyOption(i, f), O.map(unsafeFromArray)));
+const modifyOption = /*#__PURE__*/Dual.dual(3, (self, i, f) => O.map(unsafeFromArray)(RA.modifyOption(i, f)(toReadonlyArray(self))));
 /**
@@ -1178,0 +1178,0 @@ * Returns the first element of this non empty chunk.

Gen.js

@@ -136,3 +136,3 @@ "use strict";
  */
-const singleShot = F => adapter => body => (0, _Function.pipe)(F.of(void 0), F.flatMap(() => {
+const singleShot = F => adapter => body => F.flatMap(() => {
   const iterator = body(adapter);
@@ -142,4 +142,4 @@ const state = iterator.next();
   return runGen(F, state, iterator);
-}));
+})(F.of(void 0));
 exports.singleShot = singleShot;
 //# sourceMappingURL=Gen.js.map

Global.d.ts

 /**
  * @since 1.0.0
  */
-export declare const value: <A>(id: unknown, compute: () => A) => A;
+export declare const globalValue: <A>(id: unknown, compute: () => A) => A;
 //# sourceMappingURL=Global.d.ts.map

Global.js

@@ -6,3 +6,3 @@ "use strict";
 });
-exports.value = void 0;
+exports.globalValue = void 0;
 /**
@@ -19,3 +19,3 @@ * @since 1.0.0
  */
-const value = (id, compute) => {
+const globalValue = (id, compute) => {
   if (!globalStore.has(id)) {
@@ -26,3 +26,3 @@ globalStore.set(id, compute());
 };
-exports.value = value;
+exports.globalValue = globalValue;
 //# sourceMappingURL=Global.js.map

Hash.js

@@ -7,3 +7,3 @@ "use strict";
 exports.symbol = exports.structure = exports.string = exports.random = exports.optimize = exports.number = exports.isHash = exports.hash = exports.combine = exports.array = void 0;
-var _Function = /*#__PURE__*/require("@effect/data/Function");
+var _Global = /*#__PURE__*/require("@effect/data/Global");
 var _Random = /*#__PURE__*/require("@effect/data/Random");
@@ -15,5 +15,5 @@ /**
 /** @internal */
-const randomHashCache = /*#__PURE__*/new WeakMap();
+const randomHashCache = /*#__PURE__*/(0, _Global.globalValue)( /*#__PURE__*/Symbol.for("@effect/data/Hash/randomHashCache"), () => new WeakMap());
 /** @internal */
-const pcgr = /*#__PURE__*/new _Random.PCGRandom();
+const pcgr = /*#__PURE__*/(0, _Global.globalValue)( /*#__PURE__*/Symbol.for("@effect/data/Hash/pcgr"), () => new _Random.PCGRandom());
 /**
@@ -142,3 +142,3 @@ * @since 1.0.0
   for (let i = 0; i < keys.length; i++) {
-    h ^= (0, _Function.pipe)(string(keys[i]), combine(hash(o[keys[i]])));
+    h ^= combine(hash(o[keys[i]]))(string(keys[i]));
   }
@@ -155,3 +155,3 @@ return optimize(h);
   for (let i = 0; i < arr.length; i++) {
-    h = (0, _Function.pipe)(h, combine(hash(arr[i])));
+    h = combine(hash(arr[i]))(h);
   }
@@ -158,0 +158,0 @@ return optimize(h);

internal/Context.js

@@ -23,3 +23,3 @@ "use strict";
     if (typeof id !== "undefined") {
-      return G.value(id, () => this);
+      return G.globalValue(id, () => this);
     }
@@ -26,0 +26,0 @@ }

internal/Differ/ChunkPatch.js

@@ -108,3 +108,3 @@ "use strict";
     if (!Equal.equals(valuePatch, differ.empty)) {
-      patch = (0, Dual.pipe)(patch, combine(new Update(i, valuePatch)));
+      patch = combine(new Update(i, valuePatch))(patch);
     }
@@ -114,6 +114,6 @@ i = i + 1;
   if (i < oldValue.length) {
-    patch = (0, Dual.pipe)(patch, combine(new Slice(0, i)));
+    patch = combine(new Slice(0, i))(patch);
   }
   if (i < newValue.length) {
-    patch = (0, Dual.pipe)(patch, combine(new Append(Chunk.drop(i)(newValue))));
+    patch = combine(new Append(Chunk.drop(i)(newValue)))(patch);
   }
@@ -120,0 +120,0 @@ return patch;

internal/HashMap.js

@@ -44,3 +44,3 @@ "use strict";
       for (const item of this) {
-        const elem = (0, Dual.pipe)(that, getHash(item[0], Hash.hash(item[0])));
+        const elem = getHash(item[0], Hash.hash(item[0]))(that);
         if (Option.isNone(elem)) {
@@ -269,3 +269,3 @@ return false;
   const newRoot = self._root.modify(self._editable ? self._edit : NaN, 0, f, hash, key, size);
-  return (0, Dual.pipe)(self, setTree(newRoot, size.value));
+  return setTree(newRoot, size.value)(self);
 });
@@ -272,0 +272,0 @@ /** @internal */

package.json

 {
   "name": "@effect/data",
-  "version": "0.3.1",
+  "version": "0.3.2",
   "license": "MIT",
@@ -5,0 +5,0 @@ "repository": {

SortedMap.js

@@ -26,3 +26,3 @@ "use strict";
   [Hash.symbol]() {
-    return (0, Dual.pipe)(Hash.hash(this.tree), Hash.combine(Hash.hash("@effect/data/SortedMap")));
+    return Hash.combine(Hash.hash("@effect/data/SortedMap"))(Hash.hash(this.tree));
   }
@@ -29,0 +29,0 @@ [Equal.symbol](that) {

SortedSet.js

@@ -25,3 +25,3 @@ "use strict";
   [Hash.symbol]() {
-    return (0, Dual.pipe)(Hash.hash(this.keyTree), Hash.combine(Hash.hash("@effect/data/SortedSet")));
+    return Hash.combine(Hash.hash("@effect/data/SortedSet"))(Hash.hash(this.keyTree));
   }
@@ -28,0 +28,0 @@ [Equal.symbol](that) {

src/Global.ts

@@ -15,3 +15,3 @@ /**
  */
-export const value = <A>(id: unknown, compute: () => A): A => {
+export const globalValue = <A>(id: unknown, compute: () => A): A => {
   if (!globalStore.has(id)) {
@@ -18,0 +18,0 @@ globalStore.set(id, compute())

src/Hash.ts

@@ -5,8 +5,15 @@ /**
 import { pipe } from "@effect/data/Function"
+import { globalValue } from "@effect/data/Global"
 import { PCGRandom } from "@effect/data/Random"
 
 /** @internal */
-const randomHashCache = new WeakMap<object, number>()
+const randomHashCache = globalValue(
+  Symbol.for("@effect/data/Hash/randomHashCache"),
+  () => new WeakMap<object, number>()
+)
 /** @internal */
-const pcgr = new PCGRandom()
+const pcgr = globalValue(
+  Symbol.for("@effect/data/Hash/pcgr"),
+  () => new PCGRandom()
+)
 
@@ -13,0 +20,0 @@ /**

src/internal/Context.ts

@@ -18,3 +18,3 @@ import type * as C from "@effect/data/Context"
     if (typeof id !== "undefined") {
-      return G.value(id, () => this)
+      return G.globalValue(id, () => this)
     }
@@ -21,0 +21,0 @@ }

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

3494607

increased by3.94%

Lines of code

74474

increased by0.01%

No dependency changes