homepage: ''
changelog-type: text
hash: a13c868bf2b4775453cdca3d2addd23cb4ddb5c3a67e5f31f90f592c523aa6df
test-bench-deps:
  base: ==4.*
  hspec: ==2.7.*
maintainer: fa-ml@ariis.it
synopsis: raster line drawing
changelog: |
  0.1.0.0
  -------

  - Released Tue 11 Jun 2019 20:35:43 CEST.
  - Added Bresenham's algorithm.
basic-deps:
  base: ==4.*
all-versions:
- 0.1.0.0
author: Francesco Ariis
latest: 0.1.0.0
description-type: haddock
description: |-
  Line drawing algorithms to approximate a
  line segment on discrete graphical media (raster).
  Currently just Bresenham algorithm.
license-name: BSD-3-Clause

homepage: ''
changelog-type: text
hash: 1d2b4f5b74ea06a0d2ccc2656cb1fee61e37a76f615d9698f28970f1878bb1d1
test-bench-deps:
  base: ==4.*
  hspec: ==2.7.*
maintainer: fa-ml@ariis.it
synopsis: raster line drawing
changelog: |
  0.2.0.0
  -------

  - Made `bresenham` polymorphic.
  - Released Sun 10 Nov 2019 15:13:29 CET.

  0.1.0.0
  -------

  - Released Tue 11 Jun 2019 20:35:43 CEST.
  - Added Bresenham's algorithm.
basic-deps:
  base: ==4.*
all-versions:
- 0.1.0.0
- 0.2.0.0
author: Francesco Ariis
latest: 0.2.0.0
description-type: text
description: |
  Various https://en.wikipedia.org/wiki/Line_drawing_algorithm
license-name: BSD-3-Clause

Update from Hackage at 2019-11-10T14:20:55Z
Update from Hackage at 2019-11-10T14:20:55Z
