Skip to content

Upgrading dartz 0.7 to 0.8

Breaking0.7.5 → 0.8.9Breaking1New5Changed10Fixed3Other3

BreakingUpgrade verdict

1 breaking change.

  • This version mostly keeps things working while adding early support for the newer Dart 2 language.
1 item needs code or config changes

Dart SDK requirement changed in 0.8.0: >=1.24.0 <2.0.0 → >=1.24.0 <3.0.0.

Breaking1
Bridge release with few breaking changes, full Dart 1 support and rudimentary Dart 2 support.

Generated by DepDelta from published Dart source. Not mixed with prose notes.

  • removed: class EndoMonoid<A> extends Monoid<Endo<A>>
  • removed: function emptyIMapAVLNode<K, V>(): _IMapAVLNode<K, V>
  • removed: method EitherMonad.lift2<A, B, C>(C f(A a, B b)): Function2<Either<L, A>, Either<L, B>, Either<L, C>>
  • removed: method EitherMonad.lift3<A, B, C, D>(D f(A a, B b, C c)): Function3<Either<L, A>, Either<L, B>, Either<L, C>, Either<L, D>>
  • removed: method EitherMonad.lift4<A, B, C, D, E>(E f(A a, B b, C c, D d)): Function4<Either<L, A>, Either<L, B>, Either<L, C>, Either<L, D>, Either<L, E>>
  • removed: method EitherMonad.lift5<A, B, C, D, E, F>(F f(A a, B b, C c, D d, E e)): Function5<Either<L, A>, Either<L, B>, Either<L, C>, Either<L, D>, Either<L, E>, Either<L, F>>
  • removed: method EitherMonad.lift6<A, B, C, D, E, F, G>(G f(A a, B b, C c, D d, E e, F f)): Function6<Either<L, A>, Either<L, B>, Either<L, C>, Either<L, D>, Either<L, E>, Either<L, F>, Either<L, G>>
  • removed: method EitherMonad.lift<A, B>(B f(A a)): Function1<Either<L, A>, Either<L, B>>
  • removed: method EitherMonad.map2<A, A2 extends A, B, B2 extends B, C>(Either<L, A2> fa, Either<L, B2> fb, C fun(A a, B b)): Either<L, C>
  • removed: method EitherMonad.map3<A, A2 extends A, B, B2 extends B, C, C2 extends C, D>(Either<L, A2> fa, Either<L, B2> fb, Either<L, C2> fc, D fun(A a, B b, C c)): Either<L, D>
  • removed: method EitherMonad.map4<A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E>(Either<L, A2> fa, Either<L, B2> fb, Either<L, C2> fc, Either<L, D2> fd, E fun(A a, B b, C c, D d)): Either<L, E>
  • removed: method EitherMonad.map5<A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E, E2 extends E, F>(Either<L, A2> fa, Either<L, B2> fb, Either<L, C2> fc, Either<L, D2> fd, Either<L, E2> fe, F fun(A a, B b, C c, D d, E e)): Either<L, F>
  • removed: method EitherMonad.map6<A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E, E2 extends E, F, F2 extends F, G>(Either<L, A2> fa, Either<L, B2> fb, Either<L, C2> fc, Either<L, D2> fd, Either<L, E2> fe, Either<L, F2> ff, G fun(A a, B b, C c, D d, E e, F f)): Either<L, G>
  • removed: method EitherMonad.mapM2<A, A2 extends A, B, B2 extends B, C>(Either<L, A2> fa, Either<L, B2> fb, Either<L, C> f(A a, B b)): Either<L, C>
  • removed: method EndoMonoid.append(Endo<A> e1, Endo<A> e2): Endo<A>
  • removed: method EndoMonoid.zero(): Endo<A>
  • removed: method FreeMonad.ifM(Free<F, bool> fbool, Free<F, Unit> ifTrue): Free<F, Unit>
  • removed: method FreeMonad.map2<A, A2 extends A, B, B2 extends B, C>(Free<F, A2> fa, Free<F, B2> fb, C fun(A a, B b)): Free<F, C>
  • removed: method FreeMonad.map3<A, A2 extends A, B, B2 extends B, C, C2 extends C, D>(Free<F, A2> fa, Free<F, B2> fb, Free<F, C2> fc, D fun(A a, B b, C c)): Free<F, D>
  • removed: method FreeMonad.map4<A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E>(Free<F, A2> fa, Free<F, B2> fb, Free<F, C2> fc, Free<F, D2> fd, E fun(A a, B b, C c, D d)): Free<F, E>
  • removed: method FreeMonad.map5<A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E, E2 extends E, FF>(Free<F, A2> fa, Free<F, B2> fb, Free<F, C2> fc, Free<F, D2> fd, Free<F, E2> fe, FF fun(A a, B b, C c, D d, E e)): Free<F, FF>
  • removed: method FreeMonad.map6<A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E, E2 extends E, FF, F2 extends FF, G>(Free<F, A2> fa, Free<F, B2> fb, Free<F, C2> fc, Free<F, D2> fd, Free<F, E2> fe, Free<F, F2> ff, G fun(A a, B b, C c, D d, E e, FF f)): Free<F, G>
  • removed: method OptionMonadPlus.lift2<A, B, C>(C f(A a, B b)): Function2<Option<A>, Option<B>, Option<C>>
  • removed: method OptionMonadPlus.lift3<A, B, C, D>(D f(A a, B b, C c)): Function3<Option<A>, Option<B>, Option<C>, Option<D>>
  • removed: method OptionMonadPlus.lift4<A, B, C, D, E>(E f(A a, B b, C c, D d)): Function4<Option<A>, Option<B>, Option<C>, Option<D>, Option<E>>
  • removed: method OptionMonadPlus.lift5<A, B, C, D, E, F>(F f(A a, B b, C c, D d, E e)): Function5<Option<A>, Option<B>, Option<C>, Option<D>, Option<E>, Option<F>>
  • removed: method OptionMonadPlus.lift6<A, B, C, D, E, F, G>(G f(A a, B b, C c, D d, E e, F f)): Function6<Option<A>, Option<B>, Option<C>, Option<D>, Option<E>, Option<F>, Option<G>>
  • removed: method OptionMonadPlus.lift<A, B>(B f(A a)): Function1<Option<A>, Option<B>>
  • removed: method OptionMonadPlus.map2<A, A2 extends A, B, B2 extends B, C>(Option<A2> fa, Option<B2> fb, C fun(A a, B b)): Option<C>
  • removed: method OptionMonadPlus.map3<A, A2 extends A, B, B2 extends B, C, C2 extends C, D>(Option<A2> fa, Option<B2> fb, Option<C2> fc, D fun(A a, B b, C c)): Option<D>
  • removed: method OptionMonadPlus.map4<A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E>(Option<A2> fa, Option<B2> fb, Option<C2> fc, Option<D2> fd, E fun(A a, B b, C c, D d)): Option<E>
  • removed: method OptionMonadPlus.map5<A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E, E2 extends E, F>(Option<A2> fa, Option<B2> fb, Option<C2> fc, Option<D2> fd, Option<E2> fe, F fun(A a, B b, C c, D d, E e)): Option<F>
  • removed: method OptionMonadPlus.map6<A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E, E2 extends E, F, F2 extends F, G>(Option<A2> fa, Option<B2> fb, Option<C2> fc, Option<D2> fd, Option<E2> fe, Option<F2> ff, G fun(A a, B b, C c, D d, E e, F f)): Option<G>
  • removed: method OptionMonadPlus.mapM2<A, A2 extends A, B, B2 extends B, C>(Option<A2> fa, Option<B2> fb, Option<C> f(A a, B b)): Option<C>
  • removed: variable Nil: final IList
  • changed: class IList<A>: abstract extends TraversableOps<IList, A> with FunctorOps<IList, A>, ApplicativeOps<IList, A>, ApplicativePlusOps<IList, A>, MonadOps<IList, A>, MonadPlusOps<IList, A>, TraversableMonadOps<IList, A>, TraversableMonadPlusOps<IList, A> → class IList<A>: abstract extends TraversableOps<IList, A> with FunctorOps<IList, A>, ApplicativeOps<IList, A>, ApplicativePlusOps<IList, A>, MonadOps<IList, A>, MonadPlusOps<IList, A>, TraversableMonadOps<IList, A>, TraversableMonadPlusOps<IList, A>, PlusOps<IList, A>
  • changed: class IListMonoid extends Monoid<IList> → class IListMonoid<A> extends Monoid<IList<A>>
  • changed: class IOMonad extends FreeMonad<IOOp> with MonadCatch<Free<IOOp, dynamic>> → class IOMonad extends FreeMonad<IOOp> implements MonadCatch<Free<IOOp, dynamic>>
  • changed: class IVector<A> extends TraversableOps<IVector, A> with FunctorOps<IVector, A>, ApplicativeOps<IVector, A>, ApplicativePlusOps<IVector, A>, MonadOps<IVector, A>, MonadPlusOps<IVector, A>, TraversableMonadOps<IVector, A>, TraversableMonadPlusOps<IVector, A> → class IVector<A> extends TraversableOps<IVector, A> with FunctorOps<IVector, A>, ApplicativeOps<IVector, A>, ApplicativePlusOps<IVector, A>, MonadOps<IVector, A>, MonadPlusOps<IVector, A>, TraversableMonadOps<IVector, A>, TraversableMonadPlusOps<IVector, A>, PlusOps<IVector, A>
  • changed: class ListTraversableMonadPlus extends Traversable<List> with Applicative<List>, ApplicativePlus<List>, Monad<List>, MonadPlus<List>, TraversableMonad<List>, TraversableMonadPlus<List> → class ListTraversableMonadPlus extends Traversable<List> with Applicative<List>, ApplicativePlus<List>, Monad<List>, MonadPlus<List>, TraversableMonad<List>, TraversableMonadPlus<List>, Plus<List>
  • changed: class Option<A>: abstract extends TraversableOps<Option, A> with FunctorOps<Option, A>, ApplicativeOps<Option, A>, ApplicativePlusOps<Option, A>, MonadOps<Option, A>, MonadPlusOps<Option, A>, TraversableMonadOps<Option, A>, TraversableMonadPlusOps<Option, A> → class Option<A>: abstract extends TraversableOps<Option, A> with FunctorOps<Option, A>, ApplicativeOps<Option, A>, ApplicativePlusOps<Option, A>, MonadOps<Option, A>, MonadPlusOps<Option, A>, TraversableMonadOps<Option, A>, TraversableMonadPlusOps<Option, A>, PlusOps<Option, A>
  • changed: field Bind.f: final Function1<B, Free<F, A>> → field Bind.f: final _FreeF<F, A>
  • changed: method Bind.fold<R>(R ifPure(A a), R ifSuspend(F fa), R ifBind(Free<F, dynamic> ffb, Function1<dynamic, Free<F, A>> f)): R → method Bind.fold<R>(R ifPure(A a), R ifSuspend(F fa), R ifBind(Free<F, dynamic> ffb, _FreeF<F, A> f)): R
  • changed: method ComposedMonad.bind<A, B>(F fga, F f(_)): F → method ComposedMonad.bind<A, B>(F fga, Function1<dynamic, F>f): F
  • changed: method Either.bind<R2>(Either<L, R2> f(R r)): Either<L, R2> → method Either.bind<R2>(Function1<R, Either<L, R2>> f): Either<L, R2>
  • changed: method Either.flatMap<R2>(Either<L, R2> f(R r)): Either<L, R2> → method Either.flatMap<R2>(Function1<R, Either<L, R2>> f): Either<L, R2>
  • changed: method Evaluation.bind<B>(Evaluation<E, R, W, S, B> f(A a)): Evaluation<E, R, W, S, B> → method Evaluation.bind<B>(Function1<A, Evaluation<E, R, W, S, B>> f): Evaluation<E, R, W, S, B>
  • changed: method Evaluation.flatMap<B>(Evaluation<E, R, W, S, B> f(A a)): Evaluation<E, R, W, S, B> → method Evaluation.flatMap<B>(Function1<A, Evaluation<E, R, W, S, B>> f): Evaluation<E, R, W, S, B>
  • changed: method EvaluationMonad.bind<A, B>(Evaluation<E, R, W, S, A> fa, Evaluation<E, R, W, S, B> f(A a)): Evaluation<E, R, W, S, B> → method EvaluationMonad.bind<A, B>(Evaluation<E, R, W, S, A> fa, Function1<A, Evaluation<E, R, W, S, B>> f): Evaluation<E, R, W, S, B>
  • changed: method Free.bind<B>(Free<F, B> f(A a)): Free<F, B> → method Free.bind<B>(Function1<A, Free<F, B>> f): Free<F, B>
  • changed: method Free.flatMap<B>(Free<F, B> f(A a)): Free<F, B> → method Free.flatMap<B>(Function1<A, Free<F, B>> f): Free<F, B>
  • changed: method Free.fold<R>(R ifPure(A a), R ifSuspend(F fa), R ifBind(Free<F, dynamic> ffb, Function1<dynamic, Free<F, A>> f)): R → method Free.fold<R>(R ifPure(A a), R ifSuspend(F fa), R ifBind(Free<F, dynamic> ffb, _FreeF<F, A> f)): R
  • changed: method FreeMonad.bind<A, B>(Free<F, A> fa, Free<F, B> f(A a)): Free<F, B> → method FreeMonad.bind<A, B>(Free<F, A> fa, Function1<A, Free<F, B>> f): Free<F, B>
  • changed: method Function0TraversableMonad.bind<A, B>(Function0<A> fa, Function0<B> f(A a)): Function0 → method Function0TraversableMonad.bind<A, B>(Function0<A> fa, Function1<A, Function0<B>> f): Function0
  • changed: method FutureMonad.bind<A, B>(Future<A> fa, Future<B> f(A a)): Future<B> → method FutureMonad.bind<A, B>(Future<A> fa, Function1<A, Future<B>> f): Future<B>
  • changed: method IList.bind<B>(IList<B> f(A a)): IList<B> → method IList.bind<B>(Function1<A, IList<B>> f): IList<B>
  • changed: method IList.flatMap<B>(IList<B> f(A a)): IList<B> → method IList.flatMap<B>(Function1<A, IList<B>> f): IList<B>
  • changed: method IListMonoid.append(IList l1, IList l2): IList → method IListMonoid.append(IList<A> l1, IList<A> l2): IList<A>
  • changed: method IListMonoid.zero(): IList → method IListMonoid.zero(): IList<A>
  • changed: method IVector.bind<B>(IVector<B> f(A a)): IVector<B> → method IVector.bind<B>(Function1<A, IVector<B>> f): IVector<B>
  • changed: method IVector.flatMap<B>(IVector<B> f(A a)): IVector<B> → method IVector.flatMap<B>(Function1<A, IVector<B>> f): IVector<B>
  • changed: method IdMonad.bind<A, B>(A fa, B f(A a)) → method IdMonad.bind<A, B>(A fa, Function1<A, B> f)
  • changed: method ListTraversableMonadPlus.bind<A, B>(List<A> fa, List<B> f(A a)): List<B> → method ListTraversableMonadPlus.bind<A, B>(List<A> fa, Function1<A, List<B>> f): List<B>
  • changed: method MonadOps.operator <<(F next): F → method MonadOps.operator <<(covariant F next): F
  • changed: method MonadOps.operator >=(F f(A a)): F → method MonadOps.operator >=(covariant F f(A a)): F
  • changed: method Option.bind<B>(Option<B> f(A a)): Option<B> → method Option.bind<B>(Function1<A, Option<B>> f): Option<B>
  • changed: method Option.flatMap<B>(Option<B> f(A a)): Option<B> → method Option.flatMap<B>(Function1<A, Option<B>> f): Option<B>
  • changed: method OptionMonadPlus.bind<A, B>(Option<A> fa, Option<B> f(A a)): Option<B> → method OptionMonadPlus.bind<A, B>(Option<A> fa, Function1<A, Option<B>> f): Option<B>
  • changed: method Pure.fold<R>(R ifPure(A a), R ifSuspend(F fa), R ifBind(Free<F, dynamic> ffb, Function1<dynamic, Free<F, A>> f)): R → method Pure.fold<R>(R ifPure(A a), R ifSuspend(F fa), R ifBind(Free<F, dynamic> ffb, _FreeF<F, A> f)): R
  • changed: method State.bind<B>(State<S, B> f(A a)): State<S, B> → method State.bind<B>(Function1<A, State<S, B>> f): State<S, B>
  • changed: method State.flatMap<B>(State<S, B> f(A a)): State<S, B> → method State.flatMap<B>(Function1<A, State<S, B>> f): State<S, B>
  • changed: method StateMonad.bind<A, B>(State<S, A> fa, State<S, B> f(A a)): State<S, B> → method StateMonad.bind<A, B>(State<S, A> fa, Function1<A, State<S, B>> f): State<S, B>
  • changed: method StateT.bind<B>(StateT<F, S, B> f(A a)): StateT<F, S, B> → method StateT.bind<B>(Function1<A, StateT<F, S, B>> f): StateT<F, S, B>
  • changed: method StateT.flatMap<B>(StateT<F, S, B> f(A a)): StateT<F, S, B> → method StateT.flatMap<B>(Function1<A, StateT<F, S, B>> f): StateT<F, S, B>
  • changed: method StateTMonad.bind<A, B>(StateT<F, S, A> fa, StateT<F, S, B> f(A a)): StateT<F, S, B> → method StateTMonad.bind<A, B>(StateT<F, S, A> fa, Function1<A, StateT<F, S, B>> f): StateT<F, S, B>
  • changed: method Suspend.fold<R>(R ifPure(A a), R ifSuspend(F fa), R ifBind(Free<F, dynamic> ffb, Function1<dynamic, Free<F, A>> f)): R → method Suspend.fold<R>(R ifPure(A a), R ifSuspend(F fa), R ifBind(Free<F, dynamic> ffb, _FreeF<F, A> f)): R
  • changed: method Task.bind<B>(Task<B> f(A a)): Task<B> → method Task.bind<B>(Function1<A, Task<B>> f): Task<B>
  • changed: method TaskMonadCatch.bind<A, B>(Task<A> fa, Task<B> f(A a)): Task<B> → method TaskMonadCatch.bind<A, B>(Task<A> fa, Function1<A, Task<B>> f): Task<B>
  • changed: method Trampoline.bind<B>(Trampoline<B> f(A a)): Trampoline<B> → method Trampoline.bind<B>(Function1<A, Trampoline<B>> f): Trampoline<B>
  • changed: method TraversableOps.mapWithIndex<B>(B f(int i, a)): F → method TraversableOps.mapWithIndex<B>(B f(int i, A a)): F
  • added: function objectEq<A extends Object>(): Eq<A>
  • added: get AVLTree.isEmpty: bool
  • added: get ComparableOrder.hashCode: int
  • added: get Cons.head: A
  • added: get Cons.tail: IList<A>
  • added: get IList.isEmpty: bool
  • added: get IList.option: Option<IList<A>>
  • added: get IMap.isEmpty: bool
  • added: get ISet.isEmpty: bool
  • added: get IVector.isEmpty: bool
  • added: get Left.value: L
  • added: get Right.value: R
  • added: get Some.value: A
  • added: method ComparableOrder.operator ==(Object other): bool
  • added: method Cons.asCons(): Option<Cons<A>>
  • added: method Either.isLeft(): bool
  • added: method Either.isRight(): bool
  • added: method Either.swap(): Either<R, L>
  • added: method Either.traverseFuture<R2>(Future<R2> f(R r)): Future<Either<L, R2>>
  • added: method Either.traverseIList<R2>(IList<R2> f(R r)): IList<Either<L, R2>>
  • added: method Either.traverseIVector<R2>(IVector<R2> f(R r)): IVector<Either<L, R2>>
  • added: method Either.traverseState<S, R2>(State<S, R2> f(R r)): State<S, Either<L, R2>>
  • added: method Evaluation.replicate_(int n): Evaluation<E, R, W, S, Unit>
  • added: method IList.asCons(): Option<Cons<A>>
  • added: method IList.traverseEither<B, L>(Either<L, B> f(A a)): Either<L, IList<B>>
  • added: method IList.traverseEvaluation<B, E, R, W, S>(Monoid<W> WMi, Evaluation<E, R, W, S, B> f(A a)): Evaluation<E, R, W, S, IList<B>>
  • added: method IList.traverseFuture<B>(Future<B> f(A a)): Future<IList<B>>
  • added: method IList.traverseOption<B>(Option<B> f(A a)): Option<IList<B>>
  • added: method IList.traverseOptionM<B>(Option<IList<B>> f(A a)): Option<IList<B>>
  • added: method IList.traverseState<B, S>(State<S, B> f(A a)): State<S, IList<B>>
  • added: method IOMonad.bind<A, B>(Free<IOOp, A> fa, Function1<A, Free<IOOp, B>> f): Free<IOOp, B>
  • added: method ISet.filter(bool predicate(A a)): ISet<A>
  • added: method ISet.partition(bool f(A a)): Tuple2<ISet<A>, ISet<A>>
  • added: method ISet.transform<B>(Order<B> order, B f(A a)): ISet<B>
  • added: method ISet.where(bool predicate(A a)): ISet<A>
  • added: method IVector.foldMap<B>(Monoid<B> bMonoid, B f(A a)): B
  • added: method IVector.mapWithIndex<B>(B f(int i, A a)): IVector<B>
  • added: method IVector.traverseEither<L, B>(Either<L, B> f(A a)): Either<L, IVector<B>>
  • added: method IVector.traverseFuture<B>(Future<B> f(A a)): Future<IVector<B>>
  • added: method IVector.traverseOption<B>(Option<B> f(A a)): Option<IVector<B>>
  • added: method IVector.traverseState<S, B>(State<S, B> f(A a)): State<S, IVector<B>>
  • added: method Option.traverseFuture<B>(Future<B> f(A a)): Future<Option<B>>
  • added: method Option.traverseIList<B>(IList<B> f(A a)): IList<Option<B>>
  • added: method Option.traverseIVector<B>(IVector<B> f(A a)): IVector<Option<B>>
  • added: method Option.traverseState<S, B>(State<S, B> f(A a)): State<S, Option<B>>
  • added: method Task.andThen<B>(Task<B> next): Task<B>
  • added: method Task.ap<B>(Task<Function1<A, B>> ff): Task<B>
  • added: method Task.flatMap<B>(Function1<A, Task<B>> f): Task<B>
  • added: method Task.map<B>(B f(A a)): Task<B>
  • added: method Task.replace<B>(B replacement): Task<B>
  • added: method Task.strengthL<B>(B b): Task<Tuple2<B, A>>
  • added: method Task.strengthR<B>(B b): Task<Tuple2<A, B>>
  • added: static method Either.lift2<L, A, B, C>(C f(A a, B b)): Function2<Either<L, A>, Either<L, B>, Either<L, C>>
  • added: static method Either.lift3<L, A, B, C, D>(D f(A a, B b, C c)): Function3<Either<L, A>, Either<L, B>, Either<L, C>, Either<L, D>>
  • added: static method Either.lift4<L, A, B, C, D, E>(E f(A a, B b, C c, D d)): Function4<Either<L, A>, Either<L, B>, Either<L, C>, Either<L, D>, Either<L, E>>
  • added: static method Either.lift5<L, A, B, C, D, E, F>(F f(A a, B b, C c, D d, E e)): Function5<Either<L, A>, Either<L, B>, Either<L, C>, Either<L, D>, Either<L, E>, Either<L, F>>
  • added: static method Either.lift6<L, A, B, C, D, E, F, G>(G f(A a, B b, C c, D d, E e, F f)): Function6<Either<L, A>, Either<L, B>, Either<L, C>, Either<L, D>, Either<L, E>, Either<L, F>, Either<L, G>>
  • added: static method Either.lift<L, A, B>(B f(A a)): Function1<Either<L, A>, Either<L, B>>
  • added: static method Either.map2<L, A, A2 extends A, B, B2 extends B, C>(Either<L, A2> fa, Either<L, B2> fb, C fun(A a, B b)): Either<L, C>
  • added: static method Either.map3<L, A, A2 extends A, B, B2 extends B, C, C2 extends C, D>(Either<L, A2> fa, Either<L, B2> fb, Either<L, C2> fc, D fun(A a, B b, C c)): Either<L, D>
  • added: static method Either.map4<L, A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E>(Either<L, A2> fa, Either<L, B2> fb, Either<L, C2> fc, Either<L, D2> fd, E fun(A a, B b, C c, D d)): Either<L, E>
  • added: static method Either.map5<L, A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E, E2 extends E, F>(Either<L, A2> fa, Either<L, B2> fb, Either<L, C2> fc, Either<L, D2> fd, Either<L, E2> fe, F fun(A a, B b, C c, D d, E e)): Either<L, F>
  • added: static method Either.map6<L, A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E, E2 extends E, F, F2 extends F, G>(Either<L, A2> fa, Either<L, B2> fb, Either<L, C2> fc, Either<L, D2> fd, Either<L, E2> fe, Either<L, F2> ff, G fun(A a, B b, C c, D d, E e, F f)): Either<L, G>
  • added: static method Either.mapM2<L, A, A2 extends A, B, B2 extends B, C>(Either<L, A2> fa, Either<L, B2> fb, Either<L, C> f(A a, B b)): Either<L, C>
  • added: static method Either.sequenceFuture<L, R>(Either<L, Future<R>> efr): Future<Either<L, R>>
  • added: static method Either.sequenceIList<L, R>(Either<L, IList<R>> elr): IList<Either<L, R>>
  • added: static method Either.sequenceIVector<L, R>(Either<L, IVector<R>> evr): IVector<Either<L, R>>
  • added: static method Either.sequenceState<S, L, R>(Either<L, State<S, R>> esr): State<S, Either<L, R>>
  • added: static method Free.ifM<F>(Free<F, bool> fbool, Free<F, Unit> ifTrue): Free<F, Unit>
  • added: static method Free.map2<F, A, A2 extends A, B, B2 extends B, C>(Free<F, A2> fa, Free<F, B2> fb, C fun(A a, B b)): Free<F, C>
  • added: static method Free.map3<F, A, A2 extends A, B, B2 extends B, C, C2 extends C, D>(Free<F, A2> fa, Free<F, B2> fb, Free<F, C2> fc, D fun(A a, B b, C c)): Free<F, D>
  • added: static method Free.map4<F, A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E>(Free<F, A2> fa, Free<F, B2> fb, Free<F, C2> fc, Free<F, D2> fd, E fun(A a, B b, C c, D d)): Free<F, E>
  • added: static method Free.map5<F, A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E, E2 extends E, FF>(Free<F, A2> fa, Free<F, B2> fb, Free<F, C2> fc, Free<F, D2> fd, Free<F, E2> fe, FF fun(A a, B b, C c, D d, E e)): Free<F, FF>
  • added: static method Free.map6<F, A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E, E2 extends E, FF, F2 extends FF, G>(Free<F, A2> fa, Free<F, B2> fb, Free<F, C2> fc, Free<F, D2> fd, Free<F, E2> fe, Free<F, F2> ff, G fun(A a, B b, C c, D d, E e, FF f)): Free<F, G>
  • added: static method IList.sequenceEither<A, L>(IList<Either<L, A>> loa): Either<L, IList<A>>
  • added: static method IList.sequenceFuture<A>(IList<Future<A>> lfa): Future<IList<A>>
  • added: static method IList.sequenceOption<A>(IList<Option<A>> loa): Option<IList<A>>
  • added: static method IList.sequenceState<A, S>(IList<State<S, A>> lsa): State<S, IList<A>>
  • added: static method IVector.sequenceEither<L, A>(IVector<Either<L, A>> vea): Either<L, IVector<A>>
  • added: static method IVector.sequenceFuture<A>(IVector<Future<A>> vfa): Future<IVector<A>>
  • added: static method IVector.sequenceOption<A>(IVector<Option<A>> voa): Option<IVector<A>>
  • added: static method IVector.sequenceState<S, A>(IVector<State<S, A>> vsa): State<S, IVector<A>>
  • added: static method Option.lift2<A, B, C>(C f(A a, B b)): Function2<Option<A>, Option<B>, Option<C>>
  • added: static method Option.lift3<A, B, C, D>(D f(A a, B b, C c)): Function3<Option<A>, Option<B>, Option<C>, Option<D>>
  • added: static method Option.lift4<A, B, C, D, E>(E f(A a, B b, C c, D d)): Function4<Option<A>, Option<B>, Option<C>, Option<D>, Option<E>>
  • added: static method Option.lift5<A, B, C, D, E, F>(F f(A a, B b, C c, D d, E e)): Function5<Option<A>, Option<B>, Option<C>, Option<D>, Option<E>, Option<F>>
  • added: static method Option.lift6<A, B, C, D, E, F, G>(G f(A a, B b, C c, D d, E e, F f)): Function6<Option<A>, Option<B>, Option<C>, Option<D>, Option<E>, Option<F>, Option<G>>
  • added: static method Option.lift<A, B>(B f(A a)): Function1<Option<A>, Option<B>>
  • added: static method Option.map2<A, A2 extends A, B, B2 extends B, C>(Option<A2> fa, Option<B2> fb, C fun(A a, B b)): Option<C>
  • added: static method Option.map3<A, A2 extends A, B, B2 extends B, C, C2 extends C, D>(Option<A2> fa, Option<B2> fb, Option<C2> fc, D fun(A a, B b, C c)): Option<D>
  • added: static method Option.map4<A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E>(Option<A2> fa, Option<B2> fb, Option<C2> fc, Option<D2> fd, E fun(A a, B b, C c, D d)): Option<E>
  • added: static method Option.map5<A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E, E2 extends E, F>(Option<A2> fa, Option<B2> fb, Option<C2> fc, Option<D2> fd, Option<E2> fe, F fun(A a, B b, C c, D d, E e)): Option<F>
  • added: static method Option.map6<A, A2 extends A, B, B2 extends B, C, C2 extends C, D, D2 extends D, E, E2 extends E, F, F2 extends F, G>(Option<A2> fa, Option<B2> fb, Option<C2> fc, Option<D2> fd, Option<E2> fe, Option<F2> ff, G fun(A a, B b, C c, D d, E e, F f)): Option<G>
  • added: static method Option.mapM2<A, A2 extends A, B, B2 extends B, C>(Option<A2> fa, Option<B2> fb, Option<C> f(A a, B b)): Option<C>
  • added: static method Option.sequenceFuture<A>(Option<Future<A>> ofa): Future<Option<A>>
  • added: static method Option.sequenceIList<A>(Option<IList<A>> ola): IList<Option<A>>
  • added: static method Option.sequenceIVector<A>(Option<IVector<A>> ova): IVector<Option<A>>
  • added: static method Option.sequenceState<S, A>(Option<State<S, A>> osa): State<S, Option<A>>
  • changed: class Conveyor<F, O>: abstract extends FunctorOps<Conveyor , O> with ApplicativeOps<Conveyor , O>, ApplicativePlusOps<Conveyor , O>, MonadOps<Conveyor , O>, MonadPlusOps<Conveyor , O> → class Conveyor<F, O>: abstract extends FunctorOps<Conveyor , O> with ApplicativeOps<Conveyor , O>, ApplicativePlusOps<Conveyor , O>, MonadOps<Conveyor , O>, MonadPlusOps<Conveyor , O>, PlusOps<Conveyor , O>
  • changed: method Conveyor.bind<O2>(Conveyor<F, O2> f(O o)): Conveyor<F, O2> → method Conveyor.bind<O2>(Function1<O, Conveyor<F, O2>> f): Conveyor<F, O2>
  • changed: method Conveyor.flatMap<O2>(Conveyor<F, O2> f(O o)): Conveyor<F, O2> → method Conveyor.flatMap<O2>(Function1<O, Conveyor<F, O2>> f): Conveyor<F, O2>