@effect/data - npm Package Compare versions

Comparing version 0.8.0 to 0.9.0

Either.d.ts

@@ -311,3 +311,3 @@ /**
  */
-export declare const andThen: {
+export declare const zipRight: {
     <E1, _, E2, B>(self: Either<E1, _>, that: Either<E2, B>): Either<E1 | E2, B>;
@@ -335,3 +335,3 @@ <E2, B>(that: Either<E2, B>): <E1, _>(self: Either<E1, _>) => Either<E2 | E1, B>;
  */
-export declare const andThenDiscard: {
+export declare const zipLeft: {
     <E1, A, E2, _>(self: Either<E1, A>, that: Either<E2, _>): Either<E1 | E2, A>;
@@ -338,0 +338,0 @@ <E2, _>(that: Either<E2, _>): <E1, A>(self: Either<E1, A>) => Either<E2 | E1, A>;

Either.js

@@ -6,3 +6,3 @@ "use strict";
 });
-exports.zipWith = exports.unit = exports.tupled = exports.tuple = exports.traverseTap = exports.traverse = exports.toRefinement = exports.toOption = exports.toArray = exports.tapError = exports.tap = exports.sum = exports.subtract = exports.struct = exports.sequence = exports.rights = exports.right = exports.reverse = exports.orElseFail = exports.orElseEither = exports.orElse = exports.multiply = exports.merge = exports.match = exports.mapLeft = exports.map = exports.liftThrowable = exports.liftPredicate = exports.liftOption = exports.liftNullable = exports.lift2 = exports.letDiscard = exports.let = exports.lefts = exports.left = exports.isRight = exports.isLeft = exports.isEither = exports.inspectRight = exports.inspectLeft = exports.getRight = exports.getOrUndefined = exports.getOrThrowWith = exports.getOrThrow = exports.getOrNull = exports.getOrElse = exports.getOptionalSemigroup = exports.getLeft = exports.getFirstRightSemigroup = exports.getFirstLeftSemigroup = exports.getFirstLeftMonoid = exports.getEquivalence = exports.gen = exports.fromOption = exports.fromNullable = exports.fromIterable = exports.flatten = exports.flatMapOption = exports.flatMapNullable = exports.flatMap = exports.flap = exports.firstRightOf = exports.filterMap = exports.filter = exports.exists = exports.divide = exports.contains = exports.composeK = exports.compact = exports.bindTo = exports.bindDiscard = exports.bind = exports.bimap = exports.asUnit = exports.as = exports.appendElement = exports.ap = exports.andThenDiscard = exports.andThen = exports.all = exports.Traversable = exports.SemiProduct = exports.SemiCoproduct = exports.SemiApplicative = exports.SemiAlternative = exports.Product = exports.Pointed = exports.Monad = exports.Invariant = exports.Foldable = exports.FlatMap = exports.Do = exports.Covariant = exports.Chainable = exports.Bicovariant = exports.Applicative = void 0;
+exports.zipWith = exports.zipRight = exports.zipLeft = exports.unit = exports.tupled = exports.tuple = exports.traverseTap = exports.traverse = exports.toRefinement = exports.toOption = exports.toArray = exports.tapError = exports.tap = exports.sum = exports.subtract = exports.struct = exports.sequence = exports.rights = exports.right = exports.reverse = exports.orElseFail = exports.orElseEither = exports.orElse = exports.multiply = exports.merge = exports.match = exports.mapLeft = exports.map = exports.liftThrowable = exports.liftPredicate = exports.liftOption = exports.liftNullable = exports.lift2 = exports.letDiscard = exports.let = exports.lefts = exports.left = exports.isRight = exports.isLeft = exports.isEither = exports.inspectRight = exports.inspectLeft = exports.getRight = exports.getOrUndefined = exports.getOrThrowWith = exports.getOrThrow = exports.getOrNull = exports.getOrElse = exports.getOptionalSemigroup = exports.getLeft = exports.getFirstRightSemigroup = exports.getFirstLeftSemigroup = exports.getFirstLeftMonoid = exports.getEquivalence = exports.gen = exports.fromOption = exports.fromNullable = exports.fromIterable = exports.flatten = exports.flatMapOption = exports.flatMapNullable = exports.flatMap = exports.flap = exports.firstRightOf = exports.filterMap = exports.filter = exports.exists = exports.divide = exports.contains = exports.composeK = exports.compact = exports.bindTo = exports.bindDiscard = exports.bind = exports.bimap = exports.asUnit = exports.as = exports.appendElement = exports.ap = exports.all = exports.Traversable = exports.SemiProduct = exports.SemiCoproduct = exports.SemiApplicative = exports.SemiAlternative = exports.Product = exports.Pointed = exports.Monad = exports.Invariant = exports.Foldable = exports.FlatMap = exports.Do = exports.Covariant = exports.Chainable = exports.Bicovariant = exports.Applicative = void 0;
 var Equal = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@effect/data/Equal"));
@@ -315,7 +315,7 @@ var _Function = /*#__PURE__*/require("@effect/data/Function");
 exports.flatten = flatten;
-const andThen = /*#__PURE__*/flatMap_.andThen(FlatMap);
+const zipRight = /*#__PURE__*/flatMap_.zipRight(FlatMap);
 /**
  * @since 1.0.0
  */
-exports.andThen = andThen;
+exports.zipRight = zipRight;
 const composeK = /*#__PURE__*/flatMap_.composeK(FlatMap);
@@ -340,3 +340,3 @@ /**
 exports.Chainable = Chainable;
-const andThenDiscard = /*#__PURE__*/chainable.andThenDiscard(Chainable);
+const zipLeft = /*#__PURE__*/chainable.zipLeft(Chainable);
 /**
@@ -346,3 +346,3 @@ * @category instances
  */
-exports.andThenDiscard = andThenDiscard;
+exports.zipLeft = zipLeft;
 const Monad = {
@@ -349,0 +349,0 @@ imap,

Option.d.ts

@@ -651,3 +651,3 @@ /**
  */
-export declare const andThen: {
+export declare const zipRight: {
     <_, B>(self: Option<_>, that: Option<B>): Option<B>;
@@ -679,3 +679,3 @@ <B>(that: Option<B>): <_>(self: Option<_>) => Option<B>;
  */
-export declare const andThenDiscard: {
+export declare const zipLeft: {
     <A, _>(self: Option<A>, that: Option<_>): Option<A>;
@@ -682,0 +682,0 @@ <_>(that: Option<_>): <A>(self: Option<A>) => Option<A>;

Option.js

@@ -6,3 +6,3 @@ "use strict";
 });
-exports.zipWith = exports.unit = exports.tupled = exports.tuple = exports.traverseTap = exports.traverse = exports.toRefinement = exports.toEither = exports.toArray = exports.tap = exports.sumCompact = exports.sum = exports.subtract = exports.struct = exports.some = exports.sequence = exports.reduceCompact = exports.partitionMap = exports.orElseEither = exports.orElse = exports.none = exports.multiplyCompact = exports.multiply = exports.match = exports.map = exports.liftThrowable = exports.liftPredicate = exports.liftNullable = exports.liftEither = exports.lift2 = exports.letDiscard = exports.let = exports.isSome = exports.isOption = exports.isNone = exports.inspectSome = exports.inspectNone = exports.getRight = exports.getOrder = exports.getOrUndefined = exports.getOrThrowWith = exports.getOrThrow = exports.getOrNull = exports.getOrElse = exports.getOptionalMonoid = exports.getLeft = exports.getFirstSomeSemigroup = exports.getFailureSemigroup = exports.getFailureMonoid = exports.getEquivalence = exports.gen = exports.fromNullable = exports.fromIterable = exports.fromEither = exports.flatten = exports.flatMapNullable = exports.flatMapEither = exports.flatMap = exports.flap = exports.firstSomeOf = exports.filterMap = exports.filter = exports.exists = exports.divide = exports.contains = exports.composeK = exports.bindTo = exports.bindDiscard = exports.bind = exports.asUnit = exports.as = exports.appendElement = exports.ap = exports.andThenDiscard = exports.andThen = exports.all = exports.Traversable = exports.SemiProduct = exports.SemiCoproduct = exports.SemiApplicative = exports.SemiAlternative = exports.Product = exports.Pointed = exports.Monad = exports.Invariant = exports.Foldable = exports.FlatMap = exports.Filterable = exports.Do = exports.Covariant = exports.Coproduct = exports.Chainable = exports.Applicative = exports.Alternative = void 0;
+exports.zipWith = exports.zipRight = exports.zipLeft = exports.unit = exports.tupled = exports.tuple = exports.traverseTap = exports.traverse = exports.toRefinement = exports.toEither = exports.toArray = exports.tap = exports.sumCompact = exports.sum = exports.subtract = exports.struct = exports.some = exports.sequence = exports.reduceCompact = exports.partitionMap = exports.orElseEither = exports.orElse = exports.none = exports.multiplyCompact = exports.multiply = exports.match = exports.map = exports.liftThrowable = exports.liftPredicate = exports.liftNullable = exports.liftEither = exports.lift2 = exports.letDiscard = exports.let = exports.isSome = exports.isOption = exports.isNone = exports.inspectSome = exports.inspectNone = exports.getRight = exports.getOrder = exports.getOrUndefined = exports.getOrThrowWith = exports.getOrThrow = exports.getOrNull = exports.getOrElse = exports.getOptionalMonoid = exports.getLeft = exports.getFirstSomeSemigroup = exports.getFailureSemigroup = exports.getFailureMonoid = exports.getEquivalence = exports.gen = exports.fromNullable = exports.fromIterable = exports.fromEither = exports.flatten = exports.flatMapNullable = exports.flatMapEither = exports.flatMap = exports.flap = exports.firstSomeOf = exports.filterMap = exports.filter = exports.exists = exports.divide = exports.contains = exports.composeK = exports.bindTo = exports.bindDiscard = exports.bind = exports.asUnit = exports.as = exports.appendElement = exports.ap = exports.all = exports.Traversable = exports.SemiProduct = exports.SemiCoproduct = exports.SemiApplicative = exports.SemiAlternative = exports.Product = exports.Pointed = exports.Monad = exports.Invariant = exports.Foldable = exports.FlatMap = exports.Filterable = exports.Do = exports.Covariant = exports.Coproduct = exports.Chainable = exports.Applicative = exports.Alternative = void 0;
 var Equal = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@effect/data/Equal"));
@@ -676,3 +676,3 @@ var _Function = /*#__PURE__*/require("@effect/data/Function");
 exports.flatten = flatten;
-const andThen = /*#__PURE__*/flatMap_.andThen(FlatMap);
+const zipRight = /*#__PURE__*/flatMap_.zipRight(FlatMap);
 /**
@@ -682,3 +682,3 @@ * @category transforming
  */
-exports.andThen = andThen;
+exports.zipRight = zipRight;
 const composeK = /*#__PURE__*/flatMap_.composeK(FlatMap);
@@ -706,3 +706,3 @@ /**
 exports.Chainable = Chainable;
-const andThenDiscard = /*#__PURE__*/chainable.andThenDiscard(Chainable);
+const zipLeft = /*#__PURE__*/chainable.zipLeft(Chainable);
 /**
@@ -729,3 +729,3 @@ * Applies the provided function `f` to the value of the `Option` if it is `Some` and returns the original `Option`
  */
-exports.andThenDiscard = andThenDiscard;
+exports.zipLeft = zipLeft;
 const tap = /*#__PURE__*/chainable.tap(Chainable);
@@ -732,0 +732,0 @@ /**

package.json

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

src/Either.ts

@@ -403,6 +403,6 @@ /**
  */
-export const andThen: {
+export const zipRight: {
   <E1, _, E2, B>(self: Either<E1, _>, that: Either<E2, B>): Either<E1 | E2, B>
   <E2, B>(that: Either<E2, B>): <E1, _>(self: Either<E1, _>) => Either<E2 | E1, B>
-} = flatMap_.andThen(FlatMap)
+} = flatMap_.zipRight(FlatMap)
 
@@ -439,6 +439,6 @@ /**
  */
-export const andThenDiscard: {
+export const zipLeft: {
   <E1, A, E2, _>(self: Either<E1, A>, that: Either<E2, _>): Either<E1 | E2, A>
   <E2, _>(that: Either<E2, _>): <E1, A>(self: Either<E1, A>) => Either<E2 | E1, A>
-} = chainable.andThenDiscard(Chainable)
+} = chainable.zipLeft(Chainable)
 
@@ -445,0 +445,0 @@ /**

src/Option.ts

@@ -793,6 +793,6 @@ /**
  */
-export const andThen: {
+export const zipRight: {
   <_, B>(self: Option<_>, that: Option<B>): Option<B>
   <B>(that: Option<B>): <_>(self: Option<_>) => Option<B>
-} = flatMap_.andThen(FlatMap)
+} = flatMap_.zipRight(FlatMap)
 
@@ -828,6 +828,6 @@ /**
  */
-export const andThenDiscard: {
+export const zipLeft: {
   <A, _>(self: Option<A>, that: Option<_>): Option<A>
   <_>(that: Option<_>): <A>(self: Option<A>) => Option<A>
-} = chainable.andThenDiscard(Chainable)
+} = chainable.zipLeft(Chainable)
 
@@ -834,0 +834,0 @@ /**

src/typeclass/Chainable.ts

@@ -22,3 +22,3 @@ /**
  */
-export const andThenDiscard = <F extends TypeLambda>(F: Chainable<F>): {
+export const zipLeft = <F extends TypeLambda>(F: Chainable<F>): {
   <R2, O2, E2, _>(
@@ -25,0 +25,0 @@ that: Kind<F, R2, O2, E2, _>

src/typeclass/FlatMap.ts

@@ -36,3 +36,3 @@ /**
  */
-export const andThen = <F extends TypeLambda>(F: FlatMap<F>): {
+export const zipRight = <F extends TypeLambda>(F: FlatMap<F>): {
   <R2, O2, E2, B>(
@@ -39,0 +39,0 @@ that: Kind<F, R2, O2, E2, B>

src/typeclass/SemiApplicative.ts

@@ -81,3 +81,3 @@ /**
  */
-export const andThenDiscard = <F extends TypeLambda>(F: SemiApplicative<F>): {
+export const zipLeft = <F extends TypeLambda>(F: SemiApplicative<F>): {
   <R2, O2, E2, _>(
@@ -99,3 +99,3 @@ that: Kind<F, R2, O2, E2, _>
  */
-export const andThen = <F extends TypeLambda>(F: SemiApplicative<F>): {
+export const zipRight = <F extends TypeLambda>(F: SemiApplicative<F>): {
   <R2, O2, E2, B>(
@@ -102,0 +102,0 @@ that: Kind<F, R2, O2, E2, B>

typeclass/Chainable.d.ts

@@ -17,3 +17,3 @@ import type { Kind, TypeLambda } from "@effect/data/HKT";
  */
-export declare const andThenDiscard: <F extends TypeLambda>(F: Chainable<F>) => {
+export declare const zipLeft: <F extends TypeLambda>(F: Chainable<F>) => {
     <R2, O2, E2, _>(that: Kind<F, R2, O2, E2, _>): <R1, O1, E1, A>(self: Kind<F, R1, O1, E1, A>) => Kind<F, R1 & R2, O2 | O1, E2 | E1, A>;
@@ -20,0 +20,0 @@ <R1_1, O1_1, E1_1, A_1, R2_1, O2_1, E2_1, __1>(self: Kind<F, R1_1, O1_1, E1_1, A_1>, that: Kind<F, R2_1, O2_1, E2_1, __1>): Kind<F, R1_1 & R2_1, O1_1 | O2_1, E1_1 | E2_1, A_1>;

typeclass/Chainable.js

@@ -6,3 +6,3 @@ "use strict";
 });
-exports.tap = exports.bind = exports.andThenDiscard = void 0;
+exports.zipLeft = exports.tap = exports.bind = void 0;
 var _Function = /*#__PURE__*/require("@effect/data/Function");
@@ -20,3 +20,3 @@ /**
  */
-const andThenDiscard = F => (0, _Function.dual)(2, (self, that) => tap(F)(self, () => that));
+const zipLeft = F => (0, _Function.dual)(2, (self, that) => tap(F)(self, () => that));
 /**
@@ -27,3 +27,3 @@ * Returns an effect that effectfully "peeks" at the success of this effect.
  */
-exports.andThenDiscard = andThenDiscard;
+exports.zipLeft = zipLeft;
 const tap = F => (0, _Function.dual)(2, (self, f) => F.flatMap(self, a => F.map(f(a), () => a)));
@@ -30,0 +30,0 @@ /**

typeclass/FlatMap.d.ts

@@ -21,3 +21,3 @@ import type { Kind, TypeClass, TypeLambda } from "@effect/data/HKT";
  */
-export declare const andThen: <F extends TypeLambda>(F: FlatMap<F>) => {
+export declare const zipRight: <F extends TypeLambda>(F: FlatMap<F>) => {
     <R2, O2, E2, B>(that: Kind<F, R2, O2, E2, B>): <R1, O1, E1, _>(self: Kind<F, R1, O1, E1, _>) => Kind<F, R1 & R2, O2 | O1, E2 | E1, B>;
@@ -24,0 +24,0 @@ <R1_1, O1_1, E1_1, __1, R2_1, O2_1, E2_1, B_1>(self: Kind<F, R1_1, O1_1, E1_1, __1>, that: Kind<F, R2_1, O2_1, E2_1, B_1>): Kind<F, R1_1 & R2_1, O1_1 | O2_1, E1_1 | E2_1, B_1>;

typeclass/FlatMap.js

@@ -6,3 +6,3 @@ "use strict";
 });
-exports.flatten = exports.composeK = exports.andThen = void 0;
+exports.zipRight = exports.flatten = exports.composeK = void 0;
 var _Function = /*#__PURE__*/require("@effect/data/Function");
@@ -23,9 +23,9 @@ /**
 exports.flatten = flatten;
-const andThen = F => (0, _Function.dual)(2, (self, that) => F.flatMap(self, () => that));
+const zipRight = F => (0, _Function.dual)(2, (self, that) => F.flatMap(self, () => that));
 /**
  * @since 1.0.0
  */
-exports.andThen = andThen;
+exports.zipRight = zipRight;
 const composeK = F => (0, _Function.dual)(2, (afb, bfc) => a => F.flatMap(afb(a), bfc));
 exports.composeK = composeK;
 //# sourceMappingURL=FlatMap.js.map

typeclass/SemiApplicative.d.ts

@@ -41,3 +41,3 @@ import type { Kind, TypeLambda } from "@effect/data/HKT";
  */
-export declare const andThenDiscard: <F extends TypeLambda>(F: SemiApplicative<F>) => {
+export declare const zipLeft: <F extends TypeLambda>(F: SemiApplicative<F>) => {
     <R2, O2, E2, _>(that: Kind<F, R2, O2, E2, _>): <R1, O1, E1, A>(self: Kind<F, R1, O1, E1, A>) => Kind<F, R1 & R2, O2 | O1, E2 | E1, A>;
@@ -49,3 +49,3 @@ <R1_1, O1_1, E1_1, A_1, R2_1, O2_1, E2_1, __1>(self: Kind<F, R1_1, O1_1, E1_1, A_1>, that: Kind<F, R2_1, O2_1, E2_1, __1>): Kind<F, R1_1 & R2_1, O1_1 | O2_1, E1_1 | E2_1, A_1>;
  */
-export declare const andThen: <F extends TypeLambda>(F: SemiApplicative<F>) => {
+export declare const zipRight: <F extends TypeLambda>(F: SemiApplicative<F>) => {
     <R2, O2, E2, B>(that: Kind<F, R2, O2, E2, B>): <R1, O1, E1, _>(self: Kind<F, R1, O1, E1, _>) => Kind<F, R1 & R2, O2 | O1, E2 | E1, B>;
@@ -52,0 +52,0 @@ <R1_1, O1_1, E1_1, __1, R2_1, O2_1, E2_1, B_1>(self: Kind<F, R1_1, O1_1, E1_1, __1>, that: Kind<F, R2_1, O2_1, E2_1, B_1>): Kind<F, R1_1 & R2_1, O1_1 | O2_1, E1_1 | E2_1, B_1>;

typeclass/SemiApplicative.js

@@ -6,3 +6,3 @@ "use strict";
 });
-exports.zipWith = exports.lift2 = exports.getSemigroup = exports.ap = exports.andThenDiscard = exports.andThen = void 0;
+exports.zipWith = exports.zipRight = exports.zipLeft = exports.lift2 = exports.getSemigroup = exports.ap = void 0;
 var _Function = /*#__PURE__*/require("@effect/data/Function");
@@ -43,8 +43,8 @@ var semigroup = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("@effect/data/typeclass/Semigroup"));
 exports.ap = ap;
-const andThenDiscard = F => (0, _Function.dual)(2, (self, that) => zipWith(F)(self, that, _Function.identity));
+const zipLeft = F => (0, _Function.dual)(2, (self, that) => zipWith(F)(self, that, _Function.identity));
 /**
  * @since 1.0.0
  */
-exports.andThenDiscard = andThenDiscard;
-const andThen = F => (0, _Function.dual)(2, (self, that) => zipWith(F)(self, that, _Function.SK));
+exports.zipLeft = zipLeft;
+const zipRight = F => (0, _Function.dual)(2, (self, that) => zipWith(F)(self, that, _Function.SK));
 /**
@@ -58,5 +58,5 @@ * Lifts a binary function into `F`.
  */
-exports.andThen = andThen;
+exports.zipRight = zipRight;
 const lift2 = F => f => (0, _Function.dual)(2, (self, that) => zipWith(F)(self, that, f));
 exports.lift2 = lift2;
 //# sourceMappingURL=SemiApplicative.js.map

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

Worsened metrics

Total package byte prevSize

3574617

decreased by-0.01%

No dependency changes