DSL

The strict identity type constructor. Can be thought of as Tuple1, but with no runtime representation.

Vary the value of m get k.

Vary the value of m get k.

Requires explicit usage as the use of Await.result. Can throw an exception, which is inherently bad.

Grab a value out of SortedMap if it's present. Otherwise evaluate a value to be placed at that key in the SortedMap.

Grab a value out of Map if it's present. Otherwise evaluate a value to be placed at that key in the Map.

As with SortedMap.updated, but resolve a collision with f. The first argument is guaranteed to be from m1.

As with Map.updated, but resolve a collision with f. The first argument is guaranteed to be from m1.

Collect only elements with matching keys, joining their associated values with f.

Collect only elements with matching keys, joining their associated values with f.

Like intersectWith, but tell f about the key.

Like intersectWith, but tell f about the key.

Exchange keys of m according to f. Result may be smaller if f maps two or more Ks to the same K2, in which case the resulting associated value is an arbitrary choice.

Exchange keys of m according to f. Result may be smaller if f maps two or more Ks to the same K2, in which case the resulting associated value is an arbitrary choice.

Union, resolving collisions with f, where the first arg is guaranteed to be from m1, the second from m2.

Union, resolving collisions with f, where the first arg is guaranteed to be from m1, the second from m2.

Like unionWith, but telling f about the key.

Like unionWith, but telling f about the key.

Right biased monad

An alternative scalaz.Applicative instance for LazyList, discriminated by the type tag scalaz.Tags.Zip, that zips lazylists together.

Example:

import scalaz.Tags.Zip
lazylistZipApplicative.apply2(Zip(LazyList(1, 2)), Zip(LazyList(3, 4)))(_ * _) // LazyList(3, 8)

Covariant over the value parameter, where plus applies the Last semigroup to values.

Map union monoid, unifying values with V's append.

Add None as an element less than all As.

We could derive set equality from Equal[A], but it would be O(n^2). Instead, we require Order[A], reducing the complexity to O(log n)

If Equal[A].equalIsNatural == true, than Any#== is used.

Covariant over the value parameter, where plus applies the Last semigroup to values.

SortedMap union monoid, unifying values with V's append.

An alternative scalaz.Applicative instance for Stream, discriminated by the type tag scalaz.Tags.Zip, that zips streams together.

Example:

import scalaz.Tags.Zip
streamZipApplicative.apply2(Zip(Stream(1, 2)), Zip(Stream(3, 4)))(_ * _) // Stream(3, 8)

Tuple1[A] is isomorphic to Id[X]

Product BindRec

Product functor and comonad