Safe Haskell	Safe-Inferred
Language	Haskell2010

UVMHS.Core.Data.Dict

Contents

Orphan instances

Documentation

class (Set k s, FunctorM d, OFunctorM d, KFunctorM k d, OKFunctorM k d, BiFunctorM d, OBiFunctorM d, KBiFunctorM k d, OKBiFunctorM k d, Functor d, OFunctor d, KFunctor k d, OKFunctor k d, BiFunctor d, OBiFunctor d, KBiFunctor k d, OKBiFunctor k d, forall x. CSized (d x), forall x. Eq x => Eq (d x), forall x. Ord x => Ord (d x), forall x. ToIter (k ∧ x) (d x), forall x. Single (k ∧ x) (d x), forall x. Lookup k x (d x), forall x. Null (d x), forall x. Append x => Append (d x), forall x. Monoid x => Monoid (d x), forall x. POrd x => POrd (d x), forall x. Bot (d x), forall x. Join x => Join (d x), forall x. JoinLattice x => JoinLattice (d x), forall x. Meet x => Meet (d x), forall x. Difference x => Difference (d x)) => Dict k s d | d -> k, d -> s where Source #

Minimal complete definition

dlteBy, dminView, dmaxView, dkeyView

Methods

dø :: d a Source #

(↦) :: k -> a -> d a infixr 1 Source #

dadd :: k -> a -> d a -> d a Source #

drem :: k -> d a -> d a Source #

dupd :: k -> (a -> 𝑂 a) -> d a -> d a Source #

dlteBy :: (a -> a -> 𝔹) -> d a -> d a -> 𝔹 Source #

dunionBy :: (a -> a -> a) -> d a -> d a -> d a Source #

dinterBy :: (a -> b -> c) -> d a -> d b -> d c Source #

dsdiffBy :: (a -> b -> 𝑂 a) -> d a -> d b -> d a Source #

(⋿) :: forall a. k -> d a -> 𝔹 infix 4 Source #

(⫑) :: Eq a => d a -> d a -> 𝔹 infix 4 Source #

(⩌) :: d a -> d a -> d a infixl 5 Source #

(⩍) :: d a -> d a -> d a infixl 6 Source #

(⧅) :: Eq a => d a -> d a -> d a infixl 5 Source #

dminView :: d a -> 𝑂 ((k ∧ a) ∧ d a) Source #

dmaxView :: d a -> 𝑂 ((k ∧ a) ∧ d a) Source #

dkeyView :: k -> d a -> 𝑂 (a ∧ d a) Source #

dminElem :: d a -> 𝑂 (k ∧ a) Source #

dmaxElem :: d a -> 𝑂 (k ∧ a) Source #

dkeep :: s -> d a -> d a Source #

dtoss :: s -> d a -> d a Source #

dict𝐼 :: 𝐼 (k ∧ a) -> d a Source #

dkeys :: forall a. d a -> s Source #

dvals :: forall a. d a -> 𝐼 a Source #

Instances

Instances details

Ord k => Dict k (𝑃 k) ((⇰) k) Source #

Instance details

Defined in UVMHS.Core.Data.Dict

Methods

dø :: k ⇰ a Source #

(↦) :: k -> a -> k ⇰ a Source #

dadd :: k -> a -> (k ⇰ a) -> k ⇰ a Source #

drem :: k -> (k ⇰ a) -> k ⇰ a Source #

dupd :: k -> (a -> 𝑂 a) -> (k ⇰ a) -> k ⇰ a Source #

dlteBy :: (a -> a -> 𝔹) -> (k ⇰ a) -> (k ⇰ a) -> 𝔹 Source #

dunionBy :: (a -> a -> a) -> (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

dinterBy :: (a -> b -> c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #

dsdiffBy :: (a -> b -> 𝑂 a) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ a Source #

(⋿) :: k -> (k ⇰ a) -> 𝔹 Source #

(⫑) :: Eq a => (k ⇰ a) -> (k ⇰ a) -> 𝔹 Source #

(⩌) :: (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

(⩍) :: (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

(⧅) :: Eq a => (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

dminView :: (k ⇰ a) -> 𝑂 ((k ∧ a) ∧ (k ⇰ a)) Source #

dmaxView :: (k ⇰ a) -> 𝑂 ((k ∧ a) ∧ (k ⇰ a)) Source #

dkeyView :: k -> (k ⇰ a) -> 𝑂 (a ∧ (k ⇰ a)) Source #

dminElem :: (k ⇰ a) -> 𝑂 (k ∧ a) Source #

dmaxElem :: (k ⇰ a) -> 𝑂 (k ∧ a) Source #

dkeep :: 𝑃 k -> (k ⇰ a) -> k ⇰ a Source #

dtoss :: 𝑃 k -> (k ⇰ a) -> k ⇰ a Source #

dict𝐼 :: 𝐼 (k ∧ a) -> k ⇰ a Source #

dkeys :: (k ⇰ a) -> 𝑃 k Source #

dvals :: (k ⇰ a) -> 𝐼 a Source #

dunionByOn :: Dict k s d => d a -> d a -> (a -> a -> a) -> d a Source #

dinterByOn :: Dict k s d => d a -> d b -> (a -> b -> c) -> d c Source #

dinterByM :: (Monad m, Dict k s d) => (a -> b -> m c) -> d a -> d b -> m (d c) Source #

dict :: forall d t a k s. (Dict k s d, ToIter (d a) t) => t -> d a Source #

assoc :: forall d t a k s. (Dict k s d, ToIter (k ∧ a) t) => t -> d a Source #

dø𝐷 :: forall k a. k ⇰ a Source #

(↦♭) :: forall k a. k -> a -> k ⇰ a Source #

dadd𝐷 :: forall k a. Ord k => k -> a -> (k ⇰ a) -> k ⇰ a Source #

drem𝐷 :: forall k a. Ord k => k -> (k ⇰ a) -> k ⇰ a Source #

dupd𝐷 :: forall k a. Ord k => k -> (a -> 𝑂 a) -> (k ⇰ a) -> k ⇰ a Source #

dlteBy𝐷 :: forall k a. Ord k => (a -> a -> 𝔹) -> (k ⇰ a) -> (k ⇰ a) -> 𝔹 Source #

dunionBy𝐷 :: forall k a. Ord k => (a -> a -> a) -> (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

dinterBy𝐷 :: forall k a b c. Ord k => (a -> b -> c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #

dsdiffBy𝐷 :: forall k b a. Ord k => (a -> b -> 𝑂 a) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ a Source #

(⋿♭) :: forall k a. Ord k => k -> (k ⇰ a) -> 𝔹 Source #

(⫑♭) :: forall k a. (Ord k, Eq a) => (k ⇰ a) -> (k ⇰ a) -> 𝔹 Source #

(⩌♭) :: forall k a. Ord k => (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

(⩍♭) :: forall k a. Ord k => (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

(⧅♭) :: forall k a. (Ord k, Eq a) => (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

dminView𝐷 :: forall k a. (k ⇰ a) -> 𝑂 ((k ∧ a) ∧ (k ⇰ a)) Source #

dmaxView𝐷 :: forall k a. (k ⇰ a) -> 𝑂 ((k ∧ a) ∧ (k ⇰ a)) Source #

dkeyView𝐷 :: forall k a. Ord k => k -> (k ⇰ a) -> 𝑂 (a ∧ (k ⇰ a)) Source #

dminElem𝐷 :: forall k a. (k ⇰ a) -> 𝑂 (k ∧ a) Source #

dmaxElem𝐷 :: forall k a. (k ⇰ a) -> 𝑂 (k ∧ a) Source #

dkeep𝐷 :: forall k a. Ord k => 𝑃 k -> (k ⇰ a) -> k ⇰ a Source #

dtoss𝐷 :: forall k a. Ord k => 𝑃 k -> (k ⇰ a) -> k ⇰ a Source #

dict𝐼𝐷 :: forall k a. Ord k => 𝐼 (k ∧ a) -> k ⇰ a Source #

dkeys𝐷 :: forall k a. Ord k => (k ⇰ a) -> 𝑃 k Source #

dvals𝐷 :: forall k a. (k ⇰ a) -> 𝐼 a Source #

mapM𝐷 :: forall m k a b. Monad m => (a -> m b) -> (k ⇰ a) -> m (k ⇰ b) Source #

omapM𝐷 :: forall m k a b. Monad m => (a -> m (𝑂 b)) -> (k ⇰ a) -> m (k ⇰ b) Source #

kmapM𝐷 :: forall m k a b. Monad m => (k -> a -> m b) -> (k ⇰ a) -> m (k ⇰ b) Source #

kmapAtM𝐷 :: forall m k a. (Monad m, Ord k) => k -> (a -> m a) -> (k ⇰ a) -> m (k ⇰ a) Source #

okmapM𝐷 :: forall m k a b. Monad m => (k -> a -> m (𝑂 b)) -> (k ⇰ a) -> m (k ⇰ b) Source #

okmapAtM𝐷 :: forall m k a. (Monad m, Ord k) => k -> (𝑂 a -> m (𝑂 a)) -> (k ⇰ a) -> m (k ⇰ a) Source #

bimapM𝐷 :: forall m k a b c. (Monad m, Ord k) => (a -> m c) -> (b -> m c) -> (a -> b -> m c) -> (k ⇰ a) -> (k ⇰ b) -> m (k ⇰ c) Source #

obimapM𝐷 :: forall m k a b c. (Monad m, Ord k) => (a -> m (𝑂 c)) -> (b -> m (𝑂 c)) -> (a -> b -> m (𝑂 c)) -> (k ⇰ a) -> (k ⇰ b) -> m (k ⇰ c) Source #

kbimapM𝐷 :: forall m k a b c. (Monad m, Ord k) => (k -> a -> m c) -> (k -> b -> m c) -> (k -> a -> b -> m c) -> (k ⇰ a) -> (k ⇰ b) -> m (k ⇰ c) Source #

okbimapM𝐷 :: forall m k a b c. (Monad m, Ord k) => (k -> a -> m (𝑂 c)) -> (k -> b -> m (𝑂 c)) -> (k -> a -> b -> m (𝑂 c)) -> (k ⇰ a) -> (k ⇰ b) -> m (k ⇰ c) Source #

map𝐷 :: forall k a b. (a -> b) -> (k ⇰ a) -> k ⇰ b Source #

omap𝐷 :: forall k a b. (a -> 𝑂 b) -> (k ⇰ a) -> k ⇰ b Source #

kmap𝐷 :: forall k a b. (k -> a -> b) -> (k ⇰ a) -> k ⇰ b Source #

kmapAt𝐷 :: forall k a. Ord k => k -> (a -> a) -> (k ⇰ a) -> k ⇰ a Source #

okmap𝐷 :: forall k a b. (k -> a -> 𝑂 b) -> (k ⇰ a) -> k ⇰ b Source #

okmapAt𝐷 :: forall k a. Ord k => k -> (𝑂 a -> 𝑂 a) -> (k ⇰ a) -> k ⇰ a Source #

bimap𝐷 :: forall k a b c. Ord k => (a -> c) -> (b -> c) -> (a -> b -> c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #

obimap𝐷 :: forall k a b c. Ord k => (a -> 𝑂 c) -> (b -> 𝑂 c) -> (a -> b -> 𝑂 c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #

kbimap𝐷 :: forall k a b c. Ord k => (k -> a -> c) -> (k -> b -> c) -> (k -> a -> b -> c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #

okbimap𝐷 :: forall k a b c. Ord k => (k -> a -> 𝑂 c) -> (k -> b -> 𝑂 c) -> (k -> a -> b -> 𝑂 c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #

csize𝐷 :: forall k a. (k ⇰ a) -> ℕ64 Source #

show𝐷 :: (Show k, Show a) => (k ⇰ a) -> 𝕊 Source #

iter𝐷 :: forall k a. (k ⇰ a) -> 𝐼 (k ∧ a) Source #

single𝐷 :: (k ∧ a) -> k ⇰ a Source #

lookup𝐷 :: forall k a. Ord k => (k ⇰ a) -> k -> 𝑂 a Source #

null𝐷 :: k ⇰ a Source #

append𝐷 :: (Ord k, Append a) => (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

unit𝐷 :: (Ord k, Null k, Null a) => k ⇰ a Source #

cross𝐷 :: (Ord k, Append k, Append a, Cross a) => (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

zero𝐷 :: k ⇰ a Source #

plus𝐷 :: (Ord k, Plus a) => (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

one𝐷 :: (Ord k, Zero k, Zero a) => k ⇰ a Source #

times𝐷 :: (Ord k, Plus k, Plus a, Times a) => (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

plte𝐷 :: (Ord k, POrd a) => (k ⇰ a) -> (k ⇰ a) -> 𝔹 Source #

bot𝐷 :: k ⇰ a Source #

join𝐷 :: (Ord k, Join a) => (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

meet𝐷 :: (Ord k, Meet a) => (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

diff𝐷 :: (Ord k, Difference a) => (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #

all𝐷 :: (Ord k, All k, All a) => 𝐼 (k ⇰ a) Source #

dict𝐷 :: (Ord k, ToIter (k ⇰ a) t) => t -> k ⇰ a Source #

dminKey𝐷 :: (k ⇰ a) -> 𝑂 k Source #

dmaxKey𝐷 :: (k ⇰ a) -> 𝑂 k Source #

data family Elem :: ★ -> ★ Source #

Instances

Instances details

Eq a => Eq (Elem (StdESD a)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (==) :: Elem (StdESD a) -> Elem (StdESD a) -> Bool # (/=) :: Elem (StdESD a) -> Elem (StdESD a) -> Bool #
Ord a => Ord (Elem (StdESD a)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods compare :: Elem (StdESD a) -> Elem (StdESD a) -> Ordering # (<) :: Elem (StdESD a) -> Elem (StdESD a) -> Bool # (<=) :: Elem (StdESD a) -> Elem (StdESD a) -> Bool # (>) :: Elem (StdESD a) -> Elem (StdESD a) -> Bool # (>=) :: Elem (StdESD a) -> Elem (StdESD a) -> Bool # max :: Elem (StdESD a) -> Elem (StdESD a) -> Elem (StdESD a) # min :: Elem (StdESD a) -> Elem (StdESD a) -> Elem (StdESD a) #
Ord e => Single (Elem (StdESD e)) (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods single :: Elem (StdESD e) -> ESet (StdESD e) Source #
Ord e => ToIter (Elem (StdESD e)) (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods iter :: ESet (StdESD e) -> 𝐼 (Elem (StdESD e)) Source #
Ord e => Set (Elem (StdESD e)) (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods pø :: ESet (StdESD e) Source # psingle :: Elem (StdESD e) -> ESet (StdESD e) Source # padd :: Elem (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # prem :: Elem (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # (∈) :: Elem (StdESD e) -> ESet (StdESD e) -> 𝔹 Source # (⊆) :: ESet (StdESD e) -> ESet (StdESD e) -> 𝔹 Source # (∪) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # (∩) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # (∖) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # pminView :: ESet (StdESD e) -> 𝑂 (Elem (StdESD e) ∧ ESet (StdESD e)) Source # pmaxView :: ESet (StdESD e) -> 𝑂 (Elem (StdESD e) ∧ ESet (StdESD e)) Source # pminElem :: ESet (StdESD e) -> 𝑂 (Elem (StdESD e)) Source # pmaxElem :: ESet (StdESD e) -> 𝑂 (Elem (StdESD e)) Source # pow𝐼 :: 𝐼 (Elem (StdESD e)) -> ESet (StdESD e) Source # pvals :: ESet (StdESD e) -> 𝐼 (Elem (StdESD e)) Source #
Ord k => Single (Elem (StdESD k) ∧ a) (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods single :: (Elem (StdESD k) ∧ a) -> EDct (StdESD k) a Source #
newtype Elem (StdESD a) Source #
Instance details Defined in UVMHS.Core.Data.Dict newtype Elem (StdESD a) = StdESDElm { unStdESDElm :: a }

data family ESet :: ★ -> ★ Source #

Instances

Instances details

Eq e => Eq (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (==) :: ESet (StdESD e) -> ESet (StdESD e) -> Bool # (/=) :: ESet (StdESD e) -> ESet (StdESD e) -> Bool #
Ord e => Ord (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods compare :: ESet (StdESD e) -> ESet (StdESD e) -> Ordering # (<) :: ESet (StdESD e) -> ESet (StdESD e) -> Bool # (<=) :: ESet (StdESD e) -> ESet (StdESD e) -> Bool # (>) :: ESet (StdESD e) -> ESet (StdESD e) -> Bool # (>=) :: ESet (StdESD e) -> ESet (StdESD e) -> Bool # max :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) # min :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) #
CSized (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods csize :: ESet (StdESD e) -> ℕ64 Source #
Bot (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods bot :: ESet (StdESD e) Source #
Ord e => Difference (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⊟) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source #
Ord e => Join (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⊔) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source #
Ord e => JoinLattice (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict
Ord e => Meet (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⊓) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source #
Ord e => POrd (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⊑) :: ESet (StdESD e) -> ESet (StdESD e) -> 𝔹 Source #
Ord e => Append (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⧺) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source #
Ord e => Monoid (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict
Null (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods null :: ESet (StdESD e) Source #
Ord e => Single (Elem (StdESD e)) (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods single :: Elem (StdESD e) -> ESet (StdESD e) Source #
Ord e => ToIter (Elem (StdESD e)) (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods iter :: ESet (StdESD e) -> 𝐼 (Elem (StdESD e)) Source #
Ord e => Set (Elem (StdESD e)) (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods pø :: ESet (StdESD e) Source # psingle :: Elem (StdESD e) -> ESet (StdESD e) Source # padd :: Elem (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # prem :: Elem (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # (∈) :: Elem (StdESD e) -> ESet (StdESD e) -> 𝔹 Source # (⊆) :: ESet (StdESD e) -> ESet (StdESD e) -> 𝔹 Source # (∪) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # (∩) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # (∖) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # pminView :: ESet (StdESD e) -> 𝑂 (Elem (StdESD e) ∧ ESet (StdESD e)) Source # pmaxView :: ESet (StdESD e) -> 𝑂 (Elem (StdESD e) ∧ ESet (StdESD e)) Source # pminElem :: ESet (StdESD e) -> 𝑂 (Elem (StdESD e)) Source # pmaxElem :: ESet (StdESD e) -> 𝑂 (Elem (StdESD e)) Source # pow𝐼 :: 𝐼 (Elem (StdESD e)) -> ESet (StdESD e) Source # pvals :: ESet (StdESD e) -> 𝐼 (Elem (StdESD e)) Source #
newtype ESet (StdESD e) Source #
Instance details Defined in UVMHS.Core.Data.Dict newtype ESet (StdESD e) = StdESDSet { unStdESDSet :: 𝑃 e }

data family EDct :: ★ -> ★ -> ★ Source #

Instances

Instances details

Functor (EDct (StdESD k)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods map :: (a -> b) -> EDct (StdESD k) a -> EDct (StdESD k) b Source #
Ord k => FunctorM (EDct (StdESD k)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods mapM :: Monad m => (a -> m b) -> EDct (StdESD k) a -> m (EDct (StdESD k) b) Source #
(Eq k, Eq a) => Eq (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (==) :: EDct (StdESD k) a -> EDct (StdESD k) a -> Bool # (/=) :: EDct (StdESD k) a -> EDct (StdESD k) a -> Bool #
(Ord k, Ord a) => Ord (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods compare :: EDct (StdESD k) a -> EDct (StdESD k) a -> Ordering # (<) :: EDct (StdESD k) a -> EDct (StdESD k) a -> Bool # (<=) :: EDct (StdESD k) a -> EDct (StdESD k) a -> Bool # (>) :: EDct (StdESD k) a -> EDct (StdESD k) a -> Bool # (>=) :: EDct (StdESD k) a -> EDct (StdESD k) a -> Bool # max :: EDct (StdESD k) a -> EDct (StdESD k) a -> EDct (StdESD k) a # min :: EDct (StdESD k) a -> EDct (StdESD k) a -> EDct (StdESD k) a #
Bot (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods bot :: EDct (StdESD k) a Source #
(Ord k, Join a) => Join (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⊔) :: EDct (StdESD k) a -> EDct (StdESD k) a -> EDct (StdESD k) a Source #
(Ord k, Join a) => JoinLattice (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict
(Ord k, Append a) => Append (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⧺) :: EDct (StdESD k) a -> EDct (StdESD k) a -> EDct (StdESD k) a Source #
(Ord k, Append a) => Monoid (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict
Null (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods null :: EDct (StdESD k) a Source #
Ord k => Single (Elem (StdESD k) ∧ a) (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods single :: (Elem (StdESD k) ∧ a) -> EDct (StdESD k) a Source #
newtype EDct (StdESD k) a Source #
Instance details Defined in UVMHS.Core.Data.Dict newtype EDct (StdESD k) a = StdESDDct { unStdESDDct :: k ⇰ a }

class (Set (Elem p) (ESet p), Dict (Elem p) (ESet p) (EDct p)) => ESD p Source #

data StdESD (x :: ★) Source #

Instances

Instances details

Eq e => Eq (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (==) :: ESet (StdESD e) -> ESet (StdESD e) -> Bool # (/=) :: ESet (StdESD e) -> ESet (StdESD e) -> Bool #
Eq a => Eq (Elem (StdESD a)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (==) :: Elem (StdESD a) -> Elem (StdESD a) -> Bool # (/=) :: Elem (StdESD a) -> Elem (StdESD a) -> Bool #
Ord e => Ord (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods compare :: ESet (StdESD e) -> ESet (StdESD e) -> Ordering # (<) :: ESet (StdESD e) -> ESet (StdESD e) -> Bool # (<=) :: ESet (StdESD e) -> ESet (StdESD e) -> Bool # (>) :: ESet (StdESD e) -> ESet (StdESD e) -> Bool # (>=) :: ESet (StdESD e) -> ESet (StdESD e) -> Bool # max :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) # min :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) #
Ord a => Ord (Elem (StdESD a)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods compare :: Elem (StdESD a) -> Elem (StdESD a) -> Ordering # (<) :: Elem (StdESD a) -> Elem (StdESD a) -> Bool # (<=) :: Elem (StdESD a) -> Elem (StdESD a) -> Bool # (>) :: Elem (StdESD a) -> Elem (StdESD a) -> Bool # (>=) :: Elem (StdESD a) -> Elem (StdESD a) -> Bool # max :: Elem (StdESD a) -> Elem (StdESD a) -> Elem (StdESD a) # min :: Elem (StdESD a) -> Elem (StdESD a) -> Elem (StdESD a) #
CSized (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods csize :: ESet (StdESD e) -> ℕ64 Source #
Functor (EDct (StdESD k)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods map :: (a -> b) -> EDct (StdESD k) a -> EDct (StdESD k) b Source #
Ord k => FunctorM (EDct (StdESD k)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods mapM :: Monad m => (a -> m b) -> EDct (StdESD k) a -> m (EDct (StdESD k) b) Source #
Bot (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods bot :: ESet (StdESD e) Source #
Ord e => Difference (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⊟) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source #
Ord e => Join (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⊔) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source #
Ord e => JoinLattice (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict
Ord e => Meet (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⊓) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source #
Ord e => POrd (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⊑) :: ESet (StdESD e) -> ESet (StdESD e) -> 𝔹 Source #
Ord e => Append (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⧺) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source #
Ord e => Monoid (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict
Null (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods null :: ESet (StdESD e) Source #
Ord e => Single (Elem (StdESD e)) (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods single :: Elem (StdESD e) -> ESet (StdESD e) Source #
Ord e => ToIter (Elem (StdESD e)) (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods iter :: ESet (StdESD e) -> 𝐼 (Elem (StdESD e)) Source #
Ord e => Set (Elem (StdESD e)) (ESet (StdESD e)) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods pø :: ESet (StdESD e) Source # psingle :: Elem (StdESD e) -> ESet (StdESD e) Source # padd :: Elem (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # prem :: Elem (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # (∈) :: Elem (StdESD e) -> ESet (StdESD e) -> 𝔹 Source # (⊆) :: ESet (StdESD e) -> ESet (StdESD e) -> 𝔹 Source # (∪) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # (∩) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # (∖) :: ESet (StdESD e) -> ESet (StdESD e) -> ESet (StdESD e) Source # pminView :: ESet (StdESD e) -> 𝑂 (Elem (StdESD e) ∧ ESet (StdESD e)) Source # pmaxView :: ESet (StdESD e) -> 𝑂 (Elem (StdESD e) ∧ ESet (StdESD e)) Source # pminElem :: ESet (StdESD e) -> 𝑂 (Elem (StdESD e)) Source # pmaxElem :: ESet (StdESD e) -> 𝑂 (Elem (StdESD e)) Source # pow𝐼 :: 𝐼 (Elem (StdESD e)) -> ESet (StdESD e) Source # pvals :: ESet (StdESD e) -> 𝐼 (Elem (StdESD e)) Source #
(Eq k, Eq a) => Eq (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (==) :: EDct (StdESD k) a -> EDct (StdESD k) a -> Bool # (/=) :: EDct (StdESD k) a -> EDct (StdESD k) a -> Bool #
(Ord k, Ord a) => Ord (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods compare :: EDct (StdESD k) a -> EDct (StdESD k) a -> Ordering # (<) :: EDct (StdESD k) a -> EDct (StdESD k) a -> Bool # (<=) :: EDct (StdESD k) a -> EDct (StdESD k) a -> Bool # (>) :: EDct (StdESD k) a -> EDct (StdESD k) a -> Bool # (>=) :: EDct (StdESD k) a -> EDct (StdESD k) a -> Bool # max :: EDct (StdESD k) a -> EDct (StdESD k) a -> EDct (StdESD k) a # min :: EDct (StdESD k) a -> EDct (StdESD k) a -> EDct (StdESD k) a #
Bot (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods bot :: EDct (StdESD k) a Source #
(Ord k, Join a) => Join (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⊔) :: EDct (StdESD k) a -> EDct (StdESD k) a -> EDct (StdESD k) a Source #
(Ord k, Join a) => JoinLattice (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict
(Ord k, Append a) => Append (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods (⧺) :: EDct (StdESD k) a -> EDct (StdESD k) a -> EDct (StdESD k) a Source #
(Ord k, Append a) => Monoid (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict
Null (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods null :: EDct (StdESD k) a Source #
Ord k => Single (Elem (StdESD k) ∧ a) (EDct (StdESD k) a) Source #
Instance details Defined in UVMHS.Core.Data.Dict Methods single :: (Elem (StdESD k) ∧ a) -> EDct (StdESD k) a Source #
newtype EDct (StdESD k) a Source #
Instance details Defined in UVMHS.Core.Data.Dict newtype EDct (StdESD k) a = StdESDDct { unStdESDDct :: k ⇰ a }
newtype ESet (StdESD e) Source #
Instance details Defined in UVMHS.Core.Data.Dict newtype ESet (StdESD e) = StdESDSet { unStdESDSet :: 𝑃 e }
newtype Elem (StdESD a) Source #
Instance details Defined in UVMHS.Core.Data.Dict newtype Elem (StdESD a) = StdESDElm { unStdESDElm :: a }

Orphan instances

Ord k => Lookup k a (k ⇰ a) Source #
Instance details Methods (⋕?) :: (k ⇰ a) -> k -> 𝑂 a Source #
Ord k => KBiFunctor k ((⇰) k) Source #
Instance details Methods kbimap :: (k -> a -> c) -> (k -> b -> c) -> (k -> a -> b -> c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #
Ord k => KBiFunctorM k ((⇰) k) Source #
Instance details Methods kbimapM :: forall m a b c. Monad m => (k -> a -> m c) -> (k -> b -> m c) -> (k -> a -> b -> m c) -> (k ⇰ a) -> (k ⇰ b) -> m (k ⇰ c) Source #
Ord k => KFunctor k ((⇰) k) Source #
Instance details Methods kmap :: (k -> a -> b) -> (k ⇰ a) -> k ⇰ b Source # kmapAt :: k -> (a -> a) -> (k ⇰ a) -> k ⇰ a Source #
Ord k => KFunctorM k ((⇰) k) Source #
Instance details Methods kmapM :: Monad m => (k -> a -> m b) -> (k ⇰ a) -> m (k ⇰ b) Source # kmapAtM :: Monad m => k -> (a -> m a) -> (k ⇰ a) -> m (k ⇰ a) Source #
Ord k => OKBiFunctor k ((⇰) k) Source #
Instance details Methods okbimap :: (k -> a -> 𝑂 c) -> (k -> b -> 𝑂 c) -> (k -> a -> b -> 𝑂 c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #
Ord k => OKBiFunctorM k ((⇰) k) Source #
Instance details Methods okbimapM :: forall m a b c. Monad m => (k -> a -> m (𝑂 c)) -> (k -> b -> m (𝑂 c)) -> (k -> a -> b -> m (𝑂 c)) -> (k ⇰ a) -> (k ⇰ b) -> m (k ⇰ c) Source #
Ord k => OKFunctor k ((⇰) k) Source #
Instance details Methods okmap :: (k -> a -> 𝑂 b) -> (k ⇰ a) -> k ⇰ b Source # okmapAt :: k -> (𝑂 a -> 𝑂 a) -> (k ⇰ a) -> k ⇰ a Source #
Ord k => OKFunctorM k ((⇰) k) Source #
Instance details Methods okmapM :: Monad m => (k -> a -> m (𝑂 b)) -> (k ⇰ a) -> m (k ⇰ b) Source # okmapAtM :: Monad m => k -> (𝑂 a -> m (𝑂 a)) -> (k ⇰ a) -> m (k ⇰ a) Source #
Ord k => BiFunctor ((⇰) k) Source #
Instance details Methods bimap :: (a -> c) -> (b -> c) -> (a -> b -> c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #
Ord k => BiFunctorM ((⇰) k) Source #
Instance details Methods bimapM :: forall m a b c. Monad m => (a -> m c) -> (b -> m c) -> (a -> b -> m c) -> (k ⇰ a) -> (k ⇰ b) -> m (k ⇰ c) Source #
Functor ((⇰) k) Source #
Instance details Methods map :: (a -> b) -> (k ⇰ a) -> k ⇰ b Source #
FunctorM ((⇰) k) Source #
Instance details Methods mapM :: Monad m => (a -> m b) -> (k ⇰ a) -> m (k ⇰ b) Source #
Ord k => OBiFunctor ((⇰) k) Source #
Instance details Methods obimap :: (a -> 𝑂 c) -> (b -> 𝑂 c) -> (a -> b -> 𝑂 c) -> (k ⇰ a) -> (k ⇰ b) -> k ⇰ c Source #
Ord k => OBiFunctorM ((⇰) k) Source #
Instance details Methods obimapM :: forall m a b c. Monad m => (a -> m (𝑂 c)) -> (b -> m (𝑂 c)) -> (a -> b -> m (𝑂 c)) -> (k ⇰ a) -> (k ⇰ b) -> m (k ⇰ c) Source #
OFunctor ((⇰) k) Source #
Instance details Methods omap :: (a -> 𝑂 b) -> (k ⇰ a) -> k ⇰ b Source #
OFunctorM ((⇰) k) Source #
Instance details Methods omapM :: Monad m => (a -> m (𝑂 b)) -> (k ⇰ a) -> m (k ⇰ b) Source #
(Show k, Show a) => Show (k ⇰ a) Source #
Instance details Methods showsPrec :: Int -> (k ⇰ a) -> ShowS # show :: (k ⇰ a) -> String # showList :: [k ⇰ a] -> ShowS #
(Ord k, Plus a) => Additive (k ⇰ a) Source #
Instance details
(Ord k, Additive k, Multiplicative a) => Multiplicative (k ⇰ a) Source #
Instance details
(Ord k, Zero k, Zero a) => One (k ⇰ a) Source #
Instance details Methods one :: k ⇰ a Source #
(Ord k, Plus a) => Plus (k ⇰ a) Source #
Instance details Methods (+) :: (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #
(Ord k, Plus k, Plus a, Times a) => Times (k ⇰ a) Source #
Instance details Methods (×) :: (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #
Zero (k ⇰ a) Source #
Instance details Methods zero :: k ⇰ a Source #
(Ord k, All k, All a) => All (k ⇰ a) Source #
Instance details Methods all :: 𝐼 (k ⇰ a) Source #
CSized (k ⇰ a) Source #
Instance details Methods csize :: (k ⇰ a) -> ℕ64 Source #
Bot (k ⇰ a) Source #
Instance details Methods bot :: k ⇰ a Source #
(Ord k, Difference a) => Difference (k ⇰ a) Source #
Instance details Methods (⊟) :: (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #
(Ord k, Join a) => Join (k ⇰ a) Source #
Instance details Methods (⊔) :: (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #
(Ord k, Join a) => JoinLattice (k ⇰ a) Source #
Instance details
(Ord k, Meet a) => Meet (k ⇰ a) Source #
Instance details Methods (⊓) :: (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #
(Ord k, POrd a) => POrd (k ⇰ a) Source #
Instance details Methods (⊑) :: (k ⇰ a) -> (k ⇰ a) -> 𝔹 Source #
(Ord k, Append a) => Append (k ⇰ a) Source #
Instance details Methods (⧺) :: (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #
(Ord k, Append k, Append a, Cross a) => Cross (k ⇰ a) Source #
Instance details Methods (⨳) :: (k ⇰ a) -> (k ⇰ a) -> k ⇰ a Source #
(Ord k, Append a) => Monoid (k ⇰ a) Source #
Instance details
Null (k ⇰ a) Source #
Instance details Methods null :: k ⇰ a Source #
(Ord k, Monoid k, Prodoid a) => Prodoid (k ⇰ a) Source #
Instance details
(Ord k, Null k, Null a) => Unit (k ⇰ a) Source #
Instance details Methods unit :: k ⇰ a Source #
Ord k => Single (k ∧ a) (k ⇰ a) Source #
Instance details Methods single :: (k ∧ a) -> k ⇰ a Source #
ToIter (k ∧ a) (k ⇰ a) Source #
Instance details Methods iter :: (k ⇰ a) -> 𝐼 (k ∧ a) Source #