Upgrading dartz 0.0 to 0.1
Breaking0.0.10 → 0.1.3Breaking5New5Changed6Other2
BreakingUpgrade verdict
3 breaking changes.
In plain terms
- Code that passed a plain default value to these methods must now pass a function that returns it.
- To work with Dart's stricter type checking, empty values are now created with generic functions instead of shared constants.
- Other empty collections follow the same pattern: use the generic function instead of the constant.
Must act 3 items need code or config changes
Dart SDK requirement changed in 0.1.0: >=1.13.0 <2.0.0 → >=1.16.0 <2.0.0.
What you must change
Breaking3
orElse and getOrElse on Option and Either now take thunks instead of values.
OptionEitherorElsegetOrElseDart Strong Mode compliance forces breaking changes: use Option<A> none<A>() instead of Option<dynamic> none, and prefer IList<A> nil<A>() to IList<dynamic> Nil.
OptionnoneIListnilNilThe same generic-function change applies to emptyVector, IMapMi and other empty values.
emptyVectorIMapMiAPI changes
Generated by DepDelta from published Dart source. Not mixed with prose notes.
- removed:
method Either.flatMap(Either f(R r)): Either - removed:
method Evaluation.andThen(Evaluation<E, R, W, S, dynamic> next): Evaluation<E, R, W, S, dynamic> - removed:
method Evaluation.ap(Evaluation<E, R, W, S, dynamic> ff): Evaluation<E, R, W, S, dynamic> - removed:
method Evaluation.flatMap(Evaluation<E, R, W, S, dynamic> f(A a)): Evaluation<E, R, W, S, dynamic> - removed:
method Evaluation.flatten(): Evaluation<E, R, W, S, dynamic> - removed:
method Evaluation.join(): Evaluation<E, R, W, S, dynamic> - removed:
method Evaluation.operator <<(Evaluation<E, R, W, S, dynamic> next): Evaluation<E, R, W, S, dynamic> - removed:
method Evaluation.operator >=(Evaluation<E, R, W, S, dynamic> f(A a)): Evaluation<E, R, W, S, dynamic> - removed:
method Evaluation.operator >>(Evaluation<E, R, W, S, dynamic> next): Evaluation<E, R, W, S, dynamic> - removed:
method Evaluation.replace(replacement): Evaluation<E, R, W, S, dynamic> - removed:
method ListTMonad.concat(M a, M b) - removed:
method Option.flatMap(Option f(A a)): Option - removed:
typedef Thunk() - removed:
variable comparableOrder: final Order - removed:
variable emptyAVLNode: const _AVLNode - removed:
variable emptyVector: final IVector - removed:
variable firstSemigroup: final Semigroup - removed:
variable none: final Option - removed:
variable secondSemigroup: final Semigroup - changed:
class Either<L, R>: abstract extends TraversableOps<Either, R> with MonadOps<Either, R> → class Either<L, R>: abstract extends TraversableOps<Either<L, dynamic>, R> with MonadOps<Either<L, dynamic>, R> - changed:
class Evaluation<E, R, W, S, A> → class Evaluation<E, R, W, S, A> extends FunctorOps<Evaluation , A> with ApplicativeOps<Evaluation , A>, MonadOps<Evaluation , A> - changed:
class Free<F, A>: abstract extends FunctorOps<Free, A> with ApplicativeOps<Free, A>, MonadOps<Free, A> → class Free<F, A>: abstract extends FunctorOps<Free , A> with ApplicativeOps<Free , A>, MonadOps<Free , A> - changed:
class IMap<K, V> extends TraversableOps<IMap, V> → class IMap<K, V> extends TraversableOps<IMap<K, dynamic>, V> - changed:
class IVectorMonoid extends Monoid<IVector> → class IVectorMonoid<A> extends Monoid<IVector<A>> - changed:
class ListMonoid extends Monoid<List> → class ListMonoid<A> extends Monoid<List<A>> - changed:
class PlusEmptyOps<F, A>: abstract extends PlusOps<F, A> → class PlusEmptyOps<F, A>: abstract implements PlusOps<F, A> - changed:
class State<S, A> extends FunctorOps<State, A> with ApplicativeOps<State, A>, MonadOps<State, A> → class State<S, A> extends FunctorOps<State , A> with ApplicativeOps<State , A>, MonadOps<State , A> - changed:
class StateT<F, S, A> extends FunctorOps<StateT, A> with ApplicativeOps<StateT, A>, MonadOps<StateT, A> → class StateT<F, S, A> extends FunctorOps<StateT , A> with ApplicativeOps<StateT , A>, MonadOps<StateT , A> - changed:
function catching(Thunk thunk): Either → function catching(Function0 thunk): Either - changed:
function composeF(f(b), g(a)): Function → function composeF(Function1 f, Function1 g): Function1 - changed:
function constF(b): Function → function constF( b): Function1 - changed:
function curry2(f(a, b)): Function → function curry2(Function2 fun): Function1 - changed:
function curry3(f(a, b, c)): Function → function curry3(Function3 fun): Function1 - changed:
function curry4(f(a, b, c, d)): Function → function curry4(Function4 fun): Function1 - changed:
function curry5(f(a, b, c, d, e)): Function → function curry5(Function5 fun): Function1 - changed:
function curry6(fun(a, b, c, d, e, f)): Function → function curry6(Function6 fun): Function1 - changed:
function flip(f(a, b)): Function → function flip(Function2 f): Function2 - changed:
function id(dynamic t): dynamic → function id( a) - changed:
function imapMonoid(Semigroup si): Monoid<IMap> → function imapMonoid(Semigroup si): Monoid<IMap > - changed:
function iset(IList l): ISet → function iset(Iterable l): ISet - changed:
function left(l): Either → function left( l): Either - changed:
function liftF(fa): Free → function liftF( fa): Free - changed:
function monoid(zero(), append(t1, t2)): Monoid → function monoid( zero(), append( t1, t2)): Monoid - changed:
function option(test, value): Option → function option(bool test, value): Option - changed:
function orderBy(Order o, by(_)): Order → function orderBy(Order o, by( a)): Order - changed:
function right(r): Either → function right( r): Either - changed:
function semigroup(append(a1, a2)): Semigroup → function semigroup( append( a1, a2)): Semigroup - changed:
function some(a): Option → function some( a): Option - changed:
function tcall(Thunk thunk): Trampoline → function tcall(Function0 thunk): Trampoline - changed:
function treturn(a): Trampoline → function treturn( t): Trampoline - changed:
function tuple2(v1, v2): Tuple2 → function tuple2( v1, v2): Tuple2 - changed:
function tuple3(v1, v2, v3): Tuple3 → function tuple3( v1, v2, v3): Tuple3 - changed:
function tuple4(v1, v2, v3, v4): Tuple4 → function tuple4( v1, v2, v3, v4): Tuple4 - changed:
function tuplize2(f(a, b)): Function → function tuplize2(Function2 fun): Function1 - changed:
function tuplize3(f(a, b, c)): Function → function tuplize3(Function3 fun): Function1 - changed:
function tuplize4(f(a, b, c, d)): Function → function tuplize4(Function4 fun): Function1 - changed:
function uncurry2(f(_)): Function → function uncurry2(Function1 fun): Function2 - changed:
function uncurry3(f(_)): Function → function uncurry3(Function1 fun): Function3 - changed:
function uncurry4(f(_)): Function → function uncurry4(Function1 fun): Function4 - changed:
function uncurry5(f(_)): Function → function uncurry5(Function1 fun): Function5 - changed:
function uncurry6(fun(_)): Function → function uncurry6(Function1 fun): Function6 - changed:
method AVLTree.foldLeft(z, f(previous, A a)) → method AVLTree.foldLeft( z, f( previous, A a)) - changed:
method AVLTree.foldRight(z, f(A a, previous)) → method AVLTree.foldRight( z, f(A a, previous)) - changed:
method Applicative.traverseA(Traversable g, ga, f(_)): F → method Applicative.traverseA(Traversable g, ga, F f(_)): F - changed:
method Applicative.traverseA_(Traversable g, ga, f(_)): F → method Applicative.traverseA_(Traversable g, ga, F f(_)): F - changed:
method Applicative.traverseL(IList<F> fas, f(_)): F → method Applicative.traverseL(IList<F> fas, F f(_)): F - changed:
method Applicative.traverseL_(IList<F> fas, f(_)): F → method Applicative.traverseL_(IList<F> fas, F f(_)): F - changed:
method Applicative.unsafeTraverseL(List fas, f(_)): F → method Applicative.unsafeTraverseL(List fas, F f(_)): F - changed:
method Applicative.unsafeTraverseL_(List<F> fas, f(_)): F → method Applicative.unsafeTraverseL_(List<F> fas, F f(_)): F - changed:
method ApplicativeOps.map(f(A a)): F → method ApplicativeOps.map( f(A a)): F - changed:
method ApplicativeOps.pure(a): F → method ApplicativeOps.pure( b): F - changed:
method Either.fold(ifLeft(L l), ifRight(R r)) → method Either.fold( ifLeft(L l), ifRight(R r)) - changed:
method Either.getOrElse(R dflt): R → method Either.getOrElse(R dflt()): R - changed:
method Either.leftMap(f(L l)): Either → method Either.leftMap( f(L l)): Either<dynamic , R> - changed:
method Either.map(f(R r)): Either → method Either.map( f(R r)): Either - changed:
method Either.pure(a): Either → method Either.pure( r2): Either - changed:
method Evaluation.bind(Evaluation<E, R, W, S, dynamic> f(A a)): Evaluation<E, R, W, S, dynamic> → method Evaluation.bind(Evaluation<E, R, W, S, dynamic > f(A a)): Evaluation<E, R, W, S, dynamic > - changed:
method Evaluation.map(f(A a)): Evaluation<E, R, W, S, dynamic> → method Evaluation.map( f(A a)): Evaluation<E, R, W, S, dynamic > - changed:
method Evaluation.pure(a): Evaluation<E, R, W, S, dynamic> → method Evaluation.pure( b): Evaluation<E, R, W, S, dynamic > - changed:
method EvaluationMonad.asks(f(R r)): Evaluation<E, R, W, S, dynamic> → method EvaluationMonad.asks( f(R r)): Evaluation<E, R, W, S, dynamic > - changed:
method EvaluationMonad.bind(Evaluation fa, Evaluation<E, R, W, S, dynamic> f(_)): Evaluation<E, R, W, S, dynamic> → method EvaluationMonad.bind(Evaluation<E, R, W, S, dynamic> fa, Evaluation<E, R, W, S, dynamic> f(_)): Evaluation<E, R, W, S, dynamic> - changed:
method EvaluationMonad.gets(f(S s)): Evaluation<E, R, W, S, dynamic> → method EvaluationMonad.gets( f(S s)): Evaluation<E, R, W, S, dynamic > - changed:
method EvaluationMonad.handleError(Evaluation<E, R, W, S, dynamic> ev, Evaluation<E, R, W, S, dynamic> onError(E e)): Evaluation<E, R, W, S, dynamic> → method EvaluationMonad.handleError(Evaluation<E, R, W, S, dynamic > ev, Evaluation<E, R, W, S, dynamic > onError(E e)): Evaluation<E, R, W, S, dynamic > - changed:
method EvaluationMonad.liftEither(Either<E, dynamic> either): Evaluation<E, R, W, S, dynamic> → method EvaluationMonad.liftEither(Either<E, dynamic > either): Evaluation<E, R, W, S, dynamic > - changed:
method EvaluationMonad.liftFuture(Future fut): Evaluation<E, R, W, S, dynamic> → method EvaluationMonad.liftFuture(Future fut): Evaluation<E, R, W, S, dynamic > - changed:
method EvaluationMonad.map(Evaluation fa, f(_)): Evaluation<E, R, W, S, dynamic> → method EvaluationMonad.map(Evaluation<E, R, W, S, dynamic> fa, f(_)): Evaluation<E, R, W, S, dynamic> - changed:
method EvaluationMonad.pure(a): Evaluation<E, R, W, S, dynamic> → method EvaluationMonad.pure( a): Evaluation<E, R, W, S, dynamic > - changed:
method EvaluationMonad.raiseError(E err): Evaluation<E, R, W, S, dynamic> → method EvaluationMonad.raiseError(E err): Evaluation<E, R, W, S, dynamic > - changed:
method Foldable.concatenateO(Semigroup si, F fa) → method Foldable.concatenateO(Semigroup si, F fa): Option - changed:
method Foldable.foldLeft(F fa, z, f(previous, a)) → method Foldable.foldLeft(F fa, z, f( previous, a)) - changed:
method Foldable.foldMapO(Semigroup si, F fa, f(a)) → method Foldable.foldMapO(Semigroup si, F fa, f(a)): Option - changed:
method FoldableOps.foldLeft(z, f(previous, A a)) → method FoldableOps.foldLeft( z, f( previous, A a)) - changed:
method FoldableOps.foldMapO(Semigroup si, f(A a)) → method FoldableOps.foldMapO(Semigroup si, f(A a)): Option - changed:
method FoldableOps.foldRight(z, f(A a, previous)) → method FoldableOps.foldRight( z, f(A a, previous)) - changed:
method FoldableOpsFoldable.foldLeft(F fa, z, f(previous, a)) → method FoldableOpsFoldable.foldLeft(F fa, z, f( previous, a)) - changed:
method Free.pure(a): Free → method Free.pure( b): Free - changed:
method FunctorOps.map(f(A a)): F → method FunctorOps.map( f(A a)): F - changed:
method FunctorOps.strengthL(b): F → method FunctorOps.strengthL( b): F - changed:
method FunctorOps.strengthR(b): F → method FunctorOps.strengthR( b): F - changed:
method FutureMonad.bind(Future fa, Future f(_)): Future → method FutureMonad.bind(Future fa, Future f( a)): Future - changed:
method FutureMonad.map(Future fa, f(_)): Future → method FutureMonad.map(Future fa, f( a)): Future - changed:
method FutureMonad.pure(a): Future → method FutureMonad.pure( a): Future - changed:
method IList.foldLeft(z, f(p, A a)) → method IList.foldLeft( z, f( previous, A a)) - changed:
method IList.foldRight(z, f(A a, p)) → method IList.foldRight( z, f(A a, previous)) - changed:
method IList.map(f(A a)): IList → method IList.map( f(A a)): IList - changed:
method IList.pure(a): IList → method IList.pure( b): IList - changed:
method IMap.foldLeft(z, f(previous, V v)) → method IMap.foldLeft( z, f( previous, V v)) - changed:
method IMap.foldLeftKV(z, f(previous, K k, V v)) → method IMap.foldLeftKV( z, f( previous, K k, V v)) - changed:
method IMap.foldRight(z, f(V v, previous)) → method IMap.foldRight( z, f(V v, previous)) - changed:
method IMap.foldRightKV(z, f(K k, V v, previous)) → method IMap.foldRightKV( z, f(K k, V v, previous)) - changed:
method IMap.map(f(V v)): IMap<K, dynamic> → method IMap.map( f(V v)): IMap<K, dynamic > - changed:
method IMap.mapWithKey(f(K k, V v)): IMap<K, dynamic> → method IMap.mapWithKey( f(K k, V v)): IMap<K, dynamic > - changed:
method IVector.foldLeft(z, f(previous, A a)) → method IVector.foldLeft( z, f( previous, A a)) - changed:
method IVector.foldRight(z, f(A a, previous)) → method IVector.foldRight( z, f(A a, previous)) - changed:
method IVector.map(f(A a)): IVector → method IVector.map( f(A a)): IVector - changed:
method IVector.pure(a): IVector → method IVector.pure( b): IVector - changed:
method IVectorMonoid.append(IVector a1, IVector a2): IVector → method IVectorMonoid.append(IVector<A> a1, IVector<A> a2): IVector<A> - changed:
method IVectorMonoid.zero(): IVector → method IVectorMonoid.zero(): IVector<A> - changed:
method Left.fold(ifLeft(L l), ifRight(R r)) → method Left.fold( ifLeft(L l), ifRight(R r)) - changed:
method ListMonad.bind(List fa, List f(_)): List → method ListMonad.bind(List fa, List f( a)): List - changed:
method ListMonad.pure(a): List → method ListMonad.pure( a): List - changed:
method ListMonoid.append(List l1, List l2): List → method ListMonoid.append(List<A> l1, List<A> l2): List<A> - changed:
method ListMonoid.zero(): List → method ListMonoid.zero(): List<A> - changed:
method MonadOps.map(f(A a)): F → method MonadOps.map( f(A a)): F - changed:
method MonadOps.pure(a): F → method MonadOps.pure( b): F - changed:
method MonadPlusOps.unite(Foldable gFoldable): F → method MonadPlusOps.unite(Foldable<A> aFoldable): F - changed:
method None.fold(ifNone(), ifSome(A v)) → method None.fold( ifNone(), ifSome(A a)) - changed:
method Option.cata(ifNone(), ifSome(A a)) → method Option.cata( ifNone(), ifSome(A a)) - changed:
method Option.fold(ifNone(), ifSome(A a)) → method Option.fold( ifNone(), ifSome(A a)) - changed:
method Option.getOrElse(A dflt): A → method Option.getOrElse(A dflt()): A - changed:
method Option.map(f(A a)): Option → method Option.map( f(A a)): Option - changed:
method Option.orElse(Option<A> other): Option<A> → method Option.orElse(Option<A> other()): Option<A> - changed:
method Option.pure(a): Option → method Option.pure( b): Option - changed:
method Right.fold(ifLeft(L l), ifRight(R r)) → method Right.fold( ifLeft(L l), ifRight(R r)) - changed:
method Semigroup.appendC(A a1) → method Semigroup.appendC(A a1): Endo<A> - changed:
method Some.fold(ifNone(), ifSome(A v)) → method Some.fold( ifNone(), ifSome(A a)) - changed:
method State.bind(State f(A a)): State<S, dynamic> → method State.bind(State f(A a)): State - changed:
method State.pure(a): State → method State.pure( b): State - changed:
method StateMonad.put(v): State<S, Unit> → method StateMonad.put(S newS): State<S, Unit> - changed:
method StateT.pure(a): StateT → method StateT.pure( b): StateT - changed:
method StateTMonad.bind(StateT<F, S, dynamic> fa, StateT f(_)): StateT<F, S, dynamic> → method StateTMonad.bind(StateT<F, S, dynamic > fa, StateT<F, S, dynamic > f( a)): StateT<F, S, dynamic > - changed:
method StateTMonad.pure(a): StateT<F, S, dynamic> → method StateTMonad.pure( a): StateT<F, S, dynamic > - changed:
method StateTMonad.put(S s): StateT<F, S, Unit> → method StateTMonad.put(S newS): StateT<F, S, Unit> - changed:
method Trampoline.pure(a): Trampoline → method Trampoline.pure( b): Trampoline - changed:
method TraversableOps.map(f(A a)): F → method TraversableOps.map( f(A a)): F - changed:
method TraversableOps.mapWithIndex(f(int i, a)): F → method TraversableOps.mapWithIndex( f(int i, a)): F - changed:
method TraversableOpsTraversable.concatenateO(Semigroup si, F fa) → method TraversableOpsTraversable.concatenateO(Semigroup si, F fa): Option - changed:
method TraversableOpsTraversable.foldLeft(F fa, z, f(previous, a)) → method TraversableOpsTraversable.foldLeft(F fa, z, f( previous, a)) - changed:
method TraversableOpsTraversable.foldMapO(Semigroup si, F fa, f(a)) → method TraversableOpsTraversable.foldMapO(Semigroup si, F fa, f(a)): Option - changed:
method Tuple2.apply(f(T1, T2)) → method Tuple2.apply(Function2 f) - changed:
method Tuple3.apply(f(T1, T2, T3)) → method Tuple3.apply(Function3 f) - changed:
method Tuple4.apply(f(T1, T2, T3, T4)) → method Tuple4.apply(Function4 f) - changed:
typedef Ordering OrderF(a1, a2) → typedef Ordering OrderF<A>(A a1, A a2) - changed:
variable FutureM: final Monad<Future> → variable FutureM: final FutureMonad - changed:
variable IdM: final Monad → variable IdM: final IdMonad - changed:
variable OptionA: final Applicative<Option> → variable OptionA: final OptionMonadPlus - changed:
variable OptionAP: final ApplicativePlus<Option> → variable OptionAP: final OptionMonadPlus - changed:
variable OptionF: final Functor<Option> → variable OptionF: final OptionMonadPlus - changed:
variable OptionM: final Monad<Option> → variable OptionM: final OptionMonadPlus - changed:
variable OptionMP: final MonadPlus<Option> → variable OptionMP: final OptionMonadPlus - added:
class IHashMap<K, V> extends TraversableOps<IHashMap<K, dynamic>, V> - added:
class OptionMonadPlus extends MonadPlusOpsMonad<Option> - added:
ctor IHashMap.empty() - added:
ctor IHashMap.from(Map<K, V> m) - added:
ctor IHashMap.internal(this._map) - added:
ctor OptionMonadPlus() - added:
field IHashMap.")}}": ")).intercalate(StringMi, - added:
field IHashMap.": ")).intercalate(StringMi, - added:
field IHashMap.$: : - added:
function comparableOrder(): Order - added:
function cons( head, IList tail): IList - added:
function emptyAVLNode(): _AVLNode - added:
function emptyIMapAVLNode(): _IMapAVLNode - added:
function emptyVector(): IVector - added:
function firstSemigroup(): Semigroup - added:
function freeM(): Monad<Free > - added:
function idF() - added:
function imapMi(): Monoid<IMap > - added:
function isetMi(Order o): Monoid<ISet > - added:
function ivectorMi(): Monoid<IVector > - added:
function listMi(): Monoid<List > - added:
function nil(): IList - added:
function none(): Option - added:
function secondSemigroup(): Semigroup - added:
function stateM(): StateMonad - added:
function tstateM(): StateTMonad<Trampoline , dynamic > - added:
method Either.operator |(R dflt): R - added:
method Either.orElse(Either<L, R> other()): Either<L, R> - added:
method EvaluationMonad.local(R f(R r), Evaluation<E, R, W, S, dynamic > fa): Evaluation<E, R, W, S, dynamic > - added:
method EvaluationMonad.scope(R scopedR, Evaluation<E, R, W, S, dynamic > fa): Evaluation<E, R, W, S, dynamic > - added:
method Free.bind(Free f(A a)): Free - added:
method Free.map( f(A a)): Free - added:
method IHashMap.foldLeft( z, f( previous, V v)) - added:
method IHashMap.foldLeftKV( z, f( previous, K k, V v)) - added:
method IHashMap.foldRight( z, f(V v, previous)) - added:
method IHashMap.foldRightKV( z, f(K k, V v, previous)) - added:
method IHashMap.get(K k): Option<V> - added:
method IHashMap.map( f(V v)): IHashMap<K, dynamic > - added:
method IHashMap.modify(K k, V f(V v), V dflt): IHashMap<K, V> - added:
method IHashMap.operator ==(other): bool - added:
method IHashMap.put(K k, V v): IHashMap<K, V> - added:
method IHashMap.remove(K k): IHashMap<K, V> - added:
method IHashMap.set(K k, V v): Option<IHashMap<K, V>> - added:
method IHashMap.toMap(): Map<K, V> - added:
method IHashMap.toString(): String - added:
method IHashMap.traverse(Applicative gApplicative, f(V v)) - added:
method IList.filter(bool predicate(A a)): IList<A> - added:
method IList.find(bool predicate(A a)): Option<A> - added:
method IList.flatMap(IList f(A a)): IList - added:
method IdMonad.replicate(int n, fa): IList - added:
method Option.toEither( ifNone()): Either<dynamic , A> - added:
method OptionMonadPlus.map2(Option fa, Option fb, fun( a, b)): Option - added:
method OptionMonadPlus.map3(Option fa, Option fb, Option fc, fun( a, b, c)): Option - added:
method OptionMonadPlus.map4(Option fa, Option fb, Option fc, Option fd, fun( a, b, c, d)): Option - added:
method OptionMonadPlus.map5(Option fa, Option fb, Option fc, Option fd, Option fe, fun( a, b, c, d, e)): Option - added:
method OptionMonadPlus.map6(Option fa, Option fb, Option fc, Option fd, Option fe, Option ff, fun( a, b, c, d, e, f)): Option - added:
method OptionMonadPlus.mapM2(Option fa, Option fb, Option f( a, b)): Option - added:
method Order.andThen(Order<A> secondary): Order<A> - added:
method State.map( f(A a)): State - added:
method StateMonad.bind(State<S, dynamic > fa, State<S, dynamic > f( a)): State<S, dynamic > - added:
method StateMonad.gets( f(S s)): State<S, dynamic > - added:
method StateMonad.map(State<S, dynamic > fa, f( a)): State<S, dynamic > - added:
method StateMonad.pure( a): State<S, dynamic > - added:
method StateT.map( f(A a)): StateT - added:
method StateTMonad.gets( f(S s)): StateT<F, S, dynamic > - added:
method StateTMonad.map(StateT<F, S, dynamic > fa, f( a)): StateT<F, S, dynamic > - added:
method Trampoline.map( f(A a)): Trampoline - added:
method Traversable.traverseM(Applicative gApplicative, Monad<F> fMonad, F fa, f(a)) - added:
method TraversableOps.traverseM(Applicative gApplicative, Monad<F> fMonad, f(A a)) - added:
method Tuple2.map1(Function1 f): Tuple2 - added:
method Tuple2.map2(Function1 f): Tuple2 - added:
typedef A Function0<A>() - added:
typedef B Function1<A, B>(A a) - added:
typedef C Function2<A, B, C>(A a, B b) - added:
typedef D Function3<A, B, C, D>(A a, B b, C c) - added:
typedef E Function4<A, B, C, D, E>(A a, B b, C c, D d) - added:
typedef F Function5<A, B, C, D, E, F>(A a, B b, C c, D d, E e) - added:
typedef G Function6<A, B, C, D, E, F, G>(A a, B b, C c, D d, E e, F f) - added:
variable FirstSemigroup: final Semigroup - added:
variable IHashMapF: final Functor<IHashMap> - added:
variable IHashMapFo: final Foldable<IHashMap> - added:
variable IHashMapTr: final Traversable<IHashMap> - added:
variable SecondSemigroup: final Semigroup