Adam Fraser
Adam Fraser
I don't think that is right in the absence of additional structure on `f` and `g`. For example, let's try to create an `Associative[String]` given an `Associative[Int]` and a pair...
Yes. Let's see if there is anything we can do with the smart types first since similar variants work in ZIO Test without the smart types. But if not we...
@kitlangton Can you take a look at this when you get the chance?
I think we definitely want to have a solution for these composed abstractions. We already have some work in this direction, for example the `compose` operator on `AssociativeBoth`, but I'm...
ZIO already has a `NonEmptyChunk` data type that you can use as a replacement for `NonEmptyVector`. A `NonEmptyMap` that wraps a `Map` similar to how `NonEmptySet` wraps a `Set` would...
There has been significant work on performance since then though random access will always be faster if you `materialize` it first.
Great! Let me know if you need any help!
If you just run SBT and go to one of the `JVM` projects you can test that on just the JVM and the latest Scala version. Eventually it will need...
Yes I think we don't need five laws. The formulation I have seen normally has two, an identity law that calling `foreach` with the identity function returns the value unchanged,...
I don't have very strong feelings one way or the other. You're right that the `prelude` name comes from Haskell and the Scala equivalent would be `Predef`. At the same...