Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. sequenceAppend :: (HasCallStack, MonadIO m) => Sequence -> Ptr () -> m SequenceIter

    gi-glib GI.GLib.Structs.Sequence

    Adds a new item to the end of seq. Since: 2.14

  2. sequenceForeach :: (HasCallStack, MonadIO m) => Sequence -> Func -> m ()

    gi-glib GI.GLib.Structs.Sequence

    Calls func for each item in the sequence passing userData to the function. func must not modify the sequence itself. Since: 2.14

  3. sequenceForeachRange :: (HasCallStack, MonadIO m) => SequenceIter -> SequenceIter -> Func -> m ()

    gi-glib GI.GLib.Structs.Sequence

    Calls func for each item in the range (begin, end) passing userData to the function. func must not modify the sequence itself. Since: 2.14

  4. sequenceFree :: (HasCallStack, MonadIO m) => Sequence -> m ()

    gi-glib GI.GLib.Structs.Sequence

    Frees the memory allocated for seq. If seq has a data destroy function associated with it, that function is called on all items in seq. Since: 2.14

  5. sequenceGet :: (HasCallStack, MonadIO m) => SequenceIter -> m (Ptr ())

    gi-glib GI.GLib.Structs.Sequence

    Returns the data that iter points to. Since: 2.14

  6. sequenceGetBeginIter :: (HasCallStack, MonadIO m) => Sequence -> m SequenceIter

    gi-glib GI.GLib.Structs.Sequence

    Returns the begin iterator for seq. Since: 2.14

  7. sequenceGetEndIter :: (HasCallStack, MonadIO m) => Sequence -> m SequenceIter

    gi-glib GI.GLib.Structs.Sequence

    Returns the end iterator for seg Since: 2.14

  8. sequenceGetIterAtPos :: (HasCallStack, MonadIO m) => Sequence -> Int32 -> m SequenceIter

    gi-glib GI.GLib.Structs.Sequence

    Returns the iterator at position pos. If pos is negative or larger than the number of items in seq, the end iterator is returned. Since: 2.14

  9. sequenceGetLength :: (HasCallStack, MonadIO m) => Sequence -> m Int32

    gi-glib GI.GLib.Structs.Sequence

    Returns the positive length (>= 0) of seq. Note that this method is O(h) where `h' is the height of the tree. It is thus more efficient to use sequenceIsEmpty when comparing the length to zero. Since: 2.14

  10. sequenceInsertBefore :: (HasCallStack, MonadIO m) => SequenceIter -> Ptr () -> m SequenceIter

    gi-glib GI.GLib.Structs.Sequence

    Inserts a new item just before the item pointed to by iter. Since: 2.14

Page 26 of many | Previous | Next