Safe Haskell	Safe-Inferred
Language	GHC2021

U.Codebase.Referent

Documentation

data ConstructorType Source #

Constructors

DataConstructor
EffectConstructor

Instances

Instances details

Show ConstructorType Source #
Instance details Defined in U.Codebase.Referent Methods showsPrec :: Int -> ConstructorType -> ShowS # show :: ConstructorType -> String # showList :: [ConstructorType] -> ShowS #
Eq ConstructorType Source #
Instance details Defined in U.Codebase.Referent Methods (==) :: ConstructorType -> ConstructorType -> Bool # (/=) :: ConstructorType -> ConstructorType -> Bool #
Ord ConstructorType Source #
Instance details Defined in U.Codebase.Referent Methods compare :: ConstructorType -> ConstructorType -> Ordering # (<) :: ConstructorType -> ConstructorType -> Bool # (<=) :: ConstructorType -> ConstructorType -> Bool # (>) :: ConstructorType -> ConstructorType -> Bool # (>=) :: ConstructorType -> ConstructorType -> Bool # max :: ConstructorType -> ConstructorType -> ConstructorType # min :: ConstructorType -> ConstructorType -> ConstructorType #

type Referent = Referent' Reference Reference Source #

type ReferentH = Referent' (Reference' Text (Maybe Hash)) (Reference' Text Hash) Source #

data Referent' termRef typeRef Source #

Constructors

Ref termRef
Con typeRef ConstructorId

Instances

Instances details

Bifoldable Referent' Source #
Instance details Defined in U.Codebase.Referent Methods bifold :: Monoid m => Referent' m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Referent' a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Referent' a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Referent' a b -> c #
Bifunctor Referent' Source #
Instance details Defined in U.Codebase.Referent Methods bimap :: (a -> b) -> (c -> d) -> Referent' a c -> Referent' b d # first :: (a -> b) -> Referent' a c -> Referent' b c # second :: (b -> c) -> Referent' a b -> Referent' a c #
Bitraversable Referent' Source #
Instance details Defined in U.Codebase.Referent Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Referent' a b -> f (Referent' c d) #
Foldable (Referent' termRef) Source #
Instance details Defined in U.Codebase.Referent Methods fold :: Monoid m => Referent' termRef m -> m # foldMap :: Monoid m => (a -> m) -> Referent' termRef a -> m # foldMap' :: Monoid m => (a -> m) -> Referent' termRef a -> m # foldr :: (a -> b -> b) -> b -> Referent' termRef a -> b # foldr' :: (a -> b -> b) -> b -> Referent' termRef a -> b # foldl :: (b -> a -> b) -> b -> Referent' termRef a -> b # foldl' :: (b -> a -> b) -> b -> Referent' termRef a -> b # foldr1 :: (a -> a -> a) -> Referent' termRef a -> a # foldl1 :: (a -> a -> a) -> Referent' termRef a -> a # toList :: Referent' termRef a -> [a] # null :: Referent' termRef a -> Bool # length :: Referent' termRef a -> Int # elem :: Eq a => a -> Referent' termRef a -> Bool # maximum :: Ord a => Referent' termRef a -> a # minimum :: Ord a => Referent' termRef a -> a # sum :: Num a => Referent' termRef a -> a # product :: Num a => Referent' termRef a -> a #
Traversable (Referent' termRef) Source #
Instance details Defined in U.Codebase.Referent Methods traverse :: Applicative f => (a -> f b) -> Referent' termRef a -> f (Referent' termRef b) # sequenceA :: Applicative f => Referent' termRef (f a) -> f (Referent' termRef a) # mapM :: Monad m => (a -> m b) -> Referent' termRef a -> m (Referent' termRef b) # sequence :: Monad m => Referent' termRef (m a) -> m (Referent' termRef a) #
Functor (Referent' termRef) Source #
Instance details Defined in U.Codebase.Referent Methods fmap :: (a -> b) -> Referent' termRef a -> Referent' termRef b # (<$) :: a -> Referent' termRef b -> Referent' termRef a #
Generic (Referent' termRef typeRef) Source #
Instance details Defined in U.Codebase.Referent Associated Types type Rep (Referent' termRef typeRef) :: Type -> Type # Methods from :: Referent' termRef typeRef -> Rep (Referent' termRef typeRef) x # to :: Rep (Referent' termRef typeRef) x -> Referent' termRef typeRef #
(Show termRef, Show typeRef) => Show (Referent' termRef typeRef) Source #
Instance details Defined in U.Codebase.Referent Methods showsPrec :: Int -> Referent' termRef typeRef -> ShowS # show :: Referent' termRef typeRef -> String # showList :: [Referent' termRef typeRef] -> ShowS #
(Eq termRef, Eq typeRef) => Eq (Referent' termRef typeRef) Source #
Instance details Defined in U.Codebase.Referent Methods (==) :: Referent' termRef typeRef -> Referent' termRef typeRef -> Bool # (/=) :: Referent' termRef typeRef -> Referent' termRef typeRef -> Bool #
(Ord termRef, Ord typeRef) => Ord (Referent' termRef typeRef) Source #
Instance details Defined in U.Codebase.Referent Methods compare :: Referent' termRef typeRef -> Referent' termRef typeRef -> Ordering # (<) :: Referent' termRef typeRef -> Referent' termRef typeRef -> Bool # (<=) :: Referent' termRef typeRef -> Referent' termRef typeRef -> Bool # (>) :: Referent' termRef typeRef -> Referent' termRef typeRef -> Bool # (>=) :: Referent' termRef typeRef -> Referent' termRef typeRef -> Bool # max :: Referent' termRef typeRef -> Referent' termRef typeRef -> Referent' termRef typeRef # min :: Referent' termRef typeRef -> Referent' termRef typeRef -> Referent' termRef typeRef #
type Rep (Referent' termRef typeRef) Source #
Instance details Defined in U.Codebase.Referent type Rep (Referent' termRef typeRef) = D1 ('MetaData "Referent'" "U.Codebase.Referent" "unison-codebase-0.0.0-CtmRBaUAigjDhbd95GF6bD" 'False) (C1 ('MetaCons "Ref" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 termRef)) :+: C1 ('MetaCons "Con" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 typeRef) :*: S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 ConstructorId)))

refs_ :: Traversal (Referent' ref ref) (Referent' ref' ref') ref ref' Source #

typeRef_ :: Traversal (Referent' termRef typeRef) (Referent' termRef typeRef') typeRef typeRef' Source #

termRef_ :: Traversal (Referent' termRef typeRef) (Referent' termRef' typeRef) termRef termRef' Source #

_Ref :: Prism (Referent' tmr tyr) (Referent' tmr' tyr) tmr tmr' Source #

_Con :: Prism (Referent' tmr tyr) (Referent' tmr tyr') (tyr, ConstructorId) (tyr', ConstructorId) Source #

toReference :: Referent -> Reference Source #

toReferenceId :: Referent -> Maybe Id Source #

toTermReference :: Referent' termRef typeRef -> Maybe termRef Source #

type Id = Id' Hash Hash Source #

data Id' hTm hTp Source #

Constructors

RefId (Id' hTm)
ConId (Id' hTp) ConstructorId

Instances

Instances details

Bifoldable Id' Source #
Instance details Defined in U.Codebase.Referent Methods bifold :: Monoid m => Id' m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Id' a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Id' a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Id' a b -> c #
Bifunctor Id' Source #
Instance details Defined in U.Codebase.Referent Methods bimap :: (a -> b) -> (c -> d) -> Id' a c -> Id' b d # first :: (a -> b) -> Id' a c -> Id' b c # second :: (b -> c) -> Id' a b -> Id' a c #
Bitraversable Id' Source #
Instance details Defined in U.Codebase.Referent Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Id' a b -> f (Id' c d) #
Functor (Id' hTm) Source #
Instance details Defined in U.Codebase.Referent Methods fmap :: (a -> b) -> Id' hTm a -> Id' hTm b # (<$) :: a -> Id' hTm b -> Id' hTm a #
(Show hTm, Show hTp) => Show (Id' hTm hTp) Source #
Instance details Defined in U.Codebase.Referent Methods showsPrec :: Int -> Id' hTm hTp -> ShowS # show :: Id' hTm hTp -> String # showList :: [Id' hTm hTp] -> ShowS #
(Eq hTm, Eq hTp) => Eq (Id' hTm hTp) Source #
Instance details Defined in U.Codebase.Referent Methods (==) :: Id' hTm hTp -> Id' hTm hTp -> Bool # (/=) :: Id' hTm hTp -> Id' hTm hTp -> Bool #
(Ord hTm, Ord hTp) => Ord (Id' hTm hTp) Source #
Instance details Defined in U.Codebase.Referent Methods compare :: Id' hTm hTp -> Id' hTm hTp -> Ordering # (<) :: Id' hTm hTp -> Id' hTm hTp -> Bool # (<=) :: Id' hTm hTp -> Id' hTm hTp -> Bool # (>) :: Id' hTm hTp -> Id' hTm hTp -> Bool # (>=) :: Id' hTm hTp -> Id' hTm hTp -> Bool # max :: Id' hTm hTp -> Id' hTm hTp -> Id' hTm hTp # min :: Id' hTm hTp -> Id' hTm hTp -> Id' hTm hTp #

toShortHash :: Referent -> ShortHash Source #