Hoogle Search
Within LTS Haskell 24.28 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
SingletonProof :: Refined (InSet f r) a -> SingletonProof (f :: Flavor) a rrefined-containers Data.HashMap.Refined The element that is guaranteed to be in r
newtype
SingletonProof (f :: Flavor) a rrefined-containers Data.HashMap.Strict.Refined Proof that r contains an element of type a.
SingletonProof :: Refined (InSet f r) a -> SingletonProof (f :: Flavor) a rrefined-containers Data.HashMap.Strict.Refined The element that is guaranteed to be in r
newtype
SingletonProof (f :: Flavor) a rrefined-containers Data.HashSet.Refined Proof that r contains an element of type a.
SingletonProof :: Refined (InSet f r) a -> SingletonProof (f :: Flavor) a rrefined-containers Data.HashSet.Refined The element that is guaranteed to be in r
newtype
SingletonProof (f :: Flavor) a rrefined-containers Data.IntMap.Refined Proof that r contains an element of type a.
SingletonProof :: Refined (InSet f r) a -> SingletonProof (f :: Flavor) a rrefined-containers Data.IntMap.Refined The element that is guaranteed to be in r
newtype
SingletonProof (f :: Flavor) a rrefined-containers Data.IntMap.Strict.Refined Proof that r contains an element of type a.
SingletonProof :: Refined (InSet f r) a -> SingletonProof (f :: Flavor) a rrefined-containers Data.IntMap.Strict.Refined The element that is guaranteed to be in r
newtype
SingletonProof (f :: Flavor) a rrefined-containers Data.IntSet.Refined Proof that r contains an element of type a.