homepage: ''
changelog-type: ''
hash: 335dfb5b5211e3eae64451448e1bca74c43655b613d69a500611997131404fd6
test-bench-deps: {}
maintainer: Lennart Augustsson
synopsis: Random access list with a list compatible interface.
changelog: ''
basic-deps:
  base: ! '>=3 && <6'
all-versions:
- '0.1.0.0'
author: Lennart Augustsson
latest: '0.1.0.0'
description-type: haddock
description: ! 'Random access list with a list compatible interface.

  Random access list have same complexity as lists with some exceptions,

  the notable one being that (!!) is O(log n) instead of O(n).

  RALists have to be finite.'
license-name: BSD3

homepage: http://github.com/cartazio/ralist
changelog-type: ''
hash: 0f424f9fa686faa9ba12ca833e06d2fad226d4af835e4acef839324e10c03253
test-bench-deps:
  base: -any
  hspec: ! '>=2.2 && <2.3'
  criterion: -any
  deepseq: -any
  ralist: -any
maintainer: Carter Schonwald
synopsis: Random access list with a list compatible interface.
changelog: ''
basic-deps:
  fail: ==4.9.*
  base: ! '>=3 && <6'
  semigroups: ==0.18.*
all-versions:
- '0.1.0.0'
- '0.2.0.0'
author: Lennart Augustsson, Carter Schonwald
latest: '0.2.0.0'
description-type: haddock
description: ! 'Random access list with a list compatible interface.

  Random access list have same complexity as lists with some exceptions,

  the notable one being that (!!) is O(log n) instead of O(n).

  RALists have to be finite.'
license-name: BSD3

Update from Hackage at 2017-04-17T19:31:38Z
Update from Hackage at 2017-04-17T19:31:38Z
