name:                 lens
version:              5.3.3
visibility:           public
id:                   lens-5.3.3-GuyFqV52qsYJgFSfE7uH9V
key:                  lens-5.3.3-GuyFqV52qsYJgFSfE7uH9V
license:              BSD-2-Clause
copyright:            Copyright (C) 2012-2016 Edward A. Kmett
maintainer:           Edward A. Kmett <ekmett@gmail.com>
author:               Edward A. Kmett
stability:            provisional
homepage:             http://github.com/ekmett/lens/
synopsis:             Lenses, Folds and Traversals
description:
    This package comes \"Batteries Included\" with many useful lenses for the types
    commonly used from the Haskell Platform, and with tools for automatically
    generating lenses and isomorphisms for user-supplied data types.

    The combinators in @Control.Lens@ provide a highly generic toolbox for composing
    families of getters, folds, isomorphisms, traversals, setters and lenses and their
    indexed variants.

    An overview, with a large number of examples can be found in the <https://github.com/ekmett/lens#lens-lenses-folds-and-traversals README>.

    An introductory video on the style of code used in this library by Simon Peyton Jones is available from <https://archive.org/details/lenses-compositional-data-access-and-manipulation-simon-peyton-jones-at-haskell- Internet Archive>.

    A video on how to use lenses and how they are constructed is available on <http://youtu.be/cefnmjtAolY?hd=1 youtube>.

    Slides for that second talk can be obtained from <http://comonad.com/haskell/Lenses-Folds-and-Traversals-NYC.pdf comonad.com>.

    More information on the care and feeding of lenses, including a brief tutorial and motivation
    for their types can be found on the <https://github.com/ekmett/lens/wiki lens wiki>.

    A small game of @pong@ and other more complex examples that manage their state using lenses can be found in the <https://github.com/ekmett/lens/blob/master/examples/ example folder>.

    /Lenses, Folds and Traversals/

    With some signatures simplified, the core of the hierarchy of lens-like constructions looks like:


    <<http://i.imgur.com/ALlbPRa.png>>

    <https://raw.githubusercontent.com/ekmett/lens/master/images/Hierarchy.png (Local Copy)>

    You can compose any two elements of the hierarchy above using @(.)@ from the @Prelude@, and you can
    use any element of the hierarchy as any type it linked to above it.

    The result is their lowest upper bound in the hierarchy (or an error if that bound doesn't exist).

    For instance:

    * You can use any 'Traversal' as a 'Fold' or as a 'Setter'.

    * The composition of a 'Traversal' and a 'Getter' yields a 'Fold'.

    /Minimizing Dependencies/

    If you want to provide lenses and traversals for your own types in your own libraries, then you
    can do so without incurring a dependency on this (or any other) lens package at all.

    /e.g./ for a data type:

    > data Foo a = Foo Int Int a

    You can define lenses such as

    > -- bar :: Lens' (Foo a) Int
    > bar :: Functor f => (Int -> f Int) -> Foo a -> f (Foo a)
    > bar f (Foo a b c) = fmap (\a' -> Foo a' b c) (f a)

    > -- quux :: Lens (Foo a) (Foo b) a b
    > quux :: Functor f => (a -> f b) -> Foo a -> f (Foo b)
    > quux f (Foo a b c) = fmap (Foo a b) (f c)

    without the need to use any type that isn't already defined in the @Prelude@.

    And you can define a traversal of multiple fields with 'Control.Applicative.Applicative':

    > -- traverseBarAndBaz :: Traversal' (Foo a) Int
    > traverseBarAndBaz :: Applicative f => (Int -> f Int) -> Foo a -> f (Foo a)
    > traverseBarAndBaz f (Foo a b c) = Foo <$> f a <*> f b <*> pure c

    What is provided in this library is a number of stock lenses and traversals for
    common haskell types, a wide array of combinators for working them, and more
    exotic functionality, (/e.g./ getters, setters, indexed folds, isomorphisms).

category:             Data, Lenses, Generics
abi:                  42de4ff7989017b03641533cb1c48420
exposed:              True
exposed-modules:
    Control.Exception.Lens Control.Lens Control.Lens.At
    Control.Lens.Combinators Control.Lens.Cons Control.Lens.Each
    Control.Lens.Empty Control.Lens.Equality Control.Lens.Extras
    Control.Lens.Fold Control.Lens.Getter Control.Lens.Indexed
    Control.Lens.Internal Control.Lens.Internal.Bazaar
    Control.Lens.Internal.ByteString Control.Lens.Internal.CTypes
    Control.Lens.Internal.Context Control.Lens.Internal.Deque
    Control.Lens.Internal.Doctest Control.Lens.Internal.Exception
    Control.Lens.Internal.FieldTH Control.Lens.Internal.Fold
    Control.Lens.Internal.Getter Control.Lens.Internal.Indexed
    Control.Lens.Internal.Instances Control.Lens.Internal.Iso
    Control.Lens.Internal.Level Control.Lens.Internal.List
    Control.Lens.Internal.Magma Control.Lens.Internal.Prism
    Control.Lens.Internal.PrismTH Control.Lens.Internal.Profunctor
    Control.Lens.Internal.Review Control.Lens.Internal.Setter
    Control.Lens.Internal.TH Control.Lens.Internal.Zoom
    Control.Lens.Iso Control.Lens.Lens Control.Lens.Level
    Control.Lens.Operators Control.Lens.Plated Control.Lens.Prism
    Control.Lens.Profunctor Control.Lens.Reified Control.Lens.Review
    Control.Lens.Setter Control.Lens.TH Control.Lens.Traversal
    Control.Lens.Tuple Control.Lens.Type Control.Lens.Unsound
    Control.Lens.Wrapped Control.Lens.Zoom Control.Monad.Error.Lens
    Control.Parallel.Strategies.Lens Control.Seq.Lens Data.Array.Lens
    Data.Bits.Lens Data.ByteString.Lazy.Lens Data.ByteString.Lens
    Data.ByteString.Strict.Lens Data.Complex.Lens Data.Data.Lens
    Data.Dynamic.Lens Data.HashSet.Lens Data.IntSet.Lens Data.List.Lens
    Data.Map.Lens Data.Sequence.Lens Data.Set.Lens Data.Text.Lazy.Lens
    Data.Text.Lens Data.Text.Strict.Lens Data.Tree.Lens
    Data.Typeable.Lens Data.Vector.Generic.Lens Data.Vector.Lens
    GHC.Generics.Lens Language.Haskell.TH.Lens Numeric.Lens
    Numeric.Natural.Lens System.Exit.Lens System.FilePath.Lens
    System.IO.Error.Lens

hidden-modules:       Control.Lens.Internal.Prelude
import-dirs:
    /usr/pkg/lib/aarch64-netbsd-ghc-9.10.1/lens-5.3.3-GuyFqV52qsYJgFSfE7uH9V

library-dirs:
    /usr/pkg/lib/aarch64-netbsd-ghc-9.10.1/lens-5.3.3-GuyFqV52qsYJgFSfE7uH9V

library-dirs-static:
    /usr/pkg/lib/aarch64-netbsd-ghc-9.10.1/lens-5.3.3-GuyFqV52qsYJgFSfE7uH9V

dynamic-library-dirs: /usr/pkg/lib/aarch64-netbsd-ghc-9.10.1
data-dir:             /usr/pkg/share/aarch64-netbsd-ghc-9.10.1/lens-5.3.3
hs-libraries:         HSlens-5.3.3-GuyFqV52qsYJgFSfE7uH9V
depends:
    array-0.5.7.0-inplace assoc-1.1.1-Fpg5xDjm4LzJzOy2WMBWgK
    base-4.20.0.0-inplace base-orphans-0.9.3-Jm2d0DnqEGvIVhe0IVS9kl
    bifunctors-5.6.2-OFrj7iAEE2GFzeo61y3eE bytestring-0.12.1.0-inplace
    call-stack-0.4.0-F9O1GQwuupx8505aPpBR9k
    comonad-5.0.9-9wlpd2BQZP7FRm6eBqgcQv containers-0.7-inplace
    contravariant-1.5.5-2cBAMZFuDm7Gn8W6FQGr8G
    distributive-0.6.2.1-8JXFzRgjEQkAe7JAKyvZsu
    exceptions-0.10.7-inplace filepath-1.5.2.0-inplace
    free-5.2-80KVzMloHSZ6giRVM2rsod ghc-prim-0.11.0-inplace
    hashable-1.5.0.0-93vVlDWTvOTF1kJlBpPOXB
    indexed-traversable-0.1.4-GrkXVlduNJU6HwOKwrPCNE
    indexed-traversable-instances-0.1.2-Is87RVV2NlK7bG5taQiD7d
    kan-extensions-5.2.6-HsjqBLs8Ju49OAimftcdz0 mtl-2.3.1-inplace
    parallel-3.2.2.0-IqDBWAfXZ0I3yROLoenRWs
    profunctors-5.6.2-3KBXYSh7PL18SNKDRMQ4vU
    reflection-2.1.9-LaIeiJTc87L4Lr2usEWatr
    semigroupoids-6.0.1-BOacROJJQOA5Lsqd9Ee4fo
    strict-0.5.1-1mB1yRAtJfYEfaxRHR0qto
    tagged-0.8.9-DfMvf7f6neV1YEOofSyVFB
    template-haskell-2.22.0.0-inplace text-2.1.1-inplace
    th-abstraction-0.7.1.0-26pbdb2QUSCHn0B9SqZNC2
    these-1.2.1-IGEtUUvvrj4G6MQqHx4fNb transformers-0.6.1.1-inplace
    transformers-compat-0.7.2-7A0DSPsgJ00DTBHrBnGo4g
    unordered-containers-0.2.20-DmA1der3vIe6VwQRGylcdv
    vector-0.13.2.0-IQjxDWDvdFJE3A4jpN00x9

haddock-interfaces:
    /usr/pkg/share/doc/aarch64-netbsd-ghc-9.10.1/lens-5.3.3/html/lens.haddock

haddock-html:
    /usr/pkg/share/doc/aarch64-netbsd-ghc-9.10.1/lens-5.3.3/html
