diff --git a/README.md b/README.md --- a/README.md +++ b/README.md @@ -1,8 +1,10 @@ -# type-indexed-heaps -## Heaps with verified and unverified versions. +# type-indexed-queues +## Queues and Heaps with verified and unverified versions. -[![Build Status](https://travis-ci.com/oisdk/type-indexed-heaps.svg?token=fXdGpZwjFQ87pr9zynKX&branch=master)](https://travis-ci.com/oisdk/type-indexed-heaps) +[![Hackage](https://img.shields.io/hackage/v/type-indexed-queues.svg)](https://hackage.haskell.org/package/type-indexed-queues) [![Build Status](https://travis-ci.org/oisdk/type-indexed-queues.svg?branch=master)](https://travis-ci.org/oisdk/type-indexed-queues) + + This library provides implementations of five different heaps (binomial, pairing, skew, leftist, and Braun), each in two flavours: one verified, and one not. @@ -98,5 +100,5 @@ ## Uses of verified heaps The main interesting use of these sturctures is total traversable sorting ([sort-traversable](https://github.com/treeowl/sort-traversable)). -An implementation of this is provided in Data.Traversable.Sort. I'm +An implementation of this is provided in Data.Traversable.Parts. I'm interested in finding out other uses for these kinds of structures. diff --git a/type-indexed-queues.cabal b/type-indexed-queues.cabal --- a/type-indexed-queues.cabal +++ b/type-indexed-queues.cabal @@ -1,5 +1,5 @@ name: type-indexed-queues -version: 0.1.0.0 +version: 0.1.0.1 synopsis: Queues with verified and unverified versions. description: This library provides implementations of five different queues @@ -7,6 +7,9 @@ flavours: one verified, and one not. . At the moment, only structural invariants are maintained. + . + More information, and a walkthough of a couple implementations, can + be found at this . . = Comparisons of verified and unverified queues Both versions of each queue are provided for comparison: for