Skip to content

Clarify the effective overload set algorithm. #390

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jul 30, 2017
Merged

Clarify the effective overload set algorithm. #390

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 3 additions & 0 deletions index.bs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2948,6 +2948,9 @@ the same operation or constructor.
(i.e., it is not marked as <code>optional</code> and is not
a final, variadic argument), then break this loop.
1. Otherwise, add to |S| the tuple &lt;|X|, |t|<sub>0..|i|−1</sub>, |o|<sub>0..|i|−1</sub>&gt;.

Note: if |i| is 0, this means to add to |S| the tuple &lt;|X|, « », « »&gt;
(where "« »" represents an [=list/is empty|empty list=]).
1. Set |i| to |i|−1.
1. The effective overload set is |S|.
</div>
Expand Down