example: unbound slot k bounded [k, t.k] In previous binding algorithm, there are 2 candidate bindings, in which bounded k is exactly matched unbound slot k, it has higher priority than that of t1.k
39 lines
356 B
Plaintext
39 lines
356 B
Plaintext
-- This file is automatically generated. You should know what you did if you want to edit this
|
|
-- !select --
|
|
-3
|
|
-1
|
|
|
|
-- !select --
|
|
a 1
|
|
all 1
|
|
all 2
|
|
|
|
-- !select --
|
|
0
|
|
|
|
-- !bind_sort_scan --
|
|
3
|
|
1
|
|
2
|
|
|
|
-- !bind_sort_alias --
|
|
1
|
|
2
|
|
3
|
|
|
|
-- !bind_sort_aliasAndScan --
|
|
1
|
|
3
|
|
2
|
|
|
|
-- !bind_order_to_project_alias --
|
|
4 5
|
|
5 4
|
|
6 6
|
|
|
|
-- !bind_order_to_project_alias --
|
|
5 4
|
|
4 5
|
|
6 6
|
|
|