File: simplify_concrete_substitutions.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-- 907 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
 
// RUN: %target-swift-frontend -typecheck %s -debug-generic-signatures 2>&1 | %FileCheck %s

// The rule
//
//   [P:Y].[concrete: G<τ_0_0, τ_0_1> with <[P:Z1], [P:Z2]>] => [P:Y]
//
// overlaps with [P].[P:Y] => [P], which applies the adjustment prepending
// [P] to [P:Z1] and [P:Z2], respectively.
//
// This produces the rule
//
//   [P:Y].[concrete: G<τ_0_0, τ_0_1> with <[P].[P:Z1], [P].[P:Z2]>] => [P:Y]
//
// When adding the rule, we have to simplify the concrete substitutions to
// reduce [P].[P:Z1] to [P:Z1] and [P].[P:Z2] to [P:Z2], respectively.

// CHECK-LABEL: simplify_concrete_substitutions.(file).P@
// CHECK-LABEL: Requirement signature: <Self where Self == Self.[P]X.[P]X, Self.[P]X : P, Self.[P]Y == G<Self.[P]Z1, Self.[P]Z2>>

protocol P {
  associatedtype X : P where X.X == Self
  associatedtype Y where Y == G<Z1, Z2>
  associatedtype Z1
  associatedtype Z2
}

struct G<T, U> {}