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.
-
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
-
gi-glib GI.GLib.Structs.Sequence Returns an iterator pointing to the position of the first item found equal to data according to cmpFunc and cmpData. If more than one item is equal, it is not guaranteed that it is the first which is returned. In that case, you can use sequenceIterNext and sequenceIterPrev to get others. 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. This function will fail if the data contained in the sequence is unsorted. Since: 2.28
-
gi-glib GI.GLib.Structs.Sequence Like sequenceLookup, 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. This function will fail if the data contained in the sequence is unsorted. Since: 2.28
sequenceMove :: (HasCallStack, MonadIO m) => SequenceIter -> SequenceIter -> m ()gi-glib GI.GLib.Structs.Sequence Moves the item pointed to by src to the position indicated by dest. After calling this function dest will point to the position immediately after src. It is allowed for src and dest to point into different sequences. Since: 2.14
-
gi-glib GI.GLib.Structs.Sequence Inserts the (begin, end) range at the destination pointed to by dest. The begin and end iters must point into the same sequence. It is allowed for dest to point to a different sequence than the one pointed into by begin and end. If dest is Nothing, the range indicated by begin and end is removed from the sequence. If dest points to a place within the (begin, end) range, the range does not move. Since: 2.14
sequencePrepend :: (HasCallStack, MonadIO m) => Sequence -> Ptr () -> m SequenceItergi-glib GI.GLib.Structs.Sequence Adds a new item to the front of seq Since: 2.14
-
gi-glib GI.GLib.Structs.Sequence Finds an iterator somewhere in the range (begin, end). This iterator will be close to the middle of the range, but is not guaranteed to be exactly in the middle. The begin and end iterators must both point to the same sequence and begin must come before or be equal to end in the sequence. Since: 2.14
sequenceRemove :: (HasCallStack, MonadIO m) => SequenceIter -> m ()gi-glib GI.GLib.Structs.Sequence Removes the item pointed to by iter. It is an error to pass the end iterator to this function. If the sequence has a data destroy function associated with it, this function is called on the data for the removed item. Since: 2.14