Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

  1. dynamic_SequenceIterCompareFunc :: (HasCallStack, MonadIO m) => FunPtr C_SequenceIterCompareFunc -> SequenceIter -> SequenceIter -> Ptr () -> m Int32

    gi-glib GI.GLib.Callbacks

    Given a pointer to a foreign C function, wrap it into a function callable from Haskell.

  2. genClosure_SequenceIterCompareFunc :: MonadIO m => SequenceIterCompareFunc -> m (GClosure C_SequenceIterCompareFunc)

    gi-glib GI.GLib.Callbacks

    Wrap the callback into a GClosure.

  3. mk_SequenceIterCompareFunc :: C_SequenceIterCompareFunc -> IO (FunPtr C_SequenceIterCompareFunc)

    gi-glib GI.GLib.Callbacks

    Generate a function pointer callable from C code, from a C_SequenceIterCompareFunc.

  4. noSequenceIterCompareFunc :: Maybe SequenceIterCompareFunc

    gi-glib GI.GLib.Callbacks

    A convenience synonym for Nothing :: Maybe SequenceIterCompareFunc.

  5. wrap_SequenceIterCompareFunc :: Maybe (Ptr (FunPtr C_SequenceIterCompareFunc)) -> SequenceIterCompareFunc -> C_SequenceIterCompareFunc

    gi-glib GI.GLib.Callbacks

    Wrap a SequenceIterCompareFunc into a C_SequenceIterCompareFunc.

  6. ConvertErrorIllegalSequence :: ConvertError

    gi-glib GI.GLib.Enums

    Invalid byte sequence in conversion input; or the character sequence could not be represented in the target character set.

  7. osequence_ :: (Applicative m, MonoFoldable mono, Element mono ~ m ()) => mono -> m ()

    mono-traversable Data.MonoTraversable

    Perform all actions in the given container

  8. class (Monoid seq, MonoTraversable seq, SemiSequence seq, MonoPointed seq) => IsSequence seq

    mono-traversable Data.Sequences

    Sequence Laws: 

    fromList . otoList = id
fromList (x <> y) = fromList x <> fromList y
otoList (fromList x <> fromList y) = x <> y

  9. class (IsSequence lazy, IsSequence strict) => LazySequence lazy strict | lazy -> strict, strict -> lazy

    mono-traversable Data.Sequences

    Lazy sequences containing strict chunks of data.

  10. class (Integral Index seq, GrowingAppend seq) => SemiSequence seq

    mono-traversable Data.Sequences

    SemiSequence was created to share code between IsSequence and NonNull. Semi means SemiGroup A SemiSequence can accommodate a SemiGroup such as NonEmpty or NonNull A Monoid should be able to fill out IsSequence. SemiSequence operations maintain the same type because they all maintain the same number of elements or increase them. However, a decreasing function such as filter may change they type. For example, from NonEmpty to '[]' This type-changing function exists on NonNull as nfilter filter and other such functions are placed in IsSequence NOTE: Like GrowingAppend, ideally we'd have a Semigroup superclass constraint here, but that would pull in more dependencies to this package than desired.

Page 52 of many | Previous | Next