Untagged.Union

data OneOf :: Type -> Type -> Type

Instances

• (Eq a, Eq b, HasRuntimeType a) => Eq (OneOf a b)
• (HasRuntimeType a, HasRuntimeType a') => HasRuntimeType (OneOf a a')
• (InOneOf a h' t') => InOneOf a h (OneOf h' t')
• (InOneOf a h t) => Coercible a (OneOf h t)
• (Reducible tf b o, HasRuntimeType a) => Reducible (Tuple (a -> o) tf) (OneOf a b) o

Operator alias for Untagged.Union.OneOf (right-associative / precedence 7)

class InOneOf a h t 

Instances

• InOneOf a a t
• InOneOf a h a
• (InOneOf a h' t') => InOneOf a h (OneOf h' t')

type UndefinedOr a = OneOf Undefined a

asOneOf :: forall t h a. Coercible a (OneOf h t) => a -> OneOf h t

fromOneOf :: forall a t h. InOneOf a h t => HasRuntimeType a => OneOf h t -> Maybe a

toEither1 :: forall b a. HasRuntimeType a => OneOf a b -> Either a b

Unwraps a single layer of OneOf to an Either Note that for some x :: a |+| b. If the value x has a runtime value that can be read as either types a and b, then toEither1 x will return Left.

Example: toEither1 (asOneOf 3.0 :: Int |+| Number) == Left 3

getLeft :: forall b a. HasRuntimeType a => OneOf a b -> Maybe a

getLeft' :: forall b a. HasRuntimeType b => OneOf a b -> Maybe a

getRight :: forall b a. HasRuntimeType b => OneOf a b -> Maybe b

getRight' :: forall b a. HasRuntimeType a => OneOf a b -> Maybe b

defined :: forall a. a -> UndefinedOr a

uorToMaybe :: forall a. UndefinedOr a -> Maybe a

maybeToUor :: forall a. Maybe a -> UndefinedOr a

withUor :: forall b a. (a -> b) -> UndefinedOr a -> UndefinedOr b

fromUndefinedOr :: forall a. a -> UndefinedOr a -> a

class Reducible f i o | i -> f o, f o -> i where

Members

• reduce :: f -> i -> o

Instances

• (Reducible tf b o, HasRuntimeType a) => Reducible (Tuple (a -> o) tf) (OneOf a b) o
• Reducible (a -> b) a b