data-accessor: Utilities for accessing and manipulating fields of records

[ bsd3, data, library ] [ Propose Tags ] [ Report a vulnerability ]

In Haskell 98 the name of a record field is automatically also the name of a function which gets the value of the according field. E.g. if we have

data Pair a b = Pair {first :: a, second :: b}

then

first  :: Pair a b -> a
second :: Pair a b -> b

However for setting or modifying a field value we need to use some syntactic sugar, which is often clumsy.

modifyFirst :: (a -> a) -> (Pair a b -> Pair a b)
modifyFirst f r@(Pair{first=a}) = r{first = f a}

With this package you can define record field accessors which allow setting, getting and modifying values easily. The package clearly demonstrates the power of the functional approach: You can combine accessors of a record and sub-records, to make the access look like the fields of the sub-record belong to the main record.

Example:

*Data.Accessor.Example> (first^:second^=10) (('b',7),"hallo")
(('b',10),"hallo")

You can easily manipulate record fields in a Control.Monad.State.State monad, you can easily code Show instances that use the Accessor syntax and you can parse binary streams into records. See Data.Accessor.Example for demonstration of all features.

It would be great if in revised Haskell versions the names of record fields are automatically Data.Accessor.Accessors rather than plain get functions. For now, the package data-accessor-template provides Template Haskell functions for automated generation of Data.Acesssor.Accessors. See also the other data-accessor packages that provide an Accessor interface to other data types. The package enumset provides accessors to bit-packed records.

For similar packages see lenses and fclabel. A related concept are editors http://conal.net/blog/posts/semantic-editor-combinators/. Editors only consist of a modify method (and modify applied to a const function is a set function). This way, they can modify all function values of a function at once, whereas an accessor can only change a single function value, say, it can change f 0 = 1 to f 0 = 2. This way, editors can even change the type of a record or a function. An Arrow instance can be defined for editors, but for accessors only a Category instance is possible ((.) method). The reason is the arr method of the Arrow class, that conflicts with the two-way nature (set and get) of accessors.

Flags

Automatic Flags
NameDescriptionDefault
monadfail

Check whether Monad class is split into Monad and MonadFail.

Enabled
category

Check whether Arrow class is split into Arrow and Category.

Enabled
splitbase

Choose the smaller, split-up base package from version 2 on.

Enabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 0.0.1, 0.1.1, 0.1.2, 0.1.3, 0.1.4, 0.2, 0.2.0.1, 0.2.0.2, 0.2.1, 0.2.1.2, 0.2.1.3, 0.2.1.4, 0.2.1.5, 0.2.1.6, 0.2.1.7, 0.2.1.8, 0.2.2, 0.2.2.1, 0.2.2.2, 0.2.2.3, 0.2.2.4, 0.2.2.5, 0.2.2.6, 0.2.2.7, 0.2.2.8, 0.2.3, 0.2.3.1
Dependencies array (>=0.1 && <0.6), base (>=1 && <5), containers (>=0.1 && <0.8), transformers (>=0.2 && <0.7) [details]
Tested with ghc ==6.4.1, ghc ==6.8.2, ghc ==6.10.4, ghc ==6.12.3, ghc ==7.0.1, ghc ==7.2.1, ghc ==7.4.1, ghc ==7.6.3, jhc ==0.7.3
License BSD-3-Clause
Author Henning Thielemann <haskell@henning-thielemann.de>, Luke Palmer <lrpalmer@gmail.com>
Maintainer Henning Thielemann <haskell@henning-thielemann.de>
Revised Revision 1 made by HenningThielemann at 2024-03-19T09:50:01Z
Category Data
Home page http://www.haskell.org/haskellwiki/Record_access
Source repo this: darcs get http://code.haskell.org/data-accessor/core/ --tag 0.2.3.1
head: darcs get http://code.haskell.org/data-accessor/core/
Uploaded by HenningThielemann at 2023-01-15T18:34:48Z
Distributions Arch:0.2.3.1, Debian:0.2.3, Fedora:0.2.3.1, LTSHaskell:0.2.3.1, NixOS:0.2.3.1, Stackage:0.2.3.1
Reverse Dependencies 62 direct, 3708 indirect [details]
Downloads 52412 total (230 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]