homepage: https://gitlab.com/fosskers/bounded-queue
changelog-type: ''
hash: b127b7e4d6c6f11f75fbb2a36d55aa54666e80925496592e995756322c92150b
test-bench-deps:
  bounded-queue: -any
  base: ! '>=4.7 && <5'
  tasty-hunit: ! '>=0.10'
  tasty: ! '>=1.2'
maintainer: colin@kadena.io
synopsis: A strict, immutable, thread-safe, single-ended, bounded queue.
changelog: ''
basic-deps:
  base: ! '>=4.7 && <5'
  containers: -any
  deepseq: -any
all-versions:
- 1.0.0
author: Colin Woodbury
latest: 1.0.0
description-type: markdown
description: |
  # bounded-queue

  This library provides a strict, immutable, thread-safe, single-ended, bounded
  queue. When the insert limit is reached and a `cons` is attempted, this `BQueue`
  automatically drops old entries off its end. Thus, writes always succeed and
  never block.

  This data structure is intended as a "sliding window" over some stream of data,
  where we wish old entries to be naturally forgotten. Since this is an immutable
  data structure and not a concurrent queue, we provide instances for the usual
  useful typeclasses with which one can perform analysis over the entire "window".
license-name: BSD-3-Clause

Update from Hackage at 2019-05-06T22:59:29Z
Update from Hackage at 2019-05-06T22:59:29Z
