úÎ ¤Ñ*      !"#$%&'()(C) 2011-2016 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportable Trustworthy:QRT This is the categorical dual of *._Due to the lack of non-trivial comonoids in Haskell, we can restrict ourselves to requiring a +< rather than some Coapplicative class. Categorically every 9 functor is actually a right adjoint, and so it must be  RepresentableW endofunctor and preserve all limits. This is a fancy way of saying it isomorphic to (->) x for some x.ÿNTo be distributable a container will need to have a way to consistently zip a potentially infinite number of copies of itself. This effectively means that the holes in all values of that type, must have the same cardinality, fixed sized vectors, infinite streams, functions, etc. and no extra information to try to merge together. The dual of distribute [(+1),(+2)] 1[2,3]  =  ,  .  = ,   f =  . - f - f = . .  (/ . f) -  .  f = 0 .  (1 . f)  The dual of   = - 2 .  . 3   =  . 4 f  The dual of   f = - f .   The dual of   f = - f .  $ is a viable default definition for - given a  instance defined in terms of .   (C) 2011-2016 Edward Kmett BSD-style (see the file LICENSE)Edward Kmett <ekmett@gmail.com> provisionalportable Trustworthy:QRT" derived from a 5 type%This can be used to easily produce a  instance for a type with a 5 instance, ndata V2 a = V2 a a deriving (Show, Functor, Generic1) instance Distributive V2' where collect = genericCollect# derived from a 5 type!It's often more efficient to use " instead. !"#6$%&'() !"# !"# !"#6$%&'()7      !"#$%&'()*+,-./012324524624728928:2;<2;=2>?2>@24A2BCDE)distributive-0.5.2-J1KYL3W47Ud448U0mmYiNXData.DistributiveData.Distributive.GenericData.Traversable sequenceAsequencetraversemapM Distributive distributecollect distributeMcollectM cotraversecomapM fmapCollect$fDistributiveM1$fDistributiveRec1$fDistributivePar1$fDistributive:.:$fDistributive:*:$fDistributiveU1$fDistributiveComplex$fDistributiveLast$fDistributiveFirst$fDistributiveMax$fDistributiveMin$fDistributiveSum$fDistributiveProduct$fDistributiveDual$fDistributiveReverse$fDistributiveBackwards$fDistributiveProduct0$fDistributiveCompose$fDistributiveIdentityT$fDistributiveReaderT$fDistributive(->)$fDistributiveTagged$fDistributiveProxy$fDistributiveIdentity GDistributivegcollectgenericCollectgenericDistribute$fGDistributiveM1$fGDistributiveRec1$fGDistributivePar1$fGDistributive:.:$fGDistributive:*:$fGDistributiveU1base TraversableGHC.BaseFunctoridfmapData.Functor.Identity runIdentityIdentityData.Functor.Compose getComposeComposeControl.Applicative unwrapMonad WrapMonadliftM GHC.GenericsGeneric1 gdistribute