Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

  1. commaPrec :: Maybe Int -> Double -> Text

    formatn Data.FormatN

    Format using comma separators for numbers above 1,000 but below 1 million, otherwise use prec style. 

    >>> commaPrec (Just 3) 1234
"1,230"

>>> commaPrec (Just 3) 1234567
"1.23e6"

  2. commaPrecStyle :: Double -> FormatStyle

    formatn Data.FormatN

    CommaStyle above a thousand but below a million, DecimalStyle between 0.001 and a thousand and ExponentStyle outside this range.

  3. newtype NEMapF k1 (f :: k -> Type) (a :: k)

    functor-combinators Control.Applicative.ListF

    A non-empty map of f as, indexed by keys of type k. It can be useful for represeting a product of many different values of type f a, each "at" a different k location, where you need to have at least one f a at all times. Can be considered a combination of EnvT and NonEmptyF, in a way --- an NEMapF k f a is like a NonEmptyF (EnvT k f) a with unique (and ordered) keys. See MapF for some use cases.

  4. NEMapF :: NEMap k1 (f a) -> NEMapF k1 (f :: k -> Type) (a :: k)

    functor-combinators Control.Applicative.ListF

    No documentation available.

  5. runMapF :: MapF k1 (f :: k -> Type) (a :: k) -> Map k1 (f a)

    functor-combinators Control.Applicative.ListF

    No documentation available.

  6. runNEMapF :: NEMapF k1 (f :: k -> Type) (a :: k) -> NEMap k1 (f a)

    functor-combinators Control.Applicative.ListF

    No documentation available.

  7. fromAp :: forall (f :: Type -> Type) x . Ap f x -> (Identity :+: Ap1 f) x

    functor-combinators Data.Functor.Apply.Free

    Convert an Ap into an Ap1 if possible. If the Ap was "empty", return the Pure value instead.

  8. newtype NEMapF k1 (f :: k -> Type) (a :: k)

    functor-combinators Data.Functor.Combinator

    A non-empty map of f as, indexed by keys of type k. It can be useful for represeting a product of many different values of type f a, each "at" a different k location, where you need to have at least one f a at all times. Can be considered a combination of EnvT and NonEmptyF, in a way --- an NEMapF k f a is like a NonEmptyF (EnvT k f) a with unique (and ordered) keys. See MapF for some use cases.

  9. NEMapF :: NEMap k1 (f a) -> NEMapF k1 (f :: k -> Type) (a :: k)

    functor-combinators Data.Functor.Combinator

    No documentation available.

  10. hbimap :: forall (f :: k -> Type) (j :: k -> Type) (g :: k -> Type) (l :: k -> Type) . HBifunctor t => (f ~> j) -> (g ~> l) -> t f g ~> t j l

    functor-combinators Data.Functor.Combinator

    Swap out both transformed functors at the same time.

Page 1033 of many | Previous | Next