File: recursive_concrete_constraints.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 (34 lines) | stat: -rw-r--r-- 691 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
28
29
30
31
32
33
34
 
// RUN: %target-typecheck-verify-swift

struct S<A: Collection> : Collection where A.Index == Int {
  typealias Element = A.Iterator.Element
  typealias Index = A.Index
  
  init(base: A, baseRange: Range<Index>) {
    self.base = base
    self.baseRange = baseRange
  }
  
  var startIndex: Index {
    return Int(0)
  }
  
  var endIndex: Index {
    return baseRange.count
  }

  func index(after i: Index) -> Index {
    return base.index(after: i)
  }
  
  subscript(i: Index) -> Element {
    return base[baseRange.lowerBound + i]
  }
  
  func makeIterator() -> IndexingIterator<S> {
    return IndexingIterator(_elements: self)
  }
  
  var base: A
  var baseRange: Range<A.Index>
}