---

yaml
---
r: 284671
b: refs/heads/swift-5.1-branch-04-24-2019
c: ca44560
h: refs/heads/master
i:
  284669: e6e36d5
  284667: c73fe4d
  284663: e8b130c
  284655: 0ae9abf
  284639: 64347de
  284607: 654dd1f
  284543: ff7d609
  284415: 764befe
  284159: 5d96af4
  283647: 629dc2e
  282623: 76f0260

Author: lorentey

[refs]

@@ -1319,4 +1319,4 @@ refs/heads/revert-24065-raj-es-perf-bench: acd6c09b6bd8c5aa922845ee4465bf1333e4f
 refs/heads/rxwei-patch-3: d5f349dedfb5fcaf84c5ac788ad33ea47e502d11
 refs/heads/rxwei-patch-4: d60ed33a03d398b956e1aa81f37b04d0b1cf101e
 refs/heads/rxwei-patch-4-1: b7adfa58fd761906363d280fe323578f61097822
-refs/heads/swift-5.1-branch-04-24-2019: 7505c6a63ec40022db655ebebf84d5316c3ff71b
+refs/heads/swift-5.1-branch-04-24-2019: ca44560070b46f72c030c40188baee4687deaa75

branches/swift-5.1-branch-04-24-2019/stdlib/public/Darwin/Foundation/IndexPath.swift

@@ -662,32 +662,9 @@ public struct IndexPath : ReferenceConvertible, Equatable, Hashable, MutableColl
         return .orderedSame
     }
 
-    public var hashValue: Int { // FIXME(hashValue): Remove
-        func hashIndexes(first: Int, last: Int, count: Int) -> Int {
-            let totalBits = MemoryLayout<Int>.size * 8
-            let lengthBits = 8
-            let firstIndexBits = (totalBits - lengthBits) / 2
-            return count &+ (first << lengthBits) &+ (last << (lengthBits + firstIndexBits))
-        }
-
-        switch _indexes {
-            case .empty: return 0
-            case .single(let index): return index.hashValue
-            case .pair(let first, let second):
-                return hashIndexes(first: first, last: second, count: 2)
-            default:
-                let cnt = _indexes.count
-                return hashIndexes(first: _indexes[0], last: _indexes[cnt - 1], count: cnt)
-        }
-    }
-
     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. (This is intentionally different
-	      // from `hashValue` above, which only depends on the first and last
-	      // index. `Set` and `Dictionary` relies on `hash(into:)` rather than
-	      // `hashValue` -- the latter definition is only kept for compatibility
-	      // with existing code that may depend on it.)
+	      // 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.