Commitf45a8b5

committed

wip: lattice overhaul step 3: simplify lattice comparisons

1 parent269a1c7 commitf45a8b5Copy full SHA for f45a8b5

File tree

-5

lines changed

-5

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1696,7 +1696,7 @@ function abstract_eval_statement(interp::AbstractInterpreter, @nospecialize(e),`
`1696`	`1696`	`end`
`1697`	`1697`	`if!anyrefine`
`1698`	`1698`	`anyrefine=has_nontrivial_const_info(at)\|\|# constant information`
`1699`		`- at⋤ ft# just a type-level information, but more precise than the declared type`
	`1699`	`+ at⋤ₜ ft# just a type-level information, but more precise than the declared type`
`1700`	`1700`	`end`
`1701`	`1701`	`ats[i-1]= at`
`1702`	`1702`	`end`

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -473,20 +473,20 @@ The non-strict partial order over the type inference lattice.`
`473`	`473`	`end`
`474`	`474`
`475`	`475`	`"""`
`476`		`- a ⊏ b -> Bool`
	`476`	`+ a::LatticeElement ⊏ b::LatticeElement -> Bool`
`477`	`477`
`478`	`478`	`The strict partial order over the type inference lattice.`
`479`	`479`	This is defined as the irreflexive kernel of `⊑`.
`480`	`480`	`"""`
`481`		`-@nospecialize(a)⊏@nospecialize(b)= a⊑ b&&!⊑(b, a)`
	`481`	`+a::LatticeElement⊏b::LatticeElement= a⊑ b&&!⊑(b, a)`
`482`	`482`
`483`	`483`	`"""`
`484`		`- a ⋤ b -> Bool`
	`484`	`+ a::LatticeElement ⋤ b::LatticeElement -> Bool`
`485`	`485`
`486`	`486`	This order could be used as a slightly more efficient version of the strict order `⊏`,
`487`	`487`	where we can safely assume `a ⊑ b` holds.
`488`	`488`	`"""`
`489`		`-@nospecialize(a)⋤@nospecialize(b)=!⊑(b, a)`
	`489`	`+a::LatticeElement⋤b::LatticeElement=!⊑(b, a)`
`490`	`490`
`491`	`491`	`a::LatticeElement⊑ₜ@nospecialize(b#=::Type=#)=widenconst(a)<:b`
`492`	`492`	`a::LatticeElement⊏ₜ@nospecialize(b#=::Type=#)=widenconst(a)<:b&&!(b<:widenconst(a))`

Comments

(0)