Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

  1. Pos :: Tree e a -> Forest e a -> Forest e a -> [([Tree e a], e, a, [Tree e a])] -> TreePos e a

    elynx-tree ELynx.Tree.Zipper

    No documentation available.

  2. newtype PutME a

    encoding Data.Encoding.ByteSink

    No documentation available.

  3. PutME :: Either EncodingException (PutM (), a) -> PutME a

    encoding Data.Encoding.ByteSink

    No documentation available.

  4. type Pi = 'ExactPi' 'Pos1 1 1

    exact-pi Data.ExactPi.TypeLevel

    The ExactPi' type representing the number pi.

  5. type family Peano (n :: Nat) :: PeanoNum

    fixed-vector Data.Vector.Fixed

    Convert type level natural to Peano representation

  6. data PeanoNum

    fixed-vector Data.Vector.Fixed

    Peano numbers. Since type level naturals don't support induction we have to convert type nats to Peano representation first and work with it,

  7. type family Peano (n :: Nat) :: PeanoNum

    fixed-vector Data.Vector.Fixed.Cont

    Convert type level natural to Peano representation

  8. data PeanoNum

    fixed-vector Data.Vector.Fixed.Cont

    Peano numbers. Since type level naturals don't support induction we have to convert type nats to Peano representation first and work with it,

  9. module Data.Vector.Fixed.Primitive

    Unboxed vectors with fixed length. Vectors from Data.Vector.Fixed.Unboxed provide more flexibility at no performeance cost.

  10. class Prim a

    fixed-vector Data.Vector.Fixed.Primitive

    Class of types supporting primitive array operations. This includes interfacing with GC-managed memory (functions suffixed with ByteArray#) and interfacing with unmanaged memory (functions suffixed with Addr#). Endianness is platform-dependent.

Page 694 of many | Previous | Next