Fixing linting issues.

profile/src/Main.idr

@@ -323,7 +323,7 @@ bench = Group "containers"
       [ Single "1"      (basic createSortedSet 0)
       , Single "100"    (basic createSortedSet 99)
       , Single "1000"   (basic createSortedSet 999)
-      ]      
+      ]
   , Group "insertMap"
       [ Single "10"      (basic insertMap 0)
       ]

src/Data/Map.idr

@@ -1329,7 +1329,7 @@ fromList xs =
         in case rest of
              []                =>
                assert_total $ idris_crash "Unexpected empty list"
-             (middle :: right) => 
+             (middle :: right) =>
                (left, middle, right, len)
     -- Build a balanced tree from a non-empty list
     buildBalancedTree : List1 (k, v) -> Nat -> Map k v

src/Data/Map/Internal.idr

@@ -50,7 +50,7 @@ singleton k x = Bin 1 k x Tip Tip
 export
 size : Map k v -> Nat
 size Tip             = 0
-size (Bin _ _ _ l r) = 1 + size l + size r 
+size (Bin _ _ _ l r) = 1 + size l + size r
 
 --------------------------------------------------------------------------------
 --          Map Internals

src/Data/Set.idr

@@ -603,7 +603,7 @@ partial
 findMin : Set a -> a
 findMin t =
   case lookupMin t of
-    Just r  => r 
+    Just r  => r
     Nothing => assert_total $ idris_crash "Set.findMin: empty set has no minimal element"
 
 ||| The maximal element of the set. Calls idris_crash if the set is empty. O(log n)
@@ -724,7 +724,7 @@ intersection t1@(Bin _ x l1 r1) t2  =
   let (l2,x',r2) = splitMember x t2
       l1l2       = intersection l1 l2
       r1r2       = intersection r1 r2
-    in case x' of 
+    in case x' of
          True  =>
            case l1l2 == l1 && r1r2 == r1 of
              True  =>
@@ -790,7 +790,7 @@ fromList xs =
         in case rest of
              []                =>
                assert_total $ idris_crash "Unexpected empty list"
-             (middle :: right) => 
+             (middle :: right) =>
                (left, middle, right, len)
     -- Build a balanced tree from a non-empty list
     buildBalancedTree : List1 a -> Nat -> Set a

src/Data/Set/Internal.idr

@@ -40,7 +40,7 @@ singleton x = Bin 1 x Tip Tip
 export
 size : Set a -> Nat
 size Tip           = 0
-size (Bin _ _ l r) = 1 + size l + size r 
+size (Bin _ _ l r) = 1 + size l + size r
 
 --------------------------------------------------------------------------------
 --          Set Internals
@@ -197,7 +197,7 @@ minViewSure : a -> Set a -> Set a -> (a,Set a)
 minViewSure x Tip              r = (x,r)
 minViewSure x (Bin _ xl ll lr) r =
   case minViewSure xl ll lr of
-    (xm, l') => 
+    (xm, l') =>
       (xm, balanceR x l' r)
 
 export