stable-heap-0.2.1.0: stable-heap.cabal
name: stable-heap
version: 0.2.1.0
synopsis: Purely functional stable heaps (fair priority queues)
description:
This library provides a purely functional implementation of
stable heaps (fair priority queues). The data structure is a
cousin of the pairing heap which maintains a sequential
ordering of the keys. Insertion can be to either end of the
heap, as though it is a deque, and it can be split on the
left-most occurrence of the minimum key.
.
The current state of the package is fairly barebones. It will
be fleshed out later.
license: MIT
license-file: LICENSE
author: Jake McArthur
maintainer: Jake.McArthur@gmail.com
copyright: Copyright (C) 2015-2016 Jake McArthur
homepage: http://hub.darcs.net/jmcarthur/stable-heap
bug-reports: http://hub.darcs.net/jmcarthur/stable-heap/issues
category: Data Structures
build-type: Simple
cabal-version: >=1.10
stability: experimental
tested-with: GHC ==7.8.4,
GHC ==7.10.3,
GHC ==8.0.2,
GHC ==8.2.2,
GHC ==8.4.4,
GHC ==8.6.5,
GHC ==8.8.4,
GHC ==8.10.7,
GHC ==9.0.2,
GHC ==9.2.7,
GHC ==9.4.4,
GHC ==9.6.1
library
exposed-modules: Data.Heap.Stable
build-depends: base >=4.7 && <4.19
hs-source-dirs: src
default-language: Haskell2010
other-extensions: DeriveTraversable, Trustworthy, TypeFamilies
test-suite test
type: exitcode-stdio-1.0
hs-source-dirs: test
build-depends: base,
QuickCheck,
stable-heap,
tasty,
tasty-quickcheck,
transformers
main-is: Test.hs
default-language: Haskell2010
benchmark bench
type: exitcode-stdio-1.0
hs-source-dirs: bench
build-depends: base >=4.7 && <4.19,
criterion >= 1.1,
fingertree >= 0.1,
heaps >= 0.3,
mwc-random >= 0.13,
pqueue >= 1.2,
stable-heap,
vector >= 0.10
main-is: Bench.hs
default-language: Haskell2010
source-repository head
type: git
location: https://github.com/jmcarthur/stable-heap.git
source-repository this
type: git
location: https://github.com/jmcarthur/stable-heap.git
tag: v0.2.1.0