packages feed

lens-family-core 2.1.2 → 2.1.3

raw patch · 4 files changed

+9/−5 lines, 4 filesdep ~containers

Dependency ranges changed: containers

Files

CHANGELOG view
@@ -1,3 +1,7 @@+2.1.3 (Changes from 2.1.2)+=========================+* Bump dependency on containers.+ 2.1.2 (Changes from 2.1.0) ========================== * Bump dependency on transformers.
lens-family-core.cabal view
@@ -1,11 +1,11 @@ name:               lens-family-core category:           Data, Lenses-version:            2.1.2+version:            2.1.3 license:            BSD3 cabal-version:      >= 1.10 license-file:       LICENSE author:             Russell O'Connor-maintainer:         Russell O'Connor <roconnor@theorem.ca>+maintainer:         Russell O'Connor <roconnor@r6.ca> stability:          experimental copyright:          Copyright (C) 2012,2013,2014,2017,2018,2019 Russell O'Connor synopsis:           Haskell 2022 Lens Families@@ -46,7 +46,7 @@   default-language:   Haskell2010   build-depends:     base                 >= 4.11    && < 5,-    containers           >= 0.5.8   && < 0.7,+    containers           >= 0.5.8   && < 0.8,     transformers         >= 0.3.0   && < 0.7    exposed-modules:
src/Lens/Family.hs view
@@ -68,7 +68,7 @@ -- -- | 'zipWithOf' can be used with grates to zip two structure together provided a binary operation. ----- 'under' can be to modify each value in a structure according to a function.  This works analogous to how 'over' works for lenses and traversals.+-- 'under' can be used to modify each value in a structure according to a function.  This works analogous to how 'over' works for lenses and traversals. -- -- 'review' can be used with grates to construct a constant grate from a single value.  This is like a 0-ary @zipWith@ function. --
src/Lens/Family/Unchecked.hs view
@@ -147,7 +147,7 @@ -- -- /Note/: It is possible to build grates without even depending on @lens-family-core@ by expanding away the type synonym. ----- > myStream :: Functor g => (g (Stream a) -> Stream b) -> g a -> b+-- > myStream :: Functor g => (g a -> b) -> g (Stream a) -> Stream b -- -- Any value @t :: Functor g => GrateLike g s t a b@ is a well-defined grate when it satisfies the two van Laarhoven traversal laws: --