Updating for next release

recursion-ninja · Jul 21, 2019 · a9c4a1e · a9c4a1e
1 parent f1706a1
commit a9c4a1e
Show file tree

Hide file tree

Showing 3 changed files with 10 additions and 2 deletions.
diff --git a/bv-little.cabal b/bv-little.cabal
@@ -1,5 +1,5 @@
 name:                bv-little
-version:             1.0.1
+version:             1.1.0
 synopsis:            Efficient little-endian bit vector library
 category:            Data, Bit Vectors
 license:             BSD3

diff --git a/changelog.md b/changelog.md
@@ -2,6 +2,11 @@
 
   * None
 
+### [v1.1.0][5]
+
+  * Added `rank` and `select` functions
+
+
 ### [v1.0.1][4]
 
   * Correcting Eq instance to test for value equality and not construction equality
@@ -72,3 +77,4 @@
 [2]: https://github.com/recursion-ninja/bv-little/tree/v0.1.2
 [3]: https://github.com/recursion-ninja/bv-little/tree/v1.0.0
 [4]: https://github.com/recursion-ninja/bv-little/tree/v1.0.1
+[5]: https://github.com/recursion-ninja/bv-little/tree/v1.1.0
diff --git a/src/Data/BitVector/LittleEndian.hs b/src/Data/BitVector/LittleEndian.hs
@@ -42,7 +42,9 @@
 -- convert the 'BitVector' using either 'toSignedNumber' or 'toUnsignedNumber'.
 --
 -- This module defines 'rank' and 'select' operations for 'BitVector' as a
--- succinct data structure. 
+-- succinct data structure. These operations are not /o(1)/ so 'BitVector' is
+-- not a true/ succinct data structure. However, it could potentially be extend
+-- to support this in the future.
 -----------------------------------------------------------------------------
 
 {-# LANGUAGE BangPatterns       #-}