[stdlib] indexing model: Interval/Range merge

This is step 1; we still need to introduce ClosedRange.
This commit is contained in:
Dave Abrahams
2016-03-16 15:57:35 -07:00
parent 8c5cf9b4fc
commit f493b54e44
49 changed files with 431 additions and 633 deletions

View File

@@ -88,10 +88,10 @@ partitionDocComment = """\
/// Re-order the given `range` of elements in `self` and return
/// a pivot index *p*.
///
/// - Postcondition: For all *i* in `range.startIndex..<`\ *p*, and *j*
/// in *p*\ `..<range.endIndex`, `less(self[`\ *i*\ `],
/// - Postcondition: For all *i* in `range.lowerBound..<`\ *p*, and *j*
/// in *p*\ `..<range.upperBound`, `less(self[`\ *i*\ `],
/// self[`\ *j*\ `]) && !less(self[`\ *j*\ `], self[`\ *p*\ `])`.
/// Only returns `range.endIndex` when `self` is empty."""
/// Only returns `range.upperBound` when `self` is empty."""
orderingRequirementForPredicate = """\
/// - Precondition: `isOrderedBefore` is a