úÎ,å*ƒ'      !"#$%&Safe067;<=>?FT)ãAs long as the type nB is an instance of Generic, you can create an instance with just instance Newtype n'Given a newtype n., we will always have the same unwrapped type o/, meaning we can represent this with a fundep n -> o.-Any instance of this class just needs to let pack. equal to the newtype's constructor, and let unpack, destruct the newtype with pattern matching."This function serves two purposes: LGiving 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)3NThe 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 o not caring about structure. To illustrate why this is important, consider this alternative implementation of  : ¯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 hofG may apply it in any structure of its choosing  in this case a tuple.ala Sum foldMap [1,2,3,4]10YThis is the original function seen in Conor McBride's work. The way it differs from the ‰ 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 ! 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"]104ala' First foldMap (readMaybe @Int) ["x", "42", "1"]Just 42KA very simple operation involving running the function 'under' the newtype.under Product (stimes 3) 327The opposite of u. 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} <Lower a binary function to operate on the underlying values.under2 Any (<>) True FalseTrue The opposite of  .  lifted into a Functor.  lifted into a Functor. !   '()*+      !"#$%&'()*+,--newtype-generics-0.5.2-C1mtlgdrUYbGDLh3VkwD07Control.NewtypeNewtypeOpackunpackopalaala'underoverunder2over2underFoverF $fGNewtypeM1$fNewtypeOption$fNewtypeWrappedMonoid $fNewtypeLast$fNewtypeFirst $fNewtypeMax $fNewtypeMin $fNewtypeDown $fNewtypeAlt$fNewtypeLast0$fNewtypeFirst0$fNewtypeProduct $fNewtypeSum $fNewtypeAny $fNewtypeAll $fNewtypeEndo $fNewtypeDual$fNewtypeIdentity$fNewtypeConst$fNewtypeCompose$fNewtypeFixed$fNewtypeArrowMonad$fNewtypeKleisli$fNewtypeZipList$fNewtypeWrappedArrow$fNewtypeWrappedMonadGNewtypeGOgpackgunpack