Hackage :: [Package]

attoparsec-iso8601: Parsing of ISO 8601 dates, originally from aeson

[ bsd3, library, parsing ] [ Propose Tags ] [ Report a vulnerability ]

Parsing of ISO 8601 dates, originally from aeson.

[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

Versions [RSS] 1.0.0.0, 1.0.1.0, 1.0.2.0, 1.0.2.1, 1.1.0.0, 1.1.0.1, 1.1.1.0
Change log changelog.md
Dependencies attoparsec (>=0.14.2 && <0.15), base (>=4.10.0.0 && <5), integer-conversion (>=0.1 && <0.2), text (>=1.2.3.0 && <1.3.0.0 || >=2.0 && <2.2), time (>=1.6.0.1 && <1.13), time-compat (>=1.9.4 && <1.10) [details]
Tested with ghc ==8.2.2 || ==8.4.4 || ==8.6.5 || ==8.8.4 || ==8.10.7 || ==9.0.2 || ==9.2.8 || ==9.4.7 || ==9.6.3 || ==9.8.1
License BSD-3-Clause
Copyright (c) 2011-2016 Bryan O'Sullivan (c) 2011 MailRank, Inc.
Author Bryan O'Sullivan <bos@serpentine.com>
Maintainer Adam Bergmark <adam@bergmark.nl>
Uploaded by phadej at 2023-10-16T15:56:39Z
Category Parsing
Home page https://github.com/haskell/aeson
Bug tracker https://github.com/haskell/aeson/issues
Source repo head: git clone git://github.com/haskell/aeson.git(attoparsec-iso8601)
Distributions Arch:1.1.1.0, Fedora:1.1.1.0, LTSHaskell:1.1.1.0, Stackage:1.1.1.0
Reverse Dependencies 7 direct, 1284 indirect [details]
Downloads 48917 total (18 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2023-10-16 [all 1 reports]

Readme for attoparsec-iso8601-1.1.0.1

[back to package description]

Parsing of ISO 8601 dates.

This package is used to parse dates in aeson. It is split into a separate package to be shared by other projects that want to parse dates like aeson does.

For now, this project is located in the aeson repository and aeson itself uses the source of this package without pulling in the package as a dependency.

Stability

Since aeson depends on this package we want to be very careful about changing the format.

There may be breaking changes if we find that the format is incorrectly too lenient. We consider widening of the allowed input a non-breaking addition since all previously valid input will still parse correctly.