Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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
sequenceGet :: (HasCallStack, MonadIO m) => SequenceIter -> m (Ptr ())gi-glib GI.GLib.Structs.Sequence Returns the data that iter points to. Since: 2.14
sequenceGetBeginIter :: (HasCallStack, MonadIO m) => Sequence -> m SequenceItergi-glib GI.GLib.Structs.Sequence Returns the begin iterator for seq. Since: 2.14
sequenceGetEndIter :: (HasCallStack, MonadIO m) => Sequence -> m SequenceItergi-glib GI.GLib.Structs.Sequence Returns the end iterator for seg Since: 2.14
sequenceGetIterAtPos :: (HasCallStack, MonadIO m) => Sequence -> Int32 -> m SequenceItergi-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
sequenceGetLength :: (HasCallStack, MonadIO m) => Sequence -> m Int32gi-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
sequenceInsertBefore :: (HasCallStack, MonadIO m) => SequenceIter -> Ptr () -> m SequenceItergi-glib GI.GLib.Structs.Sequence Inserts a new item just before the item pointed to by iter. Since: 2.14
-
gi-glib GI.GLib.Structs.Sequence Inserts data into seq using cmpFunc to determine the new position. The sequence must already be sorted according to cmpFunc; otherwise the new position of data is undefined. cmpFunc is called with two items of the seq, and cmpData. It should return 0 if the items are equal, a negative value if the first item comes before the second, and a positive value if the second item comes before the first. Note that when adding a large amount of data to a Sequence, it is more efficient to do unsorted insertions and then call sequenceSort or sequenceSortIter. Since: 2.14
-
gi-glib GI.GLib.Structs.Sequence Like sequenceInsertSorted, but uses a SequenceIterCompareFunc instead of a CompareDataFunc as the compare function. iterCmp is called with two iterators pointing into seq. It should return 0 if the iterators are equal, a negative value if the first iterator comes before the second, and a positive value if the second iterator comes before the first. Note that when adding a large amount of data to a Sequence, it is more efficient to do unsorted insertions and then call sequenceSort or sequenceSortIter. Since: 2.14
sequenceIsEmpty :: (HasCallStack, MonadIO m) => Sequence -> m Boolgi-glib GI.GLib.Structs.Sequence Returns True if the sequence contains zero items. This function is functionally identical to checking the result of sequenceGetLength being equal to zero. However this function is implemented in O(1) running time. Since: 2.48