show-combinators: Combinators to write Show instances

[ library, mit, text ] [ Propose Tags ]

A minimal pretty-printing library for Show instances in Haskell.

[Skip to Readme]
Versions [faq],
Dependencies base (>=4.8 && <4.13) [details]
License MIT
Copyright 2018 Li-yao Xia
Author Li-yao Xia
Revised Revision 2 made by lyxia at Fri Jan 11 12:28:05 UTC 2019
Category Text
Home page
Source repo head: git clone
Uploaded by lyxia at Sun Feb 25 19:48:30 UTC 2018
Distributions LTSHaskell:, NixOS:, Stackage:
Downloads 300 total (25 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2018-03-20 [all 2 reports]




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

For package maintainers and hackage trustees

Readme for show-combinators-

[back to package description]

Show combinators

A minimal set of convenient combinators to write Show instances.

data MyType a
  = C a a                   -- a regular constructor
  | a :+: a                 -- an infix constructor
  | R { f1 :: a, f2 :: a }  -- a record

infixl 4 :+:

instance Show a => Show (MyType a) where
  showsPrec = flip precShows where
    precShows (C a b) = showCon "C" @| a @| b
    precShows (c :+: d) = showInfix ":+:" 4 c d
    precShows (R {f1 = e, f2 = f}) =
      showRecord "R" ("f1" .=. e &| "f2" .=. f)