@hackage stable-heap dependencies

9 results

library:stable-heap (1 dependencies)

@haskell/base

Core data structures and operations

BSD-3-Clause>=4.8 && <4.9

benchmark:bench (8 dependencies)

@haskell/vector

Efficient Arrays

BSD-3-Clause>=0.10

@haskell/base

Core data structures and operations

BSD-3-Clause>=4.8 && <4.9

@hackage/stable-heap

Purely functional stable heaps (fair priority queues)

@hackage/pqueue

Reliable, persistent, fast priority queues.

BSD-3-Clause>=1.2

@hackage/mwc-random

Fast, high quality pseudo random number generation

BSD-2-Clause>=0.13

@hackage/heaps

Asymptotically optimal Brodal/Okasaki heaps.

BSD-3-Clause>=0.3

@hackage/fingertree

Generic finger-tree structure, with example instances

BSD-3-Clause>=0.1

@hackage/criterion

Robust, reliable performance measurement and analysis

BSD-3-Clause>=1.1