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. type SortAlg a = [a] -> [a]

   tensort	Data.Tensort.Utils.Types

   A sorting algorithm is a function that takes a list of ordered elements and returns that list sorted.

2. SortAsc :: t -> SortBy t

   users	Web.Users.Types

   No documentation available.

3. data SortBy t

   users	Web.Users.Types

   Sorting direction

4. SortDesc :: t -> SortBy t

   users	Web.Users.Types

   No documentation available.

5. module Data.Vector.Algorithms.Quicksort.Predefined.SortTriple

   No documentation available.

6. data SortTriple

   vector-quicksort	Data.Vector.Algorithms.Quicksort.Predefined.SortTriple

   No documentation available.

7. SortTriple :: Double -> Double -> Word64 -> SortTriple

   vector-quicksort	Data.Vector.Algorithms.Quicksort.Predefined.SortTriple

   No documentation available.

8. data SortListModelGetIncrementalMethodInfo

   gi-gtk	GI.Gtk

   No documentation available.

9. data SortListModelGetModelMethodInfo

   gi-gtk	GI.Gtk

   No documentation available.

10. data SortListModelGetPendingMethodInfo

    gi-gtk	GI.Gtk

    No documentation available.

Page 91 of many | Previous | Next