Hoogle Search
Within LTS Haskell 24.66 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
class
DecidableEq (f :: k -> Type)parameterized-utils Data.Parameterized.DecidableEq Decidable equality.
-
parameterized-utils Data.Parameterized.Fin No documentation available.
-
parameterized-utils Data.Parameterized.NatRepr (<=) is a decidable relation on nats.
widthVal :: forall (n :: Nat) . NatRepr n -> Intparameterized-utils Data.Parameterized.NatRepr Return the value of the nat representation.
valid :: (Hashable k, Ord k, Ord p) => HashPSQ k p v -> Boolpsqueues Data.HashPSQ O(n^2) Internal function to check if the HashPSQ is valid, i.e. if all invariants hold. This should always be the case.
valid :: Ord p => IntPSQ p v -> Boolpsqueues Data.IntPSQ O(n^2) Internal function to check if the IntPSQ is valid, i.e. if all invariants hold. This should always be the case.
valid :: (Ord k, Ord p) => OrdPSQ k p v -> Boolpsqueues Data.OrdPSQ O(n^2) Internal function to check if the OrdPSQ is valid, i.e. if all invariants hold. This should always be the case.
validate :: Predicate p x => Proxy p -> x -> Maybe RefineExceptionrefined Refined Check the value x according to the predicate p, producing an error RefineException if the value does not satisfy. Note: validate is not intended to be used directly; instead, it is intended to provide the minimal means necessary for other utilities to be derived. As such, the Maybe here should be interpreted to mean the presence or absence of a RefineException, and nothing else.
-
sdl2 SDL.Event No documentation available.
WindowHiddenEvent :: WindowHiddenEventData -> EventPayloadsdl2 SDL.Event No documentation available.