zio.prelude
Members list
Packages
Type members
Classlikes
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
The Associative[A] type class describes an associative binary operator for a type A. For example, addition for integers, and string concatenation for strings.
The Associative[A] type class describes an associative binary operator for a type A. For example, addition for integers, and string concatenation for strings.
Associative is at the top of the hierarchy for abstracting over operations to combine types because while there are some operations that are not associative but do obey other laws, it is generally difficult to combine more than two values in interesting ways with these operators, and thus to build solutions to more complicated problems out of solutions to simpler ones.
For example, the mean of two numbers is an operation that is commutative but not associative. However, the lack of associativity is an indication that we can't combine the means of multiple values in an interesting way with this definition. If we attempt to take the mean of three values we always place twice as much weight on one number as the others, which is rarely what we want.
If we instead define this operation using a StatsCounter object then means can be combined in ways that are associative, commutative, and have an identity element, supporting much more interesting modes of composition.
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
trait AssociativeEqual[A]trait CommutativeEqual[A]trait EqualIdempotent[A]trait EqualIdentity[A]trait EqualPartialInverse[A]trait EqualInverse[A]trait Commutative[A]trait CommutativeIdentity[A]trait Idempotent[A]trait Identity[A]trait PartialInverse[A]trait Inverse[A]Show all
- Self type
-
Associative[A]
Attributes
- Companion
- trait
- Supertypes
- Self type
-
Associative.type
An associative binary operator that combines two values of types F[A] and F[B] to produce an F[(A, B)].
An associative binary operator that combines two values of types F[A] and F[B] to produce an F[(A, B)].
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
trait AssociativeBothDeriveEqualInvariant[F]trait CommutativeBothDeriveEqualInvariant[F]trait DeriveEqualIdentityBothInvariant[F]trait CommutativeBoth[F]trait IdentityBoth[F]trait CovariantIdentityBoth[F]Show all
Attributes
- Companion
- trait
- Supertypes
- Self type
-
AssociativeBoth.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
object AssociativeBoth
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
trait BothCompose[=>:]trait ApplicationCompose[=>:]trait EitherCompose[=>:]trait IdentityCompose[=>:]
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
AssociativeCompose.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
An associative binary operator that combines two values of types F[A] and F[B] to produce an F[Either[A, B]].
An associative binary operator that combines two values of types F[A] and F[B] to produce an F[Either[A, B]].
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
AssociativeEither.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
AssociativeFlatten describes a type that can be "flattened" in an associative way. For example, if we have a list of lists of lists, we can flatten it by either flattening the two inner lists and then flattening the resulting lists, or flattening the two outer lists and then flattening that resulting list. Because the operation is associative, the resulting list is the same either way.
AssociativeFlatten describes a type that can be "flattened" in an associative way. For example, if we have a list of lists of lists, we can flatten it by either flattening the two inner lists and then flattening the resulting lists, or flattening the two outer lists and then flattening that resulting list. Because the operation is associative, the resulting list is the same either way.
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
trait CovariantDeriveEqualIdentityFlatten[F]trait IdentityFlatten[F]
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
AssociativeFlatten.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
object Associative
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Companion
- object
- Supertypes
- Self type
-
Bicovariant[<=>]
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
Bicovariant.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
The Commutative type class describes a binary operator for a type A that is both associative and commutative. This means that a1 <> a2 is equal to a2 <> a1 for all values a1 and a2. Examples of commutative operations include addition for integers, but not concatenation for strings.
The Commutative type class describes a binary operator for a type A that is both associative and commutative. This means that a1 <> a2 is equal to a2 <> a1 for all values a1 and a2. Examples of commutative operations include addition for integers, but not concatenation for strings.
Commutative operators are useful because combining values with a commutative operation results in the same value regardless of the order in which values are combined, allowing us to combine values in the order that is most efficient and allowing us to return determinate values even when the order of original values is indeterminate.
Attributes
- Companion
- object
- Supertypes
- Known subtypes
-
trait CommutativeEqual[A]trait CommutativeIdentity[A]
- Self type
-
Commutative[A]
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
Commutative.type
A commutative binary operator that combines two values of types F[A] and F[B] to produce an F[(A, B)].
A commutative binary operator that combines two values of types F[A] and F[B] to produce an F[(A, B)].
Attributes
- Companion
- object
- Supertypes
- Known subtypes
-
trait CommutativeBothDeriveEqualInvariant[F]
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
CommutativeBoth.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
A commutative binary operator that combines two values of types F[A] and F[B] to produce an F[Either[A, B]].
A commutative binary operator that combines two values of types F[A] and F[B] to produce an F[Either[A, B]].
Attributes
- Companion
- object
- Supertypes
- Known subtypes
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
CommutativeEither.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Companion
- object
- Supertypes
- Known subtypes
Attributes
- Companion
- trait
- Supertypes
- Self type
-
Comparison.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Contravariant[F] provides implicit evidence that F[-_] is a contravariant endofunctor in the category of Scala objects.
Contravariant[F] provides implicit evidence that F[-_] is a contravariant endofunctor in the category of Scala objects.
Contravariant instances of type F[A] "consume" values of type A in some sense. For example, Equal[A] takes two values of type A as input and returns a Boolean indicating whether they are equal. Similarly, a Ord[A] takes two values of type A as input and returns an Ordering with the result of comparing them and Hash takes an A value and returns an Int.
Common examples of contravariant instances in ZIO include effects with regard to their environment types, sinks with regard to their input type, and polymorphic queues and references regarding their input types.
Contravariant instances support a contramap operation, which allows transforming the input type given a function from the new input type to the old input type. For example, if we have an Ord[Int] that allows us to compare two integers and we have a function String => Int that returns the length of a string, then we can construct an Ord[String] that compares strings by computing their lengths with the provided function and comparing those.
Attributes
- Companion
- object
- Supertypes
- Known subtypes
-
trait ContravariantDeriveEqual[F]
- Self type
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
Contravariant.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
trait Contravariant[F]trait ContravariantDeriveEqual[F]
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Covariant[F] provides implicit evidence that F[+_] is a covariant endofunctor in the category of Scala objects.
Covariant[F] provides implicit evidence that F[+_] is a covariant endofunctor in the category of Scala objects.
Covariant instances of type F[A] "produce" values of type A in some sense. In some cases, such as with a List[A], this means that they contain values of type A, in which case we can simply access the elements of the collection. In other cases it means that output values of type A which may not already exists, such as with a Function0[A] that produces A values when invoked.
Common examples of covariant instances in ZIO includes effects with respect to their error and value types, sinks with respect to their error and output types, and queues and references with respect to their error and output types.
Covariant instances support a map operation which allows transforming the output type given a function from the old output type to the new output type. For example, if we have a List[String] and a function String => Int that returns the length of a string, then we can construct a List[Int] with the length of each string.
Attributes
- Companion
- object
- Supertypes
- Known subtypes
-
trait CovariantDeriveEqualIdentityFlatten[F]trait CovariantDeriveEqual[F]trait DeriveEqualForEach[F]trait DeriveEqualNonEmptyForEach[F]trait CovariantIdentityBoth[F]trait ForEach[F]trait NonEmptyForEach[F]Show all
- Self type
-
Covariant[F]
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
trait Covariant[F]trait CovariantDeriveEqualIdentityFlatten[F]trait CovariantDeriveEqual[F]trait DeriveEqualForEach[F]trait DeriveEqualNonEmptyForEach[F]trait CovariantIdentityBoth[F]trait ForEach[F]trait NonEmptyForEach[F]Show all
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Debug is an abstraction that describes the ability to render a value of type A to a human readable format for debugging purposes.
Debug is an abstraction that describes the ability to render a value of type A to a human readable format for debugging purposes.
Debug captures this information in a structured data format called a Repr, or a "representation" of the data. This representation can then be rendered to a human readable format using a Renderer, which knows how to render a representation to a specific human readable format. This two step process preserves information when creating the representation and allows rendering it in different ways. For example, we might want to render it as a simple string representation using the Simple renderer or as valid Scala code that we could paste into a REPL with the Scala renderer.
You can use Repr to create structured representations of your own data types and even implement your own Renderer, for example to render representations to JSON, though in most cases the built in renderers will be all that you need.
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
object Debug
Derive[F, Typeclass] represents a universally quantified function from Typeclass[A] to Typeclass[F[A]] for some F[_]. You can think of Derive as a "recipe" for building a Typeclass[F[A]] instance given a Typeclass[A].
Derive[F, Typeclass] represents a universally quantified function from Typeclass[A] to Typeclass[F[A]] for some F[_]. You can think of Derive as a "recipe" for building a Typeclass[F[A]] instance given a Typeclass[A].
For example, if we know how to compare values of type A for equality then we can compare lists with elements of type A for equality by checking that the length of the lists is the same and each pair of corresponding elements are equal. And we can do this for any type A as long as it has an Equal instance.
This is used by the library to derive typeclass instances for higher kinded types given typeclass instances for the type they are parameterized on.
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Equal[A] provides implicit evidence that two values of type A can be compared for equality.
Equal[A] provides implicit evidence that two values of type A can be compared for equality.
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
trait AssociativeEqual[A]trait CommutativeEqual[A]trait EqualIdempotent[A]trait EqualIdentity[A]trait EqualPartialInverse[A]trait EqualInverse[A]trait AbsorptionEqual[A]trait DistributiveAbsorptionEqual[A]trait ExcludedMiddleEqual[A]trait InvolutionEqual[A]trait NoncontradictionEqual[A]trait DistributiveProdEqual[A]trait AnnihilationEqual[A]trait Hash[A]trait HashPartialOrd[A]trait HashOrd[A]trait PartialOrd[A]trait Ord[A]Show all
- Self type
-
Equal[A]
Attributes
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
object Equal
An Equivalence[A, B] defines an equivalence between two types A and B. These types represent different ways to store the same information.
An Equivalence[A, B] defines an equivalence between two types A and B. These types represent different ways to store the same information.
For example, a List[Byte] is equivalent to a Vector[Byte]. Similarly, a List[Char] is equivalent to a String.
Equivalences are symmetrical. So if A is equivalent to B, then B is equivalent to A.
Value parameters
- from
-
A function that converts a
Binto anA. - to
-
A function that converts an
Ainto aB.
Attributes
- Companion
- object
- Supertypes
- Self type
-
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
Equivalence.type
ForEach is an abstraction that describes the ability to iterate over a collection, performing an effect for each element in the collection and returning a collection with the same shape in the context of the effect.
ForEach is an abstraction that describes the ability to iterate over a collection, performing an effect for each element in the collection and returning a collection with the same shape in the context of the effect.
By choosing the appropriate effect type to traverse with a wide range of operations on collections can be described. In particular, by traversing with state we can describe folds which allow implementing a wide variety of collection operations that produce summaries from a collection of values.
Attributes
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Hash[A] provides implicit evidence that a value of type A can be hashed.
Hash[A] provides implicit evidence that a value of type A can be hashed.
Attributes
- Companion
- object
- Supertypes
- Known subtypes
-
trait HashPartialOrd[A]trait HashOrd[A]
- Self type
-
Hash[A]
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
The Idempotent type class describes a binary operator for a type A that is both associative and produces the same value when combining two identical values. This means that a <> a is equal to a for all values a. Example of idempotent operations is union of sets, but not addition of integers.
The Idempotent type class describes a binary operator for a type A that is both associative and produces the same value when combining two identical values. This means that a <> a is equal to a for all values a. Example of idempotent operations is union of sets, but not addition of integers.
Idempotent operators are useful because combining the values with an idempotent operation results in the same value regardless of the number of values are combined, allowing us to optimize out unnecessary combinations of the same values.
Attributes
- Companion
- object
- Supertypes
- Known subtypes
-
trait EqualIdempotent[A]
- Self type
-
Idempotent[A]
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
Idempotent.type
The Identity type class describes an associative binary operator for a type A that also has an identity element. Combining any value with the identity element on either the left or the right must return the original value unchanged. For example, zero is an identity element for integer addition and the empty string is an identity element for string concatenation.
The Identity type class describes an associative binary operator for a type A that also has an identity element. Combining any value with the identity element on either the left or the right must return the original value unchanged. For example, zero is an identity element for integer addition and the empty string is an identity element for string concatenation.
Operators with an identity element are useful because the identity element provides a sensible default value when combining values of a type and no values exist.
Attributes
- Companion
- object
- Supertypes
- Known subtypes
-
trait CommutativeIdentity[A]trait EqualIdentity[A]trait EqualPartialInverse[A]trait EqualInverse[A]trait PartialInverse[A]trait Inverse[A]Show all
A binary operator that combines two values of types F[A] and F[B] to produce an F[(A, B)] with an identity.
A binary operator that combines two values of types F[A] and F[B] to produce an F[(A, B)] with an identity.
Attributes
- Companion
- object
- Supertypes
- Known subtypes
-
trait CovariantIdentityBoth[F]trait DeriveEqualIdentityBothInvariant[F]
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
IdentityBoth.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Supertypes
A binary operator that combines two values of types F[A] and F[B] to produce an F[Either[A, B]] with an identity value.
A binary operator that combines two values of types F[A] and F[B] to produce an F[Either[A, B]] with an identity value.
Attributes
- Companion
- object
- Supertypes
- Known subtypes
-
trait DeriveEqualIdentityEitherInvariant[F]
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
IdentityEither.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
IdentityFlatten described a type that can be "flattened" in an associative way and has an identity element with respect to that operation. For example, with a list we can always vacuously add a layer by wrapping a list in another list constructor and flattening the resulting list always returns the original list unchanged.
IdentityFlatten described a type that can be "flattened" in an associative way and has an identity element with respect to that operation. For example, with a list we can always vacuously add a layer by wrapping a list in another list constructor and flattening the resulting list always returns the original list unchanged.
Attributes
- Companion
- object
- Supertypes
- Known subtypes
-
trait CovariantDeriveEqualIdentityFlatten[F]
- Self type
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
IdentityFlatten.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
trait AssociativeBothDeriveEqualInvariant[F]trait CommutativeBothDeriveEqualInvariant[F]trait DeriveEqualIdentityBothInvariant[F]trait DeriveEqualIdentityEitherInvariant[F]trait Contravariant[F]trait ContravariantDeriveEqual[F]trait Covariant[F]trait CovariantDeriveEqualIdentityFlatten[F]trait CovariantDeriveEqual[F]trait DeriveEqualForEach[F]trait DeriveEqualNonEmptyForEach[F]trait CovariantIdentityBoth[F]trait ForEach[F]trait NonEmptyForEach[F]Show all
- Self type
-
Invariant[F]
Attributes
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
object Invariant
The Inverse type class describes an associative binary operator for a type A that has an identity element and an inverse binary operator. Combining any value with itself with the inverse operator must return the identity element. For example, for integer addition zero is an identity element and subtraction is an inverse operation, because subtracting any value from itself always returns zero.
The Inverse type class describes an associative binary operator for a type A that has an identity element and an inverse binary operator. Combining any value with itself with the inverse operator must return the identity element. For example, for integer addition zero is an identity element and subtraction is an inverse operation, because subtracting any value from itself always returns zero.
Because Inverse defines a binary rather than a unary operator it can be used to describe inverse operations for types that do not have inverse values. For example, the natural numbers do not have inverses because the set of natural numbers does not include negative numbers. But we can still define a subtraction operation that is the inverse of addition for the natural numbers, since subtracting a number from itself always returns zero.
Attributes
- Companion
- object
- Supertypes
-
trait PartialInverse[A]trait Identity[A]trait Associative[A]class Objecttrait Matchableclass AnyShow all
- Known subtypes
-
trait EqualInverse[A]
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
object Invariant
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
object NonEmptyList
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
object ZValidation
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
object ZNonEmptySet
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
object ZSet
Attributes
- Supertypes
- Known subtypes
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
A NonEmptyForEach describes a ForEach that is guaranteed to contain at least one element, such as a NonEmptyList, a NonEmptyChunk, or certain tree like data structures.
A NonEmptyForEach describes a ForEach that is guaranteed to contain at least one element, such as a NonEmptyList, a NonEmptyChunk, or certain tree like data structures.
Because of the additional information that there is always at least one element, certain operations are available on a NonEmptyForEach that are not available on a ForEach. For example, if an ordering is defined on the elements of a NonEmptyForEach then min and max are defined, whereas for a ForEach only minOption and maxOption would be, since the collection might not contain any elements at all.
Attributes
- Companion
- object
- Supertypes
- Known subtypes
-
trait DeriveEqualNonEmptyForEach[F]
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
NonEmptyForEach.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
A NonEmptyList[A] is a list of one or more values of type A. Unlike a List, a NonEmptyList is guaranteed to contain at least one element. This additional structure allows some operations to be defined on NonEmptyList that are not safe on List, such as head and reduceAll.
A NonEmptyList[A] is a list of one or more values of type A. Unlike a List, a NonEmptyList is guaranteed to contain at least one element. This additional structure allows some operations to be defined on NonEmptyList that are not safe on List, such as head and reduceAll.
For interoperability with Scala's collection library an implicit conversion is provided from NonEmptyList to the :: case of List. Operations that cannot preserve the guarantee that the resulting collection must have at least one element will return a List instead.
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
- Self type
-
NonEmptyList[A]
Attributes
- Companion
- trait
- Supertypes
- Self type
-
NonEmptyList.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
A non-empty wrapper for the scala immutable map. Note - this does not attempt to implement all features of map but what the author considers to be the "normal ones".
A non-empty wrapper for the scala immutable map. Note - this does not attempt to implement all features of map but what the author considers to be the "normal ones".
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
Attributes
- Companion
- class
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
NonEmptyMap.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
NonEmptySet[A]
Attributes
- Companion
- class
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
NonEmptySet.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
A non-empty wrapper for the scala immutable map. Note - this does not attempt to implement all features of map but what the author considers to be the "normal ones".
A non-empty wrapper for the scala immutable map. Note - this does not attempt to implement all features of map but what the author considers to be the "normal ones".
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
Attributes
- Companion
- class
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
NonEmptySortedMap.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
Attributes
- Companion
- class
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
NonEmptySortedSet.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Ord[A] provides implicit evidence that values of type A have a total ordering.
Ord[A] provides implicit evidence that values of type A have a total ordering.
Attributes
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
An Ordering is the result of comparing two values. The result may be LessThan, Equals, or GreaterThan.
An Ordering is the result of comparing two values. The result may be LessThan, Equals, or GreaterThan.
Attributes
- Companion
- object
- Supertypes
-
trait PartialOrderingtrait Serializabletrait Producttrait Equalsclass Objecttrait Matchableclass AnyShow all
- Known subtypes
- Self type
ParSeq is a data type that represents some notion of "events" that can take place in parallel or in sequence. For example, a ParSeq parameterized on some error type could be used to model the potentially multiple ways that an application can fail. On the other hand, a ParSeq` parameterized on some request type could be used to model a collection of requests to external data sources, some of which could be executed in parallel and some of which must be executed sequentially.
ParSeq is a data type that represents some notion of "events" that can take place in parallel or in sequence. For example, a ParSeq parameterized on some error type could be used to model the potentially multiple ways that an application can fail. On the other hand, a ParSeq` parameterized on some request type could be used to model a collection of requests to external data sources, some of which could be executed in parallel and some of which must be executed sequentially.
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
- Self type
-
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
- Self type
-
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
PartialEquivalence.type
The PartialInverse type class describes an associative binary operator for a type A that has an identity element and an inverse binary operator. Combining any value with itself with the inverse operator must return the identity element. There may be an exception, where the result is not defined. For example, for multiplication of reals, one is an identity element and division is an inverse operation, because dividing any value by itself always returns one.
The PartialInverse type class describes an associative binary operator for a type A that has an identity element and an inverse binary operator. Combining any value with itself with the inverse operator must return the identity element. There may be an exception, where the result is not defined. For example, for multiplication of reals, one is an identity element and division is an inverse operation, because dividing any value by itself always returns one.
Because PartialInverse defines a binary rather than a unary operator it can be used to describe inverse operations for types that do not have inverse values. For example, the natural numbers do not have inverses because the set of natural numbers does not include negative numbers. But we can still define a subtraction operation that is the inverse of addition for the natural numbers, since subtracting a number from itself always returns zero.
Attributes
- Companion
- object
- Supertypes
- Known subtypes
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
PartialInverse.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
PartialOrd[A] provides implicit evidence that values of type A have a partial ordering.
PartialOrd[A] provides implicit evidence that values of type A have a partial ordering.
Attributes
- Companion
- object
- Supertypes
- Known subtypes
- Self type
-
PartialOrd[A]
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
PartialOrd.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Companion
- object
- Supertypes
- Known subtypes
- Self type
Attributes
- Companion
- trait
- Supertypes
- Self type
-
PartialOrdering.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
-
trait Bicovariant[<=>]trait Divariant[=>:]
A SafeFunction is a function that can be freely composed with the guarantee that functions of arbitrary size can be evaluated in constant stack space. It does this by maintaining each of the composed functions internally in a data structure and evaluating them in a loop when the function is called.
A SafeFunction is a function that can be freely composed with the guarantee that functions of arbitrary size can be evaluated in constant stack space. It does this by maintaining each of the composed functions internally in a data structure and evaluating them in a loop when the function is called.
Attributes
- Companion
- object
- Supertypes
-
trait In => Outclass Objecttrait Matchableclass Any
- Self type
-
Attributes
- Companion
- class
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
SafeFunction.type
Attributes
- Supertypes
- Known subtypes
Attributes
- Supertypes
Provides versions of assertions from ZIO Test that use Equal, Ord, and Validation.
Provides versions of assertions from ZIO Test that use Equal, Ord, and Validation.
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
These is a data type representing a value that may either be a Left with anA, a Right with a B, or a Both with an A and a B.
These is a data type representing a value that may either be a Left with anA, a Right with a B, or a Both with an A and a B.
These can be useful to model certain domains where both values may be present in addition to one or the other. For example, in streaming applications we may want to consume values from two upstream producers concurrently. Depending on the timing of the producers either one producer, the other, or both producers may have values that are ready to be consumed. Using These provides a convenient way to model all of these possibilities in a single "flat" data type.
These can also be useful for representing computations that may produce both a value and an error. For example, transferring money between two bank accounts might either succeed, fail completely if there are not sufficient funds, or succeed with some warnings if the sender's account balance would be very low after the transfer or the receiver's account has not been verified. These allows modeling these types of computations and preserving information regarding all errors while still potentially returning a successful computation.
Attributes
- Companion
- object
- Supertypes
- Known subtypes
- Self type
-
Convience type that helps with defining a Newtype with a custom (so anything that is not expressable with an Assertion) predicate that should be checked during compile-time.
Convience type that helps with defining a Newtype with a custom (so anything that is not expressable with an Assertion) predicate that should be checked during compile-time.
Define this in a separate file then the Newtype itself!
File 1:
import zio.prelude.Validator
object PalindromeValidator extends Validator[String](str =>
if (str.reverse == str) Right(()) else Left(AssertionError.failure("isPalindrome"))
)
File 2:
type Palindrome = Palindrome.type
object Palindrome extends NewtypeCustom[String] {
protected def validate(value: Int) = PalindromeValidator.validate(value)
protected inline def validateInline(inline value: Int) =
${ PalindromeValidator.validateInlineImpl('value) }
}
Attributes
- Supertypes
Similar to ZSet, a ZNonEmptySet[A, B] is a guaranteed non-empty set of A values where B represents some notion of "how many" A values are included in the set. This can be the number of times each element appears in the set if B is a natural number, the probability associated with an element in the set if B is a rational number, or even whether an element appears at all if B is a boolean.
Similar to ZSet, a ZNonEmptySet[A, B] is a guaranteed non-empty set of A values where B represents some notion of "how many" A values are included in the set. This can be the number of times each element appears in the set if B is a natural number, the probability associated with an element in the set if B is a rational number, or even whether an element appears at all if B is a boolean.
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
Attributes
- Companion
- class
- Supertypes
- Self type
-
ZNonEmptySet.type
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
A ZSet[A, B] is a set of A values where B represents some notion of "how many" A values are included in the set. This can be the number of times each element appears in the set if B is a natural number, the probability associated with an element in the set if B is a rational number, or even whether an element appears at all if B is a boolean.
A ZSet[A, B] is a set of A values where B represents some notion of "how many" A values are included in the set. This can be the number of times each element appears in the set if B is a natural number, the probability associated with an element in the set if B is a rational number, or even whether an element appears at all if B is a boolean.
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
Attributes
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
ZValidation represents either a success of type A or a collection of one or more errors of type E along with in either case a log with entries of type W. Unlike Either, ZValidation does not "short circuit" on failures and instead allows accumulating multiple errors. This can be particularly useful in validating data, where we want to attempt to validate all of the data and retain information about all errors that arose, rather than failing at the first error.
ZValidation represents either a success of type A or a collection of one or more errors of type E along with in either case a log with entries of type W. Unlike Either, ZValidation does not "short circuit" on failures and instead allows accumulating multiple errors. This can be particularly useful in validating data, where we want to attempt to validate all of the data and retain information about all errors that arose, rather than failing at the first error.
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
- Known subtypes
- Self type
-
Attributes
- Companion
- trait
- Supertypes
- Self type
-
ZValidation.type
Abstract over type constructor with 3 parameters: on first as contravariant and on second and third as covariant.
Attributes
- Supertypes
-
class Objecttrait Matchableclass Any
Inherited classlikes
Provides infix syntax for associative operations for contravariant types.
Provides infix syntax for associative operations for contravariant types.
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for associative operations for covariant types.
Provides infix syntax for associative operations for covariant types.
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for associative operations for invariant types.
Provides infix syntax for associative operations for invariant types.
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- AssociativeComposeSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for associative operations for contravariant types.
Provides infix syntax for associative operations for contravariant types.
Attributes
- Inherited from:
- AssociativeEitherSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for associative operations for covariant types.
Provides infix syntax for associative operations for covariant types.
Attributes
- Inherited from:
- AssociativeEitherSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for associative operations for invariant types.
Provides infix syntax for associative operations for invariant types.
Attributes
- Inherited from:
- AssociativeEitherSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for flattening covariant types.
Provides infix syntax for flattening covariant types.
Attributes
- Inherited from:
- AssociativeFlattenSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for flattening types.
Provides infix syntax for flattening types.
Attributes
- Inherited from:
- AssociativeFlattenSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for combining two values with an associative operation.
Provides infix syntax for combining two values with an associative operation.
Attributes
- Inherited from:
- AssociativeSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- BicovariantSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for commutative operations for contravariant types.
Provides infix syntax for commutative operations for contravariant types.
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for commutative operations for covariant types.
Provides infix syntax for commutative operations for covariant types.
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for commutative operations for invariant types.
Provides infix syntax for commutative operations for invariant types.
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- CommutativeBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for commutative operations for contravariant types.
Provides infix syntax for commutative operations for contravariant types.
Attributes
- Inherited from:
- CommutativeEitherSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for commutative operations for covariant types.
Provides infix syntax for commutative operations for covariant types.
Attributes
- Inherited from:
- CommutativeEitherSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for commutative operations for invariant types.
Provides infix syntax for commutative operations for invariant types.
Attributes
- Inherited from:
- CommutativeEitherSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- ConstExports
- Supertypes
Provides infix syntax for mapping over covariant values.
Provides infix syntax for mapping over covariant values.
Attributes
- Inherited from:
- ContravariantSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for mapping over covariant values.
Provides infix syntax for mapping over covariant values.
Attributes
- Inherited from:
- CovariantSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- DebugSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- DebugSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- DivariantSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for comparing two values for equality.
Provides infix syntax for comparing two values for equality.
Attributes
- Inherited from:
- EqualSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for flip1.
Provides infix syntax for flip1.
Attributes
- Inherited from:
- NonEmptyForEachSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for flip.
Provides infix syntax for flip.
Attributes
- Inherited from:
- ForEachSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for traversing collections.
Provides infix syntax for traversing collections.
Attributes
- Inherited from:
- ForEachSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for hashing a value.
Provides infix syntax for hashing a value.
Attributes
- Inherited from:
- HashSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- IdentityBothSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- IdentityEitherSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for combining two values with an associative operation.
Provides infix syntax for combining two values with an associative operation.
Attributes
- Inherited from:
- IdentitySyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for mapping over invariant values.
Provides infix syntax for mapping over invariant values.
Attributes
- Inherited from:
- InvariantSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for combining two values with an inverse operation.
Provides infix syntax for combining two values with an inverse operation.
Attributes
- Inherited from:
- InverseSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
The class of objects corresponding to parameterized newtypes. Users should implement an object that extends this class to create their own parameterized newtypes
The class of objects corresponding to parameterized newtypes. Users should implement an object that extends this class to create their own parameterized newtypes
object Sum extends NewtypeF
type Sum[A] = Sum.Type[A]
Attributes
- Inherited from:
- NewtypeFExports
- Supertypes
- Known subtypes
Provides infix syntax for traversing collections.
Provides infix syntax for traversing collections.
Attributes
- Inherited from:
- NonEmptyForEachSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- NonEmptyListSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- NonEmptyListSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- NonEmptySetSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- NonEmptySetSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for comparing two values with a total ordering.
Provides infix syntax for comparing two values with a total ordering.
Attributes
- Inherited from:
- OrdSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for combining two values with an inverse operation.
Provides infix syntax for combining two values with an inverse operation.
Attributes
- Inherited from:
- PartialInverseSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Provides infix syntax for comparing two values with a total ordering.
Provides infix syntax for comparing two values with a total ordering.
Attributes
- Inherited from:
- PartialOrdSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
The class of objects corresponding to parameterized subtypes. Users should implement an object that extends this class to create their own parameterized subtypes
The class of objects corresponding to parameterized subtypes. Users should implement an object that extends this class to create their own parameterized subtypes
object Sum extends SubtypeF
type Sum[A] = Sum.Type[A]
Attributes
- Inherited from:
- NewtypeFExports
- Supertypes
- Known subtypes
Attributes
- Inherited from:
- ZNonEmptySetSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- ZNonEmptySetSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- ZSetSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Attributes
- Inherited from:
- ZSetSyntax
- Supertypes
-
class Objecttrait Matchableclass Any
Types
Value members
Concrete fields
Implicits
Inherited implicits
Provides infix syntax for associative operations for contravariant types.
Provides infix syntax for associative operations for contravariant types.
Attributes
- Inherited from:
- AssociativeBothSyntax
Provides infix syntax for associative operations for covariant types.
Provides infix syntax for associative operations for covariant types.
Attributes
- Inherited from:
- AssociativeBothSyntax
Provides infix syntax for associative operations for invariant types.
Provides infix syntax for associative operations for invariant types.
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeBothSyntax
Attributes
- Inherited from:
- AssociativeComposeSyntax
Provides infix syntax for associative operations for contravariant types.
Provides infix syntax for associative operations for contravariant types.
Attributes
- Inherited from:
- AssociativeEitherSyntax
Provides infix syntax for associative operations for covariant types.
Provides infix syntax for associative operations for covariant types.
Attributes
- Inherited from:
- AssociativeEitherSyntax
Provides infix syntax for associative operations for invariant types.
Provides infix syntax for associative operations for invariant types.
Attributes
- Inherited from:
- AssociativeEitherSyntax
Provides infix syntax for flattening covariant types.
Provides infix syntax for flattening covariant types.
Attributes
- Inherited from:
- AssociativeFlattenSyntax
Provides infix syntax for flattening types.
Provides infix syntax for combining two values with an associative operation.
Provides infix syntax for combining two values with an associative operation.
Attributes
- Inherited from:
- AssociativeSyntax
Attributes
- Inherited from:
- BicovariantSyntax
Provides infix syntax for commutative operations for contravariant types.
Provides infix syntax for commutative operations for contravariant types.
Attributes
- Inherited from:
- CommutativeBothSyntax
Provides infix syntax for commutative operations for covariant types.
Provides infix syntax for commutative operations for covariant types.
Attributes
- Inherited from:
- CommutativeBothSyntax
Provides infix syntax for commutative operations for invariant types.
Provides infix syntax for commutative operations for invariant types.
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Attributes
- Inherited from:
- CommutativeBothSyntax
Provides infix syntax for commutative operations for contravariant types.
Provides infix syntax for commutative operations for contravariant types.
Attributes
- Inherited from:
- CommutativeEitherSyntax
Provides infix syntax for commutative operations for covariant types.
Provides infix syntax for commutative operations for covariant types.
Attributes
- Inherited from:
- CommutativeEitherSyntax
Provides infix syntax for commutative operations for invariant types.
Provides infix syntax for commutative operations for invariant types.
Attributes
- Inherited from:
- CommutativeEitherSyntax
Provides infix syntax for mapping over covariant values.
Provides infix syntax for mapping over covariant values.
Attributes
- Inherited from:
- ContravariantSyntax
Provides infix syntax for mapping over covariant values.
Attributes
- Inherited from:
- DebugSyntax
Attributes
- Inherited from:
- DivariantSyntax
Provides infix syntax for comparing two values for equality.
Provides infix syntax for flip1.
Provides infix syntax for flip.
Provides infix syntax for traversing collections.
Provides infix syntax for hashing a value.
Attributes
- Inherited from:
- IdentityBothSyntax
Attributes
- Inherited from:
- IdentityEitherSyntax
Provides infix syntax for combining two values with an associative operation.
Provides infix syntax for combining two values with an associative operation.
Attributes
- Inherited from:
- IdentitySyntax
Provides infix syntax for mapping over invariant values.
Provides infix syntax for combining two values with an inverse operation.
Provides infix syntax for combining two values with an inverse operation.
Attributes
- Inherited from:
- InverseSyntax
Provides infix syntax for traversing collections.
Attributes
- Inherited from:
- NonEmptyListSyntax
Attributes
- Inherited from:
- NonEmptyListSyntax
Attributes
- Inherited from:
- NonEmptySetSyntax
Attributes
- Inherited from:
- NonEmptySetSyntax
Provides infix syntax for comparing two values with a total ordering.
Provides infix syntax for comparing two values with a total ordering.
Attributes
- Inherited from:
- OrdSyntax
Provides infix syntax for combining two values with an inverse operation.
Provides infix syntax for combining two values with an inverse operation.
Attributes
- Inherited from:
- PartialInverseSyntax
Provides infix syntax for comparing two values with a total ordering.
Provides infix syntax for comparing two values with a total ordering.
Attributes
- Inherited from:
- PartialOrdSyntax
Attributes
- Inherited from:
- ZNonEmptySetSyntax
Attributes
- Inherited from:
- ZNonEmptySetSyntax
Attributes
- Inherited from:
- ZSetSyntax
Attributes
- Inherited from:
- ZSetSyntax
Attributes
- Inherited from:
- ZivariantSyntax