Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
StSort :: [SortField] -> StackPropertyhvega Graphics.Vega.VegaLite Ordering within a stack.
WSort :: [SortField] -> WindowPropertyhvega Graphics.Vega.VegaLite Comparator for sorting data objects within a window transform.
reverseSortEdit :: WorkspaceEdit -> WorkspaceEditlsp Language.LSP.Server The changes in a workspace edit should be applied from the end of the file toward the start. Sort them into this order.
topologicalSort :: (Eq v, Hashable v) => Graph v e -> [v]reactive-banana Reactive.Banana.Prim.Low.Graph If the Graph is acyclic, return a topological sort, that is a linear ordering of its connected vertices such that each vertex occurs before its successors. (Vertices that are not connected are not listed in the topological sort.) https://en.wikipedia.org/wiki/Topological_sorting
fromSortedList :: SortedList a -> [a]sorted-list Data.SortedList O(1). Create a list from a SortedList. The returned list is guaranteed to be sorted.
toSortedList :: Ord a => [a] -> SortedList asorted-list Data.SortedList Create a SortedList by sorting a regular list.
psortBy :: (a -> a -> Bool) -> [a] -> [(a, a)]speculate Test.Speculate.Engine No documentation available.
nubSort :: Ord a => [a] -> [a]speculate Test.Speculate.Utils O(n log n). Sorts and remove repetitions. Equivalent to nub . sort.
> nubSort [1,2,3] [1,2,3] > nubSort [3,2,1] [1,2,3] > nubSort [3,2,1,3,2,1] [1,2,3] > nubSort [3,3,1,1,2,2] [1,2,3]
nubSortBy :: (a -> a -> Ordering) -> [a] -> [a]speculate Test.Speculate.Utils Like nubSort but allows providing a function to compare values.
FieldSortAscending :: FieldSortTypexlsx Codec.Xlsx.Types.PivotTable No documentation available.