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.
-
ghc Language.Haskell.Syntax.Type Haskell Tuple Sort
-
hspec-discover Test.Hspec.Discover.Sort No documentation available.
naturalSortKey :: String -> NaturalSortKeyhspec-discover Test.Hspec.Discover.Sort No documentation available.
qsortWithData :: (HasCallStack, MonadIO m) => Ptr () -> Int32 -> CSize -> CompareDataFunc -> m ()gi-glib GI.GLib.Functions This is just like the standard C qsort() function, but the comparison routine accepts a user data argument. This is guaranteed to be a stable sort since version 2.32.
asyncQueuePushSorted :: (HasCallStack, MonadIO m) => AsyncQueue -> Ptr () -> CompareDataFunc -> m ()gi-glib GI.GLib.Structs.AsyncQueue Inserts data into queue using func to determine the new position. This function requires that the queue is sorted before pushing on new elements, see asyncQueueSort. This function will lock queue before it sorts the queue and unlock it when it is finished. For an example of func see asyncQueueSort. Since: 2.10
-
gi-glib GI.GLib.Structs.AsyncQueue Inserts data into queue using func to determine the new position. The sort function func is passed two elements of the queue. It should return 0 if they are equal, a negative value if the first element should be higher in the queue or a positive value if the first element should be lower in the queue than the second element. This function requires that the queue is sorted before pushing on new elements, see asyncQueueSort. This function must be called while holding the queue's lock. For an example of func see asyncQueueSort. Since: 2.10
asyncQueueSort :: (HasCallStack, MonadIO m) => AsyncQueue -> CompareDataFunc -> m ()gi-glib GI.GLib.Structs.AsyncQueue Sorts queue using func. The sort function func is passed two elements of the queue. It should return 0 if they are equal, a negative value if the first element should be higher in the queue or a positive value if the first element should be lower in the queue than the second element. This function will lock queue before it sorts the queue and unlock it when it is finished. If you were sorting a list of priority numbers to make sure the lowest priority would be at the top of the queue, you could use:
C code
gint32 id1; gint32 id2; id1 = GPOINTER_TO_INT (element1); id2 = GPOINTER_TO_INT (element2); return (id1 > id2 ? +1 : id1 == id2 ? 0 : -1);
Since: 2.10asyncQueueSortUnlocked :: (HasCallStack, MonadIO m) => AsyncQueue -> CompareDataFunc -> m ()gi-glib GI.GLib.Structs.AsyncQueue Sorts queue using func. The sort function func is passed two elements of the queue. It should return 0 if they are equal, a negative value if the first element should be higher in the queue or a positive value if the first element should be lower in the queue than the second element. This function must be called while holding the queue's lock. Since: 2.10
byteArraySort :: (HasCallStack, MonadIO m) => ByteString -> CompareFunc -> m ()gi-glib GI.GLib.Structs.ByteArray Sorts a byte array, using compareFunc which should be a qsort()-style comparison function (returns less than zero for first arg is less than second arg, zero for equal, greater than zero if first arg is greater than second arg). If two array elements compare equal, their order in the sorted array is undefined. If you want equal elements to keep their order (i.e. you want a stable sort) you can write a comparison function that, if two elements would otherwise compare equal, compares them by their addresses.
byteArraySortWithData :: (HasCallStack, MonadIO m) => ByteString -> CompareDataFunc -> m ()gi-glib GI.GLib.Structs.ByteArray Like byteArraySort, but the comparison function takes an extra user data argument.