Efficient simple pretty printing combinators


Version on this page:1.1
LTS Haskell 11.22:1.1@rev:1
Stackage Nightly 2018-03-12:1.1
Latest on Hackage:1.1@rev:1

See all snapshots FPretty appears in

BSD-3-Clause licensed by Olaf Chitil
Maintained by O.Chitil@kent.ac.uk
This version can be pinned in stack with:FPretty-1.1@sha256:6e35d96e78b2e6cf79f88217a7084899000530a399cd5d2857471cadabd20d13,978

Module documentation for 1.1

Depends on 2 packages(full list with versions):

A pretty printer turns a tree structure into indented text, such that the indentation reflects the tree structure. To keep text short, substructures are put into a single line as far as possible. The library provides combinators for building pretty printers. It emphasizes simplicity and efficiency.