map -package:conduit -package:dlist -package:aeson -package:containers package:invertible

Apply a bijection over a list using map.
Map each element to a monoidal and sequenceI_ the results.
Map each element to a Maybe monoidal and sequence the results (like traverse and mapMaybe).
Transform the type constructor within a Free.
Default invertible Functor implementation for simple non-invertible Functors.
Lift both sides of an bijection over a functor using fmap. We name this bifmap in deference to the more useful fmap.
Apply a bijection over an Invariant using invmap.