Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
unstableSortBy :: (a -> a -> Ordering) -> Seq a -> Seq ario 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.
gsort :: (Ord e, Vector v e) => v e -> v estatistics Statistics.Function Sort a vector.
partialSort :: (Vector v e, Ord e) => Int -> v e -> v estatistics Statistics.Function Partially sort a vector, such that the least k elements will be at the front.
-
Cabal-syntax Distribution.Compat.Graph Reverse topologically sort the nodes of a graph. Requires amortized construction of graph.
-
Cabal-syntax Distribution.Compat.Graph Topologically sort the nodes of a graph. Requires amortized construction of graph.
class ElementTuple tuple =>
AccessorTuple tuplecomfort-array Data.Array.Comfort.Shape No documentation available.
heapsort :: Ord a => [a] -> [a]fgl Data.Graph.Inductive.Internal.Heap No documentation available.
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.
topsort' :: Graph gr => gr a b -> [a]fgl Data.Graph.Inductive.Query.DFS topsort, returning only the labels of the nodes.
pattern
FILE_ATTRIBUTE_STANDARD_SORT_ORDER :: Textgi-gio GI.Gio.Constants A key in the "standard" namespace for setting the sort order of a file. Corresponding FileAttributeType is FileAttributeTypeInt32. An example use would be in file managers, which would use this key to set the order files are displayed. Files with smaller sort order should be sorted first, and files without sort order as if sort order was zero.