[Foundation] Fix bizarre indentation issues

Author: lorentey

stdlib/public/Darwin/Foundation/Calendar.swift

@@ -901,13 +901,13 @@ public struct Calendar : Hashable, Equatable, ReferenceConvertible, _MutableBoxi
 
     public func hash(into hasher: inout Hasher) {
         // We need to make sure autoupdating calendars have the same hash
-	      if _autoupdating {
+        if _autoupdating {
             hasher.combine(false)
-	      } else {
+        } else {
             hasher.combine(true)
-	          hasher.combine(_handle.map { $0 })
-	      }
-	  }
+            hasher.combine(_handle.map { $0 })
+        }
+    }
 
     // MARK: -
     // MARK: Conversion Functions

stdlib/public/Darwin/Foundation/IndexPath.swift

@@ -663,29 +663,29 @@ public struct IndexPath : ReferenceConvertible, Equatable, Hashable, MutableColl
     }
 
     public func hash(into hasher: inout Hasher) {
-	      // Note: We compare all indices in ==, so for proper hashing, we must
-	      // also feed them all to the hasher.
-	      //
-	      // To ensure we have unique hash encodings in nested hashing contexts,
-	      // we combine the count of indices as well as the indices themselves.
-	      // (This matches what Array does.)
-	      switch _indexes {
-	      case .empty:
-	          hasher.combine(0)
-	      case let .single(index):
-	          hasher.combine(1)
-	          hasher.combine(index)
-	      case let .pair(first, second):
-	          hasher.combine(2)
-	          hasher.combine(first)
-	          hasher.combine(second)
-	      case let .array(indexes):
-	          hasher.combine(indexes.count)
-	          for index in indexes {
-	              hasher.combine(index)
-	          }
-	      }
-	  }
+        // Note: We compare all indices in ==, so for proper hashing, we must
+        // also feed them all to the hasher.
+        //
+        // To ensure we have unique hash encodings in nested hashing contexts,
+        // we combine the count of indices as well as the indices themselves.
+        // (This matches what Array does.)
+        switch _indexes {
+        case .empty:
+            hasher.combine(0)
+        case let .single(index):
+            hasher.combine(1)
+            hasher.combine(index)
+        case let .pair(first, second):
+            hasher.combine(2)
+            hasher.combine(first)
+            hasher.combine(second)
+        case let .array(indexes):
+            hasher.combine(indexes.count)
+            for index in indexes {
+                hasher.combine(index)
+            }
+        }
+    }
 
     // MARK: - Bridging Helpers