git.iko.soy/patch
on develop help sign in
Small spacing cleanup
8f3c186Cale Gibbard
src/Data/AppendMap.hs+7−7
compare with develop
unifiedsplit
@@ -324,13 +324,13 @@ isSubmapOf :: forall k a. (Ord k, Eq a) => AppendMap k a -> AppendMap k a -> Boo
324isSubmapOf = coerce (Map.isSubmapOf :: Map k a -> Map k a -> Bool)
324isSubmapOf = coerce (Map.isSubmapOf :: Map k a -> Map k a -> Bool)
325
325
326isSubmapOfBy :: forall k a b. Ord k => (a -> b -> Bool) -> AppendMap k a -> AppendMap k b -> Bool
326isSubmapOfBy :: forall k a b. Ord k => (a -> b -> Bool) -> AppendMap k a -> AppendMap k b -> Bool
327−isSubmapOfBy = coerce (Map.isSubmapOfBy:: (a -> b -> Bool) -> Map k a -> Map k b -> Bool)
327+isSubmapOfBy = coerce (Map.isSubmapOfBy :: (a -> b -> Bool) -> Map k a -> Map k b -> Bool)
328
328
329isProperSubmapOf :: forall k a. (Ord k, Eq a) => AppendMap k a -> AppendMap k a -> Bool
329isProperSubmapOf :: forall k a. (Ord k, Eq a) => AppendMap k a -> AppendMap k a -> Bool
330isProperSubmapOf = coerce (Map.isProperSubmapOf :: Map k a -> Map k a -> Bool)
330isProperSubmapOf = coerce (Map.isProperSubmapOf :: Map k a -> Map k a -> Bool)
331
331
332isProperSubmapOfBy :: forall k a b. Ord k => (a -> b -> Bool) -> AppendMap k a -> AppendMap k b -> Bool
332isProperSubmapOfBy :: forall k a b. Ord k => (a -> b -> Bool) -> AppendMap k a -> AppendMap k b -> Bool
333−isProperSubmapOfBy = coerce (Map.isProperSubmapOfBy:: (a -> b -> Bool) -> Map k a -> Map k b -> Bool)
333+isProperSubmapOfBy = coerce (Map.isProperSubmapOfBy :: (a -> b -> Bool) -> Map k a -> Map k b -> Bool)
334
334
335lookupIndex :: forall k a. Ord k => k -> AppendMap k a -> Maybe Int
335lookupIndex :: forall k a. Ord k => k -> AppendMap k a -> Maybe Int
336lookupIndex = coerce (Map.lookupIndex :: k -> Map k a -> Maybe Int)
336lookupIndex = coerce (Map.lookupIndex :: k -> Map k a -> Maybe Int)
@@ -366,16 +366,16 @@ deleteFindMax :: forall k a. AppendMap k a -> ((k, a), AppendMap k a)
366deleteFindMax = coerce (Map.deleteFindMax :: Map k a -> ((k, a), Map k a))
366deleteFindMax = coerce (Map.deleteFindMax :: Map k a -> ((k, a), Map k a))
367
367
368updateMin :: forall k a. (a -> Maybe a) -> AppendMap k a -> AppendMap k a
368updateMin :: forall k a. (a -> Maybe a) -> AppendMap k a -> AppendMap k a
369−updateMin = coerce (Map.updateMin:: (a -> Maybe a) -> Map k a -> Map k a)
369+updateMin = coerce (Map.updateMin :: (a -> Maybe a) -> Map k a -> Map k a)
370
370
371updateMax :: forall k a. (a -> Maybe a) -> AppendMap k a -> AppendMap k a
371updateMax :: forall k a. (a -> Maybe a) -> AppendMap k a -> AppendMap k a
372−updateMax = coerce (Map.updateMax:: (a -> Maybe a) -> Map k a -> Map k a)
372+updateMax = coerce (Map.updateMax :: (a -> Maybe a) -> Map k a -> Map k a)
373
373
374updateMinWithKey :: forall k a. (k -> a -> Maybe a) -> AppendMap k a -> AppendMap k a
374updateMinWithKey :: forall k a. (k -> a -> Maybe a) -> AppendMap k a -> AppendMap k a
375−updateMinWithKey = coerce (Map.updateMinWithKey:: (k -> a -> Maybe a) -> Map k a -> Map k a)
375+updateMinWithKey = coerce (Map.updateMinWithKey :: (k -> a -> Maybe a) -> Map k a -> Map k a)
376
376
377updateMaxWithKey :: forall k a. (k -> a -> Maybe a) -> AppendMap k a -> AppendMap k a
377updateMaxWithKey :: forall k a. (k -> a -> Maybe a) -> AppendMap k a -> AppendMap k a
378−updateMaxWithKey = coerce (Map.updateMaxWithKey:: (k -> a -> Maybe a) -> Map k a -> Map k a)
378+updateMaxWithKey = coerce (Map.updateMaxWithKey :: (k -> a -> Maybe a) -> Map k a -> Map k a)
379
379
380minView :: forall k a. AppendMap k a -> Maybe (a, AppendMap k a)
380minView :: forall k a. AppendMap k a -> Maybe (a, AppendMap k a)
381minView = coerce (Map.minView :: Map k a -> Maybe (a, Map k a))
381minView = coerce (Map.minView :: Map k a -> Maybe (a, Map k a))
@@ -393,7 +393,7 @@ showTree :: forall k a. (Show k, Show a) => AppendMap k a -> String
393showTree = coerce (Map.showTree :: (Show k, Show a) => Map k a -> String)
393showTree = coerce (Map.showTree :: (Show k, Show a) => Map k a -> String)
394
394
395showTreeWith :: forall k a. (k -> a -> String) -> Bool -> Bool -> AppendMap k a -> String
395showTreeWith :: forall k a. (k -> a -> String) -> Bool -> Bool -> AppendMap k a -> String
396−showTreeWith = coerce (Map.showTreeWith:: (k -> a -> String) -> Bool -> Bool -> Map k a -> String)
396+showTreeWith = coerce (Map.showTreeWith :: (k -> a -> String) -> Bool -> Bool -> Map k a -> String)
397
397
398valid :: forall k a. Ord k => AppendMap k a -> Bool
398valid :: forall k a. Ord k => AppendMap k a -> Bool
399valid = coerce (Map.valid :: Ord k => Map k a -> Bool)
399valid = coerce (Map.valid :: Ord k => Map k a -> Bool)