//===----------------------------------------------------------------------===// // // This source file is part of the Swift.org open source project // // Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors // Licensed under Apache License v2.0 with Runtime Library Exception // // See https://swift.org/LICENSE.txt for license information // See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors // //===----------------------------------------------------------------------===// /// Returns the lesser of two comparable values. /// /// - Parameters: /// - x: A value to compare. /// - y: Another value to compare. /// - Returns: The lesser of `x` and `y`. If `x` is equal to `y`, returns `x`. @_inlineable public func min(_ x: T, _ y: T) -> T { // In case `x == y` we pick `x`. // This preserves any pre-existing order in case `T` has identity, // which is important for e.g. the stability of sorting algorithms. // `(min(x, y), max(x, y))` should return `(x, y)` in case `x == y`. return y < x ? y : x } /// Returns the least argument passed. /// /// - Parameters: /// - x: A value to compare. /// - y: Another value to compare. /// - z: A third value to compare. /// - rest: Zero or more additional values. /// - Returns: The least of all the arguments. If there are multiple equal /// least arguments, the result is the first one. @_inlineable public func min(_ x: T, _ y: T, _ z: T, _ rest: T...) -> T { var minValue = min(min(x, y), z) // In case `value == minValue`, we pick `minValue`. See min(_:_:). for value in rest where value < minValue { minValue = value } return minValue } /// Returns the greater of two comparable values. /// /// - Parameters: /// - x: A value to compare. /// - y: Another value to compare. /// - Returns: The greater of `x` and `y`. If `x` is equal to `y`, returns `y`. @_inlineable public func max(_ x: T, _ y: T) -> T { // In case `x == y`, we pick `y`. See min(_:_:). return y >= x ? y : x } /// Returns the greatest argument passed. /// /// - Parameters: /// - x: A value to compare. /// - y: Another value to compare. /// - z: A third value to compare. /// - rest: Zero or more additional values. /// - Returns: The greatest of all the arguments. If there are multiple equal /// greatest arguments, the result is the last one. @_inlineable public func max(_ x: T, _ y: T, _ z: T, _ rest: T...) -> T { var maxValue = max(max(x, y), z) // In case `value == maxValue`, we pick `value`. See min(_:_:). for value in rest where value >= maxValue { maxValue = value } return maxValue } /// The iterator for `EnumeratedSequence`. /// /// An instance of `EnumeratedIterator` wraps a base iterator and yields /// successive `Int` values, starting at zero, along with the elements of the /// underlying base iterator. The following example enumerates the elements of /// an array: /// /// var iterator = ["foo", "bar"].enumerated().makeIterator() /// iterator.next() // (0, "foo") /// iterator.next() // (1, "bar") /// iterator.next() // nil /// /// To create an instance of `EnumeratedIterator`, call /// `enumerated().makeIterator()` on a sequence or collection. @_fixed_layout public struct EnumeratedIterator< Base : IteratorProtocol > : IteratorProtocol, Sequence { @_versioned internal var _base: Base @_versioned internal var _count: Int /// Construct from a `Base` iterator. @_inlineable @_versioned internal init(_base: Base) { self._base = _base self._count = 0 } /// The type of element returned by `next()`. public typealias Element = (offset: Int, element: Base.Element) /// Advances to the next element and returns it, or `nil` if no next element /// exists. /// /// Once `nil` has been returned, all subsequent calls return `nil`. @_inlineable public mutating func next() -> Element? { guard let b = _base.next() else { return nil } let result = (offset: _count, element: b) _count += 1 return result } } /// An enumeration of the elements of a sequence or collection. /// /// `EnumeratedSequence` is a sequence of pairs (*n*, *x*), where *n*s are /// consecutive `Int` values starting at zero, and *x*s are the elements of a /// base sequence. /// /// To create an instance of `EnumeratedSequence`, call `enumerated()` on a /// sequence or collection. The following example enumerates the elements of /// an array. /// /// var s = ["foo", "bar"].enumerated() /// for (n, x) in s { /// print("\(n): \(x)") /// } /// // Prints "0: foo" /// // Prints "1: bar" @_fixed_layout public struct EnumeratedSequence : Sequence { @_versioned internal var _base: Base /// Construct from a `Base` sequence. @_inlineable @_versioned internal init(_base: Base) { self._base = _base } /// Returns an iterator over the elements of this sequence. @_inlineable public func makeIterator() -> EnumeratedIterator { return EnumeratedIterator(_base: _base.makeIterator()) } } @available(*, unavailable, renamed: "EnumeratedIterator") public struct EnumerateGenerator { } @available(*, unavailable, renamed: "EnumeratedSequence") public struct EnumerateSequence {} extension EnumeratedIterator { @available(*, unavailable, message: "use the 'enumerated()' method on the sequence") public init(_ base: Base) { Builtin.unreachable() } } extension EnumeratedSequence { @available(*, unavailable, message: "use the 'enumerated()' method on the sequence") public init(_ base: Base) { Builtin.unreachable() } }