Hoogle Search

Within LTS Haskell 24.55 (ghc-9.10.3)

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

Exact lookup

1. itsOrTheir :: [a] -> SDoc

   ghc	GHC.Utils.Outputable

   Determines the form of possessive appropriate for the length of a list:

   itsOrTheir [x]   = text "its"
   itsOrTheir [x,y] = text "their"
   itsOrTheir []    = text "their"  -- probably avoid this
   

2. thisOrThese :: [a] -> SDoc

   ghc	GHC.Utils.Outputable

   Determines the form of subject appropriate for the length of a list:

   thisOrThese [x]   = text "This"
   thisOrThese [x,y] = text "These"
   thisOrThese []    = text "These"  -- probably avoid this
   

3. data HsTupleSort

   ghc	Language.Haskell.Syntax.Type

   Haskell Tuple Sort

4. data NaturalSortKey

   hspec-discover	Test.Hspec.Discover.Sort

   No documentation available.

5. naturalSortKey :: String -> NaturalSortKey

   hspec-discover	Test.Hspec.Discover.Sort

   No documentation available.

6. 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.

7. 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

8. asyncQueuePushSortedUnlocked :: (HasCallStack, MonadIO m) => AsyncQueue -> Ptr () -> CompareDataFunc -> m ()

   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

9. 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.10

10. asyncQueueSortUnlocked :: (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

Page 111 of many | Previous | Next