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. vectorSortBy :: Vector v e => (e -> e -> Ordering) -> v e -> v e

   mono-traversable	Data.Sequences

   Sort a vector using an supplied element ordering function.

2. unstableSort :: Ord a => Seq a -> Seq a

   rio	RIO.Seq

   unstableSort sorts the specified Seq by the natural ordering of its elements, but the sort is not stable. This algorithm is frequently faster and uses less memory than sort.

3. unstableSortBy :: (a -> a -> Ordering) -> Seq a -> Seq a

   rio	RIO.Seq

   A generalization of unstableSort, unstableSortBy takes an arbitrary comparator and sorts the specified sequence. The sort is not stable. This algorithm is frequently faster and uses less memory than sortBy.

4. gsort :: (Ord e, Vector v e) => v e -> v e

   statistics	Statistics.Function

   Sort a vector.

5. partialSort :: (Vector v e, Ord e) => Int -> v e -> v e

   statistics	Statistics.Function

   Partially sort a vector, such that the least k elements will be at the front.

6. revTopSort :: Graph a -> [a]

   Cabal-syntax	Distribution.Compat.Graph

   Reverse topologically sort the nodes of a graph. Requires amortized construction of graph.

7. topSort :: Graph a -> [a]

   Cabal-syntax	Distribution.Compat.Graph

   Topologically sort the nodes of a graph. Requires amortized construction of graph.

8. class ElementTuple tuple => AccessorTuple tuple

   comfort-array	Data.Array.Comfort.Shape

   No documentation available.

9. heapsort :: Ord a => [a] -> [a]

   fgl	Data.Graph.Inductive.Internal.Heap

   No documentation available.

10. topsort :: Graph gr => gr a b -> [Node]

    fgl	Data.Graph.Inductive.Query.DFS

    Topological sorting, i.e. a list of Nodes so that if there's an edge between a source and a target node, the source appears earlier in the result.

Page 114 of many | Previous | Next