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.
sortingBag :: Foldable f => Sort k -> Sort (f k)discrimination Data.Discrimination.Sorting Construct a stable ordered discriminator that sorts a list as multisets of elements from another stable ordered discriminator. The resulting discriminator only cares about the set of keys and their multiplicity, and is sorted as if we'd sorted each key in turn before comparing.
sortingCompare :: Sorting a => a -> a -> Orderingdiscrimination Data.Discrimination.Sorting -
discrimination Data.Discrimination.Sorting No documentation available.
sortingSet :: Foldable f => Sort k -> Sort (f k)discrimination Data.Discrimination.Sorting Construct a stable ordered discriminator that sorts a list as sets of elements from another stable ordered discriminator. The resulting discriminator only cares about the set of keys, and is sorted as if we'd sorted each key in turn before comparing.
sortAndGroupFstBySnd :: Ord b => [(a, b)] -> [([a], b)]fitspec Test.FitSpec.Utils No documentation available.
sortAndGroupOn :: Ord b => (a -> b) -> [a] -> [[a]]fitspec Test.FitSpec.Utils No documentation available.
sortGroupAndCollapse :: Ord b => (a -> b) -> (a -> c) -> (b -> [c] -> d) -> [a] -> [d]fitspec Test.FitSpec.Utils No documentation available.
sortOn :: Ord b => (a -> b) -> [a] -> [a]fitspec Test.FitSpec.Utils No documentation available.
sortByFL :: (a -> a -> Ordering) -> FocusList a -> FocusList afocuslist Data.FocusList Sort a FocusList. The Focus will stay with the element that has the Focus.
>>> let Just fl = fromListFL (Focus 2) ["b", "c", "a"] >>> sortByFL compare fl FocusList (Focus 0) ["a","b","c"]
Nothing will happen if you try to sort an empty FocusList, or a FocusList with only one element.emptyFL == sortByFL compare emptyFL
singletonFL a == sortByFL compare (singletonFL a)
The element with the Focus should be the same before and after sorting.getFocusItemFL (fl :: FocusList Int) == getFocusItemFL (sortByFL compare fl)
Sorting a FocusList and getting the underlying Seq should be the same as getting the underlying Seq and then sorting it.toSeqFL (sortByFL compare (fl :: FocusList Int)) == sortBy compare (toSeqFL fl)
WARNING: The computational complexity for this is very bad. It should be able to be done in O(n * log n), but the current implementation is O(n^2) (or worse), where n is the length of the FocusList. This function could be implemented the same way Data.Sequence.sortBy is implemented. However, a small change needs to be added to that function to keep track of the Focus in the FocusList and make sure it gets updated properly. If you're interested in fixing this, please send a PR.sortCardsBy :: OrderedCard c o => o -> [c] -> [c]general-games Game.Implement.Card No documentation available.