A general abstraction for manipulating elements of container data structures
|Version on this page:||0.1.4@rev:1|
|LTS Haskell 20.23:||126.96.36.199|
|Stackage Nightly 2023-05-31:||188.8.131.52|
|Latest on Hackage:||184.108.40.206|
This version can be pinned in stack with:
Module documentation for 0.1.4
Depends on 1 package(full list with versions):
Used by 2 packages in lts-3.22(full list with versions):
An API for construction of free-form strategies of access and manipulation of elements of arbitrary data structures. It allows to implement efficient composite patterns, e.g., a simultaneous update and lookup of an element, and even more complex things.
Strategies are meant to be interpreted by the host data structure libraries. Thus they allow to implement all access and modification patterns of a data structure with just a single function, which interprets strategies.
This library provides pure and monadic interfaces, so it supports both immutable and mutable data structures.