| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
Control.Newtype.Generics
Description
The Newtype typeclass and related functions.
Primarily pulled from Conor McBride's Epigram work. Some examples:
>>>ala Sum foldMap [1,2,3,4]10
>>>ala Endo foldMap [(+1), (+2), (subtract 1), (*2)] 38
>>>under2 Min (<>) 2 11
>>>over All not (All False)All {getAll = True)
This package includes Newtype instances for all the (non-GHC/foreign)
newtypes in base (as seen in the examples).
However, there are neat things you can do with this with
any newtype and you should definitely define your own Newtype
instances for the power of this library.
For example, see ala Cont traverse, with the proper Newtype instance for Cont.
You can easily define new instances for your newtypes with the help of GHC.Generics
import GHC.Generics (...) newtype Example = Example Int deriving (Generic) instance Newtype Example
This avoids the use of Template Haskell (TH) to get new instances.
Synopsis
- class Newtype n where
- op :: (Newtype n, o ~ O n) => (o -> n) -> n -> o
- ala :: (Newtype n, Newtype n', o' ~ O n', o ~ O n) => (o -> n) -> ((o -> n) -> b -> n') -> b -> o'
- ala' :: (Newtype n, Newtype n', o' ~ O n', o ~ O n) => (o -> n) -> ((a -> n) -> b -> n') -> (a -> o) -> b -> o'
- under :: (Newtype n, Newtype n', o' ~ O n', o ~ O n) => (o -> n) -> (n -> n') -> o -> o'
- over :: (Newtype n, Newtype n', o' ~ O n', o ~ O n) => (o -> n) -> (o -> o') -> n -> n'
- under2 :: (Newtype n, Newtype n', o' ~ O n', o ~ O n) => (o -> n) -> (n -> n -> n') -> o -> o -> o'
- over2 :: (Newtype n, Newtype n', o' ~ O n', o ~ O n) => (o -> n) -> (o -> o -> o') -> n -> n -> n'
- underF :: (Newtype n, Newtype n', o' ~ O n', o ~ O n, Functor f, Functor g) => (o -> n) -> (f n -> g n') -> f o -> g o'
- overF :: (Newtype n, Newtype n', o' ~ O n', o ~ O n, Functor f, Functor g) => (o -> n) -> (f o -> g o') -> f n -> g n'
Documentation
class Newtype n where Source #
As long as the type n is an instance of Generic, you can create an instance
with just instance Newtype n
Minimal complete definition
Nothing
Methods
pack :: (Generic n, GNewtype (Rep n), O n ~ GO (Rep n)) => O n -> n Source #
unpack :: (Generic n, GNewtype (Rep n), O n ~ GO (Rep n)) => n -> O n Source #
Instances
| Newtype Any Source # | |
| Newtype All Source # | |
| Newtype (ZipList a) Source # | |
| Newtype (Dual a) Source # | Since: 0.5.1 |
| Newtype (Endo a) Source # | |
| Newtype (Product a) Source # | |
| Newtype (Sum a) Source # | |
| Newtype (Identity a) Source # | Since: 0.5.1 |
| Newtype (Fixed a) Source # | Since: 0.5.1 |
| Newtype (First a) Source # | |
| Newtype (Last a) Source # | |
| Newtype (Down a) Source # | Since: 0.5.1 |
| Newtype (First a) Source # | Since: 0.5.1 |
| Newtype (Last a) Source # | Since: 0.5.1 |
| Newtype (Max a) Source # | Since: 0.5.1 |
| Newtype (Min a) Source # | Since: 0.5.1 |
| Newtype (Option a) Source # | Since: 0.5.1 |
| Newtype (WrappedMonoid m) Source # | Since: 0.5.1 |
| Newtype (WrappedMonad m a) Source # | |
| Newtype (ArrowMonad a b) Source # | |
| Newtype (WrappedArrow a b c) Source # | |
| Newtype (Const a x) Source # | |
| Newtype (Kleisli m a b) Source # | |
| Newtype (Alt f a) Source # | Since: 0.5.1 |
| Newtype (Compose f g a) Source # | Since: 0.5.1 |
op :: (Newtype n, o ~ O n) => (o -> n) -> n -> o Source #
This function serves two purposes:
- Giving you the unpack of a newtype without you needing to remember the name.
- Showing that the first parameter is completely ignored on the value level, meaning the only reason you pass in the constructor is to provide type information. Typeclasses sure are neat.
>>>op Identity (Identity 3)3
ala :: (Newtype n, Newtype n', o' ~ O n', o ~ O n) => (o -> n) -> ((o -> n) -> b -> n') -> b -> o' Source #
The workhorse of the package. Given a "packer" and a "higher order function" (hof), it handles the packing and unpacking, and just sends you back a regular old function, with the type varying based on the hof you passed.
The reason for the signature of the hof is due to ala not caring about structure.
To illustrate why this is important, consider this alternative implementation of under2:
under2 :: (Newtype n, Newtype n', o' ~ O n', o ~ O n)
=> (o -> n) -> (n -> n -> n') -> (o -> o -> o')
under2' pa f o0 o1 = ala pa (\p -> uncurry f . bimap p p) (o0, o1)Being handed the "packer", the hof may apply it in any structure of its choosing – in this case a tuple.
>>>ala Sum foldMap [1,2,3,4]10
ala' :: (Newtype n, Newtype n', o' ~ O n', o ~ O n) => (o -> n) -> ((a -> n) -> b -> n') -> (a -> o) -> b -> o' Source #
This is the original function seen in Conor McBride's work.
The way it differs from the ala function in this package,
is that it provides an extra hook into the "packer" passed to the hof.
However, this normally ends up being id, so ala wraps this function and
passes id as the final parameter by default.
If you want the convenience of being able to hook right into the hof,
you may use this function.
>>>ala' Sum foldMap length ["hello", "world"]10
>>>ala' First foldMap (readMaybe @Int) ["x", "42", "1"]Just 42
under :: (Newtype n, Newtype n', o' ~ O n', o ~ O n) => (o -> n) -> (n -> n') -> o -> o' Source #
A very simple operation involving running the function 'under' the newtype.
>>>under Product (stimes 3) 327
over :: (Newtype n, Newtype n', o' ~ O n', o ~ O n) => (o -> n) -> (o -> o') -> n -> n' Source #
The opposite of under. I.e., take a function which works on the
underlying types, and switch it to a function that works on the newtypes.
>>>over All not (All False)All {getAll = True}
under2 :: (Newtype n, Newtype n', o' ~ O n', o ~ O n) => (o -> n) -> (n -> n -> n') -> o -> o -> o' Source #
Lower a binary function to operate on the underlying values.
>>>under2 Any (<>) True FalseTrue
Since: 0.5.2
over2 :: (Newtype n, Newtype n', o' ~ O n', o ~ O n) => (o -> n) -> (o -> o -> o') -> n -> n -> n' Source #
The opposite of under2.
Since: 0.5.2