MPL-2.0 licensed by Kowainik
This version can be pinned in stack with:tomland-0.3@sha256:78af219745a626b138db7d94747c621e9e13d5ba406fa04286c9a500791578b6,3479
Module documentation for 0.3
Change log
tomland uses PVP Versioning .
The change log is available on GitHub .
0.3
#8 :
Create EDSL for easier TOML data type writing.
#10 :
Add Semigroup and Monoid instances for PrefixTree and TOML.
Add property tests on laws.
#20 :
Add parsing of hexadecimal, octal, and binary integer numbers.
#26 :
Implement unit tests for TOML parsers.
Allow terminating commas inside an array.
Allow comments before and after any value inside an array.
Allow keys to be literal strings.
Breaking change: #60 :
Replace Valuer with Prism.
Migration guide: replace any fooV with corresponding prism _Foo.
Breaking change: #66 :
Introduce consistent names according to Haskell types.
Migration guide: see issue details to know which names to use.
0.2.1
Make table parser work with maybeP.
#39 :
Implement prettyException function for DecodeException.
0.2.0
Switch names for decode and encode functions.
#47 :
Rename dimapBijection to dimap. Introduce mdimap combinator.#37 :
Add tables support for bidirectional conversion.
0.1.0
#16 :
Add parser for literal strings.Add IsString instance for Key data type.
#38 :
Add bidirectional converter for array.#21 :
Report expected vs. actual type error in parsing.#44 :
Add bidirectional converter for Maybe.
0.0.0
#3 :
Implement basic TOML parser with megaparsec.#7 :
Implement type safe version of Value type as GADT.#4 :
Implement basic pretty-printer.#1 :
Implement types representing TOML configuration.Initially created.
Stackage is a service provided by the
Haskell Foundation
│ Originally developed by
FP Complete
