Remove redundant guards

Author: rockbmb

Data/HashMap/Base.hs

@@ -266,9 +266,8 @@ instance (Eq k, Eq v) => Eq (HashMap k v) where
 
 equal :: (k -> k' -> Bool) -> (v -> v' -> Bool)
       -> HashMap k v -> HashMap k' v' -> Bool
-equal eqk eqv (HashMap s1 t1) (HashMap s2 t2)
-    | s1 == s2  = go (toList' t1 []) (toList' t2 [])
-    | otherwise = False
+equal eqk eqv (HashMap s1 t1) (HashMap s2 t2) =
+    (s1 == s2) && go (toList' t1 []) (toList' t2 [])
   where
     -- If the two trees are the same, then their lists of 'Leaf's and
     -- 'Collision's read from left to right should be the same (modulo the
@@ -329,9 +328,8 @@ cmp cmpk cmpv (HashMap _ t1) (HashMap _ t2) =
 
 -- Same as 'equal' but doesn't compare the values.
 equalKeys :: (k -> k' -> Bool) -> HashMap k v -> HashMap k' v' -> Bool
-equalKeys eq (HashMap s1 t1) (HashMap s2 t2)
-    | s1 == s2  = go (toList' t1 []) (toList' t2 [])
-    | otherwise = False
+equalKeys eq (HashMap s1 t1) (HashMap s2 t2) =
+    (s1 == s2) && go (toList' t1 []) (toList' t2 [])
   where
     go (Leaf k1 l1 : tl1) (Leaf k2 l2 : tl2)
       | k1 == k2 && leafEq l1 l2