Hoogle Search

Within LTS Haskell 24.31 (ghc-9.10.3)

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

Exact lookup

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

   rrb-vector	Data.RRBVector

   Sort the vector in ascending order by comparing the results of applying the key function to each element. The sort is stable, meaning the order of equal elements is preserved. sortOn f is equivalent to sortBy (comparing f), but only evaluates f once for each element.

2. sort' :: ProcessType r => r

   shell-conduit	Data.Conduit.Shell

   No documentation available.

3. sort' :: ProcessType r => r

   shell-conduit	Data.Conduit.Shell.PATH

   No documentation available.

4. sortBy :: forall (f :: Type -> Type) (n :: Nat) a . (CFreeMonoid f, Dom f a) => (a -> a -> Ordering) -> Sized f n a -> Sized f n a

   sized	Data.Sized

   Generalized version of sort. Since 0.7.0.0

5. sortBy :: (a -> a -> Ordering) -> Slist a -> Slist a

   slist	Slist

   O(n log n). Non-overloaded version of sort.

   >>> sortBy (\(a,_) (b,_) -> compare a b) $ slist [(2, "world"), (4, "!"), (1, "Hello")]
   Slist {sList = [(1,"Hello"),(2,"world"),(4,"!")], sSize = Size 3}
   

   Note: this function hangs on infinite slists.

6. sortOn :: Ord b => (a -> b) -> Slist a -> Slist a

   slist	Slist

   O(n log n). Sorts 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.

   >>> sortOn fst $ slist [(2, "world"), (4, "!"), (1, "Hello")]
   Slist {sList = [(1,"Hello"),(2,"world"),(4,"!")], sSize = Size 3}
   

   Note: this function hangs on infinite slists.

7. sortWith :: Ord b => (a -> b) -> Slist a -> Slist a

   slist	Slist

   O(n log n). Sorts a list by comparing the results of a key function applied to each element. Elements are arranged from lowest to highest, keeping duplicates in the order they appeared in the input.

   >>> sortWith fst $ slist [(2, "world"), (4, "!"), (1, "Hello")]
   Slist {sList = [(1,"Hello"),(2,"world"),(4,"!")], sSize = Size 3}
   

8. sortOnFirst :: PVector -> PVector -> [(Double, Double)]

   srtree	Algorithm.SRTree.ConfidenceIntervals

   No documentation available.

9. sortBy :: forall (m :: Type -> Type) a . MonadCatch m => (a -> a -> Ordering) -> SerialT m a -> SerialT m a

   streamly	Streamly.Internal.Data.Stream.IsStream

   Sort the input stream using a supplied comparison function. O(n) space Note: this is not the fastest possible implementation as of now. Pre-release

10. sortRecs :: Ord a => SortAlg a -> [Record a] -> [Record a]

    tensort	Data.Tensort.Utils.SortRecs

    No documentation available.

Page 45 of many | Previous | Next