discrimination
discrimination copied to clipboard
Fast linear time sorting and discrimination for a large class of data types
A `Sorting` instance of `Down` enables the user to write `sortWith Down` to sort in reverse order.
How to do this correctly? `grouping = hashing` is unsatisfactory.
So I have the following type ```haskell data Atom v = Variable v | Term [Atom v] deriving stock (Eq, Read, Data, Typeable, Generic, Generic1, Functor, Foldable, Traversable) instance Grouping...
The site is linked from the repo discription but it only has documentation for 0.1. Maybe remove the link as there's already a Hackage link?
I'm in need of a `Grouping` instance for `Double`. I'm not particularly worried about what happens with the different representations of NaNs, or with negative zeros, so I think I...
Could a `Grouping Text` instance be added? https://hackage.haskell.org/package/discrimination-0.5/docs/Data-Discrimination-Grouping.html#t:Grouping
``` group :: Grouping a => [a] -> [NonEmpty a] groupWith :: Grouping b => (a -> b) -> [a] -> [NonEmpty a] ```
``` group1 :: Grouping1 (NonEmpty a) => NonEmpty a -> NonEmpty (NonEmpty a) groupWith1 :: Grouping1 (NonEmpty b) => (a -> b) -> NonEmpty a -> NonEmpty (NonEmpty a) ```