Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. newBoundedTrie :: BoundedTrie

    gogol-dataflow Gogol.Dataflow

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

  2. newBoundedTrieNode :: BoundedTrieNode

    gogol-dataflow Gogol.Dataflow

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

  3. 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.

  4. newBoundedTrie :: BoundedTrie

    gogol-dataflow Gogol.Dataflow.Types

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

  5. newBoundedTrieNode :: BoundedTrieNode

    gogol-dataflow Gogol.Dataflow.Types

    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.Types

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

  7. 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.

  8. GBounded :: a -> GBounded a

    one-liner-instances Data.Bounded.OneLiner

    No documentation available.

  9. getGBounded :: GBounded a -> a

    one-liner-instances Data.Bounded.OneLiner

    No documentation available.

  10. maximumBounded :: (Foldable f, Ord a, Bounded a) => f a -> a

    verset Verset

    The largest element of a foldable structure. The result is bounded by minBound.

Page 49 of many | Previous | Next