homepage: ''
changelog-type: ''
hash: d03baa3b393854504d85cde3c9012c8ffe55b601f75c30231a40fc8d7df12ef2
test-bench-deps: {}
maintainer: muesli4@gmail.com
synopsis: Provides zips where the combining doesn't stop premature, but instead uses
  default values.
changelog: ''
basic-deps:
  base: ! '>=4.7 && <4.9'
all-versions:
- '0.1.0.0'
- '0.1.0.1'
author: Moritz Bruder
latest: '0.1.0.1'
description-type: markdown
description: ! "# list-zip-def\n\nProvides zip functions that use a given default
  value, whenever one list is exhausted, but not all.\n\n    Prelude> import Data.List.Zip\n
  \   Prelude Data.List.Zip> zipDef 0 'x' [1, 2, 3] \"a\"\n    [(1,'a')(2,'x')(3,'x')]\n\n"
license-name: PublicDomain

homepage: ''
changelog-type: ''
hash: 2bbd57e04eb7266dda77ff6134d10af2fb96b36402ee78612df62a96e898d224
test-bench-deps: {}
maintainer: muesli4@gmail.com
synopsis: Provides zips with default values.
changelog: ''
basic-deps:
  base: ! '>=4.7 && <4.12'
all-versions:
- '0.1.0.0'
- '0.1.0.1'
- '0.1.0.2'
author: Moritz Bruder
latest: '0.1.0.2'
description-type: markdown
description: ! "# list-zip-def\n\nProvides zip functions that use a given default
  value, whenever one list is exhausted, but not all.\n\n    Prelude> import Data.List.Zip\n
  \   Prelude Data.List.Zip> zipDef 0 'x' [1, 2, 3] \"a\"\n    [(1,'a')(2,'x')(3,'x')]\n\nThe
  resulting list spine is also lazy:\n\n    Prelude Data.List.Zip> let xs = zipDef
  0 'x' [1, 2, 3 :: Int] \"a\"\n    Prelude Data.List.Zip> :sprint xs\n    xs = _\n
  \   Prelude Data.List.Zip> import Data.Maybe\n    Prelude Data.List.Zip Data.Maybe>
  listToMaybe xs \n    Just (1,'a')\n    Prelude Data.List.Zip Data.Maybe> :sprint
  xs\n    xs = (1,'a') : _\n"
license-name: LicenseRefPublicDomain

Update from Hackage at 2018-09-05T04:48:49Z
Update from Hackage at 2018-09-05T04:48:49Z
