Hoogle Search
Within LTS Haskell 24.33 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
MkEnumeratorInitialized :: Identifier -> ConstantExpression -> Enumeratorogma-language-c Language.C.AbsC No documentation available.
MkEnumeratorList1 :: Enumerator -> EnumeratorListogma-language-c Language.C.AbsC No documentation available.
MkEnumeratorListN :: EnumeratorList -> Enumerator -> EnumeratorListogma-language-c Language.C.AbsC No documentation available.
MkEnumeratorUninitialized :: Identifier -> Enumeratorogma-language-c Language.C.AbsC No documentation available.
MkTypeSpecifierEnumSpecifier :: EnumSpecifier -> TypeSpecifierogma-language-c Language.C.AbsC No documentation available.
prettyEnum :: Attributes -> Docogma-language-xmlspec Language.XMLSpec.PrintTrees No documentation available.
-
An enum-text based toolkit for optparse-applicative Please see the README on GitHub at https://github.com/cdornan/optparse-enum#readme
shortEnumSwitchesP :: EnumText a => (a -> Maybe FlagChar) -> Parser aoptparse-enum Text.Enum.Optparse generate mutually exclusive switches based on EnumText a, with some short swich options as specified by the argument function
-
A redefinition of the Prelude's Enum class in order to render it safe. A redefinition of the Prelude's Enum class in order to render it safe. That is, the Haskell Language Report defines pred, succ, fromEnum, and toEnum to be partial functions when the type is Bounded, but this is unacceptable. We define a new type-class hierarchy for enumeration which is safe and also generalizes to cover types which can only be enumerated in one direction.
-
A redefinition of the Prelude's Enum class in order to render it safe. That is, the Haskell Language Report defines pred, succ, fromEnum and toEnum to be partial functions when the type is Bounded[1], but this is unacceptable. So these classes are offered as a replacement, correcting the types of those functions. We intentionally clash with the names of the Prelude's class; if you wish to use both in the same file, then import this module (or the Prelude) qualified. While we're at it, we also generalize the notion of enumeration. Rather than requiring that the type is linearly enumerable, we distinguish between forward enumeration (which allows for multiple predecessors) and backward enumeration (which allows for multiple successors). Moreover, we do not require that the enumeration order coincides with the Ord ordering (if one exists), though it's advisable that they do (for your sanity). However, we also ensure that the notion of enumeration (in either direction) is well-defined, which rules out instances for Float and Double, and renders instances for Ratio problematic. Ratio instances can be provided so long as the base type is integral and enumerable; but they must be done in an obscure order[2] that does not coincide with Ord. Since this is not what people may expect, we only provide an instance for the newtype CalkinWilf, not for Ratio itself. The MagicHash extension is only actually required if on GHC. This extension is used only so that the implementation of the instances for Char match those of the Prelude's Enum. I have not benchmarked to determine whether this low-level hackery is actually still necessary.
- 1 http://www.haskell.org/onlinereport/haskell2010/haskellch6.html#x13-1310006.3.4
- 2 Jeremy Gibbons, David Lester, and Richard Bird (2006). Enumerating the Rationals. JFP 16(3):281--291. DOI:10.1017/S0956796806005880 http://www.cs.ox.ac.uk/jeremy.gibbons/publications/rationals.pdf