homepage: https://github.com/treeowl/compact-sequences/
changelog-type: markdown
hash: 3e7484046d7bf2421fc2beddd64152cf1084313f6f67af7509e1de96be4eadc9
test-bench-deps:
  base: '>=4.10.0.0'
maintainer: David.Feuer@gmail.com
synopsis: Stacks and queues with compact representations.
changelog: |
  # Revision history for compact-sequences

  ## 0.1.0.0 -- 2020-08-11

  * First version. Released on an unsuspecting world.
basic-deps:
  base: '>=4.10.0.0 && <5.0'
  containers: -any
  transformers: -any
  primitive: -any
all-versions:
- 0.1.0.0
author: David Feuer
latest: 0.1.0.0
description-type: haddock
description: |-
  Stacks and queues that take n + O(log n) space at the cost of
  having amortized O(log n) time complexity for basic operations.
license-name: BSD-3-Clause

homepage: https://github.com/treeowl/compact-sequences/
changelog-type: markdown
hash: 7c5ab8142b42cefd15c819bc029c32bb4895c158e87b19385abeeaf2fad3931b
test-bench-deps:
  base: '>=4.10.0.0'
  tasty-quickcheck: -any
  tasty: -any
  QuickCheck: -any
  compact-sequences: -any
maintainer: David.Feuer@gmail.com
synopsis: Stacks, queues, and deques with compact representations.
changelog: |
  # Revision history for compact-sequences

  ## 0.2.0.0 -- 2020-09-01

  * Add deques.
  * Change operator precedence.
  * Add a test suite. Thanks to David Himmelstrup for setting up the test and CI framework.
  * Clean up internals somewhat.
  * Add a proof of amortized bounds for the stack implementation. Thanks, Li-Yao Xia.

  ## 0.1.0.0 -- 2020-08-11

  * First version. Released on an unsuspecting world.
basic-deps:
  base: '>=4.11.0.0 && <5.0'
  mtl: -any
  transformers: -any
  primitive: '>=0.6.4.0'
all-versions:
- 0.1.0.0
- 0.2.0.0
author: David Feuer
latest: 0.2.0.0
description-type: haddock
description: |-
  Stacks, queues, and deques that take n + O(log n) space at the cost of
  having amortized O(log n) time complexity for basic operations.
license-name: BSD-3-Clause

Update from Hackage at 2020-09-01T20:27:47Z
Update from Hackage at 2020-09-01T20:27:47Z
