Efficient simple pretty printing combinators http://www.cs.kent.ac.uk/~oc/pretty.html

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

See all snapshots FPretty appears in

BSD-3-Clause licensed by Olaf Chitil
Maintained by O.Chitil@kent.ac.uk

Module documentation for 1.1

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.

Depends on 2 packages:
Used by 1 package:
comments powered byDisqus