cosmetic: two whitespace violations

Author: jamesmckinna

src/Data/List/Properties.agda

@@ -872,7 +872,7 @@ module _ {R : Rel A p} (R? : B.Decidable R) where
   length-derun : ∀ xs → length (derun R? xs) ≤ length xs
   length-derun [] = ≤-refl
   length-derun (x ∷ []) = ≤-refl
-  length-derun (x ∷ y ∷ xs) with ih ← length-derun (y ∷ xs) | does (R? x y) 
+  length-derun (x ∷ y ∷ xs) with ih ← length-derun (y ∷ xs) | does (R? x y)
   ... | true  = m≤n⇒m≤1+n ih
   ... | false = s≤s ih
 

src/Data/Nat/Combinatorics.agda

@@ -12,7 +12,7 @@ open import Data.Nat.Base
 open import Data.Nat.DivMod
 open import Data.Nat.Divisibility
 open import Data.Nat.Properties
-open import Relation.Binary.Definitions 
+open import Relation.Binary.Definitions
 open import Relation.Binary.PropositionalEquality
   using (_≡_; refl; sym; cong; subst)
 
@@ -118,7 +118,7 @@ module _ {n k} (k<n : k < n) where
 
     [n-k]!           = [n-k] !
     [n-k-1]!         = [n-k-1] !
-  
+
     [n-k]≡1+[n-k-1]  : [n-k] ≡ suc [n-k-1]
     [n-k]≡1+[n-k-1]  = +-∸-assoc 1 k<n