Hoogle Search

Within LTS Haskell 24.37 (ghc-9.10.3)

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

  1. fromList :: forall (f :: Type -> Type) (n :: Nat) a . (CFreeMonoid f, Dom f a) => SNat n -> [a] -> Maybe (Sized f n a)

    sized Data.Sized

    If the given list is shorter than n, then returns Nothing Otherwise returns Sized f n a consisting of initial n element of given list. Since 0.7.0.0 (type changed)

  2. fromList' :: forall (f :: Type -> Type) (n :: Nat) a . (Dom f a, CFreeMonoid f, KnownNat n) => [a] -> Maybe (Sized f n a)

    sized Data.Sized

    fromList with the result length inferred. Since 0.7.0.0

  3. fromListWithDefault :: forall (f :: Type -> Type) (n :: Nat) a . (Dom f a, CFreeMonoid f) => SNat n -> a -> [a] -> Sized f n a

    sized Data.Sized

    Construct a Sized f n a by padding default value if the given list is short. Since 0.5.0.0 (type changed)

  4. fromListWithDefault' :: forall (f :: Type -> Type) (n :: Nat) a . (KnownNat n, CFreeMonoid f, Dom f a) => a -> [a] -> Sized f n a

    sized Data.Sized

    fromListWithDefault with the result length inferred. Since 0.7.0.0

  5. toList :: forall (f :: Type -> Type) (n :: Nat) a . (CFoldable f, Dom f a) => Sized f n a -> [a]

    sized Data.Sized

    Convert to list. Since 0.7.0.0

  6. unsafeFromList :: forall (f :: Type -> Type) (n :: Nat) a . (CFreeMonoid f, Dom f a) => SNat n -> [a] -> Sized f n a

    sized Data.Sized

    Unsafe version of fromList. If the length of the given list does not equal to n, then something unusual happens. Since 0.7.0.0

  7. unsafeFromList' :: forall (f :: Type -> Type) (n :: Nat) a . (KnownNat n, CFreeMonoid f, Dom f a) => [a] -> Sized f n a

    sized Data.Sized

    unsafeFromList with the result length inferred. Since 0.7.0.0

  8. fromList :: [a] -> Fix (ListF a)

    srtree Data.SRTree.Recursion

    No documentation available.

  9. stream2list :: StreamF a [a] -> [a]

    srtree Data.SRTree.Recursion

    No documentation available.

  10. toList :: Fix (ListF a) -> [a]

    srtree Data.SRTree.Recursion

    No documentation available.

Page 223 of many | Previous | Next