binary-list 0.3.4.0 → 0.3.4.1

raw patch · 2 files changed

+4/−4 lines, 2 files

Files

• Data/BinaryList.hs +3/−3
• binary-list.cabal +1/−1

@@ -133,9 +133,9 @@     go i (ListNode n l r) =       let m = 2^(n-1)       in  if i < m-             then ListNode (go i l)          r-             else ListNode       l (go (i-m) r)-    go 0 (ListEnd x) = ListEnd y+             then ListNode n (go i l)          r+             else ListNode n       l (go (i-m) r)+    go 0 (ListEnd _) = ListEnd y     go _ e = e  -- | /O(1)/. Append two binary lists. This is only possible

@@ -1,5 +1,5 @@ name:                binary-list-version:             0.3.4.0+version:             0.3.4.1 synopsis:            Lists of size length a power of two. description:         Implementation of lists whose number of elements is a                      power of two. Binary lists have this property by definition,