File: SortedCollectionAPIChecker.swift

package info (click to toggle)
swiftlang 6.1.3-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 2,791,532 kB
  • sloc: cpp: 9,901,743; ansic: 2,201,431; asm: 1,091,827; python: 308,252; objc: 82,166; f90: 80,126; lisp: 38,358; pascal: 25,559; sh: 20,429; ml: 5,058; perl: 4,745; makefile: 4,484; awk: 3,535; javascript: 3,018; xml: 918; fortran: 664; cs: 573; ruby: 396
file content (33 lines) | stat: -rw-r--r-- 1,228 bytes parent folder | download | duplicates (2)
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
28
29
30
31
32
33
//===----------------------------------------------------------------------===//
//
// 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
//
//===----------------------------------------------------------------------===//

#if COLLECTIONS_SINGLE_MODULE
import Collections
#else
import InternalCollectionsUtilities
#endif

/// This protocol simply lists Collection/Sequence extensions that ought to be
/// customized for sorted collections.
///
/// Conforming to this protocol admittedly doesn't do much, as the default
/// implementations already exist for most of these requirements
/// (but they aren't doing the right thing).
public protocol SortedCollectionAPIChecker: Collection, _SortedCollection
where Element: Comparable {
  // This one actually does not come with a default implementation.
  func sorted() -> Self

  // These are also defined on `Sequence`, but the default implementation does
  // a linear search, which isn't what we want.
  func min() -> Element?
  func max() -> Element?
}