diff --git a/CHANGELOG.md b/CHANGELOG.md
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -1,3 +1,8 @@
+1.4.11
+
+* Fix doctest failure when built against newer versions of the `hashable`
+  package
+
 1.4.10
 
 * Fix space leaks in `scan` / `scanM`
diff --git a/foldl.cabal b/foldl.cabal
--- a/foldl.cabal
+++ b/foldl.cabal
@@ -1,5 +1,5 @@
 Name: foldl
-Version: 1.4.10
+Version: 1.4.11
 Cabal-Version: >=1.10
 Build-Type: Simple
 License: BSD3
@@ -25,7 +25,7 @@
     HS-Source-Dirs: src
     Build-Depends:
         base         >= 4.8      && < 5   ,
-        bytestring   >= 0.9.2.1  && < 0.11,
+        bytestring   >= 0.9.2.1  && < 0.12,
         mwc-random   >= 0.13.1.0 && < 0.16,
         primitive                   < 0.8 ,
         text         >= 0.11.2.0 && < 1.3 ,
diff --git a/src/Control/Foldl.hs b/src/Control/Foldl.hs
--- a/src/Control/Foldl.hs
+++ b/src/Control/Foldl.hs
@@ -978,8 +978,8 @@
 
 {- | Given a 'Fold', produces a 'HashMap' which applies that fold to each @a@ separated by key @k@.
 
->>> fold (foldByKeyHashMap Control.Foldl.sum) [("a",1), ("b",2), ("b",20), ("a",10)]
-fromList [("a",11),("b",22)]
+>>> List.sort (HashMap.toList (fold (foldByKeyHashMap Control.Foldl.sum) [("a",1), ("b",2), ("b",20), ("a",10)]))
+[("a",11),("b",22)]
 -}
 foldByKeyHashMap :: forall k a b. (Hashable k, Eq k) => Fold a b -> Fold (k, a) (HashMap k b)
 foldByKeyHashMap f = case f of