Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

  1. inlinePerformIO :: IO a -> a

    text Data.Text.Internal.Unsafe

    Just like unsafePerformIO, but we inline it. Big performance gains as it exposes lots of things to further inlining. Very unsafe. In particular, you should do no memory allocation inside an inlinePerformIO block.

  2. unsafeWithForeignPtr :: ForeignPtr a -> (Ptr a -> IO b) -> IO b

    text Data.Text.Internal.Unsafe

    No documentation available.

  3. data FPFormat

    text Data.Text.Lazy.Builder.RealFloat

    Control the rendering of floating point numbers.

  4. inlinePerformIO :: IO a -> a

    text Data.Text.Unsafe

    Just like unsafePerformIO, but we inline it. Big performance gains as it exposes lots of things to further inlining. Very unsafe. In particular, you should do no memory allocation inside an inlinePerformIO block.

  5. unsafeDupablePerformIO :: IO a -> a

    text Data.Text.Unsafe

    No documentation available.

  6. class MaybeForce a

    containers Data.Sequence.Internal

    No documentation available.

  7. drawForest :: [Tree String] -> String

    containers Data.Tree

    2-dimensional ASCII drawing of a forest.

    Examples

    putStr $ drawForest $ map (fmap show) [(Node 1 [Node 2 [], Node 3 []]), (Node 10 [Node 20 []])]

    1
|
+- 2
|
`- 3

10
|
`- 20

  8. subForest :: Tree a -> [Tree a]

    containers Data.Tree

    zero or more child trees

  9. unfoldForest :: (b -> (a, [b])) -> [b] -> [Tree a]

    containers Data.Tree

    Build a (possibly infinite) forest from a list of seed values in breadth-first order. unfoldForest f seeds invokes unfoldTree on each seed value. For a monadic version see unfoldForestM_BF.

  10. unfoldForestM :: Monad m => (b -> m (a, [b])) -> [b] -> m [Tree a]

    containers Data.Tree

    Monadic forest builder, in depth-first order

Page 402 of many | Previous | Next