Hoogle Search

Within LTS Haskell 24.31 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. class GBounded (ra :: Type -> Type)

   generic-lexicographic-order	Data.Lexicographic.Generic

   No documentation available.

2. class GBounded (ra :: Type -> Type)

   generic-lexicographic-order	Data.Lexicographic.Generic.Internal

   No documentation available.

3. gen_Bounded_binds :: SrcSpan -> DerivInstTys -> (LHsBinds GhcPs, Bag AuxBindSpec)

   ghc-lib	GHC.Tc.Deriv.Generate

   No documentation available.

4. newBoundedTrie :: BoundedTrie

   gogol-dataflow	Gogol.Dataflow

   Creates a value of BoundedTrie with the minimum fields required to make a request.

5. newBoundedTrieNode :: BoundedTrieNode

   gogol-dataflow	Gogol.Dataflow

   Creates a value of BoundedTrieNode with the minimum fields required to make a request.

6. newBoundedTrieNode_Children :: HashMap Text BoundedTrieNode -> BoundedTrieNode_Children

   gogol-dataflow	Gogol.Dataflow

   Creates a value of BoundedTrieNode_Children with the minimum fields required to make a request.

7. newBoundedTrie :: BoundedTrie

   gogol-dataflow	Gogol.Dataflow.Types

   Creates a value of BoundedTrie with the minimum fields required to make a request.

8. newBoundedTrieNode :: BoundedTrieNode

   gogol-dataflow	Gogol.Dataflow.Types

   Creates a value of BoundedTrieNode with the minimum fields required to make a request.

9. newBoundedTrieNode_Children :: HashMap Text BoundedTrieNode -> BoundedTrieNode_Children

   gogol-dataflow	Gogol.Dataflow.Types

   Creates a value of BoundedTrieNode_Children with the minimum fields required to make a request.

10. newtype GBounded a

    one-liner-instances	Data.Bounded.OneLiner

    If a is a data type whose fields are all instances of Bounded, then GBounded a has a Bounded instance. Will one day be able to be used with DerivingVia syntax, to derive instances automatically.

Page 49 of many | Previous | Next