Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. sortOn :: Ord b => (a -> b) -> [a] -> [a]

   relude	Relude.List.Reexport

   Sort a list by comparing the results of a key function applied to each element. sortOn f is equivalent to sortBy (comparing f), but has the performance advantage of only evaluating f once for each element in the input list. This is called the decorate-sort-undecorate paradigm, or Schwartzian transform. Elements are arranged from lowest to highest, keeping duplicates in the order they appeared in the input. The argument must be finite.

   Examples

   >>> sortOn fst [(2, "world"), (4, "!"), (1, "Hello")]
   [(1,"Hello"),(2,"world"),(4,"!")]
   

   >>> sortOn length ["jim", "creed", "pam", "michael", "dwight", "kevin"]
   ["jim","pam","creed","kevin","dwight","michael"]
   

   Performance notes

   This function minimises the projections performed, by materialising the projections in an intermediate list. For trivial projections, you should prefer using sortBy with comparing, for example:

   >>> sortBy (comparing fst) [(3, 1), (2, 2), (1, 3)]
   [(1,3),(2,2),(3,1)]
   

   Or, for the exact same API as sortOn, you can use `sortBy . comparing`:

   >>> (sortBy . comparing) fst [(3, 1), (2, 2), (1, 3)]
   [(1,3),(2,2),(3,1)]
   

2. sortWith :: Ord b => (a -> b) -> [a] -> [a]

   relude	Relude.List.Reexport

   The sortWith function sorts a list of elements using the user supplied function to project something out of each element In general if the user supplied function is expensive to compute then you should probably be using sortOn, as it only needs to compute it once for each element. sortWith, on the other hand must compute the mapping function for every comparison that it performs.

3. sortNub :: Ord a => [a] -> [a]

   relude	Relude.Nub

   Like ordNub runs in <math> but also sorts a list.

   >>> sortNub [3, 3, 3, 2, 2, -1, 1]
   [-1,1,2,3]
   

4. sortBy :: (a -> a -> Ordering) -> NonEmpty a -> NonEmpty a

   base-compat-batteries	Data.List.NonEmpty.Compat

   sortBy for NonEmpty, behaves the same as sortBy

5. sortOn :: Ord b => (a -> b) -> NonEmpty a -> NonEmpty a

   base-compat-batteries	Data.List.NonEmpty.Compat

   Sort a NonEmpty on a user-supplied projection of its elements. See sortOn for more detailed information.

   Examples

   >>> sortOn fst $ (2, "world") :| [(4, "!"), (1, "Hello")]
   (1,"Hello") :| [(2,"world"),(4,"!")]
   

   >>> sortOn length $ "jim" :| ["creed", "pam", "michael", "dwight", "kevin"]
   "jim" :| ["pam","creed","kevin","dwight","michael"]
   

   Performance notes

   This function minimises the projections performed, by materialising the projections in an intermediate list. For trivial projections, you should prefer using sortBy with comparing, for example:

   >>> sortBy (comparing fst) $ (3, 1) :| [(2, 2), (1, 3)]
   (1,3) :| [(2,2),(3,1)]
   

   Or, for the exact same API as sortOn, you can use `sortBy . comparing`:

   >>> (sortBy . comparing) fst $ (3, 1) :| [(2, 2), (1, 3)]
   (1,3) :| [(2,2),(3,1)]
   

   sortWith is an alias for `sortBy . comparing`.

6. sortWith :: Ord o => (a -> o) -> NonEmpty a -> NonEmpty a

   base-compat-batteries	Data.List.NonEmpty.Compat

   sortWith for NonEmpty, behaves the same as:

   sortBy . comparing
   

7. sortLines :: BufferM ()

   yi-core	Yi.Buffer.HighLevel

   Sort the lines of the region.

8. sortLinesWithRegion :: Region -> BufferM ()

   yi-core	Yi.Buffer.HighLevel

   No documentation available.

9. sortLines :: BufferM ()

   yi-core	Yi.Config.Simple

   Sort the lines of the region.

10. sortLinesWithRegion :: Region -> BufferM ()

    yi-core	Yi.Config.Simple

    No documentation available.

Page 23 of many | Previous | Next