Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
hookInsertSorted :: (HasCallStack, MonadIO m) => HookList -> Hook -> HookCompareFunc -> m ()gi-glib GI.GLib.Structs.Hook Inserts a Hook into a HookList, sorted by the given function.
queueInsertSorted :: (HasCallStack, MonadIO m) => Queue -> Ptr () -> CompareDataFunc -> m ()gi-glib GI.GLib.Structs.Queue Inserts data into queue using func to determine the new position. Since: 2.4
queueSort :: (HasCallStack, MonadIO m) => Queue -> CompareDataFunc -> m ()gi-glib GI.GLib.Structs.Queue Sorts queue using compareFunc. Since: 2.4
-
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
sequenceSort :: (HasCallStack, MonadIO m) => Sequence -> CompareDataFunc -> m ()gi-glib GI.GLib.Structs.Sequence Sorts seq using cmpFunc. cmpFunc is passed two items of seq and should return 0 if they are equal, a negative value if the first comes before the second, and a positive value if the second comes before the first. Since: 2.14
sequenceSortChanged :: (HasCallStack, MonadIO m) => SequenceIter -> CompareDataFunc -> m ()gi-glib GI.GLib.Structs.Sequence Moves the data pointed to by iter to a new position as indicated by cmpFunc. This function should be called for items in a sequence already sorted according to cmpFunc whenever some aspect of an item changes so that cmpFunc may return different values for that item. 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. Since: 2.14
-
gi-glib GI.GLib.Structs.Sequence Like sequenceSortChanged, but uses a SequenceIterCompareFunc instead of a CompareDataFunc as the compare function. iterCmp is called with two iterators pointing into the Sequence that iter points into. 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. Since: 2.14
sequenceSortIter :: (HasCallStack, MonadIO m) => Sequence -> SequenceIterCompareFunc -> m ()gi-glib GI.GLib.Structs.Sequence Like sequenceSort, but uses a SequenceIterCompareFunc instead of a CompareDataFunc as the compare function cmpFunc 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. Since: 2.14
valueArraySort :: (HasCallStack, MonadIO m) => ValueArray -> CompareDataFunc -> m ValueArraygi-gobject GI.GObject.Structs.ValueArray Deprecated: (Since version 2.32)Use Array and g_array_sort_with_data().