File: _SortedCollection.swift

package info (click to toggle)
swiftlang 6.0.3-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 2,519,992 kB
  • sloc: cpp: 9,107,863; ansic: 2,040,022; asm: 1,135,751; python: 296,500; objc: 82,456; f90: 60,502; lisp: 34,951; pascal: 19,946; sh: 18,133; perl: 7,482; ml: 4,937; javascript: 4,117; makefile: 3,840; awk: 3,535; xml: 914; fortran: 619; cs: 573; ruby: 573
file content (27 lines) | stat: -rw-r--r-- 1,231 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
//===----------------------------------------------------------------------===//
//
// This source file is part of the Swift Collections open source project
//
// Copyright (c) 2022 - 2024 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
//
//===----------------------------------------------------------------------===//

/// A Collection type that is guaranteed to contain elements in monotonically
/// increasing order. (Duplicates are still allowed unless the collection
/// also conforms to `_UniqueCollection`.)
///
/// Types conforming to this protocol must also conform to `Collection`,
/// with an `Element` type that conforms to `Comparable`.
/// (However, this protocol does not specify these as explicit requirements,
/// to allow simple conformance tests such as `someValue is _SortedCollection`
/// to be possible.)
///
/// For any two valid indices `i` and `j` for a conforming collection `c`
/// (both below the end index), it must hold true that if `i < j`, then
/// `c[i] <= c[j]`.
public protocol _SortedCollection {}

extension Slice: _SortedCollection where Base: _SortedCollection {}