Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
enumDescriptions :: JsonSchema -> Maybe [Text]gogol-discovery Gogol.Discovery.Types The descriptions for the enums. Each position maps to the corresponding value in the "enum" array.
enumerate :: Maybe VendorID -> Maybe ProductID -> IO [DeviceInfo]hidapi System.HIDAPI No documentation available.
enumerateAll :: IO [DeviceInfo]hidapi System.HIDAPI No documentation available.
enumerateDevices :: MonadDOM m => MediaDevices -> m [MediaDeviceInfo]jsaddle-dom JSDOM.Generated.MediaDevices enumerateDevices_ :: MonadDOM m => MediaDevices -> m ()jsaddle-dom JSDOM.Generated.MediaDevices enumArgP :: EnumText a => MetaVar -> Parser aoptparse-enum Text.Enum.Optparse parsing an EnumText argument
enumOptP :: EnumText a => FlagChar -> MetaVar -> Parser aoptparse-enum Text.Enum.Optparse parsing an EnumText option
enumSwitchesP :: EnumText a => Parser aoptparse-enum Text.Enum.Optparse generate mutually exclusive switches based on EnumText a
enumDownFrom :: DownwardEnum a => a -> [a]prelude-safeenum Prelude.SafeEnum Return x followed by all it's predecessors, in (reverse) order. The resulting list is always non-empty, since it includes x. If the resulting list is always finite, then the precedes ordering is well-founded. In GHC, the default implementation is a "good producer" for list fusion.
enumDownFromTo :: DownwardEnum a => a -> a -> [a]prelude-safeenum Prelude.SafeEnum Return the elements of enumDownFrom x, filtering out everything that precedes z. If x precedes z, then the resulting list is empty; otherwise, it is non-empty, since it includes x. In GHC, the default implementation is a "good producer" for list fusion.