Issue Description:

Several default implementations in Collection and BidirectionalCollection are using a bound check that seems sub-optimal.

For instance here in Collection, the slice subscript default implementation:

_failEarlyRangeCheck(bounds, bounds: startIndex..<endIndex)

This creates a ClosedRange from the Collection startIndex and endIndex with the ..< operator which also checks for upperBound >= lowerBound which is always true since startIndex <= endIndex.

This check could be optimized in the same way as it is done in RandomAccessCollection default implementations, i.e. with the uncheckedBounds init:

_failEarlyRangeCheck(i, bounds: Range(uncheckedBounds: (startIndex, endIndex)))

There are other places where this optimization could be done (here, here, here, ... but also in BidirectionalCollection) since the bound check is already performed before.

However, this may not be a bug but intended as some (rare) collections can be initialized in an illformed state, like let range = Range(uncheckedBounds: (10, 0)) which then returns startIndex = 10 and endIndex = 0. IMO this kind of init is purposely unsafe and should not hamper performance elsewhere.

EDIT: The issue is also present in StrideTo and StrideThrough.